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

Put all LLVM code into the llvm namespace, as per bug 109.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9903 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Brian Gaeke
2003-11-11 22:41:34 +00:00
parent 0d723acf15
commit d0fde30ce8
558 changed files with 2494 additions and 264 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -23,6 +23,8 @@
#include "Support/Timer.h"
#include <algorithm>
namespace llvm {
namespace {
Statistic<> NumFolds ("dsnode", "Number of nodes completely folded");
Statistic<> NumCallNodesMerged("dsnode", "Number of call nodes merged");
@ -161,7 +163,6 @@ bool DSNode::isNodeCompletelyFolded() const {
return getSize() == 1 && Ty == Type::VoidTy && isArray();
}
namespace {
/// TypeElementWalker Class - Used for implementation of physical subtyping...
///
@ -252,7 +253,7 @@ namespace {
}
}
};
}
} // end anonymous namespace
/// ElementTypesAreCompatible - Check to see if the specified types are
/// "physically" compatible. If so, return true, else return false. We only
@ -1639,6 +1640,7 @@ void DSGraph::mergeInGlobalsGraph() {
removeTriviallyDeadNodes();
}
/// computeNodeMapping - Given roots in two different DSGraphs, traverse the
/// nodes reachable from the two graphs, computing the mapping of nodes from
/// the first to the second graph.
@ -1669,3 +1671,4 @@ void DSGraph::computeNodeMapping(const DSNodeHandle &NH1,
computeNodeMapping(N1->getLink(i), N2->getLink(N2Idx+i), NodeMap);
}
} // End llvm namespace