@ -88,25 +88,31 @@ type Wrapper struct {
destMACAtomic syncs . AtomicValue [ [ 6 ] byte ]
destMACAtomic syncs . AtomicValue [ [ 6 ] byte ]
discoKey syncs . AtomicValue [ key . DiscoPublic ]
discoKey syncs . AtomicValue [ key . DiscoPublic ]
// buffer stores the oldest unconsumed packet from tdev.
// vectorBuffer stores the oldest unconsumed packet vector from tdev. It is
// It is made a static buffer in order to avoid allocations .
// allocated in wrap() and the underlying arrays should never grow .
buffer [ maxBufferSize ] byte
vectorBuffer [ ] [ ] byte
// bufferConsumedMu protects bufferConsumed from concurrent sends and closes.
// bufferConsumedMu protects bufferConsumed from concurrent sends , closes,
// It does not prevent send-after-close, only data races .
// and send-after-close (by way of bufferConsumedClosed) .
bufferConsumedMu sync . Mutex
bufferConsumedMu sync . Mutex
// bufferConsumed synchronizes access to buffer (shared by Read and poll).
// bufferConsumedClosed is true when bufferConsumed has been closed. This is
// read by bufferConsumed writers to prevent send-after-close.
bufferConsumedClosed bool
// bufferConsumed synchronizes access to vectorBuffer (shared by Read() and
// pollVector()).
//
//
// Close closes bufferConsumed. There may be outstanding sends to bufferConsumed
// Close closes bufferConsumed and sets bufferConsumedClosed to true.
// when that happens; we catch any resulting panics.
// This lets us avoid expensive multi-case selects.
bufferConsumed chan struct { }
bufferConsumed chan struct { }
// closed signals poll (by closing) when the device is closed.
// closed signals poll (by closing) when the device is closed.
closed chan struct { }
closed chan struct { }
// outboundMu protects outbound from concurrent sends and closes.
// outboundMu protects outbound and vectorOutbound from concurrent sends,
// It does not prevent send-after-close, only data races .
// closes, and send-after-close (by way of outboundClosed) .
outboundMu sync . Mutex
outboundMu sync . Mutex
// outbound is the queue by which packets leave the TUN device.
// outboundClosed is true when outbound or vectorOutbound have been closed.
// This is read by outbound and vectorOutbound writers to prevent
// send-after-close.
outboundClosed bool
// vectorOutbound is the queue by which packets leave the TUN device.
//
//
// The directions are relative to the network, not the device:
// The directions are relative to the network, not the device:
// inbound packets arrive via UDP and are written into the TUN device;
// inbound packets arrive via UDP and are written into the TUN device;
@ -115,12 +121,10 @@ type Wrapper struct {
// the other direction must wait on a WireGuard goroutine to poll it.
// the other direction must wait on a WireGuard goroutine to poll it.
//
//
// Empty reads are skipped by WireGuard, so it is always legal
// Empty reads are skipped by WireGuard, so it is always legal
// to discard an empty packet instead of sending it through t. outbound.
// to discard an empty packet instead of sending it through vec torO utbound.
//
//
// Close closes outbound. There may be outstanding sends to outbound
// Close closes vectorOutbound and sets outboundClosed to true.
// when that happens; we catch any resulting panics.
vectorOutbound chan tunVectorReadResult
// This lets us avoid expensive multi-case selects.
outbound chan tunReadResult
// eventsUpDown yields up and down tun.Events that arrive on a Wrapper's events channel.
// eventsUpDown yields up and down tun.Events that arrive on a Wrapper's events channel.
eventsUpDown chan tun . Event
eventsUpDown chan tun . Event
@ -172,19 +176,30 @@ type Wrapper struct {
stats atomic . Pointer [ connstats . Statistics ]
stats atomic . Pointer [ connstats . Statistics ]
} }
// tunReadResult is the result of a TUN read, or an injected result pretending to be a TUN read.
// tunInjectedRead is an injected packet pretending to be a tun.Read().
// The data is not interpreted in the usual way for a Read method.
type tunInjectedRead struct {
// See the comment in the middle of Wrap.Read.
// Only one of packet or data should be set, and are read in that order of
type tunReadResult struct { // precedence.
// Only one of err, packet or data should be set, and are read in that order
// of precedence.
err error
packet * stack . PacketBuffer
packet * stack . PacketBuffer
data [ ] byte
data [ ] byte
}
// tunVectorReadResult is the result of a tun.Read(), or an injected packet
// pretending to be a tun.Read().
type tunVectorReadResult struct {
// Only one of err, data, or injected should be set, and are read in that
// order of precedence.
err error
data [ ] [ ] byte
injected tunInjectedRead
// injected is set if the read result was generated internally, and contained packets should not
dataOffset int
// pass through filters.
}
injected bool
type setWrapperer interface {
// setWrapper enables the underlying TUN/TAP to have access to the Wrapper.
// It MUST be called only once during initialization, other usage is unsafe.
setWrapper ( * Wrapper )
} }
func WrapTAP ( logf logger . Logf , tdev tun . Device ) * Wrapper { func WrapTAP ( logf logger . Logf , tdev tun . Device ) * Wrapper {
@ -197,7 +212,7 @@ func Wrap(logf logger.Logf, tdev tun.Device) *Wrapper {
func wrap ( logf logger . Logf , tdev tun . Device , isTAP bool ) * Wrapper { func wrap ( logf logger . Logf , tdev tun . Device , isTAP bool ) * Wrapper {
logf = logger . WithPrefix ( logf , "tstun: " )
logf = logger . WithPrefix ( logf , "tstun: " )
tun := & Wrapper {
w := & Wrapper {
logf : logf ,
logf : logf ,
limitedLogf : logger . RateLimitedFn ( logf , 1 * time . Minute , 2 , 10 ) ,
limitedLogf : logger . RateLimitedFn ( logf , 1 * time . Minute , 2 , 10 ) ,
isTAP : isTAP ,
isTAP : isTAP ,
@ -206,21 +221,30 @@ func wrap(logf logger.Logf, tdev tun.Device, isTAP bool) *Wrapper {
// a goroutine should not block when setting it, even with no listeners.
// a goroutine should not block when setting it, even with no listeners.
bufferConsumed : make ( chan struct { } , 1 ) ,
bufferConsumed : make ( chan struct { } , 1 ) ,
closed : make ( chan struct { } ) ,
closed : make ( chan struct { } ) ,
// outbound can be unbuffered; the buffer is an optimization.
// vect orO utbound can be unbuffered; the buffer is an optimization.
: make ( chan tun ReadResult, 1 ) ,
vect orO utbound: make ( chan tun Vector ReadResult, 1 ) ,
eventsUpDown : make ( chan tun . Event ) ,
eventsUpDown : make ( chan tun . Event ) ,
eventsOther : make ( chan tun . Event ) ,
eventsOther : make ( chan tun . Event ) ,
// TODO(dmytro): (highly rate-limited) hexdumps should happen on unknown packets.
// TODO(dmytro): (highly rate-limited) hexdumps should happen on unknown packets.
filterFlags : filter . LogAccepts | filter . LogDrops ,
filterFlags : filter . LogAccepts | filter . LogDrops ,
}
}
go tun . poll ( )
w . vectorBuffer = make ( [ ] [ ] byte , tdev . BatchSize ( ) )
go tun . pumpEvents ( )
for i := range w . vectorBuffer {
w . vectorBuffer [ i ] = make ( [ ] byte , maxBufferSize )
}
go w . pollVector ( )
go w . pumpEvents ( )
// The buffer starts out consumed.
// The buffer starts out consumed.
tun . bufferConsumed <- struct { } { }
w . bufferConsumed <- struct { } { }
tun . noteActivity ( )
w . noteActivity ( )
if sw , ok := w . tdev . ( setWrapperer ) ; ok {
sw . setWrapper ( w )
}
return tun
return w
} }
// SetDestIPActivityFuncs sets a map of funcs to run per packet
// SetDestIPActivityFuncs sets a map of funcs to run per packet
@ -261,10 +285,12 @@ func (t *Wrapper) Close() error {
t . closeOnce . Do ( func ( ) {
t . closeOnce . Do ( func ( ) {
close ( t . closed )
close ( t . closed )
t . bufferConsumedMu . Lock ( )
t . bufferConsumedMu . Lock ( )
t . bufferConsumedClosed = true
close ( t . bufferConsumed )
close ( t . bufferConsumed )
t . bufferConsumedMu . Unlock ( )
t . bufferConsumedMu . Unlock ( )
t . outboundMu . Lock ( )
t . outboundMu . Lock ( )
close ( t . outbound )
t . outboundClosed = true
close ( t . vectorOutbound )
t . outboundMu . Unlock ( )
t . outboundMu . Unlock ( )
err = t . tdev . Close ( )
err = t . tdev . Close ( )
} )
} )
@ -323,7 +349,7 @@ func (t *Wrapper) EventsUpDown() chan tun.Event {
// Events returns a TUN event channel that contains all non-Up, non-Down events.
// Events returns a TUN event channel that contains all non-Up, non-Down events.
// It is named Events because it is the set of events that we want to expose to wireguard-go,
// It is named Events because it is the set of events that we want to expose to wireguard-go,
// and Events is the name specified by the wireguard-go tun.Device interface.
// and Events is the name specified by the wireguard-go tun.Device interface.
func ( t * Wrapper ) Events ( ) chan tun . Event { func ( t * Wrapper ) Events ( ) <- chan tun . Event {
return t . eventsOther
return t . eventsOther
} }
@ -331,10 +357,6 @@ func (t *Wrapper) File() *os.File {
return t . tdev . File ( )
return t . tdev . File ( )
} }
func ( t * Wrapper ) Flush ( ) error {
return t . tdev . Flush ( )
}
func ( t * Wrapper ) MTU ( ) ( int , error ) { func ( t * Wrapper ) MTU ( ) ( int , error ) {
return t . tdev . MTU ( )
return t . tdev . MTU ( )
} }
@ -343,94 +365,95 @@ func (t *Wrapper) Name() (string, error) {
return t . tdev . Name ( )
return t . tdev . Name ( )
} }
// allowSendOnClosedChannel suppresses panics due to sending on a closed channel.
// This allows us to avoid synchronization between poll and Close.
// Such synchronization (particularly multi-case selects) is too expensive
// for code like poll or Read that is on the hot path of every packet.
// If this makes you sad or angry, you may want to join our
// weekly Go Performance Delinquents Anonymous meetings on Monday nights.
func allowSendOnClosedChannel ( ) {
r := recover ( )
if r == nil {
return
}
e , _ := r . ( error )
if e != nil && e . Error ( ) == "send on closed channel" {
return
}
panic ( r )
}
const ethernetFrameSize = 14 // 2 six byte MACs, 2 bytes ethertype
const ethernetFrameSize = 14 // 2 six byte MACs, 2 bytes ethertype
// poll polls t.tdev.Read, placing the oldest unconsumed packet into t.buffer.
// pollVector polls t.tdev.Read(), placing the oldest unconsumed packet vector
// This is needed because t.tdev.Read in general may block (it does on Windows),
// into t.vectorBuffer. This is needed because t.tdev.Read() in general may
// so packets may be stuck in t.outbound if t.Read called t.tdev.Read directly.
// block (it does on Windows), so packets may be stuck in t.vectorOutbound if
func ( t * Wrapper ) poll ( ) { // t.Read() called t.tdev.Read() directly.
func ( t * Wrapper ) pollVector ( ) {
sizes := make ( [ ] int , len ( t . vectorBuffer ) )
readOffset := PacketStartOffset
if t . isTAP {
readOffset = PacketStartOffset - ethernetFrameSize
}
for range t . bufferConsumed {
for range t . bufferConsumed {
DoRead :
DoRead :
for i := range t . vectorBuffer {
t . vectorBuffer [ i ] = t . vectorBuffer [ i ] [ : cap ( t . vectorBuffer [ i ] ) ]
}
var n int
var n int
var err error
var err error
// Read may use memory in t.buffer before PacketStartOffset for mandatory headers.
// This is the rationale behind the tun.Wrapper.{Read,Write} interfaces
// and the reason t.buffer has size MaxMessageSize and not MaxContentSize.
// In principle, read errors are not fatal (but wireguard-go disagrees).
// We loop here until we get a non-empty (or failed) read.
// We don't need this loop for correctness,
// but wireguard-go will skip an empty read,
// so we might as well avoid the send through t.outbound.
for n == 0 && err == nil {
for n == 0 && err == nil {
if t . isClosed ( ) {
if t . isClosed ( ) {
return
return
}
}
if t . isTAP {
n , err = t . tdev . Read ( t . vectorBuffer [ : ] , sizes , readOffset )
n , err = t . tdev . Read ( t . buffer [ : ] , PacketStartOffset - ethernetFrameSize )
if t . isTAP && tapDebug {
if tapDebug {
s := fmt . Sprintf ( "% x" , t . vectorBuffer [ 0 ] [ : ] )
s := fmt . Sprintf ( "% x" , t . buffer [ : ] )
for strings . HasSuffix ( s , " 00" ) {
for strings . HasSuffix ( s , " 00" ) {
s = strings . TrimSuffix ( s , " 00" )
s = strings . TrimSuffix ( s , " 00" )
}
t . logf ( "TAP read %v, %v: %s" , n , err , s )
}
}
} else {
t . logf ( "TAP read %v, %v: %s" , n , err , s )
n , err = t . tdev . Read ( t . buffer [ : ] , PacketStartOffset )
}
}
}
}
for i := range sizes [ : n ] {
t . vectorBuffer [ i ] = t . vectorBuffer [ i ] [ : readOffset + sizes [ i ] ]
}
if t . isTAP {
if t . isTAP {
if err == nil {
if err == nil {
ethernetFrame := t . buffer [ PacketStartOffset - ethernetFrameSize : ] [ : n ]
ethernetFrame := t . vectorBuffer[ 0 ] [ readOffset : ]
if t . handleTAPFrame ( ethernetFrame ) {
if t . handleTAPFrame ( ethernetFrame ) {
goto DoRead
goto DoRead
}
}
}
}
// Fall through. We got an IP packet.
// Fall through. We got an IP packet.
if n >= ethernetFrameSize {
if sizes[ 0 ] >= ethernetFrameSize {
n -= ethernetFrameSize
t. vectorBuffer [ 0 ] = t . vectorBuffer [ 0 ] [ : readOffset + sizes [ 0 ] - ethernetFrameSize ]
}
}
if tapDebug {
if tapDebug {
t . logf ( "tap regular frame: %x" , t . buffer[ PacketStartOffset : PacketStartOffset + n ] )
t . logf ( "tap regular frame: %x" , t . vectorBuffer[ 0 ] [ PacketStartOffset : PacketStartOffset + sizes [ 0 ] ] )
}
}
}
}
t . sendOutbound ( tunReadResult { data : t . buffer [ PacketStartOffset : PacketStartOffset + n ] , err : err } )
t . sendVectorOutbound ( tunVectorReadResult {
data : t . vectorBuffer [ : n ] ,
dataOffset : PacketStartOffset ,
err : err ,
} )
}
}
} }
// sendBufferConsumed does t.bufferConsumed <- struct{}{}.
// sendBufferConsumed does t.bufferConsumed <- struct{}{}.
// It protects against any panics or data races that that send could cause.
func ( t * Wrapper ) sendBufferConsumed ( ) { func ( t * Wrapper ) sendBufferConsumed ( ) {
defer allowSendOnClosedChannel ( )
t . bufferConsumedMu . Lock ( )
t . bufferConsumedMu . Lock ( )
defer t . bufferConsumedMu . Unlock ( )
defer t . bufferConsumedMu . Unlock ( )
if t . bufferConsumedClosed {
return
}
t . bufferConsumed <- struct { } { }
t . bufferConsumed <- struct { } { }
} }
// sendOutbound does t.outboundMu <- r.
// injectOutbound does t.vectorOutbound <- r
// It protects against any panics or data races that that send could cause.
func ( t * Wrapper ) injectOutbound ( r tunInjectedRead ) {
func ( t * Wrapper ) sendOutbound ( r tunReadResult ) {
defer allowSendOnClosedChannel ( )
t . outboundMu . Lock ( )
t . outboundMu . Lock ( )
defer t . outboundMu . Unlock ( )
defer t . outboundMu . Unlock ( )
t . outbound <- r
if t . outboundClosed {
return
}
t . vectorOutbound <- tunVectorReadResult {
injected : r ,
}
}
// sendVectorOutbound does t.vectorOutbound <- r.
func ( t * Wrapper ) sendVectorOutbound ( r tunVectorReadResult ) {
t . outboundMu . Lock ( )
defer t . outboundMu . Unlock ( )
if t . outboundClosed {
return
}
t . vectorOutbound <- r
} }
var ( var (
@ -514,34 +537,79 @@ func (t *Wrapper) IdleDuration() time.Duration {
return mono . Since ( t . lastActivityAtomic . LoadAtomic ( ) )
return mono . Since ( t . lastActivityAtomic . LoadAtomic ( ) )
} }
func ( t * Wrapper ) Read ( buf [ ] byte , offset int ) ( int , error ) { func ( t * Wrapper ) Read ( buffs [ ] [ ] byte , sizes [ ] int , offset int ) ( int , error ) {
res , ok := <- t . outbound
res , ok := <- t . vectorOutbound
if ! ok {
if ! ok {
// Wrapper is closed.
return 0 , io . EOF
return 0 , io . EOF
}
}
if res . err != nil {
if res . err != nil {
return 0 , res . err
return 0 , res . err
}
}
if res . data == nil {
n , err := t . injectedRead ( res . injected , buffs [ 0 ] , offset )
sizes [ 0 ] = n
if err != nil && n == 0 {
return 0 , err
}
return 1 , err
}
metricPacketOut . Add ( int64 ( len ( res . data ) ) )
var buffsPos int
for _ , data := range res . data {
p := parsedPacketPool . Get ( ) . ( * packet . Parsed )
defer parsedPacketPool . Put ( p )
p . Decode ( data [ res . dataOffset : ] )
if m := t . destIPActivity . Load ( ) ; m != nil {
if fn := m [ p . Dst . Addr ( ) ] ; fn != nil {
fn ( )
}
}
if ! t . disableFilter {
response := t . filterOut ( p )
if response != filter . Accept {
metricPacketOutDrop . Add ( 1 )
continue
}
}
n := copy ( buffs [ buffsPos ] [ offset : ] , data [ res . dataOffset : ] )
if n != len ( data ) - res . dataOffset {
panic ( fmt . Sprintf ( "short copy: %d != %d" , n , len ( data ) - res . dataOffset ) )
}
sizes [ buffsPos ] = n
if stats := t . stats . Load ( ) ; stats != nil {
stats . UpdateTxVirtual ( data [ res . dataOffset : ] )
}
buffsPos ++
}
// t.vectorBuffer has a fixed location in memory.
// TODO(raggi): add an explicit field and possibly method to the tunVectorReadResult
// to signal when sendBufferConsumed should be called.
if & res . data [ 0 ] == & t . vectorBuffer [ 0 ] {
// We are done with t.buffer. Let poll() re-use it.
t . sendBufferConsumed ( )
}
t . noteActivity ( )
return buffsPos , nil
}
// injectedRead handles injected reads, which bypass filters.
func ( t * Wrapper ) injectedRead ( res tunInjectedRead , buf [ ] byte , offset int ) ( int , error ) {
metricPacketOut . Add ( 1 )
metricPacketOut . Add ( 1 )
var n int
var n int
if res . packet != nil {
if res . packet != nil {
n = copy ( buf [ offset : ] , res . packet . NetworkHeader ( ) . Slice ( ) )
n = copy ( buf [ offset : ] , res . packet . NetworkHeader ( ) . Slice ( ) )
n += copy ( buf [ offset + n : ] , res . packet . TransportHeader ( ) . Slice ( ) )
n += copy ( buf [ offset + n : ] , res . packet . TransportHeader ( ) . Slice ( ) )
n += copy ( buf [ offset + n : ] , res . packet . Data ( ) . AsRange ( ) . ToSlice ( ) )
n += copy ( buf [ offset + n : ] , res . packet . Data ( ) . AsRange ( ) . ToSlice ( ) )
res . packet . DecRef ( )
res . packet . DecRef ( )
} else {
} else {
n = copy ( buf [ offset : ] , res . data )
n = copy ( buf [ offset : ] , res . data )
// t.buffer has a fixed location in memory.
if & res . data [ 0 ] == & t . buffer [ PacketStartOffset ] {
// We are done with t.buffer. Let poll re-use it.
t . sendBufferConsumed ( )
}
}
}
p := parsedPacketPool . Get ( ) . ( * packet . Parsed )
p := parsedPacketPool . Get ( ) . ( * packet . Parsed )
@ -554,16 +622,6 @@ func (t *Wrapper) Read(buf []byte, offset int) (int, error) {
}
}
}
}
// Do not filter injected packets.
if ! res . injected && ! t . disableFilter {
response := t . filterOut ( p )
if response != filter . Accept {
metricPacketOutDrop . Add ( 1 )
// WireGuard considers read errors fatal; pretend nothing was read
return 0 , nil
}
}
if stats := t . stats . Load ( ) ; stats != nil {
if stats := t . stats . Load ( ) ; stats != nil {
stats . UpdateTxVirtual ( buf [ offset : ] [ : n ] )
stats . UpdateTxVirtual ( buf [ offset : ] [ : n ] )
}
}
@ -668,42 +726,40 @@ func (t *Wrapper) filterIn(buf []byte) filter.Response {
return filter . Accept
return filter . Accept
} }
// Write accepts an incoming packet. The packet begins at buf[offset:],
// Write accepts incoming packets . The packets begins at buffs[:] [offset:],
// like wireguard-go/tun.Device.Write.
// like wireguard-go/tun.Device.Write.
func ( t * Wrapper ) Write ( buf [ ] byte , offset int ) ( int , error ) { func ( t * Wrapper ) Write ( buffs [ ] [ ] byte , offset int ) ( int , error ) {
metricPacketIn . Add ( 1 )
metricPacketIn . Add ( int64 ( len ( buffs ) ) )
i := 0
if ! t . disableFilter {
if ! t . disableFilter {
if t . filterIn ( buf [ offset : ] ) != filter . Accept {
for _ , buff := range buffs {
metricPacketInDrop . Add ( 1 )
if t . filterIn ( buff [ offset : ] ) != filter . Accept {
// If we're not accepting the packet, lie to wireguard-go and pretend
metricPacketInDrop . Add ( 1 )
// that everything is okay with a nil error, so wireguard-go
} else {
// doesn't log about this Write "failure".
buffs [ i ] = buff
//
i ++
// We return len(buf), but the ill-defined wireguard-go/tun.Device.Write
}
// method doesn't specify how the offset affects the return value.
// In fact, the Linux implementation does one of two different things depending
// on how the /dev/net/tun was created. But fortunately the wireguard-go
// code ignores the int return and only looks at the error:
//
// device/receive.go: _, err = device.tun.device.Write(....)
//
// TODO(bradfitz): fix upstream interface docs, implementation.
return len ( buf ) , nil
}
}
} else {
i = len ( buffs )
}
}
buffs = buffs [ : i ]
t . noteActivity ( )
if len ( buffs ) > 0 {
return t . tdevWrite ( buf , offset )
t . noteActivity ( )
_ , err := t . tdevWrite ( buffs , offset )
return len ( buffs ) , err
}
return 0 , nil
} }
func ( t * Wrapper ) tdevWrite ( buf [ ] byte , offset int ) ( int , error ) { func ( t * Wrapper ) tdevWrite ( buf fs [ ] [ ] byte , offset int ) ( int , error ) {
if stats := t . stats . Load ( ) ; stats != nil {
if stats := t . stats . Load ( ) ; stats != nil {
stats . UpdateRxVirtual ( buf [ offset : ] )
for i := range buffs {
}
stats . UpdateRxVirtual ( ( buffs ) [ i ] [ offset : ] )
if t . isTAP {
}
return t . tapWrite ( buf , offset )
}
}
return t . tdev . Write ( buf , offset )
return t . tdev . Write ( buf fs , offset )
} }
func ( t * Wrapper ) GetFilter ( ) * filter . Filter { func ( t * Wrapper ) GetFilter ( ) * filter . Filter {
@ -755,7 +811,7 @@ func (t *Wrapper) InjectInboundDirect(buf []byte, offset int) error {
}
}
// Write to the underlying device to skip filters.
// Write to the underlying device to skip filters.
_ , err := t . tdevWrite ( buf , offset )
_ , err := t . tdevWrite ( [ ] [ ] byte { buf } , offset ) // TODO(jwhited): alloc?
return err
return err
} }
@ -813,7 +869,7 @@ func (t *Wrapper) InjectOutbound(packet []byte) error {
if len ( packet ) == 0 {
if len ( packet ) == 0 {
return nil
return nil
}
}
t . sendOutbound( tunReadResult { data : packet , injected : true } )
t . injectOutbound( tunInjectedRead { data : packet } )
return nil
return nil
} }
@ -830,10 +886,14 @@ func (t *Wrapper) InjectOutboundPacketBuffer(packet *stack.PacketBuffer) error {
packet . DecRef ( )
packet . DecRef ( )
return nil
return nil
}
}
t . sendOutbound( tunReadResult { packet : packet , injected : true } )
t . injectOutbound( tunInjectedRead { packet : packet } )
return nil
return nil
} }
func ( t * Wrapper ) BatchSize ( ) int {
return t . tdev . BatchSize ( )
}
// Unwrap returns the underlying tun.Device.
// Unwrap returns the underlying tun.Device.
func ( t * Wrapper ) Unwrap ( ) tun . Device { func ( t * Wrapper ) Unwrap ( ) tun . Device {
return t . tdev
return t . tdev
Jordan Whited
2 years ago
committed by