mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-07-24 22:24:54 +00:00
Use 'static const char' instead of 'static const int'.
Due to darwin gcc bug, one version of darwin linker coalesces static const int, which defauts PassID based pass identification. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36652 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -61,7 +61,7 @@ protected:
|
||||
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
|
||||
|
||||
public:
|
||||
static const int ID; // Class identification, replacement for typeinfo
|
||||
static const char ID; // Class identification, replacement for typeinfo
|
||||
AliasAnalysis() : TD(0), AA(0) {}
|
||||
virtual ~AliasAnalysis(); // We want to be subclassed
|
||||
|
||||
|
@@ -73,7 +73,7 @@ protected:
|
||||
FunctionMapTy FunctionMap; // Map from a function to its node
|
||||
|
||||
public:
|
||||
static const int ID; // Class identification, replacement for typeinfo
|
||||
static const char ID; // Class identification, replacement for typeinfo
|
||||
//===---------------------------------------------------------------------
|
||||
// Accessors...
|
||||
//
|
||||
|
@@ -208,7 +208,7 @@ public:
|
||||
///
|
||||
class DominatorTree : public DominatorTreeBase {
|
||||
public:
|
||||
static const int ID; // Pass ID, replacement for typeid
|
||||
static const char ID; // Pass ID, replacement for typeid
|
||||
DominatorTree() : DominatorTreeBase((intptr_t)&ID, false) {}
|
||||
|
||||
BasicBlock *getRoot() const {
|
||||
@@ -399,7 +399,7 @@ protected:
|
||||
|
||||
class ETForest : public ETForestBase {
|
||||
public:
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
|
||||
ETForest() : ETForestBase((intptr_t)&ID, false) {}
|
||||
|
||||
@@ -477,7 +477,7 @@ public:
|
||||
///
|
||||
class DominanceFrontier : public DominanceFrontierBase {
|
||||
public:
|
||||
static const int ID; // Pass ID, replacement for typeid
|
||||
static const char ID; // Pass ID, replacement for typeid
|
||||
DominanceFrontier() :
|
||||
DominanceFrontierBase((intptr_t)& ID, false) {}
|
||||
|
||||
|
@@ -24,7 +24,7 @@ class Type;
|
||||
class FindUsedTypes : public ModulePass {
|
||||
std::set<const Type *> UsedTypes;
|
||||
public:
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
FindUsedTypes() : ModulePass((intptr_t)&ID) {}
|
||||
|
||||
/// getTypes - After the pass has been run, return the set containing all of
|
||||
|
@@ -45,7 +45,7 @@ class IntervalPartition : public FunctionPass {
|
||||
std::vector<Interval*> Intervals;
|
||||
|
||||
public:
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
|
||||
IntervalPartition() : FunctionPass((intptr_t)&ID), RootInterval(0) {}
|
||||
|
||||
|
@@ -241,7 +241,7 @@ class LoopInfo : public FunctionPass {
|
||||
std::vector<Loop*> TopLevelLoops;
|
||||
friend class Loop;
|
||||
public:
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
|
||||
LoopInfo() : FunctionPass((intptr_t)&ID) {}
|
||||
~LoopInfo() { releaseMemory(); }
|
||||
|
@@ -68,7 +68,7 @@ class LoopPass : public Pass {
|
||||
class LPPassManager : public FunctionPass, public PMDataManager {
|
||||
|
||||
public:
|
||||
static const int ID;
|
||||
static const char ID;
|
||||
LPPassManager(int Depth);
|
||||
|
||||
/// run - Execute all of the passes scheduled for execution. Keep track of
|
||||
|
@@ -22,7 +22,7 @@ namespace llvm {
|
||||
/// compute the a post-dominator tree.
|
||||
///
|
||||
struct PostDominatorTree : public DominatorTreeBase {
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
|
||||
PostDominatorTree() :
|
||||
DominatorTreeBase((intptr_t)&ID, true) {}
|
||||
@@ -54,7 +54,7 @@ private:
|
||||
/// PostETForest Class - Concrete subclass of ETForestBase that is used to
|
||||
/// compute a forwards post-dominator ET-Forest.
|
||||
struct PostETForest : public ETForestBase {
|
||||
static const int ID;
|
||||
static const char ID;
|
||||
PostETForest() : ETForestBase((intptr_t)&ID, true) {}
|
||||
|
||||
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
||||
@@ -79,7 +79,7 @@ struct PostETForest : public ETForestBase {
|
||||
/// used to compute the a post-dominance frontier.
|
||||
///
|
||||
struct PostDominanceFrontier : public DominanceFrontierBase {
|
||||
static const int ID;
|
||||
static const char ID;
|
||||
PostDominanceFrontier()
|
||||
: DominanceFrontierBase((intptr_t) &ID, true) {}
|
||||
|
||||
|
@@ -38,7 +38,7 @@ namespace llvm {
|
||||
// entered.
|
||||
std::map<std::pair<BasicBlock*, BasicBlock*>, unsigned> EdgeCounts;
|
||||
public:
|
||||
static const int ID; // Class identification, replacement for typeinfo
|
||||
static const char ID; // Class identification, replacement for typeinfo
|
||||
virtual ~ProfileInfo(); // We want to be subclassed
|
||||
|
||||
//===------------------------------------------------------------------===//
|
||||
|
@@ -197,7 +197,7 @@ namespace llvm {
|
||||
class ScalarEvolution : public FunctionPass {
|
||||
void *Impl; // ScalarEvolution uses the pimpl pattern
|
||||
public:
|
||||
static const int ID; // Pass identifcation, replacement for typeid
|
||||
static const char ID; // Pass identifcation, replacement for typeid
|
||||
ScalarEvolution() : FunctionPass((intptr_t)&ID), Impl(0) {}
|
||||
|
||||
/// getSCEV - Return a SCEV expression handle for the full generality of the
|
||||
|
@@ -29,7 +29,7 @@ class Value;
|
||||
class Instruction;
|
||||
|
||||
struct ValueNumbering {
|
||||
static const int ID; // Class identification, replacement for typeinfo
|
||||
static const char ID; // Class identification, replacement for typeinfo
|
||||
virtual ~ValueNumbering(); // We want to be subclassed
|
||||
|
||||
/// getEqualNumberNodes - Return nodes with the same value number as the
|
||||
|
Reference in New Issue
Block a user