/external/llvm/lib/Transforms/IPO/ |
H A D | InlineAlways.cpp | 55 bool runOnSCC(CallGraphSCC &SCC) override; 105 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { argument 107 return Inliner::runOnSCC(SCC);
|
H A D | InlineSimple.cpp | 56 bool runOnSCC(CallGraphSCC &SCC) override; 93 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { argument 95 return Inliner::runOnSCC(SCC);
|
H A D | PruneEH.cpp | 44 // runOnSCC - Analyze the SCC, performing the transformation if possible. 45 bool runOnSCC(CallGraphSCC &SCC) override; 62 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { argument 67 // Fill SCCNodes with the elements of the SCC. Used for quickly 68 // looking up whether a given CallGraphNode is in this SCC. 69 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 72 // First pass, scan all of the functions in the SCC, simplifying them 74 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC [all...] |
H A D | Inliner.cpp | 163 // When processing our SCC, check to see if CS was inlined from some other 175 if (InlineHistory != -1) // Only do merging for top-level call sites in SCC. 212 // function in this SCC. 441 bool Inliner::runOnSCC(CallGraphSCC &SCC) { argument 448 DEBUG(dbgs() << "Inliner visiting SCC:"); 449 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 466 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 495 // current SCC t [all...] |
H A D | ArgumentPromotion.cpp | 69 bool runOnSCC(CallGraphSCC &SCC) override; 105 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { argument 111 do { // Iterate until we stop promoting from this SCC. 113 // Attempt to promote arguments from all functions in this SCC. 114 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 117 SCC.ReplaceNode(*I, CGN);
|
H A D | FunctionAttrs.cpp | 54 // runOnSCC - Analyze the SCC, performing the transformation if possible. 55 bool runOnSCC(CallGraphSCC &SCC) override; 57 // AddReadAttrs - Deduce readonly/readnone attributes for the SCC. 58 bool AddReadAttrs(const CallGraphSCC &SCC); 60 // AddArgumentAttrs - Deduce nocapture attributes for the SCC. 61 bool AddArgumentAttrs(const CallGraphSCC &SCC); 67 // AddNoAliasAttrs - Deduce noalias attributes for the SCC. 68 bool AddNoAliasAttrs(const CallGraphSCC &SCC); 122 bool annotateLibraryCalls(const CallGraphSCC &SCC); 149 /// AddReadAttrs - Deduce readonly/readnone attributes for the SCC 150 AddReadAttrs(const CallGraphSCC &SCC) argument 519 AddArgumentAttrs(const CallGraphSCC &SCC) argument 782 AddNoAliasAttrs(const CallGraphSCC &SCC) argument 1680 annotateLibraryCalls(const CallGraphSCC &SCC) argument 1695 runOnSCC(CallGraphSCC &SCC) argument [all...] |
/external/llvm/unittests/Analysis/ |
H A D | LazyCallGraphTest.cpp | 56 // All call edges go up between SCCs, and clockwise around the SCC. 208 LazyCallGraph::SCC &D = *SCCI++; 222 LazyCallGraph::SCC &C = *SCCI++; 236 LazyCallGraph::SCC &B = *SCCI++; 252 LazyCallGraph::SCC &A = *SCCI++; 327 // Two interlocking cycles. The really useful thing about this SCC is that it 329 // children of each node in the SCC. 361 LazyCallGraph::SCC &SCC = *SCCI++; local 369 EXPECT_EQ(&SCC, C 638 LazyCallGraph::SCC &SCC = *SCCI++; local 691 LazyCallGraph::SCC &SCC = *SCCI++; local [all...] |
/external/llvm/lib/Analysis/IPA/ |
H A D | GlobalsModRef.cpp | 359 // We do a bottom-up SCC traversal of the call graph. In other words, we 362 const std::vector<CallGraphNode *> &SCC = *I; local 363 assert(!SCC.empty() && "SCC with no functions?"); 365 if (!SCC[0]->getFunction()) { 368 for (unsigned i = 0, e = SCC.size(); i != e; ++i) 369 FunctionInfo.erase(SCC[i]->getFunction()); 373 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; 380 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { 381 Function *F = SCC[ [all...] |
H A D | InlineCost.cpp | 1235 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) { argument
|
/external/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As 62 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC 64 /// that functions already visited in a bottom-up order of the SCC DAG are no 66 /// a bottom-up order of the SCC DAG are not required to have already been 70 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points 71 /// in the SCC DAG, the more independence there is in optimizing within it. 106 class SCC; 162 friend class LazyCallGraph::SCC; 205 /// \brief An SCC o 210 class SCC { class in class:llvm::LazyCallGraph 218 SCC(LazyCallGraph &G) : G(&G) {} function in class:llvm::LazyCallGraph::SCC [all...] |
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfoImpl.cpp | 596 const std::vector<const IrreducibleGraph::IrrNode *> &SCC, 598 // Map from nodes in the SCC to whether it's an entry block. 602 for (const auto *I : SCC) 662 const std::vector<const IrreducibleGraph::IrrNode *> &SCC) { 663 // Translate the SCC into RPO. 668 findIrreducibleHeaders(BFI, G, SCC, Headers, Others); 692 // Translate the SCC into RPO. 593 findIrreducibleHeaders( const BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G, const std::vector<const IrreducibleGraph::IrrNode *> &SCC, LoopData::NodeList &Headers, LoopData::NodeList &Others) argument 659 createIrreducibleLoop( BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert, const std::vector<const IrreducibleGraph::IrrNode *> &SCC) argument
|
H A D | LazyCallGraph.cpp | 159 void LazyCallGraph::SCC::insert(Node &N) { 165 bool LazyCallGraph::SCC::isDescendantOf(const SCC &C) const { 166 // Walk up the parents of this SCC and verify that we eventually find C. 167 SmallVector<const SCC *, 4> AncestorWorklist; 170 const SCC *AncestorC = AncestorWorklist.pop_back_val(); 173 for (const SCC *ParentC : AncestorC->ParentSCCs) 180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) { 184 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); 185 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC 701 printSCC(raw_ostream &OS, LazyCallGraph::SCC &SCC) argument [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
H A D | code.c | 636 typedef struct SCC { struct 638 } SCC; typedef in typeref:struct:SCC 640 static void SCC_init(SCC*, unsigned int); 641 static SCC *SCC_new(unsigned int); 642 static void SCC_destroy(SCC*); 643 static void SCC_delete(SCC*); 644 static void SCC_traverse(SCC*, State*); 647 SCC_init(SCC *s, unsigned int size) 652 static SCC * 654 SCC * [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAndOrXor.cpp | 415 /// that (icmp SCC (A & B), C) satisfies 417 ICmpInst::Predicate SCC) 422 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ); 416 getTypeOfMaskedICmp(Value* A, Value* B, Value* C, ICmpInst::Predicate SCC) argument
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | DAGCombiner.cpp | 4761 SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), 4763 if (SCC.getNode()) { 4764 AddToWorkList(SCC.getNode()); 4766 if (ConstantSDNode *SCCC = dyn_cast<ConstantSDNode>(SCC.getNode())) { 4774 if (SCC.getOpcode() == ISD::SETCC) 4776 SCC.getOperand(0), SCC.getOperand(1), N2, N3, 4777 SCC.getOperand(2)); 5126 SDValue SCC = local 5130 if (SCC 5427 SDValue SCC = local 5606 SDValue SCC = local 10966 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2, local 11119 SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), local 11291 SDValue Temp, SCC; local [all...] |