HomeSort by relevance Sort by last modified time
    Searched full:invariant (Results 201 - 225 of 1030) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/chromium_org/third_party/icu/source/tools/toolutil/
unewdata.h 93 /** @memo Write a <code>char*</code> string of platform "invariant characters" to the file. */
  /external/chromium_org/third_party/skia/include/core/
SkWeakRefCnt.h 155 /* Invariant: fWeakCnt = #weak + (fRefCnt > 0 ? 1 : 0) */
  /external/chromium_org/v8/src/
hydrogen-gvn.cc 515 TRACE_GVN_1("Using optimistic loop invariant code motion: %s\n",
521 TRACE_GVN_2("Try loop invariant motion for block B%d %s\n",
546 TRACE_GVN_2("Loop invariant motion for B%d %s\n",
573 TRACE_GVN_2("Hoisting loop invariant instruction i%d to block B%d\n",
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
AbstractMapTester.java 190 // TODO: move this to invariant checks once the appropriate hook exists?
  /external/icu4c/common/unicode/
platform.h 476 * It is enough to determine the code point values of "invariant characters",
480 * <p>Those "invariant characters" should be all the uppercase and lowercase
484 * <p>The list of "invariant characters" is:<br>
529 * - ICU will assume that all non-invariant char*, StringPiece, std::string etc.
unistr.h 90 * which constructs a Unicode string from an invariant-character char * string.
91 * About invariant characters see utypes.h.
94 * (where the empty string "" indicates invariant-character conversion).
106 * They work only for strings that contain "invariant characters", i.e.,
133 * They work only for strings that contain "invariant characters", i.e.,
254 * which constructs a Unicode string from an invariant-character char * string.
    [all...]
  /external/icu4c/tools/toolutil/
pkg_icu.cpp 54 * (in the system/ invariant charset).
unewdata.h 93 /** @memo Write a <code>char*</code> string of platform "invariant characters" to the file. */
  /external/libvpx/libvpx/examples/includes/geshi/geshi/
eiffel.php 50 'invariant',
glsl.php 60 'const', 'uniform', 'attribute', 'centroid', 'varying', 'invariant',
  /external/llvm/docs/
Lexicon.rst 122 Loop Invariant Code Motion
  /external/llvm/include/llvm/IR/
LLVMContext.h 52 MD_invariant_load = 6 // "invariant.load"
  /external/llvm/include/llvm/Object/
ELFYAML.h 25 // These types are invariant across 32/64-bit ELF, so for simplicity just
  /external/llvm/include/llvm/Target/
TargetOpcodes.h 19 /// Invariant opcodes: All instruction sets have these as their low opcodes.
  /external/llvm/test/Transforms/IndVarSimplify/
loop_evaluate9.ll 8 ; Indvars does not currently replace loop invariant values unless all
  /external/llvm/test/Transforms/LICM/
hoisting.ll 53 ; This loop invariant instruction should be constant folded, not hoisted.
  /external/llvm/test/Transforms/LoopStrengthReduce/
2012-01-02-nopreheader.ll 10 ; This involves a nested AddRec, the outer AddRec's loop invariant components
  /external/skia/include/core/
SkWeakRefCnt.h 155 /* Invariant: fWeakCnt = #weak + (fRefCnt > 0 ? 1 : 0) */
  /external/tcpdump/
print-pppoe.c 147 * loop invariant:
  /external/valgrind/main/coregrind/
pub_core_dispatch_asm.h 57 #define VG_TRC_INVARIANT_FAILED 47 /* TRC only; invariant violation */
  /libcore/luni/src/main/java/java/security/spec/
EllipticCurve.java 80 // Check invariant: a and b must be in the field.
  /ndk/sources/host-tools/make-3.81/doc/
make.info 20 Foundation; with no Invariant Sections, with the Front-Cover Texts
  /external/chromium_org/third_party/icu/source/common/unicode/
utypes.h 122 * It is enough to determine the code point values of "invariant characters",
126 * <p>Those "invariant characters" should be all the uppercase and lowercase
130 * <p>The list of "invariant characters" is:<br>
170 * - ICU will assume that all non-invariant char*, StringPiece, std::string etc.
676 U_INVARIANT_CONVERSION_ERROR = 26, /**< Unable to convert a UChar* string to char* with the invariant converter. */
    [all...]
  /external/llvm/include/llvm/Analysis/
ScalarEvolutionExpressions.h 281 /// All operands of an AddRec are required to be loop invariant.
308 /// an expressions A+B*x where A and B are loop invariant values.
310 // We know that the start value is invariant. This expression is thus
311 // affine iff the step is also invariant.
317 /// invariant values. This corresponds to an addrec of the form {L,+,M,+,N}
  /external/llvm/lib/IR/
Value.cpp 550 "List invariant broken!");
562 assert(*PrevPtr == this && "List invariant broken");
566 assert(Next->getPrevPtr() == &Next && "List invariant broken");
604 assert(Entry->Next == &Iterator && "Loop invariant broken.");
658 assert(Entry->Next == &Iterator && "Loop invariant broken.");

Completed in 524 milliseconds

1 2 3 4 5 6 7 891011>>