Lines Matching refs:MatchDag
84 const GIMatchDag &MatchDag, void *Data) in GIMatchTreeBuilderLeafInfo() argument
85 : Builder(Builder), Info(Name, RootIdx, Data), MatchDag(MatchDag), in GIMatchTreeBuilderLeafInfo()
86 RemainingInstrNodes(BitVector(MatchDag.getNumInstrNodes(), true)), in GIMatchTreeBuilderLeafInfo()
87 RemainingEdges(BitVector(MatchDag.getNumEdges(), true)), in GIMatchTreeBuilderLeafInfo()
88 RemainingPredicates(BitVector(MatchDag.getNumPredicates(), true)), in GIMatchTreeBuilderLeafInfo()
89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
90 TestablePredicates(MatchDag.getNumPredicates()) { in GIMatchTreeBuilderLeafInfo()
92 for (auto &P : enumerate(MatchDag.predicates())) { in GIMatchTreeBuilderLeafInfo()
98 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in GIMatchTreeBuilderLeafInfo()
101 UnsatisfiedPredDepsForPred.resize(MatchDag.getNumPredicates(), in GIMatchTreeBuilderLeafInfo()
103 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in GIMatchTreeBuilderLeafInfo()
124 const auto &NodeI = find(MatchDag.instr_nodes(), Instr); in declareInstr()
125 assert(NodeI != MatchDag.instr_nodes_end() && "Instr isn't in this DAG"); in declareInstr()
126 unsigned InstrIdx = MatchDag.getInstrNodeIdx(NodeI); in declareInstr()
137 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in declareInstr()
160 for (auto &E : enumerate(MatchDag.edges())) { in declareOperand()
171 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in declareOperand()