2007-04-22 06:24:45 +00:00
|
|
|
//===-- Bitcode/Writer/ValueEnumerator.h - Number values --------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// 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.
|
2007-04-22 06:24:45 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This class gives values and types Unique ID's.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef VALUE_ENUMERATOR_H
|
|
|
|
#define VALUE_ENUMERATOR_H
|
|
|
|
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2008-09-23 23:03:40 +00:00
|
|
|
#include "llvm/Attributes.h"
|
2007-04-22 06:24:45 +00:00
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
class Type;
|
2007-04-26 04:42:16 +00:00
|
|
|
class Value;
|
|
|
|
class BasicBlock;
|
2007-04-22 06:24:45 +00:00
|
|
|
class Function;
|
2007-04-26 04:42:16 +00:00
|
|
|
class Module;
|
2008-09-25 21:00:45 +00:00
|
|
|
class AttrListPtr;
|
2007-04-22 06:24:45 +00:00
|
|
|
class TypeSymbolTable;
|
|
|
|
class ValueSymbolTable;
|
|
|
|
|
|
|
|
class ValueEnumerator {
|
|
|
|
public:
|
|
|
|
// For each type, we remember its Type* and occurrence frequency.
|
|
|
|
typedef std::vector<std::pair<const Type*, unsigned> > TypeList;
|
|
|
|
|
|
|
|
// For each value, we remember its Value* and occurrence frequency.
|
|
|
|
typedef std::vector<std::pair<const Value*, unsigned> > ValueList;
|
|
|
|
private:
|
|
|
|
typedef DenseMap<const Type*, unsigned> TypeMapType;
|
|
|
|
TypeMapType TypeMap;
|
2007-04-24 00:16:04 +00:00
|
|
|
TypeList Types;
|
2007-04-22 06:24:45 +00:00
|
|
|
|
|
|
|
typedef DenseMap<const Value*, unsigned> ValueMapType;
|
|
|
|
ValueMapType ValueMap;
|
2007-04-24 00:16:04 +00:00
|
|
|
ValueList Values;
|
2007-04-22 06:24:45 +00:00
|
|
|
|
2008-09-25 21:00:45 +00:00
|
|
|
typedef DenseMap<void*, unsigned> AttributeMapType;
|
|
|
|
AttributeMapType AttributeMap;
|
|
|
|
std::vector<AttrListPtr> Attributes;
|
2007-05-03 22:46:43 +00:00
|
|
|
|
2007-04-26 04:42:16 +00:00
|
|
|
/// BasicBlocks - This contains all the basic blocks for the currently
|
|
|
|
/// incorporated function. Their reverse mapping is stored in ValueMap.
|
|
|
|
std::vector<const BasicBlock*> BasicBlocks;
|
|
|
|
|
2007-04-26 03:50:57 +00:00
|
|
|
/// When a function is incorporated, this is the size of the Values list
|
|
|
|
/// before incorporation.
|
2007-04-26 05:53:54 +00:00
|
|
|
unsigned NumModuleValues;
|
|
|
|
unsigned FirstFuncConstantID;
|
|
|
|
unsigned FirstInstID;
|
2007-04-22 06:24:45 +00:00
|
|
|
|
|
|
|
ValueEnumerator(const ValueEnumerator &); // DO NOT IMPLEMENT
|
|
|
|
void operator=(const ValueEnumerator &); // DO NOT IMPLEMENT
|
|
|
|
public:
|
|
|
|
ValueEnumerator(const Module *M);
|
|
|
|
|
|
|
|
unsigned getValueID(const Value *V) const {
|
|
|
|
ValueMapType::const_iterator I = ValueMap.find(V);
|
|
|
|
assert(I != ValueMap.end() && "Value not in slotcalculator!");
|
2007-04-23 21:23:41 +00:00
|
|
|
return I->second-1;
|
2007-04-22 06:24:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned getTypeID(const Type *T) const {
|
|
|
|
TypeMapType::const_iterator I = TypeMap.find(T);
|
|
|
|
assert(I != TypeMap.end() && "Type not in ValueEnumerator!");
|
|
|
|
return I->second-1;
|
|
|
|
}
|
2007-05-03 22:46:43 +00:00
|
|
|
|
2008-09-25 21:00:45 +00:00
|
|
|
unsigned getAttributeID(const AttrListPtr &PAL) const {
|
2008-03-12 17:45:29 +00:00
|
|
|
if (PAL.isEmpty()) return 0; // Null maps to zero.
|
2008-09-25 21:00:45 +00:00
|
|
|
AttributeMapType::const_iterator I = AttributeMap.find(PAL.getRawPointer());
|
|
|
|
assert(I != AttributeMap.end() && "Attribute not in ValueEnumerator!");
|
2007-05-03 22:46:43 +00:00
|
|
|
return I->second;
|
|
|
|
}
|
2007-04-22 06:24:45 +00:00
|
|
|
|
2007-04-26 05:53:54 +00:00
|
|
|
/// getFunctionConstantRange - Return the range of values that corresponds to
|
|
|
|
/// function-local constants.
|
|
|
|
void getFunctionConstantRange(unsigned &Start, unsigned &End) const {
|
|
|
|
Start = FirstFuncConstantID;
|
|
|
|
End = FirstInstID;
|
|
|
|
}
|
|
|
|
|
2007-04-24 00:16:04 +00:00
|
|
|
const ValueList &getValues() const { return Values; }
|
2007-04-22 06:24:45 +00:00
|
|
|
const TypeList &getTypes() const { return Types; }
|
2007-04-26 04:42:16 +00:00
|
|
|
const std::vector<const BasicBlock*> &getBasicBlocks() const {
|
|
|
|
return BasicBlocks;
|
|
|
|
}
|
2008-09-25 21:00:45 +00:00
|
|
|
const std::vector<AttrListPtr> &getAttributes() const {
|
|
|
|
return Attributes;
|
2007-05-03 22:46:43 +00:00
|
|
|
}
|
2007-04-22 06:24:45 +00:00
|
|
|
|
2007-04-26 03:27:58 +00:00
|
|
|
/// PurgeAggregateValues - If there are any aggregate values at the end of the
|
|
|
|
/// value list, remove them and return the count of the remaining values. If
|
|
|
|
/// there are none, return -1.
|
|
|
|
int PurgeAggregateValues();
|
|
|
|
|
2007-04-22 06:24:45 +00:00
|
|
|
/// incorporateFunction/purgeFunction - If you'd like to deal with a function,
|
|
|
|
/// use these two methods to get its data into the ValueEnumerator!
|
|
|
|
///
|
2007-04-26 03:50:57 +00:00
|
|
|
void incorporateFunction(const Function &F);
|
2007-04-22 06:24:45 +00:00
|
|
|
void purgeFunction();
|
|
|
|
|
|
|
|
private:
|
2007-05-04 05:21:47 +00:00
|
|
|
void OptimizeConstants(unsigned CstStart, unsigned CstEnd);
|
|
|
|
|
2007-04-22 06:24:45 +00:00
|
|
|
void EnumerateValue(const Value *V);
|
|
|
|
void EnumerateType(const Type *T);
|
2007-05-06 08:35:19 +00:00
|
|
|
void EnumerateOperandType(const Value *V);
|
2008-09-25 21:00:45 +00:00
|
|
|
void EnumerateAttributes(const AttrListPtr &PAL);
|
2007-04-22 06:24:45 +00:00
|
|
|
|
|
|
|
void EnumerateTypeSymbolTable(const TypeSymbolTable &ST);
|
|
|
|
void EnumerateValueSymbolTable(const ValueSymbolTable &ST);
|
|
|
|
};
|
|
|
|
|
|
|
|
} // End llvm namespace
|
|
|
|
|
|
|
|
#endif
|