130 lines
3.7 KiB
Go
130 lines
3.7 KiB
Go
// Copyright 2020 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 server
|
|
|
|
import (
|
|
"math/rand"
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/ethereum/go-ethereum/common/mclock"
|
|
"github.com/ethereum/go-ethereum/p2p/enode"
|
|
"github.com/ethereum/go-ethereum/p2p/enr"
|
|
"github.com/ethereum/go-ethereum/p2p/nodestate"
|
|
)
|
|
|
|
var (
|
|
testSetup = &nodestate.Setup{}
|
|
ppTestClientFlag = testSetup.NewFlag("ppTestClientFlag")
|
|
ppTestClientField = testSetup.NewField("ppTestClient", reflect.TypeOf(&ppTestClient{}))
|
|
ppUpdateFlag = testSetup.NewFlag("ppUpdateFlag")
|
|
ppTestSetup = NewPriorityPoolSetup(testSetup)
|
|
)
|
|
|
|
func init() {
|
|
ppTestSetup.Connect(ppTestClientField, ppUpdateFlag)
|
|
}
|
|
|
|
const (
|
|
testCapacityStepDiv = 100
|
|
testCapacityToleranceDiv = 10
|
|
)
|
|
|
|
type ppTestClient struct {
|
|
node *enode.Node
|
|
balance, cap uint64
|
|
}
|
|
|
|
func (c *ppTestClient) Priority(now mclock.AbsTime, cap uint64) int64 {
|
|
return int64(c.balance / cap)
|
|
}
|
|
|
|
func (c *ppTestClient) EstMinPriority(until mclock.AbsTime, cap uint64, update bool) int64 {
|
|
return int64(c.balance / cap)
|
|
}
|
|
|
|
func TestPriorityPool(t *testing.T) {
|
|
clock := &mclock.Simulated{}
|
|
ns := nodestate.NewNodeStateMachine(nil, nil, clock, testSetup)
|
|
|
|
ns.SubscribeField(ppTestSetup.CapacityField, func(node *enode.Node, state nodestate.Flags, oldValue, newValue interface{}) {
|
|
if n := ns.GetField(node, ppTestSetup.priorityField); n != nil {
|
|
c := n.(*ppTestClient)
|
|
c.cap = newValue.(uint64)
|
|
}
|
|
})
|
|
pp := NewPriorityPool(ns, ppTestSetup, clock, 100, 0, testCapacityStepDiv)
|
|
ns.Start()
|
|
pp.SetLimits(100, 1000000)
|
|
clients := make([]*ppTestClient, 100)
|
|
raise := func(c *ppTestClient) {
|
|
for {
|
|
var ok bool
|
|
ns.Operation(func() {
|
|
_, ok = pp.RequestCapacity(c.node, c.cap+c.cap/testCapacityStepDiv, 0, true)
|
|
})
|
|
if !ok {
|
|
return
|
|
}
|
|
}
|
|
}
|
|
var sumBalance uint64
|
|
check := func(c *ppTestClient) {
|
|
expCap := 1000000 * c.balance / sumBalance
|
|
capTol := expCap / testCapacityToleranceDiv
|
|
if c.cap < expCap-capTol || c.cap > expCap+capTol {
|
|
t.Errorf("Wrong node capacity (expected %d, got %d)", expCap, c.cap)
|
|
}
|
|
}
|
|
|
|
for i := range clients {
|
|
c := &ppTestClient{
|
|
node: enode.SignNull(&enr.Record{}, enode.ID{byte(i)}),
|
|
balance: 1000000000,
|
|
cap: 1000,
|
|
}
|
|
sumBalance += c.balance
|
|
clients[i] = c
|
|
ns.SetState(c.node, ppTestClientFlag, nodestate.Flags{}, 0)
|
|
ns.SetField(c.node, ppTestSetup.priorityField, c)
|
|
ns.SetState(c.node, ppTestSetup.InactiveFlag, nodestate.Flags{}, 0)
|
|
raise(c)
|
|
check(c)
|
|
}
|
|
|
|
for count := 0; count < 100; count++ {
|
|
c := clients[rand.Intn(len(clients))]
|
|
oldBalance := c.balance
|
|
c.balance = uint64(rand.Int63n(1000000000) + 1000000000)
|
|
sumBalance += c.balance - oldBalance
|
|
pp.ns.SetState(c.node, ppUpdateFlag, nodestate.Flags{}, 0)
|
|
pp.ns.SetState(c.node, nodestate.Flags{}, ppUpdateFlag, 0)
|
|
if c.balance > oldBalance {
|
|
raise(c)
|
|
} else {
|
|
for _, c := range clients {
|
|
raise(c)
|
|
}
|
|
}
|
|
for _, c := range clients {
|
|
check(c)
|
|
}
|
|
}
|
|
|
|
ns.Stop()
|
|
}
|