6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-16 14:31:59 +00:00
Code Issues Projects Releases Wiki Activity

Keep track of all of the globals inserted into the scalar map

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10995 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-01-28 03:01:22 +00:00
parent 18348fe201
commit 14c67ccf02
2 changed files with 52 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
include/llvm/Analysis/DSGraph.h
View File

@ -32,10 +32,12 @@ class GlobalValue;
/// of DSA. In all of these cases, the DSA phase is really trying to identify
/// globals or unique node handles active in the function.
///
class DSScalarMap {
typedef hash_map<Value*, DSNodeHandle> ValueMapTy;
ValueMapTy ValueMap;
typedef hash_set<GlobalValue*> GlobalSetTy;
GlobalSetTy GlobalSet;
public:
// Compatibility methods: provide an interface compatible with a map of
@ -50,15 +52,35 @@ public:
const_iterator find(Value *V) const { return ValueMap.find(V); }
unsigned count(Value *V) const { return ValueMap.count(V); }
void erase(iterator I) { ValueMap.erase(I); }
void erase(Value *V) { ValueMap.erase(V); }
void erase(Value *V) { erase(find(V)); }
DSNodeHandle &operator[](Value *V) { return ValueMap[V]; }
DSNodeHandle &operator[](Value *V) {
std::pair<iterator,bool> IP =
ValueMap.insert(std::make_pair(V, DSNodeHandle()));
if (IP.second) { // Inserted the new entry into the map.
if (GlobalValue *GV = dyn_cast<GlobalValue>(V))
GlobalSet.insert(GV);
}
return IP.first->second;
}
void erase(iterator I) {
assert(I != ValueMap.end() && "Cannot erase end!");
if (GlobalValue *GV = dyn_cast<GlobalValue>(I->first))
GlobalSet.erase(GV);
ValueMap.erase(I);
}
void clear() {
ValueMap.clear();
GlobalSet.clear();
}
// Access to the global set: the set of all globals currently in the
// scalar map.
typedef GlobalSetTy::const_iterator global_iterator;
global_iterator global_begin() const { return GlobalSet.begin(); }
global_iterator global_end() const { return GlobalSet.end(); }
};

30
include/llvm/Analysis/DataStructure/DSGraph.h
View File

@ -32,10 +32,12 @@ class GlobalValue;
/// of DSA. In all of these cases, the DSA phase is really trying to identify
/// globals or unique node handles active in the function.
///
class DSScalarMap {
typedef hash_map<Value*, DSNodeHandle> ValueMapTy;
ValueMapTy ValueMap;
typedef hash_set<GlobalValue*> GlobalSetTy;
GlobalSetTy GlobalSet;
public:
// Compatibility methods: provide an interface compatible with a map of
@ -50,15 +52,35 @@ public:
const_iterator find(Value *V) const { return ValueMap.find(V); }
unsigned count(Value *V) const { return ValueMap.count(V); }
void erase(iterator I) { ValueMap.erase(I); }
void erase(Value *V) { ValueMap.erase(V); }
void erase(Value *V) { erase(find(V)); }
DSNodeHandle &operator[](Value *V) { return ValueMap[V]; }
DSNodeHandle &operator[](Value *V) {
std::pair<iterator,bool> IP =
ValueMap.insert(std::make_pair(V, DSNodeHandle()));
if (IP.second) { // Inserted the new entry into the map.
if (GlobalValue *GV = dyn_cast<GlobalValue>(V))
GlobalSet.insert(GV);
}
return IP.first->second;
}
void erase(iterator I) {
assert(I != ValueMap.end() && "Cannot erase end!");
if (GlobalValue *GV = dyn_cast<GlobalValue>(I->first))
GlobalSet.erase(GV);
ValueMap.erase(I);
}
void clear() {
ValueMap.clear();
GlobalSet.clear();
}
// Access to the global set: the set of all globals currently in the
// scalar map.
typedef GlobalSetTy::const_iterator global_iterator;
global_iterator global_begin() const { return GlobalSet.begin(); }
global_iterator global_end() const { return GlobalSet.end(); }
};