-
Notifications
You must be signed in to change notification settings - Fork 2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Fix issue where node connection map wasn't being pruned #4231
Merged
Merged
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -40,6 +40,11 @@ func (s *Server) getNodeConn(nodeID string) (*nodeConnState, bool) { | |
} | ||
} | ||
|
||
// Shouldn't happen but rather be safe | ||
if state == nil { | ||
return nil, false | ||
} | ||
|
||
return state, ok | ||
} | ||
|
||
|
@@ -108,13 +113,21 @@ func (s *Server) removeNodeConn(ctx *RPCContext) { | |
// dial various addresses that all route to the same server. The most common | ||
// case for this is the original address the client uses to connect to the | ||
// server differs from the advertised address sent by the heartbeat. | ||
numConns := len(conns) | ||
found := false | ||
for i, conn := range conns { | ||
if conn.Ctx.Conn.LocalAddr().String() == ctx.Conn.LocalAddr().String() && | ||
conn.Ctx.Conn.RemoteAddr().String() == ctx.Conn.RemoteAddr().String() { | ||
s.nodeConns[ctx.NodeID] = append(s.nodeConns[ctx.NodeID][:i], s.nodeConns[ctx.NodeID][i+1:]...) | ||
return | ||
found = true | ||
break | ||
} | ||
} | ||
|
||
// If we just deleted the last conn, remove it from the map | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. If the last connection is deleted why is numConns ==1 and not 0? |
||
if found && numConns == 1 { | ||
delete(s.nodeConns, ctx.NodeID) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. You could do the |
||
} | ||
} | ||
|
||
// serverWithNodeConn is used to determine which remote server has the most | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can we dream up a reason this is possible? If not should we add a debug or trace log just in case it can help us find where an invariant is being broken.