HomeSort by relevance Sort by last modified time
    Searched refs:pop_back_val (Results 1 - 25 of 166) sorted by null

1 2 3 4 5 6 7

  /external/clang/include/clang/AST/
UnresolvedSet.h 103 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); }
105 void erase(iterator I) { *I.I = decls().pop_back_val(); }
CommentParser.h 65 Tok = MoreLATokens.pop_back_val();
ASTUnresolvedSet.h 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); }
  /external/clang/include/clang/Lex/
PreprocessorLexer.h 116 CI = ConditionalStack.pop_back_val();
  /external/clang/lib/Analysis/
CFGReachabilityAnalysis.cpp 55 const CFGBlock *block = worklist.pop_back_val();
  /external/llvm/lib/Transforms/Scalar/
ADCE.cpp 51 Instruction *Curr = Worklist.pop_back_val();
DCE.cpp 147 Instruction *I = WorkList.pop_back_val();
LoopInstSimplify.cpp 108 WorklistItem Item = VisitStack.pop_back_val();
TailRecursionElimination.cpp 193 Use *U = Worklist.pop_back_val();
356 BB = WorklistEscaped.pop_back_val();
361 auto *NextBB = WorklistUnescaped.pop_back_val();
    [all...]
  /external/llvm/include/llvm/Transforms/InstCombine/
InstCombineWorklist.h 87 Instruction *I = Worklist.pop_back_val();
  /external/llvm/lib/Analysis/
IteratedDominanceFrontier.cpp 62 DomTreeNode *Node = Worklist.pop_back_val();
LazyCallGraph.cpp 28 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...]
EHPersonalities.cpp 71 std::tie(Visiting, Color) = Worklist.pop_back_val();
CFG.cpp 63 InStack.erase(VisitStack.pop_back_val().first);
143 BasicBlock *BB = Worklist.pop_back_val();
  /external/llvm/lib/Target/XCore/
XCoreLowerThreadLocal.cpp 135 if (WeakVH WU = WUsers.pop_back_val()) {
167 if (WeakVH WU = WUsers.pop_back_val()) {
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 115 Info = WorkList.pop_back_val();
158 Info = RootList.pop_back_val();
405 PHI = WorkList.pop_back_val();
  /external/llvm/lib/CodeGen/
VirtRegMap.cpp 426 MI->addRegisterKilled(SuperKills.pop_back_val(), TRI, true);
429 MI->addRegisterDead(SuperDeads.pop_back_val(), TRI, true);
432 MI->addRegisterDefined(SuperDefs.pop_back_val(), TRI);
ExecutionDepsFix.cpp 220 Avail.pop_back_val();
318 TII->setExecutionDomain(dv->Instrs.pop_back_val(), domain);
676 dv = Regs.pop_back_val().Value;
683 DomainValue *Latest = Regs.pop_back_val().Value;
ProcessImplicitDefs.cpp 164 do processImplicitDef(WorkList.pop_back_val());
  /external/llvm/include/llvm/ADT/
SetVector.h 197 T LLVM_ATTRIBUTE_UNUSED_RESULT pop_back_val() {
  /external/llvm/include/llvm/Analysis/
PtrUseVisitor.h 218 UseToVisit ToVisit = Worklist.pop_back_val();
  /external/llvm/lib/IR/
TypeFinder.cpp 104 Ty = TypeWorklist.pop_back_val();
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyRegStackify.cpp 250 assert(Stack.pop_back_val() == VReg);
  /external/llvm/lib/Transforms/ObjCARC/
ProvenanceAnalysis.cpp 82 P = Worklist.pop_back_val();
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 365 const ExplodedNode *N = WL1.pop_back_val();
390 const ExplodedNode *N = WL2.pop_back_val();

Completed in 1447 milliseconds

1 2 3 4 5 6 7