forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-08-19 18:32:23 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

p2p/discover: rename

Browse source
This commit is contained in:
Felix Lange 2024-05-14 22:26:49 +02:00
parent 008ff21cdf
commit f96f5965e6
1 changed files with 15 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
p2p/discover/table_reval.go
View file

@ -189,12 +189,12 @@ type revalidationList struct {
}
// get returns a random node from the queue. Nodes in the 'exclude' map are not returned.
func (rq *revalidationList) get(now mclock.AbsTime, rand randomSource, exclude map[enode.ID]struct{}) *node {
if now < rq.nextTime || len(rq.nodes) == 0 {
func (list *revalidationList) get(now mclock.AbsTime, rand randomSource, exclude map[enode.ID]struct{}) *node {
if now < list.nextTime || len(list.nodes) == 0 {
return nil
}
for i := 0; i < len(rq.nodes)*3; i++ {
n := rq.nodes[rand.Intn(len(rq.nodes))]
for i := 0; i < len(list.nodes)*3; i++ {
n := list.nodes[rand.Intn(len(list.nodes))]
_, excluded := exclude[n.ID()]
if !excluded {
return n
@ -203,25 +203,25 @@ func (rq *revalidationList) get(now mclock.AbsTime, rand randomSource, exclude m
return nil
}
func (rq *revalidationList) schedule(now mclock.AbsTime, rand randomSource) {
rq.nextTime = now.Add(time.Duration(rand.Int63n(int64(rq.interval))))
func (list *revalidationList) schedule(now mclock.AbsTime, rand randomSource) {
list.nextTime = now.Add(time.Duration(rand.Int63n(int64(list.interval))))
}
func (rq *revalidationList) push(n *node, now mclock.AbsTime, rand randomSource) {
rq.nodes = append(rq.nodes, n)
if rq.nextTime == never {
rq.schedule(now, rand)
func (list *revalidationList) push(n *node, now mclock.AbsTime, rand randomSource) {
list.nodes = append(list.nodes, n)
if list.nextTime == never {
list.schedule(now, rand)
}
}
func (rq *revalidationList) remove(n *node) bool {
i := slices.Index(rq.nodes, n)
func (list *revalidationList) remove(n *node) bool {
i := slices.Index(list.nodes, n)
if i == -1 {
return false
}
rq.nodes = slices.Delete(rq.nodes, i, i+1)
if len(rq.nodes) == 0 {
rq.nextTime = never
list.nodes = slices.Delete(list.nodes, i, i+1)
if len(list.nodes) == 0 {
list.nextTime = never
}
return true
}