blob: bcda91e4b013de1dcaae57e79890d50664df4f7b [file] [log] [blame]
/*
* Copyright 2018-present Open Networking Foundation
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package model
// TODO: proper error handling
// TODO: proper logging
import (
"fmt"
"github.com/golang/protobuf/proto"
"github.com/opencord/voltha-go/common/log"
"reflect"
"runtime/debug"
"strings"
"sync"
)
// When a branch has no transaction id, everything gets stored in NONE
const (
NONE string = "none"
)
// Node interface is an abstraction of the node data structure
type Node interface {
MakeLatest(branch *Branch, revision Revision, changeAnnouncement []ChangeTuple)
// CRUD functions
Add(path string, data interface{}, txid string, makeBranch MakeBranchFunction) Revision
Get(path string, hash string, depth int, deep bool, txid string) interface{}
Update(path string, data interface{}, strict bool, txid string, makeBranch MakeBranchFunction) Revision
Remove(path string, txid string, makeBranch MakeBranchFunction) Revision
MakeBranch(txid string) *Branch
DeleteBranch(txid string)
MergeBranch(txid string, dryRun bool) (Revision, error)
MakeTxBranch() string
DeleteTxBranch(txid string)
FoldTxBranch(txid string)
CreateProxy(path string, exclusive bool) *Proxy
GetProxy() *Proxy
}
type node struct {
sync.RWMutex
Root *root
Type interface{}
Branches map[string]*Branch
Tags map[string]Revision
Proxy *Proxy
EventBus *EventBus
AutoPrune bool
}
// ChangeTuple holds details of modifications made to a revision
type ChangeTuple struct {
Type CallbackType
PreviousData interface{}
LatestData interface{}
}
// NewNode creates a new instance of the node data structure
func NewNode(root *root, initialData interface{}, autoPrune bool, txid string) *node {
n := &node{}
n.Root = root
n.Branches = make(map[string]*Branch)
n.Tags = make(map[string]Revision)
n.Proxy = nil
n.EventBus = nil
n.AutoPrune = autoPrune
if IsProtoMessage(initialData) {
n.Type = reflect.ValueOf(initialData).Interface()
dataCopy := proto.Clone(initialData.(proto.Message))
n.initialize(dataCopy, txid)
} else if reflect.ValueOf(initialData).IsValid() {
// FIXME: this block does not reflect the original implementation
// it should be checking if the provided initial_data is already a type!??!
// it should be checked before IsProtoMessage
n.Type = reflect.ValueOf(initialData).Interface()
} else {
// not implemented error
log.Errorf("cannot process initial data - %+v", initialData)
}
return n
}
// MakeNode creates a new node in the tree
func (n *node) MakeNode(data interface{}, txid string) *node {
return NewNode(n.Root, data, true, txid)
}
// MakeRevision create a new revision of the node in the tree
func (n *node) MakeRevision(branch *Branch, data interface{}, children map[string][]Revision) Revision {
return n.GetRoot().MakeRevision(branch, data, children)
}
// makeLatest will mark the revision of a node as being the latest
func (n *node) makeLatest(branch *Branch, revision Revision, changeAnnouncement []ChangeTuple) {
branch.AddRevision(revision)
if branch.GetLatest() == nil || revision.GetHash() != branch.GetLatest().GetHash() {
branch.SetLatest(revision)
}
if changeAnnouncement != nil && branch.Txid == "" {
if n.GetProxy() != nil {
for _, change := range changeAnnouncement {
log.Debugf("invoking callback - changeType: %+v, previous:%+v, latest: %+v",
change.Type,
change.PreviousData,
change.LatestData)
n.GetRoot().AddCallback(
n.GetProxy().InvokeCallbacks,
change.Type,
true,
change.PreviousData,
change.LatestData)
}
}
for _, change := range changeAnnouncement {
log.Debugf("sending notification - changeType: %+v, previous:%+v, latest: %+v",
change.Type,
change.PreviousData,
change.LatestData)
n.GetRoot().AddNotificationCallback(
n.makeEventBus().Advertise,
change.Type,
revision.GetHash(),
change.PreviousData,
change.LatestData)
}
}
}
// Latest returns the latest revision of node with or without the transaction id
func (n *node) Latest(txid ...string) Revision {
var branch *Branch
if len(txid) > 0 && txid[0] != "" {
if branch = n.GetBranch(txid[0]); branch != nil {
return branch.GetLatest()
}
} else if branch = n.GetBranch(NONE); branch != nil {
return branch.GetLatest()
}
return nil
}
// initialize prepares the content of a node along with its possible ramifications
func (n *node) initialize(data interface{}, txid string) {
n.Lock()
children := make(map[string][]Revision)
for fieldName, field := range ChildrenFields(n.Type) {
_, fieldValue := GetAttributeValue(data, fieldName, 0)
if fieldValue.IsValid() {
if field.IsContainer {
if field.Key != "" {
var keysSeen []string
for i := 0; i < fieldValue.Len(); i++ {
v := fieldValue.Index(i)
if rev := n.MakeNode(v.Interface(), txid).Latest(txid); rev != nil {
children[fieldName] = append(children[fieldName], rev)
}
_, key := GetAttributeValue(v.Interface(), field.Key, 0)
for _, k := range keysSeen {
if k == key.String() {
log.Errorf("duplicate key - %s", k)
}
}
keysSeen = append(keysSeen, key.String())
}
} else {
for i := 0; i < fieldValue.Len(); i++ {
v := fieldValue.Index(i)
if newNodeRev := n.MakeNode(v.Interface(), txid).Latest(); newNodeRev != nil {
children[fieldName] = append(children[fieldName], newNodeRev)
}
}
}
} else {
if newNodeRev := n.MakeNode(fieldValue.Interface(), txid).Latest(); newNodeRev != nil {
children[fieldName] = append(children[fieldName], newNodeRev)
}
}
} else {
log.Errorf("field is invalid - %+v", fieldValue)
}
}
n.Unlock()
branch := NewBranch(n, "", nil, n.AutoPrune)
rev := n.MakeRevision(branch, data, children)
n.makeLatest(branch, rev, nil)
if txid == "" {
n.SetBranch(NONE, branch)
} else {
n.SetBranch(txid, branch)
}
}
// findRevByKey retrieves a specific revision from a node tree
func (n *node) findRevByKey(revs []Revision, keyName string, value interface{}) (int, Revision) {
n.Lock()
defer n.Unlock()
for i, rev := range revs {
dataValue := reflect.ValueOf(rev.GetData())
dataStruct := GetAttributeStructure(rev.GetData(), keyName, 0)
fieldValue := dataValue.Elem().FieldByName(dataStruct.Name)
a := fmt.Sprintf("%s", fieldValue.Interface())
b := fmt.Sprintf("%s", value)
if a == b {
return i, revs[i]
}
}
return -1, nil
}
// Get retrieves the data from a node tree that resides at the specified path
func (n *node) Get(path string, hash string, depth int, deep bool, txid string) interface{} {
if deep {
depth = -1
}
for strings.HasPrefix(path, "/") {
path = path[1:]
}
var branch *Branch
var rev Revision
if branch = n.GetBranch(txid); txid == "" || branch == nil {
branch = n.GetBranch(NONE)
}
if hash != "" {
rev = branch.GetRevision(hash)
} else {
rev = branch.GetLatest()
}
var result interface{}
if result = n.getPath(rev.GetBranch().GetLatest(), path, depth);
reflect.ValueOf(result).IsValid() && reflect.ValueOf(result).IsNil() && n.Root.KvStore != nil {
// We got nothing from memory, try to pull it from persistence
var prList []interface{}
if pr := rev.LoadFromPersistence(path, txid); pr != nil {
for _, revEntry := range pr {
prList = append(prList, revEntry.GetData())
}
result = prList
}
}
return result
}
// getPath traverses the specified path and retrieves the data associated to it
func (n *node) getPath(rev Revision, path string, depth int) interface{} {
if path == "" {
return n.getData(rev, depth)
}
partition := strings.SplitN(path, "/", 2)
name := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
names := ChildrenFields(n.Type)
field := names[name]
if field.IsContainer {
children := make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
if field.Key != "" {
if path != "" {
partition = strings.SplitN(path, "/", 2)
key := partition[0]
path = ""
keyValue := field.KeyFromStr(key)
if _, childRev := n.findRevByKey(children, field.Key, keyValue); childRev == nil {
return nil
} else {
childNode := childRev.GetNode()
return childNode.getPath(childRev, path, depth)
}
} else {
var response []interface{}
for _, childRev := range children {
childNode := childRev.GetNode()
value := childNode.getData(childRev, depth)
response = append(response, value)
}
return response
}
} else {
var response []interface{}
if path != "" {
// TODO: raise error
return response
}
for _, childRev := range children {
childNode := childRev.GetNode()
value := childNode.getData(childRev, depth)
response = append(response, value)
}
return response
}
}
childRev := rev.GetChildren()[name][0]
childNode := childRev.GetNode()
return childNode.getPath(childRev, path, depth)
}
// getData retrieves the data from a node revision
func (n *node) getData(rev Revision, depth int) interface{} {
msg := rev.GetBranch().GetLatest().Get(depth)
var modifiedMsg interface{}
if n.GetProxy() != nil {
log.Debug("invoking proxy GET Callbacks : %+v", msg)
if modifiedMsg = n.GetProxy().InvokeCallbacks(GET, false, msg); modifiedMsg != nil {
msg = modifiedMsg
}
}
return msg
}
// Update changes the content of a node at the specified path with the provided data
func (n *node) Update(path string, data interface{}, strict bool, txid string, makeBranch MakeBranchFunction) Revision {
for strings.HasPrefix(path, "/") {
path = path[1:]
}
var branch *Branch
if txid == "" {
branch = n.GetBranch(NONE)
} else if branch = n.GetBranch(txid); branch == nil {
branch = makeBranch(n)
}
if branch.GetLatest() != nil {
log.Debugf("Branch data : %+v, Passed data: %+v", branch.GetLatest().GetData(), data)
}
if path == "" {
return n.doUpdate(branch, data, strict)
}
rev := branch.GetLatest()
partition := strings.SplitN(path, "/", 2)
name := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
field := ChildrenFields(n.Type)[name]
var children []Revision
if field.IsContainer {
if path == "" {
log.Errorf("cannot update a list")
} else if field.Key != "" {
partition := strings.SplitN(path, "/", 2)
key := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
keyValue := field.KeyFromStr(key)
children = make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
idx, childRev := n.findRevByKey(children, field.Key, keyValue)
childNode := childRev.GetNode()
newChildRev := childNode.Update(path, data, strict, txid, makeBranch)
if newChildRev.GetHash() == childRev.GetHash() {
if newChildRev != childRev {
log.Debug("clear-hash - %s %+v", newChildRev.GetHash(), newChildRev)
newChildRev.ClearHash()
}
return branch.GetLatest()
}
_, newKey := GetAttributeValue(newChildRev.GetData(), field.Key, 0)
_newKeyType := fmt.Sprintf("%s", newKey)
_keyValueType := fmt.Sprintf("%s", keyValue)
if _newKeyType != _keyValueType {
log.Errorf("cannot change key field")
}
// Prefix the hash value with the data type (e.g. devices, logical_devices, adapters)
newChildRev.SetHash(name + "/" + _keyValueType)
children[idx] = newChildRev
updatedRev := rev.UpdateChildren(name, children, branch)
branch.GetLatest().Drop(txid, false)
n.makeLatest(branch, updatedRev, nil)
return newChildRev
} else {
log.Errorf("cannot index into container with no keys")
}
} else {
childRev := rev.GetChildren()[name][0]
childNode := childRev.GetNode()
newChildRev := childNode.Update(path, data, strict, txid, makeBranch)
updatedRev := rev.UpdateChildren(name, []Revision{newChildRev}, branch)
rev.Drop(txid, false)
n.makeLatest(branch, updatedRev, nil)
return newChildRev
}
return nil
}
func (n *node) doUpdate(branch *Branch, data interface{}, strict bool) Revision {
log.Debugf("Comparing types - expected: %+v, actual: %+v &&&&&& %s", reflect.ValueOf(n.Type).Type(),
reflect.TypeOf(data),
string(debug.Stack()))
if reflect.TypeOf(data) != reflect.ValueOf(n.Type).Type() {
// TODO raise error
log.Errorf("data does not match type: %+v", n.Type)
return nil
}
// TODO: validate that this actually works
//if n.hasChildren(data) {
// return nil
//}
if n.GetProxy() != nil {
log.Debug("invoking proxy PRE_UPDATE Callbacks")
n.GetProxy().InvokeCallbacks(PRE_UPDATE, false, branch.GetLatest(), data)
}
if branch.GetLatest().GetData().(proto.Message).String() != data.(proto.Message).String() {
if strict {
// TODO: checkAccessViolations(data, Branch.GetLatest.data)
log.Debugf("checking access violations")
}
rev := branch.GetLatest().UpdateData(data, branch)
changes := []ChangeTuple{{POST_UPDATE, branch.GetLatest().GetData(), rev.GetData()}}
// FIXME VOL-1293: the following statement corrupts the kv when using a subproxy (commenting for now)
// FIXME VOL-1293 cont'd: need to figure out the required conditions otherwise we are not cleaning up entries
//branch.GetLatest().Drop(branch.Txid, true)
n.makeLatest(branch, rev, changes)
return rev
}
return branch.GetLatest()
}
// Add inserts a new node at the specified path with the provided data
func (n *node) Add(path string, data interface{}, txid string, makeBranch MakeBranchFunction) Revision {
for strings.HasPrefix(path, "/") {
path = path[1:]
}
if path == "" {
// TODO raise error
log.Errorf("cannot add for non-container mode")
}
var branch *Branch
if txid == "" {
branch = n.GetBranch(NONE)
} else if branch = n.GetBranch(txid); branch == nil {
branch = makeBranch(n)
}
rev := branch.GetLatest()
partition := strings.SplitN(path, "/", 2)
name := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
field := ChildrenFields(n.Type)[name]
var children []Revision
if field.IsContainer {
if path == "" {
if field.Key != "" {
if n.GetProxy() != nil {
log.Debug("invoking proxy PRE_ADD Callbacks")
n.GetProxy().InvokeCallbacks(PRE_ADD, false, data)
}
children = make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
_, key := GetAttributeValue(data, field.Key, 0)
if _, exists := n.findRevByKey(children, field.Key, key.String()); exists != nil {
// TODO raise error
log.Errorf("duplicate key found: %s", key.String())
return exists
}
childRev := n.MakeNode(data, txid).Latest(txid)
// Prefix the hash with the data type (e.g. devices, logical_devices, adapters)
childRev.SetHash(name + "/" + key.String())
children = append(children, childRev)
rev = rev.UpdateChildren(name, children, branch)
changes := []ChangeTuple{{POST_ADD, nil, childRev.GetData()}}
rev.Drop(txid, false)
n.makeLatest(branch, rev, changes)
return childRev
}
log.Errorf("cannot add to non-keyed container")
} else if field.Key != "" {
partition := strings.SplitN(path, "/", 2)
key := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
keyValue := field.KeyFromStr(key)
children = make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
idx, childRev := n.findRevByKey(children, field.Key, keyValue)
childNode := childRev.GetNode()
newChildRev := childNode.Add(path, data, txid, makeBranch)
children[idx] = newChildRev
rev = rev.UpdateChildren(name, branch.GetLatest().GetChildren()[name], branch)
rev.Drop(txid, false)
n.makeLatest(branch, rev.GetBranch().GetLatest(), nil)
return newChildRev
} else {
log.Errorf("cannot add to non-keyed container")
}
} else {
log.Errorf("cannot add to non-container field")
}
return nil
}
// Remove eliminates a node at the specified path
func (n *node) Remove(path string, txid string, makeBranch MakeBranchFunction) Revision {
for strings.HasPrefix(path, "/") {
path = path[1:]
}
if path == "" {
// TODO raise error
log.Errorf("cannot remove for non-container mode")
}
var branch *Branch
if txid == "" {
branch = n.GetBranch(NONE)
} else if branch = n.GetBranch(txid); branch == nil {
branch = makeBranch(n)
}
rev := branch.GetLatest()
partition := strings.SplitN(path, "/", 2)
name := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
field := ChildrenFields(n.Type)[name]
var children []Revision
postAnnouncement := []ChangeTuple{}
if field.IsContainer {
if path == "" {
log.Errorf("cannot remove without a key")
} else if field.Key != "" {
partition := strings.SplitN(path, "/", 2)
key := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
keyValue := field.KeyFromStr(key)
children = make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
if path != "" {
idx, childRev := n.findRevByKey(children, field.Key, keyValue)
childNode := childRev.GetNode()
newChildRev := childNode.Remove(path, txid, makeBranch)
children[idx] = newChildRev
rev := rev.UpdateChildren(name, children, branch)
branch.GetLatest().Drop(txid, false)
n.makeLatest(branch, rev, nil)
return rev
}
idx, childRev := n.findRevByKey(children, field.Key, keyValue)
if n.GetProxy() != nil {
data := childRev.GetData()
n.GetProxy().InvokeCallbacks(PRE_REMOVE, false, data)
postAnnouncement = append(postAnnouncement, ChangeTuple{POST_REMOVE, data, nil})
} else {
postAnnouncement = append(postAnnouncement, ChangeTuple{POST_REMOVE, childRev.GetData(), nil})
}
childRev.Drop(txid, true)
children = append(children[:idx], children[idx+1:]...)
rev := rev.UpdateChildren(name, children, branch)
branch.GetLatest().Drop(txid, false)
n.makeLatest(branch, rev, postAnnouncement)
return rev
}
log.Errorf("cannot add to non-keyed container")
} else {
log.Errorf("cannot add to non-container field")
}
return nil
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Branching ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// MakeBranchFunction is a type for function references intented to create a branch
type MakeBranchFunction func(*node) *Branch
// MakeBranch creates a new branch for the provided transaction id
func (n *node) MakeBranch(txid string) *Branch {
branchPoint := n.GetBranch(NONE).GetLatest()
branch := NewBranch(n, txid, branchPoint, true)
n.SetBranch(txid, branch)
return branch
}
// DeleteBranch removes a branch with the specified id
func (n *node) DeleteBranch(txid string) {
n.Lock()
defer n.Unlock()
delete(n.Branches, txid)
}
func (n *node) mergeChild(txid string, dryRun bool) func(Revision) Revision {
f := func(rev Revision) Revision {
childBranch := rev.GetBranch()
if childBranch.Txid == txid {
rev, _ = childBranch.Node.MergeBranch(txid, dryRun)
}
return rev
}
return f
}
// MergeBranch will integrate the contents of a transaction branch within the latest branch of a given node
func (n *node) MergeBranch(txid string, dryRun bool) (Revision, error) {
srcBranch := n.GetBranch(txid)
dstBranch := n.GetBranch(NONE)
forkRev := srcBranch.Origin
srcRev := srcBranch.GetLatest()
dstRev := dstBranch.GetLatest()
rev, changes := Merge3Way(forkRev, srcRev, dstRev, n.mergeChild(txid, dryRun), dryRun)
if !dryRun {
n.makeLatest(dstBranch, rev, changes)
n.DeleteBranch(txid)
}
// TODO: return proper error when one occurs
return rev, nil
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Diff utility ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//func (n *node) diff(hash1, hash2, txid string) {
// branch := n.Branches[txid]
// rev1 := branch.GetHash(hash1)
// rev2 := branch.GetHash(hash2)
//
// if rev1.GetHash() == rev2.GetHash() {
// // empty patch
// } else {
// // translate data to json and generate patch
// patch, err := jsonpatch.MakePatch(rev1.GetData(), rev2.GetData())
// patch.
// }
//}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Tag utility ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// TODO: is tag mgmt used in the python implementation? Need to validate
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Internals ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
func (n *node) hasChildren(data interface{}) bool {
for fieldName, field := range ChildrenFields(n.Type) {
_, fieldValue := GetAttributeValue(data, fieldName, 0)
if (field.IsContainer && fieldValue.Len() > 0) || !fieldValue.IsNil() {
log.Error("cannot update external children")
return true
}
}
return false
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ node Proxy ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// CreateProxy returns a reference to a sub-tree of the data model
func (n *node) CreateProxy(path string, exclusive bool) *Proxy {
return n.createProxy(path, path, n, exclusive)
}
func (n *node) createProxy(path string, fullPath string, parentNode *node, exclusive bool) *Proxy {
for strings.HasPrefix(path, "/") {
path = path[1:]
}
if path == "" {
return n.makeProxy(path, fullPath, parentNode, exclusive)
}
rev := n.GetBranch(NONE).GetLatest()
partition := strings.SplitN(path, "/", 2)
name := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
field := ChildrenFields(n.Type)[name]
if field.IsContainer {
if path == "" {
log.Error("cannot proxy a container field")
} else if field.Key != "" {
partition := strings.SplitN(path, "/", 2)
key := partition[0]
if len(partition) < 2 {
path = ""
} else {
path = partition[1]
}
keyValue := field.KeyFromStr(key)
var children []Revision
children = make([]Revision, len(rev.GetChildren()[name]))
copy(children, rev.GetChildren()[name])
_, childRev := n.findRevByKey(children, field.Key, keyValue)
childNode := childRev.GetNode()
return childNode.createProxy(path, fullPath, n, exclusive)
} else {
log.Error("cannot index into container with no keys")
}
} else {
childRev := rev.GetChildren()[name][0]
childNode := childRev.GetNode()
return childNode.createProxy(path, fullPath, n, exclusive)
}
return nil
}
func (n *node) makeProxy(path string, fullPath string, parentNode *node, exclusive bool) *Proxy {
n.Lock()
defer n.Unlock()
r := &root{
node: n,
Callbacks: n.Root.GetCallbacks(),
NotificationCallbacks: n.Root.GetNotificationCallbacks(),
DirtyNodes: n.Root.DirtyNodes,
KvStore: n.Root.KvStore,
Loading: n.Root.Loading,
RevisionClass: n.Root.RevisionClass,
}
if n.Proxy == nil {
n.Proxy = NewProxy(r, n, parentNode, path, fullPath, exclusive)
} else {
if n.Proxy.Exclusive {
log.Error("node is already owned exclusively")
}
}
return n.Proxy
}
func (n *node) makeEventBus() *EventBus {
n.Lock()
defer n.Unlock()
if n.EventBus == nil {
n.EventBus = NewEventBus()
}
return n.EventBus
}
func (n *node) SetProxy(proxy *Proxy) {
n.Lock()
defer n.Unlock()
n.Proxy = proxy
}
func (n *node) GetProxy() *Proxy {
n.Lock()
defer n.Unlock()
return n.Proxy
}
func (n *node) GetBranch(key string) *Branch {
n.Lock()
defer n.Unlock()
if n.Branches != nil {
if branch, exists := n.Branches[key]; exists {
return branch
}
}
return nil
}
func (n *node) SetBranch(key string, branch *Branch) {
n.Lock()
defer n.Unlock()
n.Branches[key] = branch
}
func (n *node) GetRoot() *root {
n.Lock()
defer n.Unlock()
return n.Root
}