mirror of
				https://github.com/yggdrasil-network/yggdrasil-go.git
				synced 2025-11-03 10:45:09 +03:00 
			
		
		
		
	try to switch parents if a parent link is blocked
This commit is contained in:
		
							parent
							
								
									898f7865b1
								
							
						
					
					
						commit
						02b1892cc5
					
				
					 2 changed files with 31 additions and 0 deletions
				
			
		| 
						 | 
				
			
			@ -309,6 +309,7 @@ func (intf *linkInterface) handler() error {
 | 
			
		|||
			case <-recvTimer.C:
 | 
			
		||||
				// We haven't received anything, so assume there's a problem and don't return this node to the switch until they start responding
 | 
			
		||||
				isAlive = false
 | 
			
		||||
				intf.link.core.switchTable.blockPeer(intf.peer.port)
 | 
			
		||||
			case <-closeTimer.C:
 | 
			
		||||
				// We haven't received anything in a really long time, so things have died at the switch level and then some...
 | 
			
		||||
				// Just close the connection at this point...
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -131,6 +131,7 @@ type peerInfo struct {
 | 
			
		|||
	faster  map[switchPort]uint64 // Counter of how often a node is faster than the current parent, penalized extra if slower
 | 
			
		||||
	port    switchPort            // Interface number of this peer
 | 
			
		||||
	msg     switchMsg             // The wire switchMsg used
 | 
			
		||||
	blocked bool                  // True if the link is blocked, used to avoid parenting a blocked link
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
// This is just a uint64 with a named type for clarity reasons.
 | 
			
		||||
| 
						 | 
				
			
			@ -256,6 +257,29 @@ func (t *switchTable) cleanRoot() {
 | 
			
		|||
	}
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
// Blocks and, if possible, unparents a peer
 | 
			
		||||
func (t *switchTable) blockPeer(port switchPort) {
 | 
			
		||||
	t.mutex.Lock()
 | 
			
		||||
	defer t.mutex.Unlock()
 | 
			
		||||
	peer, isIn := t.data.peers[port]
 | 
			
		||||
	if !isIn {
 | 
			
		||||
		return
 | 
			
		||||
	}
 | 
			
		||||
	peer.blocked = true
 | 
			
		||||
	t.data.peers[port] = peer
 | 
			
		||||
	if port != t.parent {
 | 
			
		||||
		return
 | 
			
		||||
	}
 | 
			
		||||
	t.parent = 0
 | 
			
		||||
	for _, info := range t.data.peers {
 | 
			
		||||
		if info.port == port {
 | 
			
		||||
			continue
 | 
			
		||||
		}
 | 
			
		||||
		t.unlockedHandleMsg(&info.msg, info.port, true)
 | 
			
		||||
	}
 | 
			
		||||
	t.unlockedHandleMsg(&peer.msg, peer.port, true)
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
// Removes a peer.
 | 
			
		||||
// Must be called by the router mainLoop goroutine, e.g. call router.doAdmin with a lambda that calls this.
 | 
			
		||||
// If the removed peer was this node's parent, it immediately tries to find a new parent.
 | 
			
		||||
| 
						 | 
				
			
			@ -395,6 +419,7 @@ func (t *switchTable) unlockedHandleMsg(msg *switchMsg, fromPort switchPort, rep
 | 
			
		|||
	if reprocessing {
 | 
			
		||||
		sender.faster = oldSender.faster
 | 
			
		||||
		sender.time = oldSender.time
 | 
			
		||||
		sender.blocked = oldSender.blocked
 | 
			
		||||
	} else {
 | 
			
		||||
		sender.faster = make(map[switchPort]uint64, len(oldSender.faster))
 | 
			
		||||
		for port, peer := range t.data.peers {
 | 
			
		||||
| 
						 | 
				
			
			@ -454,6 +479,11 @@ func (t *switchTable) unlockedHandleMsg(msg *switchMsg, fromPort switchPort, rep
 | 
			
		|||
	case sender.faster[t.parent] >= switch_faster_threshold:
 | 
			
		||||
		// The is reliably faster than the current parent.
 | 
			
		||||
		updateRoot = true
 | 
			
		||||
	case !sender.blocked && oldParent.blocked:
 | 
			
		||||
		// Replace a blocked parent
 | 
			
		||||
		updateRoot = true
 | 
			
		||||
	case reprocessing && sender.blocked && !oldParent.blocked:
 | 
			
		||||
		// Don't replace an unblocked parent when reprocessing
 | 
			
		||||
	case reprocessing && sender.faster[t.parent] > oldParent.faster[sender.port]:
 | 
			
		||||
		// The sender seems to be reliably faster than the current parent, so switch to them instead.
 | 
			
		||||
		updateRoot = true
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue