RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
Code Issues Projects Releases Wiki Activity

avoid varialbe name collisions

Browse Source 
llvm-svn: 20606
This commit is contained in:
Chris Lattner 2005-03-15 06:29:12 +00:00
parent c6d8a9188b
commit 7277bd8606
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -311,7 +311,8 @@ processSCC(DSGraph &FG, std::vector<DSGraph*> &Stack, unsigned &NextID,
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...
@ -375,7 +376,7 @@ void EquivClassGraphs::processGraph(DSGraph &G) {
// Else we need to inline some callee graph. Visit all call sites. // Else we need to inline some callee graph. Visit all call sites.
// 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();