-
Notifications
You must be signed in to change notification settings - Fork 0
/
c14n.go
94 lines (80 loc) · 1.89 KB
/
c14n.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
package xmldsig
import (
"sort"
"strings"
"github.com/beevik/etree"
)
// canonicalize will take the data and attempt to combine the namespaces provided.
// It doesn't do much more than that, as the golang xml lib already does most of the
// work of creating standard XML.
func canonicalize(data []byte, ns Namespaces) ([]byte, error) {
d := etree.NewDocument()
d.WriteSettings = etree.WriteSettings{
CanonicalEndTags: true,
CanonicalText: true,
CanonicalAttrVal: true,
}
d.Indent(etree.NoIndent)
if err := d.ReadFromBytes(data); err != nil {
return nil, err
}
r := d.Root()
// Add any missing namespaces
for _, v := range ns.defs() {
match := false
for _, a := range r.Attr {
if a.Space == v.Space && a.Key == v.Key {
match = true
}
}
if !match {
r.Attr = append(r.Attr, v)
}
}
sort.Sort(byCanonicalAttr(r.Attr))
return d.WriteToBytes()
}
type byCanonicalAttr []etree.Attr
func (a byCanonicalAttr) Len() int {
return len(a)
}
func (a byCanonicalAttr) Swap(i, j int) {
a[i], a[j] = a[j], a[i]
}
func (a byCanonicalAttr) Less(i, j int) bool {
// we have two sets of attrs to sort, first those with the "xmlns" space,
// then everything else.
// First deal with default namespace which must always come first
if a[i].Key == XMLNS {
// Always first!
return true
}
if a[j].Key == XMLNS {
return false
}
// Next deal with the namespaces
if a[i].Space == XMLNS && (a[j].Space != XMLNS) {
return true
}
if a[j].Key == XMLNS || (a[i].Space != XMLNS && a[j].Space == XMLNS) {
return false
}
// Spaces are ordered by their values, not names! (seriously WTF!)
is := a[i].Space
js := a[j].Space
for _, v := range a {
if v.Space == XMLNS {
if v.Key == a[i].Space {
is = v.Value
}
if v.Key == a[j].Space {
js = v.Value
}
}
}
sp := strings.Compare(is, js)
if sp == 0 {
return strings.Compare(a[i].Key, a[j].Key) < 0
}
return sp < 0
}