-
Notifications
You must be signed in to change notification settings - Fork 0
/
hashalg.go
64 lines (54 loc) · 1.22 KB
/
hashalg.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
// Copyright 2019, Shulhan <ms@kilabit.info>. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package dkim
import (
"bytes"
)
//
// HashAlg define the type for hash algorithm.
//
type HashAlg byte
//
// List of valid and known hash algorithms.
//
const (
HashAlgALL HashAlg = iota // (default to allow all)
HashAlgSHA256 // sha256
HashAlgSHA1 // sha1
)
//
// hashAlgNames contains mapping between type value and their names.
//
var hashAlgNames = map[HashAlg][]byte{ // nolint: gochecknoglobals
HashAlgSHA256: []byte("sha256"),
HashAlgSHA1: []byte("sha1"),
}
func unpackHashAlgs(v []byte) (hashAlgs []HashAlg) {
algs := bytes.Split(v, sepColon)
for x := 0; x < len(algs); x++ {
for k, v := range hashAlgNames {
if bytes.Equal(v, algs[x]) {
hashAlgs = append(hashAlgs, k)
break
}
}
}
if len(hashAlgs) == 0 {
hashAlgs = append(hashAlgs, HashAlgALL)
}
return
}
func packHashAlgs(hashAlgs []HashAlg) []byte {
var bb bytes.Buffer
for _, v := range hashAlgs {
if v == HashAlgALL {
return nil
}
if bb.Len() > 0 {
bb.Write(sepColon)
}
bb.Write(hashAlgNames[v])
}
return bb.Bytes()
}