RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity

Rename variables to work with VC++'s hokey scoping rules.

Browse Source 
llvm-svn: 19942
This commit is contained in:
Chris Lattner 2005-01-31 00:10:58 +00:00
parent 86f89c506f
commit 11a25d99d7
2 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/Analysis/DataStructure/CompleteBottomUp.cpp
View File

@ -122,7 +122,8 @@ unsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG,
Stack.push_back(&FG);
// The edges out of the current node are the call site targets...
for (DSGraph::fc_iterator CI = FG.fc_begin(), E = FG.fc_end(); CI != E; ++CI){
for (DSGraph::fc_iterator CI = FG.fc_begin(), CE = FG.fc_end();
CI != CE; ++CI) {
Instruction *Call = CI->getCallSite().getInstruction();
// Loop over all of the actually called functions...
@ -185,7 +186,7 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) {
// The edges out of the current node are the call site targets...
unsigned i = 0;
for (DSGraph::fc_iterator CI = G.fc_begin(), E = G.fc_end(); CI != E;
for (DSGraph::fc_iterator CI = G.fc_begin(), CE = G.fc_end(); CI != CE;
++CI, ++i) {
const DSCallSite &CS = *CI;
Instruction *TheCall = CS.getCallSite().getInstruction();

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

@ -1595,17 +1595,17 @@ static void removeIdenticalCalls(std::list<DSCallSite> &Calls) {
Calls.sort();
// Now that we are in sorted order, eliminate duplicates.
std::list<DSCallSite>::iterator I = Calls.begin(), E = Calls.end();
if (I != E)
std::list<DSCallSite>::iterator CI = Calls.begin(), CE = Calls.end();
if (CI != CE)
while (1) {
std::list<DSCallSite>::iterator OldIt = I++;
if (I == E) break;
std::list<DSCallSite>::iterator OldIt = CI++;
if (CI == CE) break;
// If this call site is now the same as the previous one, we can delete it
// as a duplicate.
if (*OldIt == *I) {
Calls.erase(I);
I = OldIt;
if (*OldIt == *CI) {
Calls.erase(CI);
CI = OldIt;
++NumDeleted;
}
}