622 	nodeAndKey.nodeOffset = fHeader->root_node_pointer;  in SeekDown()
626 	while ((node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node)) {  in SeekDown()
639 		if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)  in SeekDown()
645 		nodeAndKey.nodeOffset = nextOffset;  in SeekDown()
721 status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,ui…  in SplitNode()  argument
783 	other->right_link = nodeOffset;  in SplitNode()
926 	fCache.SetDirty(nodeOffset,true);  in SplitNode()
972 …while (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(n…  in Insert()
995 			fCache.SetDirty(nodeAndKey.nodeOffset,true);  in Insert()
1005 			if (nodeAndKey.nodeOffset == fHeader->root_node_pointer) {  in Insert()
1013 …if (SplitNode(node,nodeAndKey.nodeOffset,&nodeAndKey.keyIndex,keyBuffer,&keyLength,&valueToInsert)…  in Insert()
1021 				rootNode->overflow_link = nodeAndKey.nodeOffset;  in Insert()
1054 …if (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node…  in Find()
1060 		SetCurrentNode(node,nodeAndKey.nodeOffset);  in Find()
1088 bplustree_node *BPlusTree::Node(off_t nodeOffset,bool check)  in Node()  argument
1097 	if (nodeOffset > fHeader->maximum_size /*- fNodeSize*/  in Node()
1098 		|| nodeOffset <= 0 && nodeOffset != BPLUSTREE_NULL  in Node()
1099 		|| (nodeOffset % fNodeSize) != 0)  in Node()
1106 	if (nodeOffset == BPLUSTREE_NULL || !fStream)  in Node()
1114 	else if (fStream && fStream->ReadAt(nodeOffset,node,fNodeSize) < fNodeSize)  in Node()
1130 	if (!fStream && nodeOffset > fHeader->maximum_size - fNodeSize) {  in Node()