webnet/tailscale
1
0
Fork 0
Code Issues Pull Requests 3 Packages Projects Releases Wiki Activity

tka: remove an unused parameter from computeActiveAncestor

Browse Source 
Updates #cleanup

Change-Id: I86ee7a0d048dafc8c0d030291261240050451721
Signed-off-by: Alex Chan <alexc@tailscale.com>
This commit is contained in:
Alex Chan
2025-11-10 09:53:40 +00:00
committed by Alex Chan
parent ae3dff15e4
commit c7dbd3987e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tka/tka.go
+2 -2
View File
@@ -342,7 +342,7 @@ func computeStateAt(storage Chonk, maxIter int, wantHash AUMHash) (State, error)
// hint to choose what to use. For that, we rely on the chainsThroughActive // hint to choose what to use. For that, we rely on the chainsThroughActive
// bit, which signals to us that that ancestor was part of the // bit, which signals to us that that ancestor was part of the
// chain in a previous run. // chain in a previous run.
func computeActiveAncestor(storage Chonk, chains []chain) (AUMHash, error) { func computeActiveAncestor(chains []chain) (AUMHash, error) {
// Dedupe possible ancestors, tracking if they were part of // Dedupe possible ancestors, tracking if they were part of
// the active chain on a previous run. // the active chain on a previous run.
ancestors := make(map[AUMHash]bool, len(chains)) ancestors := make(map[AUMHash]bool, len(chains))
@@ -392,7 +392,7 @@ func computeActiveChain(storage Chonk, lastKnownOldest *AUMHash, maxIter int) (c
} }
// Find the right ancestor. // Find the right ancestor.
oldestHash, err := computeActiveAncestor(storage, chains) oldestHash, err := computeActiveAncestor(chains)
if err != nil { if err != nil {
return chain{}, fmt.Errorf("computing ancestor: %v", err) return chain{}, fmt.Errorf("computing ancestor: %v", err)
} }