Symbol: BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1148
if (node->OverflowLink() == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1271
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1333
&& (oldValue = duplicate->RightLink()) != BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
144
fPreviousOffsets[i] = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1562
if (node->OverflowLink() != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1765
_UpdateIterators(nodeAndKey.nodeOffset, BPLUSTREE_NULL,
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1775
off_t newRoot = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1825
if (newRoot != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1916
if (duplicate->LeftLink() != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1939
if ((duplicateOffset = duplicate->RightLink()) == BPLUSTREE_NULL)
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1955
bool isLast = left == BPLUSTREE_NULL && right == BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1962
if (left == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1985
if (left != BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1994
if (right == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
1995
&& duplicate->LeftLink() == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2001
if (right != BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2010
if (left == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2011
&& duplicate->RightLink() == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2174
off_t next = node->RightLink() == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2177
? next : BPLUSTREE_NULL, nodeAndKey.keyIndex, 0 , -1);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2192
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2272
if (node->OverflowLink() == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2337
if (node->OverflowLink() == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2410
off_t lastDuplicateOffset = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2412
while (duplicateOffset != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2504
if (i == 0 && lastOffset != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2533
if (parent->OverflowLink() != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2590
fCurrentNodeOffset(BPLUSTREE_NULL)
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2624
if (node->OverflowLink() == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2627
fDuplicateNode = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2676
if (fCurrentNodeOffset == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2692
if (fDuplicateNode != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2708
if (fDuplicateNode != BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2723
fDuplicateNode = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2743
if (fCurrentNodeOffset != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2821
fDuplicateNode = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2860
if (node->OverflowLink() == BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2863
fDuplicateNode = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2878
fDuplicateNode = BPLUSTREE_NULL;
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2889
if (nextOffset != BPLUSTREE_NULL) {
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
2952
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
509
if (fTree == NULL || fTree->fStream == NULL || offset == BPLUSTREE_NULL)
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
700
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
883
= HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
890
node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
891
node->right_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
892
node->overflow_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
906
node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
src/add-ons/kernel/file_systems/bfs/BPlusTree.h
560
return link == BPLUSTREE_NULL
src/add-ons/kernel/file_systems/bfs/BPlusTree.h
602
return OverflowLink() == BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
1005
off_t newRoot = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
1015
if (newRoot != BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
1021
if (newRoot != BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
103
fCurrentNodeOffset(BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
1050
fCurrentNodeOffset = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
1063
if (status == B_OK && node->overflow_link == BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
1099
|| nodeOffset <= 0 && nodeOffset != BPLUSTREE_NULL
src/bin/bfs_tools/lib/BPlusTree.cpp
1107
if (nodeOffset == BPLUSTREE_NULL || !fStream)
src/bin/bfs_tools/lib/BPlusTree.cpp
1109
node->left_link = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
1110
node->right_link = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
1111
node->overflow_link = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
128
fCurrentNodeOffset = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
147
fHeader->free_node_pointer = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
239
info.from = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
243
if (fHeader->free_node_pointer != BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
281
if (node->overflow_link != BPLUSTREE_NULL && !info.free) {
src/bin/bfs_tools/lib/BPlusTree.cpp
291
} else if (node->left_link != BPLUSTREE_NULL && info.free) {
src/bin/bfs_tools/lib/BPlusTree.cpp
327
fDuplicateNode = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
345
if (node->overflow_link == BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
373
if (fCurrentNodeOffset == BPLUSTREE_NULL
src/bin/bfs_tools/lib/BPlusTree.cpp
379
if (fDuplicateNode != BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
396
if (fDuplicateNode != BPLUSTREE_NULL
src/bin/bfs_tools/lib/BPlusTree.cpp
409
fDuplicateNode = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
425
if (fCurrentNodeOffset != BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
485
fDuplicateNode = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
629
if (node->overflow_link == BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
78
fCurrentNodeOffset(BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
822
if (node->overflow_link != BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
89
fCurrentNodeOffset(BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.cpp
930
if (other->left_link != BPLUSTREE_NULL) {
src/bin/bfs_tools/lib/BPlusTree.cpp
967
fCurrentNodeOffset = BPLUSTREE_NULL;
src/bin/bfs_tools/lib/BPlusTree.cpp
982
if (status == B_OK && node->overflow_link == BPLUSTREE_NULL)
src/bin/bfs_tools/lib/BPlusTree.h
256
return link == BPLUSTREE_NULL || (link > 0 && link <= maximum_size - node_size);
src/bin/bfs_tools/lib/dump.cpp
217
node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index");
src/tests/add-ons/kernel/file_systems/bfs/btree/test.cpp
74
node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index",