Searched refs:numRecords (Results 1 - 10 of 10) sorted by relevance
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/ |
H A D | hfs_endian.c | 170 srcDesc->numRecords = SWAP_BE16 (srcDesc->numRecords); 175 srcOffs = (u_int16_t *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords + 1) * sizeof (u_int16_t)))); 182 printf("hfs_swap_BTNode: invalid record count (0x%04X)\n", srcDesc->numRecords); 190 for (i = 0; i <= srcDesc->numRecords; i++) { 204 printf("hfs_swap_BTNode: record #%d invalid offset (0x%04X)\n", srcDesc->numRecords-i-1, srcOffs[i]); 215 srcDesc->numRecords-i-1, srcDesc->numRecords-i, srcOffs[i], srcOffs[i-1]); 327 srcOffs = (u_int16_t *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords + 1) * sizeof (u_int16_t)))); 334 panic("hfs_UNswap_BTNode: invalid record count (0x%04X)\n", srcDesc->numRecords); [all...] |
H A D | hfs_format.h | 685 u_int16_t numRecords; /* number of records in this node*/ member in struct:BTNodeDescriptor
|
H A D | hfs_hotfiles.c | 1501 if (btinfo.numRecords < 2) { 1507 numrecs = (btinfo.numRecords /= 2) - 1; 1590 printf("hfs_agehotfiles: aged %d records out of %d\n", aged, btinfo.numRecords); 1839 ndp->numRecords = SWAP_BE16 (3);
|
H A D | hfs_btreeio.c | 705 ndp->numRecords = 3;
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeNodeOps.c | 516 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 D | BTreeMiscOps.c | 366 ((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 D | BTree.c | 511 ((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 D | BTreeTreeOps.c | 729 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 D | BTreeAllocate.c | 417 ((NodeDescPtr)newNode.buffer)->numRecords = 1;
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/ |
H A D | BTreesInternal.h | 243 ItemCount numRecords; member in struct:BTreeInfoRec
|
Completed in 54 milliseconds