Searched refs:insertNodeNum (Results 1 - 2 of 2) sorted by relevance
/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/ |
H A D | BTree.c | 1271 u_int32_t insertNodeNum; local 1292 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index); 1309 err = AllocateNode (btreePtr, &insertNodeNum); 1312 err = GetNewNode (btreePtr, insertNodeNum, &nodeRec); 1336 btreePtr->rootNode = insertNodeNum; 1337 btreePtr->firstLeafNode = insertNodeNum; 1338 btreePtr->lastLeafNode = insertNodeNum; 1382 recordLen, &nodeRec, index, 1, kInsertRecord, &insertNodeNum); 1395 iterator->hint.nodeNum = insertNodeNum; 1434 u_int32_t insertNodeNum; local 1581 u_int32_t insertNodeNum; local [all...] |
H A D | BTreeTreeOps.c | 123 u_int32_t *insertNodeNum, 140 u_int32_t *insertNodeNum, 947 insertNodeNum - description 963 u_int32_t *insertNodeNum, 1030 *insertNodeNum = 0; 1064 *insertNodeNum = rightNode->bLink; 1094 *insertNodeNum = leftNode->fLink; 1106 *insertNodeNum = 0; 1126 u_int32_t *insertNodeNum, 1210 insertIndex, insertNodeNum, 955 RotateLeft(BTreeControlBlockPtr btreePtr, NodeDescPtr leftNode, NodeDescPtr rightNode, u_int16_t rightInsertIndex, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, u_int16_t *insertIndex, u_int32_t *insertNodeNum, Boolean *recordFit, u_int16_t *recsRotated ) argument 1117 SplitLeft(BTreeControlBlockPtr btreePtr, BlockDescriptor *leftNode, BlockDescriptor *rightNode, u_int32_t rightNodeNum, u_int16_t index, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, u_int16_t *insertIndex, u_int32_t *insertNodeNum, u_int16_t *recsRotated ) argument [all...] |
Completed in 21 milliseconds