1114 	nodeAndKey.nodeOffset = fHeader.RootNode();  in _SeekDown()
1118 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {  in _SeekDown()
1132 		if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)  in _SeekDown()
1143 		nodeAndKey.nodeOffset = nextOffset;  in _SeekDown()
1147 		B_PRIdOFF "\n", nodeAndKey.nodeOffset, fStream->ID()));  in _SeekDown()
1417 BPlusTree::_SplitNode(bplustree_node* node, off_t nodeOffset,  in _SplitNode()  argument
1482 	other->right_link = HOST_ENDIAN_TO_BFS_INT64(nodeOffset);  in _SplitNode()
1703 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {  in Insert()
1737 			_UpdateIterators(nodeAndKey.nodeOffset, BPLUSTREE_NULL,  in Insert()
1748 			if (nodeAndKey.nodeOffset == fHeader.RootNode()) {  in Insert()
1773 			if (_SplitNode(writableNode, nodeAndKey.nodeOffset, other,  in Insert()
1787 			_UpdateIterators(nodeAndKey.nodeOffset, otherOffset,  in Insert()
1803 					nodeAndKey.nodeOffset);  in Insert()
2116 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {  in Remove()
2148 				_UpdateIterators(nodeAndKey.nodeOffset, node->NumKeys() == 1  in Remove()
2160 		if (nodeAndKey.nodeOffset == fHeader.RootNode()  in Remove()
2205 		cached.Free(transaction, nodeAndKey.nodeOffset);  in Remove()
2234 	off_t nodeOffset = fHeader.RootNode();  in Replace()  local
2238 	while ((node = cached.SetTo(nodeOffset)) != NULL) {  in Replace()
2255 		} else if (nextOffset == nodeOffset)  in Replace()
2258 		nodeOffset = nextOffset;  in Replace()
2292 	off_t nodeOffset = fHeader.RootNode();  in Find()  local
2300 	while ((node = cached.SetTo(nodeOffset)) != NULL) {  in Find()
2318 		} else if (nextOffset == nodeOffset)  in Find()
2321 		nodeOffset = nextOffset;  in Find()
2324 		B_PRIdOFF "\n", nodeOffset, fStream->ID()));  in Find()
2590 	off_t nodeOffset = fTree->fHeader.RootNode();  in Goto()  local
2594 	while ((node = cached.SetTo(nodeOffset)) != NULL) {  in Goto()
2597 			fCurrentNodeOffset = nodeOffset;  in Goto()
2617 		if (nextOffset == nodeOffset)  in Goto()
2620 		nodeOffset = nextOffset;  in Goto()
2822 	off_t nodeOffset = fTree->fHeader.RootNode();  in Find()  local
2826 	while ((node = cached.SetTo(nodeOffset)) != NULL) {  in Find()
2833 			fCurrentNodeOffset = nodeOffset;  in Find()
2838 		} else if (nextOffset == nodeOffset)  in Find()
2841 		nodeOffset = nextOffset;  in Find()