mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-19 19:29:31 +00:00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21427 91177308-0d34-0410-b5e6-96231b3b80d8
97 lines
3.1 KiB
C++
97 lines
3.1 KiB
C++
//===- DeadTypeElimination.cpp - Eliminate unused types for symbol table --===//
|
|
//
|
|
// 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 pass is used to cleanup the output of GCC. It eliminate names for types
|
|
// that are unused in the entire translation unit, using the FindUsedTypes pass.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Transforms/IPO.h"
|
|
#include "llvm/Analysis/FindUsedTypes.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/SymbolTable.h"
|
|
#include "llvm/DerivedTypes.h"
|
|
#include "llvm/ADT/Statistic.h"
|
|
using namespace llvm;
|
|
|
|
namespace {
|
|
struct DTE : public ModulePass {
|
|
// doPassInitialization - For this pass, it removes global symbol table
|
|
// entries for primitive types. These are never used for linking in GCC and
|
|
// they make the output uglier to look at, so we nuke them.
|
|
//
|
|
// Also, initialize instance variables.
|
|
//
|
|
bool runOnModule(Module &M);
|
|
|
|
// getAnalysisUsage - This function needs FindUsedTypes to do its job...
|
|
//
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.addRequired<FindUsedTypes>();
|
|
}
|
|
};
|
|
RegisterOpt<DTE> X("deadtypeelim", "Dead Type Elimination");
|
|
Statistic<>
|
|
NumKilled("deadtypeelim", "Number of unused typenames removed from symtab");
|
|
}
|
|
|
|
ModulePass *llvm::createDeadTypeEliminationPass() {
|
|
return new DTE();
|
|
}
|
|
|
|
|
|
// ShouldNukeSymtabEntry - Return true if this module level symbol table entry
|
|
// should be eliminated.
|
|
//
|
|
static inline bool ShouldNukeSymtabEntry(const Type *Ty){
|
|
// Nuke all names for primitive types!
|
|
if (Ty->isPrimitiveType()) return true;
|
|
|
|
// Nuke all pointers to primitive types as well...
|
|
if (const PointerType *PT = dyn_cast<PointerType>(Ty))
|
|
if (PT->getElementType()->isPrimitiveType()) return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
// run - For this pass, it removes global symbol table entries for primitive
|
|
// types. These are never used for linking in GCC and they make the output
|
|
// uglier to look at, so we nuke them. Also eliminate types that are never used
|
|
// in the entire program as indicated by FindUsedTypes.
|
|
//
|
|
bool DTE::runOnModule(Module &M) {
|
|
bool Changed = false;
|
|
|
|
SymbolTable &ST = M.getSymbolTable();
|
|
std::set<const Type *> UsedTypes = getAnalysis<FindUsedTypes>().getTypes();
|
|
|
|
// Check the symbol table for superfluous type entries...
|
|
//
|
|
// Grab the 'type' plane of the module symbol...
|
|
SymbolTable::type_iterator TI = ST.type_begin();
|
|
while ( TI != ST.type_end() ) {
|
|
// If this entry should be unconditionally removed, or if we detect that
|
|
// the type is not used, remove it.
|
|
const Type *RHS = TI->second;
|
|
if (ShouldNukeSymtabEntry(RHS) || !UsedTypes.count(RHS)) {
|
|
ST.remove(TI++);
|
|
++NumKilled;
|
|
Changed = true;
|
|
} else {
|
|
++TI;
|
|
// We only need to leave one name for each type.
|
|
UsedTypes.erase(RHS);
|
|
}
|
|
}
|
|
|
|
return Changed;
|
|
}
|
|
|
|
// vim: sw=2
|