bfs/r5/BPlusTree.cpp

593 	node_and_key nodeAndKey;
594 	nodeAndKey.nodeOffset = fHeader->RootNode();
598 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
603 			nodeAndKey.keyIndex = 0;
604 			stack.Push(nodeAndKey);
609 		status_t status = FindKey(node, key, keyLength, &nodeAndKey.keyIndex, &nextOffset);
611 		if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
615 		stack.Push(nodeAndKey);
617 		nodeAndKey.nodeOffset = nextOffset;
1094 	node_and_key nodeAndKey;
1098 	while (stack.Pop(&nodeAndKey) && (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1104 			status_t status = FindKey(node, key, keyLength, &nodeAndKey.keyIndex);
1109 					return InsertDuplicate(transaction, &cached, node, nodeAndKey.keyIndex, value);
1119 			InsertKey(node, nodeAndKey.keyIndex, keyBuffer, keyLength, value);
1120 			UpdateIterators(nodeAndKey.nodeOffset, BPLUSTREE_NULL, nodeAndKey.keyIndex, 0, 1);
1130 			if (nodeAndKey.nodeOffset == fHeader->RootNode()) {
1153 			if (SplitNode(node, nodeAndKey.nodeOffset, other, otherOffset,
1154 					&nodeAndKey.keyIndex, keyBuffer, &keyLength, &value) < B_OK) {
1168 			UpdateIterators(nodeAndKey.nodeOffset, otherOffset, nodeAndKey.keyIndex,
1183 				root->overflow_link = HOST_ENDIAN_TO_BFS_INT64(nodeAndKey.nodeOffset);
1458 	node_and_key nodeAndKey;
1462 	while (stack.Pop(&nodeAndKey) && (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1468 			status_t status = FindKey(node, key, keyLength, &nodeAndKey.keyIndex);
1477 			UpdateIterators(nodeAndKey.nodeOffset, node->NumKeys() == 1 ?
1478 								next : BPLUSTREE_NULL, nodeAndKey.keyIndex, 0 , -1);
1482 					node->Values()[nodeAndKey.keyIndex]))) {
1484 					return RemoveDuplicate(transaction, node, &cached, nodeAndKey.keyIndex, value);
1493 		if (nodeAndKey.nodeOffset == fHeader->RootNode()
1516 			RemoveKey(node, nodeAndKey.keyIndex);
1537 		cached.Free(transaction, nodeAndKey.nodeOffset);