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
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
|
// Copyright (C) 2014,2015 Nippon Telegraph and Telephone Corporation.
//
// 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 policy
import (
"fmt"
log "github.com/Sirupsen/logrus"
"github.com/osrg/gobgp/api"
"github.com/osrg/gobgp/config"
"github.com/osrg/gobgp/packet"
"github.com/osrg/gobgp/table"
"net"
"reflect"
"strconv"
"strings"
)
type RouteType int
const (
ROUTE_TYPE_NONE RouteType = iota
ROUTE_TYPE_ACCEPT
ROUTE_TYPE_REJECT
)
type MaskLengthRangeType int
const (
MASK_LENGTH_RANGE_MIN MaskLengthRangeType = iota
MASK_LENGTH_RANGE_MAX
)
type AttributeComparison int
const (
// "== comparison"
ATTRIBUTE_EQ AttributeComparison = iota
// ">= comparison"
ATTRIBUTE_GE
// "<= comparison"
ATTRIBUTE_LE
)
type Policy struct {
Name string
Statements []*Statement
}
func NewPolicy(name string, pd config.PolicyDefinition, ds config.DefinedSets) *Policy {
stmtList := pd.StatementList
st := make([]*Statement, 0)
p := &Policy{
Name: name,
}
for _, statement := range stmtList {
conditions := make([]Condition, 0)
// prefix match
prefixSetName := statement.Conditions.MatchPrefixSet
pc := NewPrefixCondition(prefixSetName, ds.PrefixSetList)
conditions = append(conditions, pc)
// neighbor match
neighborSetName := statement.Conditions.MatchNeighborSet
nc := NewNeighborCondition(neighborSetName, ds.NeighborSetList)
conditions = append(conditions, nc)
// AsPathLengthCondition
c := statement.Conditions.BgpConditions.AsPathLength
ac := NewAsPathLengthCondition(c)
if ac != nil {
conditions = append(conditions, ac)
}
action := &RoutingActions{
AcceptRoute: false,
}
if statement.Actions.AcceptRoute {
action.AcceptRoute = true
}
s := &Statement{
Name: statement.Name,
Conditions: conditions,
Actions: action,
MatchSetOptions: statement.Conditions.MatchSetOptions,
}
st = append(st, s)
}
p.Statements = st
return p
}
type Statement struct {
Name string
Conditions []Condition
Actions Actions
MatchSetOptions config.MatchSetOptionsType
}
// evaluate each condition in the statement according to MatchSetOptions
func (s *Statement) evaluate(p table.Path) bool {
optionType := s.MatchSetOptions
result := false
if optionType == config.MATCH_SET_OPTIONS_TYPE_ALL {
result = true
}
for _, condition := range s.Conditions {
r := condition.evaluate(p)
switch optionType {
case config.MATCH_SET_OPTIONS_TYPE_ALL:
result = result && r
if !result {
return false
}
case config.MATCH_SET_OPTIONS_TYPE_ANY:
result = result || r
if result {
return true
}
case config.MATCH_SET_OPTIONS_TYPE_INVERT:
result = result || r
if result {
return false
}
default:
return false
}
}
if optionType == config.MATCH_SET_OPTIONS_TYPE_INVERT {
return !result
} else {
return result
}
}
type Condition interface {
evaluate(table.Path) bool
}
type DefaultCondition struct {
CallPolicy string
}
func (c *DefaultCondition) evaluate(path table.Path) bool {
return false
}
type PrefixCondition struct {
DefaultCondition
PrefixConditionName string
PrefixList []Prefix
}
func NewPrefixCondition(prefixSetName string, defPrefixList []config.PrefixSet) *PrefixCondition {
prefixList := make([]Prefix, 0)
for _, ps := range defPrefixList {
if ps.PrefixSetName == prefixSetName {
for _, pl := range ps.PrefixList {
prefix, e := NewPrefix(pl.Address, pl.Masklength, pl.MasklengthRange)
if e != nil {
log.WithFields(log.Fields{
"Topic": "Policy",
"prefix": prefix,
"msg": e,
}).Error("failed to generate a NewPrefix from configration.")
} else {
prefixList = append(prefixList, prefix)
}
}
}
}
pc := &PrefixCondition{
PrefixConditionName: prefixSetName,
PrefixList: prefixList,
}
return pc
}
// compare prefixes in this condition and nlri of path and
// subsequent comparison is skipped if that matches the conditions.
// If PrefixList's length is zero, return true.
func (c *PrefixCondition) evaluate(path table.Path) bool {
if len(c.PrefixList) == 0 {
log.Debug("PrefixList doesn't have elements")
return true
}
for _, cp := range c.PrefixList {
if ipPrefixCalculate(path, cp) {
log.Debug("prefix matched : ", cp)
return true
}
}
return false
}
type NeighborCondition struct {
DefaultCondition
NeighborConditionName string
NeighborList []net.IP
}
func NewNeighborCondition(neighborSetName string, defNeighborSetList []config.NeighborSet) *NeighborCondition {
neighborList := make([]net.IP, 0)
for _, neighborSet := range defNeighborSetList {
if neighborSet.NeighborSetName == neighborSetName {
for _, nl := range neighborSet.NeighborInfoList {
neighborList = append(neighborList, nl.Address)
}
}
}
nc := &NeighborCondition{
NeighborConditionName: neighborSetName,
NeighborList: neighborList,
}
return nc
}
// compare neighbor ipaddress of this condition and source address of path
// and, subsequent comparisons are skipped if that matches the conditions.
// If NeighborList's length is zero, return true.
func (c *NeighborCondition) evaluate(path table.Path) bool {
if len(c.NeighborList) == 0 {
log.Debug("NeighborList doesn't have elements")
return true
}
for _, neighbor := range c.NeighborList {
cAddr := neighbor
pAddr := path.GetSource().Address
if pAddr.Equal(cAddr) {
return true
}
}
return false
}
type AsPathLengthCondition struct {
DefaultCondition
Value uint32
Operator AttributeComparison
}
// create AsPathLengthCondition object
func NewAsPathLengthCondition(defAsPathLength config.AsPathLength) *AsPathLengthCondition {
value := defAsPathLength.Value
var op AttributeComparison
switch defAsPathLength.Operator {
case "eq":
op = ATTRIBUTE_EQ
case "ge":
op = ATTRIBUTE_GE
case "le":
op = ATTRIBUTE_LE
default:
return nil
}
ac := &AsPathLengthCondition{
Value: value,
Operator: op,
}
return ac
}
// compare AS_PATH length in the message's AS_PATH attribute with
// the one in condition.
func (c *AsPathLengthCondition) evaluate(path table.Path) bool {
length := uint32(path.GetAsPathLen())
switch c.Operator {
case ATTRIBUTE_EQ:
return c.Value == length
case ATTRIBUTE_GE:
return c.Value <= length
case ATTRIBUTE_LE:
return c.Value >= length
default:
return false
}
}
type Actions interface {
apply(table.Path) table.Path
}
type DefaultActions struct {
}
func (a *DefaultActions) apply(path table.Path) table.Path {
return path
}
type RoutingActions struct {
DefaultActions
AcceptRoute bool
}
func (r *RoutingActions) apply(path table.Path) table.Path {
if r.AcceptRoute {
return path
} else {
return nil
}
}
type ModificationActions struct {
DefaultActions
AttrType bgp.BGPAttrType
Value string
}
type Prefix struct {
Address net.IP
AddressFamily bgp.RouteFamily
Masklength uint8
MasklengthRange map[MaskLengthRangeType]uint8
}
func NewPrefix(addr net.IP, maskLen uint8, maskRange string) (Prefix, error) {
mlr := make(map[MaskLengthRangeType]uint8)
p := Prefix{
Address: addr,
Masklength: maskLen,
MasklengthRange: make(map[MaskLengthRangeType]uint8),
}
if ipv4Family := addr.To4(); ipv4Family != nil {
p.AddressFamily, _ = bgp.GetRouteFamily("ipv4-unicast")
} else if ipv6Family := addr.To16(); ipv6Family != nil {
p.AddressFamily, _ = bgp.GetRouteFamily("ipv6-unicast")
} else {
return p, fmt.Errorf("can not determine the address family.")
}
// TODO: validate mask length by using regexp
idx := strings.Index(maskRange, "..")
if idx == -1 {
log.WithFields(log.Fields{
"Topic": "Policy",
"Type": "Prefix",
"MaskRangeFormat": maskRange,
}).Warn("mask length range format is invalid. mask range was skipped.")
return p, nil
}
if idx != 0 {
min, e := strconv.ParseUint(maskRange[:idx], 10, 8)
if e != nil {
return p, e
}
mlr[MASK_LENGTH_RANGE_MIN] = uint8(min)
}
if idx != len(maskRange)-1 {
max, e := strconv.ParseUint(maskRange[idx+2:], 10, 8)
if e != nil {
return p, e
}
mlr[MASK_LENGTH_RANGE_MAX] = uint8(max)
}
p.MasklengthRange = mlr
return p, nil
}
// Compare path with a policy's condition in stored order in the policy.
// If a condition match, then this function stops evaluation and
// subsequent conditions are skipped.
func (p *Policy) Apply(path table.Path) (bool, RouteType, table.Path) {
for _, statement := range p.Statements {
result := statement.evaluate(path)
log.WithFields(log.Fields{
"Topic": "Policy",
"Path": path,
"PolicyName": p.Name,
}).Debug("statement.Conditions.evaluate : ", result)
var p table.Path
if result {
p = statement.Actions.apply(path)
if p != nil {
return true, ROUTE_TYPE_ACCEPT, p
} else {
return true, ROUTE_TYPE_REJECT, nil
}
}
}
return false, ROUTE_TYPE_NONE, nil
}
func ipPrefixCalculate(path table.Path, cPrefix Prefix) bool {
rf := path.GetRouteFamily()
log.Debug("path routefamily : ", rf.String())
var pAddr net.IP
var pMasklen uint8
if rf != cPrefix.AddressFamily {
return false
}
switch rf {
case bgp.RF_IPv4_UC:
pAddr = path.GetNlri().(*bgp.NLRInfo).IPAddrPrefix.Prefix
pMasklen = path.GetNlri().(*bgp.NLRInfo).IPAddrPrefix.Length
case bgp.RF_IPv6_UC:
pAddr = path.GetNlri().(*bgp.IPv6AddrPrefix).Prefix
pMasklen = path.GetNlri().(*bgp.IPv6AddrPrefix).Length
default:
return false
}
cp := fmt.Sprintf("%s/%d", cPrefix.Address, cPrefix.Masklength)
rMin, okMin := cPrefix.MasklengthRange[MASK_LENGTH_RANGE_MIN]
rMax, okMax := cPrefix.MasklengthRange[MASK_LENGTH_RANGE_MAX]
if !okMin && !okMax {
if pAddr.Equal(cPrefix.Address) && pMasklen == cPrefix.Masklength {
return true
} else {
return false
}
}
_, ipNet, e := net.ParseCIDR(cp)
if e != nil {
log.WithFields(log.Fields{
"Topic": "Policy",
"Prefix": ipNet,
"Error": e,
}).Error("failed to parse the prefix of condition")
return false
}
if ipNet.Contains(pAddr) && (rMin <= pMasklen && pMasklen <= rMax) {
return true
}
return false
}
func (p *Policy) ToApiStruct() *api.PolicyDefinition {
resStatements := make([]*api.Statement, 0)
for _, st := range p.Statements {
resPrefixSet := &api.PrefixSet{}
resNeighborSet := &api.NeighborSet{}
for _, condition := range st.Conditions {
switch reflect.TypeOf(condition) {
case reflect.TypeOf(&PrefixCondition{}):
prefixCondition := condition.(*PrefixCondition)
resPrefixList := make([]*api.Prefix, 0)
for _, prefix := range prefixCondition.PrefixList {
resPrefix := &api.Prefix{
Address: prefix.Address.String(),
MaskLength: uint32(prefix.Masklength),
}
if min, ok := prefix.MasklengthRange[MASK_LENGTH_RANGE_MIN]; ok {
if max, ok := prefix.MasklengthRange[MASK_LENGTH_RANGE_MAX]; ok {
resPrefix.MaskLengthRange = fmt.Sprintf("%d..%d", min, max)
}
}
resPrefixList = append(resPrefixList, resPrefix)
}
resPrefixSet = &api.PrefixSet{
PrefixSetName: prefixCondition.PrefixConditionName,
PrefixList: resPrefixList,
}
case reflect.TypeOf(&NeighborCondition{}):
neighborCondition := condition.(*NeighborCondition)
resNeighborList := make([]*api.Neighbor, 0)
for _, neighbor := range neighborCondition.NeighborList {
resNeighbor := &api.Neighbor{
Address: neighbor.String(),
}
resNeighborList = append(resNeighborList, resNeighbor)
}
resNeighborSet = &api.NeighborSet{
NeighborSetName: neighborCondition.NeighborConditionName,
NeighborList: resNeighborList,
}
}
}
resCondition := &api.Conditions{
MatchPrefixSet: resPrefixSet,
MatchNeighborSet: resNeighborSet,
MatchSetOptions: int64(st.MatchSetOptions),
}
resAction := &api.Actions{
AcceptRoute: false,
RejectRoute: true,
}
if st.Actions.(*RoutingActions).AcceptRoute {
resAction.AcceptRoute = true
resAction.RejectRoute = false
}
resStatement := &api.Statement{
StatementNeme: st.Name,
Conditions: resCondition,
Actions: resAction,
}
resStatements = append(resStatements, resStatement)
}
return &api.PolicyDefinition{
PolicyDefinitionName: p.Name,
StatementList: resStatements,
}
}
|