3
0

hostmap.go 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801
  1. package nebula
  2. import (
  3. "errors"
  4. "net"
  5. "net/netip"
  6. "sync"
  7. "sync/atomic"
  8. "time"
  9. "github.com/gaissmai/bart"
  10. "github.com/rcrowley/go-metrics"
  11. "github.com/sirupsen/logrus"
  12. "github.com/slackhq/nebula/cert"
  13. "github.com/slackhq/nebula/config"
  14. "github.com/slackhq/nebula/header"
  15. )
  16. // const ProbeLen = 100
  17. const defaultPromoteEvery = 1000 // Count of packets sent before we try moving a tunnel to a preferred underlay ip address
  18. const defaultReQueryEvery = 5000 // Count of packets sent before re-querying a hostinfo to the lighthouse
  19. const defaultReQueryWait = time.Minute // Minimum amount of seconds to wait before re-querying a hostinfo the lighthouse. Evaluated every ReQueryEvery
  20. const MaxRemotes = 10
  21. const maxRecvError = 4
  22. // MaxHostInfosPerVpnIp is the max number of hostinfos we will track for a given vpn ip
  23. // 5 allows for an initial handshake and each host pair re-handshaking twice
  24. const MaxHostInfosPerVpnIp = 5
  25. // How long we should prevent roaming back to the previous IP.
  26. // This helps prevent flapping due to packets already in flight
  27. const RoamingSuppressSeconds = 2
  28. const (
  29. Requested = iota
  30. PeerRequested
  31. Established
  32. Disestablished
  33. )
  34. const (
  35. Unknowntype = iota
  36. ForwardingType
  37. TerminalType
  38. )
  39. type Relay struct {
  40. Type int
  41. State int
  42. LocalIndex uint32
  43. RemoteIndex uint32
  44. PeerAddr netip.Addr
  45. }
  46. type HostMap struct {
  47. sync.RWMutex //Because we concurrently read and write to our maps
  48. Indexes map[uint32]*HostInfo
  49. Relays map[uint32]*HostInfo // Maps a Relay IDX to a Relay HostInfo object
  50. RemoteIndexes map[uint32]*HostInfo
  51. Hosts map[netip.Addr]*HostInfo
  52. preferredRanges atomic.Pointer[[]netip.Prefix]
  53. l *logrus.Logger
  54. }
  55. // For synchronization, treat the pointed-to Relay struct as immutable. To edit the Relay
  56. // struct, make a copy of an existing value, edit the fileds in the copy, and
  57. // then store a pointer to the new copy in both realyForBy* maps.
  58. type RelayState struct {
  59. sync.RWMutex
  60. relays map[netip.Addr]struct{} // Set of vpnAddr's of Hosts to use as relays to access this peer
  61. // For data race avoidance, the contents of a *Relay are treated immutably. To update a *Relay, copy the existing data,
  62. // modify what needs to be updated, and store the new modified copy in the relayForByIp and relayForByIdx maps (with
  63. // the RelayState Lock held)
  64. relayForByAddr map[netip.Addr]*Relay // Maps vpnAddr of peers for which this HostInfo is a relay to some Relay info
  65. relayForByIdx map[uint32]*Relay // Maps a local index to some Relay info
  66. }
  67. func (rs *RelayState) DeleteRelay(ip netip.Addr) {
  68. rs.Lock()
  69. defer rs.Unlock()
  70. delete(rs.relays, ip)
  71. }
  72. func (rs *RelayState) UpdateRelayForByIpState(vpnIp netip.Addr, state int) {
  73. rs.Lock()
  74. defer rs.Unlock()
  75. if r, ok := rs.relayForByAddr[vpnIp]; ok {
  76. newRelay := *r
  77. newRelay.State = state
  78. rs.relayForByAddr[newRelay.PeerAddr] = &newRelay
  79. rs.relayForByIdx[newRelay.LocalIndex] = &newRelay
  80. }
  81. }
  82. func (rs *RelayState) UpdateRelayForByIdxState(idx uint32, state int) {
  83. rs.Lock()
  84. defer rs.Unlock()
  85. if r, ok := rs.relayForByIdx[idx]; ok {
  86. newRelay := *r
  87. newRelay.State = state
  88. rs.relayForByAddr[newRelay.PeerAddr] = &newRelay
  89. rs.relayForByIdx[newRelay.LocalIndex] = &newRelay
  90. }
  91. }
  92. func (rs *RelayState) CopyAllRelayFor() []*Relay {
  93. rs.RLock()
  94. defer rs.RUnlock()
  95. ret := make([]*Relay, 0, len(rs.relayForByIdx))
  96. for _, r := range rs.relayForByIdx {
  97. ret = append(ret, r)
  98. }
  99. return ret
  100. }
  101. func (rs *RelayState) GetRelayForByAddr(addr netip.Addr) (*Relay, bool) {
  102. rs.RLock()
  103. defer rs.RUnlock()
  104. r, ok := rs.relayForByAddr[addr]
  105. return r, ok
  106. }
  107. func (rs *RelayState) InsertRelayTo(ip netip.Addr) {
  108. rs.Lock()
  109. defer rs.Unlock()
  110. rs.relays[ip] = struct{}{}
  111. }
  112. func (rs *RelayState) CopyRelayIps() []netip.Addr {
  113. rs.RLock()
  114. defer rs.RUnlock()
  115. ret := make([]netip.Addr, 0, len(rs.relays))
  116. for ip := range rs.relays {
  117. ret = append(ret, ip)
  118. }
  119. return ret
  120. }
  121. func (rs *RelayState) CopyRelayForIps() []netip.Addr {
  122. rs.RLock()
  123. defer rs.RUnlock()
  124. currentRelays := make([]netip.Addr, 0, len(rs.relayForByAddr))
  125. for relayIp := range rs.relayForByAddr {
  126. currentRelays = append(currentRelays, relayIp)
  127. }
  128. return currentRelays
  129. }
  130. func (rs *RelayState) CopyRelayForIdxs() []uint32 {
  131. rs.RLock()
  132. defer rs.RUnlock()
  133. ret := make([]uint32, 0, len(rs.relayForByIdx))
  134. for i := range rs.relayForByIdx {
  135. ret = append(ret, i)
  136. }
  137. return ret
  138. }
  139. func (rs *RelayState) CompleteRelayByIP(vpnIp netip.Addr, remoteIdx uint32) bool {
  140. rs.Lock()
  141. defer rs.Unlock()
  142. r, ok := rs.relayForByAddr[vpnIp]
  143. if !ok {
  144. return false
  145. }
  146. newRelay := *r
  147. newRelay.State = Established
  148. newRelay.RemoteIndex = remoteIdx
  149. rs.relayForByIdx[r.LocalIndex] = &newRelay
  150. rs.relayForByAddr[r.PeerAddr] = &newRelay
  151. return true
  152. }
  153. func (rs *RelayState) CompleteRelayByIdx(localIdx uint32, remoteIdx uint32) (*Relay, bool) {
  154. rs.Lock()
  155. defer rs.Unlock()
  156. r, ok := rs.relayForByIdx[localIdx]
  157. if !ok {
  158. return nil, false
  159. }
  160. newRelay := *r
  161. newRelay.State = Established
  162. newRelay.RemoteIndex = remoteIdx
  163. rs.relayForByIdx[r.LocalIndex] = &newRelay
  164. rs.relayForByAddr[r.PeerAddr] = &newRelay
  165. return &newRelay, true
  166. }
  167. func (rs *RelayState) QueryRelayForByIp(vpnIp netip.Addr) (*Relay, bool) {
  168. rs.RLock()
  169. defer rs.RUnlock()
  170. r, ok := rs.relayForByAddr[vpnIp]
  171. return r, ok
  172. }
  173. func (rs *RelayState) QueryRelayForByIdx(idx uint32) (*Relay, bool) {
  174. rs.RLock()
  175. defer rs.RUnlock()
  176. r, ok := rs.relayForByIdx[idx]
  177. return r, ok
  178. }
  179. func (rs *RelayState) InsertRelay(ip netip.Addr, idx uint32, r *Relay) {
  180. rs.Lock()
  181. defer rs.Unlock()
  182. rs.relayForByAddr[ip] = r
  183. rs.relayForByIdx[idx] = r
  184. }
  185. type HostInfo struct {
  186. remote netip.AddrPort
  187. remotes *RemoteList
  188. promoteCounter atomic.Uint32
  189. ConnectionState *ConnectionState
  190. remoteIndexId uint32
  191. localIndexId uint32
  192. // vpnAddrs is a list of vpn addresses assigned to this host that are within our own vpn networks
  193. // The host may have other vpn addresses that are outside our
  194. // vpn networks but were removed because they are not usable
  195. vpnAddrs []netip.Addr
  196. recvError atomic.Uint32
  197. // networks are both all vpn and unsafe networks assigned to this host
  198. networks *bart.Table[struct{}]
  199. relayState RelayState
  200. // HandshakePacket records the packets used to create this hostinfo
  201. // We need these to avoid replayed handshake packets creating new hostinfos which causes churn
  202. HandshakePacket map[uint8][]byte
  203. // nextLHQuery is the earliest we can ask the lighthouse for new information.
  204. // This is used to limit lighthouse re-queries in chatty clients
  205. nextLHQuery atomic.Int64
  206. // lastRebindCount is the other side of Interface.rebindCount, if these values don't match then we need to ask LH
  207. // for a punch from the remote end of this tunnel. The goal being to prime their conntrack for our traffic just like
  208. // with a handshake
  209. lastRebindCount int8
  210. // lastHandshakeTime records the time the remote side told us about at the stage when the handshake was completed locally
  211. // Stage 1 packet will contain it if I am a responder, stage 2 packet if I am an initiator
  212. // This is used to avoid an attack where a handshake packet is replayed after some time
  213. lastHandshakeTime uint64
  214. lastRoam time.Time
  215. lastRoamRemote netip.AddrPort
  216. // Used to track other hostinfos for this vpn ip since only 1 can be primary
  217. // Synchronised via hostmap lock and not the hostinfo lock.
  218. next, prev *HostInfo
  219. }
  220. type ViaSender struct {
  221. relayHI *HostInfo // relayHI is the host info object of the relay
  222. remoteIdx uint32 // remoteIdx is the index included in the header of the received packet
  223. relay *Relay // relay contains the rest of the relay information, including the PeerIP of the host trying to communicate with us.
  224. }
  225. type cachedPacket struct {
  226. messageType header.MessageType
  227. messageSubType header.MessageSubType
  228. callback packetCallback
  229. packet []byte
  230. }
  231. type packetCallback func(t header.MessageType, st header.MessageSubType, h *HostInfo, p, nb, out []byte)
  232. type cachedPacketMetrics struct {
  233. sent metrics.Counter
  234. dropped metrics.Counter
  235. }
  236. func NewHostMapFromConfig(l *logrus.Logger, c *config.C) *HostMap {
  237. hm := newHostMap(l)
  238. hm.reload(c, true)
  239. c.RegisterReloadCallback(func(c *config.C) {
  240. hm.reload(c, false)
  241. })
  242. l.WithField("preferredRanges", hm.GetPreferredRanges()).
  243. Info("Main HostMap created")
  244. return hm
  245. }
  246. func newHostMap(l *logrus.Logger) *HostMap {
  247. return &HostMap{
  248. Indexes: map[uint32]*HostInfo{},
  249. Relays: map[uint32]*HostInfo{},
  250. RemoteIndexes: map[uint32]*HostInfo{},
  251. Hosts: map[netip.Addr]*HostInfo{},
  252. l: l,
  253. }
  254. }
  255. func (hm *HostMap) reload(c *config.C, initial bool) {
  256. if initial || c.HasChanged("preferred_ranges") {
  257. var preferredRanges []netip.Prefix
  258. rawPreferredRanges := c.GetStringSlice("preferred_ranges", []string{})
  259. for _, rawPreferredRange := range rawPreferredRanges {
  260. preferredRange, err := netip.ParsePrefix(rawPreferredRange)
  261. if err != nil {
  262. hm.l.WithError(err).WithField("range", rawPreferredRanges).Warn("Failed to parse preferred ranges, ignoring")
  263. continue
  264. }
  265. preferredRanges = append(preferredRanges, preferredRange)
  266. }
  267. oldRanges := hm.preferredRanges.Swap(&preferredRanges)
  268. if !initial {
  269. hm.l.WithField("oldPreferredRanges", *oldRanges).WithField("newPreferredRanges", preferredRanges).Info("preferred_ranges changed")
  270. }
  271. }
  272. }
  273. // EmitStats reports host, index, and relay counts to the stats collection system
  274. func (hm *HostMap) EmitStats() {
  275. hm.RLock()
  276. hostLen := len(hm.Hosts)
  277. indexLen := len(hm.Indexes)
  278. remoteIndexLen := len(hm.RemoteIndexes)
  279. relaysLen := len(hm.Relays)
  280. hm.RUnlock()
  281. metrics.GetOrRegisterGauge("hostmap.main.hosts", nil).Update(int64(hostLen))
  282. metrics.GetOrRegisterGauge("hostmap.main.indexes", nil).Update(int64(indexLen))
  283. metrics.GetOrRegisterGauge("hostmap.main.remoteIndexes", nil).Update(int64(remoteIndexLen))
  284. metrics.GetOrRegisterGauge("hostmap.main.relayIndexes", nil).Update(int64(relaysLen))
  285. }
  286. // DeleteHostInfo will fully unlink the hostinfo and return true if it was the final hostinfo for this vpn ip
  287. func (hm *HostMap) DeleteHostInfo(hostinfo *HostInfo) bool {
  288. // Delete the host itself, ensuring it's not modified anymore
  289. hm.Lock()
  290. // If we have a previous or next hostinfo then we are not the last one for this vpn ip
  291. final := (hostinfo.next == nil && hostinfo.prev == nil)
  292. hm.unlockedDeleteHostInfo(hostinfo)
  293. hm.Unlock()
  294. return final
  295. }
  296. func (hm *HostMap) MakePrimary(hostinfo *HostInfo) {
  297. hm.Lock()
  298. defer hm.Unlock()
  299. hm.unlockedMakePrimary(hostinfo)
  300. }
  301. func (hm *HostMap) unlockedMakePrimary(hostinfo *HostInfo) {
  302. //TODO: we may need to promote follow on hostinfos from these vpnAddrs as well since their oldHostinfo might not be the same as this one
  303. // this really looks like an ideal spot for memory leaks
  304. oldHostinfo := hm.Hosts[hostinfo.vpnAddrs[0]]
  305. if oldHostinfo == hostinfo {
  306. return
  307. }
  308. if hostinfo.prev != nil {
  309. hostinfo.prev.next = hostinfo.next
  310. }
  311. if hostinfo.next != nil {
  312. hostinfo.next.prev = hostinfo.prev
  313. }
  314. hm.Hosts[hostinfo.vpnAddrs[0]] = hostinfo
  315. if oldHostinfo == nil {
  316. return
  317. }
  318. hostinfo.next = oldHostinfo
  319. oldHostinfo.prev = hostinfo
  320. hostinfo.prev = nil
  321. }
  322. func (hm *HostMap) unlockedDeleteHostInfo(hostinfo *HostInfo) {
  323. for _, addr := range hostinfo.vpnAddrs {
  324. h := hm.Hosts[addr]
  325. for h != nil {
  326. if h == hostinfo {
  327. hm.unlockedInnerDeleteHostInfo(h, addr)
  328. }
  329. h = h.next
  330. }
  331. }
  332. }
  333. func (hm *HostMap) unlockedInnerDeleteHostInfo(hostinfo *HostInfo, addr netip.Addr) {
  334. primary, ok := hm.Hosts[addr]
  335. isLastHostinfo := hostinfo.next == nil && hostinfo.prev == nil
  336. if ok && primary == hostinfo {
  337. // The vpn addr pointer points to the same hostinfo as the local index id, we can remove it
  338. delete(hm.Hosts, addr)
  339. if len(hm.Hosts) == 0 {
  340. hm.Hosts = map[netip.Addr]*HostInfo{}
  341. }
  342. if hostinfo.next != nil {
  343. // We had more than 1 hostinfo at this vpn addr, promote the next in the list to primary
  344. hm.Hosts[addr] = hostinfo.next
  345. // It is primary, there is no previous hostinfo now
  346. hostinfo.next.prev = nil
  347. }
  348. } else {
  349. // Relink if we were in the middle of multiple hostinfos for this vpn addr
  350. if hostinfo.prev != nil {
  351. hostinfo.prev.next = hostinfo.next
  352. }
  353. if hostinfo.next != nil {
  354. hostinfo.next.prev = hostinfo.prev
  355. }
  356. }
  357. hostinfo.next = nil
  358. hostinfo.prev = nil
  359. // The remote index uses index ids outside our control so lets make sure we are only removing
  360. // the remote index pointer here if it points to the hostinfo we are deleting
  361. hostinfo2, ok := hm.RemoteIndexes[hostinfo.remoteIndexId]
  362. if ok && hostinfo2 == hostinfo {
  363. delete(hm.RemoteIndexes, hostinfo.remoteIndexId)
  364. if len(hm.RemoteIndexes) == 0 {
  365. hm.RemoteIndexes = map[uint32]*HostInfo{}
  366. }
  367. }
  368. delete(hm.Indexes, hostinfo.localIndexId)
  369. if len(hm.Indexes) == 0 {
  370. hm.Indexes = map[uint32]*HostInfo{}
  371. }
  372. if hm.l.Level >= logrus.DebugLevel {
  373. hm.l.WithField("hostMap", m{"mapTotalSize": len(hm.Hosts),
  374. "vpnAddrs": hostinfo.vpnAddrs, "indexNumber": hostinfo.localIndexId, "remoteIndexNumber": hostinfo.remoteIndexId}).
  375. Debug("Hostmap hostInfo deleted")
  376. }
  377. if isLastHostinfo {
  378. // I have lost connectivity to my peers. My relay tunnel is likely broken. Mark the next
  379. // hops as 'Requested' so that new relay tunnels are created in the future.
  380. hm.unlockedDisestablishVpnAddrRelayFor(hostinfo)
  381. }
  382. // Clean up any local relay indexes for which I am acting as a relay hop
  383. for _, localRelayIdx := range hostinfo.relayState.CopyRelayForIdxs() {
  384. delete(hm.Relays, localRelayIdx)
  385. }
  386. }
  387. func (hm *HostMap) QueryIndex(index uint32) *HostInfo {
  388. hm.RLock()
  389. if h, ok := hm.Indexes[index]; ok {
  390. hm.RUnlock()
  391. return h
  392. } else {
  393. hm.RUnlock()
  394. return nil
  395. }
  396. }
  397. func (hm *HostMap) QueryRelayIndex(index uint32) *HostInfo {
  398. hm.RLock()
  399. if h, ok := hm.Relays[index]; ok {
  400. hm.RUnlock()
  401. return h
  402. } else {
  403. hm.RUnlock()
  404. return nil
  405. }
  406. }
  407. func (hm *HostMap) QueryReverseIndex(index uint32) *HostInfo {
  408. hm.RLock()
  409. if h, ok := hm.RemoteIndexes[index]; ok {
  410. hm.RUnlock()
  411. return h
  412. } else {
  413. hm.RUnlock()
  414. return nil
  415. }
  416. }
  417. func (hm *HostMap) QueryVpnAddr(vpnIp netip.Addr) *HostInfo {
  418. return hm.queryVpnAddr(vpnIp, nil)
  419. }
  420. func (hm *HostMap) QueryVpnAddrsRelayFor(targetIps []netip.Addr, relayHostIp netip.Addr) (*HostInfo, *Relay, error) {
  421. hm.RLock()
  422. defer hm.RUnlock()
  423. h, ok := hm.Hosts[relayHostIp]
  424. if !ok {
  425. return nil, nil, errors.New("unable to find host")
  426. }
  427. for h != nil {
  428. for _, targetIp := range targetIps {
  429. r, ok := h.relayState.QueryRelayForByIp(targetIp)
  430. if ok && r.State == Established {
  431. return h, r, nil
  432. }
  433. }
  434. h = h.next
  435. }
  436. return nil, nil, errors.New("unable to find host with relay")
  437. }
  438. func (hm *HostMap) unlockedDisestablishVpnAddrRelayFor(hi *HostInfo) {
  439. for _, relayHostIp := range hi.relayState.CopyRelayIps() {
  440. if h, ok := hm.Hosts[relayHostIp]; ok {
  441. for h != nil {
  442. h.relayState.UpdateRelayForByIpState(hi.vpnAddrs[0], Disestablished)
  443. h = h.next
  444. }
  445. }
  446. }
  447. for _, rs := range hi.relayState.CopyAllRelayFor() {
  448. if rs.Type == ForwardingType {
  449. if h, ok := hm.Hosts[rs.PeerAddr]; ok {
  450. for h != nil {
  451. h.relayState.UpdateRelayForByIpState(hi.vpnAddrs[0], Disestablished)
  452. h = h.next
  453. }
  454. }
  455. }
  456. }
  457. }
  458. func (hm *HostMap) queryVpnAddr(vpnIp netip.Addr, promoteIfce *Interface) *HostInfo {
  459. hm.RLock()
  460. if h, ok := hm.Hosts[vpnIp]; ok {
  461. hm.RUnlock()
  462. // Do not attempt promotion if you are a lighthouse
  463. if promoteIfce != nil && !promoteIfce.lightHouse.amLighthouse {
  464. h.TryPromoteBest(hm.GetPreferredRanges(), promoteIfce)
  465. }
  466. return h
  467. }
  468. hm.RUnlock()
  469. return nil
  470. }
  471. // unlockedAddHostInfo assumes you have a write-lock and will add a hostinfo object to the hostmap Indexes and RemoteIndexes maps.
  472. // If an entry exists for the Hosts table (vpnIp -> hostinfo) then the provided hostinfo will be made primary
  473. func (hm *HostMap) unlockedAddHostInfo(hostinfo *HostInfo, f *Interface) {
  474. if f.serveDns {
  475. remoteCert := hostinfo.ConnectionState.peerCert
  476. dnsR.Add(remoteCert.Certificate.Name()+".", hostinfo.vpnAddrs)
  477. }
  478. for _, addr := range hostinfo.vpnAddrs {
  479. hm.unlockedInnerAddHostInfo(addr, hostinfo, f)
  480. }
  481. hm.Indexes[hostinfo.localIndexId] = hostinfo
  482. hm.RemoteIndexes[hostinfo.remoteIndexId] = hostinfo
  483. if hm.l.Level >= logrus.DebugLevel {
  484. hm.l.WithField("hostMap", m{"vpnAddrs": hostinfo.vpnAddrs, "mapTotalSize": len(hm.Hosts),
  485. "hostinfo": m{"existing": true, "localIndexId": hostinfo.localIndexId, "vpnAddrs": hostinfo.vpnAddrs}}).
  486. Debug("Hostmap vpnIp added")
  487. }
  488. }
  489. func (hm *HostMap) unlockedInnerAddHostInfo(vpnAddr netip.Addr, hostinfo *HostInfo, f *Interface) {
  490. existing := hm.Hosts[vpnAddr]
  491. hm.Hosts[vpnAddr] = hostinfo
  492. if existing != nil && existing != hostinfo {
  493. hostinfo.next = existing
  494. existing.prev = hostinfo
  495. }
  496. i := 1
  497. check := hostinfo
  498. for check != nil {
  499. if i > MaxHostInfosPerVpnIp {
  500. hm.unlockedDeleteHostInfo(check)
  501. }
  502. check = check.next
  503. i++
  504. }
  505. }
  506. func (hm *HostMap) GetPreferredRanges() []netip.Prefix {
  507. //NOTE: if preferredRanges is ever not stored before a load this will fail to dereference a nil pointer
  508. return *hm.preferredRanges.Load()
  509. }
  510. func (hm *HostMap) ForEachVpnAddr(f controlEach) {
  511. hm.RLock()
  512. defer hm.RUnlock()
  513. for _, v := range hm.Hosts {
  514. f(v)
  515. }
  516. }
  517. func (hm *HostMap) ForEachIndex(f controlEach) {
  518. hm.RLock()
  519. defer hm.RUnlock()
  520. for _, v := range hm.Indexes {
  521. f(v)
  522. }
  523. }
  524. // TryPromoteBest handles re-querying lighthouses and probing for better paths
  525. // NOTE: It is an error to call this if you are a lighthouse since they should not roam clients!
  526. func (i *HostInfo) TryPromoteBest(preferredRanges []netip.Prefix, ifce *Interface) {
  527. c := i.promoteCounter.Add(1)
  528. if c%ifce.tryPromoteEvery.Load() == 0 {
  529. remote := i.remote
  530. // return early if we are already on a preferred remote
  531. if remote.IsValid() {
  532. rIP := remote.Addr()
  533. for _, l := range preferredRanges {
  534. if l.Contains(rIP) {
  535. return
  536. }
  537. }
  538. }
  539. i.remotes.ForEach(preferredRanges, func(addr netip.AddrPort, preferred bool) {
  540. if remote.IsValid() && (!addr.IsValid() || !preferred) {
  541. return
  542. }
  543. // Try to send a test packet to that host, this should
  544. // cause it to detect a roaming event and switch remotes
  545. ifce.sendTo(header.Test, header.TestRequest, i.ConnectionState, i, addr, []byte(""), make([]byte, 12, 12), make([]byte, mtu))
  546. })
  547. }
  548. // Re query our lighthouses for new remotes occasionally
  549. if c%ifce.reQueryEvery.Load() == 0 && ifce.lightHouse != nil {
  550. now := time.Now().UnixNano()
  551. if now < i.nextLHQuery.Load() {
  552. return
  553. }
  554. i.nextLHQuery.Store(now + ifce.reQueryWait.Load())
  555. ifce.lightHouse.QueryServer(i.vpnAddrs[0])
  556. }
  557. }
  558. func (i *HostInfo) GetCert() *cert.CachedCertificate {
  559. if i.ConnectionState != nil {
  560. return i.ConnectionState.peerCert
  561. }
  562. return nil
  563. }
  564. func (i *HostInfo) SetRemote(remote netip.AddrPort) {
  565. // We copy here because we likely got this remote from a source that reuses the object
  566. if i.remote != remote {
  567. i.remote = remote
  568. i.remotes.LearnRemote(i.vpnAddrs[0], remote)
  569. }
  570. }
  571. // SetRemoteIfPreferred returns true if the remote was changed. The lastRoam
  572. // time on the HostInfo will also be updated.
  573. func (i *HostInfo) SetRemoteIfPreferred(hm *HostMap, newRemote netip.AddrPort) bool {
  574. if !newRemote.IsValid() {
  575. // relays have nil udp Addrs
  576. return false
  577. }
  578. currentRemote := i.remote
  579. if !currentRemote.IsValid() {
  580. i.SetRemote(newRemote)
  581. return true
  582. }
  583. // NOTE: We do this loop here instead of calling `isPreferred` in
  584. // remote_list.go so that we only have to loop over preferredRanges once.
  585. newIsPreferred := false
  586. for _, l := range hm.GetPreferredRanges() {
  587. // return early if we are already on a preferred remote
  588. if l.Contains(currentRemote.Addr()) {
  589. return false
  590. }
  591. if l.Contains(newRemote.Addr()) {
  592. newIsPreferred = true
  593. }
  594. }
  595. if newIsPreferred {
  596. // Consider this a roaming event
  597. i.lastRoam = time.Now()
  598. i.lastRoamRemote = currentRemote
  599. i.SetRemote(newRemote)
  600. return true
  601. }
  602. return false
  603. }
  604. func (i *HostInfo) RecvErrorExceeded() bool {
  605. if i.recvError.Add(1) >= maxRecvError {
  606. return true
  607. }
  608. return true
  609. }
  610. func (i *HostInfo) buildNetworks(networks, unsafeNetworks []netip.Prefix) {
  611. if len(networks) == 1 && len(unsafeNetworks) == 0 {
  612. // Simple case, no CIDRTree needed
  613. return
  614. }
  615. i.networks = new(bart.Table[struct{}])
  616. for _, network := range networks {
  617. i.networks.Insert(network, struct{}{})
  618. }
  619. for _, network := range unsafeNetworks {
  620. i.networks.Insert(network, struct{}{})
  621. }
  622. }
  623. func (i *HostInfo) logger(l *logrus.Logger) *logrus.Entry {
  624. if i == nil {
  625. return logrus.NewEntry(l)
  626. }
  627. li := l.WithField("vpnAddrs", i.vpnAddrs).
  628. WithField("localIndex", i.localIndexId).
  629. WithField("remoteIndex", i.remoteIndexId)
  630. if connState := i.ConnectionState; connState != nil {
  631. if peerCert := connState.peerCert; peerCert != nil {
  632. li = li.WithField("certName", peerCert.Certificate.Name())
  633. }
  634. }
  635. return li
  636. }
  637. // Utility functions
  638. func localAddrs(l *logrus.Logger, allowList *LocalAllowList) []netip.Addr {
  639. //FIXME: This function is pretty garbage
  640. var finalAddrs []netip.Addr
  641. ifaces, _ := net.Interfaces()
  642. for _, i := range ifaces {
  643. allow := allowList.AllowName(i.Name)
  644. if l.Level >= logrus.TraceLevel {
  645. l.WithField("interfaceName", i.Name).WithField("allow", allow).Trace("localAllowList.AllowName")
  646. }
  647. if !allow {
  648. continue
  649. }
  650. addrs, _ := i.Addrs()
  651. for _, rawAddr := range addrs {
  652. var addr netip.Addr
  653. switch v := rawAddr.(type) {
  654. case *net.IPNet:
  655. //continue
  656. addr, _ = netip.AddrFromSlice(v.IP)
  657. case *net.IPAddr:
  658. addr, _ = netip.AddrFromSlice(v.IP)
  659. }
  660. if !addr.IsValid() {
  661. if l.Level >= logrus.DebugLevel {
  662. l.WithField("localAddr", rawAddr).Debug("addr was invalid")
  663. }
  664. continue
  665. }
  666. addr = addr.Unmap()
  667. if addr.IsLoopback() == false && addr.IsLinkLocalUnicast() == false {
  668. isAllowed := allowList.Allow(addr)
  669. if l.Level >= logrus.TraceLevel {
  670. l.WithField("localAddr", addr).WithField("allowed", isAllowed).Trace("localAllowList.Allow")
  671. }
  672. if !isAllowed {
  673. continue
  674. }
  675. finalAddrs = append(finalAddrs, addr)
  676. }
  677. }
  678. }
  679. return finalAddrs
  680. }