go/go-micro
1
0
Fork 0
mirror of https://github.com/go-micro/go-micro.git synced 2024-12-12 08:23:58 +02:00
Code Issues Releases Activity

Merge pull request #795 from milosgajdos83/advert-events

Browse Source 
Rather than append to list of events just keep the last event
This commit is contained in:
Asim Aslam 2019-09-26 18:13:28 +01:00 committed by GitHub
commit e1bb4d7379
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
router/default.go
View File

@ -347,9 +347,10 @@ func (r *router) advertiseTable() error {
}
}
// routeAdvert contains a list of route events to be advertised
// routeAdvert contains a route event to be advertised
type routeAdvert struct {
events []*Event
// event received from routing table
event *Event
// lastUpdate records the time of the last advert update
lastUpdate time.Time
// penalty is current advert penalty
@ -398,9 +399,11 @@ func (r *router) advertiseEvents() error {
// suppress/recover the event based on its penalty level
switch {
case advert.penalty > AdvertSuppress && !advert.isSuppressed:
log.Debugf("Router supressing advert %d for route %s", key, advert.event.Route.Address)
advert.isSuppressed = true
advert.suppressTime = time.Now()
case advert.penalty < AdvertRecover && advert.isSuppressed:
log.Debugf("Router recovering advert %d for route %s", key, advert.event.Route.Address)
advert.isSuppressed = false
}
@ -413,15 +416,13 @@ func (r *router) advertiseEvents() error {
}
if !advert.isSuppressed {
for _, event := range advert.events {
e := new(Event)
*e = *event
*e = *(advert.event)
events = append(events, e)
// delete the advert from the advertMap
delete(advertMap, key)
}
}
}
// advertise all Update events to subscribers
if len(events) > 0 {
@ -445,13 +446,11 @@ func (r *router) advertiseEvents() error {
}
// check if we have already registered the route
// we use the route hash as advertMap key
hash := e.Route.Hash()
advert, ok := advertMap[hash]
if !ok {
events := []*Event{e}
advert = &routeAdvert{
events: events,
event: e,
penalty: penalty,
lastUpdate: time.Now(),
}
@ -459,18 +458,15 @@ func (r *router) advertiseEvents() error {
continue
}
// attempt to squash last two events if possible
lastEvent := advert.events[len(advert.events)-1]
if lastEvent.Type == e.Type && lastEvent.Route.Hash() == hash {
log.Debugf("Router squashing event %s with hash %d for service %s", e.Type, hash, e.Route.Address)
advert.events[len(advert.events)-1] = e
} else {
advert.events = append(advert.events, e)
// override the route event only if the last event was different
if advert.event.Type != e.Type {
advert.event = e
}
// update event penalty and recorded timestamp
// update event penalty and timestamp
advert.lastUpdate = time.Now()
advert.penalty += penalty
log.Debugf("Router advert %d for route %s event penalty: %f", hash, advert.event.Route.Address, advert.penalty)
case <-r.exit:
// first wait for the advertiser to finish
r.advertWg.Wait()