| /external/llvm/lib/Transforms/IPO/ |
| InlineSimple.cpp | 55 virtual bool runOnSCC(CallGraphSCC &SCC);
75 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) {
77 return Inliner::runOnSCC(SCC);
|
| InlineAlways.cpp | 53 virtual bool runOnSCC(CallGraphSCC &SCC);
104 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) {
106 return Inliner::runOnSCC(SCC);
|
| PruneEH.cpp | 43 // runOnSCC - Analyze the SCC, performing the transformation if possible.
44 bool runOnSCC(CallGraphSCC &SCC);
61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) {
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.end(); I != E; ++I
[all...] |
| FunctionAttrs.cpp | 53 // runOnSCC - Analyze the SCC, performing the transformation if possible.
54 bool runOnSCC(CallGraphSCC &SCC);
56 // AddReadAttrs - Deduce readonly/readnone attributes for the SCC.
57 bool AddReadAttrs(const CallGraphSCC &SCC);
59 // AddArgumentAttrs - Deduce nocapture attributes for the SCC.
60 bool AddArgumentAttrs(const CallGraphSCC &SCC);
66 // AddNoAliasAttrs - Deduce noalias attributes for the SCC.
67 bool AddNoAliasAttrs(const CallGraphSCC &SCC);
121 bool annotateLibraryCalls(const CallGraphSCC &SCC);
147 /// AddReadAttrs - Deduce readonly/readnone attributes for the SCC
[all...] |
| Inliner.cpp | 154 // When processing our SCC, check to see if CS was inlined from some other
166 if (InlineHistory != -1) // Only do merging for top-level call sites in SCC.
203 // function in this SCC.
397 bool Inliner::runOnSCC(CallGraphSCC &SCC) {
403 DEBUG(dbgs() << "Inliner visiting SCC:");
404 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
421 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
450 // current SCC to the end of the list
[all...] |
| ArgumentPromotion.cpp | 66 virtual bool runOnSCC(CallGraphSCC &SCC);
99 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) {
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);
[all...] |
| /external/llvm/include/llvm/Transforms/IPO/ |
| InlinerPass.h | 43 virtual bool runOnSCC(CallGraphSCC &SCC);
47 // processing to avoid breaking the SCC traversal.
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| SIInstrInfo.cpp | 43 // If we are trying to copy to or from SCC, there is a bug somewhere else in
46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC);
|
| SIGenRegisterInfo.pl | 92 def SCC : SIReg<"SCC">;
171 def SCCReg : RegisterClass<"AMDGPU", [i1], 1, (add SCC)>;
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| SIInstrInfo.cpp | 43 // If we are trying to copy to or from SCC, there is a bug somewhere else in
46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC);
|
| SIGenRegisterInfo.pl | 92 def SCC : SIReg<"SCC">;
171 def SCCReg : RegisterClass<"AMDGPU", [i1], 1, (add SCC)>;
|
| /external/llvm/lib/Analysis/IPA/ |
| GlobalsModRef.cpp | 364 // We do a bottom-up SCC traversal of the call graph. In other words, we
368 std::vector<CallGraphNode *> &SCC = *I;
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[i]->getFunction()
[all...] |
| CallGraphSCCPass.cpp | 13 // call-graph in SCC order: that is, they process function bottom-up, except for
33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
35 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
62 // CGPassManager walks SCC and it needs CallGraph.
76 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
142 // Run pass P on all functions in the current SCC.
155 DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: "
177 DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
187 // Scan all functions in the SCC.
341 // large scc's
[all...] |
| InlineCost.cpp | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 13 // SCC order: that is, they process function bottom-up, except for recursive
45 /// doInitialization - This method is called before the SCC's of the program
52 /// whatever action is necessary for the specified SCC. Note that
53 /// non-recursive (or only self-recursive) functions will have an SCC size of
54 /// 1, where recursive portions of the call graph will have SCC size > 1.
56 /// SCC passes that add or delete functions to the SCC are required to update
57 /// the SCC list, otherwise stale pointers may be dereferenced.
59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
61 /// doFinalization - This method is called after the SCC's of the program ha
[all...] |
| InlineCost.h | 113 bool runOnSCC(CallGraphSCC &SCC);
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 247 // Test SCC computation against every graph with NUM_NODES nodes or less.
248 // Since SCC considers every node to have an implicit self-edge, we only
274 // Test the SCC logic on this graph.
276 /// NodesInSomeSCC - Those nodes which are in some SCC.
280 std::vector<GT::NodeType*> &SCC = *I;
282 // Get the nodes in this SCC as a NodeSubset rather than a vector.
284 for (unsigned i = 0, e = SCC.size(); i != e; ++i)
285 NodesInThisSCC.AddNode(SCC[i]->first);
287 // There should be at least one node in every SCC.
290 // Check that every node in the SCC is reachable from every other node i
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| code.c | 636 typedef struct SCC {
638 } 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 *s = malloc(sizeof(SCC))
729 SCC scc; local
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIInstrInfo.cpp | 40 // If we are trying to copy to or from SCC, there is a bug somewhere else in
43 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC);
|
| /external/llvm/tools/opt/ |
| opt.cpp | 175 virtual bool runOnSCC(CallGraphSCC &SCC) {
180 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAndOrXor.cpp | 423 /// that (icmp SCC (A & B), C) satisfies
425 ICmpInst::Predicate SCC)
430 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ);
[all...] |
