/*!
* get CallGraph edge via nodes
*/
PTACallGraphEdge* PTACallGraph::getGraphEdge(PTACallGraphNode* src, PTACallGraphNode* dst,PTACallGraphEdge::CEDGEK kind) {
for (PTACallGraphEdge::CallGraphEdgeSet::iterator iter = src->OutEdgeBegin();
iter != src->OutEdgeEnd(); ++iter) {
PTACallGraphEdge* edge = (*iter);
if (edge->getEdgeKind() == kind && edge->getDstID() == dst->getId())
return edge;
}
return NULL;
}
void PTAStat::callgraphStat() {
PTACallGraph* graph = pta->getPTACallGraph();
PointerAnalysis::CallGraphSCC* callgraphSCC = new PointerAnalysis::CallGraphSCC(graph);
callgraphSCC->find();
unsigned totalNode = 0;
unsigned totalCycle = 0;
unsigned nodeInCycle = 0;
unsigned maxNodeInCycle = 0;
unsigned totalEdge = 0;
unsigned edgeInCycle = 0;
std::set<NodeID> sccRepNodeSet;
PTACallGraph::iterator it = graph->begin();
PTACallGraph::iterator eit = graph->end();
for (; it != eit; ++it) {
totalNode++;
if(callgraphSCC->isInCycle(it->first)) {
sccRepNodeSet.insert(callgraphSCC->repNode(it->first));
nodeInCycle++;
const NodeBS& subNodes = callgraphSCC->subNodes(it->first);
if(subNodes.count() > maxNodeInCycle)
maxNodeInCycle = subNodes.count();
}
PTACallGraphNode::const_iterator edgeIt = it->second->InEdgeBegin();
PTACallGraphNode::const_iterator edgeEit = it->second->InEdgeEnd();
for (; edgeIt != edgeEit; ++edgeIt) {
PTACallGraphEdge *edge = *edgeIt;
totalEdge+= edge->getDirectCalls().size() + edge->getIndirectCalls().size();
if(callgraphSCC->repNode(edge->getSrcID()) == callgraphSCC->repNode(edge->getDstID())) {
edgeInCycle+=edge->getDirectCalls().size() + edge->getIndirectCalls().size();
}
}
}
totalCycle = sccRepNodeSet.size();
PTNumStatMap["TotalNode"] = totalNode;
PTNumStatMap["TotalCycle"] = totalCycle;
PTNumStatMap["NodeInCycle"] = nodeInCycle;
PTNumStatMap["MaxNodeInCycle"] = maxNodeInCycle;
PTNumStatMap["TotalEdge"] = totalEdge;
PTNumStatMap["CalRetPairInCycle"] = edgeInCycle;
std::cout << "\n****CallGraph SCC Stat****\n";
PTAStat::printStat();
PTNumStatMap.clear();
delete callgraphSCC;
}
