HomeSort by relevance Sort by last modified time
    Searched refs:Loop (Results 126 - 150 of 209) sorted by null

1 2 3 4 56 7 8 9

  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/
omxVCM4P2_DecodePadMV_PVOP_s.s 218 Loop
336 BLT Loop ;// If BlkCount<Count Continue the Loop
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
omxVCM4P2_DecodePadMV_PVOP_s.s 218 Loop
336 BLT Loop ;// If BlkCount<Count Continue the Loop
  /external/llvm/tools/opt/
PassPrinters.cpp 141 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
  /external/v8/src/compiler/
wasm-compiler.h 74 Node* Loop(Node* entry);
bytecode-graph-builder.h 95 Node* NewLoop() { return NewNode(common()->Loop(1), true); }
165 // Constructing merge and loop headers.
233 // Loop header environments are environments created for bytecodes
234 // where it is known there are back branches, ie a loop header.
  /external/v8/test/cctest/compiler/
test-osr.cc 78 Node* NewOsrPhi(Node* loop, Node* incoming, int osr_value, Node* back1 = NULL,
84 CHECK_EQ(loop->InputCount(), count);
85 CHECK_EQ(osr_loop_entry, loop->InputAt(1));
93 inputs[count] = loop;
100 Node* loop = graph.NewNode(common.Loop(1), entry); local
102 loop->AppendInput(graph.zone(), osr_loop_entry);
105 loop->AppendInput(graph.zone(), loop);
107 NodeProperties::ChangeOp(loop, common.Loop(loop->InputCount()))
136 Node* loop = T.NewOsrLoop(1); local
149 Node* loop = T.NewOsrLoop(1); local
169 Node* loop = T.NewOsrLoop(1, d.merge); local
194 Node* loop = T.NewOsrLoop(1); local
221 Node* loop = T.NewOsrLoop(1); local
259 Node* loop = T.NewOsrLoop(2); local
300 Node* loop; member in struct:v8::internal::compiler::While
    [all...]
  /external/v8/tools/gcmole/
gcmole.cc 965 void Loop(clang::Stmt* a, clang::Stmt* b, clang::Stmt* c) {
970 void Loop(clang::Stmt* a, clang::Stmt* b) {
1009 block.Loop(stmt->getCond(), stmt->getBody());
1017 block.Loop(stmt->getBody(), stmt->getCond());
1025 block.Loop(stmt->getCond(),
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/
tree-rewrite.rb 102 grammar Loop;
119 tokenVocab=Loop;
1069 example "loop" do
1070 lexer = Loop::Lexer.new( "a b c 3 4 5" )
1072 parser = Loop::Parser.new( tokens )
    [all...]
  /external/boringssl/src/crypto/modes/asm/
ghash-armv4.pl 16 # that can be made at this point is based on code size. Inner loop is
19 # loop, this assembler loop body was found to be ~3x smaller than
60 # in the inner loop (meaning that estimated improvement is ~15%);
294 .Loop:
326 bpl .Loop
  /external/boringssl/src/crypto/sha/asm/
sha1-armv8.pl 193 .Loop:
219 cbnz $num,.Loop
sha512-armv8.pl 204 .Loop:
238 b.ne .Loop
  /external/libpng/scripts/
makevms.com 113 $Loop:
132 $ If arg .Le. 8 Then Goto Loop
  /external/llvm/lib/Fuzzer/
FuzzerLoop.cpp 1 //===- FuzzerLoop.cpp - Fuzzer's main loop --------------------------------===//
9 // Fuzzer's main loop.
448 Loop();
471 void Fuzzer::Loop() {
  /external/llvm/tools/msbuild/
install.bat 9 REM Loop over the two platforms in awkward batch file fashion.
  /external/skia/tools/kilobench/
kilobench.cpp 297 static void Loop(void* data) {
542 SkAutoTDelete<SkThread> nativeThread(new SkThread(TimingThread::Loop, &timingThread));
  /external/v8/test/mjsunit/compiler/
uint32.js 47 // Loop to force inline allocation failure and a call into runtime.
  /external/llvm/lib/Target/PowerPC/
PPCTargetTransformInfo.cpp 184 void PPCTTIImpl::getUnrollingPreferences(Loop *L,
277 // (at least in the sense that there need only be one non-loop-invariant
356 // relatively cheap (not counting loop-invariant instructions): one load plus
370 // is about the same (not counting loop-invariant instructions).
405 // (at least in the sense that there need only be one non-loop-invariant
  /external/v8/test/unittests/compiler/
control-equivalence-unittest.cc 84 return Store(graph()->NewNode(common()->Loop(2), control, control));
scheduler-unittest.cc 120 TestLoop* loop = new TestLoop(); local
121 loop->count = count;
122 loop->nodes = new BasicBlock* [count];
124 loop->nodes[i] = schedule->NewBasicBlock();
126 schedule->AddSuccessorForTesting(loop->nodes[i - 1], loop->nodes[i]);
129 schedule->AddSuccessorForTesting(loop->nodes[count - 1], loop->nodes[0]);
130 return loop;
201 BasicBlock* loop[] = {schedule.start()} local
213 BasicBlock* loop[] = {schedule.start(), body}; local
277 BasicBlock* loop[] = {B, C}; local
297 BasicBlock* loop[] = {B, C}; local
337 BasicBlock* loop[] = {B, C, D, E, F}; local
818 Node* loop = graph()->NewNode(common()->Loop(2), f, start); local
850 Node* loop = graph()->NewNode(common()->Loop(2), start, start); local
885 Node* loop = graph()->NewNode(common()->Loop(2), start, start); local
921 Node* loop = graph()->NewNode(common()->Loop(2), start, start); local
1146 Node* loop = graph()->NewNode(common()->Loop(2), start, start); local
    [all...]
  /external/libavc/common/arm/
ih264_inter_pred_luma_horz_qpel_vert_hpel_a9q.s 319 b loop_16 @ Loop if height==8
410 b loop_8 @ Loop if height==8
499 b loop_4 @ Loop if height==8
  /external/llvm/lib/CodeGen/
SplitKit.cpp 179 // Loop over basic blocks where CurLI is live.
279 // Loop over basic blocks where li is live.
680 const MachineLoop *Loop = Loops.getLoopFor(MBB);
682 // MBB isn't in a loop, it doesn't get any better. All dominators have a
684 if (!Loop) {
691 if (Loop == DefLoop) {
693 << MBB->getNumber() << " in the same loop\n");
698 unsigned Depth = Loop->getLoopDepth();
706 // Leave loop by going to the immediate dominator of the loop header
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonHardwareLoops.cpp 11 // loop instruction. The hardware loop can perform loop branches with a
16 // normalizes induction variables, and the Loop Strength Reduction pass
61 cl::desc("Add a preheader to a hardware loop if one doesn't exist"));
144 /// \brief Find the register that contains the loop controlling
150 /// loop:
153 /// if (R.next < #N) goto loop
165 /// \brief Analyze the statements in a loop to determine if the loop
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp 106 // NOTE: this loop intentionally is not using an iterator. Instead, we
799 os << "Loop condition is true. ";
815 Start, End, "Loop condition is false. Exiting loop"));
827 os << "Loop condition is false. ";
841 Start, End, "Loop condition is true. Entering loop body"));
    [all...]
  /external/llvm/include/llvm/Analysis/
TargetTransformInfoImpl.h 199 void getUnrollingPreferences(Loop *, TTI::UnrollingPreferences &) {}
  /external/llvm/lib/Analysis/
TargetTransformInfo.cpp 95 Loop *L, UnrollingPreferences &UP) const {

Completed in 720 milliseconds

1 2 3 4 56 7 8 9