/
util.go
80 lines (75 loc) 路 2.22 KB
/
util.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
// Copyright (c) 2020 Siemens AG
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
// Author(s): Jonas Plum
package forensicstore
import (
"reflect"
"github.com/stoewer/go-strcase"
)
func lower(f interface{}) interface{} {
var hashes = map[string]bool{
"MD5": true,
"MD6": true,
"RIPEMD-160": true,
"SHA-1": true,
"SHA-224": true,
"SHA-256": true,
"SHA-384": true,
"SHA-512": true,
"SHA3-224": true,
"SHA3-256": true,
"SHA3-384": true,
"SHA3-512": true,
"SSDEEP": true,
"WHIRLPOOL": true,
}
switch f := f.(type) {
case []interface{}:
for i := range f {
if !isEmptyValue(reflect.ValueOf(f[i])) {
f[i] = lower(f[i])
}
}
return f
case map[string]interface{}:
lf := make(map[string]interface{}, len(f))
for k, v := range f {
if !isEmptyValue(reflect.ValueOf(v)) {
if _, ok := hashes[k]; ok {
lf[k] = lower(v)
} else {
lf[strcase.SnakeCase(k)] = lower(v)
}
}
}
return lf
default:
return f
}
}
func isEmptyValue(v reflect.Value) bool {
switch v.Kind() {
case reflect.Array, reflect.Map, reflect.Slice, reflect.String:
return v.Len() == 0
case reflect.Interface, reflect.Ptr:
return v.IsNil()
}
return false
}