-
Notifications
You must be signed in to change notification settings - Fork 46
/
store.go
158 lines (134 loc) · 3.9 KB
/
store.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
//
// Copyright 2019 Insolar Technologies GmbH
//
// 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 jet
import (
"context"
"sync"
"github.com/insolar/insolar/insolar"
)
var (
_ Accessor = &Store{}
_ Modifier = &Store{}
)
type lockedTree struct {
sync.RWMutex
t *Tree
}
func (lt *lockedTree) find(recordID insolar.ID) (insolar.JetID, bool) {
lt.RLock()
defer lt.RUnlock()
return lt.t.Find(recordID)
}
func (lt *lockedTree) update(id insolar.JetID, setActual bool) {
lt.Lock()
defer lt.Unlock()
lt.t.Update(id, setActual)
}
func (lt *lockedTree) leafIDs() []insolar.JetID {
lt.RLock()
defer lt.RUnlock()
return lt.t.LeafIDs()
}
func (lt *lockedTree) clone(keep bool) *Tree {
lt.RLock()
defer lt.RUnlock()
return lt.t.Clone(keep)
}
func (lt *lockedTree) split(id insolar.JetID) (insolar.JetID, insolar.JetID, error) {
lt.RLock()
defer lt.RUnlock()
return lt.t.Split(id)
}
// Store stores jet trees per pulse.
// It provides methods for querying and modification this trees.
type Store struct {
sync.RWMutex
trees map[insolar.PulseNumber]*lockedTree
}
// NewStore creates new Store instance.
func NewStore() *Store {
return &Store{
trees: map[insolar.PulseNumber]*lockedTree{},
}
}
// All returns all jet from jet tree for provided pulse.
func (s *Store) All(ctx context.Context, pulse insolar.PulseNumber) []insolar.JetID {
return s.ltreeForPulse(pulse).leafIDs()
}
// ForID finds jet in jet tree for provided pulse and object.
// Always returns jet id and activity flag for this jet.
func (s *Store) ForID(ctx context.Context, pulse insolar.PulseNumber, recordID insolar.ID) (insolar.JetID, bool) {
return s.ltreeForPulse(pulse).find(recordID)
}
// Update updates jet tree for specified pulse.
func (s *Store) Update(ctx context.Context, pulse insolar.PulseNumber, setActual bool, ids ...insolar.JetID) error {
s.Lock()
defer s.Unlock()
ltree := s.ltreeForPulseUnsafe(pulse)
for _, id := range ids {
ltree.update(id, setActual)
}
// required because TreeForPulse could return new tree.
s.trees[pulse] = ltree
return nil
}
func (s *Store) Split(
ctx context.Context, pulse insolar.PulseNumber, id insolar.JetID,
) (insolar.JetID, insolar.JetID, error) {
ltree := s.ltreeForPulse(pulse)
left, right, err := ltree.split(id)
if err != nil {
return insolar.ZeroJetID, insolar.ZeroJetID, err
}
return left, right, nil
}
// Clone copies tree from one pulse to another. Use it to copy the past tree into new pulse.
func (s *Store) Clone(
ctx context.Context, from, to insolar.PulseNumber, keepActual bool,
) error {
newTree := s.ltreeForPulse(from).clone(keepActual)
s.Lock()
defer s.Unlock()
s.trees[to] = &lockedTree{
t: newTree,
}
return nil
}
// Delete jets for pulse (concurrent safe).
func (s *Store) DeleteForPN(
ctx context.Context, pulse insolar.PulseNumber,
) {
s.Lock()
defer s.Unlock()
delete(s.trees, pulse)
}
// ltreeForPulse returns jet tree with lock for pulse, it's concurrent safe.
func (s *Store) ltreeForPulse(pulse insolar.PulseNumber) *lockedTree {
s.Lock()
defer s.Unlock()
return s.ltreeForPulseUnsafe(pulse)
}
// ltreeForPulseUnsafe returns jet tree with lock for pulse, it's concurrent unsafe and requires write lock.
func (s *Store) ltreeForPulseUnsafe(pulse insolar.PulseNumber) *lockedTree {
if ltree, ok := s.trees[pulse]; ok {
return ltree
}
ltree := &lockedTree{
t: NewTree(pulse == insolar.GenesisPulse.PulseNumber),
}
s.trees[pulse] = ltree
return ltree
}