Newer
Older
// BGPPath represents a set of BGP path attributes
type BGPPath struct {
PathIdentifier uint32
NextHop uint32
LocalPref uint32
ASPathLen uint16
Origin uint8
MED uint32
EBGP bool
BGPIdentifier uint32
Source uint32
Communities []uint32
LargeCommunities []types.LargeCommunity
UnknownAttributes []types.UnknownPathAttribute
// Length get's the length of serialized path
func (b *BGPPath) Length() uint16 {
asPathLen := uint16(3)
for _, segment := range b.ASPath {
asPathLen++
asPathLen += uint16(4 * len(segment.ASNs))
}
unknownAttributesLen := uint16(0)
for _, unknownAttr := range b.UnknownAttributes {
unknownAttributesLen += unknownAttr.WireLength()
}
return uint16(len(b.Communities))*7 + uint16(len(b.LargeCommunities))*15 + 4*7 + 4 + asPathLen + unknownAttributesLen
// ECMP determines if routes b and c are euqal in terms of ECMP
func (b *BGPPath) ECMP(c *BGPPath) bool {
return b.LocalPref == c.LocalPref && b.ASPathLen == c.ASPathLen && b.MED == c.MED && b.Origin == c.Origin
}
// Compare returns negative if b < c, 0 if paths are equal, positive if b > c
func (b *BGPPath) Compare(c *BGPPath) int8 {
if c.LocalPref < b.LocalPref {
return 1
}
// a)
// b)
if c.Origin > b.Origin {
return 1
}
if c.Origin < b.Origin {
return -1
// c)
if c.MED > b.MED {
return 1
}
if c.MED < b.MED {
return -1
}
// d)
if c.EBGP && !b.EBGP {
return -1
}
if !c.EBGP && b.EBGP {
return 1
}
// e) TODO: interiour cost (hello IS-IS and OSPF)
// f)
if c.BGPIdentifier < b.BGPIdentifier {
return 1
}
if c.BGPIdentifier > b.BGPIdentifier {
return -1
}
// g)
if c.Source < b.Source {
return 1
}
if c.Source > b.Source {
return -1
}
if c.NextHop < b.NextHop {
return 1
}
if c.NextHop > b.NextHop {
return -1
}
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
}
func (b *BGPPath) betterECMP(c *BGPPath) bool {
if c.LocalPref < b.LocalPref {
return false
}
if c.LocalPref > b.LocalPref {
return true
}
if c.ASPathLen > b.ASPathLen {
return false
}
if c.ASPathLen < b.ASPathLen {
return true
}
if c.Origin > b.Origin {
return false
}
if c.Origin < b.Origin {
return true
}
if c.MED > b.MED {
return false
}
if c.MED < b.MED {
return true
}
return false
}
func (b *BGPPath) better(c *BGPPath) bool {
if b.betterECMP(c) {
return true
}
if c.BGPIdentifier < b.BGPIdentifier {
return true
}
if c.Source < b.Source {
return true
}
return false
}
// Print all known information about a route in human readable form
func (b *BGPPath) Print() string {
origin := ""
switch b.Origin {
case 0:
origin = "Incomplete"
case 1:
origin = "EGP"
case 2:
origin = "IGP"
}
bgpType := "internal"
bgpType = "external"
ret := fmt.Sprintf("\t\tLocal Pref: %d\n", b.LocalPref)
ret += fmt.Sprintf("\t\tOrigin: %s\n", origin)
ret += fmt.Sprintf("\t\tAS Path: %v\n", b.ASPath)
ret += fmt.Sprintf("\t\tBGP type: %s\n", bgpType)
nh := uint32To4Byte(b.NextHop)
ret += fmt.Sprintf("\t\tNEXT HOP: %d.%d.%d.%d\n", nh[0], nh[1], nh[2], nh[3])
ret += fmt.Sprintf("\t\tMED: %d\n", b.MED)
ret += fmt.Sprintf("\t\tPath ID: %d\n", b.PathIdentifier)
src := uint32To4Byte(b.Source)
ret += fmt.Sprintf("\t\tSource: %d.%d.%d.%d\n", src[0], src[1], src[2], src[3])
ret += fmt.Sprintf("\t\tCommunities: %v\n", b.Communities)
ret += fmt.Sprintf("\t\tLargeCommunities: %v\n", b.LargeCommunities)
// Prepend the given BGPPath with the given ASN given times
func (b *BGPPath) Prepend(asn uint32, times uint16) {
if times == 0 {
return
}
if len(b.ASPath) == 0 {
b.insertNewASSequence()
}
b.insertNewASSequence()
}
for i := 0; i < int(times); i++ {
old := b.ASPath[0].ASNs
asns := make([]uint32, len(old)+1)
copy(asns[1:], old)
asns[0] = asn
b.ASPath[0].ASNs = asns
func (b *BGPPath) insertNewASSequence() types.ASPath {
pa := make(types.ASPath, len(b.ASPath)+1)
pa[0] = types.ASPathSegment{
ASNs: make([]uint32, 0),
Type: types.ASSequence,
// Copy creates a deep copy of a BGPPath
func (b *BGPPath) Copy() *BGPPath {
if b == nil {
cp := *b
cp.ASPath = make(types.ASPath, len(cp.ASPath))
copy(cp.ASPath, b.ASPath)
cp.Communities = make([]uint32, len(cp.Communities))
copy(cp.Communities, b.Communities)
cp.LargeCommunities = make([]types.LargeCommunity, len(cp.LargeCommunities))
copy(cp.LargeCommunities, b.LargeCommunities)
// ComputeHash computes an hash over all attributes of the path
func (b *BGPPath) ComputeHash() string {
s := fmt.Sprintf("%d\t%d\t%v\t%d\t%d\t%v\t%d\t%d\t%v\t%v\t%d",
b.NextHop,
b.LocalPref,
b.ASPath,
b.Origin,
b.MED,
b.EBGP,
b.BGPIdentifier,
b.Source,
b.Communities,
b.LargeCommunities,
b.PathIdentifier)
return fmt.Sprintf("%x", sha256.Sum256([]byte(s)))
// CommunitiesString returns the formated communities
func (b *BGPPath) CommunitiesString() string {
str := ""
for _, com := range b.Communities {
}
return strings.TrimRight(str, " ")
}
// LargeCommunitiesString returns the formated communities
func (b *BGPPath) LargeCommunitiesString() string {
str := ""
for _, com := range b.LargeCommunities {
str += com.String() + " "
}
return strings.TrimRight(str, " ")
}