HomeSort by relevance Sort by last modified time
    Searched full:fold (Results 251 - 275 of 634) sorted by null

<<11121314151617181920>>

  /external/llvm/include/llvm/CodeGen/
SelectionDAGISel.h 93 /// IsProfitableToFold - Returns true if it's profitable to fold the specific
  /external/llvm/include/llvm/Target/
TargetInstrInfo.h 516 /// foldMemoryOperand - Attempt to fold a load or store of the specified stack
    [all...]
  /external/llvm/include/llvm/Transforms/Utils/
BasicBlockUtils.h 39 /// any single-entry PHI nodes in it, fold them away. This handles the case
  /external/llvm/lib/Target/PowerPC/
PPCFastISel.cpp 299 // Fold loads into extends when possible. TBD.
  /external/llvm/lib/Target/SystemZ/
SystemZISelDAGToDAG.cpp 143 // Try to fold more of the base or index of AM into AM, where IsBase
251 // Try to fold some of RxSBG.Input into other fields of RxSBG.
339 // where IsBase selects between the base and index. Try to fold the
364 // between the base and index. Try to fold Op1 into AM's displacement.
    [all...]
  /external/llvm/lib/Target/XCore/
XCoreISelLowering.cpp 250 // We can only fold positive offsets that are a multiple of the word size.
    [all...]
XCoreRegisterInfo.cpp 141 // fold constant into offset.
  /external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp 582 // constant as the other operand, try to fold the binary operator into the
619 /// has a PHI node as operand #0, see if we can fold the instruction into the
629 // multiple uses and they are all the same operation, we can fold *all* of the
692 // We only currently try to fold the condition of a select when it is a phi,
    [all...]
  /external/llvm/test/CodeGen/X86/
lsr-delayed-fold.ll 3 ; ScalarEvolution misses an opportunity to fold ((trunc x) + (trunc -x) + y),
sse_reload_fold.ll 128 ; RABasic still tries to fold this one.
  /external/llvm/test/Transforms/IndVarSimplify/
eliminate-comparison.ll 164 ; In this case the second loop only has a single iteration, fold the header away
  /external/llvm/test/Transforms/Inline/
inline_constprop.ll 117 ; Check that we can constant fold through intrinsics such as the
  /external/mesa3d/src/glsl/
lower_instructions.cpp 81 * opportunity to do things like constant fold the (1.0 / op1) easily.
lower_mat_op_to_vec.cpp 30 * GPU, so this gives us the chance to constant fold operations on a
  /external/qemu/
cpus.c 621 /* Fold pending instructions back into the
  /external/regex-re2/re2/
compile.cc 815 // the fold flag is unnecessary; don't bother.
816 bool fold = foldascii; local
818 fold = false;
820 AddRuneRange(i->lo, i->hi, fold);
    [all...]
unicode.py 233 # Dict mapping lowercase code point to fold-equivalent group.
  /external/valgrind/main/VEX/pub/
libvex_guest_arm.h 189 IR with assignments ITSTATE = 0 and hence have iropt fold out
  /external/wpa_supplicant_8/src/crypto/
random.c 116 * Fold the hash to further reduce any potential output pattern.
  /frameworks/av/tools/resampler_tools/
fir.cpp 136 // (the spectrum will fold around 24 KHz and we want 100 dB rejection
  /packages/apps/Calendar/src/com/android/calendar/
AllInOneActivity.java     [all...]
  /external/llvm/lib/Target/
README.txt 868 Should fold to "(~a & c) | (a & b)". Currently not optimized with
874 Should fold to "a|~b". Currently not optimized with "clang
880 Should fold to "a". Currently not optimized with "clang -emit-llvm-bc
886 Should fold to "a ? b : c", or at least something sane. Currently not
892 Should fold to a && (b || c). Currently not optimized with "clang
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 155 // We fold the unconditional branch if we can easily update all PHI nodes in
765 /// on the same value. If so, and if safe to do so, fold them together.
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
TargetLowering.cpp     [all...]
  /external/chromium_org/tools/metrics/actions/
extract_actions.py 67 # fold -w75 -s | perl -pe 's/^/ /;s/ $//'; echo
93 # fold -w75 -s | perl -pe 's/^/ /;s/ $//'; echo

Completed in 540 milliseconds

<<11121314151617181920>>