file_systems/bfs/BPlusTree.cpp

130 	TreeCheck(BPlusTree* tree)
134 		fNodeSize(tree->NodeSize()),
135 		fMaxLevels(tree->fHeader.MaxNumberOfLevels()),
137 		fVisited(tree->Stream()->Size() / tree->NodeSize()),
138 		fVisitedFragment(tree->Stream()->Size() / tree->NodeSize())
141 			sizeof(off_t) * tree->fHeader.MaxNumberOfLevels());
274 			// The B+tree header has been updated - we need to update the
308 	// even access the b+tree header with this method (use SetToHeader()
343 	// even access the b+tree header with this method (use SetToHeader()
487 	// of the tree - perhaps that shouldn't be done everytime that
499 	// if the node is the last one in the tree, we shrink
500 	// the tree and file size by one node
566 		// SetToWritable() below needs the new values in the tree's header
587 	mutex_init(&fIteratorLock, "bfs b+tree iterator");
599 	mutex_init(&fIteratorLock, "bfs b+tree iterator");
615 	mutex_init(&fIteratorLock, "bfs b+tree iterator");
624 	// (can happen when the tree's inode gets deleted while
625 	// traversing the tree - a TreeIterator doesn't lock the inode)
667 	// initialize b+tree header
679 	// initialize b+tree root node
711 		dprintf("B+tree header size %" B_PRIdOFF " doesn't fit file size %"
807 	// Iterate over the complete tree recursively
1673 /*!	This inserts a key into the tree. The changes made to the tree will
1753 					// The tree is most likely corrupted!
1755 					// a flag in the header that forces the tree to be
1824 /*!	Removes the duplicate index/value pair from the tree.
1825 	It's part of the private tree interface.
2092 /*!	Removes the specified key from the tree. The "value" parameter is only used
2211 /*!	Replaces the value for the key in the tree.
2216 	return B_BAD_TYPE if you call this function on a tree where
2265 /*!	Searches the key in the tree, and stores the offset found in _value,
2268 	while it descends the tree.
2272 	B_BAD_TYPE if you call this function on a tree where duplicates are
2323 	FATAL(("b+tree node at %" B_PRIdOFF " could not be loaded, inode %"
2559 TreeIterator::TreeIterator(BPlusTree* tree)
2561 	fTree(tree),
2565 	tree->_AddIterator(this);
2628 /*!	Iterates through the tree in the specified direction.
2652 	// if the tree was emptied since the last call
2871 	// it won't be included in this tree transition.