Lines Matching refs:SCC
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();
412 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end();
426 // Can't say anything about it. However, if it is inside our SCC,
429 if (std::find(SCC.begin(), SCC.end(), CalleeNode) == SCC.end())
437 // If we can't say anything useful about this SCC, remove all SCC functions
440 for (unsigned i = 0, e = SCC.size(); i != e; ++i)
441 FunctionInfo.erase(SCC[i]->getFunction());
446 for (unsigned i = 0, e = SCC.size(); i != e && FunctionEffect != ModRef;++i)
447 for (inst_iterator II = inst_begin(SCC[i]->getFunction()),
448 E = inst_end(SCC[i]->getFunction());
476 // Finally, now that we know the full effect on this SCC, clone the
477 // information to each function in the SCC.
478 for (unsigned i = 1, e = SCC.size(); i != e; ++i)
479 FunctionInfo[SCC[i]->getFunction()] = FR;
