Lines Matching defs:Uses
426 UsesTy Uses;
583 for (Use &U : I->uses()) {
586 // Ignore "wrap-around" uses to PHIs of this loop's header.
882 Uses[&I].resize(IL_End);
897 Uses[I].set(0);
912 Uses[I].set(Idx);
919 Uses[I].set(IL_All);
935 Uses[I].set(IL_All);
1016 // instructions are treated as 'final' (their uses are not considered).
1025 // Populate "Uses" with where each instruction is used.
1031 Uses[I].set(IL_All);
1036 for (auto &KV : Uses) {
1039 << *KV.first << " (#uses=" << KV.second.count() << ")\n");
1045 for (auto &KV : Uses) {
1062 auto BaseIt = nextInstr(0, Uses, Visited);
1063 auto RootIt = nextInstr(Iter, Uses, Visited);
1064 auto LastRootIt = Uses.begin();
1066 while (BaseIt != Uses.end() && RootIt != Uses.end()) {
1074 BaseIt = nextInstr(0, Uses, Visited);
1080 RootIt = nextInstr(Iter, Uses, Visited);
1098 while (TryIt != Uses.end() &&
1102 TryIt = nextInstr(Iter, Uses, Visited, &TryIt);
1105 if (TryIt == Uses.end() || TryIt == RootIt ||
1237 " vs. " << *RootInst << " (uses outside loop)\n");
1247 BaseIt = nextInstr(0, Uses, Visited);
1248 RootIt = nextInstr(Iter, Uses, Visited);
1250 assert (BaseIt == Uses.end() && RootIt == Uses.end() &&
1265 unsigned I = Uses[&*J].find_first();
1291 for (auto &KV : Uses) {
1298 if (Uses[BI].find_first() == IL_All) {
1377 // iteration (and the PHI). Replace outside uses of the reduced value with uses
