HomeSort by relevance Sort by last modified time
    Searched full:memchecks (Results 1 - 17 of 17) sorted by null

  /external/llvm/include/llvm/Transforms/Utils/
LoopVersioning.h 50 /// i.e. the loop that will receive control if all the memchecks pass.
66 /// loop don't alias (i.e. all memchecks passed). (This loop is actually the
71 /// loop may alias (i.e. one of the memchecks failed).
93 /// loop may alias (memchecks failed).
  /external/llvm/test/Analysis/LoopAccessAnalysis/
resort-to-memchecks-only.ll 4 ; distance between A[i+offset] and A[i] and add memchecks to prove
safe-no-checks.ll 3 ; If the arrays don't alias this loop is safe with no memchecks:
underlying-objects-1.ll 12 ; vectorization requiring no memchecks.
underlying-objects-2.ll 33 ; memchecks (that is what LAA does after encountering a case of non-constant
number-of-memchecks.ll 6 ; 3 reads and 3 writes should need 12 memchecks
  /external/llvm/test/Transforms/LoopDistribute/
crash-in-memcheck-generation.ll 4 ; If only A and B can alias here, we don't need memchecks to distribute since
unknown-bounds-for-memchecks.ll 4 ; memchecks (e.g., C[i * i] below), loop shold not get distributed.
basic-with-memchecks.ll 9 ; second part of this loop with 5 memchecks (A+1 x {C, D, E} + C x {A, B})
55 ; The non-distributed loop that the memchecks fall back on.
bounds-expansion-bug.ll 3 ; When emitting the memchecks for:
  /external/llvm/test/Transforms/LoopLoadElim/
memcheck.ll 4 ; This needs two pairs of memchecks (A * { C, D }) for a single load
  /external/llvm/lib/Transforms/Utils/
LoopVersioning.cpp 103 // Insert the conditional branch based on the result of the memchecks.
  /external/llvm/test/Transforms/LoopVectorize/
version-mem-access.ll 9 ; memchecks.
  /frameworks/av/media/libstagefright/foundation/
AMessage.cpp 152 size_t memchecks = 0; local
160 ++memchecks;
171 gAverageNumMemChecks += memchecks;
  /external/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h 419 /// of pointers to reduce the number of memchecks necessary.
524 /// \brief Number of memchecks required to prove independence of otherwise
  /external/llvm/lib/Transforms/Scalar/
LoopLoadElimination.cpp 17 // The pass can also version the loop and add memchecks in order to prove that
41 cl::desc("Max number of memchecks allowed per eliminated load on average"),
  /external/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 210 // of the set in order to be able to emit memchecks.
508 /// to add memchecks. Perform the analysis to determine the necessary checks.
    [all...]

Completed in 3629 milliseconds