Lines Matching refs:numParts
81 mainHeader.numParts = 0;
82 numParts = 0;
105 mainHeader.numParts = 0;
106 numParts = 0;
123 numParts = orig.numParts;
144 partitions = new GPTPart [numParts];
150 for (i = 0; i < numParts; i++) {
252 if (mainHeader.numParts != secondHeader.numParts) {
254 cout << "\nProblem: main GPT header's number of partitions (" << mainHeader.numParts
256 << secondHeader.numParts << ")\n"
319 for (i = 0; i < numParts; i++) {
358 for (i = 0; i < numParts; i++) {
514 crc = chksum_crc32((unsigned char*) partitions, numParts * GPT_SIZE);
556 mainHeader.numParts = secondHeader.numParts;
561 SetGPTSize(mainHeader.numParts, 0);
577 secondHeader.numParts = mainHeader.numParts;
582 SetGPTSize(secondHeader.numParts, 0);
599 if ((j < numParts) && (partitions[j].GetFirstLBA() == mbrFirst) &&
603 } while ((!found) && (j < numParts));
628 for (i = 1; i < numParts; i++) {
653 for (i = 0; i < numParts; i++) {
933 if (allOK && (numParts != tempHeader.numParts) && *crcOk) {
934 allOK = SetGPTSize(tempHeader.numParts, 0);
957 retval = SetGPTSize(header.numParts, 0);
959 sizeOfParts = header.numParts * header.sizeOfPartitionEntries;
996 partsToCheck = new GPTPart[header->numParts];
997 sizeOfParts = header->numParts * header->sizeOfPartitionEntries;
1246 if (disk.Write(partitions, mainHeader.sizeOfPartitionEntries * numParts) == -1)
1275 (mainHeader.numParts * mainHeader.sizeOfPartitionEntries) + 1024);
1290 SetGPTSize(secondHeader.numParts, 0);
1292 SetGPTSize(mainHeader.numParts, 0);
1345 tableSize = numParts * mainHeader.sizeOfPartitionEntries;
1438 cout << "Partition table holds up to " << numParts << " entries\n";
1446 for (i = 0; i < numParts; i++) {
1453 if ((partNum < numParts) && !IsFreePartNum(partNum)) {
1550 if (numParts > MAX_MBR_PARTS)
1553 numToConvert = numParts;
1645 if (gptPart >= numParts) {
1703 if (((numEntries != numParts) || (partitions == NULL)) && (numEntries > 0)) {
1716 if (numEntries < numParts)
1719 copyNum = numParts;
1729 numParts = numEntries;
1740 mainHeader.numParts = numParts;
1741 secondHeader.numParts = numParts;
1749 for (i = 0; i < numParts; i++) {
1805 if (numParts > 0)
1806 sort(partitions, partitions + numParts);
1818 if ((partNum1 < numParts) && (partNum2 < numParts)) {
1928 if (pn < numParts) {
1944 for (i = 0; i < numParts; i++)
2036 *low = numParts + 1; // code for "not found"
2038 for (i = 0; i < numParts; i++) {
2042 if (*low == (numParts + 1)) *low = i;
2049 if (*low == (numParts + 1))
2060 while ((i < (int) numParts) && (partitions[i].IsUsed()))
2062 if (i >= (int) numParts)
2072 for (i = 0; i < numParts; i++) {
2106 for (i = 0; i < numParts; i++) {
2156 for (i = 0; i < numParts; i++) {
2175 for (i = 0; i < numParts; i++) {
2222 for (i = 0; i < numParts; i++) {
2241 return ((partNum < numParts) && (partitions != NULL) &&
2247 return ((partNum < numParts) && (partitions != NULL) &&
2286 for (i = 0; i < numParts; i++) {
2322 ReverseBytes(&header->numParts, 4);
2332 for (i = 0; i < numParts; i++) {
2339 if (partNum >= numParts) {
2349 if (partNum >= numParts) {
2351 << numParts << " available)\n";
2374 if (partNum >= (int) numParts) {
2398 if ((partNum < numParts) && partitions[partNum].IsUsed())
2404 if (partNum < numParts)