Home
last modified time | relevance | path

Searched refs:SCC (Results 1 – 23 of 23) sorted by relevance

/external/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp50 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()
344 bool FunctionAttrs::AddNoCaptureAttrs(const CallGraphSCC &SCC) { in AddNoCaptureAttrs() argument
351 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddNoCaptureAttrs()
[all …]
DPruneEH.cpp44 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()
160 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
DInlineSimple.cpp55 virtual bool runOnSCC(CallGraphSCC &SCC);
75 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
77 return Inliner::runOnSCC(SCC); in runOnSCC()
DInlineAlways.cpp53 virtual bool runOnSCC(CallGraphSCC &SCC);
104 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
106 return Inliner::runOnSCC(SCC); in runOnSCC()
DInliner.cpp374 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
381 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
398 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
531 if (SCC.isSingular()) { in runOnSCC()
DArgumentPromotion.cpp66 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/
DGlobalsModRef.cpp368 std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
369 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
371 if (!SCC[0]->getFunction()) { in AnalyzeCallGraph()
374 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in AnalyzeCallGraph()
375 FunctionInfo.erase(SCC[i]->getFunction()); in AnalyzeCallGraph()
379 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; in AnalyzeCallGraph()
386 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
387 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph()
412 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
429 if (std::find(SCC.begin(), SCC.end(), CalleeNode) == SCC.end()) in AnalyzeCallGraph()
[all …]
DCallGraphSCCPass.cpp598 bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
600 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
DInlineCost.cpp1160 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp280 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/test/Transforms/SimplifyLibCalls/
D2009-02-11-NotInitialized.ll3 ; Check that nocapture attributes are added when run after an SCC pass.
/external/llvm/lib/Target/R600/
DSIRegisterInfo.td22 def SCC : SIReg<"SCC", 253>;
140 def SCCReg : RegisterClass<"AMDGPU", [i32, i1], 32, (add SCC)>;
DSIInstrInfo.cpp43 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
DSIInstructions.td104 SCC = S_CMPK_EQ_I32 SGPR0, imm
105 VCC = COPY SCC
/external/llvm/include/llvm/Transforms/IPO/
DInlinerPass.h43 virtual bool runOnSCC(CallGraphSCC &SCC);
/external/llvm/include/llvm/Analysis/
DCallGraphSCCPass.h59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
DInlineCost.h114 bool runOnSCC(CallGraphSCC &SCC);
/external/llvm/tools/opt/
Dopt.cpp174 virtual bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
179 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp4180 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), in visitSELECT_CC() local
4182 if (SCC.getNode()) AddToWorkList(SCC.getNode()); in visitSELECT_CC()
4184 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) { in visitSELECT_CC()
4192 if (SCC.getNode() && SCC.getOpcode() == ISD::SETCC) in visitSELECT_CC()
4194 SCC.getOperand(0), SCC.getOperand(1), N2, N3, in visitSELECT_CC()
4195 SCC.getOperand(2)); in visitSELECT_CC()
4494 SDValue SCC = in visitSIGN_EXTEND() local
4498 if (SCC.getNode()) return SCC; in visitSIGN_EXTEND()
4789 SDValue SCC = in visitZERO_EXTEND() local
4793 if (SCC.getNode()) return SCC; in visitZERO_EXTEND()
[all …]
/external/llvm/docs/
DLexicon.rst197 **SCC**
DWritingAnLLVMPass.rst384 ``TODO``: explain briefly what SCC, Tarjan's algo, and B-U mean.
389 in the current SCC and the direct callers and direct callees of the SCC.
392 #. ... *not allowed* to add or remove SCC's from the current Module, though
393 they may change the contents of an SCC.
424 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
/external/llvm/lib/Transforms/InstCombine/
DInstCombineAndOrXor.cpp429 ICmpInst::Predicate SCC) in getTypeOfMaskedICmp() argument
434 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ); in getTypeOfMaskedICmp()
/external/webkit/PerformanceTests/Parser/resources/
Dfinal-url-en16743 http://sunnyvale.ca.gov/City+Council/Boards+and+Commissions/Planning/Minutes/2003-0537+SCC+Church.h…