| /cts/tests/sensor/src/android/hardware/cts/helpers/ |
| ActivityResultMultiplexedLatch.java | 26 * It holds a {@link CountDownLatch} latch for each thread that requests synchronization.
28 * Each thread requests a {@link Latch} to synchronize an Activity that will be started, by invoking
29 * {@link #bindThread()}, this guarantees that a latch is associated with the thread, and the result
38 * A latch for a bound thread.
41 public class Latch {
44 private Latch(Entry entry) {
54 mEntry.latch.await();
70 public final CountDownLatch latch = new CountDownLatch(1); field in class:ActivityResultMultiplexedLatch.Entry
85 public Latch bindThread() {
97 return new Latch(entry)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 153 /// getLoopLatch - If there is a single latch block for this loop, return it.
154 /// A latch block is a block that contains a branch back to the header.
163 BlockT *Latch = nullptr;
167 if (Latch) return nullptr;
168 Latch = N;
172 return Latch;
328 if (BB == getLoopLatch()) OS << "<latch>";
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 173 // latch to prevent the flow from building up in the loop.
203 BasicBlock *Latch = BBLoop->getLoopLatch();
204 if (Latch) {
205 Edge edge = getEdge(Latch,0);
208 edge = getEdge(Latch, BB);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 179 /// \param SimplifiedLatch is true if the latch was just folded into the final
180 /// loop exit. In this case we may want to rotate even though the new latch is
181 /// now an exiting branch. This rotation would have happened had the latch not
183 /// rotating loops in which the latch exits to avoid excessive or endless
185 /// form. This property is satisfied because simplifying the loop latch can only
205 // If the loop latch already contains a branch that leaves the loop then the
210 // Rotate if either the loop latch does *not* exit the loop, or if the loop
211 // latch was just simplified.
352 assert(L->getHeader() == NewHeader && "Latch block is our new header");
373 // loop latch
[all...] |
| LoopUnswitch.cpp | 813 /// from its header block to its latch block, where the path through the loop
[all...] |
| InductiveRangeCheckElimination.cpp | 408 // kinds of loops we can deal with -- ones that have a single latch that is also
414 BasicBlock *Latch;
416 // `Latch's terminator instruction is `LatchBr', and it's `LatchBrExitIdx'th
428 : Tag(""), Header(nullptr), Latch(nullptr), LatchBr(nullptr),
436 Result.Latch = cast<BasicBlock>(Map(Latch));
627 BasicBlock *Latch = L.getLoopLatch();
628 if (!L.isLoopExiting(Latch)) {
629 FailureReason = "no loop latch";
640 BranchInst *LatchBr = dyn_cast<BranchInst>(Latch->getTerminator())
[all...] |
| LoopStrengthReduce.cpp | 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnrollRuntime.cpp | 66 BasicBlock *Latch = L->getLoopLatch();
67 assert(Latch && "Loop must have a latch");
68 BasicBlock *PrologLatch = cast<BasicBlock>(VMap[Latch]);
75 for (BasicBlock *Succ : successors(Latch)) {
94 Value *V = PN->getIncomingValueForBlock(Latch);
156 BasicBlock *Latch = L->getLoopLatch();
157 assert(Latch && "Loop must have a latch");
158 BasicBlock *EpilogLatch = cast<BasicBlock>(VMap[Latch]);
[all...] |
| LoopUtils.cpp | 530 // Ensure the loop has a preheader and a single latch block. The loop
531 // vectorizer will need the latch to set up the next iteration of the loop.
533 auto *Latch = TheLoop->getLoopLatch();
534 if (!Preheader || !Latch)
537 // Ensure the phi node's incoming blocks are the loop preheader and latch.
539 Phi->getBasicBlockIndex(Latch) < 0)
542 // Get the previous value. The previous value comes from the latch edge while
544 auto *Previous = dyn_cast<Instruction>(Phi->getIncomingValueForBlock(Latch));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 154 /// getLoopLatch - If there is a single latch block for this loop, return it.
155 /// A latch block is a block that contains a branch back to the header.
164 BlockT *Latch = nullptr;
168 if (Latch) return nullptr;
169 Latch = N;
173 return Latch;
330 if (isLoopLatch(BB)) OS << "<latch>";
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| LoopInfo.h | 315 /// getLoopLatch - If there is a single latch block for this loop, return it.
316 /// A latch block is a block that contains a branch back to the header.
324 BlockT *Latch = 0;
328 if (Latch) return 0;
329 Latch = N;
333 return Latch;
506 if (BB == getLoopLatch()) OS << "<latch>";
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 379 // latch block or exit through a one exit block without having any
510 /// condition in it (a cond branch from its header block to its latch block,
767 // If this is the header of a loop and the only pred is the latch, we now
771 // Remove the branch from the latch to the header block, this makes
772 // the header dead, which will make the latch dead (because the header
773 // dominates the latch).
[all...] |
| LoopStrengthReduce.cpp | 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopAccessAnalysis.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 253 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
262 /// +-> comparison-in-latch (against upper_bound-bump),
269 /// couldn't be identified, or if the value in the latch's comparison
369 /// \brief Return the latch block if it's one of the exiting blocks. Otherwise,
373 if (MachineBasicBlock *Latch = L->getLoopLatch()) {
374 if (L->isLoopExiting(Latch))
375 return Latch;
389 MachineBasicBlock *Latch = L->getLoopLatch();
391 if (!Header || !Preheader || !Latch || !ExitingBlock)
412 // latch block, and see if is a result of an addition of form "reg+imm"
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
