Lines Matching defs:Users
385 DenseSet<Instruction *> &Users);
389 DenseSet<Instruction *> &Users);
456 for (User *U : I->users()) {
528 for (User *U : C->users()) {
560 // Collect the set of all users of the provided root instruction. This set of
561 // users contains not only the direct users of the root instruction, but also
562 // all users of those users, and so on. There are two exceptions:
565 // use set (even if they are users). This is used, for example, to exclude
569 // if they are users, but their users are not added. This is used, for
575 DenseSet<Instruction *> &Users) {
579 if (!Users.insert(I).second)
607 // Collect all of the users of all of the provided root instructions (combined
613 DenseSet<Instruction *> &Users) {
616 collectInLoopUserSet(*I, Exclude, Final, Users);
657 for (auto *UU : BO->users()) {
669 for (auto *I : Base->users()) {
708 // If we found non-loop-inc, non-root users of Base, assume they are
719 // Calculate the number of users of the base, or lowest indexed, iteration.
724 // Check that every node has the same number of users.
729 DEBUG(dbgs() << "LRR: Aborting - Root and Base #users not the same: "
742 // All its users must be simple arithmetic ops.
754 for (User *V : I->users()) {
814 for (auto *IVU : IV->users()) {
977 for (auto *U : I->users()) {
1015 // collect the set of all users of some root instructions, these reduction
1070 // Skip over the IV or root instructions; only match their users.
1393 // Replace users with the new end-of-chain value.
1394 SmallInstructionVector Users;
1395 for (User *U : PossibleReds[i].getReducedValue()->users()) {
1396 Users.push_back(cast<Instruction>(U));
1399 for (SmallInstructionVector::iterator J = Users.begin(),
1400 JE = Users.end(); J != JE; ++J)
1433 // - Ensure that both matched instructions don't have any external users
