/usr/share/gocode/src/github.com/couchbase/moss/segment_stack.go is in golang-github-couchbase-moss-dev 0.0~git20170914.0.07c86e8-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 | // Copyright (c) 2016 Couchbase, Inc.
// 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 moss
import "sync"
// A segmentStack is a stack of segments, where higher (later) entries
// in the stack have higher precedence, and should "shadow" any
// entries of the same key from lower in the stack. A segmentStack
// implements the Snapshot interface.
type segmentStack struct {
options *CollectionOptions
a []Segment
m sync.Mutex // Protects the fields the follow.
refs int
lowerLevelSnapshot *SnapshotWrapper
// incarNum represents this segmentStack's unique incarnation number assigned
// when the child collection was created. 0 for top-level collection.
incarNum uint64
// childSegStacks recursively store child collection segmentStacks.
childSegStacks map[string]*segmentStack
}
func (ss *segmentStack) addRef() {
ss.m.Lock()
ss.refs++
ss.m.Unlock()
}
func (ss *segmentStack) decRef() {
ss.m.Lock()
ss.refs--
if ss.refs <= 0 {
if ss.lowerLevelSnapshot != nil {
ss.lowerLevelSnapshot.Close()
ss.lowerLevelSnapshot = nil
}
}
ss.m.Unlock()
}
// ------------------------------------------------------
// Close releases associated resources.
func (ss *segmentStack) Close() error {
if ss != nil {
ss.decRef()
}
return nil
}
// ------------------------------------------------------
// Get retrieves a val from a segmentStack.
func (ss *segmentStack) Get(key []byte, readOptions ReadOptions) ([]byte, error) {
return ss.get(key, len(ss.a)-1, nil, readOptions)
}
// get() retrieves a val from a segmentStack, but only considers
// segments at or below the segStart level. The optional base
// segmentStack, when non-nil, is used instead of the
// lowerLevelSnapshot, as a form of controllable chaining.
func (ss *segmentStack) get(key []byte, segStart int, base *segmentStack,
readOptions ReadOptions) ([]byte, error) {
if segStart >= 0 {
ss.ensureSorted(0, segStart)
for seg := segStart; seg >= 0; seg-- {
b := ss.a[seg]
op, val, err := b.Get(key)
if err != nil {
return nil, err
}
if val != nil {
if op == OperationDel {
return nil, nil
}
if op == OperationMerge {
return ss.getMerged(key, val, seg-1, base, readOptions)
}
return val, nil
}
}
}
if base != nil {
return base.Get(key, readOptions)
}
if !readOptions.SkipLowerLevel && ss.lowerLevelSnapshot != nil {
return ss.lowerLevelSnapshot.Get(key, readOptions)
} // TODO: else add a special return error indicating cache-miss!
return nil, nil
}
// ------------------------------------------------------
// getMerged() retrieves a lower level val for a given key and returns
// a merged val, based on the configured merge operator.
func (ss *segmentStack) getMerged(key, val []byte, segStart int,
base *segmentStack, readOptions ReadOptions) ([]byte, error) {
var mo MergeOperator
if ss.options != nil {
mo = ss.options.MergeOperator
}
if mo == nil {
return nil, ErrMergeOperatorNil
}
vLower, err := ss.get(key, segStart, base, readOptions)
if err != nil {
return nil, err
}
vMerged, ok := mo.FullMerge(key, vLower, [][]byte{val})
if !ok {
return nil, ErrMergeOperatorFullMergeFailed
}
return vMerged, nil
}
// ------------------------------------------------------
func (ss *segmentStack) ensureSorted(minSeg, maxSeg int) {
if ss.options == nil || !ss.options.DeferredSort {
return
}
sorted := true // Two phases allows for more concurrent sorting.
for seg := maxSeg; seg >= minSeg; seg-- {
sorted = sorted && ss.a[seg].RequestSort(false)
}
if !sorted {
for seg := maxSeg; seg >= minSeg; seg-- {
ss.a[seg].RequestSort(true)
}
}
}
// ------------------------------------------------------
// SegmentStackStats represents the stats for a segmentStack.
type SegmentStackStats struct {
CurOps uint64
CurBytes uint64 // Counts key-val bytes only, not metadata.
CurSegments uint64
}
// AddTo adds the values from this SegmentStackStats to the dest
// SegmentStackStats.
func (sss *SegmentStackStats) AddTo(dest *SegmentStackStats) {
if sss == nil {
return
}
dest.CurOps += sss.CurOps
dest.CurBytes += sss.CurBytes
dest.CurSegments += sss.CurSegments
}
// Stats returns the stats for this segment stack.
func (ss *segmentStack) Stats() *SegmentStackStats {
rv := &SegmentStackStats{CurSegments: uint64(len(ss.a))}
for _, seg := range ss.a {
rv.CurOps += uint64(seg.Len())
nk, nv := seg.NumKeyValBytes()
rv.CurBytes += nk + nv
}
return rv
}
// ChildCollectionNames returns an array of child collection name strings.
func (ss *segmentStack) ChildCollectionNames() ([]string, error) {
var childCollections = make([]string, len(ss.childSegStacks))
idx := 0
for name := range ss.childSegStacks {
childCollections[idx] = name
idx++
}
return childCollections, nil
}
// ChildCollectionSnapshot returns a Snapshot on a given child
// collection by its name.
func (ss *segmentStack) ChildCollectionSnapshot(childCollectionName string) (
Snapshot, error) {
if ss.childSegStacks == nil {
return nil, nil
}
childSegStack, exists := ss.childSegStacks[childCollectionName]
if !exists {
return nil, nil
}
childSegStack.addRef()
return childSegStack, nil
}
// ensureFullySorted recursively ensures that all child segmentStacks
// are sorted from 0 to end.
func (ss *segmentStack) ensureFullySorted() {
ss.ensureSorted(0, len(ss.a)-1)
for _, childSnapshot := range ss.childSegStacks {
childSnapshot.ensureFullySorted()
}
}
func (ss *segmentStack) isEmpty() bool {
if len(ss.a) > 0 {
return false
}
for _, childSegStack := range ss.childSegStacks {
if !childSegStack.isEmpty() {
return false
}
}
return true
}
|