//===-- SlotCalculator.cpp - Calculate what slots values land in ----------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
//
// This file implements a useful analysis step to figure out what numbered
// slots values in a program will land in (keeping track of per plane
#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>
+using namespace llvm;
#if 0
#define SC_DEBUG(X) std::cerr << X
// Preload table... Make sure that all of the primitive types are in the table
// and that their Primitive ID is equal to their slot #
//
+ SC_DEBUG("Inserting primitive types:\n");
for (unsigned i = 0; i < Type::FirstDerivedTyID; ++i) {
assert(Type::getPrimitiveType((Type::PrimitiveID)i));
insertValue(Type::getPrimitiveType((Type::PrimitiveID)i), true);
// Preload table... Make sure that all of the primitive types are in the table
// and that their Primitive ID is equal to their slot #
//
+ SC_DEBUG("Inserting primitive types:\n");
for (unsigned i = 0; i < Type::FirstDerivedTyID; ++i) {
assert(Type::getPrimitiveType((Type::PrimitiveID)i));
insertValue(Type::getPrimitiveType((Type::PrimitiveID)i), true);
}
-void SlotCalculator::incorporateFunction(const Function *M) {
+void SlotCalculator::incorporateFunction(const Function *F) {
assert(ModuleLevel.size() == 0 && "Module already incorporated!");
SC_DEBUG("begin processFunction!\n");
SC_DEBUG("Inserting function arguments\n");
// Iterate over function arguments, adding them to the value table...
- for(Function::const_aiterator I = M->abegin(), E = M->aend(); I != E; ++I)
+ for(Function::const_aiterator I = F->abegin(), E = F->aend(); I != E; ++I)
getOrCreateSlot(I);
// Iterate over all of the instructions in the function, looking for constant
//
if (!IgnoreNamedNodes) { // Assembly writer does not need this!
SC_DEBUG("Inserting function constants:\n";
- for (constant_iterator I = constant_begin(M), E = constant_end(M);
+ for (constant_iterator I = constant_begin(F), E = constant_end(F);
I != E; ++I) {
std::cerr << " " << *I->getType() << " " << *I << "\n";
});
// Emit all of the constants that are being used by the instructions in the
// function...
- for_each(constant_begin(M), constant_end(M),
+ for_each(constant_begin(F), constant_end(F),
bind_obj(this, &SlotCalculator::getOrCreateSlot));
// If there is a symbol table, it is possible that the user has names for
// symboltable references to constants not in the output. Scan for these
// constants now.
//
- processSymbolTableConstants(&M->getSymbolTable());
+ processSymbolTableConstants(&F->getSymbolTable());
}
SC_DEBUG("Inserting Labels:\n");
// Iterate over basic blocks, adding them to the value table...
- for (Function::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
+ for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
getOrCreateSlot(I);
SC_DEBUG("Inserting Instructions:\n");
// Add all of the instructions to the type planes...
- for_each(inst_begin(M), inst_end(M),
- bind_obj(this, &SlotCalculator::getOrCreateSlot));
+ for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
+ for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
+ getOrCreateSlot(I);
+ if (const VANextInst *VAN = dyn_cast<VANextInst>(I))
+ getOrCreateSlot(VAN->getArgType());
+ }
if (!IgnoreNamedNodes) {
SC_DEBUG("Inserting SymbolTable values:\n");
- processSymbolTable(&M->getSymbolTable());
+ processSymbolTable(&F->getSymbolTable());
}
SC_DEBUG("end processFunction!\n");
SC_DEBUG(" Inserted type: " << TheTy->getDescription() << " slot=" <<
ResultSlot << "\n");
- // Loop over any contained types in the definition... in depth first order.
+ // Loop over any contained types in the definition... in post
+ // order.
//
- for (df_iterator<const Type*> I = df_begin(TheTy), E = df_end(TheTy);
- I != E; ++I)
+ for (po_iterator<const Type*> I = po_begin(TheTy), E = po_end(TheTy);
+ I != E; ++I) {
if (*I != TheTy) {
+ const Type *SubTy = *I;
// If we haven't seen this sub type before, add it to our type table!
- 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 (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;
}