| /external/llvm/lib/Transforms/Utils/ |
| CmpInstAnalysis.cpp | 45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate()
47 switch (Pred) {
|
| LoopVersioning.cpp | 61 const SCEVUnionPredicate &Pred = LAI.PSE.getUnionPredicate();
65 Exp.expandCodeForPredicate(&Pred, RuntimeCheckBB->getTerminator());
|
| /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);
23 struct Pred
38 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));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvar/ |
| wait_pred.pass.cpp | 15 // void wait(unique_lock<mutex>& lock, Predicate pred);
29 class Pred
33 explicit Pred(int& i) : i_(i) {}
44 cv.wait(lk, Pred(test2));
|
| wait_for_pred.pass.cpp | 18 // Predicate pred);
26 class Pred
30 explicit Pred(int& i) : i_(i) {}
52 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
|
| wait_until_pred.pass.cpp | 18 // Predicate pred);
43 class Pred
47 explicit Pred(int& i) : i_(i) {}
68 bool r = cv.wait_until(lk, t, Pred(test2));
|
| /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) {}
57 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) {}
74 bool r = cv.wait_until(lk, t, Pred(test2));
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyStoreResults.cpp | 102 MachineBasicBlock *Pred =
104 if (!MDT.dominates(&MBB, Pred))
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_pred.pass.cpp | 15 // void wait(Lock& lock, Predicate pred);
33 class Pred
37 explicit Pred(int& i) : i_(i) {}
48 cv.wait(lk, Pred(test2));
|
| wait_for_pred.pass.cpp | 17 // Predicate pred);
25 class Pred
29 explicit Pred(int& i) : i_(i) {}
55 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
|
| wait_until_pred.pass.cpp | 18 // Predicate pred);
43 class Pred
47 explicit Pred(int& i) : i_(i) {}
72 bool r = cv.wait_until(lk, t, 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;
|
| LiveRangeCalc.cpp | 173 // The actual place where a phi operand is used is the end of the pred
296 MachineBasicBlock *Pred = *PI;
299 if (Seen.test(Pred->getNumber())) {
300 if (VNInfo *VNI = Map[Pred].first) {
309 std::tie(Start, End) = Indexes->getMBBRange(Pred);
311 // First time we see Pred. Try to determine the live-out value, but set
312 // it as null if Pred is live-through with an unknown value.
314 setLiveOutValue(Pred, VNI);
322 // No, we need a live-in value for Pred as well
323 if (Pred != &UseMBB
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCBranchSelector.cpp | 193 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
198 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngineObjC.cpp | 23 ExplodedNode *Pred,
25 ProgramStateRef state = Pred->getState();
26 const LocationContext *LCtx = Pred->getLocationContext();
31 StmtNodeBuilder Bldr(Pred, dstIvar, *currBldrCtx);
32 Bldr.generateNode(Ex, Pred, state->BindExpr(Ex, LCtx, location));
40 ExplodedNode *Pred,
42 getCheckerManager().runCheckersForPreStmt(Dst, Pred, S, *this);
46 ExplodedNode *Pred,
75 ProgramStateRef state = Pred->getState();
81 elementV = state->getLValue(elemD, Pred->getLocationContext())
[all...] |
| CoreEngine.cpp | 229 void CoreEngine::dispatchWorkItem(ExplodedNode* Pred, ProgramPoint Loc,
234 HandleBlockEdge(Loc.castAs<BlockEdge>(), Pred);
238 HandleBlockEntrance(Loc.castAs<BlockEntrance>(), Pred);
247 SubEng.processCallEnter(CEnter, Pred);
252 SubEng.processCallExit(Pred);
256 assert(Pred->hasSinglePred() &&
258 ExplodedNode *PNode = Pred->getFirstPred();
259 dispatchWorkItem(Pred, PNode->getLocation(), WU);
267 HandlePostStmt(WU.getBlock(), WU.getIndex(), Pred);
284 void CoreEngine::HandleBlockEdge(const BlockEdge &L, ExplodedNode *Pred) {
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CheckerContext.h | 73 ExplodedNode *Pred;
89 ExplodedNode *pred,
93 Pred(pred),
98 assert(Pred->getState() &&
117 ExplodedNode *getPredecessor() { return Pred; }
118 const ProgramStateRef &getState() const { return Pred->getState(); }
139 return Pred->getLocationContext();
143 return Pred->getStackFrame();
174 return Pred->getLocationContext()->getAnalysisDeclContext()
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 136 const MachineBasicBlock *Pred;
157 Pred(nullptr), Succ(nullptr),
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 127 BlkT *Pred = Preds[p];
130 BBMap.FindAndConstruct(Pred);
137 ValT PredVal = AvailableVals->lookup(Pred);
138 BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal);
240 BBInfo *Pred = Info->Preds[p];
243 if (Pred->BlkNum == 0) {
244 Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater);
245 (*AvailableVals)[Pred->BB] = Pred->AvailableVal
[all...] |
