aboutsummaryrefslogtreecommitdiffstats
path: root/les/distributor_test.go
blob: f2eb80729b0dad873cdcd6c7b03bae29d6e0ee30 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
// Copyright 2016 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 light implements on-demand retrieval capable state and chain objects
// for the Ethereum Light Client.
package les

import (
    "math/rand"
    "sync"
    "testing"
    "time"
)

type testDistReq struct {
    cost, procTime, order uint64
    canSendTo             map[*testDistPeer]struct{}
}

func (r *testDistReq) getCost(dp distPeer) uint64 {
    return r.cost
}

func (r *testDistReq) canSend(dp distPeer) bool {
    _, ok := r.canSendTo[dp.(*testDistPeer)]
    return ok
}

func (r *testDistReq) request(dp distPeer) func() {
    return func() { dp.(*testDistPeer).send(r) }
}

type testDistPeer struct {
    sent    []*testDistReq
    sumCost uint64
    lock    sync.RWMutex
}

func (p *testDistPeer) send(r *testDistReq) {
    p.lock.Lock()
    defer p.lock.Unlock()

    p.sent = append(p.sent, r)
    p.sumCost += r.cost
}

func (p *testDistPeer) worker(t *testing.T, checkOrder bool, stop chan struct{}) {
    var last uint64
    for {
        wait := time.Millisecond
        p.lock.Lock()
        if len(p.sent) > 0 {
            rq := p.sent[0]
            wait = time.Duration(rq.procTime)
            p.sumCost -= rq.cost
            if checkOrder {
                if rq.order <= last {
                    t.Errorf("Requests processed in wrong order")
                }
                last = rq.order
            }
            p.sent = p.sent[1:]
        }
        p.lock.Unlock()
        select {
        case <-stop:
            return
        case <-time.After(wait):
        }
    }
}

const (
    testDistBufLimit       = 10000000
    testDistMaxCost        = 1000000
    testDistPeerCount      = 5
    testDistReqCount       = 50000
    testDistMaxResendCount = 3
)

func (p *testDistPeer) waitBefore(cost uint64) (time.Duration, float64) {
    p.lock.RLock()
    sumCost := p.sumCost + cost
    p.lock.RUnlock()
    if sumCost < testDistBufLimit {
        return 0, float64(testDistBufLimit-sumCost) / float64(testDistBufLimit)
    } else {
        return time.Duration(sumCost - testDistBufLimit), 0
    }
}

func (p *testDistPeer) canQueue() bool {
    return true
}

func (p *testDistPeer) queueSend(f func()) {
    f()
}

func TestRequestDistributor(t *testing.T) {
    testRequestDistributor(t, false)
}

func TestRequestDistributorResend(t *testing.T) {
    testRequestDistributor(t, true)
}

func testRequestDistributor(t *testing.T, resend bool) {
    stop := make(chan struct{})
    defer close(stop)

    var peers [testDistPeerCount]*testDistPeer
    for i, _ := range peers {
        peers[i] = &testDistPeer{}
        go peers[i].worker(t, !resend, stop)
    }

    dist := newRequestDistributor(func() map[distPeer]struct{} {
        m := make(map[distPeer]struct{})
        for _, peer := range peers {
            m[peer] = struct{}{}
        }
        return m
    }, stop)

    var wg sync.WaitGroup

    for i := 1; i <= testDistReqCount; i++ {
        cost := uint64(rand.Int63n(testDistMaxCost))
        procTime := uint64(rand.Int63n(int64(cost + 1)))
        rq := &testDistReq{
            cost:      cost,
            procTime:  procTime,
            order:     uint64(i),
            canSendTo: make(map[*testDistPeer]struct{}),
        }
        for _, peer := range peers {
            if rand.Intn(2) != 0 {
                rq.canSendTo[peer] = struct{}{}
            }
        }

        wg.Add(1)
        req := &distReq{
            getCost: rq.getCost,
            canSend: rq.canSend,
            request: rq.request,
        }
        chn := dist.queue(req)
        go func() {
            cnt := 1
            if resend && len(rq.canSendTo) != 0 {
                cnt = rand.Intn(testDistMaxResendCount) + 1
            }
            for i := 0; i < cnt; i++ {
                if i != 0 {
                    chn = dist.queue(req)
                }
                p := <-chn
                if p == nil {
                    if len(rq.canSendTo) != 0 {
                        t.Errorf("Request that could have been sent was dropped")
                    }
                } else {
                    peer := p.(*testDistPeer)
                    if _, ok := rq.canSendTo[peer]; !ok {
                        t.Errorf("Request sent to wrong peer")
                    }
                }
            }
            wg.Done()
        }()
        if rand.Intn(1000) == 0 {
            time.Sleep(time.Duration(rand.Intn(5000000)))
        }
    }

    wg.Wait()
}