file_systems/bfs/BPlusTree.cpp

14 #include "BPlusTree.h"
114 	TreeCheck(BPlusTree* tree)
220 // Node Caching for the BPlusTree class
535 BPlusTree::BPlusTree(Transaction& transaction, Inode* stream, int32 nodeSize)
545 BPlusTree::BPlusTree(Inode* stream)
555 BPlusTree::BPlusTree()
567 BPlusTree::~BPlusTree()
587 BPlusTree::SetTo(Transaction& transaction, Inode* stream, int32 nodeSize)
635 BPlusTree::SetTo(Inode* stream)
698 BPlusTree::InitCheck()
705 BPlusTree::Validate(bool repair, bool& _errorsFound)
781 BPlusTree::MakeEmpty()
838 BPlusTree::TypeCodeToKeyType(type_code code)
864 BPlusTree::ModeToKeyType(mode_t mode)
892 BPlusTree::TransactionDone(bool success)
905 BPlusTree::RemovedFromTransaction()
918 BPlusTree::_UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex,
934 BPlusTree::_AddIterator(TreeIterator* iterator)
942 BPlusTree::_RemoveIterator(TreeIterator* iterator)
950 BPlusTree::_CompareKeys(const void* key1, int keyLength1, const void* key2,
982 BPlusTree::_FindKey(const bplustree_node* node, const uint8* key,
1045 BPlusTree::_SeekDown(Stack<node_and_key>& stack, const uint8* key,
1072 			dprintf("BPlusTree::_SeekDown() node walked too deep.\n");
1082 	FATAL(("BPlusTree::_SeekDown() could not open node %" B_PRIdOFF ", inode %"
1092 BPlusTree::_FindFreeDuplicateFragment(Transaction& transaction,
1134 BPlusTree::_InsertDuplicate(Transaction& transaction, CachedNode& cached,
1301 BPlusTree::_InsertKey(bplustree_node* node, uint16 index, uint8* key,
1353 BPlusTree::_SplitNode(bplustree_node* node, off_t nodeOffset,
1613 BPlusTree::Insert(Transaction& transaction, const uint8* key, uint16 keyLength,
1765 BPlusTree::_RemoveDuplicate(Transaction& transaction,
1968 	the calling method (BPlusTree::Remove()) have this data.
1971 BPlusTree::_RemoveKey(bplustree_node* node, uint16 index)
2035 BPlusTree::Remove(Transaction& transaction, const uint8* key, uint16 keyLength,
2158 BPlusTree::Replace(Transaction& transaction, const uint8* key, uint16 keyLength,
2203 	It's very similar to BPlusTree::SeekDown(), but doesn't fill a stack
2213 BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value)
2263 BPlusTree::_ValidateChildren(TreeCheck& check, uint32 level, off_t offset,
2453 BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
2490 TreeIterator::TreeIterator(BPlusTree* tree)
2711 /*!	This is more or less a copy of BPlusTree::Find() - but it just