registry.go 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186
  1. package server
  2. import (
  3. "fmt"
  4. "net/url"
  5. "path"
  6. "path/filepath"
  7. "strings"
  8. "sync"
  9. "github.com/coreos/etcd/log"
  10. "github.com/coreos/etcd/store"
  11. )
  12. // The location of the machine URL data.
  13. const RegistryKey = "/_etcd/machines"
  14. // The Registry stores URL information for nodes.
  15. type Registry struct {
  16. sync.Mutex
  17. store *store.Store
  18. nodes map[string]*node
  19. }
  20. // The internal storage format of the registry.
  21. type node struct {
  22. peerVersion string
  23. peerURL string
  24. url string
  25. }
  26. // Creates a new Registry.
  27. func NewRegistry(s *store.Store) *Registry {
  28. return &Registry{
  29. store: s,
  30. nodes: make(map[string]*node),
  31. }
  32. }
  33. // Adds a node to the registry.
  34. func (r *Registry) Register(name string, peerVersion string, peerURL string, url string, commitIndex uint64, term uint64) {
  35. r.Lock()
  36. defer r.Unlock()
  37. // Write data to store.
  38. key := path.Join(RegistryKey, name)
  39. value := fmt.Sprintf("raft=%s&etcd=%s&raftVersion=%s", peerURL, url, peerVersion)
  40. r.store.Create(key, value, false, false, store.Permanent, commitIndex, term)
  41. }
  42. // Removes a node from the registry.
  43. func (r *Registry) Unregister(name string, commitIndex uint64, term uint64) error {
  44. r.Lock()
  45. defer r.Unlock()
  46. // Remove the key from the store.
  47. _, err := r.store.Delete(path.Join(RegistryKey, name), false, commitIndex, term)
  48. return err
  49. }
  50. // Returns the number of nodes in the cluster.
  51. func (r *Registry) Count() int {
  52. e, err := r.store.Get(RegistryKey, false, false, 0, 0)
  53. if err != nil {
  54. return 0
  55. }
  56. return len(e.KVPairs)
  57. }
  58. // Retrieves the URL for a given node by name.
  59. func (r *Registry) URL(name string) (string, bool) {
  60. r.Lock()
  61. defer r.Unlock()
  62. return r.url(name)
  63. }
  64. func (r *Registry) url(name string) (string, bool) {
  65. if r.nodes[name] == nil {
  66. r.load(name)
  67. }
  68. if node := r.nodes[name]; node != nil {
  69. return node.url, true
  70. }
  71. return "", false
  72. }
  73. // Retrieves the URLs for all nodes.
  74. func (r *Registry) URLs(leaderName, selfName string) []string {
  75. r.Lock()
  76. defer r.Unlock()
  77. // Build list including the leader and self.
  78. urls := make([]string, 0)
  79. if url, _ := r.url(leaderName); len(url) > 0 {
  80. urls = append(urls, url)
  81. }
  82. // Retrieve a list of all nodes.
  83. if e, _ := r.store.Get(RegistryKey, false, false, 0, 0); e != nil {
  84. // Lookup the URL for each one.
  85. for _, pair := range e.KVPairs {
  86. _, name := filepath.Split(pair.Key)
  87. if url, _ := r.url(name); len(url) > 0 && name != leaderName {
  88. urls = append(urls, url)
  89. }
  90. }
  91. }
  92. log.Infof("URLs: %s / %s (%s)", leaderName, selfName, strings.Join(urls, ","))
  93. return urls
  94. }
  95. // Retrieves the peer URL for a given node by name.
  96. func (r *Registry) PeerURL(name string) (string, bool) {
  97. r.Lock()
  98. defer r.Unlock()
  99. return r.peerURL(name)
  100. }
  101. func (r *Registry) peerURL(name string) (string, bool) {
  102. if r.nodes[name] == nil {
  103. r.load(name)
  104. }
  105. if node := r.nodes[name]; node != nil {
  106. return node.peerURL, true
  107. }
  108. return "", false
  109. }
  110. // Retrieves the peer URLs for all nodes.
  111. func (r *Registry) PeerURLs(leaderName, selfName string) []string {
  112. r.Lock()
  113. defer r.Unlock()
  114. // Build list including the leader and self.
  115. urls := make([]string, 0)
  116. if url, _ := r.peerURL(leaderName); len(url) > 0 {
  117. urls = append(urls, url)
  118. }
  119. // Retrieve a list of all nodes.
  120. if e, _ := r.store.Get(RegistryKey, false, false, 0, 0); e != nil {
  121. // Lookup the URL for each one.
  122. for _, pair := range e.KVPairs {
  123. _, name := filepath.Split(pair.Key)
  124. if url, _ := r.peerURL(name); len(url) > 0 && name != leaderName {
  125. urls = append(urls, url)
  126. }
  127. }
  128. }
  129. log.Infof("PeerURLs: %s / %s (%s)", leaderName, selfName, strings.Join(urls, ","))
  130. return urls
  131. }
  132. // Loads the given node by name from the store into the cache.
  133. func (r *Registry) load(name string) {
  134. if name == "" {
  135. return
  136. }
  137. // Retrieve from store.
  138. e, err := r.store.Get(path.Join(RegistryKey, name), false, false, 0, 0)
  139. if err != nil {
  140. return
  141. }
  142. // Parse as a query string.
  143. m, err := url.ParseQuery(e.Value)
  144. if err != nil {
  145. panic(fmt.Sprintf("Failed to parse machines entry: %s", name))
  146. }
  147. // Create node.
  148. r.nodes[name] = &node{
  149. url: m["etcd"][0],
  150. peerURL: m["raft"][0],
  151. peerVersion: m["raftVersion"][0],
  152. }
  153. }