| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 28 Constant *C = Worklist.pop_back_val(); in findCallees()
170 const SCC *AncestorC = AncestorWorklist.pop_back_val(); in isDescendantOf()
281 std::tie(C, I) = DFSSCCs.pop_back_val(); in insertIncomingEdge()
399 insert(*PendingSCCStack.pop_back_val()); in internalDFS()
401 insert(*DFSStack.pop_back_val().first); in internalDFS()
493 Node *N = Worklist.pop_back_val(); in removeIntraSCCEdge()
558 Node *N = Worklist.pop_back_val(); in updateGraphPtrs()
572 SCC *C = Worklist.pop_back_val(); in updateGraphPtrs()
590 NewSCC->insert(*NodeStack.pop_back_val()); in formSCC()
627 N = &get(*SCCEntryNodes.pop_back_val()); in getNextSCCInPostOrder()
|
| D | CFG.cpp | 63 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
143 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany()
|
| D | IteratedDominanceFrontier.cpp | 62 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
|
| D | EHPersonalities.cpp | 71 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
|
| /external/clang/include/clang/AST/ |
| D | UnresolvedSet.h | 103 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } in erase()
105 void erase(iterator I) { *I.I = decls().pop_back_val(); } in erase()
|
| D | CommentParser.h | 65 Tok = MoreLATokens.pop_back_val(); in consumeToken()
|
| D | ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } in erase()
|
| /external/clang/lib/CodeGen/ |
| D | CodeGenPGO.cpp | 340 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitWhileStmt()
360 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitDoStmt()
384 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitForStmt()
419 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitCXXForRangeStmt()
446 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitObjCForCollectionStmt()
460 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitSwitchStmt()
|
| D | CoverageMappingGen.cpp | 633 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitWhileStmt()
657 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitDoStmt()
680 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitForStmt()
712 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitCXXForRangeStmt()
732 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitObjCForCollectionStmt()
765 BreakContinue BC = BreakContinueStack.pop_back_val(); in VisitSwitchStmt()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | TailRecursionElimination.cpp | 193 Use *U = Worklist.pop_back_val(); in walk()
356 BB = WorklistEscaped.pop_back_val(); in markTails()
361 auto *NextBB = WorklistUnescaped.pop_back_val(); in markTails()
819 BranchInst *BI = UncondBranchPreds.pop_back_val(); in FoldReturnAndProcessPred()
|
| D | ADCE.cpp | 51 Instruction *Curr = Worklist.pop_back_val(); in aggressiveDCE()
|
| D | DCE.cpp | 147 Instruction *I = WorkList.pop_back_val(); in runOnFunction()
|
| D | Reassociate.cpp | 579 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val(); in LinearizeExprTree()
843 NewOp = NodesToRewrite.pop_back_val(); in RewriteExprTree()
1774 Value *LHS = Ops.pop_back_val(); in buildMultiplyTree()
1777 LHS = Builder.CreateMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1779 LHS = Builder.CreateFMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1877 Constant *C = cast<Constant>(Ops.pop_back_val().Op); in OptimizeExpression()
2206 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2213 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2260 Instruction *I = RedoInsts.pop_back_val(); in runOnFunction()
|
| /external/llvm/lib/CodeGen/ |
| D | VirtRegMap.cpp | 426 MI->addRegisterKilled(SuperKills.pop_back_val(), TRI, true); in rewrite()
429 MI->addRegisterDead(SuperDeads.pop_back_val(), TRI, true); in rewrite()
432 MI->addRegisterDefined(SuperDefs.pop_back_val(), TRI); in rewrite()
|
| D | ExecutionDepsFix.cpp | 220 Avail.pop_back_val(); in alloc()
318 TII->setExecutionDomain(dv->Instrs.pop_back_val(), domain); in collapse()
676 dv = Regs.pop_back_val().Value; in visitSoftInstr()
683 DomainValue *Latest = Regs.pop_back_val().Value; in visitSoftInstr()
|
| D | ProcessImplicitDefs.cpp | 164 do processImplicitDef(WorkList.pop_back_val()); in runOnMachineFunction()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | SSAUpdaterImpl.h | 115 Info = WorkList.pop_back_val(); in BuildBlockList()
158 Info = RootList.pop_back_val(); in BuildBlockList()
405 PHI = WorkList.pop_back_val(); in CheckIfPHIMatches()
|
| /external/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 55 const CFGBlock *block = worklist.pop_back_val(); in mapReachability()
|
| /external/llvm/lib/Target/XCore/ |
| D | XCoreLowerThreadLocal.cpp | 135 if (WeakVH WU = WUsers.pop_back_val()) { in replaceConstantExprOp()
167 if (WeakVH WU = WUsers.pop_back_val()) { in rewriteNonInstructionUses()
|
| /external/clang/include/clang/Lex/ |
| D | PreprocessorLexer.h | 116 CI = ConditionalStack.pop_back_val(); in popConditionalLevel()
|
| /external/llvm/include/llvm/Transforms/InstCombine/ |
| D | InstCombineWorklist.h | 87 Instruction *I = Worklist.pop_back_val(); in RemoveOne()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | ExplodedGraph.cpp | 365 const ExplodedNode *N = WL1.pop_back_val(); in trim()
390 const ExplodedNode *N = WL2.pop_back_val(); in trim()
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyCFGStackify.cpp | 189 MachineBasicBlock *Succ = Succs.pop_back_val(); in SortBlocks()
247 assert(OnStack.pop_back_val() == nullptr && in SortBlocks()
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 333 ModuleFile *CurrentModule = Queue.pop_back_val(); in visit()
405 NextModule = State->Stack.pop_back_val(); in visit()
|
| /external/llvm/include/llvm/Analysis/ |
| D | PtrUseVisitor.h | 218 UseToVisit ToVisit = Worklist.pop_back_val(); in visitPtr()
|