86       RemainingInstrNodes(BitVector(MatchDag.getNumInstrNodes(), true)),  in GIMatchTreeBuilderLeafInfo()
87       RemainingEdges(BitVector(MatchDag.getNumEdges(), true)),  in GIMatchTreeBuilderLeafInfo()
88       RemainingPredicates(BitVector(MatchDag.getNumPredicates(), true)),  in GIMatchTreeBuilderLeafInfo()
102                                     BitVector(PredicateDepIDs.size()));  in GIMatchTreeBuilderLeafInfo()
397     BitVector TestedPredicatesForLeaf(  in repartition()
469           BitVector Contents(Leaves.size());  in repartition()
493         BitVector Contents(Leaves.size());  in repartition()
510       BitVector Contents(Leaves.size());  in repartition()
522         BitVector Contents(Leaves.size());  in repartition()
537   BitVector PossibleLeaves = getPossibleLeavesForPartition(PartitionIdx);  in applyForPartition()
567   BitVector ReferencedOperands(1);  in applyForPartition()
644     P = Partitions.insert(std::make_pair(I->second, BitVector())).first;  in addToPartition()
655     BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges());  in repartition()
708   BitVector PossibleLeaves = getPossibleLeavesForPartition(PartitionIdx);  in applyForPartition()
710   std::vector<BitVector> TraversedEdgesByNewLeaves;  in applyForPartition()