6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2026-04-21 23:17:16 +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
lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp
+5 -5
View File
@@ -36,8 +36,8 @@
using std::vector;
static Node *findBB(set<Node *> &st, BasicBlock *BB){
for(set<Node *>::iterator si=st.begin(); si!=st.end(); ++si){
static Node *findBB(std::set<Node *> &st, BasicBlock *BB){
for(std::set<Node *>::iterator si=st.begin(); si!=st.end(); ++si){
if(((*si)->getElement())==BB){
return *si;
}
@@ -95,7 +95,7 @@ bool ProfilePaths::runOnMethod(Method *M){
if (M->getBasicBlocks().size() == 1) {
//The graph is made acyclic: this is done
//by removing back edges for now, and adding them later on
vector<Edge > be;
vector<Edge> be;
g.getBackEdges(be);
#ifdef DEBUG_PATH_PROFILES
cerr<<"Backedges:"<<be.size()<<endl;
@@ -106,8 +106,8 @@ bool ProfilePaths::runOnMethod(Method *M){
//Then we add 2 back edges for it:
//1. from root->b (in vector stDummy)
//and 2. from a->exit (in vector exDummy)
vector<Edge > stDummy;
vector<Edge > exDummy;
vector<Edge> stDummy;
vector<Edge> exDummy;
addDummyEdges(stDummy, exDummy, g, be);
//Now, every edge in the graph is assigned a weight