| /cts/tests/tests/hardware/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/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 116 /// \param SimplifiedLatch is true if the latch was just folded into the final
117 /// loop exit. In this case we may want to rotate even though the new latch is
118 /// now an exiting branch. This rotation would have happened had the latch not
120 /// rotating loops in which the latch exits to avoid excessive or endless
122 /// form. This property is satisfied because simplifying the loop latch can only
145 // If the loop latch already contains a branch that leaves the loop then the
150 // Rotate if either the loop latch does *not* exit the loop, or if the loop
151 // latch was just simplified.
281 assert(L->getHeader() == NewHeader && "Latch block is our new header");
303 // loop latch
[all...] |
| LoopUnswitch.cpp | 756 /// from its header block to its latch block, where the path through the loop
[all...] |
| InductiveRangeCheckElimination.cpp | 437 // kinds of loops we can deal with -- ones that have a single latch that is also
443 BasicBlock *Latch;
445 // `Latch's terminator instruction is `LatchBr', and it's `LatchBrExitIdx'th
457 : Tag(""), Header(nullptr), Latch(nullptr), LatchBr(nullptr),
465 Result.Latch = cast<BasicBlock>(Map(Latch));
656 BasicBlock *Latch = L.getLoopLatch();
657 if (!L.isLoopExiting(Latch)) {
658 FailureReason = "no loop latch";
669 BranchInst *LatchBr = dyn_cast<BranchInst>(&*Latch->rbegin())
[all...] |
| LoopStrengthReduce.cpp | 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnrollRuntime.cpp | 67 BasicBlock *Latch = L->getLoopLatch();
68 assert(Latch && "Loop must have a latch");
75 for (succ_iterator SBI = succ_begin(Latch), SBE = succ_end(Latch);
92 Value *V = PN->getIncomingValueForBlock(Latch);
149 BasicBlock *Latch = L->getLoopLatch();
181 if (Latch == *BB) {
216 BasicBlock *NewLatch = cast<BasicBlock>(VMap[Latch]);
217 idx = NewPHI->getBasicBlockIndex(Latch);
[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
367 /// \brief Return the latch block if it's one of the exiting blocks. Otherwise,
371 if (MachineBasicBlock *Latch = L->getLoopLatch()) {
372 if (L->isLoopExiting(Latch))
373 return Latch;
387 MachineBasicBlock *Latch = L->getLoopLatch();
389 if (!Header || !Preheader || !Latch || !ExitingBlock)
410 // latch block, and see if is a result of an addition of form "reg+imm"
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
