mirror of https://github.com/status-im/op-geth.git
b2ddb1fcbf
This PR implements les.freeClientPool. It also adds a simulated clock in common/mclock, which enables time-sensitive tests to run quickly and still produce accurate results, and package common/prque which is a generalised variant of prque that enables removing elements other than the top one from the queue. les.freeClientPool implements a client database that limits the connection time of each client and manages accepting/rejecting incoming connections and even kicking out some connected clients. The pool calculates recent usage time for each known client (a value that increases linearly when the client is connected and decreases exponentially when not connected). Clients with lower recent usage are preferred, unknown nodes have the highest priority. Already connected nodes receive a small bias in their favor in order to avoid accepting and instantly kicking out clients. Note: the pool can use any string for client identification. Using signature keys for that purpose would not make sense when being known has a negative value for the client. Currently the LES protocol manager uses IP addresses (without port address) to identify clients. |
||
|---|---|---|
| .. | ||
| bitutil | ||
| compiler | ||
| fdlimit | ||
| hexutil | ||
| math | ||
| mclock | ||
| prque | ||
| big.go | ||
| bytes.go | ||
| bytes_test.go | ||
| debug.go | ||
| format.go | ||
| main_test.go | ||
| path.go | ||
| size.go | ||
| size_test.go | ||
| test_utils.go | ||
| types.go | ||
| types_test.go | ||