/macosx-10.10/xnu-2782.1.97/bsd/hfs/ |
H A D | hfs_endian.c | 97 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 D | hfs_btreeio.c | 798 ndp->numRecords = 3; 867 ndp->numRecords = 1;
|
/macosx-10.10/hfs-285/fsck_hfs/dfalib/ |
H A D | hfs_endian.c | 244 srcDesc->numRecords = SWAP_BE16 (srcDesc->numRecords); 249 srcOffs = (UInt16 *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords + 1) * sizeof (UInt16)))); 256 if (debug) plog("hfs_swap_BTNode: invalid record count (0x%04X)\n", srcDesc->numRecords); 265 for (i = 0; i <= srcDesc->numRecords; i++) { 275 if (debug) plog("hfs_swap_BTNode: record #%d invalid offset (0x%04X)\n", srcDesc->numRecords-i-1, srcOffs[i]); 287 srcDesc->numRecords-i-1, srcDesc->numRecords-i, srcOffs[i], srcOffs[i-1]); 374 srcOffs = (UInt16 *)((char *)src->buffer + (src->blockSize - ((srcDesc->numRecords + 1) * sizeof (UInt16)))); 381 if (debug) plog("hfs_UNswap_BTNode: invalid record count (0x%04X)\n", srcDesc->numRecords); [all...] |
H A D | BTreeNodeOps.c | 434 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); 519 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); 595 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); 643 upperBound = node->numRecords - 1; 702 // Make sure index is valid (in range 0..numRecords-1) 704 if (index >= node->numRecords) 745 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); 747 return freeOffset + (node->numRecords << 1) - sizeof (BTNodeDescriptor); 768 freeOffset = GetRecordOffset (btreePtr, node, node->numRecords); //�� inline? 770 return btreePtr->nodeSize - freeOffset - (node->numRecords << [all...] |
H A D | BTreeMiscOps.c | 275 ((NodeDescPtr) middle->buffer)->numRecords <= 0 ) 301 ((NodeDescPtr) left->buffer)->numRecords <= 0 ) 321 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords) 338 else if (index >= ((NodeDescPtr) middle->buffer)->numRecords) 351 ((NodeDescPtr) right->buffer)->numRecords <= 0 ) 357 if (rightIndex >= ((NodeDescPtr) right->buffer)->numRecords) // we're lost 462 insert position is greater than 0 and less than numRecords, the record
|
H A D | BTreeTreeOps.c | 726 if ( targetNodePtr->numRecords == 0 ) // did we delete the last record? 788 else if ( ((NodeDescPtr)targetNode->buffer)->numRecords == 1 ) 864 if ( ((NodeDescPtr)blockPtr->buffer)->numRecords > 1) 1029 leftInsertIndex = leftNode->numRecords; 1233 recordFit = InsertRecord (btreePtr, leftNode, leftNode->numRecords, recPtr, size); 1529 moveIndex = leftNodePtr->numRecords; // start at last record in the node 1586 index = leftNodePtr->numRecords; 1592 if ( leftNodePtr->numRecords == leftInsertIndex ) 1714 size = GetRecordSize( btreePtr, leftNodePtr, leftNodePtr->numRecords - 1 ) ; 1715 recPtr = GetRecordAddress( btreePtr, leftNodePtr, leftNodePtr->numRecords [all...] |
H A D | SRebuildBTree.c | 139 UInt32 numRecords = 0; local 322 plog( "%s - numRecords = %d\n", __FUNCTION__, numRecords); 339 numRecords++; 341 if (debug && ((numRecords % 1000) == 0)) 342 plog("btree file %d: %u records\n", FileID, numRecords); 349 plog( "\n%s - rebuild btree %u %u records elapsed time \n", __FUNCTION__, FileID, numRecords ); 618 myNodeDescPtr->numRecords = 3; 736 myNodeDescPtr->numRecords = 1; 1106 plog( " numRecords [all...] |
H A D | BTree.c | 263 header->node.numRecords = 3; // header rec, key desc, map rec 713 ((BTNodeDescriptor*) node.buffer)->numRecords > 0 ) 717 //�� if !foundRecord, we could still skip tree search if ( 0 < index < numRecords ) 746 ((BTNodeDescriptor*) node.buffer)->numRecords > 0 ) 941 ((NodeDescPtr) node.buffer)->numRecords <= 0 ) 952 else index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1; 995 index = ((NodeDescPtr) node.buffer)->numRecords -1; 1002 (index == ((NodeDescPtr) node.buffer)->numRecords)) 1009 if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords)) 1013 if (index < ((NodeDescPtr) node.buffer)->numRecords [all...] |
H A D | SVerify2.c | 282 if ( nodeDescP->numRecords != Num_HRecs ) 622 numRecs = nodeDescP->numRecords; 739 leafRecords += nodeDescP->numRecords; 746 for (i = 0; i < nodeDescP->numRecords; i++) { 848 if ( nodeDescP->numRecords != Num_MRecs ) 852 plog("Expected %d records in node, found %d\n", Num_MRecs, nodeDescP->numRecords); 1265 if ( nodeP->numRecords == 0 ) 1278 for ( index = 0; index < nodeP->numRecords; index++) 1325 for (index = 0; index < nodeP->numRecords; ++index)
|
H A D | BTree.h | 290 ItemCount numRecords; member in struct:BTreeInfoRec
|
H A D | BTreeAllocate.c | 352 ((NodeDescPtr)newNode.buffer)->numRecords = 1;
|
/macosx-10.10/xnu-2782.1.97/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);
|
/macosx-10.10/Security-57031.1.35/SecurityTests/cspxutils/dbVerifyKey/ |
H A D | dbVerifyKey.cpp | 53 unsigned numRecords, // zero or one 86 if(numRecords == 0) { 95 if(numRecords == 0) { 51 doVerify( CSSM_DL_DB_HANDLE dlDbHand, unsigned numRecords, CSSM_DB_RECORDTYPE recordType, uint32 keySize, CSSM_ALGORITHMS keyAlg) argument
|
/macosx-10.10/Security-57031.1.35/Security/include/security_filedb/ |
H A D | DbIndex.cpp | 151 uint32 numRecords = indexSection.at(offset); local 153 mKeyOffsetVector.overlay(numRecords, 154 reinterpret_cast<const Atom *>(indexSection.range(Range(offset, numRecords * AtomSize)))); 156 offset += numRecords * AtomSize; 157 mRecordNumberVector.overlay(numRecords, 158 reinterpret_cast<const Atom *>(indexSection.range(Range(offset, numRecords * AtomSize)))); 314 size_t numRecords = index.mKeyOffsetVector.size(); local 315 for (size_t i = 0; i < numRecords; i++) {
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_filedb/lib/ |
H A D | DbIndex.cpp | 151 uint32 numRecords = indexSection.at(offset); local 153 mKeyOffsetVector.overlay(numRecords, 154 reinterpret_cast<const Atom *>(indexSection.range(Range(offset, numRecords * AtomSize)))); 156 offset += numRecords * AtomSize; 157 mRecordNumberVector.overlay(numRecords, 158 reinterpret_cast<const Atom *>(indexSection.range(Range(offset, numRecords * AtomSize)))); 314 size_t numRecords = index.mKeyOffsetVector.size(); local 315 for (size_t i = 0; i < numRecords; i++) {
|
/macosx-10.10/hfs-285/CopyHFSMeta/ |
H A D | ScanExtents.c | 135 int numRecords; local 146 numRecords = S16(descp->numRecords); 150 for (indx = 1; indx <= numRecords; indx++) {
|
H A D | util.c | 334 for (counter = 1; counter <= S16(ndp->numRecords); counter++) { 388 for (counter = 1; counter <= S16(ndp->numRecords); counter++) {
|
/macosx-10.10/JavaScriptCore-7600.1.17/ftl/ |
H A D | FTLStackMaps.cpp | 204 uint32_t numRecords; local 209 numRecords = context.view->read<uint32_t>(context.offset, true); 220 numRecords = context.view->read<uint32_t>(context.offset, true); 221 while (numRecords--) {
|
/macosx-10.10/Security-57031.1.35/SecurityTests/clxutils/ocspdTool/ |
H A D | ocspdTool.cpp | 368 unsigned numRecords = 0; local 410 numRecords++; 429 numRecords++; 443 printf("...%u records deleted\n", numRecords);
|
/macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/headers/ |
H A D | BTreesInternal.h | 243 ItemCount numRecords; member in struct:BTreeInfoRec
|
/macosx-10.10/hfs-285/newfs_hfs/ |
H A D | makehfs.c | 1040 ndp->numRecords = SWAP_BE16 (3); 1135 ndp->numRecords = SWAP_BE16(numOverflowExtents); 1199 ndp->numRecords = SWAP_BE16 (3); 1296 ndp->numRecords = SWAP_BE16(1); 1493 ndp->numRecords = SWAP_BE16 (3); 1595 ndp->numRecords = SWAP_BE16 (dp->journaledHFS ? 6 : 2); 1795 nd->numRecords = SWAP_BE16 (1);
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_mds/lib/ |
H A D | MDSSession.cpp | 1654 size_t numRecords = tbdRecords.size(); local 1655 for(size_t i=0; i<numRecords; i++) { 1660 for(size_t i=0; i<numRecords; i++) {
|