From f4046b0cfbfb60d1117a74d05a07dcd50d8dc753 Mon Sep 17 00:00:00 2001
From: Felix Lange <fjl@twurst.com>
Date: Fri, 29 Aug 2025 15:47:28 +0200
Subject: [PATCH] p2p/discover: move wait condition to lookupIterator

---
 p2p/discover/lookup.go | 17 ++++++++++++++---
 1 file changed, 14 insertions(+), 3 deletions(-)

diff --git a/p2p/discover/lookup.go b/p2p/discover/lookup.go
index db1bbe32f9..de4761d737 100644
--- a/p2p/discover/lookup.go
+++ b/p2p/discover/lookup.go
@@ -19,6 +19,7 @@ package discover
 import (
 	"context"
 	"errors"
+	"time"
 
 	"github.com/ethereum/go-ethereum/p2p/enode"
 )
@@ -105,10 +106,8 @@ func (it *lookup) startQueries() bool {
 	// The first query returns nodes from the local table.
 	if it.queries == -1 {
 		closest := it.tab.findnodeByID(it.result.target, bucketSize, false)
-		// Avoid finishing the lookup too quickly if table is empty.
-		// Wait for the table to fill.
 		if len(closest.entries) == 0 {
-			it.tab.waitForNodes(1)
+			return false
 		}
 		it.queries = 1
 		it.replyCh <- closest.entries
@@ -171,6 +170,7 @@ func (it *lookupIterator) Next() bool {
 	if len(it.buffer) > 0 {
 		it.buffer = it.buffer[1:]
 	}
+
 	// Advance the lookup to refill the buffer.
 	for len(it.buffer) == 0 {
 		if it.ctx.Err() != nil {
@@ -183,6 +183,7 @@ func (it *lookupIterator) Next() bool {
 			continue
 		}
 		if !it.lookup.advance() {
+			it.lookupFailed(it.lookup.tab)
 			it.lookup = nil
 			continue
 		}
@@ -191,6 +192,16 @@ func (it *lookupIterator) Next() bool {
 	return true
 }
 
+// lookupFailed handles failed lookup attempts. This can be called when the table has
+// exited, or when it runs out of nodes.
+func (it *lookupIterator) lookupFailed(tab *Table) {
+	timeout, cancel := context.WithTimeout(it.ctx, 1*time.Minute)
+	defer cancel()
+	tab.waitForNodes(timeout, 1)
+
+	// TODO: here we need to trigger a table refresh somehow
+}
+
 // Close ends the iterator.
 func (it *lookupIterator) Close() {
 	it.cancel()