564     int         i, j, nTaxa;  in AddTreeToPartitionCounters()  local
568         nTaxa = tree->nNodes - tree->nIntNodes - 1;  in AddTreeToPartitionCounters()
570         nTaxa = tree->nNodes - tree->nIntNodes;  in AddTreeToPartitionCounters()
572     for (i=0; i<nTaxa; i++)  in AddTreeToPartitionCounters()
2133     int         i, j, n, nTaxa, nLongsNeeded;  in CopyTrees()  local
2148                 nTaxa = from->nNodes - from->nIntNodes;  in CopyTrees()
2150                 nTaxa = from->nNodes - from->nIntNodes - 1;  in CopyTrees()
2151             nLongsNeeded = (int)((nTaxa - 1) / nBitsInALong) + 1;  in CopyTrees()
15228     int         i, j, nTaxa;  in RemoveTreeFromPartitionCounters()  local
15232         nTaxa = tree->nNodes - tree->nIntNodes - 1;  in RemoveTreeFromPartitionCounters()
15234         nTaxa = tree->nNodes - tree->nIntNodes;  in RemoveTreeFromPartitionCounters()
15236     for (i=0; i<nTaxa; i++)  in RemoveTreeFromPartitionCounters()