mirror of
https://github.com/slackhq/nebula.git
synced 2026-08-16 01:16:58 +02:00
JackDoan
537 lines
17 KiB
Go
537 lines
17 KiB
Go
package batch
|
||
|
||
import (
|
||
"bytes"
|
||
"encoding/binary"
|
||
"io"
|
||
"testing"
|
||
)
|
||
|
||
// buildUDPv4 builds a minimal IPv4+UDP packet with the given payload and ports.
|
||
func buildUDPv4(sport, dport uint16, payload []byte) []byte {
|
||
const ipHdrLen = 20
|
||
const udpHdrLen = 8
|
||
total := ipHdrLen + udpHdrLen + len(payload)
|
||
pkt := make([]byte, total)
|
||
|
||
pkt[0] = 0x45
|
||
pkt[1] = 0x00
|
||
binary.BigEndian.PutUint16(pkt[2:4], uint16(total))
|
||
binary.BigEndian.PutUint16(pkt[4:6], 0)
|
||
binary.BigEndian.PutUint16(pkt[6:8], 0x4000)
|
||
pkt[8] = 64
|
||
pkt[9] = ipProtoUDP
|
||
copy(pkt[12:16], []byte{10, 0, 0, 1})
|
||
copy(pkt[16:20], []byte{10, 0, 0, 2})
|
||
|
||
binary.BigEndian.PutUint16(pkt[20:22], sport)
|
||
binary.BigEndian.PutUint16(pkt[22:24], dport)
|
||
binary.BigEndian.PutUint16(pkt[24:26], uint16(udpHdrLen+len(payload)))
|
||
binary.BigEndian.PutUint16(pkt[26:28], 0)
|
||
|
||
copy(pkt[28:], payload)
|
||
return pkt
|
||
}
|
||
|
||
// buildUDPv6 builds a minimal IPv6+UDP packet.
|
||
func buildUDPv6(sport, dport uint16, payload []byte) []byte {
|
||
const ipHdrLen = 40
|
||
const udpHdrLen = 8
|
||
total := ipHdrLen + udpHdrLen + len(payload)
|
||
pkt := make([]byte, total)
|
||
|
||
pkt[0] = 0x60
|
||
binary.BigEndian.PutUint16(pkt[4:6], uint16(udpHdrLen+len(payload)))
|
||
pkt[6] = ipProtoUDP
|
||
pkt[7] = 64
|
||
pkt[8] = 0xfe
|
||
pkt[9] = 0x80
|
||
pkt[23] = 1
|
||
pkt[24] = 0xfe
|
||
pkt[25] = 0x80
|
||
pkt[39] = 2
|
||
|
||
binary.BigEndian.PutUint16(pkt[40:42], sport)
|
||
binary.BigEndian.PutUint16(pkt[42:44], dport)
|
||
binary.BigEndian.PutUint16(pkt[44:46], uint16(udpHdrLen+len(payload)))
|
||
binary.BigEndian.PutUint16(pkt[46:48], 0)
|
||
|
||
copy(pkt[48:], payload)
|
||
return pkt
|
||
}
|
||
|
||
// newTestUDPCoalescer builds a coalescer over w and fails the test if w can't
|
||
// do USO. See newTestTCPCoalescer.
|
||
func newTestUDPCoalescer(tb testing.TB, w io.Writer) *UDPCoalescer {
|
||
tb.Helper()
|
||
c := NewUDPCoalescer(w)
|
||
if c == nil {
|
||
tb.Fatal("NewUDPCoalescer: writer does not support USO")
|
||
}
|
||
return c
|
||
}
|
||
|
||
// TestNewUDPCoalescerRefusesWhenGSOUnavailable mirrors the TCP precondition:
|
||
// no USO, no coalescer.
|
||
func TestNewUDPCoalescerRefusesWhenGSOUnavailable(t *testing.T) {
|
||
if c := NewUDPCoalescer(&fakeTunWriter{gsoEnabled: false}); c != nil {
|
||
t.Fatalf("want nil for a non-USO writer, got %v", c)
|
||
}
|
||
if c := NewUDPCoalescer(&plainOnlyWriter{}); c != nil {
|
||
t.Fatalf("want nil for a plain writer, got %v", c)
|
||
}
|
||
}
|
||
|
||
func TestUDPCoalescerNonUDPPassthrough(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
// ICMP packet
|
||
pkt := make([]byte, 28)
|
||
pkt[0] = 0x45
|
||
binary.BigEndian.PutUint16(pkt[2:4], 28)
|
||
pkt[9] = 1
|
||
copy(pkt[12:16], []byte{10, 0, 0, 1})
|
||
copy(pkt[16:20], []byte{10, 0, 0, 2})
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("ICMP must pass through unchanged: writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
}
|
||
|
||
func TestUDPCoalescerSeedThenFlushAlone(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pkt := buildUDPv4(1000, 53, make([]byte, 800))
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// A slot that never grew past one datagram flushes as a plain Write of
|
||
// the original packet bytes: the original (already valid) checksum
|
||
// ships via the DATA_VALID path, so the kernel does no csum work.
|
||
// WriteGSO is reserved for slots that actually coalesced (>=2 segs).
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("single-seg flush: writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
if !bytes.Equal(w.writes[0], pkt) {
|
||
t.Errorf("plain write not byte-identical to committed packet: got %d bytes want %d", len(w.writes[0]), len(pkt))
|
||
}
|
||
}
|
||
|
||
func TestUDPCoalescerCoalescesEqualSized(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 1200)
|
||
for i := 0; i < 3; i++ {
|
||
if err := c.Commit(buildUDPv4(1000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.gsoWrites) != 1 {
|
||
t.Fatalf("want 1 gso write, got %d (plain=%d)", len(w.gsoWrites), len(w.writes))
|
||
}
|
||
g := w.gsoWrites[0]
|
||
if g.gsoSize != 1200 {
|
||
t.Errorf("gsoSize=%d want 1200", g.gsoSize)
|
||
}
|
||
if len(g.pays) != 3 {
|
||
t.Errorf("pay count=%d want 3", len(g.pays))
|
||
}
|
||
if g.csumStart != 20 {
|
||
t.Errorf("csumStart=%d want 20", g.csumStart)
|
||
}
|
||
// IP totalLen and UDP length must be the TOTAL across all segments —
|
||
// the kernel's ip_rcv_core trims skbs to iph->tot_len, so a per-segment
|
||
// value would silently drop everything but the first segment. Total =
|
||
// IP(20) + UDP(8) + 3*1200 = 3628.
|
||
gotTotalLen := binary.BigEndian.Uint16(g.hdr[2:4])
|
||
if gotTotalLen != 3628 {
|
||
t.Errorf("ipv4 total_len=%d want 3628 (must be total across segments)", gotTotalLen)
|
||
}
|
||
gotUDPLen := binary.BigEndian.Uint16(g.hdr[20+4 : 20+6])
|
||
if gotUDPLen != 8+3*1200 {
|
||
t.Errorf("udp len=%d want %d", gotUDPLen, 8+3*1200)
|
||
}
|
||
}
|
||
|
||
// Last segment may be shorter, sealing the chain.
|
||
func TestUDPCoalescerShortLastSegmentSeals(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
full := make([]byte, 1200)
|
||
tail := make([]byte, 600)
|
||
if err := c.Commit(buildUDPv4(1000, 53, full)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, full)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, tail)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// A 4th packet, even same-sized, must NOT join — chain is sealed.
|
||
if err := c.Commit(buildUDPv4(1000, 53, full)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// The sealed 3-datagram chain is a real superpacket; the re-seed stays
|
||
// single-segment and flushes as a plain write of the original packet.
|
||
if len(w.gsoWrites) != 1 || len(w.writes) != 1 {
|
||
t.Fatalf("want 1 gso (sealed) + 1 plain (new seed), got gso=%d plain=%d", len(w.gsoWrites), len(w.writes))
|
||
}
|
||
if len(w.gsoWrites[0].pays) != 3 {
|
||
t.Errorf("super: want 3 pays, got %d", len(w.gsoWrites[0].pays))
|
||
}
|
||
if got, want := len(w.writes[0]), 20+8+1200; got != want {
|
||
t.Errorf("re-seed plain write len=%d want %d", got, want)
|
||
}
|
||
}
|
||
|
||
// A larger-than-gsoSize packet cannot extend the slot — it reseeds.
|
||
func TestUDPCoalescerLargerThanSeedReseeds(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
if err := c.Commit(buildUDPv4(1000, 53, make([]byte, 800))); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, make([]byte, 1200))); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// Both seeds stay single-segment → two plain writes in arrival order.
|
||
if len(w.writes) != 2 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("want 2 separate plain writes, got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
for i, want := range []int{20 + 8 + 800, 20 + 8 + 1200} {
|
||
if len(w.writes[i]) != want {
|
||
t.Errorf("write %d len=%d want %d", i, len(w.writes[i]), want)
|
||
}
|
||
}
|
||
}
|
||
|
||
// Different 5-tuples must not coalesce.
|
||
func TestUDPCoalescerDifferentFlowsKeepSeparate(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 800)
|
||
if err := c.Commit(buildUDPv4(1000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(2000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(2000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// Two flows × 2 datagrams each = 2 superpackets of 2 segments.
|
||
if len(w.gsoWrites) != 2 {
|
||
t.Fatalf("want 2 gso writes (one per flow), got %d", len(w.gsoWrites))
|
||
}
|
||
for i, g := range w.gsoWrites {
|
||
if len(g.pays) != 2 {
|
||
t.Errorf("super %d: want 2 pays, got %d", i, len(g.pays))
|
||
}
|
||
}
|
||
}
|
||
|
||
// Caps at udpCoalesceMaxSegs.
|
||
func TestUDPCoalescerCapsAtMaxSegs(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 100)
|
||
for i := 0; i < udpCoalesceMaxSegs+5; i++ {
|
||
if err := c.Commit(buildUDPv4(1000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// First superpacket holds udpCoalesceMaxSegs segments; the spillover
|
||
// reseeds a new one.
|
||
if len(w.gsoWrites) != 2 {
|
||
t.Fatalf("want 2 gso writes (cap then reseed), got %d", len(w.gsoWrites))
|
||
}
|
||
if len(w.gsoWrites[0].pays) != udpCoalesceMaxSegs {
|
||
t.Errorf("first super: pays=%d want %d", len(w.gsoWrites[0].pays), udpCoalesceMaxSegs)
|
||
}
|
||
if len(w.gsoWrites[1].pays) != 5 {
|
||
t.Errorf("second super: pays=%d want 5", len(w.gsoWrites[1].pays))
|
||
}
|
||
}
|
||
|
||
// Differing IP ECN codepoints must not coalesce: udpHeadersMatch compares
|
||
// the full ToS byte (matching kernel GRO). A CE-marked datagram mid-run
|
||
// seals the Not-ECT chain and reseeds; the trailing Not-ECT datagram
|
||
// reseeds again. All three stay single-segment, so each ships as a plain
|
||
// write of its original bytes, keeping its own codepoint.
|
||
func TestUDPCoalescerDifferingECNReseeds(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 800)
|
||
pkt0 := buildUDPv4(1000, 53, pay) // ECN=00 (Not-ECT)
|
||
pkt1 := buildUDPv4(1000, 53, pay)
|
||
pkt1[1] = 0x03 // CE
|
||
pkt2 := buildUDPv4(1000, 53, pay) // ECN=00 again
|
||
for _, p := range [][]byte{pkt0, pkt1, pkt2} {
|
||
if err := c.Commit(p); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 3 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("want 3 separate plain writes (differing ECN), got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
wantECN := []byte{0x00, 0x03, 0x00}
|
||
for i, p := range w.writes {
|
||
if got := p[1] & 0x03; got != wantECN[i] {
|
||
t.Errorf("write %d ECN=%#x want %#x", i, got, wantECN[i])
|
||
}
|
||
}
|
||
}
|
||
|
||
// IPv6 path: same flow, equal-sized → coalesced.
|
||
func TestUDPCoalescerIPv6Coalesces(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 1200)
|
||
for i := 0; i < 3; i++ {
|
||
if err := c.Commit(buildUDPv6(1000, 53, pay)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.gsoWrites) != 1 {
|
||
t.Fatalf("want 1 gso write, got %d", len(w.gsoWrites))
|
||
}
|
||
g := w.gsoWrites[0]
|
||
if !g.isV6 {
|
||
t.Errorf("expected v6 write")
|
||
}
|
||
if g.csumStart != 40 {
|
||
t.Errorf("csumStart=%d want 40", g.csumStart)
|
||
}
|
||
// IPv6 payload_len and UDP length must be TOTAL — kernel's
|
||
// ip6_rcv_core trims to payload_len + ipv6 hdr size. Total UDP = 8 +
|
||
// 3*1200 = 3608.
|
||
gotPlen := binary.BigEndian.Uint16(g.hdr[4:6])
|
||
if gotPlen != 8+3*1200 {
|
||
t.Errorf("ipv6 payload_len=%d want %d (must be total)", gotPlen, 8+3*1200)
|
||
}
|
||
gotUDPLen := binary.BigEndian.Uint16(g.hdr[40+4 : 40+6])
|
||
if gotUDPLen != 8+3*1200 {
|
||
t.Errorf("udp len=%d want %d", gotUDPLen, 8+3*1200)
|
||
}
|
||
}
|
||
|
||
// DSCP differences must reseed: udpHeadersMatch compares the full ToS byte.
|
||
func TestUDPCoalescerDSCPMismatchReseeds(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 800)
|
||
pkt0 := buildUDPv4(1000, 53, pay)
|
||
pkt1 := buildUDPv4(1000, 53, pay)
|
||
pkt1[1] = 0xb8 // EF DSCP, ECN=0
|
||
if err := c.Commit(pkt0); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(pkt1); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// Both seeds stay single-segment → two plain writes, no gso.
|
||
if len(w.writes) != 2 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("want 2 separate plain writes (different DSCP), got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
}
|
||
|
||
// Fragmented IPv4 must not be coalesced.
|
||
func TestUDPCoalescerFragmentedIPv4PassesThrough(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pkt := buildUDPv4(1000, 53, make([]byte, 200))
|
||
binary.BigEndian.PutUint16(pkt[6:8], 0x2000) // MF=1
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("frag must pass through plain, got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
}
|
||
|
||
// A zero-length UDP datagram (UDP length == 8, no payload) is legal and
|
||
// must be delivered as a plain single datagram — never coalesced. Seeding
|
||
// it into a GSO slot stores an empty payload iovec that panics WriteGSO
|
||
// (index-out-of-range on &pay[0]); this is a remote DoS if we ever let it
|
||
// reach the GSO path. Regression: must not panic and must be written.
|
||
func TestUDPCoalescerZeroLengthPayloadPassesThrough(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pkt := buildUDPv4(1000, 53, nil) // UDP length 8, zero payload
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("zero-length UDP must pass through plain, got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
if len(w.writes[0]) != len(pkt) {
|
||
t.Errorf("delivered %d bytes, want the whole %d-byte datagram", len(w.writes[0]), len(pkt))
|
||
}
|
||
}
|
||
|
||
// IPv6 zero-length UDP datagram: same verbatim contract as v4.
|
||
func TestUDPCoalescerZeroLengthPayloadIPv6PassesThrough(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pkt := buildUDPv6(1000, 53, nil) // UDP length 8, zero payload
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("zero-length IPv6 UDP must pass through plain, got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
if len(w.writes[0]) != len(pkt) {
|
||
t.Errorf("delivered %d bytes, want the whole %d-byte datagram", len(w.writes[0]), len(pkt))
|
||
}
|
||
}
|
||
|
||
// A zero-length datagram arriving mid-flow must seal the open chain so the
|
||
// datagram after it seeds a fresh superpacket *after* the empty one on the
|
||
// wire — per-flow arrival order (full, empty, full) must be preserved.
|
||
func TestUDPCoalescerZeroLengthMidFlowSealsAndPreservesOrder(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
full := make([]byte, 800)
|
||
if err := c.Commit(buildUDPv4(1000, 53, full)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, nil)); err != nil { // zero-length
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(buildUDPv4(1000, 53, full)); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
// The empty datagram sealed the first slot, so the trailing full packet
|
||
// can't join it. All three emit as plain writes (the two full datagrams
|
||
// stayed single-segment; the empty one is verbatim) in per-flow
|
||
// arrival order: full, empty, full.
|
||
if len(w.writes) != 3 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("want 3 plain writes, got gso=%d plain=%d", len(w.gsoWrites), len(w.writes))
|
||
}
|
||
for i, want := range []int{20 + 8 + 800, 20 + 8, 20 + 8 + 800} {
|
||
if len(w.writes[i]) != want {
|
||
t.Errorf("write %d len=%d want %d (order full, empty, full)", i, len(w.writes[i]), want)
|
||
}
|
||
}
|
||
}
|
||
|
||
// IPv4 with options is not admissible (we require IHL=5).
|
||
func TestUDPCoalescerIPv4WithOptionsPassesThrough(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pkt := buildUDPv4(1000, 53, make([]byte, 200))
|
||
pkt[0] = 0x46 // IHL = 6 (24-byte IPv4 header — has options)
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 1 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("ipv4-with-options must pass through plain, got writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
}
|
||
|
||
// TestUDPCoalescerNonAtomicSequentialIDsCoalesce mirrors the TCP rule: DF
|
||
// clear is fine as long as the IDs already run seed+1 per datagram, so
|
||
// kernel USO's re-stamp reproduces them.
|
||
func TestUDPCoalescerNonAtomicSequentialIDsCoalesce(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 1200)
|
||
|
||
for i := range 2 {
|
||
pkt := buildUDPv4(40000, 443, pay)
|
||
setIPv4ID(pkt, uint16(40+i), false)
|
||
if err := c.Commit(pkt); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.gsoWrites) != 1 || len(w.gsoWrites[0].pays) != 2 {
|
||
t.Fatalf("sequential-ID DF=0 datagrams must coalesce: gso=%d", len(w.gsoWrites))
|
||
}
|
||
}
|
||
|
||
// TestUDPCoalescerNonAtomicIDGapReseeds: an ID jump on a DF=0 flow breaks
|
||
// the chain; each datagram stays a single-segment slot and flushes as a
|
||
// plain write that keeps its own (meaningful) ID.
|
||
func TestUDPCoalescerNonAtomicIDGapReseeds(t *testing.T) {
|
||
w := &fakeTunWriter{gsoEnabled: true}
|
||
c := newTestUDPCoalescer(t, w)
|
||
pay := make([]byte, 1200)
|
||
|
||
p1 := buildUDPv4(40000, 443, pay)
|
||
setIPv4ID(p1, 40, false)
|
||
p2 := buildUDPv4(40000, 443, pay)
|
||
setIPv4ID(p2, 50, false)
|
||
|
||
if err := c.Commit(p1); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Commit(p2); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if err := c.Flush(); err != nil {
|
||
t.Fatal(err)
|
||
}
|
||
if len(w.writes) != 2 || len(w.gsoWrites) != 0 {
|
||
t.Fatalf("ID gap on DF=0 must reseed: writes=%d gso=%d", len(w.writes), len(w.gsoWrites))
|
||
}
|
||
for i, want := range []uint16{40, 50} {
|
||
if id := binary.BigEndian.Uint16(w.writes[i][4:6]); id != want {
|
||
t.Errorf("write %d: ID=%d want %d (must be preserved)", i, id, want)
|
||
}
|
||
}
|
||
}
|