6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-04-09 16:45:03 +00:00
Code Issues Projects Releases Wiki Activity

There is a #define in some header that conflicts with INFINITY, rename it.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3797 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-09-17 23:46:33 +00:00
parent 16d1f73cf3
commit cb16c65426
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

@ -511,7 +511,7 @@ void processGraph(Graph &g,
//This would hold all
//right as long as number of paths in the graph
//is less than this
const int INFINITY=99999999;
const int Infinity=99999999;
//step 1-3 are already done on the graph when this function is called
@ -521,14 +521,14 @@ void processGraph(Graph &g,
//now insert exit to root edge
//if its there earlier, remove it!
//assign it weight INFINITY
//assign it weight Infinity
//so that this edge IS ALWAYS IN spanning tree
//Note than edges in spanning tree do not get
//instrumented: and we do not want the
//edge exit->root to get instrumented
//as it MAY BE a dummy edge
Edge ed(g.getExit(),g.getRoot(),INFINITY);
g.addEdge(ed,INFINITY);
Edge ed(g.getExit(),g.getRoot(),Infinity);
g.addEdge(ed,Infinity);
Graph g2=g;
//make g2 undirectional: this gives a better

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

@ -511,7 +511,7 @@ void processGraph(Graph &g,
//This would hold all
//right as long as number of paths in the graph
//is less than this
const int INFINITY=99999999;
const int Infinity=99999999;
//step 1-3 are already done on the graph when this function is called
@ -521,14 +521,14 @@ void processGraph(Graph &g,
//now insert exit to root edge
//if its there earlier, remove it!
//assign it weight INFINITY
//assign it weight Infinity
//so that this edge IS ALWAYS IN spanning tree
//Note than edges in spanning tree do not get
//instrumented: and we do not want the
//edge exit->root to get instrumented
//as it MAY BE a dummy edge
Edge ed(g.getExit(),g.getRoot(),INFINITY);
g.addEdge(ed,INFINITY);
Edge ed(g.getExit(),g.getRoot(),Infinity);
g.addEdge(ed,Infinity);
Graph g2=g;
//make g2 undirectional: this gives a better