6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-22 23:24:59 +00:00
Code Issues Projects Releases Wiki Activity

* Changes to compile successfully with GCC 3.0

Browse Source 
* Eliminated memory leak in processGraph
* Pass vectors by const reference to moveDummyCode instead of by copy


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1808 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2002-02-26 19:40:28 +00:00
parent 2d9bbfdfc4
commit fd1717d03b
4 changed files with 132 additions and 185 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp
View File

@@ -1,13 +1,20 @@
//===--Graph.cpp--- implements Graph class ---------------- ------*- C++ -*--=//
//
// This implements Graph for helping in trace generation
// This graph gets used by "PathProfile" class
// This graph gets used by "ProfilePaths" class
//
//===----------------------------------------------------------------------===//
#include "Graph.h"
#include "llvm/BasicBlock.h"
#include <algorithm>
#include <iostream>
using std::list;
using std::set;
using std::map;
using std::vector;
using std::cerr;
static const graphListElement *findNodeInList(const Graph::nodeList &NL,
Node *N) {
@@ -180,8 +187,8 @@ struct compare_nodes {
};
void printNode(Node *nd){
cerr<<"Node:"<<nd->getElement()->getName()<<endl;
static void printNode(Node *nd){
cerr<<"Node:"<<nd->getElement()->getName()<<"\n";
}
//Get the Maximal spanning tree (also a graph)
@@ -233,7 +240,7 @@ Graph* Graph::getMaxSpanningTree(){
while(!vt.empty()){
Node *u=*(min_element(vt.begin(), vt.end(), compare_nodes()));
#ifdef DEBUG_PATH_PROFILES
cerr<<"popped wt"<<(u)->getWeight()<<endl;
cerr<<"popped wt"<<(u)->getWeight()<<"\n";
printNode(u);
#endif
if(parent[u]!=NULL){ //so not root
@@ -270,8 +277,8 @@ Graph* Graph::getMaxSpanningTree(){
}
}
#ifdef DEBUG_PATH_PROFILES
cerr<<"wt:v->wt"<<weight<<":"<<v->getWeight()<<endl;
printNode(v);cerr<<"node wt:"<<(*v).weight<<endl;
cerr<<"wt:v->wt"<<weight<<":"<<v->getWeight()<<"\n";
printNode(v);cerr<<"node wt:"<<(*v).weight<<"\n";
#endif
//so if v in in vt, change wt(v) to wt(u->v)
//only if wt(u->v)<wt(v)