Lines Matching defs:FusionCandidates

31 /// This implementation creates FusionCandidates that represent the loop and the
179   /// are used to establish ordering of the FusionCandidates based on dominance.
360   // now, since once FusionCandidates are put into the FusionCandidateSet they
420     // If two FusionCandidates are in the same level of dominator tree,
422     // equivalent. To sort those FusionCandidates, nonStrictlyPostDominate()
430       // FusionCandidates then, Order of FusionCandidate can be
442     // two FusionCandidates. Thus, they should not be in the same set together.
456 // loops, those loops will be moved also. The corresponding FusionCandidates
483 printFusionCandidates(const FusionCandidateCollection &FusionCandidates) {
485   for (const auto &CandidateSet : FusionCandidates) {
564   FusionCandidateCollection FusionCandidates;
632       FusionCandidates.clear();
675       // Go through each list in FusionCandidates and determine if L is control
679       // FusionCandidates.
682       for (auto &CurrCandSet : FusionCandidates) {
695         // No set was found. Create a new set and add to FusionCandidates
702         FusionCandidates.push_back(NewCandSet);
859     LLVM_DEBUG(printFusionCandidates(FusionCandidates));
860     for (auto &CandidateSet : FusionCandidates) {