Lines Matching refs:nodeNum
70 <CS7> 7/25/97 DSH BTSearchRecord now takes a heuristicHint, nodeNum, and tries it
134 set the local nodeNum variable correctly so that the resultant
466 u_int32_t nodeNum;
505 nodeNum = searchIterator->hint.nodeNum;
507 err = GetNode (btreePtr, nodeNum, kGetNodeHint, &node);
538 err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index);
580 resultIterator->hint.nodeNum = nodeNum;
613 resultIterator->hint.nodeNum = 0;
662 u_int32_t nodeNum;
705 if (operation == kBTreeFirstRecord) nodeNum = btreePtr->firstLeafNode;
706 else nodeNum = btreePtr->lastLeafNode;
708 if (nodeNum == 0)
714 err = GetNode (btreePtr, nodeNum, 0, &node);
740 &left, &node, &right, &nodeNum, &index, &foundRecord);
756 nodeNum = ((NodeDescPtr) node.buffer)->bLink;
757 if ( nodeNum > 0)
766 err = GetNode (btreePtr, nodeNum, 0, &left);
811 nodeNum = ((NodeDescPtr) node.buffer)->fLink;
812 if ( nodeNum > 0)
814 err = GetNode (btreePtr, nodeNum, 0, &right);
868 iterator->hint.nodeNum = nodeNum;
935 iterator->hint.nodeNum = 0;
979 u_int32_t nodeNum;
1012 nodeNum = btreePtr->firstLeafNode;
1014 nodeNum = btreePtr->lastLeafNode;
1016 if (nodeNum == 0)
1022 err = GetNode(btreePtr, nodeNum, 0, &node);
1049 &nodeNum, &index, &foundRecord);
1067 nodeNum = ((NodeDescPtr) node.buffer)->bLink;
1068 if ( nodeNum > 0)
1077 err = GetNode (btreePtr, nodeNum, 0, &left);
1122 nodeNum = ((NodeDescPtr)node.buffer)->fLink;
1123 if ( nodeNum > 0)
1125 err = GetNode(btreePtr, nodeNum, 0, &right);
1172 nodeNum = ((NodeDescPtr)node.buffer)->fLink;
1173 if ( nodeNum > 0)
1175 err = GetNode(btreePtr, nodeNum, 0, &right);
1207 iterator->hint.nodeNum = nodeNum;
1246 iterator->hint.nodeNum = 0;
1395 iterator->hint.nodeNum = insertNodeNum;
1410 iterator->hint.nodeNum = 0;
1460 insertNodeNum = iterator->hint.nodeNum;
1544 iterator->hint.nodeNum = insertNodeNum;
1559 iterator->hint.nodeNum = 0;
1603 insertNodeNum = iterator->hint.nodeNum;
1661 iterator->hint.nodeNum = insertNodeNum;
1674 iterator->hint.nodeNum = 0;
1693 u_int32_t nodeNum;
1719 err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1744 iterator->hint.nodeNum = 0;
1906 Output: iterator - iterator with the hint.nodeNum cleared
1918 iterator->hint.nodeNum = 0;