/usr/share/gocode/src/github.com/couchbase/moss/dgm_test.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 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 | package moss
import (
"bytes"
"flag"
"fmt"
"io/ioutil"
"os"
"sync"
"testing"
"time"
)
// TODO: This is copied code from cbft. Need to make mossHerder reusable.
type mossHerder struct {
memQuota uint64
m sync.Mutex // Protects the fields that follow.
waitCond *sync.Cond
waiting int
// The map tracks moss collections currently being herded
collections map[Collection]struct{}
}
// newMossHerder returns a new moss herder instance.
func newMossHerder(memQuota uint64) *mossHerder {
mh := &mossHerder{
memQuota: memQuota,
collections: map[Collection]struct{}{},
}
mh.waitCond = sync.NewCond(&mh.m)
return mh
}
// NewMossHerderOnEvent returns a func closure that that can be used
// as a moss OnEvent() callback.
func NewMossHerderOnEvent(memQuota uint64) func(Event) {
if memQuota <= 0 {
return nil
}
mh := newMossHerder(memQuota)
return func(event Event) { mh.OnEvent(event) }
}
func (mh *mossHerder) OnEvent(event Event) {
switch event.Kind {
case EventKindCloseStart:
mh.OnCloseStart(event.Collection)
case EventKindClose:
mh.OnClose(event.Collection)
case EventKindBatchExecuteStart:
mh.OnBatchExecuteStart(event.Collection)
case EventKindPersisterProgress:
mh.OnPersisterProgress(event.Collection)
default:
return
}
}
func (mh *mossHerder) OnCloseStart(c Collection) {
mh.m.Lock()
if mh.waiting > 0 {
fmt.Printf("moss_herder: close start progress, waiting: %d", mh.waiting)
}
delete(mh.collections, c)
mh.m.Unlock()
}
func (mh *mossHerder) OnClose(c Collection) {
mh.m.Lock()
if mh.waiting > 0 {
fmt.Printf("moss_herder: close progress, waiting: %d", mh.waiting)
}
delete(mh.collections, c)
mh.m.Unlock()
}
func (mh *mossHerder) OnBatchExecuteStart(c Collection) {
if c.Options().LowerLevelUpdate == nil {
return
}
mh.m.Lock()
mh.collections[c] = struct{}{}
for mh.overMemQuotaLOCKED() {
// If we're over the memory quota, then wait for persister progress.
mh.waiting++
mh.waitCond.Wait()
fmt.Printf("moss_herder: waiting for persistence..\n")
mh.waiting--
}
mh.m.Unlock()
}
func (mh *mossHerder) OnPersisterProgress(c Collection) {
if c.Options().LowerLevelUpdate == nil {
return
}
mh.m.Lock()
if mh.waiting > 0 {
fmt.Printf("moss_herder: persistence progress, woken: %d\n", mh.waiting)
}
mh.waitCond.Broadcast()
mh.m.Unlock()
}
// --------------------------------------------------------
// overMemQuotaLOCKED() returns true if the number of dirty bytes is
// greater than the memory quota.
func (mh *mossHerder) overMemQuotaLOCKED() bool {
var totDirtyBytes uint64
for c := range mh.collections {
s, err := c.Stats()
if err != nil {
fmt.Printf("moss_herder: stats, err: %v\n", err)
continue
}
totDirtyBytes += s.CurDirtyBytes
}
return totDirtyBytes > mh.memQuota
}
var numitems = flag.Int("numItems", 100000, "number of items to load")
var batchsize = flag.Int("batchSize", 100, "number of items per batch")
var memquota = flag.Uint64("memquota", 128*1024*1024, "Memory quota")
var dbpath = flag.String("dbpath", "", "path to moss store directory")
func waitForPersistence(coll Collection) {
for {
stats, er := coll.Stats()
if er == nil && stats.CurDirtyOps <= 0 {
break
}
time.Sleep(1 * time.Millisecond)
}
}
func Test_DGMLoad(t *testing.T) {
numItems := 400000
batchSize := 100
var memQuota uint64 = 128 * 1024 * 1024
flag.Parse()
if numitems != nil {
numItems = *numitems
}
if batchsize != nil {
batchSize = *batchsize
}
if memquota != nil {
memQuota = *memquota
}
var tmpDir string
if *dbpath != "" {
tmpDir = *dbpath
os.RemoveAll(tmpDir)
if err := os.Mkdir(tmpDir, 0777); err != nil {
t.Fatalf("Can't create directory %s: %v", tmpDir, err)
}
} else {
tmpDir, _ = ioutil.TempDir("", "mossStoreDGM")
defer os.RemoveAll(tmpDir)
}
so := DefaultStoreOptions
so.CollectionOptions.OnEvent = NewMossHerderOnEvent(memQuota)
so.CompactionSync = true
spo := StorePersistOptions{CompactionConcern: CompactionAllow}
store, coll, err := OpenStoreCollection(tmpDir, so, spo)
if err != nil || store == nil || coll == nil {
t.Fatalf("error opening store collection:%v", tmpDir)
}
startT := time.Now()
startI := 0
bigVal := fmt.Sprintf("%0504d", numItems)
for i := 0; i < numItems; i = i + batchSize {
// create new batch to set some keys
ba, errr := coll.NewBatch(batchSize, batchSize*512)
if errr != nil {
t.Fatalf("error creating new batch: %v", err)
return
}
for j := i + batchSize - 1; j >= i; j-- {
k := fmt.Sprintf("%08d", j)
ba.Set([]byte(k), []byte(bigVal))
}
err = coll.ExecuteBatch(ba, WriteOptions{})
if err != nil {
t.Fatalf("error executing batch: %v", err)
return
}
// cleanup that batch
err = ba.Close()
if err != nil {
t.Fatalf("error closing batch: %v", err)
return
}
elapsed := time.Since(startT)
if elapsed > time.Second {
fmt.Printf("Loaded items upto %d. Rate %f KOps/s\n", i,
((float64)(i-startI))/elapsed.Seconds()/1000)
startI = i
startT = time.Now()
}
}
val, erro := coll.Get([]byte(fmt.Sprintf("%08d", numItems-1)), ReadOptions{})
if erro != nil || val == nil {
t.Fatalf("Unable to fetch the key written! %v", err)
}
waitForPersistence(coll)
time.Sleep(2 * time.Second) // wait for idle run compaction to kick in.
if coll.Close() != nil {
t.Fatalf("Error closing child collection")
}
if store.Close() != nil {
t.Fatalf("expected store close to work")
}
// Wait for background removals to complete.
waitForCompactionCleanup(tmpDir, 10)
store, coll, err = OpenStoreCollection(tmpDir, so, spo)
if err != nil || store == nil || coll == nil {
t.Fatalf("error opening store collection:%v, %v", tmpDir, err)
}
startT = time.Now()
ss, _ := coll.Snapshot()
iter, erro := ss.StartIterator(nil, nil, IteratorOptions{})
if erro != nil {
t.Fatalf("error opening collection iterator:%v", erro)
}
i := 0
for ; err == nil; err, i = iter.Next(), i+1 {
key := fmt.Sprintf("%08d", i)
k, _, erro := iter.Current()
if erro != nil {
break
}
if !bytes.Equal(k, []byte(key)) {
fmt.Println("Data loss for item ", key, " vs ", string(k))
t.Fatalf("Data loss for item detected!")
}
_, erro = coll.Get([]byte(key), ReadOptions{})
if erro != nil {
t.Fatalf("Data loss for item in Get detected!")
}
}
if i != numItems {
t.Errorf("Data loss: Expected %d items, but iterated only %d", numItems, i)
}
iter.Close()
ss.Close()
elapsed := time.Since(startT)
if numItems > 200000 {
fmt.Printf("Iterating %d items took %dms\n", numItems, elapsed/1000000)
}
if store.Close() != nil {
t.Fatalf("expected store close to work")
}
if coll.Close() != nil {
t.Fatalf("Error closing child collection")
}
}
|