Searched defs:SCC (Results 1 - 9 of 9) sorted by relevance
/external/llvm/lib/Transforms/IPO/ |
H A D | PruneEH.cpp | 43 // runOnSCC - Analyze the SCC, performing the transformation if possible. 44 bool runOnSCC(CallGraphSCC &SCC); 61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { argument 66 // Fill SCCNodes with the elements of the SCC. Used for quickly 67 // looking up whether a given CallGraphNode is in this SCC. 68 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 71 // First pass, scan all of the functions in the SCC, simplifying them 73 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC [all...] |
H A D | FunctionAttrs.cpp | 49 // runOnSCC - Analyze the SCC, performing the transformation if possible. 50 bool runOnSCC(CallGraphSCC &SCC); 52 // AddReadAttrs - Deduce readonly/readnone attributes for the SCC. 53 bool AddReadAttrs(const CallGraphSCC &SCC); 55 // AddNoCaptureAttrs - Deduce nocapture attributes for the SCC. 56 bool AddNoCaptureAttrs(const CallGraphSCC &SCC); 62 // AddNoAliasAttrs - Deduce noalias attributes for the SCC. 63 bool AddNoAliasAttrs(const CallGraphSCC &SCC); 86 /// AddReadAttrs - Deduce readonly/readnone attributes for the SCC. 87 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { argument 340 AddNoCaptureAttrs(const CallGraphSCC &SCC) argument 541 AddNoAliasAttrs(const CallGraphSCC &SCC) argument 590 runOnSCC(CallGraphSCC &SCC) argument [all...] |
H A D | Inliner.cpp | 125 // When processing our SCC, check to see if CS was inlined from some other 137 if (InlineHistory != -1) // Only do merging for top-level call sites in SCC. 166 // function in this SCC. 340 bool Inliner::runOnSCC(CallGraphSCC &SCC) { argument 346 DEBUG(dbgs() << "Inliner visiting SCC:"); 347 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 364 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 393 // current SCC t [all...] |
H A D | ArgumentPromotion.cpp | 66 virtual bool runOnSCC(CallGraphSCC &SCC); 99 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { argument 102 do { // Iterate until we stop promoting from this SCC. 104 // Attempt to promote arguments from all functions in this SCC. 105 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 108 SCC.ReplaceNode(*I, CGN);
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 13 // call-graph in SCC order: that is, they process function bottom-up, except for 35 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC"); 59 // CGPassManager walks SCC and it needs CallGraph. 73 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n"; 139 // Run pass P on all functions in the current SCC. 152 DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: " 174 DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size() 184 // Scan all functions in the SCC. 344 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n"; 352 dbgs() << "CGSCCPASSMGR: SCC Refres 595 runOnSCC(CallGraphSCC &SCC) argument [all...] |
H A D | GlobalsModRef.cpp | 364 // We do a bottom-up SCC traversal of the call graph. In other words, we 368 std::vector<CallGraphNode *> &SCC = *I; local 369 assert(!SCC.empty() && "SCC with no functions?"); 371 if (!SCC[0]->getFunction()) { 374 for (unsigned i = 0, e = SCC.size(); i != e; ++i) 375 FunctionInfo.erase(SCC[i]->getFunction()); 379 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; 386 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { 387 Function *F = SCC[ [all...] |
/external/llvm/tools/opt/ |
H A D | opt.cpp | 170 virtual bool runOnSCC(CallGraphSCC &SCC) { argument 175 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAndOrXor.cpp | 427 /// that (icmp SCC (A & B), C) satisfies 429 ICmpInst::Predicate SCC) 434 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ); 428 getTypeOfMaskedICmp(Value* A, Value* B, Value* C, ICmpInst::Predicate SCC) argument
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | DAGCombiner.cpp | 4130 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), 4132 if (SCC.getNode()) AddToWorkList(SCC.getNode()); 4134 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) { 4142 if (SCC.getNode() && SCC.getOpcode() == ISD::SETCC) 4144 SCC.getOperand(0), SCC.getOperand(1), N2, N3, 4145 SCC.getOperand(2)); 4446 SDValue SCC local 4741 SDValue SCC = local 4921 SDValue SCC = local 8498 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2, local 8645 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), local [all...] |
Completed in 375 milliseconds