Searched refs:NodeDescPtr (Results 1 - 6 of 6) sorted by relevance
| /macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/ |
| H A D | BTreesPrivate.h | 281 typedef BTNodeDescriptor* NodeDescPtr; typedef
354 NodeDescPtr nodePtr,
379 NodeDescPtr node,
382 #define GetLeftSiblingNode(btree,node,left) GetNode ((btree), ((NodeDescPtr)(node))->bLink, 0, (left))
385 NodeDescPtr node,
388 #define GetRightSiblingNode(btree,node,right) GetNode ((btree), ((NodeDescPtr)(node))->fLink, 0, (right))
409 NodeDescPtr node );
412 NodeDescPtr node );
415 NodeDescPtr node );
421 NodeDescPtr nod
[all...] |
| /macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/ |
| H A D | BTreeNodeOps.c | 146 NodeDescPtr node,
150 NodeDescPtr node,
154 NodeDescPtr node,
159 NodeDescPtr node,
170 static void PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber);
263 NodeDescPtr node;
435 static void PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber)
468 void ClearNode (BTreeControlBlockPtr btreePtr, NodeDescPtr node )
491 NodeDescPtr node,
561 NodeDescPtr nod
[all...] |
| H A D | BTreeMiscOps.c | 365 if ( ((NodeDescPtr) middle->buffer)->kind != kBTLeafNode ||
366 ((NodeDescPtr) middle->buffer)->numRecords <= 0 )
381 if (((NodeDescPtr) middle->buffer)->bLink == 0) // before 1st btree record
386 nodeNum = ((NodeDescPtr) middle->buffer)->bLink;
402 if ( ((NodeDescPtr) left->buffer)->kind != kBTLeafNode ||
403 ((NodeDescPtr) left->buffer)->numRecords <= 0 )
423 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords)
425 nodeNum = ((NodeDescPtr) left->buffer)->fLink;
440 else if (index >= ((NodeDescPtr) middle->buffer)->numRecords)
442 if (((NodeDescPtr) middl
[all...] |
| H A D | BTreeTreeOps.c | 109 NodeDescPtr leftNode,
110 NodeDescPtr rightNode );
116 NodeDescPtr leftNode,
117 NodeDescPtr rightNode,
128 NodeDescPtr leftNode,
129 NodeDescPtr rightNode );
402 PanicIf ((level == 1) && (((NodeDescPtr)targetNode->buffer)->kind != kBTLeafNode), "\P InsertLevel: non-leaf at level 1! ");
479 PanicIf ( ((NodeDescPtr)parentNode.buffer)->kind != kBTIndexNode, "\P InsertLevel: parent node not an index node! ");
523 insertKeyPtr->recPtr = (u_int8_t *) &((NodeDescPtr)targetNode->buffer)->bLink;
582 leftNodeNum = ((NodeDescPtr) rightNod
[all...] |
| H A D | BTree.c | 717 if ( ((NodeDescPtr) node.buffer)->kind != kBTLeafNode ||
718 ((NodeDescPtr) node.buffer)->numRecords <= 0 )
756 nodeNum = ((NodeDescPtr) node.buffer)->bLink;
785 index = ((NodeDescPtr) node.buffer)->numRecords -1;
791 (((NodeDescPtr) node.buffer)->fLink == 0) &&
792 (index == ((NodeDescPtr) node.buffer)->numRecords))
799 if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords))
803 if (index < ((NodeDescPtr) node.buffer)->numRecords -1)
811 nodeNum = ((NodeDescPtr) node.buffer)->fLink;
836 (index >= ((NodeDescPtr) nod
[all...] |
| H A D | BTreeAllocate.c | 417 ((NodeDescPtr)newNode.buffer)->numRecords = 1;
418 ((NodeDescPtr)newNode.buffer)->kind = kBTMapNode;
444 nextNodeNum = ((NodeDescPtr)mapNode.buffer)->fLink;
551 nextNodeNum = ((NodeDescPtr)nodePtr->buffer)->fLink;
564 if ( ((NodeDescPtr)nodePtr->buffer)->kind != kBTMapNode)
576 if ( ((NodeDescPtr)nodePtr->buffer)->kind != kBTHeaderNode)
|
Completed in 25 milliseconds