lib/CodeGen/CodeGenPrepare.cpp

59 STATISTIC(NumCmpUses, "Number of uses of Cmp expressions replaced with uses of "
61 STATISTIC(NumCastUses, "Number of uses of Cast expressions replaced with uses "
66 STATISTIC(NumExtUses,    "Number of uses of [s|z]ext instructions optimized");
69 STATISTIC(NumAndUses, "Number of uses of and mask instructions optimized");
758   // If we removed all uses, nuke the cast.
819   // We don't want to move around uses of condition values this late, so we we
899   // If we removed all uses, nuke the cmp.
1009 /// Sink the shift *right* instruction into user blocks if the uses could
1099   // If we removed all uses, nuke the shift.
1767       // Lower all uses of llvm.objectsize.*
1862   // Lower all default uses of _chk calls.  This is very similar
2214     /// \brief Remove \p Inst from the uses of the operands of \p Inst.
2230     /// \brief Restore the original list of uses.
2334   /// \brief Replace the uses of an instruction by another instruction.
2336     /// Helper structure to keep track of the replaced uses.
2346     /// Keep track of the original uses (pair Instruction, Index).
2355       // Record the original uses.
2356       for (Use &U : Inst->uses()) {
2360       // Now, we can replace the uses.
2364     /// \brief Reassign the original uses of Inst to Inst.
2382     /// Keep track of the uses replaced, if any.
2387     /// uses with New.
2403     /// \brief Resurrect the instruction and reassign it to the proper uses if
2943   // Reassign the uses of ExtInst to the opnd and remove ExtInst.
2961     // All its uses, but Ext, will need to use a truncated value of the
2981   // 2. Replace the uses of Ext by Inst.
3403 /// Check to see if all uses of OpVal by the specified inline asm call are due
3430 /// Recursively walk all the uses of I until we find a memory use.
3445   // Loop over all the uses, recursively processing them.
3446   for (Use &U : I->uses()) {
3505 /// instruction into a load or store that ultimately uses it.
3506 /// However, the specified instruction has multiple uses.
3516 /// In this case, Y has multiple uses, and can be folded into the load of Z
3553   // If all uses of this instruction are ultimately load/store/inlineasm's,
3555   // so, we can fold it into all uses, so it doesn't matter if it has multiple
3556   // uses.
3562   // Now that we know that all uses of this instruction are part of a chain of
3564   // into a memory use, loop over each of these uses and see if they could
3672     // getNumUses() as much as possible. Some values have a lot of uses, so
3688       // such root as representative, select the one with the most uses in order
3943   // If we have no uses, recursively delete the value and all dead instructions
3991 /// \brief Check if all the uses of \p Inst are equivalent (or free) zero or
4035   // All uses are the same or can be derived from one another for free.
4201   // other uses of the source with result of extension.
4228   // Make sure none of the uses are PHI nodes.
4243   for (Use &U : Src->uses()) {
4269 // Find loads whose uses only use some of the loaded value's bits.  Add an "and"
4336   // Look at all uses of Load, looking through phis, to determine how many bits
4431   // Replace all uses of load with new and (except for the use of load in the
4679   // If we removed all uses, nuke the shuffle.
5008   // 1. Replace all uses of the promoted operation by the transition.
5014   // 2. Update the type of the uses.
5121     // evaluation in a block other than then one that uses it (e.g. to hoist
5304 // mask and compare into the branch uses. Do this before OptimizeBlock ->