Add route table observers
This commit is contained in:
parent
d25c2eb362
commit
9e3b311b56
3 changed files with 92 additions and 31 deletions
|
@ -114,6 +114,9 @@ type AURPPeer struct {
|
||||||
// Route table (the peer will add/remove/update routes and zones)
|
// Route table (the peer will add/remove/update routes and zones)
|
||||||
RouteTable *RouteTable
|
RouteTable *RouteTable
|
||||||
|
|
||||||
|
// Event tuples yet to be sent to this peer in an RI-Upd.
|
||||||
|
pendingEvents chan aurp.EventTuple
|
||||||
|
|
||||||
// The internal states below are only set within the Handle loop, but can
|
// The internal states below are only set within the Handle loop, but can
|
||||||
// be read concurrently from outside.
|
// be read concurrently from outside.
|
||||||
mu sync.RWMutex
|
mu sync.RWMutex
|
||||||
|
@ -126,6 +129,41 @@ type AURPPeer struct {
|
||||||
sendRetries int
|
sendRetries int
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func (p *AURPPeer) addPendingEvent(ec aurp.EventCode, route *Route) {
|
||||||
|
// Don't advertise routes to AURP peers to other AURP peers
|
||||||
|
if route.AURPPeer != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
et := aurp.EventTuple{
|
||||||
|
EventCode: ec,
|
||||||
|
Extended: route.Extended,
|
||||||
|
RangeStart: route.NetStart,
|
||||||
|
Distance: route.Distance,
|
||||||
|
RangeEnd: route.NetEnd,
|
||||||
|
}
|
||||||
|
switch ec {
|
||||||
|
case aurp.EventCodeND, aurp.EventCodeNRC:
|
||||||
|
et.Distance = 0 // "The distance field does not apply to ND or NRC event tuples and should be set to 0."
|
||||||
|
}
|
||||||
|
p.pendingEvents <- et
|
||||||
|
}
|
||||||
|
|
||||||
|
func (p *AURPPeer) RouteAdded(route *Route) {
|
||||||
|
p.addPendingEvent(aurp.EventCodeNA, route)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (p *AURPPeer) RouteDeleted(route *Route) {
|
||||||
|
p.addPendingEvent(aurp.EventCodeND, route)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (p *AURPPeer) RouteDistanceChanged(route *Route) {
|
||||||
|
p.addPendingEvent(aurp.EventCodeNDC, route)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (p *AURPPeer) RouteForwarderChanged(route *Route) {
|
||||||
|
p.addPendingEvent(aurp.EventCodeNRC, route)
|
||||||
|
}
|
||||||
|
|
||||||
func (p *AURPPeer) Forward(ddpkt *ddp.ExtPacket) error {
|
func (p *AURPPeer) Forward(ddpkt *ddp.ExtPacket) error {
|
||||||
outPkt, err := ddp.ExtMarshal(*ddpkt)
|
outPkt, err := ddp.ExtMarshal(*ddpkt)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
|
|
@ -55,17 +55,40 @@ func (r *Route) Valid() bool {
|
||||||
return len(r.ZoneNames) > 0 && (r.EtherTalkPeer == nil || time.Since(r.LastSeen) <= maxRouteAge)
|
return len(r.ZoneNames) > 0 && (r.EtherTalkPeer == nil || time.Since(r.LastSeen) <= maxRouteAge)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
type RouteTableObserver interface {
|
||||||
|
RouteAdded(*Route)
|
||||||
|
RouteDeleted(*Route)
|
||||||
|
RouteDistanceChanged(*Route)
|
||||||
|
RouteForwarderChanged(*Route)
|
||||||
|
}
|
||||||
|
|
||||||
type RouteTable struct {
|
type RouteTable struct {
|
||||||
mu sync.Mutex
|
routesMu sync.RWMutex
|
||||||
routes map[*Route]struct{}
|
routes map[*Route]struct{}
|
||||||
|
|
||||||
|
observersMu sync.RWMutex
|
||||||
|
observers map[RouteTableObserver]struct{}
|
||||||
}
|
}
|
||||||
|
|
||||||
func NewRouteTable() *RouteTable {
|
func NewRouteTable() *RouteTable {
|
||||||
return &RouteTable{
|
return &RouteTable{
|
||||||
routes: make(map[*Route]struct{}),
|
routes: make(map[*Route]struct{}),
|
||||||
|
observers: make(map[RouteTableObserver]struct{}),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func (rt *RouteTable) AddObserver(obs RouteTableObserver) {
|
||||||
|
rt.observersMu.Lock()
|
||||||
|
defer rt.observersMu.Unlock()
|
||||||
|
rt.observers[obs] = struct{}{}
|
||||||
|
}
|
||||||
|
|
||||||
|
func (rt *RouteTable) RemoveObserver(obs RouteTableObserver) {
|
||||||
|
rt.observersMu.Lock()
|
||||||
|
defer rt.observersMu.Unlock()
|
||||||
|
delete(rt.observers, obs)
|
||||||
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) InsertEtherTalkDirect(port *EtherTalkPort) {
|
func (rt *RouteTable) InsertEtherTalkDirect(port *EtherTalkPort) {
|
||||||
r := &Route{
|
r := &Route{
|
||||||
Extended: true,
|
Extended: true,
|
||||||
|
@ -77,14 +100,14 @@ func (rt *RouteTable) InsertEtherTalkDirect(port *EtherTalkPort) {
|
||||||
EtherTalkDirect: port,
|
EtherTalkDirect: port,
|
||||||
}
|
}
|
||||||
|
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
rt.routes[r] = struct{}{}
|
rt.routes[r] = struct{}{}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) Dump() []Route {
|
func (rt *RouteTable) Dump() []Route {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
table := make([]Route, 0, len(rt.routes))
|
table := make([]Route, 0, len(rt.routes))
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
|
@ -94,8 +117,8 @@ func (rt *RouteTable) Dump() []Route {
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) LookupRoute(network ddp.Network) *Route {
|
func (rt *RouteTable) LookupRoute(network ddp.Network) *Route {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
var bestRoute *Route
|
var bestRoute *Route
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
|
@ -117,8 +140,8 @@ func (rt *RouteTable) LookupRoute(network ddp.Network) *Route {
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) DeleteAURPPeer(peer *AURPPeer) {
|
func (rt *RouteTable) DeleteAURPPeer(peer *AURPPeer) {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
for route := range rt.routes {
|
for route := range rt.routes {
|
||||||
if route.AURPPeer == peer {
|
if route.AURPPeer == peer {
|
||||||
|
@ -128,8 +151,8 @@ func (rt *RouteTable) DeleteAURPPeer(peer *AURPPeer) {
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) DeleteAURPPeerNetwork(peer *AURPPeer, network ddp.Network) {
|
func (rt *RouteTable) DeleteAURPPeerNetwork(peer *AURPPeer, network ddp.Network) {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
for route := range rt.routes {
|
for route := range rt.routes {
|
||||||
if route.AURPPeer == peer && route.NetStart == network {
|
if route.AURPPeer == peer && route.NetStart == network {
|
||||||
|
@ -139,8 +162,8 @@ func (rt *RouteTable) DeleteAURPPeerNetwork(peer *AURPPeer, network ddp.Network)
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) UpdateAURPRouteDistance(peer *AURPPeer, network ddp.Network, distance uint8) {
|
func (rt *RouteTable) UpdateAURPRouteDistance(peer *AURPPeer, network ddp.Network, distance uint8) {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
for route := range rt.routes {
|
for route := range rt.routes {
|
||||||
if route.AURPPeer == peer && route.NetStart == network {
|
if route.AURPPeer == peer && route.NetStart == network {
|
||||||
|
@ -158,8 +181,8 @@ func (rt *RouteTable) UpsertEtherTalkRoute(peer *EtherTalkPeer, extended bool, n
|
||||||
return nil, fmt.Errorf("invalid network range [%d, %d] for nonextended network", netStart, netEnd)
|
return nil, fmt.Errorf("invalid network range [%d, %d] for nonextended network", netStart, netEnd)
|
||||||
}
|
}
|
||||||
|
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
// Update?
|
// Update?
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
|
@ -210,16 +233,16 @@ func (rt *RouteTable) InsertAURPRoute(peer *AURPPeer, extended bool, netStart, n
|
||||||
AURPPeer: peer,
|
AURPPeer: peer,
|
||||||
}
|
}
|
||||||
|
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
rt.routes[r] = struct{}{}
|
rt.routes[r] = struct{}{}
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// ValidRoutes returns all valid routes.
|
// ValidRoutes returns all valid routes.
|
||||||
func (rt *RouteTable) ValidRoutes() []*Route {
|
func (rt *RouteTable) ValidRoutes() []*Route {
|
||||||
rt.mu.Lock()
|
rt.routesMu.RLock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.RUnlock()
|
||||||
valid := make([]*Route, 0, len(rt.routes))
|
valid := make([]*Route, 0, len(rt.routes))
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
if r.Valid() {
|
if r.Valid() {
|
||||||
|
@ -231,8 +254,8 @@ func (rt *RouteTable) ValidRoutes() []*Route {
|
||||||
|
|
||||||
// ValidNonAURPRoutes returns all valid routes that were not learned via AURP.
|
// ValidNonAURPRoutes returns all valid routes that were not learned via AURP.
|
||||||
func (rt *RouteTable) ValidNonAURPRoutes() []*Route {
|
func (rt *RouteTable) ValidNonAURPRoutes() []*Route {
|
||||||
rt.mu.Lock()
|
rt.routesMu.RLock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.RUnlock()
|
||||||
valid := make([]*Route, 0, len(rt.routes))
|
valid := make([]*Route, 0, len(rt.routes))
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
if r.AURPPeer != nil {
|
if r.AURPPeer != nil {
|
||||||
|
|
|
@ -23,8 +23,8 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
func (rt *RouteTable) AddZonesToNetwork(n ddp.Network, zs ...string) {
|
func (rt *RouteTable) AddZonesToNetwork(n ddp.Network, zs ...string) {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
if n < r.NetStart || n > r.NetEnd {
|
if n < r.NetStart || n > r.NetEnd {
|
||||||
continue
|
continue
|
||||||
|
@ -39,8 +39,8 @@ func (rt *RouteTable) AddZonesToNetwork(n ddp.Network, zs ...string) {
|
||||||
func (rt *RouteTable) ZonesForNetworks(ns []ddp.Network) map[ddp.Network][]string {
|
func (rt *RouteTable) ZonesForNetworks(ns []ddp.Network) map[ddp.Network][]string {
|
||||||
zs := make(map[ddp.Network][]string)
|
zs := make(map[ddp.Network][]string)
|
||||||
|
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
if !r.Valid() {
|
if !r.Valid() {
|
||||||
continue
|
continue
|
||||||
|
@ -55,8 +55,8 @@ func (rt *RouteTable) ZonesForNetworks(ns []ddp.Network) map[ddp.Network][]strin
|
||||||
}
|
}
|
||||||
|
|
||||||
func (rt *RouteTable) RoutesForZone(zone string) []*Route {
|
func (rt *RouteTable) RoutesForZone(zone string) []*Route {
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
var routes []*Route
|
var routes []*Route
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
|
@ -73,8 +73,8 @@ func (rt *RouteTable) RoutesForZone(zone string) []*Route {
|
||||||
func (rt *RouteTable) AllZoneNames() (zones []string) {
|
func (rt *RouteTable) AllZoneNames() (zones []string) {
|
||||||
defer slices.Sort(zones)
|
defer slices.Sort(zones)
|
||||||
|
|
||||||
rt.mu.Lock()
|
rt.routesMu.Lock()
|
||||||
defer rt.mu.Unlock()
|
defer rt.routesMu.Unlock()
|
||||||
|
|
||||||
zs := make(StringSet)
|
zs := make(StringSet)
|
||||||
for r := range rt.routes {
|
for r := range rt.routes {
|
||||||
|
|
Loading…
Reference in a new issue