file_systems/bfs/BPlusTree.cpp

1049 	node_and_key nodeAndKey;
1050 	nodeAndKey.nodeOffset = fHeader.RootNode();
1054 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1059 			nodeAndKey.keyIndex = 0;
1060 			stack.Push(nodeAndKey);
1065 		status_t status = _FindKey(node, key, keyLength, &nodeAndKey.keyIndex,
1068 		if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
1077 		stack.Push(nodeAndKey);
1079 		nodeAndKey.nodeOffset = nextOffset;
1083 		B_PRIdOFF "\n", nodeAndKey.nodeOffset, fStream->ID()));
1635 	node_and_key nodeAndKey;
1639 	while (stack.Pop(&nodeAndKey)
1640 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1647 				&nodeAndKey.keyIndex);
1653 						nodeAndKey.keyIndex, value);
1672 			_InsertKey(writableNode, nodeAndKey.keyIndex,
1674 			_UpdateIterators(nodeAndKey.nodeOffset, BPLUSTREE_NULL,
1675 				nodeAndKey.keyIndex, 0, 1);
1685 			if (nodeAndKey.nodeOffset == fHeader.RootNode()) {
1710 			if (_SplitNode(writableNode, nodeAndKey.nodeOffset, other,
1711 					otherOffset, &nodeAndKey.keyIndex, keyBuffer, &keyLength,
1724 			_UpdateIterators(nodeAndKey.nodeOffset, otherOffset,
1725 				nodeAndKey.keyIndex, writableNode->NumKeys(), 1);
1740 					nodeAndKey.nodeOffset);
2048 	node_and_key nodeAndKey;
2052 	while (stack.Pop(&nodeAndKey)
2053 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
2060 				&nodeAndKey.keyIndex);
2066 					node->Values()[nodeAndKey.keyIndex]))) {
2069 						nodeAndKey.keyIndex, value);
2076 				if (node->Values()[nodeAndKey.keyIndex] != value)
2085 				_UpdateIterators(nodeAndKey.nodeOffset, node->NumKeys() == 1
2086 					? next : BPLUSTREE_NULL, nodeAndKey.keyIndex, 0 , -1);
2097 		if (nodeAndKey.nodeOffset == fHeader.RootNode()
2124 			_RemoveKey(writableNode, nodeAndKey.keyIndex);
2142 		cached.Free(transaction, nodeAndKey.nodeOffset);