1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
package common
import (
"math/big"
"golang.org/x/crypto/sha3"
"github.com/dexon-foundation/decimal"
"github.com/dexon-foundation/dexon/common"
"github.com/dexon-foundation/dexon/core/vm"
"github.com/dexon-foundation/dexon/core/vm/sqlvm/schema"
"github.com/dexon-foundation/dexon/crypto"
"github.com/dexon-foundation/dexon/rlp"
)
// Constants for path keys.
var (
pathCompTables = []byte("tables")
pathCompPrimary = []byte("primary")
pathCompIndices = []byte("indices")
pathCompSequence = []byte("sequence")
pathCompOwner = []byte("owner")
pathCompWriters = []byte("writers")
pathCompReverseIndices = []byte("reverse_indices")
)
// Storage holds SQLVM required data and method.
type Storage struct {
vm.StateDB
Schema schema.Schema
}
// NewStorage return Storage instance.
func NewStorage(state vm.StateDB) *Storage {
s := &Storage{state, schema.Schema{}}
return s
}
func (s *Storage) hashPathKey(key [][]byte) (h common.Hash) {
hw := sha3.NewLegacyKeccak256()
rlp.Encode(hw, key)
// length of common.Hash is 256bit,
// so it can properly match the size of hw.Sum
hw.Sum(h[:0])
return
}
// GetRowPathHash return primary key hash which points to row data.
func (s *Storage) GetRowPathHash(tableRef schema.TableRef, rowID uint64) common.Hash {
// PathKey(["tables", "{table_name}", "primary", uint64({row_id})])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompPrimary,
uint64ToBytes(rowID),
}
return s.hashPathKey(key)
}
// GetIndexValuesPathHash return the hash address to IndexValues structure
// which contains all possible values.
func (s *Storage) GetIndexValuesPathHash(
tableRef schema.TableRef,
indexRef schema.IndexRef,
) common.Hash {
// PathKey(["tables", "{table_name}", "indices", "{index_name}"])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompIndices,
indexRefToBytes(indexRef),
}
return s.hashPathKey(key)
}
// GetIndexEntryPathHash return the hash address to IndexEntry structure for a
// given value.
func (s *Storage) GetIndexEntryPathHash(
tableRef schema.TableRef,
indexRef schema.IndexRef,
values ...[]byte,
) common.Hash {
// PathKey(["tables", "{table_name}", "indices", "{index_name}", field_1, field_2, field_3, ...])
key := make([][]byte, 0, 4+len(values))
key = append(key, pathCompTables, tableRefToBytes(tableRef))
key = append(key, pathCompIndices, indexRefToBytes(indexRef))
key = append(key, values...)
return s.hashPathKey(key)
}
// GetReverseIndexPathHash return the hash address to IndexRev structure for a
// row in a table.
func (s *Storage) GetReverseIndexPathHash(
tableRef schema.TableRef,
rowID uint64,
) common.Hash {
// PathKey(["tables", "{table_name}", "reverse_indices", "{RowID}"])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompReverseIndices,
uint64ToBytes(rowID),
}
return s.hashPathKey(key)
}
// GetPrimaryPathHash returns primary rlp encoded hash.
func (s *Storage) GetPrimaryPathHash(tableRef schema.TableRef) (h common.Hash) {
// PathKey(["tables", "{table_name}", "primary"])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompPrimary,
}
return s.hashPathKey(key)
}
// GetSequencePathHash return the hash address of a sequence.
func (s *Storage) GetSequencePathHash(
tableRef schema.TableRef, seqIdx uint8,
) common.Hash {
// PathKey(["tables", "{table_name}", "sequence", uint8(sequence_idx)])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompSequence,
uint8ToBytes(seqIdx),
}
return s.hashPathKey(key)
}
func (s *Storage) getOwnerPathHash() common.Hash {
// PathKey(["owner"])
key := [][]byte{pathCompOwner}
return s.hashPathKey(key)
}
func (s *Storage) getTableWritersPathHash(tableRef schema.TableRef) common.Hash {
// PathKey(["tables", "{table_name}", "writers"])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompWriters,
}
return s.hashPathKey(key)
}
func (s *Storage) getTableWriterRevIdxPathHash(
tableRef schema.TableRef,
account common.Address,
) common.Hash {
// PathKey(["tables", "{table_name}", "writers", "{addr}"])
key := [][]byte{
pathCompTables,
tableRefToBytes(tableRef),
pathCompWriters,
account.Bytes(),
}
return s.hashPathKey(key)
}
// ShiftHashUint64 shift hash in uint64.
func (s *Storage) ShiftHashUint64(hash common.Hash, shift uint64) common.Hash {
bigIntOffset := new(big.Int)
bigIntOffset.SetUint64(shift)
return s.ShiftHashBigInt(hash, bigIntOffset)
}
// ShiftHashBigInt shift hash in big.Int
func (s *Storage) ShiftHashBigInt(hash common.Hash, shift *big.Int) common.Hash {
head := hash.Big()
head.Add(head, shift)
return common.BytesToHash(head.Bytes())
}
// ShiftHashListEntry shift hash from the head of a list to the hash of
// idx-th entry.
func (s *Storage) ShiftHashListEntry(
base common.Hash,
headerSize uint64,
entrySize uint64,
idx uint64,
) common.Hash {
// TODO(yenlin): tuning when headerSize+entrySize*idx do not overflow.
shift := new(big.Int)
operand := new(big.Int)
shift.SetUint64(entrySize)
operand.SetUint64(idx)
shift.Mul(shift, operand)
operand.SetUint64(headerSize)
shift.Add(shift, operand)
return s.ShiftHashBigInt(base, shift)
}
func getDByteSize(data common.Hash) uint64 {
bytes := data.Bytes()
lastByte := bytes[len(bytes)-1]
if lastByte&0x1 == 0 {
return uint64(lastByte / 2)
}
return new(big.Int).Div(new(big.Int).Sub(
data.Big(), big.NewInt(1)), big.NewInt(2)).Uint64()
}
// DecodeDByteBySlot given contract address and slot return the dynamic bytes data.
func (s *Storage) DecodeDByteBySlot(address common.Address, slot common.Hash) []byte {
data := s.GetState(address, slot)
length := getDByteSize(data)
if length < common.HashLength {
return data[:length]
}
ptr := crypto.Keccak256Hash(slot.Bytes())
slotNum := (length-1)/common.HashLength + 1
rVal := make([]byte, slotNum*common.HashLength)
for i := uint64(0); i < slotNum; i++ {
start := i * common.HashLength
copy(rVal[start:start+common.HashLength], s.GetState(address, ptr).Bytes())
ptr = s.ShiftHashUint64(ptr, 1)
}
return rVal[:length]
}
// IncSequence increment value of sequence by inc and return the old value.
func (s *Storage) IncSequence(
contract common.Address,
tableRef schema.TableRef,
seqIdx uint8,
inc uint64,
) decimal.Decimal {
seqPath := s.GetSequencePathHash(tableRef, seqIdx)
slot := s.GetState(contract, seqPath)
b := new(big.Int).SetBytes(slot.Bytes())
b.Add(b, new(big.Int).SetUint64(inc))
newHash := make([]byte, common.HashLength)
bs := b.Bytes()
copy(newHash[common.HashLength-len(bs):], bs)
s.SetState(contract, seqPath, common.BytesToHash(newHash))
return decimal.NewFromBigInt(b, 0)
}
|
