332   CostType calculateCost(const BitVector &BV) const;
440   void getDependencies(BitVector &BV) const {  in getDependencies()
441     visitAllDependencies([&](const Node &N) { BV.set(N.getID()); });  in getDependencies()
689   BitVector BV = createNodesBitVector();  in verifyGraph()  local
692       N->getDependencies(BV);  in verifyGraph()
705   if (!BV.all()) {  in verifyGraph()
714 CostType SplitGraph::calculateCost(const BitVector &BV) const {  in calculateCost()
716   for (unsigned NodeID : BV.set_bits())  in calculateCost()
774   void add(unsigned PID, const BitVector &BV) {  in add()  argument
775     Partitions[PID].second |= BV;  in add()
927     WorkListEntry(const BitVector &BV) : Cluster(BV) {}  in WorkListEntry()
1181     BitVector BV = SP[PID];  in findMostSimilarPartition()  local
1182     BV &= Entry.Cluster; // FIXME: & doesn't work between BVs?!  in findMostSimilarPartition()
1184     if (BV.none())  in findMostSimilarPartition()
1187     const CostType Cost = SG.calculateCost(BV);  in findMostSimilarPartition()