| /prebuilts/gdb/darwin-x86/lib/python2.7/idlelib/ |
| README.txt | 12 code objects from a top level viewpoint without dealing with code folding.
|
| /prebuilts/gdb/linux-x86/lib/python2.7/idlelib/ |
| README.txt | 12 code objects from a top level viewpoint without dealing with code folding.
|
| /prebuilts/go/darwin-x86/test/ |
| const.go | 86 // TODO(gri): exp/ssa/interp constant folding is incorrect.
|
| /prebuilts/go/linux-x86/test/ |
| const.go | 86 // TODO(gri): exp/ssa/interp constant folding is incorrect.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| README.txt | 12 code objects from a top level viewpoint without dealing with code folding.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| README.txt | 12 code objects from a top level viewpoint without dealing with code folding.
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/bfin/ |
| load.s | 39 /* Test constant folding. */
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| BasicValueFactory.cpp | 243 // Lazily create the folding set.
268 // Lazily create the folding set.
|
| /external/mesa3d/src/glsl/ |
| lower_vec_index_to_cond_assign.cpp | 33 * before sufficient constant folding to find that the array index is
35 * particularly constant folding of assignment conditions and copy
|
| opt_algebraic.cpp | 251 * folding.
292 * constant folding.
|
| /external/llvm/lib/Target/X86/ |
| X86InstrInfo.h | 147 /// RegOp2MemOpTable2, RegOp2MemOpTable3 - Load / store folding opcode maps.
367 /// folding and return true, otherwise it should return false. If it folds
375 /// foldMemoryOperand - Same as the previous version except it allows folding
516 /// optimizeLoadInstr - Try to remove the load by folding it to a register
522 /// the machine instruction generated due to folding.
556 /// Handles memory folding for special case instructions, for instance those
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| IntTrieBuilder.java | 244 // compact once without overlap to improve folding
304 // compact once without overlap to improve folding
681 // which will result in a non-zero folding value below that is set for
708 // its index block must be used first (in which case the folding is a
750 // This is to guarantee that a folding offset is of the form
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| IntTrieBuilder.java | 242 // compact once without overlap to improve folding
302 // compact once without overlap to improve folding
679 // which will result in a non-zero folding value below that is set for
706 // its index block must be used first (in which case the folding is a
748 // This is to guarantee that a folding offset is of the form
|
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 56 // ordering of nodes in the folding set.
327 /// InsertNode - Insert the specified node into the folding set, knowing that it
357 /// RemoveNode - Remove a node from the folding set, returning true if one was
358 /// removed or false if the node was not in the folding set.
363 if (!Ptr) return false; // Not in folding set.
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/normalizer/ |
| BasicTest.java | [all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
| BasicTest.java | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| InstructionSimplify.h | 10 // This file declares routines for folding instructions into simpler forms
11 // that do not require creating new instructions. This does constant folding
295 /// In contrast to SimplifyBinOp, try to use FastMathFlag when folding the
|
| /external/llvm/include/llvm/IR/ |
| NoFolder.h | 1 //===- NoFolder.h - Constant folding helper ---------------------*- C++ -*-===//
14 // creation and folding, use ConstantExpr and the routines in
31 /// NoFolder - Create "constants" (actually, instructions) with no folding.
|
| /external/llvm/test/Transforms/Reassociate/ |
| fast-basictest.ll | 3 ; With reassociation, constant folding can eliminate the 12 and -12 constants.
258 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
269 ; With sub reassociation, constant folding can eliminate the uses of %a.
|
| /external/libopus/celt/ |
| bands.c | 1042 /* About 48 dB below the "normal" folding level */
[all...] |
| /external/llvm/lib/CodeGen/ |
| TargetInstrInfo.cpp | 428 // FIXME: Allow folding when register classes are memory compatible.
454 // Return false if any operands requested for folding are not foldable (not
521 // Ask the target to do the actual folding.
774 /// foldMemoryOperand - Same as the previous version except it allows folding
783 assert(MI->getOperand(Ops[i]).isUse() && "Folding load into def!");
788 // Ask the target to do the actual folding.
800 // Ask the target to do the actual folding.
812 // Handle the rare case of folding multiple loads.
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| constant-fold-address-space-pointer.ll | 15 ; Test constant folding of inttoptr (ptrtoint constantexpr)
45 ; address spaces when folding this
|
| /external/regex-re2/re2/testing/ |
| search_test.cc | 251 // Character classes & case folding.
262 // Character classes & case folding.
|
| /libcore/ojluni/src/main/java/java/util/prefs/ |
| Base64.java | 49 * suitable for use in situations where case-folding occurs.
113 * designed for use in environments where "case folding" occurs.
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_codecs.py | [all...] |
