6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-20 14:29:27 +00:00
Code Issues Projects Releases Wiki Activity

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

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19942 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-01-31 00:10:58 +00:00
parent cff8ac20ca
commit f9aace20fb
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); Stack.push_back(&FG);
// The edges out of the current node are the call site targets... // 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(); Instruction *Call = CI->getCallSite().getInstruction();
// Loop over all of the actually called functions... // 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... // The edges out of the current node are the call site targets...
unsigned i = 0; 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) { ++CI, ++i) {
const DSCallSite &CS = *CI; const DSCallSite &CS = *CI;
Instruction *TheCall = CS.getCallSite().getInstruction(); 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(); Calls.sort();
// Now that we are in sorted order, eliminate duplicates. // Now that we are in sorted order, eliminate duplicates.
std::list<DSCallSite>::iterator I = Calls.begin(), E = Calls.end(); std::list<DSCallSite>::iterator CI = Calls.begin(), CE = Calls.end();
if (I != E) if (CI != CE)
while (1) { while (1) {
std::list<DSCallSite>::iterator OldIt = I++; std::list<DSCallSite>::iterator OldIt = CI++;
if (I == E) break; if (CI == CE) break;
// If this call site is now the same as the previous one, we can delete it // If this call site is now the same as the previous one, we can delete it
// as a duplicate. // as a duplicate.
if (*OldIt == *I) { if (*OldIt == *CI) {
Calls.erase(I); Calls.erase(CI);
I = OldIt; CI = OldIt;
++NumDeleted; ++NumDeleted;
} }
} }