mirror of
https://github.com/tailscale/tailscale.git
synced 2026-10-29 22:49:17 -04:00
Make link queue writes nonblocking: gVisor can generate replies on the reader needed to drain the queue. A full queue drops only the rejected packet and reports ErrNoBufferSpace, which gVisor counts and TCP handles by arming its retransmit timer. UDP sockets do not see the error unless IP_RECVERR is set, matching Linux. Count WireGuard-bound drops as reason="queue_full" in tailscaled_outbound_dropped_packets_total, and per-queue drops in debug and client metrics. Add Wrapper.TryInjectOutbound for best-effort replies generated while processing packets (TSMP rejects and pongs, conn25 rejects, fake-mode echo replies), so those paths drop instead of stalling behind the injection queue's reader. Its drops are also counted as queue_full. Make outbound injection waits cancellable and close link queues before abort-generated replies. Stop the WireGuard injection pump on ErrClosed. Release injected packets still queued at Close, outside closeOnce to allow reentrant release callbacks; a sender whose send races with Close releases the packet itself. Release temporary capture buffers. Copy injected payload views directly into the WireGuard slab, avoiding an intermediate allocation and copy. Test queue saturation, multiqueue progress, cancellation, concurrent shutdown, reference ownership, fragmented payloads, and GSO. Performance versus the parent commit, on a 4-core Xeon 6975P-C: inject+read 64B / 1280B 245ns / 479ns -> 187ns / 195ns, 0 allocs 4 injectors, 1 reader 843ns -> 451ns 64KiB GSO inject+split 10.9us -> 4.4us, 64KiB/op -> 0 link queue write+read 81.4ns -> 81.5ns tsnet TCP, 1 / 8 streams 448 / 580 MB/s -> 492 / 674 MB/s BenchmarkTCPQueueBottleneck shows that dropping on full queues keeps throughput at the bottleneck rate (117 MB/s at 100k packets/s, as with blocking writes), at the cost of more retransmits with many streams. Fixes #21631 Updates #21638 Updates #21632 Updates #21639 Signed-off-by: James Tucker <james@tailscale.com>
450 lines
13 KiB
Go
450 lines
13 KiB
Go
// Copyright (c) Tailscale Inc & contributors
|
|
// SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
package netstack
|
|
|
|
import (
|
|
"context"
|
|
"expvar"
|
|
"fmt"
|
|
"sync"
|
|
"sync/atomic"
|
|
|
|
"gvisor.dev/gvisor/pkg/buffer"
|
|
"gvisor.dev/gvisor/pkg/tcpip"
|
|
"gvisor.dev/gvisor/pkg/tcpip/header"
|
|
"gvisor.dev/gvisor/pkg/tcpip/stack"
|
|
"tailscale.com/feature/buildfeatures"
|
|
"tailscale.com/net/packet"
|
|
"tailscale.com/types/ipproto"
|
|
"tailscale.com/util/usermetric"
|
|
"tailscale.com/wgengine/netstack/gro"
|
|
)
|
|
|
|
type queue struct {
|
|
// TODO(jwhited): evaluate performance with a non-channel buffer.
|
|
c chan *stack.PacketBuffer
|
|
|
|
closeOnce sync.Once
|
|
closedCh chan struct{}
|
|
|
|
mu sync.RWMutex
|
|
closed bool
|
|
}
|
|
|
|
func (q *queue) Close() {
|
|
q.closeOnce.Do(func() {
|
|
close(q.closedCh)
|
|
})
|
|
|
|
q.mu.Lock()
|
|
defer q.mu.Unlock()
|
|
if q.closed {
|
|
return
|
|
}
|
|
close(q.c)
|
|
q.closed = true
|
|
}
|
|
|
|
func (q *queue) Read() *stack.PacketBuffer {
|
|
select {
|
|
case p := <-q.c:
|
|
return p
|
|
default:
|
|
return nil
|
|
}
|
|
}
|
|
|
|
func (q *queue) ReadContext(ctx context.Context) *stack.PacketBuffer {
|
|
select {
|
|
case pkt := <-q.c:
|
|
return pkt
|
|
case <-ctx.Done():
|
|
return nil
|
|
}
|
|
}
|
|
|
|
func (q *queue) Write(pkt *stack.PacketBuffer) tcpip.Error {
|
|
q.mu.RLock()
|
|
defer q.mu.RUnlock()
|
|
if q.closed {
|
|
return &tcpip.ErrClosedForSend{}
|
|
}
|
|
select {
|
|
case q.c <- pkt.IncRef():
|
|
return nil
|
|
case <-q.closedCh:
|
|
pkt.DecRef()
|
|
return &tcpip.ErrClosedForSend{}
|
|
default:
|
|
// Packet processing can synchronously generate a reply on the TUN
|
|
// reader or loopback consumer. Neither may wait for queue space:
|
|
// draining the queue can depend on that same goroutine.
|
|
pkt.DecRef() // balance the IncRef evaluated before selecting a case
|
|
return &tcpip.ErrNoBufferSpace{}
|
|
}
|
|
}
|
|
|
|
func (q *queue) Drain() int {
|
|
c := 0
|
|
for pkt := range q.c {
|
|
pkt.DecRef()
|
|
c++
|
|
}
|
|
return c
|
|
}
|
|
|
|
func (q *queue) Num() int {
|
|
return len(q.c)
|
|
}
|
|
|
|
var _ stack.LinkEndpoint = (*linkEndpoint)(nil)
|
|
var _ stack.GSOEndpoint = (*linkEndpoint)(nil)
|
|
|
|
type supportedGRO int
|
|
|
|
const (
|
|
groNotSupported supportedGRO = iota
|
|
tcpGROSupported
|
|
)
|
|
|
|
// outboundQueueRouter is a function that takes an input packet and returns an
|
|
// associated [outboundQueue] decision.
|
|
type outboundQueueRouter func(*stack.PacketBuffer) outboundQueue
|
|
|
|
// outboundQueue describes outbound [queue]'s attached to [linkEndpoint].
|
|
type outboundQueue int
|
|
|
|
const (
|
|
// outboundDrop indicates that the packet should be discarded. It does not
|
|
// correspond to a real queue.
|
|
outboundDrop outboundQueue = iota
|
|
// outboundToWireGuard is the outboundQueue for packets that should be
|
|
// delivered to WireGuard for potential transmission to a remote peer.
|
|
outboundToWireGuard
|
|
// outboundToHost is the outboundQueue for packets that should be delivered
|
|
// to the local host networking stack.
|
|
outboundToHost
|
|
// outboundLoopback is the outboundQueue for packets that should be looped
|
|
// back into gVisor.
|
|
outboundLoopback
|
|
// outboundQueueLimit is the exclusive upper bound of outboundQueue values.
|
|
outboundQueueLimit
|
|
)
|
|
|
|
// linkEndpoint implements [stack.LinkEndpoint] and [stack.GSOEndpoint]. Outbound
|
|
// packets written by gVisor towards Tailscale are stored in one of several
|
|
// outbound [queue]'s. Inbound is fed to gVisor via [linkEndpoint.injectInbound]
|
|
// or [linkEndpoint.gro]. linkEndpoint is loosely modeled after
|
|
// [gvisor.dev/pkg/tcpip/link/channel.Endpoint].
|
|
type linkEndpoint struct {
|
|
SupportedGSOKind stack.SupportedGSO
|
|
supportedGRO supportedGRO
|
|
outboundQueueRouter outboundQueueRouter
|
|
|
|
mu sync.RWMutex // mu guards the following fields
|
|
dispatcher stack.NetworkDispatcher
|
|
linkAddr tcpip.LinkAddress
|
|
mtu uint32
|
|
|
|
outboundQueues [outboundQueueLimit]*queue // outbound
|
|
|
|
// queueFullDropped counts, per [outboundQueue], packets dropped by
|
|
// WritePackets because that queue was full. A GSO packet counts as one.
|
|
queueFullDropped [outboundQueueLimit]expvar.Int
|
|
|
|
// outboundDropped, if set, is the user metric for packets dropped while
|
|
// being sent to peers. It is shared with tstun, so it is added to rather
|
|
// than replaced with queueFullDropped.
|
|
outboundDropped atomic.Pointer[usermetric.MultiLabelMap[usermetric.DropLabels]]
|
|
}
|
|
|
|
// queueFullDroppedTotal returns the sum of queueFullDropped.
|
|
func (ep *linkEndpoint) queueFullDroppedTotal() int64 {
|
|
var total int64
|
|
for i := range ep.queueFullDropped {
|
|
total += ep.queueFullDropped[i].Value()
|
|
}
|
|
return total
|
|
}
|
|
|
|
// newLinkEndpoint constructs a [*linkEndpoint]. size is applied independently
|
|
// to each outbound [queue], so total size = num outbound queues * size.
|
|
func newLinkEndpoint(size int, mtu uint32, linkAddr tcpip.LinkAddress, supportedGRO supportedGRO, outboundQueueRouter outboundQueueRouter) *linkEndpoint {
|
|
le := &linkEndpoint{
|
|
supportedGRO: supportedGRO,
|
|
outboundQueueRouter: outboundQueueRouter,
|
|
mtu: mtu,
|
|
linkAddr: linkAddr,
|
|
}
|
|
for n := range le.outboundQueues {
|
|
if n == int(outboundDrop) {
|
|
continue
|
|
}
|
|
le.outboundQueues[n] = &queue{
|
|
c: make(chan *stack.PacketBuffer, size),
|
|
closedCh: make(chan struct{}),
|
|
}
|
|
}
|
|
return le
|
|
}
|
|
|
|
// gro attempts to enqueue p on g if ep supports a GRO kind matching the
|
|
// transport protocol carried in p. gro may allocate g if it is nil. gro can
|
|
// either return the existing g, a newly allocated one, or nil. Callers are
|
|
// responsible for calling Flush() on the returned value if it is non-nil once
|
|
// they have finished iterating through all GRO candidates for a given vector.
|
|
// If gro allocates a *gro.GRO it will have ep's stack.NetworkDispatcher set via
|
|
// SetDispatcher().
|
|
func (ep *linkEndpoint) gro(p *packet.Parsed, g *gro.GRO) *gro.GRO {
|
|
if !buildfeatures.HasGRO || ep.supportedGRO == groNotSupported || p.IPProto != ipproto.TCP {
|
|
// IPv6 may have extension headers preceding a TCP header, but we trade
|
|
// for a fast path and assume p cannot be coalesced in such a case.
|
|
ep.injectInbound(p)
|
|
return g
|
|
}
|
|
if g == nil {
|
|
ep.mu.RLock()
|
|
d := ep.dispatcher
|
|
ep.mu.RUnlock()
|
|
g = gro.NewGRO()
|
|
g.SetDispatcher(d)
|
|
}
|
|
g.Enqueue(p)
|
|
return g
|
|
}
|
|
|
|
// Close closes ep. Further packet injections will return an error, and all
|
|
// pending packets are discarded. Close may be called concurrently with
|
|
// WritePackets.
|
|
func (ep *linkEndpoint) Close() {
|
|
ep.mu.Lock()
|
|
ep.dispatcher = nil
|
|
ep.mu.Unlock()
|
|
for _, q := range ep.outboundQueues {
|
|
if q != nil {
|
|
q.Close()
|
|
}
|
|
}
|
|
ep.Drain()
|
|
}
|
|
|
|
// Read reads from the provided [outboundQueue] in non-blocking fashion.
|
|
func (ep *linkEndpoint) Read(queue outboundQueue) *stack.PacketBuffer {
|
|
return ep.outboundQueues[queue].Read()
|
|
}
|
|
|
|
// ReadContext reads from the provided [outboundQueue] in blocking fashion. It
|
|
// can be canceled by ctx, in which case it will return nil.
|
|
func (ep *linkEndpoint) ReadContext(ctx context.Context, queue outboundQueue) *stack.PacketBuffer {
|
|
return ep.outboundQueues[queue].ReadContext(ctx)
|
|
}
|
|
|
|
// Drain drains all packets from outbound queues and returns the number drained.
|
|
func (ep *linkEndpoint) Drain() int {
|
|
var total int
|
|
for _, q := range ep.outboundQueues {
|
|
if q != nil {
|
|
total += q.Drain()
|
|
}
|
|
}
|
|
return total
|
|
}
|
|
|
|
// NumQueued returns the number of packets queued for outbound.
|
|
func (ep *linkEndpoint) NumQueued() int {
|
|
var total int
|
|
for _, q := range ep.outboundQueues {
|
|
if q != nil {
|
|
total += q.Num()
|
|
}
|
|
}
|
|
return total
|
|
}
|
|
|
|
func (ep *linkEndpoint) injectInbound(p *packet.Parsed) {
|
|
ep.mu.RLock()
|
|
d := ep.dispatcher
|
|
ep.mu.RUnlock()
|
|
if d == nil || !buildfeatures.HasNetstack {
|
|
return
|
|
}
|
|
pkt := gro.RXChecksumOffload(p)
|
|
if pkt == nil {
|
|
return
|
|
}
|
|
d.DeliverNetworkPacket(pkt.NetworkProtocolNumber, pkt)
|
|
pkt.DecRef()
|
|
}
|
|
|
|
// DeliverLoopback delivers pkt back into gVisor's network stack as if it
|
|
// arrived from the network, for self-addressed (loopback) packets. It takes
|
|
// ownership of one reference count on pkt. The caller must not use pkt after
|
|
// calling this method. It returns false if the dispatcher is not attached.
|
|
//
|
|
// Outbound packets from gVisor have their headers already parsed into separate
|
|
// views (NetworkHeader, TransportHeader, Data). DeliverNetworkPacket expects
|
|
// a raw unparsed packet, so we must re-serialize the packet into a new
|
|
// PacketBuffer with all bytes in the payload for gVisor to parse on inbound.
|
|
func (ep *linkEndpoint) DeliverLoopback(pkt *stack.PacketBuffer) bool {
|
|
ep.mu.RLock()
|
|
d := ep.dispatcher
|
|
ep.mu.RUnlock()
|
|
if d == nil {
|
|
pkt.DecRef()
|
|
return false
|
|
}
|
|
|
|
// Serialize the outbound packet back to raw bytes.
|
|
raw := stack.PayloadSince(pkt.NetworkHeader()).AsSlice()
|
|
proto := pkt.NetworkProtocolNumber
|
|
|
|
// We're done with the original outbound packet.
|
|
pkt.DecRef()
|
|
|
|
// Create a new PacketBuffer from the raw bytes for inbound delivery.
|
|
newPkt := stack.NewPacketBuffer(stack.PacketBufferOptions{
|
|
Payload: buffer.MakeWithData(raw),
|
|
})
|
|
newPkt.NetworkProtocolNumber = proto
|
|
newPkt.RXChecksumValidated = true
|
|
|
|
d.DeliverNetworkPacket(proto, newPkt)
|
|
newPkt.DecRef()
|
|
return true
|
|
}
|
|
|
|
// Attach saves the stack network-layer dispatcher for use later when packets
|
|
// are injected.
|
|
func (ep *linkEndpoint) Attach(dispatcher stack.NetworkDispatcher) {
|
|
ep.mu.Lock()
|
|
defer ep.mu.Unlock()
|
|
ep.dispatcher = dispatcher
|
|
}
|
|
|
|
// IsAttached implements stack.LinkEndpoint.IsAttached.
|
|
func (ep *linkEndpoint) IsAttached() bool {
|
|
ep.mu.RLock()
|
|
defer ep.mu.RUnlock()
|
|
return ep.dispatcher != nil
|
|
}
|
|
|
|
// MTU implements stack.LinkEndpoint.MTU.
|
|
func (ep *linkEndpoint) MTU() uint32 {
|
|
ep.mu.RLock()
|
|
defer ep.mu.RUnlock()
|
|
return ep.mtu
|
|
}
|
|
|
|
// SetMTU implements stack.LinkEndpoint.SetMTU.
|
|
func (ep *linkEndpoint) SetMTU(mtu uint32) {
|
|
ep.mu.Lock()
|
|
defer ep.mu.Unlock()
|
|
ep.mtu = mtu
|
|
}
|
|
|
|
// Capabilities implements stack.LinkEndpoint.Capabilities.
|
|
func (ep *linkEndpoint) Capabilities() stack.LinkEndpointCapabilities {
|
|
// We are required to offload RX checksum validation for the purposes of
|
|
// GRO.
|
|
return stack.CapabilityRXChecksumOffload
|
|
}
|
|
|
|
// GSOMaxSize implements stack.GSOEndpoint.
|
|
func (*linkEndpoint) GSOMaxSize() uint32 {
|
|
// This an increase from 32k returned by channel.Endpoint.GSOMaxSize() to
|
|
// 64k, which improves throughput.
|
|
return (1 << 16) - 1
|
|
}
|
|
|
|
// SupportedGSO implements stack.GSOEndpoint.
|
|
func (ep *linkEndpoint) SupportedGSO() stack.SupportedGSO {
|
|
return ep.SupportedGSOKind
|
|
}
|
|
|
|
// MaxHeaderLength returns the maximum size of the link layer header. Given it
|
|
// doesn't have a header, it just returns 0.
|
|
func (*linkEndpoint) MaxHeaderLength() uint16 {
|
|
return 0
|
|
}
|
|
|
|
// LinkAddress returns the link address of this endpoint.
|
|
func (ep *linkEndpoint) LinkAddress() tcpip.LinkAddress {
|
|
ep.mu.RLock()
|
|
defer ep.mu.RUnlock()
|
|
return ep.linkAddr
|
|
}
|
|
|
|
// SetLinkAddress implements stack.LinkEndpoint.SetLinkAddress.
|
|
func (ep *linkEndpoint) SetLinkAddress(addr tcpip.LinkAddress) {
|
|
ep.mu.Lock()
|
|
defer ep.mu.Unlock()
|
|
ep.linkAddr = addr
|
|
}
|
|
|
|
// WritePackets routes outbound packets into the appropriate outbound [queue].
|
|
// Multiple concurrent calls are permitted. Packets whose queue is full are
|
|
// dropped and excluded from the returned count; if any were dropped, the error
|
|
// is [tcpip.ErrNoBufferSpace].
|
|
func (ep *linkEndpoint) WritePackets(pkts stack.PacketBufferList) (int, tcpip.Error) {
|
|
n := 0
|
|
var full bool
|
|
// TODO(jwhited): evaluate writing a stack.PacketBufferList instead of a
|
|
// single packet. We can split 2 x 64K GSO across
|
|
// wireguard-go/conn.IdealBatchSize (128 slots) @ 1280 MTU, and non-GSO we
|
|
// could do more. Read API would need to change to take advantage. Verify
|
|
// gVisor limits around max number of segments packed together. Since we
|
|
// control MTU (and by effect TCP MSS in gVisor) we *shouldn't* expect to
|
|
// ever overflow 128 slots (see wireguard-go/tun.ErrTooManySegments usage).
|
|
for _, pkt := range pkts.AsSlice() {
|
|
q := ep.outboundQueueRouter(pkt)
|
|
if q == outboundDrop {
|
|
n++
|
|
continue
|
|
}
|
|
if q < 0 || q >= outboundQueueLimit {
|
|
panic(fmt.Sprintf("linkEndpoint.outboundQueueRouter returned %v which is outside outboundQueueLimit(%v)", q, outboundQueueLimit))
|
|
}
|
|
if err := ep.outboundQueues[q].Write(pkt); err != nil {
|
|
if _, ok := err.(*tcpip.ErrNoBufferSpace); ok {
|
|
// Drop only this packet. Later packets may be routed to
|
|
// queues that have space.
|
|
ep.queueFullDropped[q].Add(1)
|
|
if q == outboundToWireGuard {
|
|
if m := ep.outboundDropped.Load(); m != nil {
|
|
m.Add(usermetric.DropLabels{Reason: usermetric.ReasonQueueFull}, 1)
|
|
}
|
|
}
|
|
full = true
|
|
continue
|
|
}
|
|
if n == 0 {
|
|
return 0, err
|
|
}
|
|
break
|
|
}
|
|
n++
|
|
}
|
|
if full {
|
|
return n, &tcpip.ErrNoBufferSpace{}
|
|
}
|
|
return n, nil
|
|
}
|
|
|
|
// Wait implements stack.LinkEndpoint.Wait.
|
|
func (*linkEndpoint) Wait() {}
|
|
|
|
// ARPHardwareType implements stack.LinkEndpoint.ARPHardwareType.
|
|
func (*linkEndpoint) ARPHardwareType() header.ARPHardwareType {
|
|
return header.ARPHardwareNone
|
|
}
|
|
|
|
// AddHeader implements stack.LinkEndpoint.AddHeader.
|
|
func (*linkEndpoint) AddHeader(*stack.PacketBuffer) {}
|
|
|
|
// ParseHeader implements stack.LinkEndpoint.ParseHeader.
|
|
func (*linkEndpoint) ParseHeader(*stack.PacketBuffer) bool { return true }
|
|
|
|
// SetOnCloseAction implements stack.LinkEndpoint.
|
|
func (*linkEndpoint) SetOnCloseAction(func()) {}
|