Searched refs:numRecords (Results 1 - 10 of 10) sorted by relevance

/xnu-2782.1.97/bsd/hfs/
H A Dhfs_endian.c97 u_int16_t i; /* index to match srcDesc->numRecords */
175 srcDesc->numRecords = SWAP_BE16 (srcDesc->numRecords);
180 srcOffs = (u_int16_t *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords + 1) * sizeof (u_int16_t))));
187 printf("hfs_swap_BTNode: invalid record count (0x%04X)\n", srcDesc->numRecords);
195 for (i = 0; i <= srcDesc->numRecords; i++) {
209 printf("hfs_swap_BTNode: record #%d invalid offset (0x%04X)\n", srcDesc->numRecords-i-1, srcOffs[i]);
220 srcDesc->numRecords-i-1, srcDesc->numRecords-i, srcOffs[i], srcOffs[i-1]);
335 srcOffs = (u_int16_t *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords
[all...]
H A Dhfs_btreeio.c798 ndp->numRecords = 3;
867 ndp->numRecords = 1;
H A Dhfs_format.h718 u_int16_t numRecords; /* number of records in this node*/ member in struct:BTNodeDescriptor
H A Dhfs_hotfiles.c1550 if (btinfo.numRecords < 2) {
1556 numrecs = (btinfo.numRecords /= 2) - 1;
1639 printf("hfs_agehotfiles: aged %d records out of %d\n", aged, btinfo.numRecords);
1896 ndp->numRecords = SWAP_BE16 (3);
/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/
H A DBTreeNodeOps.c516 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords);
602 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords);
679 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords);
692 ClearMemory(GetRecordAddress(btreePtr, node, node->numRecords), bytesToMove);
732 upperBound = node->numRecords - 1;
788 // Make sure index is valid (in range 0..numRecords-1)
790 if (index >= node->numRecords)
831 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords);
833 return freeOffset + (node->numRecords << 1) - sizeof (BTNodeDescriptor);
854 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); //�� inlin
[all...]
H A DBTreeMiscOps.c366 ((NodeDescPtr) middle->buffer)->numRecords <= 0 )
403 ((NodeDescPtr) left->buffer)->numRecords <= 0 )
423 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords)
440 else if (index >= ((NodeDescPtr) middle->buffer)->numRecords)
453 ((NodeDescPtr) right->buffer)->numRecords <= 0 )
459 if (rightIndex >= ((NodeDescPtr) right->buffer)->numRecords) // we're lost
553 insert position is greater than 0 and less than numRecords, the record
H A DBTree.c511 ((BTNodeDescriptor*) node.buffer)->numRecords > 0 )
515 //�� if !foundRecord, we could still skip tree search if ( 0 < index < numRecords )
718 ((NodeDescPtr) node.buffer)->numRecords <= 0 )
730 else index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
785 index = ((NodeDescPtr) node.buffer)->numRecords -1;
792 (index == ((NodeDescPtr) node.buffer)->numRecords))
799 if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords))
803 if (index < ((NodeDescPtr) node.buffer)->numRecords -1)
836 (index >= ((NodeDescPtr) node.buffer)->numRecords))
1026 ((NodeDescPtr)node.buffer)->numRecords <
[all...]
H A DBTreeTreeOps.c729 if ( targetNodePtr->numRecords == 0 ) // did we delete the last record?
803 else if ( ((NodeDescPtr)targetNode->buffer)->numRecords == 1 )
885 if ( ((NodeDescPtr)blockPtr->buffer)->numRecords > 1)
1052 leftInsertIndex = leftNode->numRecords;
1245 recordFit = InsertRecord (btreePtr, leftNode, leftNode->numRecords, recPtr, size);
H A DBTreeAllocate.c417 ((NodeDescPtr)newNode.buffer)->numRecords = 1;
/xnu-2782.1.97/bsd/hfs/hfscommon/headers/
H A DBTreesInternal.h243 ItemCount numRecords; member in struct:BTreeInfoRec

Completed in 43 milliseconds