Searched refs:pop_back_val (Results 1 - 25 of 137) sorted by relevance

123456

/external/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp55 const CFGBlock *block = worklist.pop_back_val();
/external/clang/include/clang/AST/
H A DCommentParser.h65 Tok = MoreLATokens.pop_back_val();
H A DASTUnresolvedSet.h67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); }
H A DUnresolvedSet.h143 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); }
145 void erase(iterator I) { *I.ir = decls().pop_back_val(); }
/external/clang/include/clang/Lex/
H A DPreprocessorLexer.h116 CI = ConditionalStack.pop_back_val();
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h78 Instruction *I = Worklist.pop_back_val();
/external/llvm/lib/Transforms/Scalar/
H A DADCE.cpp72 Instruction* curr = worklist.pop_back_val();
H A DLoopInstSimplify.cpp103 WorklistItem Item = VisitStack.pop_back_val();
H A DTailRecursionElimination.cpp187 Use *U = Worklist.pop_back_val();
350 BB = WorklistEscaped.pop_back_val();
355 auto *NextBB = WorklistUnescaped.pop_back_val();
819 BranchInst *BI = UncondBranchPreds.pop_back_val();
/external/llvm/lib/Analysis/
H A DLazyCallGraph.cpp28 Constant *C = Worklist.pop_back_val();
170 const SCC *AncestorC = AncestorWorklist.pop_back_val();
281 std::tie(C, I) = DFSSCCs.pop_back_val();
399 insert(*PendingSCCStack.pop_back_val());
401 insert(*DFSStack.pop_back_val().first);
493 Node *N = Worklist.pop_back_val();
558 Node *N = Worklist.pop_back_val();
572 SCC *C = Worklist.pop_back_val();
590 NewSCC->insert(*NodeStack.pop_back_val());
627 N = &get(*SCCEntryNodes.pop_back_val());
[all...]
H A DCaptureTracking.cpp100 const Use *U = Worklist.pop_back_val();
H A DCFG.cpp63 InStack.erase(VisitStack.pop_back_val().first);
143 BasicBlock *BB = Worklist.pop_back_val();
H A DCGSCCPassManager.cpp107 std::make_pair(InvalidatedPassIDs.pop_back_val(), C));
/external/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp134 if (WeakVH WU = WUsers.pop_back_val()) {
166 if (WeakVH WU = WUsers.pop_back_val()) {
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h115 Info = WorkList.pop_back_val();
158 Info = RootList.pop_back_val();
405 PHI = WorkList.pop_back_val();
/external/llvm/lib/CodeGen/
H A DVirtRegMap.cpp379 MI->addRegisterKilled(SuperKills.pop_back_val(), TRI, true);
382 MI->addRegisterDead(SuperDeads.pop_back_val(), TRI, true);
385 MI->addRegisterDefined(SuperDefs.pop_back_val(), TRI);
H A DExecutionDepsFix.cpp213 Avail.pop_back_val();
311 TII->setExecutionDomain(dv->Instrs.pop_back_val(), domain);
671 dv = Regs.pop_back_val().Value;
678 DomainValue *Latest = Regs.pop_back_val().Value;
H A DProcessImplicitDefs.cpp163 do processImplicitDef(WorkList.pop_back_val());
/external/llvm/include/llvm/ADT/
H A DSetVector.h173 T LLVM_ATTRIBUTE_UNUSED_RESULT pop_back_val() {
/external/llvm/include/llvm/Analysis/
H A DPtrUseVisitor.h218 UseToVisit ToVisit = Worklist.pop_back_val();
/external/llvm/lib/IR/
H A DTypeFinder.cpp104 Ty = TypeWorklist.pop_back_val();
/external/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp81 P = Worklist.pop_back_val();
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp365 const ExplodedNode *N = WL1.pop_back_val();
395 const ExplodedNode *N = WL2.pop_back_val();
/external/clang/lib/CodeGen/
H A DCodeGenPGO.cpp488 BreakContinue BC = BreakContinueStack.pop_back_val();
508 BreakContinue BC = BreakContinueStack.pop_back_val();
547 BreakContinue BC = BreakContinueStack.pop_back_val();
585 BreakContinue BC = BreakContinueStack.pop_back_val();
607 BreakContinue BC = BreakContinueStack.pop_back_val();
620 BreakContinue BC = BreakContinueStack.pop_back_val();
/external/clang/include/clang/Analysis/Support/
H A DBumpVector.h126 T pop_back_val() { function in class:clang::BumpVector

Completed in 1871 milliseconds

123456