failover.go 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. package logic
  2. import (
  3. "errors"
  4. "net"
  5. "github.com/google/uuid"
  6. "github.com/gravitl/netmaker/logic"
  7. "github.com/gravitl/netmaker/models"
  8. )
  9. func SetFailOverCtx(failOverNode, victimNode, peerNode models.Node) error {
  10. if peerNode.FailOverPeers == nil {
  11. peerNode.FailOverPeers = make(map[string]struct{})
  12. }
  13. if victimNode.FailOverPeers == nil {
  14. victimNode.FailOverPeers = make(map[string]struct{})
  15. }
  16. peerNode.FailOverPeers[victimNode.ID.String()] = struct{}{}
  17. victimNode.FailOverPeers[peerNode.ID.String()] = struct{}{}
  18. victimNode.FailedOverBy = failOverNode.ID
  19. peerNode.FailedOverBy = failOverNode.ID
  20. if err := logic.UpsertNode(&failOverNode); err != nil {
  21. return err
  22. }
  23. if err := logic.UpsertNode(&victimNode); err != nil {
  24. return err
  25. }
  26. if err := logic.UpsertNode(&peerNode); err != nil {
  27. return err
  28. }
  29. return nil
  30. }
  31. // GetFailOverNode - gets the host acting as failOver
  32. func GetFailOverNode(network string, allNodes []models.Node) (models.Node, error) {
  33. nodes := logic.GetNetworkNodesMemory(allNodes, network)
  34. for _, node := range nodes {
  35. if node.IsFailOver {
  36. return node, nil
  37. }
  38. }
  39. return models.Node{}, errors.New("auto relay not found")
  40. }
  41. // FailOverExists - checks if failOver exists already in the network
  42. func FailOverExists(network string) (failOverNode models.Node, exists bool) {
  43. nodes, err := logic.GetNetworkNodes(network)
  44. if err != nil {
  45. return
  46. }
  47. for _, node := range nodes {
  48. if node.IsFailOver {
  49. exists = true
  50. failOverNode = node
  51. return
  52. }
  53. }
  54. return
  55. }
  56. // ResetFailedOverPeer - removes failed over node from network peers
  57. func ResetFailedOverPeer(failedOveredNode *models.Node) error {
  58. nodes, err := logic.GetNetworkNodes(failedOveredNode.Network)
  59. if err != nil {
  60. return err
  61. }
  62. failedOveredNode.FailedOverBy = uuid.Nil
  63. failedOveredNode.FailOverPeers = make(map[string]struct{})
  64. err = logic.UpsertNode(failedOveredNode)
  65. if err != nil {
  66. return err
  67. }
  68. for _, node := range nodes {
  69. if node.FailOverPeers == nil || node.ID == failedOveredNode.ID {
  70. continue
  71. }
  72. delete(node.FailOverPeers, failedOveredNode.ID.String())
  73. logic.UpsertNode(&node)
  74. }
  75. return nil
  76. }
  77. // ResetFailOver - reset failovered peers
  78. func ResetFailOver(failOverNode *models.Node) error {
  79. // Unset FailedOverPeers
  80. nodes, err := logic.GetNetworkNodes(failOverNode.Network)
  81. if err != nil {
  82. return err
  83. }
  84. for _, node := range nodes {
  85. if node.FailedOverBy == failOverNode.ID {
  86. node.FailedOverBy = uuid.Nil
  87. node.FailOverPeers = make(map[string]struct{})
  88. logic.UpsertNode(&node)
  89. }
  90. }
  91. return nil
  92. }
  93. // GetFailOverPeerIps - adds the failedOvered peerIps by the peer
  94. func GetFailOverPeerIps(peer, node *models.Node) []net.IPNet {
  95. allowedips := []net.IPNet{}
  96. for failOverpeerID := range node.FailOverPeers {
  97. failOverpeer, err := logic.GetNodeByID(failOverpeerID)
  98. if err == nil && failOverpeer.FailedOverBy == peer.ID {
  99. if failOverpeer.Address.IP != nil {
  100. allowed := net.IPNet{
  101. IP: failOverpeer.Address.IP,
  102. Mask: net.CIDRMask(32, 32),
  103. }
  104. allowedips = append(allowedips, allowed)
  105. }
  106. if failOverpeer.Address6.IP != nil {
  107. allowed := net.IPNet{
  108. IP: failOverpeer.Address6.IP,
  109. Mask: net.CIDRMask(128, 128),
  110. }
  111. allowedips = append(allowedips, allowed)
  112. }
  113. }
  114. }
  115. return allowedips
  116. }