| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 50 bool runOnSCC(CallGraphSCC &SCC);
53 bool AddReadAttrs(const CallGraphSCC &SCC);
56 bool AddNoCaptureAttrs(const CallGraphSCC &SCC);
63 bool AddNoAliasAttrs(const CallGraphSCC &SCC);
87 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { in AddReadAttrs() argument
92 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in AddReadAttrs()
98 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
201 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
340 bool FunctionAttrs::AddNoCaptureAttrs(const CallGraphSCC &SCC) { in AddNoCaptureAttrs() argument
347 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddNoCaptureAttrs()
[all …]
|
| D | PruneEH.cpp | 44 bool runOnSCC(CallGraphSCC &SCC);
61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
68 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
73 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
85 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runOnSCC()
139 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
156 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
|
| D | Inliner.cpp | 336 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
342 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
359 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
492 if (SCC.isSingular()) { in runOnSCC()
|
| D | ArgumentPromotion.cpp | 66 virtual bool runOnSCC(CallGraphSCC &SCC);
99 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
105 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
108 SCC.ReplaceNode(*I, CGN); in runOnSCC()
|
| /external/llvm/lib/Analysis/IPA/ |
| D | GlobalsModRef.cpp | 375 std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
376 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
378 if (!SCC[0]->getFunction()) { in AnalyzeCallGraph()
381 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in AnalyzeCallGraph()
382 FunctionInfo.erase(SCC[i]->getFunction()); in AnalyzeCallGraph()
386 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; in AnalyzeCallGraph()
393 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
394 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph()
419 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
436 if (std::find(SCC.begin(), SCC.end(), CalleeNode) == SCC.end()) in AnalyzeCallGraph()
[all …]
|
| D | CallGraphSCCPass.cpp | 593 bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
595 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 280 std::vector<GT::NodeType*> &SCC = *I; in TEST() local
284 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in TEST()
285 NodesInThisSCC.AddNode(SCC[i]->first); in TEST()
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| D | InlinerPass.h | 43 virtual bool runOnSCC(CallGraphSCC &SCC);
|
| /external/llvm/test/Transforms/SimplifyLibCalls/ |
| D | 2009-02-11-NotInitialized.ll | 3 ; Check that nocapture attributes are added when run after an SCC pass.
|
| /external/llvm/include/llvm/ |
| D | CallGraphSCCPass.h | 56 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
|
| /external/llvm/tools/opt/ |
| D | opt.cpp | 162 virtual bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
167 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | DAGCombiner.cpp | 4080 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), in visitSELECT_CC() local
4082 if (SCC.getNode()) AddToWorkList(SCC.getNode()); in visitSELECT_CC()
4084 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) { in visitSELECT_CC()
4092 if (SCC.getNode() && SCC.getOpcode() == ISD::SETCC) in visitSELECT_CC()
4094 SCC.getOperand(0), SCC.getOperand(1), N2, N3, in visitSELECT_CC()
4095 SCC.getOperand(2)); in visitSELECT_CC()
4396 SDValue SCC = in visitSIGN_EXTEND() local
4400 if (SCC.getNode()) return SCC; in visitSIGN_EXTEND()
4689 SDValue SCC = in visitZERO_EXTEND() local
4693 if (SCC.getNode()) return SCC; in visitZERO_EXTEND()
[all …]
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineAndOrXor.cpp | 429 ICmpInst::Predicate SCC) in getTypeOfMaskedICmp() argument
434 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ); in getTypeOfMaskedICmp()
|
| /external/webkit/PerformanceTests/Parser/resources/ |
| D | final-url-en | 16743 http://sunnyvale.ca.gov/City+Council/Boards+and+Commissions/Planning/Minutes/2003-0537+SCC+Church.h…
|