mirror of https://github.com/etcd-io/bbolt.git
149 lines
3.3 KiB
Go
149 lines
3.3 KiB
Go
package bolt
|
|
|
|
import (
|
|
"unsafe"
|
|
)
|
|
|
|
// RWTransaction represents a transaction that can read and write data.
|
|
// Only one read/write transaction can be active for a DB at a time.
|
|
type RWTransaction struct {
|
|
Transaction
|
|
branches map[pgid]*branch
|
|
leafs map[pgid]*leaf
|
|
}
|
|
|
|
// CreateBucket creates a new bucket.
|
|
func (t *RWTransaction) CreateBucket(name string) error {
|
|
// Check if bucket already exists.
|
|
if b := t.Bucket(name); b != nil {
|
|
return &Error{"bucket already exists", nil}
|
|
}
|
|
|
|
// Create a new bucket entry.
|
|
var buf [unsafe.Sizeof(bucket{})]byte
|
|
var raw = (*bucket)(unsafe.Pointer(&buf[0]))
|
|
raw.root = 0
|
|
|
|
// Move cursor to insertion location.
|
|
c := t.sys.Cursor()
|
|
c.Goto([]byte(name))
|
|
|
|
// Load the leaf node from the cursor and insert the key/value.
|
|
t.leaf(c).put([]byte(name), buf[:])
|
|
|
|
return nil
|
|
}
|
|
|
|
// DropBucket deletes a bucket.
|
|
func (t *RWTransaction) DeleteBucket(b *Bucket) error {
|
|
// TODO: Remove from main DB.
|
|
// TODO: Delete entry from system bucket.
|
|
// TODO: Free all pages.
|
|
// TODO: Remove cursor.
|
|
return nil
|
|
}
|
|
|
|
func (t *RWTransaction) Put(name string, key []byte, value []byte) error {
|
|
b := t.Bucket(name)
|
|
if b == nil {
|
|
return &Error{"bucket not found", nil}
|
|
}
|
|
|
|
// Validate the key and data size.
|
|
if len(key) == 0 {
|
|
return &Error{"key required", nil}
|
|
} else if len(key) > MaxKeySize {
|
|
return &Error{"key too large", nil}
|
|
} else if len(value) > MaxDataSize {
|
|
return &Error{"data too large", nil}
|
|
}
|
|
|
|
// Insert a new node.
|
|
c := b.Cursor()
|
|
c.Goto(key)
|
|
t.leaf(c).put(key, value)
|
|
|
|
return nil
|
|
}
|
|
|
|
func (t *RWTransaction) Delete(key []byte) error {
|
|
// TODO: Traverse to the correct node.
|
|
// TODO: If missing, exit.
|
|
// TODO: Remove node from page.
|
|
// TODO: If page is empty then add it to the freelist.
|
|
return nil
|
|
}
|
|
|
|
func (t *RWTransaction) Commit() error {
|
|
// TODO(benbjohnson): Use vectorized I/O to write out dirty pages.
|
|
|
|
// TODO: Flush data.
|
|
|
|
// TODO: Update meta.
|
|
// TODO: Write meta.
|
|
|
|
return nil
|
|
}
|
|
|
|
func (t *RWTransaction) Rollback() error {
|
|
return t.close()
|
|
}
|
|
|
|
func (t *RWTransaction) close() error {
|
|
// Clear temporary pages.
|
|
t.leafs = nil
|
|
|
|
// TODO: Release writer lock.
|
|
|
|
return nil
|
|
}
|
|
|
|
// allocate returns a contiguous block of memory starting at a given page.
|
|
func (t *RWTransaction) allocate(size int) (*page, error) {
|
|
// TODO: Find a continuous block of free pages.
|
|
// TODO: If no free pages are available, resize the mmap to allocate more.
|
|
return nil, nil
|
|
}
|
|
|
|
// leaf retrieves a leaf object based on the current position of a cursor.
|
|
func (t *RWTransaction) leaf(c *Cursor) *leaf {
|
|
e := c.stack[len(c.stack)-1]
|
|
id := e.page.id
|
|
|
|
// Retrieve leaf if it has already been fetched.
|
|
if l := t.leafs[id]; l != nil {
|
|
return l
|
|
}
|
|
|
|
// Otherwise create a leaf and cache it.
|
|
l := &leaf{}
|
|
l.read(t.page(id))
|
|
l.parent = t.branch(c.stack[:len(c.stack)-1])
|
|
t.leafs[id] = l
|
|
|
|
return l
|
|
}
|
|
|
|
// branch retrieves a branch object based a cursor stack.
|
|
// This should only be called from leaf().
|
|
func (t *RWTransaction) branch(stack []elem) *branch {
|
|
if len(stack) == 0 {
|
|
return nil
|
|
}
|
|
|
|
// Retrieve branch if it has already been fetched.
|
|
e := &stack[len(stack)-1]
|
|
id := e.page.id
|
|
if b := t.branches[id]; b != nil {
|
|
return b
|
|
}
|
|
|
|
// Otherwise create a branch and cache it.
|
|
b := &branch{}
|
|
b.read(t.page(id))
|
|
b.parent = t.branch(stack[:len(stack)-1])
|
|
t.branches[id] = b
|
|
|
|
return b
|
|
}
|