HomeSort by relevance Sort by last modified time
    Searched refs:SCC (Results 1 - 12 of 12) sorted by null

  /external/llvm/lib/Transforms/IPO/
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 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) {
    [all...]
Inliner.cpp 124 // When processing our SCC, check to see if CS was inlined from some other
136 if (InlineHistory != -1) // Only do merging for top-level call sites in SCC.
165 // function in this SCC.
336 bool Inliner::runOnSCC(CallGraphSCC &SCC) {
341 DEBUG(dbgs() << "Inliner visiting SCC:");
342 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
359 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
388 // 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);
46 // processing to avoid breaking the SCC traversal.
  /external/llvm/lib/Analysis/IPA/
GlobalsModRef.cpp 371 // We do a bottom-up SCC traversal of the call graph. In other words, we
375 std::vector<CallGraphNode *> &SCC = *I;
376 assert(!SCC.empty() && "SCC with no functions?");
378 if (!SCC[0]->getFunction()) {
381 for (unsigned i = 0, e = SCC.size(); i != e; ++i)
382 FunctionInfo.erase(SCC[i]->getFunction());
386 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()];
393 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) {
394 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");
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.
336 // large scc's
    [all...]
  /external/llvm/include/llvm/
CallGraphSCCPass.h 13 // SCC order: that is, they process function bottom-up, except for recursive
42 /// doInitialization - This method is called before the SCC's of the program
49 /// whatever action is necessary for the specified SCC. Note that
50 /// non-recursive (or only self-recursive) functions will have an SCC size of
51 /// 1, where recursive portions of the call graph will have SCC size > 1.
53 /// SCC passes that add or delete functions to the SCC are required to update
54 /// the SCC list, otherwise stale pointers may be dereferenced.
56 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
58 /// doFinalization - This method is called after the SCC's of the program ha
    [all...]
  /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/llvm/tools/opt/
opt.cpp 162 virtual bool runOnSCC(CallGraphSCC &SCC) {
167 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 427 /// that (icmp SCC (A & B), C) satisfies
429 ICmpInst::Predicate SCC)
434 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ);
    [all...]

Completed in 449 milliseconds