blob: 0f14c7c8ff691f508aaad2991d561b2afaaa2dc8 [file] [log] [blame]
khenaidoobf6e7bb2018-08-14 22:27:29 -04001/*
2 * Copyright 2018-present Open Networking Foundation
3
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7
8 * http://www.apache.org/licenses/LICENSE-2.0
9
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
Stephane Barbariedc5022d2018-11-19 15:21:44 -050016
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040017package model
18
19import (
20 "encoding/hex"
21 "encoding/json"
Stephane Barbarie1ab43272018-12-08 21:42:13 -050022 "github.com/golang/protobuf/proto"
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040023 "github.com/google/uuid"
khenaidoob9203542018-09-17 22:56:37 -040024 "github.com/opencord/voltha-go/common/log"
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040025 "reflect"
Stephane Barbariedc5022d2018-11-19 15:21:44 -050026 "sync"
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040027)
28
Stephane Barbariedc5022d2018-11-19 15:21:44 -050029// Root is used to provide an abstraction to the base root structure
Stephane Barbarie06c4a742018-10-01 11:09:32 -040030type Root interface {
31 Node
Stephane Barbariedc5022d2018-11-19 15:21:44 -050032
33 ExecuteCallbacks()
34 AddCallback(callback CallbackFunction, args ...interface{})
35 AddNotificationCallback(callback CallbackFunction, args ...interface{})
Stephane Barbarie06c4a742018-10-01 11:09:32 -040036}
37
Stephane Barbariedc5022d2018-11-19 15:21:44 -050038// root points to the top of the data model tree or sub-tree identified by a proxy
Stephane Barbarie06c4a742018-10-01 11:09:32 -040039type root struct {
Stephane Barbarie126101e2018-10-11 16:18:48 -040040 *node
41
42 Callbacks []CallbackTuple
43 NotificationCallbacks []CallbackTuple
Stephane Barbarie06c4a742018-10-01 11:09:32 -040044
Stephane Barbariedc5022d2018-11-19 15:21:44 -050045 DirtyNodes map[string][]*node
46 KvStore *Backend
47 Loading bool
48 RevisionClass interface{}
49
khenaidoo43c82122018-11-22 18:38:28 -050050 mutex sync.RWMutex
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040051}
52
Stephane Barbariedc5022d2018-11-19 15:21:44 -050053// NewRoot creates an new instance of a root object
Stephane Barbarie06c4a742018-10-01 11:09:32 -040054func NewRoot(initialData interface{}, kvStore *Backend) *root {
55 root := &root{}
Stephane Barbarie126101e2018-10-11 16:18:48 -040056
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040057 root.KvStore = kvStore
Stephane Barbarie06c4a742018-10-01 11:09:32 -040058 root.DirtyNodes = make(map[string][]*node)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040059 root.Loading = false
Stephane Barbarie06c4a742018-10-01 11:09:32 -040060
Stephane Barbariedc5022d2018-11-19 15:21:44 -050061 // If there is no storage in place just revert to
62 // a non persistent mechanism
Stephane Barbarie88fbe7f2018-09-25 12:25:23 -040063 if kvStore != nil {
64 root.RevisionClass = reflect.TypeOf(PersistedRevision{})
65 } else {
66 root.RevisionClass = reflect.TypeOf(NonPersistedRevision{})
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040067 }
Stephane Barbariedc5022d2018-11-19 15:21:44 -050068
Stephane Barbarie694e2b92018-09-07 12:17:36 -040069 root.Callbacks = []CallbackTuple{}
70 root.NotificationCallbacks = []CallbackTuple{}
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040071
Stephane Barbariedc5022d2018-11-19 15:21:44 -050072 root.node = NewNode(root, initialData, false, "")
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040073
74 return root
75}
76
Stephane Barbariedc5022d2018-11-19 15:21:44 -050077// MakeTxBranch creates a new transaction branch
Stephane Barbarie06c4a742018-10-01 11:09:32 -040078func (r *root) MakeTxBranch() string {
Stephane Barbariedc5022d2018-11-19 15:21:44 -050079 txidBin, _ := uuid.New().MarshalBinary()
80 txid := hex.EncodeToString(txidBin)[:12]
81
Stephane Barbarie126101e2018-10-11 16:18:48 -040082 r.DirtyNodes[txid] = []*node{r.node}
Stephane Barbarie06c4a742018-10-01 11:09:32 -040083 r.node.MakeBranch(txid)
Stephane Barbariedc5022d2018-11-19 15:21:44 -050084
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040085 return txid
86}
87
Stephane Barbariedc5022d2018-11-19 15:21:44 -050088// DeleteTxBranch removes a transaction branch
Stephane Barbarie06c4a742018-10-01 11:09:32 -040089func (r *root) DeleteTxBranch(txid string) {
Stephane Barbariee16186c2018-09-11 10:46:34 -040090 for _, dirtyNode := range r.DirtyNodes[txid] {
Stephane Barbarie06c4a742018-10-01 11:09:32 -040091 dirtyNode.DeleteBranch(txid)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040092 }
93 delete(r.DirtyNodes, txid)
Stephane Barbarie1039ec42019-02-04 10:43:16 -050094 delete(r.node.Branches, txid)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -040095}
96
Stephane Barbariedc5022d2018-11-19 15:21:44 -050097// FoldTxBranch will merge the contents of a transaction branch with the root object
Stephane Barbarie06c4a742018-10-01 11:09:32 -040098func (r *root) FoldTxBranch(txid string) {
Stephane Barbariedc5022d2018-11-19 15:21:44 -050099 // Start by doing a dry run of the merge
100 // If that fails, it bails out and the branch is deleted
101 if _, err := r.node.MergeBranch(txid, true); err != nil {
102 // Merge operation fails
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400103 r.DeleteTxBranch(txid)
104 } else {
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500105 r.node.MergeBranch(txid, false)
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400106 r.ExecuteCallbacks()
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400107 }
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400108}
109
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500110// ExecuteCallbacks will invoke all the callbacks linked to root object
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400111func (r *root) ExecuteCallbacks() {
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500112 r.mutex.Lock()
113 log.Debugf("ExecuteCallbacks has the ROOT lock : %+v", r)
114 defer r.mutex.Unlock()
115 defer log.Debugf("ExecuteCallbacks released the ROOT lock : %+v", r)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400116 for len(r.Callbacks) > 0 {
117 callback := r.Callbacks[0]
118 r.Callbacks = r.Callbacks[1:]
khenaidoo43c82122018-11-22 18:38:28 -0500119 go callback.Execute(nil)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400120 }
121 for len(r.NotificationCallbacks) > 0 {
122 callback := r.NotificationCallbacks[0]
123 r.NotificationCallbacks = r.NotificationCallbacks[1:]
khenaidoo43c82122018-11-22 18:38:28 -0500124 go callback.Execute(nil)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400125 }
126}
127
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500128func (r *root) hasCallbacks() bool {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400129 return len(r.Callbacks) == 0
130}
131
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500132// getCallbacks returns the available callbacks
133func (r *root) GetCallbacks() []CallbackTuple {
134 r.mutex.Lock()
135 log.Debugf("getCallbacks has the ROOT lock : %+v", r)
136 defer r.mutex.Unlock()
137 defer log.Debugf("getCallbacks released the ROOT lock : %+v", r)
138 return r.Callbacks
139}
140
141// getCallbacks returns the available notification callbacks
142func (r *root) GetNotificationCallbacks() []CallbackTuple {
143 r.mutex.Lock()
144 log.Debugf("GetNotificationCallbacks has the ROOT lock : %+v", r)
145 defer r.mutex.Unlock()
146 defer log.Debugf("GetNotificationCallbacks released the ROOT lock : %+v", r)
147 return r.NotificationCallbacks
148}
149
150// AddCallback inserts a new callback with its arguments
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400151func (r *root) AddCallback(callback CallbackFunction, args ...interface{}) {
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500152 r.mutex.Lock()
153 log.Debugf("AddCallback has the ROOT lock : %+v", r)
154 defer r.mutex.Unlock()
155 defer log.Debugf("AddCallback released the ROOT lock : %+v", r)
Stephane Barbarie694e2b92018-09-07 12:17:36 -0400156 r.Callbacks = append(r.Callbacks, CallbackTuple{callback, args})
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400157}
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500158
159// AddNotificationCallback inserts a new notification callback with its arguments
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400160func (r *root) AddNotificationCallback(callback CallbackFunction, args ...interface{}) {
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500161 r.mutex.Lock()
162 log.Debugf("AddNotificationCallback has the ROOT lock : %+v", r)
163 defer r.mutex.Unlock()
164 defer log.Debugf("AddNotificationCallback released the ROOT lock : %+v", r)
Stephane Barbarie694e2b92018-09-07 12:17:36 -0400165 r.NotificationCallbacks = append(r.NotificationCallbacks, CallbackTuple{callback, args})
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400166}
167
Stephane Barbarie1ab43272018-12-08 21:42:13 -0500168func (r *root) syncParent(childRev Revision, txid string) {
169 data := proto.Clone(r.Proxy.ParentNode.Latest().GetData().(proto.Message))
170
171 for fieldName, _ := range ChildrenFields(data) {
172 childDataName, childDataHolder := GetAttributeValue(data, fieldName, 0)
173 if reflect.TypeOf(childRev.GetData()) == reflect.TypeOf(childDataHolder.Interface()) {
174 childDataHolder = reflect.ValueOf(childRev.GetData())
175 reflect.ValueOf(data).Elem().FieldByName(childDataName).Set(childDataHolder)
176 }
177 }
178
179 r.Proxy.ParentNode.Latest().SetConfig(NewDataRevision(r.Proxy.ParentNode.Root, data))
180 r.Proxy.ParentNode.Latest(txid).Finalize(false)
181}
182
183
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500184// Update modifies the content of an object at a given path with the provided data
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400185func (r *root) Update(path string, data interface{}, strict bool, txid string, makeBranch MakeBranchFunction) Revision {
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400186 var result Revision
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400187
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500188 if makeBranch != nil {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400189 // TODO: raise error
190 }
191
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500192 if r.hasCallbacks() {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400193 // TODO: raise error
194 }
195
196 if txid != "" {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400197 trackDirty := func(node *node) *Branch {
Stephane Barbariee16186c2018-09-11 10:46:34 -0400198 r.DirtyNodes[txid] = append(r.DirtyNodes[txid], node)
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400199 return node.MakeBranch(txid)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400200 }
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400201 result = r.node.Update(path, data, strict, txid, trackDirty)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400202 } else {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400203 result = r.node.Update(path, data, strict, "", nil)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400204 }
205
Stephane Barbariee0a4c792019-01-16 11:26:29 -0500206 if result != nil {
207 if r.Proxy.FullPath != r.Proxy.Path {
208 r.syncParent(result, txid)
209 } else {
210 result.Finalize(false)
211 }
Stephane Barbarie1ab43272018-12-08 21:42:13 -0500212 }
213
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500214 r.node.GetRoot().ExecuteCallbacks()
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400215
216 return result
217}
218
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500219// Add creates a new object at the given path with the provided data
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400220func (r *root) Add(path string, data interface{}, txid string, makeBranch MakeBranchFunction) Revision {
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400221 var result Revision
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400222
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500223 if makeBranch != nil {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400224 // TODO: raise error
225 }
226
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500227 if r.hasCallbacks() {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400228 // TODO: raise error
229 }
230
231 if txid != "" {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400232 trackDirty := func(node *node) *Branch {
Stephane Barbariee16186c2018-09-11 10:46:34 -0400233 r.DirtyNodes[txid] = append(r.DirtyNodes[txid], node)
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400234 return node.MakeBranch(txid)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400235 }
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400236 result = r.node.Add(path, data, txid, trackDirty)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400237 } else {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400238 result = r.node.Add(path, data, "", nil)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400239 }
240
Stephane Barbarie1ab43272018-12-08 21:42:13 -0500241 if result != nil {
242 result.Finalize(true)
243 r.node.GetRoot().ExecuteCallbacks()
244 }
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400245 return result
246}
247
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500248// Remove discards an object at a given path
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400249func (r *root) Remove(path string, txid string, makeBranch MakeBranchFunction) Revision {
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400250 var result Revision
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400251
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500252 if makeBranch != nil {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400253 // TODO: raise error
254 }
255
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500256 if r.hasCallbacks() {
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400257 // TODO: raise error
258 }
259
260 if txid != "" {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400261 trackDirty := func(node *node) *Branch {
Stephane Barbariee16186c2018-09-11 10:46:34 -0400262 r.DirtyNodes[txid] = append(r.DirtyNodes[txid], node)
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400263 return node.MakeBranch(txid)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400264 }
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400265 result = r.node.Remove(path, txid, trackDirty)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400266 } else {
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400267 result = r.node.Remove(path, "", nil)
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400268 }
269
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500270 r.node.GetRoot().ExecuteCallbacks()
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400271
272 return result
273}
274
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500275// MakeLatest updates a branch with the latest node revision
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400276func (r *root) MakeLatest(branch *Branch, revision Revision, changeAnnouncement []ChangeTuple) {
277 r.makeLatest(branch, revision, changeAnnouncement)
278}
279
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500280func (r *root) MakeRevision(branch *Branch, data interface{}, children map[string][]Revision) Revision {
281 if r.RevisionClass.(reflect.Type) == reflect.TypeOf(PersistedRevision{}) {
282 return NewPersistedRevision(branch, data, children)
283 }
284
285 return NewNonPersistedRevision(r, branch, data, children)
286}
287
Stephane Barbarie06c4a742018-10-01 11:09:32 -0400288func (r *root) makeLatest(branch *Branch, revision Revision, changeAnnouncement []ChangeTuple) {
289 r.node.makeLatest(branch, revision, changeAnnouncement)
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400290
291 if r.KvStore != nil && branch.Txid == "" {
292 tags := make(map[string]string)
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500293 for k, v := range r.node.Tags {
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400294 tags[k] = v.GetHash()
295 }
296 data := &rootData{
Stephane Barbariedc5022d2018-11-19 15:21:44 -0500297 Latest: branch.GetLatest().GetHash(),
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400298 Tags: tags,
299 }
300 if blob, err := json.Marshal(data); err != nil {
301 // TODO report error
302 } else {
303 log.Debugf("Changing root to : %s", string(blob))
304 if err := r.KvStore.Put("root", blob); err != nil {
305 log.Errorf("failed to properly put value in kvstore - err: %s", err.Error())
306 }
307 }
308 }
309}
310
Stephane Barbarie4a2564d2018-07-26 11:02:58 -0400311type rootData struct {
khenaidoob9203542018-09-17 22:56:37 -0400312 Latest string `json:latest`
Stephane Barbarieec0919b2018-09-05 14:14:29 -0400313 Tags map[string]string `json:tags`
Stephane Barbarie1ab43272018-12-08 21:42:13 -0500314}