Lines Matching defs:DAG
315 DenseMap<ValuePair, size_t> &DAG,
326 DenseMap<ValuePair, size_t> &DAG, ValuePair J);
776 // the pairing with the largest dag meeting the depth requirement on at
777 // least one branch. Then select all pairings that are part of that dag
951 // in the use dag of I.
1455 // if B is in the use dag of A. If B is in the use dag of A, then B
1575 // This function builds the initial dag of connected pairs with the
1584 DenseMap<ValuePair, size_t> &DAG, ValuePair J) {
1585 // Each of these pairs is viewed as the root node of a DAG. The DAG
1587 // the pairs that compose the DAG and the maximum depth of the DAG.
1604 DenseMap<ValuePair, size_t>::iterator C = DAG.find(*k);
1605 if (C == DAG.end()) {
1616 // Record the current pair as part of the DAG:
1617 DAG.insert(ValuePairWithDepth(QTop.first, MaxChildDepth));
1623 // Given some initial dag, prune it by removing conflicting pairs (pairs
1633 DenseMap<ValuePair, size_t> &DAG,
1652 DenseMap<ValuePair, size_t>::iterator C = DAG.find(*K);
1653 if (C == DAG.end()) continue;
1655 // This child is in the DAG, now we need to make sure it is the
1669 // make sure that a child pair added to the DAG is not
1702 // selected for the DAG. If that is the case, ignore this child.
1760 // walk the use dag to see if we again reach the current pair. If we
1797 // This function finds the best dag of mututally-compatible connected
1823 // near the DAG pruning for more details).
1843 DenseMap<ValuePair, size_t> DAG;
1846 PairableInstUsers, ChosenPairs, DAG, IJ);
1849 // depth is still the same in the unpruned DAG.
1850 size_t MaxDepth = DAG.lookup(IJ);
1852 DEBUG(if (DebugPairSelection) dbgs() << "BBV: found DAG for pair {"
1854 MaxDepth << " and size " << DAG.size() << "\n");
1856 // At this point the DAG has been constructed, but, may contain
1858 // some dag node may be attempting to fuse the same instruction).
1859 // So now we walk the dag again, in the case of a conflict,
1867 ChosenPairs, DAG, PrunedDAG, IJ, UseCycleCheck);
2154 "\tNo non-trivial instructions in DAG;"
2165 dbgs() << "BBV: found pruned DAG for pair {"
2213 // The best pair to choose and its dag:
2229 // A dag has been chosen (or not) at this point. If no dag was
2233 DEBUG(dbgs() << "BBV: selected pairs in the best DAG for: "
2238 // Insert the members of this dag into the list of chosen pairs.
2243 // Remove all candidate pairs that have values in the chosen dag.
3154 // The use dag of the first original instruction must be moved to after
3155 // the location of the second instruction. The entire use dag of the
3156 // first instruction is disjoint from the input dag of the second
