registry.go 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240
  1. package server
  2. import (
  3. "fmt"
  4. "net/url"
  5. "path"
  6. "path/filepath"
  7. "sort"
  8. "strings"
  9. "sync"
  10. "github.com/coreos/etcd/log"
  11. "github.com/coreos/etcd/store"
  12. )
  13. // The location of the peer URL data.
  14. const RegistryKey = "/_etcd/machines"
  15. // The Registry stores URL information for nodes.
  16. type Registry struct {
  17. sync.Mutex
  18. store store.Store
  19. peers map[string]*node
  20. }
  21. // The internal storage format of the registry.
  22. type node struct {
  23. peerVersion string
  24. peerURL string
  25. url string
  26. }
  27. // Creates a new Registry.
  28. func NewRegistry(s store.Store) *Registry {
  29. return &Registry{
  30. store: s,
  31. peers: make(map[string]*node),
  32. }
  33. }
  34. // Names returns a list of cached peer names.
  35. func (r *Registry) Names() []string {
  36. r.Lock()
  37. defer r.Unlock()
  38. names := make([]string, 0, len(r.peers))
  39. for name := range r.peers {
  40. names = append(names, name)
  41. }
  42. sort.Sort(sort.StringSlice(names))
  43. return names
  44. }
  45. // Register adds a peer to the registry.
  46. func (r *Registry) Register(name string, peerURL string, machURL string) error {
  47. // Write data to store.
  48. v := url.Values{}
  49. v.Set("raft", peerURL)
  50. v.Set("etcd", machURL)
  51. log.Debugf("Register: %s", name)
  52. if _, err := r.store.Create(path.Join(RegistryKey, name), false, v.Encode(), false, store.Permanent); err != nil {
  53. return err
  54. }
  55. r.Lock()
  56. defer r.Unlock()
  57. r.peers[name] = r.load(RegistryKey, name)
  58. return nil
  59. }
  60. // Unregister removes a peer from the registry.
  61. func (r *Registry) Unregister(name string) error {
  62. // Remove the key from the store.
  63. log.Debugf("Unregister: %s", name)
  64. _, err := r.store.Delete(path.Join(RegistryKey, name), false, false)
  65. return err
  66. }
  67. // Count returns the number of peers in the cluster.
  68. func (r *Registry) Count() int {
  69. e, err := r.store.Get(RegistryKey, false, false)
  70. if err != nil {
  71. return 0
  72. }
  73. return len(e.Node.Nodes)
  74. }
  75. // Exists checks if a peer with the given name exists.
  76. func (r *Registry) Exists(name string) bool {
  77. e, err := r.store.Get(path.Join(RegistryKey, name), false, false)
  78. if err != nil {
  79. return false
  80. }
  81. return (e.Node != nil)
  82. }
  83. // Retrieves the client URL for a given node by name.
  84. func (r *Registry) ClientURL(name string) (string, bool) {
  85. r.Lock()
  86. defer r.Unlock()
  87. return r.clientURL(RegistryKey, name)
  88. }
  89. func (r *Registry) clientURL(key, name string) (string, bool) {
  90. if r.peers[name] == nil {
  91. if peer := r.load(key, name); peer != nil {
  92. r.peers[name] = peer
  93. }
  94. }
  95. if peer := r.peers[name]; peer != nil {
  96. return peer.url, true
  97. }
  98. return "", false
  99. }
  100. // TODO(yichengq): have all of the code use a full URL with scheme
  101. // and remove this method
  102. // PeerHost retrieves the host part of peer URL for a given node by name.
  103. func (r *Registry) PeerHost(name string) (string, bool) {
  104. rawurl, ok := r.PeerURL(name)
  105. if ok {
  106. u, _ := url.Parse(rawurl)
  107. return u.Host, ok
  108. }
  109. return rawurl, ok
  110. }
  111. // Retrieves the peer URL for a given node by name.
  112. func (r *Registry) PeerURL(name string) (string, bool) {
  113. r.Lock()
  114. defer r.Unlock()
  115. return r.peerURL(RegistryKey, name)
  116. }
  117. func (r *Registry) peerURL(key, name string) (string, bool) {
  118. if r.peers[name] == nil {
  119. if peer := r.load(key, name); peer != nil {
  120. r.peers[name] = peer
  121. }
  122. }
  123. if peer := r.peers[name]; peer != nil {
  124. return peer.peerURL, true
  125. }
  126. return "", false
  127. }
  128. // UpdatePeerURL updates peer URL in registry
  129. func (r *Registry) UpdatePeerURL(name string, peerURL string) error {
  130. machURL, _ := r.clientURL(RegistryKey, name)
  131. // Write data to store.
  132. v := url.Values{}
  133. v.Set("raft", peerURL)
  134. v.Set("etcd", machURL)
  135. log.Debugf("Update PeerURL: %s", name)
  136. if _, err := r.store.Update(path.Join(RegistryKey, name), v.Encode(), store.Permanent); err != nil {
  137. return err
  138. }
  139. r.Lock()
  140. defer r.Unlock()
  141. // Invalidate outdated cache.
  142. r.invalidate(name)
  143. return nil
  144. }
  145. // Retrieves the Client URLs for all nodes.
  146. func (r *Registry) ClientURLs(leaderName, selfName string) []string {
  147. return r.urls(RegistryKey, leaderName, selfName, r.clientURL)
  148. }
  149. // Retrieves the Peer URLs for all nodes.
  150. func (r *Registry) PeerURLs(leaderName, selfName string) []string {
  151. return r.urls(RegistryKey, leaderName, selfName, r.peerURL)
  152. }
  153. // Retrieves the URLs for all nodes using url function.
  154. func (r *Registry) urls(key, leaderName, selfName string, url func(key, name string) (string, bool)) []string {
  155. r.Lock()
  156. defer r.Unlock()
  157. // Build list including the leader and self.
  158. urls := make([]string, 0)
  159. if url, _ := url(key, leaderName); len(url) > 0 {
  160. urls = append(urls, url)
  161. }
  162. // Retrieve a list of all nodes.
  163. if e, _ := r.store.Get(key, false, false); e != nil {
  164. // Lookup the URL for each one.
  165. for _, pair := range e.Node.Nodes {
  166. _, name := filepath.Split(pair.Key)
  167. if url, _ := url(key, name); len(url) > 0 && name != leaderName {
  168. urls = append(urls, url)
  169. }
  170. }
  171. }
  172. log.Debugf("URLs: %s: %s / %s (%s)", key, leaderName, selfName, strings.Join(urls, ","))
  173. return urls
  174. }
  175. // Removes a node from the cache.
  176. func (r *Registry) Invalidate(name string) {
  177. r.Lock()
  178. defer r.Unlock()
  179. r.invalidate(name)
  180. }
  181. func (r *Registry) invalidate(name string) {
  182. delete(r.peers, name)
  183. }
  184. // Loads the given node by name from the store into the cache.
  185. func (r *Registry) load(key, name string) *node {
  186. if name == "" {
  187. return nil
  188. }
  189. // Retrieve from store.
  190. e, err := r.store.Get(path.Join(key, name), false, false)
  191. if err != nil {
  192. return nil
  193. }
  194. // Parse as a query string.
  195. m, err := url.ParseQuery(*e.Node.Value)
  196. if err != nil {
  197. panic(fmt.Sprintf("Failed to parse peers entry: %s", name))
  198. }
  199. // Create node.
  200. return &node{
  201. url: m["etcd"][0],
  202. peerURL: m["raft"][0],
  203. }
  204. }