forked from cilium/cilium
/
sort.go
319 lines (275 loc) · 7.31 KB
/
sort.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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
// Copyright 2018 Authors of Cilium
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package envoy
import (
"sort"
"github.com/cilium/proxy/go/cilium/api"
envoy_api_v2_route "github.com/cilium/proxy/go/envoy/api/v2/route"
)
// PortNetworkPolicySlice implements sort.Interface to sort a slice of
// *cilium.PortNetworkPolicy.
type PortNetworkPolicySlice []*cilium.PortNetworkPolicy
func (s PortNetworkPolicySlice) Len() int {
return len(s)
}
func (s PortNetworkPolicySlice) Less(i, j int) bool {
p1, p2 := s[i], s[j]
switch {
case p1.Protocol < p2.Protocol:
return true
case p1.Protocol > p2.Protocol:
return false
}
switch {
case p1.Port < p2.Port:
return true
case p1.Port > p2.Port:
return false
}
rules1, rules2 := p1.Rules, p2.Rules
switch {
case len(rules1) < len(rules2):
return true
case len(rules1) > len(rules2):
return false
}
// Assuming that the slices are sorted.
for idx := range rules1 {
r1, r2 := rules1[idx], rules2[idx]
switch {
case PortNetworkPolicyRuleLess(r1, r2):
return true
case PortNetworkPolicyRuleLess(r2, r1):
return false
}
}
// Elements are equal.
return false
}
func (s PortNetworkPolicySlice) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// SortPortNetworkPolicies sorts the given slice.
func SortPortNetworkPolicies(policies []*cilium.PortNetworkPolicy) {
sort.Sort(PortNetworkPolicySlice(policies))
}
// PortNetworkPolicyRuleSlice implements sort.Interface to sort a slice of
// *cilium.PortNetworkPolicyRuleSlice.
type PortNetworkPolicyRuleSlice []*cilium.PortNetworkPolicyRule
// PortNetworkPolicyRuleLess reports whether the r1 rule should sort before
// the r2 rule.
// L3-L4-only rules are less than L7 rules.
func PortNetworkPolicyRuleLess(r1, r2 *cilium.PortNetworkPolicyRule) bool {
// TODO: Support Kafka.
http1, http2 := r1.GetHttpRules(), r2.GetHttpRules()
switch {
case http1 == nil && http2 != nil:
return true
case http1 != nil && http2 == nil:
return false
}
if http1 != nil && http2 != nil {
httpRules1, httpRules2 := http1.HttpRules, http2.HttpRules
switch {
case len(httpRules1) < len(httpRules2):
return true
case len(httpRules1) > len(httpRules2):
return false
}
// Assuming that the slices are sorted.
for idx := range httpRules1 {
httpRule1, httpRule2 := httpRules1[idx], httpRules2[idx]
switch {
case HTTPNetworkPolicyRuleLess(httpRule1, httpRule2):
return true
case HTTPNetworkPolicyRuleLess(httpRule2, httpRule1):
return false
}
}
}
remotePolicies1, remotePolicies2 := r1.RemotePolicies, r2.RemotePolicies
switch {
case len(remotePolicies1) < len(remotePolicies2):
return true
case len(remotePolicies1) > len(remotePolicies2):
return false
}
// Assuming that the slices are sorted.
for idx := range remotePolicies1 {
p1, p2 := remotePolicies1[idx], remotePolicies2[idx]
switch {
case p1 < p2:
return true
case p1 > p2:
return false
}
}
// Elements are equal.
return false
}
func (s PortNetworkPolicyRuleSlice) Len() int {
return len(s)
}
func (s PortNetworkPolicyRuleSlice) Less(i, j int) bool {
return PortNetworkPolicyRuleLess(s[i], s[j])
}
func (s PortNetworkPolicyRuleSlice) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// SortPortNetworkPolicyRules sorts the given slice.
func SortPortNetworkPolicyRules(rules []*cilium.PortNetworkPolicyRule) {
sort.Sort(PortNetworkPolicyRuleSlice(rules))
}
// HTTPNetworkPolicyRuleSlice implements sort.Interface to sort a slice of
// *cilium.HttpNetworkPolicyRule.
type HTTPNetworkPolicyRuleSlice []*cilium.HttpNetworkPolicyRule
// HTTPNetworkPolicyRuleLess reports whether the r1 rule should sort before the
// r2 rule.
func HTTPNetworkPolicyRuleLess(r1, r2 *cilium.HttpNetworkPolicyRule) bool {
headers1, headers2 := r1.Headers, r2.Headers
switch {
case len(headers1) < len(headers2):
return true
case len(headers1) > len(headers2):
return false
}
// Assuming that the slices are sorted.
for idx := range headers1 {
header1, header2 := headers1[idx], headers2[idx]
switch {
case HeaderMatcherLess(header1, header2):
return true
case HeaderMatcherLess(header2, header1):
return false
}
}
// Elements are equal.
return false
}
func (s HTTPNetworkPolicyRuleSlice) Len() int {
return len(s)
}
func (s HTTPNetworkPolicyRuleSlice) Less(i, j int) bool {
return HTTPNetworkPolicyRuleLess(s[i], s[j])
}
func (s HTTPNetworkPolicyRuleSlice) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// SortHTTPNetworkPolicyRules sorts the given slice.
func SortHTTPNetworkPolicyRules(rules []*cilium.HttpNetworkPolicyRule) {
sort.Sort(HTTPNetworkPolicyRuleSlice(rules))
}
// HeaderMatcherSlice implements sort.Interface to sort a slice of
// *envoy_api_v2_route.HeaderMatcher.
type HeaderMatcherSlice []*envoy_api_v2_route.HeaderMatcher
// HeaderMatcherLess reports whether the m1 matcher should sort before the m2
// matcher.
func HeaderMatcherLess(m1, m2 *envoy_api_v2_route.HeaderMatcher) bool {
switch {
case m1.Name < m2.Name:
return true
case m1.Name > m2.Name:
return false
}
// Compare the header_match_specifier oneof field, by comparing each
// possible field in the oneof individually:
// - exactMatch
// - regexMatch
// - rangeMatch
// - presentMatch
// - prefixMatch
// - suffixMatch
// Use the getters to access the fields and return zero values when they
// are not set.
s1 := m1.GetExactMatch()
s2 := m2.GetExactMatch()
switch {
case s1 < s2:
return true
case s1 > s2:
return false
}
s1 = m1.GetRegexMatch()
s2 = m2.GetRegexMatch()
switch {
case s1 < s2:
return true
case s1 > s2:
return false
}
rm1 := m1.GetRangeMatch()
rm2 := m2.GetRangeMatch()
switch {
case rm1 == nil && rm2 != nil:
return true
case rm1 != nil && rm2 == nil:
return false
case rm1 != nil && rm2 != nil:
switch {
case rm1.Start < rm2.Start:
return true
case rm1.Start > rm2.Start:
return false
}
switch {
case rm1.End < rm2.End:
return true
case rm1.End > rm2.End:
return false
}
}
switch {
case !m1.GetPresentMatch() && m2.GetPresentMatch():
return true
case m1.GetPresentMatch() && !m2.GetPresentMatch():
return false
}
s1 = m1.GetPrefixMatch()
s2 = m2.GetPrefixMatch()
switch {
case s1 < s2:
return true
case s1 > s2:
return false
}
s1 = m1.GetSuffixMatch()
s2 = m2.GetSuffixMatch()
switch {
case s1 < s2:
return true
case s1 > s2:
return false
}
switch {
case !m1.InvertMatch && m2.InvertMatch:
return true
case m1.InvertMatch && !m2.InvertMatch:
return false
}
// Elements are equal.
return false
}
func (s HeaderMatcherSlice) Len() int {
return len(s)
}
func (s HeaderMatcherSlice) Less(i, j int) bool {
return HeaderMatcherLess(s[i], s[j])
}
func (s HeaderMatcherSlice) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// SortHeaderMatchers sorts the given slice.
func SortHeaderMatchers(headers []*envoy_api_v2_route.HeaderMatcher) {
sort.Sort(HeaderMatcherSlice(headers))
}