81    mainHeader.numParts = 0;  in GPTData()
82    numParts = 0;  in GPTData()
105    mainHeader.numParts = 0;  in GPTData()
106    numParts = 0;  in GPTData()
123    numParts = orig.numParts;  in operator =()
144    partitions = new GPTPart [numParts];  in operator =()
150    for (i = 0; i < numParts; i++) {  in operator =()
252    if (mainHeader.numParts != secondHeader.numParts) {  in Verify()
254       cout << "\nProblem: main GPT header's number of partitions (" << mainHeader.numParts  in Verify()
256            << secondHeader.numParts << ")\n"  in Verify()
319    for (i = 0; i < numParts; i++) {  in Verify()
358    for (i = 0; i < numParts; i++) {  in CheckGPTSize()
514    crc = chksum_crc32((unsigned char*) partitions, numParts * GPT_SIZE);  in RecomputeCRCs()
556    mainHeader.numParts = secondHeader.numParts;  in RebuildMainHeader()
561    SetGPTSize(mainHeader.numParts, 0);  in RebuildMainHeader()
577    secondHeader.numParts = mainHeader.numParts;  in RebuildSecondHeader()
582    SetGPTSize(secondHeader.numParts, 0);  in RebuildSecondHeader()
599             if ((j < numParts) && (partitions[j].GetFirstLBA() == mbrFirst) &&  in FindHybridMismatches()
603          } while ((!found) && (j < numParts));  in FindHybridMismatches()
628    for (i = 1; i < numParts; i++) {  in FindOverlaps()
653    for (i = 0; i < numParts; i++) {  in FindInsanePartitions()
933    if (allOK && (numParts != tempHeader.numParts) && *crcOk) {  in LoadHeader()
934       allOK = SetGPTSize(tempHeader.numParts, 0);  in LoadHeader()
957          retval = SetGPTSize(header.numParts, 0);  in LoadPartitionTable()
959          sizeOfParts = header.numParts * header.sizeOfPartitionEntries;  in LoadPartitionTable()
996       partsToCheck = new GPTPart[header->numParts];  in CheckTable()
997       sizeOfParts = header->numParts * header->sizeOfPartitionEntries;  in CheckTable()
1246       if (disk.Write(partitions, mainHeader.sizeOfPartitionEntries * numParts) == -1)  in SavePartitionTable()
1275                      (mainHeader.numParts * mainHeader.sizeOfPartitionEntries) + 1024);  in LoadGPTBackup()
1290             SetGPTSize(secondHeader.numParts, 0);  in LoadGPTBackup()
1292             SetGPTSize(mainHeader.numParts, 0);  in LoadGPTBackup()
1345       tableSize = numParts * mainHeader.sizeOfPartitionEntries;  in DestroyGPT()
1438    cout << "Partition table holds up to " << numParts << " entries\n";  in DisplayGPTData()
1446    for (i = 0; i < numParts; i++) {  in DisplayGPTData()
1453    if ((partNum < numParts) && !IsFreePartNum(partNum)) {  in ShowPartDetails()
1550    if (numParts > MAX_MBR_PARTS)  in XFormPartitions()
1553       numToConvert = numParts;  in XFormPartitions()
1645    if (gptPart >= numParts) {  in OnePartToMBR()
1703    if (((numEntries != numParts) || (partitions == NULL)) && (numEntries > 0)) {  in SetGPTSize()
1716                if (numEntries < numParts)  in SetGPTSize()
1719                   copyNum = numParts;  in SetGPTSize()
1729          numParts = numEntries;  in SetGPTSize()
1740    mainHeader.numParts = numParts;  in SetGPTSize()
1741    secondHeader.numParts = numParts;  in SetGPTSize()
1749    for (i = 0; i < numParts; i++) {  in BlankPartitions()
1805    if (numParts > 0)  in SortGPT()
1806       sort(partitions, partitions + numParts);  in SortGPT()
1818    if ((partNum1 < numParts) && (partNum2 < numParts)) {  in SwapPartitions()
1928    if (pn < numParts) {  in SetPartitionGUID()
1944    for (i = 0; i < numParts; i++)  in RandomizeGUIDs()
2036    *low = numParts + 1; // code for "not found"  in GetPartRange()
2038    for (i = 0; i < numParts; i++) {  in GetPartRange()
2042          if (*low == (numParts + 1)) *low = i;  in GetPartRange()
2049    if (*low == (numParts + 1))  in GetPartRange()
2060       while ((i < (int) numParts) && (partitions[i].IsUsed()))  in FindFirstFreePart()
2062       if (i >= (int) numParts)  in FindFirstFreePart()
2072    for (i = 0; i < numParts; i++) {  in CountParts()
2106       for (i = 0; i < numParts; i++) {  in FindFirstAvailable()
2156       for (i = 0; i < numParts; i++) {  in FindLastAvailable()
2175    for (i = 0; i < numParts; i++) {  in FindLastInFree()
2222    for (i = 0; i < numParts; i++) {  in IsFree()
2241    return ((partNum < numParts) && (partitions != NULL) &&  in IsFreePartNum()
2247    return ((partNum < numParts) && (partitions != NULL) &&  in IsUsedPartNum()
2286    for (i = 0; i < numParts; i++) {  in ComputeAlignment()
2322    ReverseBytes(&header->numParts, 4);  in ReverseHeaderBytes()
2332    for (i = 0; i < numParts; i++) {  in ReversePartitionBytes()
2339    if (partNum >= numParts) {  in ValidPartNum()
2349    if (partNum >= numParts) {  in operator []()
2351            << numParts << " available)\n";  in operator []()
2374    if (partNum >= (int) numParts) {  in ManageAttributes()
2398    if ((partNum < numParts) && partitions[partNum].IsUsed())  in ShowAttributes()
2404    if (partNum < numParts)  in GetAttribute()