-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathserver_test.go
More file actions
306 lines (254 loc) · 8.02 KB
/
Copy pathserver_test.go
File metadata and controls
306 lines (254 loc) · 8.02 KB
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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
// SPDX-License-Identifier: AGPL-3.0-or-later
package beacon
import (
"encoding/binary"
"fmt"
"net"
"net/http"
"testing"
"time"
"github.com/pilot-protocol/common/protocol"
)
// helper: send a discover message to register a node with a beacon
func registerNode(t *testing.T, beaconAddr *net.UDPAddr, nodeID uint32) *net.UDPConn {
t.Helper()
conn, err := net.DialUDP("udp", nil, beaconAddr)
if err != nil {
t.Fatalf("dial beacon: %v", err)
}
msg := make([]byte, 5)
msg[0] = protocol.BeaconMsgDiscover
binary.BigEndian.PutUint32(msg[1:5], nodeID)
if _, err := conn.Write(msg); err != nil {
t.Fatalf("send discover: %v", err)
}
// Read discover reply
buf := make([]byte, 64)
conn.SetReadDeadline(time.Now().Add(2 * time.Second))
n, err := conn.Read(buf)
if err != nil {
t.Fatalf("read discover reply: %v", err)
}
if n < 1 || buf[0] != protocol.BeaconMsgDiscoverReply {
t.Fatalf("unexpected reply type: 0x%02x", buf[0])
}
return conn
}
func beaconUDPAddr(t *testing.T, s *Server) *net.UDPAddr {
t.Helper()
addr, err := net.ResolveUDPAddr("udp", s.Addr().String())
if err != nil {
t.Fatalf("resolve beacon addr: %v", err)
}
return addr
}
// waitUntil polls fn() every 10ms until it returns true or the timeout
// expires. Used in place of fixed sleeps so CI runners under `-race`
// aren't pinned to receive-goroutine-drain assumptions.
func waitUntil(timeout time.Duration, fn func() bool) bool {
deadline := time.Now().Add(timeout)
for time.Now().Before(deadline) {
if fn() {
return true
}
time.Sleep(10 * time.Millisecond)
}
return fn()
}
func TestGossip(t *testing.T) {
t.Parallel()
// Start two beacons — they'll be peers of each other
b1 := NewWithPeers(1, nil) // peers set after both bind
b2 := NewWithPeers(2, nil)
go b1.ListenAndServe("127.0.0.1:0")
go b2.ListenAndServe("127.0.0.1:0")
<-b1.Ready()
<-b2.Ready()
defer b1.Close()
defer b2.Close()
b1Addr := beaconUDPAddr(t, b1)
b2Addr := beaconUDPAddr(t, b2)
// Set peers manually (after bind, so we know the ports)
b1.peers = []*net.UDPAddr{b2Addr}
b2.peers = []*net.UDPAddr{b1Addr}
// Register node 100 on beacon 1
conn1 := registerNode(t, b1Addr, 100)
defer conn1.Close()
// Register node 200 on beacon 2
conn2 := registerNode(t, b2Addr, 200)
defer conn2.Close()
// Verify local counts
if b1.LocalNodeCount() != 1 {
t.Fatalf("b1 local nodes: got %d, want 1", b1.LocalNodeCount())
}
if b2.LocalNodeCount() != 1 {
t.Fatalf("b2 local nodes: got %d, want 1", b2.LocalNodeCount())
}
// Trigger gossip manually
b1.sendGossip()
b2.sendGossip()
// Each beacon should know about the other's node via gossip
if !waitUntil(2*time.Second, func() bool { return b1.PeerNodeCount() == 1 && b2.PeerNodeCount() == 1 }) {
t.Errorf("b1 peer nodes: got %d, want 1", b1.PeerNodeCount())
t.Errorf("b2 peer nodes: got %d, want 1", b2.PeerNodeCount())
}
}
func TestCrossBeaconRelay(t *testing.T) {
t.Parallel()
b1 := NewWithPeers(1, nil)
b2 := NewWithPeers(2, nil)
go b1.ListenAndServe("127.0.0.1:0")
go b2.ListenAndServe("127.0.0.1:0")
<-b1.Ready()
<-b2.Ready()
defer b1.Close()
defer b2.Close()
b1Addr := beaconUDPAddr(t, b1)
b2Addr := beaconUDPAddr(t, b2)
b1.peers = []*net.UDPAddr{b2Addr}
b2.peers = []*net.UDPAddr{b1Addr}
// Register node 10 on beacon 1
conn1 := registerNode(t, b1Addr, 10)
defer conn1.Close()
// Register node 20 on beacon 2
conn2 := registerNode(t, b2Addr, 20)
defer conn2.Close()
// Gossip so b1 knows node 20 is on b2 — poll instead of fixed
// sleep so this isn't tight under CI load.
b1.sendGossip()
b2.sendGossip()
if !waitUntil(5*time.Second, func() bool {
return b1.PeerNodeCount() >= 1 && b2.PeerNodeCount() >= 1
}) {
t.Fatal("gossip did not propagate before relay send")
}
// Node 10 sends relay to node 20 via beacon 1
// beacon 1 should forward to beacon 2, which delivers to node 20
payload := []byte("hello from node 10")
relayMsg := make([]byte, 1+4+4+len(payload))
relayMsg[0] = protocol.BeaconMsgRelay
binary.BigEndian.PutUint32(relayMsg[1:5], 10) // sender
binary.BigEndian.PutUint32(relayMsg[5:9], 20) // dest
copy(relayMsg[9:], payload)
if _, err := conn1.Write(relayMsg); err != nil {
t.Fatalf("send relay: %v", err)
}
// Node 20 should receive a RelayDeliver. 10s deadline gives CI
// runners under -race comfortable margin; happy path still ~10ms.
buf := make([]byte, 1500)
conn2.SetReadDeadline(time.Now().Add(10 * time.Second))
n, err := conn2.Read(buf)
if err != nil {
t.Fatalf("read relay deliver: %v", err)
}
if buf[0] != protocol.BeaconMsgRelayDeliver {
t.Fatalf("expected RelayDeliver (0x%02x), got 0x%02x", protocol.BeaconMsgRelayDeliver, buf[0])
}
senderID := binary.BigEndian.Uint32(buf[1:5])
if senderID != 10 {
t.Fatalf("sender ID: got %d, want 10", senderID)
}
received := string(buf[5:n])
if received != "hello from node 10" {
t.Fatalf("payload: got %q, want %q", received, "hello from node 10")
}
}
func TestHealthEndpoint(t *testing.T) {
t.Parallel()
s := New()
go s.ListenAndServe("127.0.0.1:0")
<-s.Ready()
defer s.Close()
// Find a free port for health
ln, err := net.Listen("tcp", "127.0.0.1:0")
if err != nil {
t.Fatalf("find free port: %v", err)
}
healthAddr := ln.Addr().String()
ln.Close()
go s.ServeHealth(healthAddr)
time.Sleep(100 * time.Millisecond) // let HTTP server start
url := fmt.Sprintf("http://%s/healthz", healthAddr)
// Should be healthy by default
resp, err := http.Get(url)
if err != nil {
t.Fatalf("GET /healthz: %v", err)
}
if resp.StatusCode != 200 {
t.Fatalf("expected 200, got %d", resp.StatusCode)
}
resp.Body.Close()
// /healthz always returns 200 regardless of drain state
// (operational fingerprint — drain state should not be broadcast)
s.SetHealthy(false)
resp, err = http.Get(url)
if err != nil {
t.Fatalf("GET /healthz after unhealthy: %v", err)
}
if resp.StatusCode != 200 {
t.Fatalf("expected 200 (no drain fingerprint), got %d", resp.StatusCode)
}
resp.Body.Close()
// Return to healthy — still 200
s.SetHealthy(true)
resp, err = http.Get(url)
if err != nil {
t.Fatalf("GET /healthz after re-healthy: %v", err)
}
if resp.StatusCode != 200 {
t.Fatalf("expected 200, got %d", resp.StatusCode)
}
resp.Body.Close()
}
func TestSyncMessageParsing(t *testing.T) {
t.Parallel()
s := NewWithPeers(1, nil)
go s.ListenAndServe("127.0.0.1:0")
<-s.Ready()
defer s.Close()
// Build a sync message with 3 nodes
nodeIDs := []uint32{100, 200, 300}
msg := make([]byte, 1+4+2+4*len(nodeIDs))
msg[0] = protocol.BeaconMsgSync
binary.BigEndian.PutUint32(msg[1:5], 2) // peer beacon ID
binary.BigEndian.PutUint16(msg[5:7], uint16(len(nodeIDs)))
for i, id := range nodeIDs {
binary.BigEndian.PutUint32(msg[7+4*i:7+4*i+4], id)
}
// Send the sync message to the beacon
conn, err := net.DialUDP("udp", nil, beaconUDPAddr(t, s))
if err != nil {
t.Fatalf("dial: %v", err)
}
defer conn.Close()
if _, err := conn.Write(msg); err != nil {
t.Fatalf("send sync: %v", err)
}
if !waitUntil(2*time.Second, func() bool { return s.PeerNodeCount() == 3 }) {
t.Fatalf("peer nodes: got %d, want 3", s.PeerNodeCount())
}
}
// TestServer_CloseIsIdempotent regression-guards the fix that wraps
// Server.Close() in sync.Once. Prior to the fix the second Close()
// re-invoked Close() on every already-closed *net.UDPConn in s.conns,
// surfacing "use of closed network connection" as firstErr.
func TestServer_CloseIsIdempotent(t *testing.T) {
t.Parallel()
s := New()
go s.ListenAndServe("127.0.0.1:0")
<-s.Ready()
if err := s.Close(); err != nil {
t.Fatalf("first Close: unexpected error: %v", err)
}
// The bug: pre-fix this second call walked s.conns and re-closed
// each *net.UDPConn, returning "use of closed network connection".
// With sync.Once + cached closeErr it must be a no-op.
if err := s.Close(); err != nil {
t.Fatalf("second Close: expected no-op, got: %v", err)
}
// A third call for good measure — sync.Once guarantees the
// teardown body runs exactly once regardless of call count.
if err := s.Close(); err != nil {
t.Fatalf("third Close: expected no-op, got: %v", err)
}
}