RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-19 00:14:20 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

use a callee_iterator typedef.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21038 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-04-02 20:02:41 +00:00
parent da7c380eb4
commit 2ccc5f1081
3 changed files with 7 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -120,7 +120,7 @@ unsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG,
Instruction *Call = CI->getCallSite().getInstruction();
// Loop over all of the actually called functions...
ActualCalleesTy::iterator I = callee_begin(Call), E = callee_end(Call);
callee_iterator I = callee_begin(Call), E = callee_end(Call);
for (; I != E && I->first == Call; ++I) {
assert(I->first == Call && "Bad callee construction!");
if (!I->second->isExternal()) {
@ -197,7 +197,7 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) {
// Inline direct calls as well as indirect calls because the direct
// callee may have indirect callees and so may have changed.
//
ActualCalleesTy::iterator I = callee_begin(TheCall),E = callee_end(TheCall);
callee_iterator I = callee_begin(TheCall),E = callee_end(TheCall);
unsigned TNum = 0, Num = 0;
DEBUG(Num = std::distance(I, E));
for (; I != E; ++I, ++TNum) {

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

@ -339,8 +339,8 @@ processSCC(DSGraph &FG, std::vector<DSGraph*> &Stack, unsigned &NextID,
Instruction *Call = CI->getCallSite().getInstruction();
// Loop over all of the actually called functions...
ActualCalleesTy::const_iterator I = callee_begin(Call),E = callee_end(Call);
for (; I != E; ++I)
for (callee_iterator I = callee_begin(Call), E = callee_end(Call);
I != E; ++I)
if (!I->second->isExternal()) {
// Process the callee as necessary.
unsigned M = processSCC(getOrCreateGraph(*I->second),
@ -414,8 +414,7 @@ void EquivClassGraphs::processGraph(DSGraph &G) {
// graph so we only need to do this once.
//
DSGraph* CalleeGraph = NULL;
ActualCalleesTy::const_iterator I = callee_begin(TheCall);
ActualCalleesTy::const_iterator E = callee_end(TheCall);
callee_iterator I = callee_begin(TheCall), E = callee_end(TheCall);
unsigned TNum, Num;
// Loop over all potential callees to find the first non-external callee.

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

@ -174,9 +174,8 @@ void TDDataStructures::ComputePostOrder(Function &F,hash_set<DSGraph*> &Visited,
// Recursively traverse all of the callee graphs.
for (DSGraph::fc_iterator CI = G.fc_begin(), E = G.fc_end(); CI != E; ++CI) {
Instruction *CallI = CI->getCallSite().getInstruction();
BUDataStructures::ActualCalleesTy::const_iterator I =
BUDataStructures::callee_iterator I =
BUInfo->callee_begin(CallI), E = BUInfo->callee_end(CallI);
for (; I != E; ++I)
ComputePostOrder(*I->second, Visited, PostOrder);
}
@ -326,7 +325,7 @@ void TDDataStructures::InlineCallersIntoGraph(DSGraph &DSG) {
Instruction *CallI = CI->getCallSite().getInstruction();
// For each function in the invoked function list at this call site...
BUDataStructures::ActualCalleesTy::const_iterator IPI =
BUDataStructures::callee_iterator IPI =
BUInfo->callee_begin(CallI), IPE = BUInfo->callee_end(CallI);
// Skip over all calls to this graph (SCC calls).