Stop using "reverse depth first" order

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9081 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-10-13 15:21:58 +00:00
parent c49fcd1239
commit cb18d181d1
2 changed files with 6 additions and 12 deletions

View File

@ -277,13 +277,10 @@ int SlotCalculator::insertVal(const Value *D, bool dontIgnore) {
ResultSlot << "\n");
}
// Loop over any contained types in the definition... in reverse depth first
// order. This assures that all of the leafs of a type are output before
// the type itself is. This also assures us that we will not hit infinite
// recursion on recursive types...
// Loop over any contained types in the definition... in depth first order.
//
for (df_iterator<const Type*> I = df_begin(TheTy, true),
E = df_end(TheTy); I != E; ++I)
for (df_iterator<const Type*> I = df_begin(TheTy), E = df_end(TheTy);
I != E; ++I)
if (*I != TheTy) {
// If we haven't seen this sub type before, add it to our type table!
const Type *SubTy = *I;

View File

@ -277,13 +277,10 @@ int SlotCalculator::insertVal(const Value *D, bool dontIgnore) {
ResultSlot << "\n");
}
// Loop over any contained types in the definition... in reverse depth first
// order. This assures that all of the leafs of a type are output before
// the type itself is. This also assures us that we will not hit infinite
// recursion on recursive types...
// Loop over any contained types in the definition... in depth first order.
//
for (df_iterator<const Type*> I = df_begin(TheTy, true),
E = df_end(TheTy); I != E; ++I)
for (df_iterator<const Type*> I = df_begin(TheTy), E = df_end(TheTy);
I != E; ++I)
if (*I != TheTy) {
// If we haven't seen this sub type before, add it to our type table!
const Type *SubTy = *I;