Lines Matching defs:numParts
84 mainHeader.numParts = 0;
87 numParts = 0;
98 numParts = orig.numParts;
120 partitions = new GPTPart [numParts];
126 for (i = 0; i < numParts; i++) {
149 mainHeader.numParts = 0;
151 numParts = 0;
169 numParts = orig.numParts;
191 partitions = new GPTPart [numParts];
197 for (i = 0; i < numParts; i++) {
300 if (mainHeader.numParts != secondHeader.numParts) {
302 cout << "\nProblem: main GPT header's number of partitions (" << mainHeader.numParts
304 << secondHeader.numParts << ")\n"
365 if (mainHeader.sizeOfPartitionEntries * mainHeader.numParts < 16384) {
366 cout << "\nWarning: The size of the partition table (" << mainHeader.sizeOfPartitionEntries * mainHeader.numParts
418 for (i = 0; i < numParts; i++) {
462 for (i = 0; i < numParts; i++) {
618 crc = chksum_crc32((unsigned char*) partitions, numParts * GPT_SIZE);
659 mainHeader.numParts = secondHeader.numParts;
665 SetGPTSize(mainHeader.numParts, 0);
681 secondHeader.numParts = mainHeader.numParts;
686 SetGPTSize(secondHeader.numParts, 0);
703 if ((j < numParts) && (partitions[j].GetFirstLBA() == mbrFirst) &&
707 } while ((!found) && (j < numParts));
732 for (i = 1; i < numParts; i++) {
757 for (i = 0; i < numParts; i++) {
1087 if (allOK && (numParts != tempHeader.numParts) && *crcOk) {
1088 allOK = SetGPTSize(tempHeader.numParts, 0);
1114 retval = SetGPTSize(header.numParts, 0);
1116 sizeOfParts = header.numParts * header.sizeOfPartitionEntries;
1153 partsToCheck = new GPTPart[header->numParts];
1154 sizeOfParts = header->numParts * header->sizeOfPartitionEntries;
1403 if (disk.Write(partitions, mainHeader.sizeOfPartitionEntries * numParts) == -1)
1432 (mainHeader.numParts * mainHeader.sizeOfPartitionEntries) + 1024);
1447 SetGPTSize(secondHeader.numParts, 0);
1449 SetGPTSize(mainHeader.numParts, 0);
1502 tableSize = numParts * mainHeader.sizeOfPartitionEntries;
1600 cout << "Partition table holds up to " << numParts << " entries\n";
1610 for (i = 0; i < numParts; i++) {
1617 if ((partNum < numParts) && !IsFreePartNum(partNum)) {
1714 if (numParts > MAX_MBR_PARTS)
1717 numToConvert = numParts;
1809 if (gptPart >= numParts) {
1867 if (((numEntries != numParts) || (partitions == NULL)) && (numEntries > 0)) {
1880 if (numEntries < numParts)
1883 copyNum = numParts;
1893 numParts = numEntries;
1904 mainHeader.numParts = numParts;
1905 secondHeader.numParts = numParts;
1947 for (i = 0; i < numParts; i++) {
2003 if (numParts > 0)
2004 sort(partitions, partitions + numParts);
2016 if ((partNum1 < numParts) && (partNum2 < numParts)) {
2127 if (pn < numParts) {
2143 for (i = 0; i < numParts; i++)
2233 *low = numParts + 1; // code for "not found"
2235 for (i = 0; i < numParts; i++) {
2239 if (*low == (numParts + 1)) *low = i;
2246 if (*low == (numParts + 1))
2257 while ((i < (int) numParts) && (partitions[i].IsUsed()))
2259 if (i >= (int) numParts)
2269 for (i = 0; i < numParts; i++) {
2303 for (i = 0; i < numParts; i++) {
2322 for (i = 0; i < numParts; i++) {
2336 for (i = 0; i < numParts; i++) {
2381 for (i = 0; i < numParts; i++) {
2404 for (i = 0; i < numParts; i++) {
2457 for (i = 0; i < numParts; i++) {
2476 return ((partNum < numParts) && (partitions != NULL) &&
2482 return ((partNum < numParts) && (partitions != NULL) &&
2532 for (i = 0; i < numParts; i++) {
2568 ReverseBytes(&header->numParts, 4);
2578 for (i = 0; i < numParts; i++) {
2585 if (partNum >= numParts) {
2595 if (partNum >= numParts) {
2597 << numParts << " available)\n";
2620 if (partNum >= (int) numParts) {
2644 if ((partNum < numParts) && partitions[partNum].IsUsed())
2650 if (partNum < numParts)