file_systems/bfs/BPlusTree.cpp

978 BPlusTree::_UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex,
989 		iterator.Next()->Update(offset, nextOffset, keyIndex, splitAt, change);
1128 		off_t nextOffset;
1130 			&nextOffset);
1132 		if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
1143 		nodeAndKey.nodeOffset = nextOffset;
2240 		off_t nextOffset;
2242 			&nextOffset);
2255 		} else if (nextOffset == nodeOffset)
2258 		nodeOffset = nextOffset;
2302 		off_t nextOffset;
2304 			&nextOffset);
2318 		} else if (nextOffset == nodeOffset)
2321 		nodeOffset = nextOffset;
2472 			off_t nextOffset = parent->OverflowLink();
2474 				nextOffset = BFS_ENDIAN_TO_HOST_INT64(values[i + 1]);
2492 				lastOffset, nextOffset, key, keyLength);
2522 	off_t offset, off_t lastOffset, off_t nextOffset,
2544 	if (nextOffset != 0 && node->RightLink() != nextOffset) {
2547 			"!\n", fStream->ID(), offset, node->RightLink(), nextOffset);
2606 		off_t nextOffset;
2608 			nextOffset = node->OverflowLink();
2615 			nextOffset = BFS_ENDIAN_TO_HOST_INT64(node->Values()[0]);
2617 		if (nextOffset == nodeOffset)
2620 		nodeOffset = nextOffset;
2828 		off_t nextOffset = 0;
2830 			&nextOffset);
2838 		} else if (nextOffset == nodeOffset)
2841 		nodeOffset = nextOffset;
2855 TreeIterator::Update(off_t offset, off_t nextOffset, uint16 keyIndex,
2861 	if (nextOffset != BPLUSTREE_NULL) {
2862 		fCurrentNodeOffset = nextOffset;