perkeep/pkg/index/memindex.go

136 lines
3.2 KiB
Go

/*
Copyright 2011 Google 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 index
import (
"errors"
"sync"
"camlistore.org/pkg/blobserver"
"camlistore.org/pkg/jsonconfig"
"camlistore.org/third_party/code.google.com/p/leveldb-go/leveldb/db"
"camlistore.org/third_party/code.google.com/p/leveldb-go/leveldb/memdb"
)
func init() {
blobserver.RegisterStorageConstructor("memory-only-dev-indexer",
blobserver.StorageConstructor(newMemoryIndexFromConfig))
}
// NewMemoryIndex returns an Index backed only by memory, for use in tests.
func NewMemoryIndex() *Index {
db := memdb.New(nil)
memStorage := &memKeys{db: db}
return New(memStorage)
}
func newMemoryIndexFromConfig(ld blobserver.Loader, config jsonconfig.Obj) (blobserver.Storage, error) {
blobPrefix := config.RequiredString("blobSource")
if err := config.Validate(); err != nil {
return nil, err
}
sto, err := ld.GetStorage(blobPrefix)
if err != nil {
return nil, err
}
ix := NewMemoryIndex()
ix.BlobSource = sto
// Good enough, for now:
ix.KeyFetcher = ix.BlobSource
return ix, err
}
// memKeys is a naive in-memory implementation of index.Storage for test & development
// purposes only.
type memKeys struct {
mu sync.Mutex // guards db
db db.DB
}
// stringIterator converts from leveldb's db.Iterator interface, which
// operates on []byte, to Camlistore's index.Iterator, which operates
// on string.
type stringIterator struct {
db.Iterator
}
func (s stringIterator) Key() string {
return string(s.Iterator.Key())
}
func (s stringIterator) Value() string {
return string(s.Iterator.Value())
}
func (mk *memKeys) Get(key string) (string, error) {
mk.mu.Lock()
defer mk.mu.Unlock()
k, err := mk.db.Get([]byte(key), nil)
if err == db.ErrNotFound {
return "", ErrNotFound
}
return string(k), err
}
func (mk *memKeys) Find(key string) Iterator {
mk.mu.Lock()
defer mk.mu.Unlock()
dit := mk.db.Find([]byte(key), nil)
return stringIterator{dit}
}
func (mk *memKeys) Set(key, value string) error {
mk.mu.Lock()
defer mk.mu.Unlock()
return mk.db.Set([]byte(key), []byte(value), nil)
}
func (mk *memKeys) Delete(key string) error {
mk.mu.Lock()
defer mk.mu.Unlock()
return mk.db.Delete([]byte(key), nil)
}
func (mk *memKeys) BeginBatch() BatchMutation {
return &batch{}
}
func (mk *memKeys) CommitBatch(bm BatchMutation) error {
b, ok := bm.(*batch)
if !ok {
return errors.New("invalid batch type; not an instance returned by BeginBatch")
}
mk.mu.Lock()
defer mk.mu.Unlock()
for _, m := range b.Mutations() {
if m.IsDelete() {
if err := mk.db.Delete([]byte(m.Key()), nil); err != nil {
return err
}
} else {
if err := mk.db.Set([]byte(m.Key()), []byte(m.Value()), nil); err != nil {
return err
}
}
}
return nil
}