file_systems/bfs/BPlusTree.cpp

13 #include "BPlusTree.h"
130 	TreeCheck(BPlusTree* tree)
236 // Node Caching for the BPlusTree class
582 BPlusTree::BPlusTree(Transaction& transaction, Inode* stream, int32 nodeSize)
593 BPlusTree::BPlusTree(Inode* stream)
606 BPlusTree::BPlusTree()
620 BPlusTree::~BPlusTree()
643 BPlusTree::SetTo(Transaction& transaction, Inode* stream, int32 nodeSize)
692 BPlusTree::SetTo(Inode* stream)
755 BPlusTree::InitCheck()
763 BPlusTree::Validate(bool repair, bool& _errorsFound)
839 BPlusTree::MakeEmpty()
896 BPlusTree::TypeCodeToKeyType(type_code code)
922 BPlusTree::ModeToKeyType(mode_t mode)
952 BPlusTree::TransactionDone(bool success)
965 BPlusTree::RemovedFromTransaction()
978 BPlusTree::_UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex,
994 BPlusTree::_AddIterator(TreeIterator* iterator)
1002 BPlusTree::_RemoveIterator(TreeIterator* iterator)
1011 BPlusTree::_CompareKeys(const void* key1, int keyLength1, const void* key2,
1043 BPlusTree::_FindKey(const bplustree_node* node, const uint8* key,
1109 BPlusTree::_SeekDown(Stack<node_and_key>& stack, const uint8* key,
1136 			dprintf("BPlusTree::_SeekDown() node walked too deep.\n");
1146 	FATAL(("BPlusTree::_SeekDown() could not open node %" B_PRIdOFF ", inode %"
1156 BPlusTree::_FindFreeDuplicateFragment(Transaction& transaction,
1198 BPlusTree::_InsertDuplicate(Transaction& transaction, CachedNode& cached,
1365 BPlusTree::_InsertKey(bplustree_node* node, uint16 index, uint8* key,
1417 BPlusTree::_SplitNode(bplustree_node* node, off_t nodeOffset,
1678 BPlusTree::Insert(Transaction& transaction, const uint8* key, uint16 keyLength,
1828 BPlusTree::_RemoveDuplicate(Transaction& transaction,
2031 	the calling method (BPlusTree::Remove()) have this data.
2034 BPlusTree::_RemoveKey(bplustree_node* node, uint16 index)
2098 BPlusTree::Remove(Transaction& transaction, const uint8* key, uint16 keyLength,
2221 BPlusTree::Replace(Transaction& transaction, const uint8* key, uint16 keyLength,
2267 	It's very similar to BPlusTree::SeekDown(), but doesn't fill a stack
2277 BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value)
2331 BPlusTree::_ValidateChildren(TreeCheck& check, uint32 level, off_t offset,
2521 BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
2559 TreeIterator::TreeIterator(BPlusTree* tree)
2803 /*!	This is more or less a copy of BPlusTree::Find() - but it just