HomeSort by relevance Sort by last modified time
    Searched full:phis (Results 51 - 75 of 164) sorted by null

1 23 4 5 6 7

  /external/llvm/lib/Target/ARM/
A15SDOptimizer.cpp 365 // Look through full copies and PHIs to get the set of non-copy MachineInstrs
369 // Looking through PHIs may create loops so we need to track what
621 // PHIs (which are essentially multi-way COPYs). It is because of PHIs that
  /external/llvm/test/Transforms/IndVarSimplify/
ada-loops.ll 10 ; don't check that phis are "folded together" because that is a job
no-iv-rewrite.ll 273 ; Eliminate the congruent phis j, k, and l.
275 ; Two phis should remain, one starting at %init, and one at %init1.
  /external/llvm/lib/Analysis/
BasicAliasAnalysis.cpp     [all...]
  /external/llvm/lib/CodeGen/
MachineSSAUpdater.cpp 355 /// first calculating the required placement of PHIs and then inserting new
356 /// PHIs where needed.
TailDuplication.cpp 41 STATISTIC(NumAddedPHIs , "Number of phis added");
350 // Remember which registers are used by phis in this block. This is
892 // No PHIs to worry about, just splice the instructions over.
    [all...]
SjLjEHPrepare.cpp 359 // Go through the landing pads and remove any PHIs there.
364 // Place PHIs into a set to avoid invalidating the iterator.
371 // Demote the PHIs to the stack.
  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 89 /// may require new PHIs in the new exit block. This function inserts the
90 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
CloneFunction.cpp 472 // map. Loop over all of the PHIs and remove excess predecessor
487 // correctness, because 0-operand phis are not valid.
507 // two PHINodes, the iteration over the old PHIs remains valid, and the
SimplifyCFG.cpp     [all...]
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdater.h 144 /// for the PHIs to insert. After this is complete, the loads and stores are
BasicBlockUtils.h 48 /// if any PHIs were deleted.
  /external/llvm/lib/Transforms/ObjCARC/
ProvenanceAnalysis.cpp 49 // If the values are PHIs in the same block, we can do a more precise as well
ObjCARCUtil.cpp 170 // use of an objc pointer. Bitcasts, GEPs, Selects, PHIs transfer a pointer
  /external/llvm/test/Transforms/ScalarRepl/
phi-select.ll 2 ; Test promotion of allocas that have phis and select users.
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
timevar.def 150 DEFTIMEVAR (TV_TREE_PHIOPT , "tree linearize phis")
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
timevar.def 150 DEFTIMEVAR (TV_TREE_PHIOPT , "tree linearize phis")
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
timevar.def 150 DEFTIMEVAR (TV_TREE_PHIOPT , "tree linearize phis")
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
timevar.def 150 DEFTIMEVAR (TV_TREE_PHIOPT , "tree linearize phis")
  /external/llvm/lib/Transforms/Scalar/
IndVarSimplify.cpp 148 // because it understands lcssa phis while SCEV does not.
446 SmallVector<WeakVH, 8> PHIs;
449 PHIs.push_back(PN);
451 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
452 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i]))
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaBasicBlock.java 870 * For use after all phis have been removed and all calls to
876 * refers value before any other phis have executed.
902 +"phis before move-exception");
    [all...]
SsaConverter.java 283 * when placing phis
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaBasicBlock.java 871 * For use after all phis have been removed and all calls to
877 * refers value before any other phis have executed.
903 +"phis before move-exception");
    [all...]
SsaConverter.java 284 * when placing phis
  /external/llvm/include/llvm/CodeGen/
FunctionLoweringInfo.h 192 // PHIs with no uses have no ValueMap entry.

Completed in 689 milliseconds

1 23 4 5 6 7