BPlusTree
BPlusTree::_UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex,
BPlusTree::_AddIterator(TreeIterator* iterator)
BPlusTree::_RemoveIterator(TreeIterator* iterator)
BPlusTree::_CompareKeys(const void* key1, int keyLength1, const void* key2,
BPlusTree::_FindKey(const bplustree_node* node, const uint8* key,
BPlusTree::_SeekDown(Stack<node_and_key>& stack, const uint8* key,
BPlusTree::_FindFreeDuplicateFragment(Transaction& transaction,
BPlusTree::_InsertDuplicate(Transaction& transaction, CachedNode& cached,
TreeCheck(BPlusTree* tree)
BPlusTree::_InsertKey(bplustree_node* node, uint16 index, uint8* key,
BPlusTree::_SplitNode(bplustree_node* node, off_t nodeOffset,
BPlusTree::Insert(Transaction& transaction, const uint8* key, uint16 keyLength,
BPlusTree::_RemoveDuplicate(Transaction& transaction,
BPlusTree::_RemoveKey(bplustree_node* node, uint16 index)
BPlusTree::Remove(Transaction& transaction, const uint8* key, uint16 keyLength,
BPlusTree::Replace(Transaction& transaction, const uint8* key, uint16 keyLength,
BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value)
BPlusTree::_ValidateChildren(TreeCheck& check, uint32 level, off_t offset,
BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
TreeIterator::TreeIterator(BPlusTree* tree)
BPlusTree::BPlusTree(Transaction& transaction, Inode* stream, int32 nodeSize)
BPlusTree::BPlusTree(Inode* stream)
BPlusTree::BPlusTree()
BPlusTree::~BPlusTree()
BPlusTree::SetTo(Transaction& transaction, Inode* stream, int32 nodeSize)
BPlusTree::SetTo(Inode* stream)
BPlusTree::InitCheck()
BPlusTree::Validate(bool repair, bool& _errorsFound)
BPlusTree::MakeEmpty()
BPlusTree::TypeCodeToKeyType(type_code code)
BPlusTree::ModeToKeyType(mode_t mode)
BPlusTree::TransactionDone(bool success)
BPlusTree::RemovedFromTransaction()
class BPlusTree;
CachedNode(BPlusTree* tree)
CachedNode(BPlusTree* tree, off_t offset, bool check = true)
BPlusTree* fTree;
class BPlusTree : public TransactionListener {
BPlusTree(Transaction& transaction,
BPlusTree(Inode* stream);
BPlusTree();
~BPlusTree();
BPlusTree(const BPlusTree& other);
BPlusTree& operator=(const BPlusTree& other);
TreeIterator(BPlusTree* tree);
BPlusTree* Tree() const { return fTree; }
friend class BPlusTree;
BPlusTree* fTree;
BPlusTree::Remove(Transaction& transaction, const char* key, off_t value)
BPlusTree::Insert(Transaction& transaction, const char* key, off_t value)
BPlusTree::Insert(Transaction& transaction, int32 key, off_t value)
BPlusTree::Insert(Transaction& transaction, uint32 key, off_t value)
BPlusTree::Insert(Transaction& transaction, int64 key, off_t value)
BPlusTree::Insert(Transaction& transaction, uint64 key, off_t value)
BPlusTree::Insert(Transaction& transaction, float key, off_t value)
BPlusTree::Insert(Transaction& transaction, double key, off_t value)
CheckVisitor::_RemoveInvalidNode(Inode* parent, BPlusTree* tree,
BPlusTree* tree = inode->Tree();
BPlusTree* tree = index->inode->Tree();
class BPlusTree;
BPlusTree* tree, Inode* inode,
BPlusTree* tree = inode->Tree();
BPlusTree* tree = Node()->Tree();
BPlusTree* tree = Node()->Tree();
BPlusTree* tree = indices->Tree();
BPlusTree* tree = attributes->Tree();
BPlusTree* tree = new(std::nothrow) BPlusTree(*fTransaction, fInode);
BPlusTree* tree = NULL;
BPlusTree* tree = fAttributes->Tree();
fTree = new(std::nothrow) BPlusTree(this);
BPlusTree* Tree() const { return fTree; }
class BPlusTree;
BPlusTree* fTree;
IndexIterator(BPlusTree* tree)
BPlusTree* tree = oldDirectory->Tree();
BPlusTree* newTree = tree;
BPlusTree* movedTree = inode->Tree();
BPlusTree* tree = inode->Tree();
BPlusTree* tree = directory->Tree();
BPlusTree *tree;
checkIndexForNonExistingFiles(Disk &disk,BPlusTree &tree)
checkFiles(Disk &disk,BPlusTree &tree,char *attribute)
BPlusTree *parentTree;
BPlusTree *tree;
BPlusTree *tree;
status_t BPlusTree::Find(uint8 *key,uint16 keyLength,off_t *value)
BPlusTree::CheckNode(bplustree_node *node)
BPlusTree::~BPlusTree()
bplustree_node *BPlusTree::Node(off_t nodeOffset,bool check)
void BPlusTree::Initialize(int32 nodeSize)
void BPlusTree::SetHoldChanges(bool hold)
status_t BPlusTree::SetTo(int32 keyType,int32 nodeSize,bool allowDuplicates)
status_t BPlusTree::SetTo(BPositionIO *stream,bool allowDuplicates)
status_t BPlusTree::InitCheck()
BPlusTree::Validate(bool verbose)
BPlusTree::WriteTo(BPositionIO *stream)
void BPlusTree::SetCurrentNode(bplustree_node *node,off_t offset,int8 to)
status_t BPlusTree::Goto(int8 to)
status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
NodeCache::NodeCache(BPlusTree *tree)
int32 BPlusTree::CompareKeys(const void *key1, int keyLength1, const void *key2, int keyLength2)
status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next)
status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength)
void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index)
status_t BPlusTree::InsertDuplicate(bplustree_node */*node*/,uint16 /*index*/)
status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value)
BPlusTree::BPlusTree(int32 keyType,int32 nodeSize,bool allowDuplicates)
BPlusTree::BPlusTree(BPositionIO *stream,bool allowDuplicates)
BPlusTree::BPlusTree()
status_t BPlusTree::Insert(uint8 *key,uint16 keyLength,off_t value)
class BPlusTree {
BPlusTree(int32 keyType, int32 nodeSize = BPLUSTREE_NODE_SIZE,
BPlusTree(BPositionIO *stream, bool allowDuplicates = true);
BPlusTree();
~BPlusTree();
inline status_t BPlusTree::Rewind()
inline status_t BPlusTree::GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
inline status_t BPlusTree::GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
inline status_t BPlusTree::Insert(const char *key,off_t value)
inline status_t BPlusTree::Insert(int32 key, off_t value)
inline status_t BPlusTree::Insert(uint32 key, off_t value)
inline status_t BPlusTree::Insert(int64 key, off_t value)
inline status_t BPlusTree::Insert(uint64 key, off_t value)
inline status_t BPlusTree::Insert(float key, off_t value)
inline status_t BPlusTree::Insert(double key, off_t value)
class BPlusTree;
NodeCache(BPlusTree *);
BPlusTree *fTree;
fTree = new BPlusTree(BPLUSTREE_STRING_TYPE, BPLUSTREE_NODE_SIZE,
fTree = new BPlusTree(this);
Directory::GetTree(BPlusTree **tree)
class BPlusTree;
status_t GetTree(BPlusTree **tree);
BPlusTree *fTree;
BPlusTree *tree;
BPlusTree *tree;
BPlusTree fTree;
checkTreeContents(BPlusTree* tree)
checkTreeIntegrity(BPlusTree* tree)
checkTree(BPlusTree* tree)
addAllKeys(Transaction& transaction, BPlusTree* tree)
removeAllKeys(Transaction& transaction, BPlusTree* tree)
duplicateTest(Transaction& transaction, BPlusTree* tree)
addRandomSet(Transaction& transaction, BPlusTree* tree, int32 num)
removeRandomSet(Transaction& transaction, BPlusTree* tree, int32 num)
BPlusTree tree(transaction, &inode);