Lines Matching refs:bthp
1022 BTHeaderRec *bthp;
1047 bthp = (BTHeaderRec *)((UInt8 *)buffer + offset);
1049 bthp->treeDepth = SWAP_BE16(1);
1050 bthp->rootNode = SWAP_BE32(1);
1051 bthp->firstLeafNode = SWAP_BE32(1);
1052 bthp->lastLeafNode = SWAP_BE32(1);
1053 bthp->leafRecords = SWAP_BE32(numOverflowExtents);
1055 bthp->treeDepth = 0;
1056 bthp->rootNode = 0;
1057 bthp->firstLeafNode = 0;
1058 bthp->lastLeafNode = 0;
1059 bthp->leafRecords = 0;
1062 bthp->nodeSize = SWAP_BE16 (nodeSize);
1063 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize);
1064 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - (numOverflowExtents ? 2 : 1)); /* header */
1065 bthp->clumpSize = SWAP_BE32 (fileSize);
1067 bthp->attributes |= SWAP_BE32 (kBTBigKeysMask);
1068 bthp->maxKeyLength = SWAP_BE16 (kHFSPlusExtentKeyMaximumLength);
1085 if (SWAP_BE32 (bthp->totalNodes) > nodeBitsInHeader) {
1088 ndp->fLink = SWAP_BE32 (SWAP_BE32 (bthp->lastLeafNode) + 1);
1093 *mapNodes = (SWAP_BE32 (bthp->totalNodes) - nodeBitsInHeader +
1095 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->freeNodes) - *mapNodes);
1104 temp = SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes);
1147 *bytesUsed = (SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes) - *mapNodes) * nodeSize;
1167 BTHeaderRec *bthp;
1206 bthp = (BTHeaderRec *)((UInt8 *)buffer + offset);
1208 bthp->treeDepth = SWAP_BE16(1);
1209 bthp->rootNode = SWAP_BE32(1);
1210 bthp->firstLeafNode = SWAP_BE32(1);
1211 bthp->lastLeafNode = SWAP_BE32(1);
1212 bthp->leafRecords = SWAP_BE32(1);
1215 bthp->treeDepth = 0;
1216 bthp->rootNode = 0;
1217 bthp->firstLeafNode = 0;
1218 bthp->lastLeafNode = 0;
1219 bthp->leafRecords = 0;
1222 bthp->nodeSize = SWAP_BE16 (nodeSize);
1223 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize);
1226 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - 2);
1230 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - 1);
1232 bthp->clumpSize = SWAP_BE32 (fileSize);
1234 bthp->attributes |= SWAP_BE32 (kBTBigKeysMask | kBTVariableIndexKeysMask);
1235 bthp->maxKeyLength = SWAP_BE16 (kHFSPlusAttrKeyMaximumLength);
1252 if (SWAP_BE32 (bthp->totalNodes) > nodeBitsInHeader) {
1255 ndp->fLink = SWAP_BE32 (SWAP_BE32 (bthp->lastLeafNode) + 1);
1260 *mapNodes = (SWAP_BE32 (bthp->totalNodes) - nodeBitsInHeader +
1262 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->freeNodes) - *mapNodes);
1271 temp = SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes);
1333 *bytesUsed = (SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes) - *mapNodes) * nodeSize;
1475 BTHeaderRec *bthp;
1500 bthp = (BTHeaderRec *)((UInt8 *)buffer + offset);
1501 bthp->treeDepth = SWAP_BE16 (1);
1502 bthp->rootNode = SWAP_BE32 (1);
1503 bthp->firstLeafNode = SWAP_BE32 (1);
1504 bthp->lastLeafNode = SWAP_BE32 (1);
1505 bthp->leafRecords = SWAP_BE32 (dp->journaledHFS ? 6 : 2);
1506 bthp->nodeSize = SWAP_BE16 (nodeSize);
1507 bthp->totalNodes = SWAP_BE32 (fileSize / nodeSize);
1508 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->totalNodes) - 2); /* header and root */
1509 bthp->clumpSize = SWAP_BE32 (fileSize);
1512 bthp->attributes |= SWAP_BE32 (kBTVariableIndexKeysMask + kBTBigKeysMask);
1513 bthp->maxKeyLength = SWAP_BE16 (kHFSPlusCatalogKeyMaximumLength);
1515 bthp->keyCompareType = kHFSBinaryCompare;
1517 bthp->keyCompareType = kHFSCaseFolding;
1534 if (SWAP_BE32 (bthp->totalNodes) > nodeBitsInHeader) {
1537 ndp->fLink = SWAP_BE32 (SWAP_BE32 (bthp->lastLeafNode) + 1);
1542 *mapNodes = (SWAP_BE32 (bthp->totalNodes) - nodeBitsInHeader +
1544 bthp->freeNodes = SWAP_BE32 (SWAP_BE32 (bthp->freeNodes) - *mapNodes);
1552 temp = SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes);
1563 *bytesUsed = (SWAP_BE32 (bthp->totalNodes) - SWAP_BE32 (bthp->freeNodes) - *mapNodes) * nodeSize;