6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-19 06:31:18 +00:00
Code Issues Projects Releases Wiki Activity

Pass stuff by reference instead of by copy. Copying entire graphs seems like

Browse Source 
a bad idea


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1810 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-02-26 19:49:45 +00:00
parent 5fb52fbf9e
commit 905ac5ee67
2 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp
View File

@ -22,7 +22,7 @@ static bool edgesEqual(Edge ed1, Edge ed2){
} }
//Get the vector of edges that are to be instrumented in the graph //Get the vector of edges that are to be instrumented in the graph
static void getChords(vector<Edge > &chords, Graph g, Graph st){ static void getChords(vector<Edge > &chords, Graph &g, Graph st){
//make sure the spanning tree is directional //make sure the spanning tree is directional
//iterate over ALL the edges of the graph //iterate over ALL the edges of the graph
list<Node *> allNodes=g.getAllNodes(); list<Node *> allNodes=g.getAllNodes();
@ -45,7 +45,7 @@ static void getChords(vector<Edge > &chords, Graph g, Graph st){
//would have too. This function corrects some of the directions in //would have too. This function corrects some of the directions in
//the tree so that now, all edge directions in the tree match //the tree so that now, all edge directions in the tree match
//the edge directions of corresponding edges in the directed graph //the edge directions of corresponding edges in the directed graph
static void removeTreeEdges(Graph g, Graph& t){ static void removeTreeEdges(Graph &g, Graph& t){
list<Node* > allNodes=t.getAllNodes(); list<Node* > allNodes=t.getAllNodes();
for(list<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE; for(list<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE;
++NI){ ++NI){
@ -91,7 +91,7 @@ int valueAssignmentToEdges(Graph& g){
//refers to the path we travelled //refers to the path we travelled
//inc_Dir tells whether 2 edges are in same, or in different directions //inc_Dir tells whether 2 edges are in same, or in different directions
//if same direction, return 1, else -1 //if same direction, return 1, else -1
static int inc_Dir(Edge e,Edge f){ static int inc_Dir(Edge e, Edge f){
if(e.isNull()) if(e.isNull())
return 1; return 1;
@ -627,7 +627,7 @@ void processGraph(Graph &g,
//print the graph (for debugging) //print the graph (for debugging)
void printGraph(Graph g){ void printGraph(Graph &g){
list<Node *> lt=g.getAllNodes(); list<Node *> lt=g.getAllNodes();
cerr<<"Graph---------------------\n"; cerr<<"Graph---------------------\n";
for(list<Node *>::iterator LI=lt.begin(); for(list<Node *>::iterator LI=lt.begin();

8
lib/Transforms/Instrumentation/ProfilePaths/GraphAuxillary.cpp
View File

@ -22,7 +22,7 @@ static bool edgesEqual(Edge ed1, Edge ed2){
} }
//Get the vector of edges that are to be instrumented in the graph //Get the vector of edges that are to be instrumented in the graph
static void getChords(vector<Edge > &chords, Graph g, Graph st){ static void getChords(vector<Edge > &chords, Graph &g, Graph st){
//make sure the spanning tree is directional //make sure the spanning tree is directional
//iterate over ALL the edges of the graph //iterate over ALL the edges of the graph
list<Node *> allNodes=g.getAllNodes(); list<Node *> allNodes=g.getAllNodes();
@ -45,7 +45,7 @@ static void getChords(vector<Edge > &chords, Graph g, Graph st){
//would have too. This function corrects some of the directions in //would have too. This function corrects some of the directions in
//the tree so that now, all edge directions in the tree match //the tree so that now, all edge directions in the tree match
//the edge directions of corresponding edges in the directed graph //the edge directions of corresponding edges in the directed graph
static void removeTreeEdges(Graph g, Graph& t){ static void removeTreeEdges(Graph &g, Graph& t){
list<Node* > allNodes=t.getAllNodes(); list<Node* > allNodes=t.getAllNodes();
for(list<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE; for(list<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE;
++NI){ ++NI){
@ -91,7 +91,7 @@ int valueAssignmentToEdges(Graph& g){
//refers to the path we travelled //refers to the path we travelled
//inc_Dir tells whether 2 edges are in same, or in different directions //inc_Dir tells whether 2 edges are in same, or in different directions
//if same direction, return 1, else -1 //if same direction, return 1, else -1
static int inc_Dir(Edge e,Edge f){ static int inc_Dir(Edge e, Edge f){
if(e.isNull()) if(e.isNull())
return 1; return 1;
@ -627,7 +627,7 @@ void processGraph(Graph &g,
//print the graph (for debugging) //print the graph (for debugging)
void printGraph(Graph g){ void printGraph(Graph &g){
list<Node *> lt=g.getAllNodes(); list<Node *> lt=g.getAllNodes();
cerr<<"Graph---------------------\n"; cerr<<"Graph---------------------\n";
for(list<Node *>::iterator LI=lt.begin(); for(list<Node *>::iterator LI=lt.begin();