Home
last modified time | relevance | path

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

12

/external/llvm/lib/Transforms/IPO/
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()
158 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()
DFunctionAttrs.cpp54 bool runOnSCC(CallGraphSCC &SCC);
57 bool AddReadAttrs(const CallGraphSCC &SCC);
60 bool AddArgumentAttrs(const CallGraphSCC &SCC);
67 bool AddNoAliasAttrs(const CallGraphSCC &SCC);
121 bool annotateLibraryCalls(const CallGraphSCC &SCC);
148 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { in AddReadAttrs() argument
153 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in AddReadAttrs()
159 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
262 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
499 bool FunctionAttrs::AddArgumentAttrs(const CallGraphSCC &SCC) { in AddArgumentAttrs() argument
[all …]
DInlineAlways.cpp53 virtual bool runOnSCC(CallGraphSCC &SCC);
104 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
106 return Inliner::runOnSCC(SCC); in runOnSCC()
DInliner.cpp397 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
404 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
421 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
554 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.cpp1164 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
DSIInstrInfo.cpp46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
DSIInstructions.td78 SCC = S_CMPK_EQ_I32 SGPR0, imm
79 VCC = COPY SCC
/external/mesa3d/src/gallium/drivers/radeon/
DSIInstrInfo.cpp46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
DSIInstructions.td78 SCC = S_CMPK_EQ_I32 SGPR0, imm
79 VCC = COPY SCC
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
Dcode.c636 typedef struct SCC { struct
638 } SCC; argument
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) in SCC_init()
652 static SCC *
654 SCC *s = malloc(sizeof(SCC)); in SCC_new()
[all …]
/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/include/llvm/Transforms/IPO/
DInlinerPass.h43 virtual bool runOnSCC(CallGraphSCC &SCC);
/external/llvm/test/Transforms/InstCombine/
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>;
146 def SCCReg : RegisterClass<"AMDGPU", [i32, i1], 32, (add SCC)>;
DSIInstrInfo.cpp43 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
/external/llvm/include/llvm/Analysis/
DCallGraphSCCPass.h59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
DInlineCost.h113 bool runOnSCC(CallGraphSCC &SCC);
/external/llvm/tools/opt/
Dopt.cpp175 virtual bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
180 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp4273 SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), in visitSELECT_CC() local
4275 if (SCC.getNode()) { in visitSELECT_CC()
4276 AddToWorkList(SCC.getNode()); in visitSELECT_CC()
4278 if (ConstantSDNode *SCCC = dyn_cast<ConstantSDNode>(SCC.getNode())) { in visitSELECT_CC()
4286 if (SCC.getOpcode() == ISD::SETCC) in visitSELECT_CC()
4288 SCC.getOperand(0), SCC.getOperand(1), N2, N3, in visitSELECT_CC()
4289 SCC.getOperand(2)); in visitSELECT_CC()
4586 SDValue SCC = in visitSIGN_EXTEND() local
4590 if (SCC.getNode()) return SCC; in visitSIGN_EXTEND()
4883 SDValue SCC = in visitZERO_EXTEND() local
[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;

12