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
|
// Code generated by tools/cmd/genjwa/main.go. DO NOT EDIT.
package jwa
import (
"fmt"
"sort"
"sync"
)
// EllipticCurveAlgorithm represents the algorithms used for EC keys
type EllipticCurveAlgorithm string
// Supported values for EllipticCurveAlgorithm
const (
Ed25519 EllipticCurveAlgorithm = "Ed25519"
Ed448 EllipticCurveAlgorithm = "Ed448"
InvalidEllipticCurve EllipticCurveAlgorithm = "P-invalid"
P256 EllipticCurveAlgorithm = "P-256"
P384 EllipticCurveAlgorithm = "P-384"
P521 EllipticCurveAlgorithm = "P-521"
X25519 EllipticCurveAlgorithm = "X25519"
X448 EllipticCurveAlgorithm = "X448"
)
var muEllipticCurveAlgorithms sync.RWMutex
var allEllipticCurveAlgorithms map[EllipticCurveAlgorithm]struct{}
var listEllipticCurveAlgorithm []EllipticCurveAlgorithm
func init() {
muEllipticCurveAlgorithms.Lock()
defer muEllipticCurveAlgorithms.Unlock()
allEllipticCurveAlgorithms = make(map[EllipticCurveAlgorithm]struct{})
allEllipticCurveAlgorithms[Ed25519] = struct{}{}
allEllipticCurveAlgorithms[Ed448] = struct{}{}
allEllipticCurveAlgorithms[P256] = struct{}{}
allEllipticCurveAlgorithms[P384] = struct{}{}
allEllipticCurveAlgorithms[P521] = struct{}{}
allEllipticCurveAlgorithms[X25519] = struct{}{}
allEllipticCurveAlgorithms[X448] = struct{}{}
rebuildEllipticCurveAlgorithm()
}
// RegisterEllipticCurveAlgorithm registers a new EllipticCurveAlgorithm so that the jwx can properly handle the new value.
// Duplicates will silently be ignored
func RegisterEllipticCurveAlgorithm(v EllipticCurveAlgorithm) {
muEllipticCurveAlgorithms.Lock()
defer muEllipticCurveAlgorithms.Unlock()
if _, ok := allEllipticCurveAlgorithms[v]; !ok {
allEllipticCurveAlgorithms[v] = struct{}{}
rebuildEllipticCurveAlgorithm()
}
}
// UnregisterEllipticCurveAlgorithm unregisters a EllipticCurveAlgorithm from its known database.
// Non-existent entries will silently be ignored
func UnregisterEllipticCurveAlgorithm(v EllipticCurveAlgorithm) {
muEllipticCurveAlgorithms.Lock()
defer muEllipticCurveAlgorithms.Unlock()
if _, ok := allEllipticCurveAlgorithms[v]; ok {
delete(allEllipticCurveAlgorithms, v)
rebuildEllipticCurveAlgorithm()
}
}
func rebuildEllipticCurveAlgorithm() {
listEllipticCurveAlgorithm = make([]EllipticCurveAlgorithm, 0, len(allEllipticCurveAlgorithms))
for v := range allEllipticCurveAlgorithms {
listEllipticCurveAlgorithm = append(listEllipticCurveAlgorithm, v)
}
sort.Slice(listEllipticCurveAlgorithm, func(i, j int) bool {
return string(listEllipticCurveAlgorithm[i]) < string(listEllipticCurveAlgorithm[j])
})
}
// EllipticCurveAlgorithms returns a list of all available values for EllipticCurveAlgorithm
func EllipticCurveAlgorithms() []EllipticCurveAlgorithm {
muEllipticCurveAlgorithms.RLock()
defer muEllipticCurveAlgorithms.RUnlock()
return listEllipticCurveAlgorithm
}
// Accept is used when conversion from values given by
// outside sources (such as JSON payloads) is required
func (v *EllipticCurveAlgorithm) Accept(value interface{}) error {
var tmp EllipticCurveAlgorithm
if x, ok := value.(EllipticCurveAlgorithm); ok {
tmp = x
} else {
var s string
switch x := value.(type) {
case fmt.Stringer:
s = x.String()
case string:
s = x
default:
return fmt.Errorf(`invalid type for jwa.EllipticCurveAlgorithm: %T`, value)
}
tmp = EllipticCurveAlgorithm(s)
}
if _, ok := allEllipticCurveAlgorithms[tmp]; !ok {
return fmt.Errorf(`invalid jwa.EllipticCurveAlgorithm value`)
}
*v = tmp
return nil
}
// String returns the string representation of a EllipticCurveAlgorithm
func (v EllipticCurveAlgorithm) String() string {
return string(v)
}
|
