-
Notifications
You must be signed in to change notification settings - Fork 376
/
Copy pathreachability.go
431 lines (383 loc) · 11.4 KB
/
reachability.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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
// Copyright 2020 Antrea Authors
//
// 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 e2e
import (
"fmt"
"strings"
log "github.com/sirupsen/logrus"
)
type Pod string
type CustomPod struct {
Pod Pod
Labels map[string]string
}
func NewPod(namespace string, podName string) Pod {
return Pod(fmt.Sprintf("%s/%s", namespace, podName))
}
func (pod Pod) String() string {
return string(pod)
}
func (pod Pod) split() (string, string) {
pieces := strings.Split(string(pod), "/")
if len(pieces) != 2 {
panic(fmt.Errorf("expected ns/pod, found %+v", pieces))
}
return pieces[0], pieces[1]
}
func (pod Pod) Namespace() string {
ns, _ := pod.split()
return ns
}
func (pod Pod) PodName() string {
_, podName := pod.split()
return podName
}
type PodConnectivityMark string
const (
Connected PodConnectivityMark = "Con"
Unknown PodConnectivityMark = "Unk"
Error PodConnectivityMark = "Err"
Dropped PodConnectivityMark = "Drp"
Rejected PodConnectivityMark = "Rej"
)
type Connectivity struct {
From Pod
To Pod
Connectivity PodConnectivityMark
}
type ConnectivityTable struct {
Items []string
itemSet map[string]bool
Values map[string]map[string]PodConnectivityMark
}
type TruthTable struct {
Items []string
itemSet map[string]bool
Values map[string]map[string]bool
}
func NewConnectivityTable(items []string, defaultValue *PodConnectivityMark) *ConnectivityTable {
itemSet := map[string]bool{}
values := map[string]map[string]PodConnectivityMark{}
for _, from := range items {
itemSet[from] = true
values[from] = map[string]PodConnectivityMark{}
if defaultValue != nil {
for _, to := range items {
values[from][to] = *defaultValue
}
}
}
return &ConnectivityTable{
Items: items,
itemSet: itemSet,
Values: values,
}
}
// IsComplete returns true if there's a value set for every single pair of items, otherwise it returns false.
func (tt *TruthTable) IsComplete() bool {
for _, from := range tt.Items {
for _, to := range tt.Items {
if _, ok := tt.Values[from][to]; !ok {
return false
}
}
}
return true
}
func (ct *ConnectivityTable) Set(from string, to string, value PodConnectivityMark) {
dict, ok := ct.Values[from]
if !ok {
panic(fmt.Errorf("key %s not found in map", from))
}
if _, ok := ct.itemSet[to]; !ok {
panic(fmt.Errorf("key %s not allowed", to))
}
dict[to] = value
}
func (ct *ConnectivityTable) SetAllFrom(from string, value PodConnectivityMark) {
dict, ok := ct.Values[from]
if !ok {
panic(fmt.Errorf("key %s not found in map", from))
}
for _, to := range ct.Items {
dict[to] = value
}
}
func (ct *ConnectivityTable) SetAllTo(to string, value PodConnectivityMark) {
if _, ok := ct.itemSet[to]; !ok {
panic(fmt.Errorf("key %s not found", to))
}
for _, from := range ct.Items {
ct.Values[from][to] = value
}
}
func (ct *ConnectivityTable) Get(from string, to string) PodConnectivityMark {
dict, ok := ct.Values[from]
if !ok {
return Unknown
}
val, ok := dict[to]
if !ok {
return Unknown
}
return val
}
func (ct *ConnectivityTable) Compare(other *ConnectivityTable) *TruthTable {
// TODO set equality
// if tt.itemSet != other.itemSet {
// panic()
// }
values := map[string]map[string]bool{}
for from, dict := range ct.Values {
values[from] = map[string]bool{}
for to, val := range dict {
values[from][to] = val == other.Values[from][to] // TODO other.Get(from, to) ?
}
}
// TODO check for equality from both sides
return &TruthTable{
Items: ct.Items,
itemSet: ct.itemSet,
Values: values,
}
}
func (ct *ConnectivityTable) PrettyPrint(indent string) string {
header := indent + strings.Join(append([]string{"-"}, ct.Items...), "\t")
lines := []string{header}
for _, from := range ct.Items {
line := []string{from}
for _, to := range ct.Items {
val := fmt.Sprintf("%s", ct.Values[from][to])
line = append(line, val)
}
lines = append(lines, indent+strings.Join(line, "\t"))
}
return strings.Join(lines, "\n")
}
func (tt *TruthTable) PrettyPrint(indent string) string {
header := indent + strings.Join(append([]string{"-"}, tt.Items...), "\t")
lines := []string{header}
for _, from := range tt.Items {
line := []string{from}
for _, to := range tt.Items {
val := "X"
if tt.Values[from][to] {
val = "."
}
line = append(line, val)
}
lines = append(lines, indent+strings.Join(line, "\t"))
}
return strings.Join(lines, "\n")
}
type Reachability struct {
Expected *ConnectivityTable
Observed *ConnectivityTable
Pods []Pod
PodsByNamespace map[string][]Pod
}
func NewReachability(pods []Pod, defaultExpectation PodConnectivityMark) *Reachability {
var items []string
podsByNamespace := make(map[string][]Pod)
for _, pod := range pods {
items = append(items, string(pod))
podNS := pod.Namespace()
podsByNamespace[podNS] = append(podsByNamespace[podNS], pod)
}
r := &Reachability{
Expected: NewConnectivityTable(items, &defaultExpectation),
Observed: NewConnectivityTable(items, nil),
Pods: pods,
PodsByNamespace: podsByNamespace,
}
return r
}
func (r *Reachability) NewReachabilityWithSameExpectations() *Reachability {
var items []string
for _, pod := range r.Pods {
items = append(items, string(pod))
}
return &Reachability{
Expected: r.Expected,
Observed: NewConnectivityTable(items, nil),
Pods: r.Pods,
PodsByNamespace: r.PodsByNamespace,
}
}
// ExpectConn is an experimental way to describe connectivity with named fields
func (r *Reachability) ExpectConn(spec *Connectivity) {
if spec.From == "" && spec.To == "" {
panic("at most one of From and To may be empty, but both are empty")
}
if spec.From == "" {
r.ExpectAllIngress(spec.To, spec.Connectivity)
} else if spec.To == "" {
r.ExpectAllEgress(spec.From, spec.Connectivity)
} else {
r.Expect(spec.From, spec.To, spec.Connectivity)
}
}
func (r *Reachability) Expect(pod1 Pod, pod2 Pod, connectivity PodConnectivityMark) {
r.Expected.Set(string(pod1), string(pod2), connectivity)
}
func (r *Reachability) ExpectSelf(allPods []Pod, connectivity PodConnectivityMark) {
for _, p := range allPods {
r.Expected.Set(string(p), string(p), connectivity)
}
}
// ExpectAllIngress defines that any traffic going into the pod will be allowed/dropped/rejected
func (r *Reachability) ExpectAllIngress(pod Pod, connectivity PodConnectivityMark) {
r.Expected.SetAllTo(string(pod), connectivity)
if connectivity != Connected {
log.Infof("Denying all traffic *to* %s", pod)
}
}
// ExpectAllEgress defines that any traffic going out of the pod will be allowed/dropped/rejected
func (r *Reachability) ExpectAllEgress(pod Pod, connectivity PodConnectivityMark) {
r.Expected.SetAllFrom(string(pod), connectivity)
if connectivity != Connected {
log.Infof("Denying all traffic *from* %s", pod)
}
}
func (r *Reachability) ExpectAllSelfNamespace(connectivity PodConnectivityMark) {
for _, pods := range r.PodsByNamespace {
for i := range pods {
for j := range pods {
r.Expected.Set(string(pods[i]), string(pods[j]), connectivity)
}
}
}
}
func (r *Reachability) ExpectSelfNamespace(namespace string, connectivity PodConnectivityMark) {
pods, ok := r.PodsByNamespace[namespace]
if !ok {
panic(fmt.Errorf("namespace %s is not found", namespace))
}
for i := range pods {
for j := range pods {
r.Expected.Set(string(pods[i]), string(pods[j]), connectivity)
}
}
}
func (r *Reachability) ExpectIngressFromNamespace(pod Pod, namespace string, connectivity PodConnectivityMark) {
pods, ok := r.PodsByNamespace[namespace]
if !ok {
panic(fmt.Errorf("namespace %s is not found", namespace))
}
for i := range pods {
r.Expected.Set(string(pods[i]), string(pod), connectivity)
}
}
func (r *Reachability) ExpectEgressToNamespace(pod Pod, namespace string, connectivity PodConnectivityMark) {
pods, ok := r.PodsByNamespace[namespace]
if !ok {
panic(fmt.Errorf("namespace %s is not found", namespace))
}
for i := range pods {
r.Expected.Set(string(pod), string(pods[i]), connectivity)
}
}
func (r *Reachability) ExpectNamespaceIngressFromNamespace(dstNamespace, srcNamespace string, connectivity PodConnectivityMark) {
dstPods, ok := r.PodsByNamespace[dstNamespace]
if !ok {
panic(fmt.Errorf("destination Namespace %s is not found", dstNamespace))
}
for _, p := range dstPods {
r.ExpectIngressFromNamespace(p, srcNamespace, connectivity)
}
}
func (r *Reachability) ExpectNamespaceEgressToNamespace(srcNamespace, dstNamespace string, connectivity PodConnectivityMark) {
srcPods, ok := r.PodsByNamespace[srcNamespace]
if !ok {
panic(fmt.Errorf("src Namespace %s is not found", srcNamespace))
}
for _, p := range srcPods {
r.ExpectEgressToNamespace(p, dstNamespace, connectivity)
}
}
func (r *Reachability) Observe(pod1 Pod, pod2 Pod, connectivity PodConnectivityMark) {
r.Observed.Set(string(pod1), string(pod2), connectivity)
}
func (r *Reachability) Summary() (trueObs int, falseObs int, comparison *TruthTable) {
comparison = r.Expected.Compare(r.Observed)
if !comparison.IsComplete() {
panic("observations not complete!")
}
falseObs = 0
trueObs = 0
for _, dict := range comparison.Values {
for _, val := range dict {
if val {
trueObs++
} else {
falseObs++
}
}
}
return trueObs, falseObs, comparison
}
func (r *Reachability) PrintSummary(printExpected bool, printObserved bool, printComparison bool) {
right, wrong, comparison := r.Summary()
fmt.Printf("reachability: correct:%v, incorrect:%v, result=%t\n\n", right, wrong, wrong == 0)
if printExpected {
fmt.Printf("expected:\n\n%s\n\n\n", r.Expected.PrettyPrint(""))
}
if printObserved {
fmt.Printf("observed:\n\n%s\n\n\n", r.Observed.PrettyPrint(""))
}
if printComparison {
fmt.Printf("comparison:\n\n%s\n\n\n", comparison.PrettyPrint(""))
}
}
type NPEvalActionType string
const (
NPEvalNone NPEvalActionType = "<NONE>"
NPEvalAllow NPEvalActionType = "Allow"
NPEvalDrop NPEvalActionType = "Drop"
NPEvalIsolate NPEvalActionType = "Isolate"
NPEvalReject NPEvalActionType = "Reject"
)
type NPEvaluationSpec struct {
Source Pod
Destination Pod
NPName string
Action NPEvalActionType
}
type NPEvaluation struct {
itemSet map[string]bool
Assertions []*NPEvaluationSpec
}
func NewNPEvaluation(pods []Pod) *NPEvaluation {
itemSet := map[string]bool{}
for _, pod := range pods {
itemSet[pod.String()] = true
}
return &NPEvaluation{
itemSet: itemSet,
Assertions: []*NPEvaluationSpec{},
}
}
func (e *NPEvaluation) Expect(from, to Pod, npName string, action NPEvalActionType) *NPEvaluation {
if _, ok := e.itemSet[from.String()]; !ok {
panic(fmt.Errorf("key %s not allowed", from))
}
if _, ok := e.itemSet[to.String()]; !ok {
panic(fmt.Errorf("key %s not allowed", to))
}
e.Assertions = append(e.Assertions, &NPEvaluationSpec{from, to, npName, action})
return e
}
func (e *NPEvaluation) ExpectNone(from Pod, to Pod) *NPEvaluation {
return e.Expect(from, to, string(NPEvalNone), NPEvalNone)
}