file_systems/bfs/BPlusTree.cpp

289 CachedNode::SetTo(off_t offset, bool check)
292 	if (SetTo(offset, &node, check) == B_OK)
300 CachedNode::SetTo(off_t offset, const bplustree_node** _node, bool check)
559 	// the maximum_size has to be changed before the call to SetTo() - or
588 	SetTo(transaction, stream);
602 	SetTo(stream);
643 BPlusTree::SetTo(Transaction& transaction, Inode* stream, int32 nodeSize)
692 BPlusTree::SetTo(Inode* stream)
749 	cached.SetTo(fHeader.RootNode());
777 		status_t status = cached.SetTo(freeOffset, &node, false);
810 	status_t status = cached.SetTo(fHeader.RootNode(), &root, true);
1118 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1168 		const bplustree_node* fragment = cached.SetTo(
1292 			duplicate = cachedDuplicate.SetTo(duplicateOffset, false);
1703 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
2116 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
2238 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2300 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2386 				status_t status = cached.SetTo(duplicateOffset, &node, false);
2478 				const bplustree_node* previous = cached.SetTo(lastOffset, true);
2526 	status_t status = cached.SetTo(offset, &node, true);
2594 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2670 			node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),
2681 					&& (node = cached.SetTo(fDuplicateNode, false)) != NULL) {
2701 	if ((node = cached.SetTo(fCurrentNodeOffset)) == NULL)
2716 			node = cached.SetTo(fCurrentNodeOffset);
2777 		node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),
2826 	while ((node = cached.SetTo(nodeOffset)) != NULL) {