-
Notifications
You must be signed in to change notification settings - Fork 17
/
hash.go
260 lines (232 loc) · 6.17 KB
/
hash.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
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
// Kodex (Community Edition - CE) - Privacy & Security Engineering Platform
// Copyright (C) 2019-2024 KIProtect GmbH (HRB 208395B) - Germany
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
// https://github.com/kiprotect/kodex/blob/master/hash.go
package kodex
import (
"crypto/sha256"
"encoding/binary"
"fmt"
"hash"
"math"
"reflect"
"sort"
"strings"
)
// Computes a hash of a structured data type that can contain various types
// like strings or []byte arrays. The hash reflects both the type values and
// the structure of the source.
func StructuredHash(source interface{}) ([]byte, error) {
h := sha256.New()
if err := addHash(source, h); err != nil {
return nil, err
}
return h.Sum(nil), nil
}
type Tag struct {
Name string
Value string
Flag bool
}
type CustomHashValue interface {
HashValue() interface{}
}
func ExtractTags(field reflect.StructField, tag string) []Tag {
tags := make([]Tag, 0)
if value, ok := field.Tag.Lookup(tag); ok {
strTags := strings.Split(value, ",")
for _, tag := range strTags {
kv := strings.Split(value, ":")
if len(kv) == 1 {
tags = append(tags, Tag{
Name: tag,
Value: "",
Flag: true,
})
} else {
tags = append(tags, Tag{
Name: kv[0],
Value: kv[1],
Flag: false,
})
}
}
}
return tags
}
var NullValue = fmt.Errorf("null")
func addValue(sourceValue reflect.Value, h hash.Hash) error {
if sourceValue.IsZero() {
return NullValue
}
sourceType := sourceValue.Type()
// if the type implements a custom hash value we add this instead of the normal one
if sourceType.Implements(reflect.TypeOf((*CustomHashValue)(nil)).Elem()) {
chv := sourceValue.Interface().(CustomHashValue)
return addHash(chv.HashValue(), h)
}
switch sourceType.Kind() {
case reflect.Slice:
if sourceValue.Len() == 0 {
return NullValue
}
elemType := sourceType.Elem()
switch elemType.Kind() {
case reflect.Uint8: // this is a []byte array
addHash("bytes", h)
if _, err := h.Write(sourceValue.Bytes()); err != nil {
return err
}
default: // this is a generic list
addHash("list", h)
for i := 0; i < sourceValue.Len(); i++ {
addHash(fmt.Sprintf("%d", i), h)
if err := addValue(sourceValue.Index(i), h); err != nil {
if err == NullValue {
continue
}
return err
}
}
}
case reflect.Map:
addHash("map", h)
if sourceType.Key().Kind() != reflect.String {
return fmt.Errorf("can only hash string maps")
}
stringKeys := make([]string, sourceValue.Len())
for i, mapKey := range sourceValue.MapKeys() {
stringKeys[i] = mapKey.String()
}
// we sort the string keys
sort.Strings(stringKeys)
for _, stringKey := range stringKeys {
if err := addValue(sourceValue.MapIndex(reflect.ValueOf(stringKey)), h); err != nil {
if err == NullValue {
continue
}
return err
} else {
addHash(stringKey, h)
}
}
case reflect.Struct:
// we treat structs as equivalent to maps
addHash("map", h)
fieldNames := make([]string, sourceType.NumField())
nameMap := map[string]string{}
for i := 0; i < sourceType.NumField(); i++ {
field := sourceType.Field(i)
tags := ExtractTags(field, "json")
fieldName := field.Name
if len(tags) > 0 && tags[0].Flag {
fieldName = tags[0].Name
}
fieldNames[i] = fieldName
nameMap[fieldName] = field.Name
}
sort.Strings(fieldNames)
for _, fieldName := range fieldNames {
if err := addValue(sourceValue.FieldByName(nameMap[fieldName]), h); err != nil {
if err == NullValue {
continue
}
return err
} else {
addHash(fieldName, h)
}
}
case reflect.Ptr:
return addValue(sourceValue.Elem(), h)
case reflect.Int:
fallthrough
case reflect.Int8:
fallthrough
case reflect.Int16:
fallthrough
case reflect.Int32:
fallthrough
case reflect.Int64:
addHash("int", h)
bs := make([]byte, binary.MaxVarintLen64)
binary.PutVarint(bs, sourceValue.Int())
if _, err := h.Write(bs); err != nil {
return err
}
case reflect.Uint:
fallthrough
case reflect.Uint8:
fallthrough
case reflect.Uint16:
fallthrough
case reflect.Uint32:
fallthrough
case reflect.Uint64:
addHash("int", h)
bs := make([]byte, binary.MaxVarintLen64)
binary.PutUvarint(bs, sourceValue.Uint())
if _, err := h.Write(bs); err != nil {
return err
}
case reflect.Float32:
fallthrough
case reflect.Float64:
bs := make([]byte, binary.MaxVarintLen64)
// if the float value is equivalent to an integer, we store it as an int
// necessary e.g. when working with JSON data that converts integers
// to floats when deserializing...
if float64(int64(sourceValue.Float())) == sourceValue.Float() {
addHash("int", h)
binary.PutVarint(bs, int64(sourceValue.Float()))
} else {
addHash("float", h)
bits := math.Float64bits(sourceValue.Float())
binary.LittleEndian.PutUint64(bs, bits)
}
if _, err := h.Write(bs); err != nil {
return err
}
case reflect.String:
h.Write([]byte("string"))
if _, err := h.Write([]byte(sourceValue.String())); err != nil {
return err
}
case reflect.Bool:
addHash("bool", h)
if sourceValue.Bool() {
return addHash(1, h)
}
return addHash(0, h)
case reflect.Interface:
if sourceValue.IsNil() {
return NullValue
} else {
return addHash(sourceValue.Interface(), h)
}
default:
return fmt.Errorf("unknown type '%v', can't hash", sourceValue.Kind())
}
return nil
}
func addHash(source interface{}, h hash.Hash) error {
sourceValue := reflect.ValueOf(source)
if err := addValue(sourceValue, h); err != nil {
if err == NullValue {
return nil
}
return err
}
return nil
}