2003-04-18 04:34:29 +00:00
|
|
|
//===- ConstantMerge.cpp - Merge duplicate global constants ---------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-10-18 20:05:37 +00:00
|
|
|
//
|
|
|
|
// This file defines the interface to a pass that merges duplicate global
|
|
|
|
// constants together into a single constant that is shared. This is useful
|
|
|
|
// because some passes (ie TraceValues) insert a lot of string constants into
|
2002-09-23 23:00:46 +00:00
|
|
|
// the program, regardless of whether or not an existing string is available.
|
2001-10-18 20:05:37 +00:00
|
|
|
//
|
|
|
|
// Algorithm: ConstantMerge is designed to build up a map of available constants
|
2002-09-23 23:00:46 +00:00
|
|
|
// and eliminate duplicates when it is initialized.
|
2001-10-18 20:05:37 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-12-19 22:09:18 +00:00
|
|
|
#define DEBUG_TYPE "constmerge"
|
2002-07-23 19:57:40 +00:00
|
|
|
#include "llvm/Transforms/IPO.h"
|
2010-09-15 00:30:11 +00:00
|
|
|
#include "llvm/Constants.h"
|
2010-02-12 18:17:23 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-01-31 00:45:11 +00:00
|
|
|
#include "llvm/Module.h"
|
2002-02-26 21:46:54 +00:00
|
|
|
#include "llvm/Pass.h"
|
2010-02-12 18:17:23 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2010-09-15 00:30:11 +00:00
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2003-11-21 21:54:22 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2006-12-19 22:09:18 +00:00
|
|
|
STATISTIC(NumMerged, "Number of global constants merged");
|
2002-10-09 23:16:04 +00:00
|
|
|
|
2006-12-19 22:09:18 +00:00
|
|
|
namespace {
|
2009-10-25 06:33:48 +00:00
|
|
|
struct ConstantMerge : public ModulePass {
|
2007-05-06 13:37:16 +00:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2010-10-19 17:21:58 +00:00
|
|
|
ConstantMerge() : ModulePass(ID) {
|
|
|
|
initializeConstantMergePass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2007-05-01 21:15:47 +00:00
|
|
|
|
2002-06-25 15:55:29 +00:00
|
|
|
// run - For this pass, process all of the globals in the module,
|
|
|
|
// eliminating duplicate constants.
|
|
|
|
//
|
2004-09-20 04:48:05 +00:00
|
|
|
bool runOnModule(Module &M);
|
2002-06-25 15:55:29 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
char ConstantMerge::ID = 0;
|
2010-07-21 22:09:45 +00:00
|
|
|
INITIALIZE_PASS(ConstantMerge, "constmerge",
|
2010-10-07 22:25:06 +00:00
|
|
|
"Merge Duplicate Global Constants", false, false)
|
2008-05-13 00:00:25 +00:00
|
|
|
|
2004-09-20 04:48:05 +00:00
|
|
|
ModulePass *llvm::createConstantMergePass() { return new ConstantMerge(); }
|
2002-06-25 15:55:29 +00:00
|
|
|
|
2010-09-15 00:30:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
/// Find values that are marked as llvm.used.
|
|
|
|
static void FindUsedValues(GlobalVariable *LLVMUsed,
|
|
|
|
SmallPtrSet<const GlobalValue*, 8> &UsedValues) {
|
|
|
|
if (LLVMUsed == 0) return;
|
|
|
|
ConstantArray *Inits = dyn_cast<ConstantArray>(LLVMUsed->getInitializer());
|
|
|
|
if (Inits == 0) return;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = Inits->getNumOperands(); i != e; ++i)
|
|
|
|
if (GlobalValue *GV =
|
|
|
|
dyn_cast<GlobalValue>(Inits->getOperand(i)->stripPointerCasts()))
|
|
|
|
UsedValues.insert(GV);
|
|
|
|
}
|
|
|
|
|
2004-09-20 04:48:05 +00:00
|
|
|
bool ConstantMerge::runOnModule(Module &M) {
|
2010-09-15 00:30:11 +00:00
|
|
|
// Find all the globals that are marked "used". These cannot be merged.
|
|
|
|
SmallPtrSet<const GlobalValue*, 8> UsedGlobals;
|
|
|
|
FindUsedValues(M.getGlobalVariable("llvm.used"), UsedGlobals);
|
|
|
|
FindUsedValues(M.getGlobalVariable("llvm.compiler.used"), UsedGlobals);
|
|
|
|
|
2006-03-07 17:56:59 +00:00
|
|
|
// Map unique constant/section pairs to globals. We don't want to merge
|
|
|
|
// globals in different sections.
|
2010-02-12 18:17:23 +00:00
|
|
|
DenseMap<Constant*, GlobalVariable*> CMap;
|
2003-12-22 23:49:36 +00:00
|
|
|
|
|
|
|
// Replacements - This vector contains a list of replacements to perform.
|
2010-02-12 18:17:23 +00:00
|
|
|
SmallVector<std::pair<GlobalVariable*, GlobalVariable*>, 32> Replacements;
|
2003-12-22 23:49:36 +00:00
|
|
|
|
2003-12-28 07:19:08 +00:00
|
|
|
bool MadeChange = false;
|
2001-10-18 20:05:37 +00:00
|
|
|
|
2003-12-28 07:19:08 +00:00
|
|
|
// Iterate constant merging while we are still making progress. Merging two
|
|
|
|
// constants together may allow us to merge other constants together if the
|
|
|
|
// second level constants have initializers which point to the globals that
|
|
|
|
// were just merged.
|
|
|
|
while (1) {
|
|
|
|
// First pass: identify all globals that can be merged together, filling in
|
|
|
|
// the Replacements vector. We cannot do the replacement in this pass
|
|
|
|
// because doing so may cause initializers of other globals to be rewritten,
|
|
|
|
// invalidating the Constant* pointers in CMap.
|
|
|
|
//
|
2007-04-14 18:06:52 +00:00
|
|
|
for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
|
|
|
|
GVI != E; ) {
|
|
|
|
GlobalVariable *GV = GVI++;
|
|
|
|
|
2007-04-14 01:11:54 +00:00
|
|
|
// If this GV is dead, remove it.
|
|
|
|
GV->removeDeadConstantUsers();
|
2009-01-15 20:18:42 +00:00
|
|
|
if (GV->use_empty() && GV->hasLocalLinkage()) {
|
2007-04-14 17:18:29 +00:00
|
|
|
GV->eraseFromParent();
|
|
|
|
continue;
|
2007-04-14 01:11:54 +00:00
|
|
|
}
|
|
|
|
|
2010-02-12 18:17:23 +00:00
|
|
|
// Only process constants with initializers in the default addres space.
|
|
|
|
if (!GV->isConstant() ||!GV->hasDefinitiveInitializer() ||
|
2010-09-15 00:30:11 +00:00
|
|
|
GV->getType()->getAddressSpace() != 0 || !GV->getSection().empty() ||
|
|
|
|
// Don't touch values marked with attribute(used).
|
|
|
|
UsedGlobals.count(GV))
|
2010-02-12 18:17:23 +00:00
|
|
|
continue;
|
|
|
|
|
2010-09-15 00:30:11 +00:00
|
|
|
|
|
|
|
|
2010-02-12 18:17:23 +00:00
|
|
|
Constant *Init = GV->getInitializer();
|
|
|
|
|
|
|
|
// Check to see if the initializer is already known.
|
|
|
|
GlobalVariable *&Slot = CMap[Init];
|
|
|
|
|
|
|
|
if (Slot == 0) { // Nope, add it to the map.
|
|
|
|
Slot = GV;
|
|
|
|
} else if (GV->hasLocalLinkage()) { // Yup, this is a duplicate!
|
|
|
|
// Make all uses of the duplicate constant use the canonical version.
|
|
|
|
Replacements.push_back(std::make_pair(GV, Slot));
|
2001-10-18 20:05:37 +00:00
|
|
|
}
|
2007-04-14 01:11:54 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-12-28 07:19:08 +00:00
|
|
|
if (Replacements.empty())
|
|
|
|
return MadeChange;
|
|
|
|
CMap.clear();
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-12-28 07:19:08 +00:00
|
|
|
// Now that we have figured out which replacements must be made, do them all
|
|
|
|
// now. This avoid invalidating the pointers in CMap, which are unneeded
|
|
|
|
// now.
|
|
|
|
for (unsigned i = 0, e = Replacements.size(); i != e; ++i) {
|
2010-02-12 18:17:23 +00:00
|
|
|
// Eliminate any uses of the dead global.
|
2003-12-28 07:19:08 +00:00
|
|
|
Replacements[i].first->replaceAllUsesWith(Replacements[i].second);
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2010-02-12 18:17:23 +00:00
|
|
|
// Delete the global value from the module.
|
|
|
|
Replacements[i].first->eraseFromParent();
|
2001-10-18 20:05:37 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-12-28 07:19:08 +00:00
|
|
|
NumMerged += Replacements.size();
|
|
|
|
Replacements.clear();
|
2003-12-22 23:49:36 +00:00
|
|
|
}
|
|
|
|
}
|