| /external/llvm/lib/Target/AMDGPU/ |
| SILowerControlFlow.cpp | 85 void Loop(MachineInstr &MI);
264 void SILowerControlFlowPass::Loop(MachineInstr &MI) {
296 // If these aren't equal, this is probably an infinite loop.
356 // Read the next variant into VCC (lower 32 bits) <- also loop target
387 // Loop back to V_READFIRSTLANE_B32 if there are still variants to cover
519 Loop(MI);
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 1 //===-- LoopUtils.cpp - Loop Utility functions -------------------------===//
10 // This file defines common loop utility functions.
27 #define DEBUG_TYPE "loop-utils"
156 Loop *TheLoop, bool HasFunNoNaNAttr,
161 // Reduction variables are only found in the loop header block.
165 // Obtain the reduction start value from the value that comes from the loop
169 // ExitInstruction is the single value which is used outside the loop.
170 // We only allow for a single reduction value to be used outside the loop.
224 // - By one instruction outside of the loop (safe).
225 // - By further instructions outside of the loop (not safe)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| kxia64.h | 685 #define ACQUIRE_SPINLOCK(rpLock,rOwn,Loop) cmp##.##eq pt0,pt1 = zero,zero ; ;; ;Loop: ;.pred.rel "mutex",pt0,pt1 ;(pt1) YIELD ;(pt0) xchg8 t22 = [rpLock],rOwn ;(pt1) ld8##.##nt1 t22 = [rpLock] ; ;; ;(pt0) cmp##.##ne pt2 = zero,t22 ; cmp##.##eq pt0,pt1 = zero,t22 ;(pt2) br##.##dpnt Loop
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 15 // have as one or more of their components the loop induction variable, it
18 // related to loop induction variables.
34 // case of post-increment users is users outside the loop.
81 #define DEBUG_TYPE "loop-reduce"
283 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
307 static void DoInitialMatch(const SCEV *S, Loop *L,
311 // Collect expressions which properly dominate the loop header.
359 /// Incorporate loop-variant parts of S into this Formula, attempting to keep
360 /// all loop-invariant and loop-computable values in a single base register
[all...] |
| /build/kati/ |
| expr.go | 343 Loop:
347 break Loop
352 break Loop
365 break Loop
|
| pathutil.go | 122 Loop:
125 continue Loop
141 continue Loop
145 continue Loop
149 continue Loop
413 glog.Errorf("find: File system loop detected; `%s' is part of the same file system loop as `%s'.", lpath, p)
874 // symlink loop detected.
875 glog.Errorf("findleaves: loop detected %q was %q", lpath, p)
|
| /external/libavc/common/arm/ |
| ih264_inter_pred_luma_copy_a9q.s | 138 subs r4, r4, #8 @wd - 8(Loop condition)
168 subs r4, r4, #16 @wd - 8(Loop condition)
|
| /external/llvm/include/llvm/Analysis/ |
| RegionInfo.h | 65 class Loop;
89 typedef Loop LoopT;
458 /// @brief Check if the region contains a loop.
460 /// @param L The loop that might be contained in this region.
461 /// @return True if the loop is contained in the region otherwise false.
467 /// @brief Get the outermost loop in the region that contains a loop.
469 /// Find for a Loop L the outermost loop OuterL that is a parent loop of
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 115 bool isInvariantIn(Value *Val, Loop *L);
116 bool isInvariantIn(GepNode *Node, Loop *L);
117 bool isInMainPath(BasicBlock *B, Loop *L);
537 // in a prior iteration of this loop. Since equality is transitive,
823 bool HexagonCommonGEP::isInvariantIn(Value *Val, Loop *L) {
834 bool HexagonCommonGEP::isInvariantIn(GepNode *Node, Loop *L) {
842 bool HexagonCommonGEP::isInMainPath(BasicBlock *B, Loop *L) {
845 // B must post-dominate the loop header or dominate the loop latch.
855 BasicBlock *preheader(DominatorTree *DT, Loop *L)
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZSelectionDAGInfo.cpp | 21 // Decide whether it is best to use a loop or straight-line code for
24 // (such as MVC) and Loop is the opcode to use for loops (such as MVC_LOOP).
27 unsigned Loop, SDValue Chain, SDValue Dst,
34 // However, the loop has 4 or 5 instructions (depending on whether
36 // much point using a loop for 5 * 256 bytes or fewer. Anything in
38 // the loop, so it doesn't seem worth using a loop then either.
42 return DAG.getNode(Loop, DL, MVT::Other, Chain, Dst, Src,
152 // deciding whether to use a loop or straight-line code.
157 // A two-CLC sequence is a clear win over a loop, not least because i
[all...] |
| /external/llvm/unittests/IR/ |
| LegacyPassManagerTest.cpp | 209 bool doInitialization(Loop* L, LPPassManager &LPM) override {
214 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
375 SCOPED_TRACE("Loop pass");
|
| /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
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| example_test.go | 65 // Loop while a is smaller than 1e100.
|
| /prebuilts/go/linux-x86/src/math/big/ |
| example_test.go | 65 // Loop while a is smaller than 1e100.
|
| /external/llvm/tools/opt/ |
| PassPrinters.cpp | 141 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
|
| /external/skia/platform_tools/android/bin/ |
| android_run_app.go | 120 // Loop forever, reading bytes from the pipe.
214 // Loop until the app finishes or we're interrupted, writing output as appropriate.
|
| /external/v8/src/compiler/ |
| wasm-compiler.h | 74 Node* Loop(Node* entry);
|
| /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...] |
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| prog.go | 172 Loop:
182 break Loop
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| lock_sema.go | 55 Loop:
81 continue Loop
|
| /prebuilts/go/linux-x86/src/regexp/syntax/ |
| prog.go | 172 Loop:
182 break Loop
|
| /prebuilts/go/linux-x86/src/runtime/ |
| lock_sema.go | 55 Loop:
81 continue Loop
|
| /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...] |
| /prebuilts/go/darwin-x86/src/encoding/json/ |
| decode_test.go | 118 Loop
151 type Loop struct {
154 *Loop
354 Loop: Loop{
500 Loop: Loop{
[all...] |
