@ -36,6 +36,7 @@ import (
"tailscale.com/tailcfg"
"tailscale.com/types/logger"
"tailscale.com/util/clientmetric"
"tailscale.com/util/singleflight"
"tailscale.com/util/slicesx"
)
@ -44,26 +45,89 @@ var (
disableRecursiveResolver = envknob . RegisterBool ( "TS_DNSFALLBACK_DISABLE_RECURSIVE_RESOLVER" ) // legacy pre-1.52 env knob name
)
type resolveResult struct {
addrs [ ] netip . Addr
minTTL time . Duration
}
// MakeLookupFunc creates a function that can be used to resolve hostnames
// (e.g. as a LookupIPFallback from dnscache.Resolver).
// The netMon parameter is optional; if non-nil it's used to do faster interface lookups.
func MakeLookupFunc ( logf logger . Logf , netMon * netmon . Monitor ) func ( ctx context . Context , host string ) ( [ ] netip . Addr , error ) {
return func ( ctx context . Context , host string ) ( [ ] netip . Addr , error ) {
fr := & fallbackResolver {
logf : logf ,
netMon : netMon ,
}
return fr . Lookup
}
// fallbackResolver contains the state and configuration for a DNS resolution
// function.
type fallbackResolver struct {
logf logger . Logf
netMon * netmon . Monitor // or nil
sf singleflight . Group [ string , resolveResult ]
// for tests
waitForCompare bool
}
func ( fr * fallbackResolver ) Lookup ( ctx context . Context , host string ) ( [ ] netip . Addr , error ) {
// If they've explicitly disabled the recursive resolver with the legacy
// TS_DNSFALLBACK_DISABLE_RECURSIVE_RESOLVER envknob or not set the
// newer TS_DNSFALLBACK_RECURSIVE_RESOLVER to true, then don't use the
// recursive resolver. (tailscale/corp#15261) In the future, we might
// change the default (the opt.Bool being unset) to mean enabled.
if disableRecursiveResolver ( ) || ! optRecursiveResolver ( ) . EqualBool ( true ) {
return lookup ( ctx , host , logf , netMon )
return lookup ( ctx , host , fr. logf, fr . netMon )
}
addrsCh := make ( chan [ ] netip . Addr , 1 )
// Run the recursive resolver in the background so we can
// compare the results.
// compare the results. For tests, we also allow waiting for the
// comparison to complete; normally, we do this entirely asynchronously
// so as not to block the caller.
var done chan struct { }
if fr . waitForCompare {
done = make ( chan struct { } )
go func ( ) {
logf := logger . WithPrefix ( logf , "recursive: " )
defer close ( done )
fr . compareWithRecursive ( ctx , addrsCh , host )
} ( )
} else {
go fr . compareWithRecursive ( ctx , addrsCh , host )
}
addrs , err := lookup ( ctx , host , fr . logf , fr . netMon )
if err != nil {
addrsCh <- nil
return nil , err
}
addrsCh <- slices . Clone ( addrs )
if fr . waitForCompare {
select {
case <- done :
case <- ctx . Done ( ) :
}
}
return addrs , nil
}
// compareWithRecursive is responsible for comparing the DNS resolution
// performed via the "normal" path (bootstrap DNS requests to the DERP servers)
// with DNS resolution performed with our in-process recursive DNS resolver.
//
// It will select on addrsCh to read exactly one set of addrs (returned by the
// "normal" path) and compare against the results returned by the recursive
// resolver. If ctx is canceled, then it will abort.
func ( fr * fallbackResolver ) compareWithRecursive (
ctx context . Context ,
addrsCh <- chan [ ] netip . Addr ,
host string ,
) {
logf := logger . WithPrefix ( fr . logf , "recursive: " )
// Ensure that we catch panics while we're testing this
// code path; this should never panic, but we don't
@ -77,22 +141,59 @@ func MakeLookupFunc(logf logger.Logf, netMon *netmon.Monitor) func(ctx context.C
}
} ( )
resolver := recursive . Resolver {
Dialer : netns . NewDialer ( logf , netMon ) ,
// Don't resolve the same host multiple times
// concurrently; if we end up in a tight loop, this can
// take up a lot of CPU.
var didRun bool
result , err , _ := fr . sf . Do ( host , func ( ) ( resolveResult , error ) {
didRun = true
resolver := & recursive . Resolver {
Dialer : netns . NewDialer ( logf , fr . netMon ) ,
Logf : logf ,
}
addrs , minTTL , err := resolver . Resolve ( ctx , host )
if err != nil {
logf ( "error using recursive resolver: %v" , err )
metricRecursiveErrors . Add ( 1 )
return resolveResult { } , err
}
return resolveResult { addrs , minTTL } , nil
} )
// The singleflight function handled errors; return if
// there was one. Additionally, don't bother doing the
// comparison if we waited on another singleflight
// caller; the results are likely to be the same, so
// rather than spam the logs we can just exit and let
// the singleflight call that did execute do the
// comparison.
//
// Returning here is safe because the addrsCh channel
// is buffered, so the main function won't block even
// if we never read from it.
if err != nil || ! didRun {
return
}
addrs , minTTL := result . addrs , result . minTTL
compareAddr := func ( a , b netip . Addr ) int { return a . Compare ( b ) }
slices . SortFunc ( addrs , compareAddr )
// Wait for a response from the main function
oldAddrs := <- addrsCh
// Wait for a response from the main function; try this once before we
// check whether the context is canceled since selects are
// nondeterministic.
var oldAddrs [ ] netip . Addr
select {
case oldAddrs = <- addrsCh :
// All good; continue
default :
// Now block.
select {
case oldAddrs = <- addrsCh :
case <- ctx . Done ( ) :
return
}
}
slices . SortFunc ( oldAddrs , compareAddr )
matches := slices . Equal ( addrs , oldAddrs )
@ -104,17 +205,6 @@ func MakeLookupFunc(logf logger.Logf, netMon *netmon.Monitor) func(ctx context.C
} else {
metricRecursiveMismatches . Add ( 1 )
}
} ( )
addrs , err := lookup ( ctx , host , logf , netMon )
if err != nil {
addrsCh <- nil
return nil , err
}
addrsCh <- slices . Clone ( addrs )
return addrs , nil
}
}
func lookup ( ctx context . Context , host string , logf logger . Logf , netMon * netmon . Monitor ) ( [ ] netip . Addr , error ) {