6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-12 17:32:19 +00:00
Code Issues Projects Releases Wiki Activity

Use already existing classes for post order iterator.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9629 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Alkis Evlogimenos 2003-10-31 03:02:34 +00:00
parent c6ad94c6a1
commit 088eb45cf4
2 changed files with 22 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
lib/Bytecode/Writer/SlotCalculator.cpp
View File

@ -23,7 +23,7 @@
#include "llvm/Constant.h"
#include "llvm/DerivedTypes.h"
#include "llvm/SymbolTable.h"
#include "Support/DepthFirstIterator.h"
#include "Support/PostOrderIterator.h"
#include "Support/STLExtras.h"
#include <algorithm>
@ -287,26 +287,20 @@ int SlotCalculator::insertValue(const Value *D, bool dontIgnore) {
SC_DEBUG(" Inserted type: " << TheTy->getDescription() << " slot=" <<
ResultSlot << "\n");
// Loop over any contained types in the definition... in reverse depth
// first order.
// Loop over any contained types in the definition... in post
// order.
//
std::vector<const Type*> DfsOrder;
for (df_iterator<const Type*> I = df_begin(TheTy), E = df_end(TheTy);
for (po_iterator<const Type*> I = po_begin(TheTy), E = po_end(TheTy);
I != E; ++I) {
if (*I != TheTy) {
// If we haven't seen this sub type before, add it to our type table!
DfsOrder.push_back(*I);
}
}
for (std::vector<const Type*>::const_reverse_iterator
I = DfsOrder.rbegin(), E = DfsOrder.rend(); I != E; ++I) {
const Type *SubTy = *I;
if (getSlot(SubTy) == -1) {
SC_DEBUG(" Inserting subtype: " << SubTy->getDescription() << "\n");
int Slot = doInsertValue(SubTy);
SC_DEBUG(" Inserted subtype: " << SubTy->getDescription() <<
" slot=" << Slot << "\n");
// If we haven't seen this sub type before, add it to our type table!
if (getSlot(SubTy) == -1) {
SC_DEBUG(" Inserting subtype: " << SubTy->getDescription() << "\n");
int Slot = doInsertValue(SubTy);
SC_DEBUG(" Inserted subtype: " << SubTy->getDescription() <<
" slot=" << Slot << "\n");
}
}
}
return ResultSlot;

28
lib/VMCore/SlotCalculator.cpp
View File

@ -23,7 +23,7 @@
#include "llvm/Constant.h"
#include "llvm/DerivedTypes.h"
#include "llvm/SymbolTable.h"
#include "Support/DepthFirstIterator.h"
#include "Support/PostOrderIterator.h"
#include "Support/STLExtras.h"
#include <algorithm>
@ -287,26 +287,20 @@ int SlotCalculator::insertValue(const Value *D, bool dontIgnore) {
SC_DEBUG(" Inserted type: " << TheTy->getDescription() << " slot=" <<
ResultSlot << "\n");
// Loop over any contained types in the definition... in reverse depth
// first order.
// Loop over any contained types in the definition... in post
// order.
//
std::vector<const Type*> DfsOrder;
for (df_iterator<const Type*> I = df_begin(TheTy), E = df_end(TheTy);
for (po_iterator<const Type*> I = po_begin(TheTy), E = po_end(TheTy);
I != E; ++I) {
if (*I != TheTy) {
// If we haven't seen this sub type before, add it to our type table!
DfsOrder.push_back(*I);
}
}
for (std::vector<const Type*>::const_reverse_iterator
I = DfsOrder.rbegin(), E = DfsOrder.rend(); I != E; ++I) {
const Type *SubTy = *I;
if (getSlot(SubTy) == -1) {
SC_DEBUG(" Inserting subtype: " << SubTy->getDescription() << "\n");
int Slot = doInsertValue(SubTy);
SC_DEBUG(" Inserted subtype: " << SubTy->getDescription() <<
" slot=" << Slot << "\n");
// If we haven't seen this sub type before, add it to our type table!
if (getSlot(SubTy) == -1) {
SC_DEBUG(" Inserting subtype: " << SubTy->getDescription() << "\n");
int Slot = doInsertValue(SubTy);
SC_DEBUG(" Inserted subtype: " << SubTy->getDescription() <<
" slot=" << Slot << "\n");
}
}
}
return ResultSlot;