Lines Matching defs:PID

769   const BitVector &operator[](unsigned PID) const {
770     return Partitions[PID].second;
773   void add(unsigned PID, const BitVector &BV) {
774     Partitions[PID].second |= BV;
775     updateScore(PID);
818   void updateScore(unsigned PID) {
846   for (const auto &[PID, Part] : enumerate(Partitions)) {
848     OS << "  - P" << PID << " nodes:" << NodeIDs.count() << " cost: " << Cost
950   /// \return A pair: first element is the PID of the partition that has the
1093     if (MostSimilarPID == InvalidPID) // no similar PID found
1095     else if (MostSimilarPID == CheapestPID) // both landed on the same PID
1179   for (unsigned PID = 0; PID < NumParts; ++PID) {
1180     BitVector BV = SP[PID];
1189         (ChosenCost == Cost && PID > ChosenPID)) {
1190       ChosenPID = PID;
1481   for (unsigned PID = 0; PID < NumParts; ++PID) {
1487     for (unsigned NodeID : (*Proposal)[PID].set_bits())
1504           return needsConservativeImport(GV) || PID == 0;
1517       printPartitionSummary(*SummariesOS, PID, *MPart, PartCost, ModuleCost);
1520         printPartitionSummary(dbgs(), PID, *MPart, PartCost, ModuleCost));