-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhash_writer_default.go
213 lines (193 loc) · 4.64 KB
/
hash_writer_default.go
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
package crypka
import (
"io"
"reflect"
)
// Note: this writer does not differnciate empty and nil slice, just like golang STL in functions like len.
type DefaultStructHashWriter struct {
}
func (dsh *DefaultStructHashWriter) WriteStruct(ctx HashContext, res interface{}, w io.Writer) (err error) {
inner := innerDefaultStructHasher{
ctx: ctx,
helper: &HashableHelper{
W: w,
},
fieldsCache: nil,
}
err = inner.enterData(reflect.ValueOf(res))
if err != nil {
return
}
return
}
type innerDefaultStructHasher struct {
ctx HashContext
helper *HashableHelper
fieldsCache map[reflect.Type]taggedFields
}
func (dsh *innerDefaultStructHasher) enterData(reflectData reflect.Value) (err error) {
hnew, ok := reflectData.Interface().(HashableNew)
if ok {
err = hnew.HashSelf(dsh.helper)
return
}
for reflectData.Kind() == reflect.Ptr {
// skip nil pointers
// and pointers to pointer to nil
if reflectData.IsNil() {
return
}
reflectData = reflectData.Elem()
}
switch reflectData.Kind() {
case reflect.String:
err = dsh.helper.WriteString(reflectData.String())
if err != nil {
return
}
case reflect.Slice:
if reflectData.Type().Elem().Kind() == reflect.Uint8 {
err = dsh.helper.WriteByteSlice(reflectData.Bytes())
if err != nil {
return
}
} else {
len := reflectData.Len()
err = dsh.helper.EnterSlice(len)
if err != nil {
return
}
for i := 0; i < len; i++ {
err = dsh.enterData(reflectData.Index(i))
if err != nil {
return
}
}
err = dsh.helper.ExitSlice()
if err != nil {
return
}
}
case reflect.Array:
if reflectData.Type().Elem().Kind() == reflect.Uint8 {
err = dsh.helper.WriteConstBytes(reflectData.Slice(0, reflectData.Len()).Interface().([]byte))
if err != nil {
return
}
} else {
// note: this makes resizing array backwards-incompatible
len := reflectData.Len()
for i := 0; i < len; i++ {
err = dsh.enterData(reflectData.Index(i))
if err != nil {
return
}
}
}
case reflect.Uint8:
err = dsh.helper.WriteUint8(reflectData.Interface().(uint8))
if err != nil {
return
}
case reflect.Uint16:
err = dsh.helper.WriteUint16(reflectData.Interface().(uint16))
if err != nil {
return
}
case reflect.Uint32:
err = dsh.helper.WriteUint32(reflectData.Interface().(uint32))
if err != nil {
return
}
case reflect.Uint64:
err = dsh.helper.WriteUint64(reflectData.Interface().(uint64))
if err != nil {
return
}
case reflect.Uint:
err = dsh.helper.WriteUint64(uint64(reflectData.Interface().(uint)))
if err != nil {
return
}
case reflect.Int8:
err = dsh.helper.WriteInt8(reflectData.Interface().(int8))
if err != nil {
return
}
case reflect.Int16:
err = dsh.helper.WriteInt16(reflectData.Interface().(int16))
if err != nil {
return
}
case reflect.Int32:
err = dsh.helper.WriteInt32(reflectData.Interface().(int32))
if err != nil {
return
}
case reflect.Int64:
err = dsh.helper.WriteInt64(reflectData.Interface().(int64))
if err != nil {
return
}
case reflect.Int:
err = dsh.helper.WriteInt64(int64(reflectData.Interface().(int)))
if err != nil {
return
}
case reflect.Struct:
fields, cachedFieldsOk := dsh.fieldsCache[reflectData.Type()]
if !cachedFieldsOk {
if dsh.fieldsCache == nil {
dsh.fieldsCache = make(map[reflect.Type]taggedFields)
}
_, fields, err = computeTaggedFields(reflectData)
if err != nil {
return
}
dsh.fieldsCache[reflectData.Type()] = fields
}
err = dsh.helper.EnterStruct()
if err != nil {
return
}
length := reflectData.NumField()
if len(fields) == 0 {
for i := 0; i < length; i++ {
fieldValue := reflectData.Field(i)
err = dsh.enterData(fieldValue)
if err != nil {
return
}
}
} else {
for _, f := range fields {
err = dsh.enterData(reflectData.Field(f.index))
if err != nil {
return
}
}
}
err = dsh.helper.ExitStruct()
if err != nil {
return
}
case reflect.Float32:
// since floats are quirky, for instance NaN value may be more than one NaN but comparing NaNs
// is a mess and some serializers support the only NaN, so it's not
// https://en.wikipedia.org/wiki/NaN (quiet nan/signaling nan)
//
// and in general floats are mess when comes to comparing them
// so I won't implement them.
// especially because some FP numbers can be encoded in more than one binary representation
fallthrough
case reflect.Float64:
fallthrough
case reflect.Map:
// since order of keys is undefined, and making slice and sorting them is a mess to do with reflection
fallthrough
default:
err = ErrHashNotSupported
return
}
return
}