Lines Matching defs:nodeNum
112 Output: nodeNum - number of node allocated
120 OSStatus AllocateNode (BTreeControlBlockPtr btreePtr, u_int32_t *nodeNum)
204 *nodeNum = nodeNumber;
213 *nodeNum = 0;
224 Function: Finds the bit representing the node specified by nodeNum in the node
229 nodeNum - number of node to mark free
238 OSStatus FreeNode (BTreeControlBlockPtr btreePtr, u_int32_t nodeNum)
253 while (nodeNum >= nodeIndex)
266 nodeNum -= (nodeIndex - (mapSize << 3)); // relative to this map record
267 bitOffset = 15 - (nodeNum & 0x0000000F); // last 4 bits are bit offset
268 mapPos += nodeNum >> 4; // point to word containing map bit
322 u_int32_t nodeNum, nextNodeNum;
408 nodeNum = firstNewMapNodeNum;
411 err = GetNewNode (btreePtr, nodeNum, &newNode);
423 if (nodeNum++ == lastNewMapNodeNum)
426 ((BTNodeDescriptor*)newNode.buffer)->fLink = nodeNum; // point to next map node
438 nodeNum = firstNewMapNodeNum;
440 bitInRecord = nodeNum - recStartBit;
474 bitInRecord = nodeNum - recStartBit;
477 mapPos = mapStart + ((nodeNum - recStartBit) >> 4);
478 bitInWord = 15 - ((nodeNum - recStartBit) & 0x0000000F);
482 ++nodeNum;
484 } while (nodeNum <= lastNewMapNodeNum);