etcd/store/store.go

413 lines
9.3 KiB
Go
Raw Normal View History

2013-09-29 03:26:19 +04:00
package store
2013-09-03 22:30:42 +04:00
import (
2013-09-14 01:10:40 +04:00
"encoding/json"
2013-09-05 23:38:22 +04:00
"fmt"
"path"
2013-09-09 05:14:31 +04:00
"sort"
2013-09-03 22:30:42 +04:00
"strings"
2013-09-29 03:58:57 +04:00
"sync"
2013-09-03 22:30:42 +04:00
"time"
2013-09-29 03:26:19 +04:00
etcdErr "github.com/coreos/etcd/error"
2013-09-03 22:30:42 +04:00
)
2013-09-29 03:26:19 +04:00
type Store struct {
2013-09-14 01:10:40 +04:00
Root *Node
WatcherHub *watcherHub
Index uint64
Term uint64
2013-09-29 03:26:19 +04:00
Stats *Stats
2013-09-29 03:58:57 +04:00
worldLock sync.RWMutex // stop the world lock. Used to do snapshot
2013-09-03 22:30:42 +04:00
}
2013-09-29 03:26:19 +04:00
func New() *Store {
s := new(Store)
s.Root = newDir("/", 0, 0, nil, "", Permanent)
s.Stats = newStats()
s.WatcherHub = newWatchHub(1000)
2013-09-23 09:55:22 +04:00
2013-09-29 03:26:19 +04:00
return s
2013-09-03 22:30:42 +04:00
}
2013-09-29 03:26:19 +04:00
func (s *Store) Get(nodePath string, recursive, sorted bool, index uint64, term uint64) (*Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
2013-09-14 23:13:33 +04:00
nodePath = path.Clean(path.Join("/", nodePath))
2013-09-29 03:58:57 +04:00
n, err := s.internalGet(nodePath, index, term)
2013-09-03 22:30:42 +04:00
2013-09-04 05:27:46 +04:00
if err != nil {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(GetFail)
2013-09-04 05:27:46 +04:00
return nil, err
}
2013-09-03 22:30:42 +04:00
e := newEvent(Get, nodePath, index, term)
2013-09-03 22:30:42 +04:00
2013-09-04 05:27:46 +04:00
if n.IsDir() { // node is dir
2013-09-07 07:36:11 +04:00
e.Dir = true
2013-09-03 22:30:42 +04:00
2013-09-06 07:10:41 +04:00
children, _ := n.List()
e.KVPairs = make([]KeyValuePair, len(children))
// we do not use the index in the children slice directly
// we need to skip the hidden one
2013-09-04 05:27:46 +04:00
i := 0
2013-09-03 22:30:42 +04:00
2013-09-06 07:10:41 +04:00
for _, child := range children {
2013-09-04 05:27:46 +04:00
2013-09-04 07:21:26 +04:00
if child.IsHidden() { // get will not list hidden node
2013-09-04 06:35:25 +04:00
continue
}
e.KVPairs[i] = child.Pair(recursive, sorted)
2013-09-04 06:35:25 +04:00
2013-09-04 05:27:46 +04:00
i++
}
2013-09-04 07:10:33 +04:00
// eliminate hidden nodes
e.KVPairs = e.KVPairs[:i]
rootPairs := KeyValuePair{
KVPairs: e.KVPairs,
}
if sorted {
sort.Sort(rootPairs)
2013-09-09 05:14:31 +04:00
}
2013-09-04 05:27:46 +04:00
} else { // node is file
e.Value = n.Value
2013-09-03 22:30:42 +04:00
}
2013-09-14 23:13:33 +04:00
if n.ExpireTime.Sub(Permanent) != 0 {
e.Expiration = &n.ExpireTime
e.TTL = int64(n.ExpireTime.Sub(time.Now())/time.Second) + 1
}
2013-09-29 03:26:19 +04:00
s.Stats.Inc(GetSuccess)
2013-09-04 05:27:46 +04:00
return e, nil
2013-09-03 22:30:42 +04:00
}
// Create function creates the Node at nodePath. Create will help to create intermediate directories with no ttl.
// If the node has already existed, create will fail.
// If any node on the path is a file, create will fail.
2013-09-29 03:26:19 +04:00
func (s *Store) Create(nodePath string, value string, expireTime time.Time, index uint64, term uint64) (*Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
2013-09-14 23:13:33 +04:00
nodePath = path.Clean(path.Join("/", nodePath))
2013-09-07 07:01:11 +04:00
// make sure we can create the node
2013-09-29 03:58:57 +04:00
_, err := s.internalGet(nodePath, index, term)
2013-09-07 07:01:11 +04:00
2013-09-07 07:24:01 +04:00
if err == nil { // key already exists
2013-09-29 03:26:19 +04:00
s.Stats.Inc(SetFail)
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeNodeExist, nodePath)
2013-09-07 07:01:11 +04:00
}
etcdError, _ := err.(etcdErr.Error)
if etcdError.ErrorCode == 104 { // we cannot create the key due to meet a file while walking
2013-09-29 03:26:19 +04:00
s.Stats.Inc(SetFail)
2013-09-07 07:01:11 +04:00
return nil, err
}
dir, _ := path.Split(nodePath)
2013-09-07 07:01:11 +04:00
// walk through the nodePath, create dirs and get the last directory node
2013-09-29 03:26:19 +04:00
d, err := s.walk(dir, s.checkDir)
2013-09-07 07:01:11 +04:00
if err != nil {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(SetFail)
2013-09-07 07:01:11 +04:00
return nil, err
}
2013-09-29 03:26:19 +04:00
e := newEvent(Create, nodePath, s.Index, s.Term)
2013-09-07 07:01:11 +04:00
2013-09-07 07:36:11 +04:00
var n *Node
if len(value) != 0 { // create file
e.Value = value
2013-09-29 03:26:19 +04:00
n = newFile(nodePath, value, s.Index, s.Term, d, "", expireTime)
2013-09-07 07:36:11 +04:00
} else { // create directory
e.Dir = true
2013-09-29 03:26:19 +04:00
n = newDir(nodePath, s.Index, s.Term, d, "", expireTime)
2013-09-07 07:36:11 +04:00
}
2013-09-07 07:01:11 +04:00
2013-09-07 07:36:11 +04:00
err = d.Add(n)
2013-09-07 07:01:11 +04:00
2013-09-04 05:27:46 +04:00
if err != nil {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(SetFail)
2013-09-04 06:35:25 +04:00
return nil, err
2013-09-04 05:27:46 +04:00
}
// Node with TTL
2013-09-14 23:13:33 +04:00
if expireTime.Sub(Permanent) != 0 {
2013-09-30 10:39:40 +04:00
n.Expire(s)
2013-09-07 07:36:11 +04:00
e.Expiration = &n.ExpireTime
2013-09-14 23:13:33 +04:00
e.TTL = int64(expireTime.Sub(time.Now())/time.Second) + 1
2013-09-04 05:27:46 +04:00
}
2013-09-29 03:26:19 +04:00
s.WatcherHub.notify(e)
s.Stats.Inc(SetSuccess)
2013-09-04 06:35:25 +04:00
return e, nil
2013-09-03 22:30:42 +04:00
}
// Update function updates the value/ttl of the node.
// If the node is a file, the value and the ttl can be updated.
// If the node is a directory, only the ttl can be updated.
2013-09-29 03:26:19 +04:00
func (s *Store) Update(nodePath string, value string, expireTime time.Time, index uint64, term uint64) (*Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
n, err := s.internalGet(nodePath, index, term)
2013-09-07 07:24:01 +04:00
if err != nil { // if the node does not exist, return error
2013-09-29 03:26:19 +04:00
s.Stats.Inc(UpdateFail)
2013-09-07 07:24:01 +04:00
return nil, err
}
2013-09-29 03:26:19 +04:00
e := newEvent(Update, nodePath, s.Index, s.Term)
2013-09-07 07:24:01 +04:00
if n.IsDir() { // if the node is a directory, we can only update ttl
if len(value) != 0 {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(UpdateFail)
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeNotFile, nodePath)
2013-09-07 07:24:01 +04:00
}
} else { // if the node is a file, we can update value and ttl
e.PrevValue = n.Value
if len(value) != 0 {
e.Value = value
}
n.Write(value, index, term)
}
// update ttl
2013-09-30 10:39:40 +04:00
n.UpdateTTL(expireTime, s)
e.Expiration = &n.ExpireTime
e.TTL = int64(expireTime.Sub(time.Now())/time.Second) + 1
2013-09-29 03:26:19 +04:00
s.WatcherHub.notify(e)
2013-09-29 03:26:19 +04:00
s.Stats.Inc(UpdateSuccess)
2013-09-07 07:24:01 +04:00
return e, nil
}
2013-09-29 03:26:19 +04:00
func (s *Store) TestAndSet(nodePath string, prevValue string, prevIndex uint64,
value string, expireTime time.Time, index uint64, term uint64) (*Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
n, err := s.internalGet(nodePath, index, term)
2013-09-03 22:30:42 +04:00
2013-09-05 23:38:22 +04:00
if err != nil {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(TestAndSetFail)
2013-09-05 23:38:22 +04:00
return nil, err
}
2013-09-03 22:30:42 +04:00
if n.IsDir() { // can only test and set file
2013-09-29 03:26:19 +04:00
s.Stats.Inc(TestAndSetFail)
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeNotFile, nodePath)
2013-09-05 23:38:22 +04:00
}
if n.Value == prevValue || n.ModifiedIndex == prevIndex {
2013-09-05 23:38:22 +04:00
// if test succeed, write the value
e := newEvent(TestAndSet, nodePath, index, term)
e.PrevValue = n.Value
2013-09-05 23:38:22 +04:00
e.Value = value
n.Write(value, index, term)
2013-09-30 10:39:40 +04:00
n.UpdateTTL(expireTime, s)
2013-09-29 03:26:19 +04:00
s.WatcherHub.notify(e)
s.Stats.Inc(TestAndSetSuccess)
2013-09-05 23:38:22 +04:00
return e, nil
}
cause := fmt.Sprintf("[%v != %v] [%v != %v]", prevValue, n.Value, prevIndex, n.ModifiedIndex)
2013-09-29 03:26:19 +04:00
s.Stats.Inc(TestAndSetFail)
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeTestFailed, cause)
2013-09-03 22:30:42 +04:00
}
// Delete function deletes the node at the given path.
// If the node is a directory, recursive must be true to delete it.
2013-09-29 03:26:19 +04:00
func (s *Store) Delete(nodePath string, recursive bool, index uint64, term uint64) (*Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
n, err := s.internalGet(nodePath, index, term)
2013-09-03 22:30:42 +04:00
if err != nil { // if the node does not exist, return error
2013-09-29 03:26:19 +04:00
s.Stats.Inc(DeleteFail)
2013-09-04 06:35:25 +04:00
return nil, err
}
e := newEvent(Delete, nodePath, index, term)
2013-09-04 06:35:25 +04:00
if n.IsDir() {
e.Dir = true
} else {
e.PrevValue = n.Value
}
callback := func(path string) { // notify function
2013-09-29 03:26:19 +04:00
s.WatcherHub.notifyWithPath(e, path, true)
2013-09-07 09:05:11 +04:00
}
err = n.Remove(recursive, callback)
2013-09-07 09:05:11 +04:00
if err != nil {
2013-09-29 03:26:19 +04:00
s.Stats.Inc(DeleteFail)
2013-09-07 09:05:11 +04:00
return nil, err
}
2013-09-29 03:26:19 +04:00
s.WatcherHub.notify(e)
s.Stats.Inc(DeleteSuccess)
2013-09-07 09:05:11 +04:00
2013-09-04 06:35:25 +04:00
return e, nil
2013-09-03 22:30:42 +04:00
}
2013-09-29 03:26:19 +04:00
func (s *Store) Watch(prefix string, recursive bool, sinceIndex uint64, index uint64, term uint64) (<-chan *Event, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.RLock()
defer s.worldLock.RUnlock()
2013-09-29 03:26:19 +04:00
s.Index, s.Term = index, term
2013-09-14 23:13:33 +04:00
if sinceIndex == 0 {
2013-09-29 03:26:19 +04:00
return s.WatcherHub.watch(prefix, recursive, index+1)
2013-09-14 23:13:33 +04:00
}
2013-09-29 03:26:19 +04:00
return s.WatcherHub.watch(prefix, recursive, sinceIndex)
2013-09-14 23:13:33 +04:00
}
// walk function walks all the nodePath and apply the walkFunc on each directory
2013-09-29 03:26:19 +04:00
func (s *Store) walk(nodePath string, walkFunc func(prev *Node, component string) (*Node, error)) (*Node, error) {
components := strings.Split(nodePath, "/")
2013-09-03 22:30:42 +04:00
2013-09-29 03:26:19 +04:00
curr := s.Root
2013-09-03 22:30:42 +04:00
var err error
for i := 1; i < len(components); i++ {
if len(components[i]) == 0 { // ignore empty string
return curr, nil
}
curr, err = walkFunc(curr, components[i])
if err != nil {
return nil, err
}
}
return curr, nil
}
// InternalGet function get the node of the given nodePath.
2013-09-29 03:58:57 +04:00
func (s *Store) internalGet(nodePath string, index uint64, term uint64) (*Node, error) {
2013-09-14 23:13:33 +04:00
nodePath = path.Clean(path.Join("/", nodePath))
2013-09-04 05:27:46 +04:00
// update file system known index and term
2013-09-29 03:26:19 +04:00
s.Index, s.Term = index, term
2013-09-04 05:27:46 +04:00
2013-09-05 23:38:22 +04:00
walkFunc := func(parent *Node, name string) (*Node, error) {
if !parent.IsDir() {
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeNotDir, parent.Path)
2013-09-05 23:38:22 +04:00
}
child, ok := parent.Children[name]
2013-09-04 05:27:46 +04:00
if ok {
return child, nil
}
2013-09-09 02:46:16 +04:00
return nil, etcdErr.NewError(etcdErr.EcodeKeyNotFound, path.Join(parent.Path, name))
2013-09-04 05:27:46 +04:00
}
2013-09-29 03:26:19 +04:00
f, err := s.walk(nodePath, walkFunc)
2013-09-04 05:27:46 +04:00
if err != nil {
return nil, err
}
return f, nil
}
2013-09-03 22:30:42 +04:00
// checkDir function will check whether the component is a directory under parent node.
// If it is a directory, this function will return the pointer to that node.
// If it does not exist, this function will create a new directory and return the pointer to that node.
// If it is a file, this function will return error.
2013-09-29 03:26:19 +04:00
func (s *Store) checkDir(parent *Node, dirName string) (*Node, error) {
2013-09-03 22:30:42 +04:00
subDir, ok := parent.Children[dirName]
if ok {
return subDir, nil
}
2013-09-29 03:26:19 +04:00
n := newDir(path.Join(parent.Path, dirName), s.Index, s.Term, parent, parent.ACL, Permanent)
2013-09-03 22:30:42 +04:00
parent.Children[dirName] = n
return n, nil
}
2013-09-14 01:10:40 +04:00
// Save function saves the static state of the store system.
// Save function will not be able to save the state of watchers.
// Save function will not save the parent field of the node. Or there will
// be cyclic dependencies issue for the json package.
2013-09-29 03:26:19 +04:00
func (s *Store) Save() ([]byte, error) {
2013-09-29 03:58:57 +04:00
s.worldLock.Lock()
2013-09-29 03:26:19 +04:00
clonedStore := New()
clonedStore.Index = s.Index
clonedStore.Term = s.Term
2013-09-29 04:41:45 +04:00
clonedStore.Root = s.Root.Clone()
clonedStore.WatcherHub = s.WatcherHub.clone()
2013-09-29 03:58:57 +04:00
clonedStore.Stats = s.Stats.clone()
s.worldLock.Unlock()
2013-09-14 01:10:40 +04:00
2013-09-29 03:26:19 +04:00
b, err := json.Marshal(clonedStore)
2013-09-14 01:10:40 +04:00
if err != nil {
2013-09-16 06:28:42 +04:00
return nil, err
2013-09-14 01:10:40 +04:00
}
2013-09-16 06:28:42 +04:00
return b, nil
2013-09-14 01:10:40 +04:00
}
// recovery function recovery the store system from a static state.
// It needs to recovery the parent field of the nodes.
// It needs to delete the expired nodes since the saved time and also
// need to create monitor go routines.
2013-09-29 03:26:19 +04:00
func (s *Store) Recovery(state []byte) error {
2013-09-29 03:58:57 +04:00
s.worldLock.Lock()
defer s.worldLock.Unlock()
2013-09-29 03:26:19 +04:00
err := json.Unmarshal(state, s)
2013-09-14 01:10:40 +04:00
if err != nil {
2013-09-16 06:28:42 +04:00
return err
2013-09-14 01:10:40 +04:00
}
2013-09-30 10:39:40 +04:00
s.Root.recoverAndclean(s)
2013-09-16 06:28:42 +04:00
return nil
2013-09-14 01:10:40 +04:00
}
2013-09-29 03:26:19 +04:00
func (s *Store) JsonStats() []byte {
s.Stats.Watchers = uint64(s.WatcherHub.count)
return s.Stats.toJson()
}