BPLUSTREE_NULL
if (node->OverflowLink() == BPLUSTREE_NULL) {
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
&& (oldValue = duplicate->RightLink()) != BPLUSTREE_NULL);
fPreviousOffsets[i] = BPLUSTREE_NULL;
if (node->OverflowLink() != BPLUSTREE_NULL) {
_UpdateIterators(nodeAndKey.nodeOffset, BPLUSTREE_NULL,
off_t newRoot = BPLUSTREE_NULL;
if (newRoot != BPLUSTREE_NULL) {
if (duplicate->LeftLink() != BPLUSTREE_NULL) {
if ((duplicateOffset = duplicate->RightLink()) == BPLUSTREE_NULL)
bool isLast = left == BPLUSTREE_NULL && right == BPLUSTREE_NULL;
if (left == BPLUSTREE_NULL) {
if (left != BPLUSTREE_NULL
if (right == BPLUSTREE_NULL
&& duplicate->LeftLink() == BPLUSTREE_NULL
if (right != BPLUSTREE_NULL
if (left == BPLUSTREE_NULL
&& duplicate->RightLink() == BPLUSTREE_NULL
off_t next = node->RightLink() == BPLUSTREE_NULL
? next : BPLUSTREE_NULL, nodeAndKey.keyIndex, 0 , -1);
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
if (node->OverflowLink() == BPLUSTREE_NULL) {
if (node->OverflowLink() == BPLUSTREE_NULL) {
off_t lastDuplicateOffset = BPLUSTREE_NULL;
while (duplicateOffset != BPLUSTREE_NULL) {
if (i == 0 && lastOffset != BPLUSTREE_NULL) {
if (parent->OverflowLink() != BPLUSTREE_NULL) {
fCurrentNodeOffset(BPLUSTREE_NULL)
if (node->OverflowLink() == BPLUSTREE_NULL) {
fDuplicateNode = BPLUSTREE_NULL;
if (fCurrentNodeOffset == BPLUSTREE_NULL
if (fDuplicateNode != BPLUSTREE_NULL) {
if (fDuplicateNode != BPLUSTREE_NULL
fDuplicateNode = BPLUSTREE_NULL;
if (fCurrentNodeOffset != BPLUSTREE_NULL) {
fDuplicateNode = BPLUSTREE_NULL;
if (node->OverflowLink() == BPLUSTREE_NULL) {
fDuplicateNode = BPLUSTREE_NULL;
fDuplicateNode = BPLUSTREE_NULL;
if (nextOffset != BPLUSTREE_NULL) {
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
if (fTree == NULL || fTree->fStream == NULL || offset == BPLUSTREE_NULL)
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
node->right_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
node->overflow_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
return link == BPLUSTREE_NULL
return OverflowLink() == BPLUSTREE_NULL;
off_t newRoot = BPLUSTREE_NULL;
if (newRoot != BPLUSTREE_NULL) {
if (newRoot != BPLUSTREE_NULL) {
fCurrentNodeOffset(BPLUSTREE_NULL)
fCurrentNodeOffset = BPLUSTREE_NULL;
if (status == B_OK && node->overflow_link == BPLUSTREE_NULL)
|| nodeOffset <= 0 && nodeOffset != BPLUSTREE_NULL
if (nodeOffset == BPLUSTREE_NULL || !fStream)
node->left_link = BPLUSTREE_NULL;
node->right_link = BPLUSTREE_NULL;
node->overflow_link = BPLUSTREE_NULL;
fCurrentNodeOffset = BPLUSTREE_NULL;
fHeader->free_node_pointer = BPLUSTREE_NULL;
info.from = BPLUSTREE_NULL;
if (fHeader->free_node_pointer != BPLUSTREE_NULL) {
if (node->overflow_link != BPLUSTREE_NULL && !info.free) {
} else if (node->left_link != BPLUSTREE_NULL && info.free) {
fDuplicateNode = BPLUSTREE_NULL;
if (node->overflow_link == BPLUSTREE_NULL)
if (fCurrentNodeOffset == BPLUSTREE_NULL
if (fDuplicateNode != BPLUSTREE_NULL)
if (fDuplicateNode != BPLUSTREE_NULL
fDuplicateNode = BPLUSTREE_NULL;
if (fCurrentNodeOffset != BPLUSTREE_NULL)
fDuplicateNode = BPLUSTREE_NULL;
if (node->overflow_link == BPLUSTREE_NULL) {
fCurrentNodeOffset(BPLUSTREE_NULL)
if (node->overflow_link != BPLUSTREE_NULL) {
fCurrentNodeOffset(BPLUSTREE_NULL)
if (other->left_link != BPLUSTREE_NULL) {
fCurrentNodeOffset = BPLUSTREE_NULL;
if (status == B_OK && node->overflow_link == BPLUSTREE_NULL)
return link == BPLUSTREE_NULL || (link > 0 && link <= maximum_size - node_size);
node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index");
node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index",