Lines Matching refs:users
209 // This includes users of the reduction, variables (which form a cycle
215 // We start with the PHI node and scan for all of the users of this
216 // instruction. All users must be instructions that can be used as reduction
267 // * One value may have several outside users, but all outside
278 // If the instruction has no users then this is a broken chain and can't be
334 // Process users of current instruction. Push non-PHI nodes after PHI nodes
339 for (User *U : Cur->users()) {
444 // only have a single instruction with out-of-loop users.
446 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
509 /// Returns true if the select instruction has users in the compare-and-add
703 // phis with multiple users.
705 // Returns true, if all users of I are dominated by DominatedBy.
734 // We can sink any instruction without side effects, as long as all users