Lines Matching refs:Reductions
212 // The set of all reductions, and state tracking of possible reductions
222 // Setup to track possible reductions corresponding to the provided
223 // rerolling scale. Only reductions with a number of non-PHI instructions
226 // - A set of all possible instructions in eligible reductions.
227 // - A set of all PHIs in eligible reductions
228 // - A set of all reduced values (last instructions) in eligible reductions.
254 // Are the two instructions both from reductions, and furthermore, from
280 "Recording pair from different reductions?");
286 // instructions in the loop, and we know which reductions were selected.
308 // The vector of all possible reductions (for any scale).
318 ReductionTracker &Reductions);
337 ReductionTracker &Reductions);
441 ReductionTracker &Reductions) {
456 Reductions.addSLR(SLR);
653 // Validate the selected reductions. All iterations must have an isomorphic
654 // part of the reduction chain and, for non-associative reductions, the chain
698 // For all selected reductions, remove all parts except those in the first
701 // reductions).
703 // Fixup reductions to refer to the last instruction associated with the
767 // roots, belong to simple latch code, parts of validated reductions, part of
768 // f(%iv) or part of some f(%iv.i). If all of that is true (and all reductions
772 ReductionTracker &Reductions) {
803 // An array of just the possible reductions for this scale factor. When we
810 Reductions.restrictToScale(Scale, PossibleRedSet, PossibleRedPHISet,
941 // within the iteration does not matter). For non-associative reductions,
948 bool InReduction = Reductions.isPairInSame(J1, J2);
960 if (Reductions.isPairInSame(J2, Op2I))
1003 Reductions.recordPair(J1, J2, i+1);
1039 if (Reductions.isSelectedPHI(J))
1054 if (!Reductions.validateSelected())
1060 Reductions.replaceSelected();
1171 ReductionTracker Reductions;
1172 collectPossibleReductions(L, Reductions);
1178 if (reroll(*I, L, Header, IterCount, Reductions)) {
