HomeSort by relevance Sort by last modified time
    Searched defs:Pred (Results 1 - 25 of 288) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/lib/Transforms/Utils/
CmpInstAnalysis.cpp 45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate()
47 switch (Pred) {
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/
copy_if.pass.cpp 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // copy_if(InIter first, InIter last, OutIter result, Pred pred);
36 struct Pred
51 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
  /external/libcxx/test/std/thread/thread.condition/thread.condition.condvar/
wait_pred.pass.cpp 17 // void wait(unique_lock<mutex>& lock, Predicate pred);
31 class Pred
35 explicit Pred(int& i) : i_(i) {}
46 cv.wait(lk, Pred(test2));
wait_for_pred.pass.cpp 20 // Predicate pred);
28 class Pred
32 explicit Pred(int& i) : i_(i) {}
54 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
wait_until_pred.pass.cpp 20 // Predicate pred);
45 class Pred
49 explicit Pred(int& i) : i_(i) {}
70 bool r = cv.wait_until(lk, t, Pred(test2));
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.copy/
copy_if.pass.cpp 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // copy_if(InIter first, InIter last, OutIter result, Pred pred);
23 struct Pred
38 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/thread/thread.condition/thread.condition.condvar/
wait_pred.pass.cpp 17 // void wait(unique_lock<mutex>& lock, Predicate pred);
31 class Pred
35 explicit Pred(int& i) : i_(i) {}
46 cv.wait(lk, Pred(test2));
wait_for_pred.pass.cpp 20 // Predicate pred);
28 class Pred
32 explicit Pred(int& i) : i_(i) {}
54 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
tokens.h 15 #define Pred 35
  /external/libcxx/test/std/thread/thread.condition/thread.condition.condvarany/
wait_pred.pass.cpp 17 // void wait(Lock& lock, Predicate pred);
35 class Pred
39 explicit Pred(int& i) : i_(i) {}
50 cv.wait(lk, Pred(test2));
wait_for_pred.pass.cpp 19 // Predicate pred);
27 class Pred
31 explicit Pred(int& i) : i_(i) {}
58 bool result = cv.wait_for(lk, milliseconds(250), Pred(test2));
wait_until_pred.pass.cpp 20 // Predicate pred);
45 class Pred
49 explicit Pred(int& i) : i_(i) {}
74 bool r = cv.wait_until(lk, t, Pred(test2));
  /external/llvm/lib/Transforms/Scalar/
LoopSimplifyCFG.cpp 52 BasicBlock *Pred = Succ->getSinglePredecessor();
53 if (!Pred || !Pred->getSingleSuccessor() || LI.getLoopFor(Pred) != &L)
56 // Pred is going to disappear, so we need to update the loop info.
57 if (L.getHeader() == Pred)
59 LI.removeBlock(Pred);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/thread/thread.condition/thread.condition.condvarany/
wait_pred.pass.cpp 17 // void wait(Lock& lock, Predicate pred);
35 class Pred
39 explicit Pred(int& i) : i_(i) {}
50 cv.wait(lk, Pred(test2));
wait_for_pred.pass.cpp 19 // Predicate pred);
27 class Pred
31 explicit Pred(int& i) : i_(i) {}
58 bool result = cv.wait_for(lk, milliseconds(250), Pred(test2));
  /external/llvm/lib/CodeGen/
LatencyPriorityQueue.cpp 60 SUnit &Pred = *I->getSUnit();
61 if (!Pred.isScheduled) {
64 if (OnlyAvailablePred && OnlyAvailablePred != &Pred)
66 OnlyAvailablePred = &Pred;
  /external/swiftshader/third_party/LLVM/lib/Target/PowerPC/
PPCBranchSelector.cpp 144 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
152 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
  /external/swiftshader/third_party/LLVM/lib/Target/Sparc/
SparcAsmPrinter.cpp 233 const MachineBasicBlock *Pred = *PI;
235 if (!Pred->isLayoutSuccessor(MBB))
239 MachineBasicBlock::const_iterator I = Pred->end();
240 while (I != Pred->begin() && !(--I)->getDesc().isTerminator())
242 return I == Pred->end() || !I->getDesc().isBarrier();
  /external/llvm/lib/Target/Lanai/
LanaiAsmPrinter.cpp 220 const MachineBasicBlock *Pred = *MBB->pred_begin();
224 if (const BasicBlock *B = Pred->getBasicBlock())
234 MachineBasicBlock::const_iterator I = Pred->end();
235 while (I != Pred->begin() && !(--I)->isTerminator()) {
  /external/llvm/lib/Target/PowerPC/
PPCBranchSelector.cpp 197 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
202 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
LatencyPriorityQueue.cpp 59 SUnit &Pred = *I->getSUnit();
60 if (!Pred.isScheduled) {
63 if (OnlyAvailablePred && OnlyAvailablePred != &Pred)
65 OnlyAvailablePred = &Pred;
LiveRangeCalc.cpp 119 MachineBasicBlock *Pred = *PI;
122 if (Seen.test(Pred->getNumber())) {
123 if (VNInfo *VNI = LiveOut[Pred].first) {
132 tie(Start, End) = Indexes->getMBBRange(Pred);
134 // First time we see Pred. Try to determine the live-out value, but set
135 // it as null if Pred is live-through with an unknown value.
137 setLiveOutValue(Pred, VNI);
145 // No, we need a live-in value for Pred as well
146 if (Pred != KillMBB)
147 WorkList.push_back(Pred);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/FuzzMutate/
OpDescriptor.h 55 PredT Pred;
60 SourcePred(PredT Pred, MakeT Make) : Pred(Pred), Make(Make) {}
61 SourcePred(PredT Pred, NoneType) : Pred(Pred) {
62 Make = [Pred](ArrayRef<Value *> Cur, ArrayRef<Type *> BaseTypes) {
63 // Default filter just calls Pred on each of the base types.
67 if (Pred(Cur, V)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/FuzzMutate/
OpDescriptor.h 55 PredT Pred;
60 SourcePred(PredT Pred, MakeT Make) : Pred(Pred), Make(Make) {}
61 SourcePred(PredT Pred, NoneType) : Pred(Pred) {
62 Make = [Pred](ArrayRef<Value *> Cur, ArrayRef<Type *> BaseTypes) {
63 // Default filter just calls Pred on each of the base types.
67 if (Pred(Cur, V)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/FuzzMutate/
OpDescriptor.h 55 PredT Pred;
60 SourcePred(PredT Pred, MakeT Make) : Pred(Pred), Make(Make) {}
61 SourcePred(PredT Pred, NoneType) : Pred(Pred) {
62 Make = [Pred](ArrayRef<Value *> Cur, ArrayRef<Type *> BaseTypes) {
63 // Default filter just calls Pred on each of the base types.
67 if (Pred(Cur, V)
    [all...]

Completed in 582 milliseconds

1 2 3 4 5 6 7 8 91011>>