mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-08-20 10:52:25 +00:00
0c3cd1a461
This change replaces the peer-to-peer dial scheduler with a new and improved implementation. The new code is better than the previous implementation in two key aspects: - The time between discovery of a node and dialing that node is significantly lower in the new version. The old dialState kept a buffer of nodes and launched a task to refill it whenever the buffer became empty. This worked well with the discovery interface we used to have, but doesn't really work with the new iterator-based discovery API. - Selection of static dial candidates (created by Server.AddPeer or through static-nodes.json) performs much better for large amounts of static peers. Connections to static nodes are now limited like dynanic dials and can no longer overstep MaxPeers or the dial ratio.
56 lines
1.6 KiB
Go
56 lines
1.6 KiB
Go
// Copyright 2019 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package p2p
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/ethereum/go-ethereum/common/mclock"
|
|
)
|
|
|
|
func TestExpHeap(t *testing.T) {
|
|
var h expHeap
|
|
|
|
var (
|
|
basetime = mclock.AbsTime(10)
|
|
exptimeA = basetime.Add(2 * time.Second)
|
|
exptimeB = basetime.Add(3 * time.Second)
|
|
exptimeC = basetime.Add(4 * time.Second)
|
|
)
|
|
h.add("b", exptimeB)
|
|
h.add("a", exptimeA)
|
|
h.add("c", exptimeC)
|
|
|
|
if h.nextExpiry() != exptimeA {
|
|
t.Fatal("wrong nextExpiry")
|
|
}
|
|
if !h.contains("a") || !h.contains("b") || !h.contains("c") {
|
|
t.Fatal("heap doesn't contain all live items")
|
|
}
|
|
|
|
h.expire(exptimeA.Add(1), nil)
|
|
if h.nextExpiry() != exptimeB {
|
|
t.Fatal("wrong nextExpiry")
|
|
}
|
|
if h.contains("a") {
|
|
t.Fatal("heap contains a even though it has already expired")
|
|
}
|
|
if !h.contains("b") || !h.contains("c") {
|
|
t.Fatal("heap doesn't contain all live items")
|
|
}
|
|
}
|