1 //===-- Constants.cpp - Implement Constant nodes --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Constant* classes...
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Constants.h"
15 #include "ConstantFolding.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/GlobalValue.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/SymbolTable.h"
20 #include "llvm/Module.h"
21 #include "llvm/ADT/StringExtras.h"
22 #include "llvm/Support/MathExtras.h"
23 #include "llvm/Support/Compiler.h"
24 #include "llvm/Support/ManagedStatic.h"
29 //===----------------------------------------------------------------------===//
31 //===----------------------------------------------------------------------===//
33 void Constant::destroyConstantImpl() {
34 // When a Constant is destroyed, there may be lingering
35 // references to the constant by other constants in the constant pool. These
36 // constants are implicitly dependent on the module that is being deleted,
37 // but they don't know that. Because we only find out when the CPV is
38 // deleted, we must now notify all of our users (that should only be
39 // Constants) that they are, in fact, invalid now and should be deleted.
41 while (!use_empty()) {
42 Value *V = use_back();
43 #ifndef NDEBUG // Only in -g mode...
44 if (!isa<Constant>(V))
45 std::cerr << "While deleting: " << *this
46 << "\n\nUse still stuck around after Def is destroyed: "
49 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
50 Constant *CV = cast<Constant>(V);
51 CV->destroyConstant();
53 // The constant should remove itself from our use list...
54 assert((use_empty() || use_back() != V) && "Constant not removed!");
57 // Value has no outstanding references it is safe to delete it now...
61 /// canTrap - Return true if evaluation of this constant could trap. This is
62 /// true for things like constant expressions that could divide by zero.
63 bool Constant::canTrap() const {
64 assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
65 // The only thing that could possibly trap are constant exprs.
66 const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
67 if (!CE) return false;
69 // ConstantExpr traps if any operands can trap.
70 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
71 if (getOperand(i)->canTrap())
74 // Otherwise, only specific operations can trap.
75 switch (CE->getOpcode()) {
78 case Instruction::UDiv:
79 case Instruction::SDiv:
80 case Instruction::FDiv:
81 case Instruction::Rem:
82 // Div and rem can trap if the RHS is not known to be non-zero.
83 if (!isa<ConstantInt>(getOperand(1)) || getOperand(1)->isNullValue())
90 // Static constructor to create a '0' constant of arbitrary type...
91 Constant *Constant::getNullValue(const Type *Ty) {
92 switch (Ty->getTypeID()) {
93 case Type::BoolTyID: {
94 static Constant *NullBool = ConstantBool::get(false);
97 case Type::SByteTyID: {
98 static Constant *NullSByte = ConstantInt::get(Type::SByteTy, 0);
101 case Type::UByteTyID: {
102 static Constant *NullUByte = ConstantInt::get(Type::UByteTy, 0);
105 case Type::ShortTyID: {
106 static Constant *NullShort = ConstantInt::get(Type::ShortTy, 0);
109 case Type::UShortTyID: {
110 static Constant *NullUShort = ConstantInt::get(Type::UShortTy, 0);
113 case Type::IntTyID: {
114 static Constant *NullInt = ConstantInt::get(Type::IntTy, 0);
117 case Type::UIntTyID: {
118 static Constant *NullUInt = ConstantInt::get(Type::UIntTy, 0);
121 case Type::LongTyID: {
122 static Constant *NullLong = ConstantInt::get(Type::LongTy, 0);
125 case Type::ULongTyID: {
126 static Constant *NullULong = ConstantInt::get(Type::ULongTy, 0);
130 case Type::FloatTyID: {
131 static Constant *NullFloat = ConstantFP::get(Type::FloatTy, 0);
134 case Type::DoubleTyID: {
135 static Constant *NullDouble = ConstantFP::get(Type::DoubleTy, 0);
139 case Type::PointerTyID:
140 return ConstantPointerNull::get(cast<PointerType>(Ty));
142 case Type::StructTyID:
143 case Type::ArrayTyID:
144 case Type::PackedTyID:
145 return ConstantAggregateZero::get(Ty);
147 // Function, Label, or Opaque type?
148 assert(!"Cannot create a null constant of that type!");
153 // Static constructor to create the maximum constant of an integral type...
154 ConstantIntegral *ConstantIntegral::getMaxValue(const Type *Ty) {
155 switch (Ty->getTypeID()) {
156 case Type::BoolTyID: return ConstantBool::getTrue();
157 case Type::SByteTyID:
158 case Type::ShortTyID:
160 case Type::LongTyID: {
161 // Calculate 011111111111111...
162 unsigned TypeBits = Ty->getPrimitiveSize()*8;
163 int64_t Val = INT64_MAX; // All ones
164 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
165 return ConstantInt::get(Ty, Val);
168 case Type::UByteTyID:
169 case Type::UShortTyID:
171 case Type::ULongTyID: return getAllOnesValue(Ty);
177 // Static constructor to create the minimum constant for an integral type...
178 ConstantIntegral *ConstantIntegral::getMinValue(const Type *Ty) {
179 switch (Ty->getTypeID()) {
180 case Type::BoolTyID: return ConstantBool::getFalse();
181 case Type::SByteTyID:
182 case Type::ShortTyID:
184 case Type::LongTyID: {
185 // Calculate 1111111111000000000000
186 unsigned TypeBits = Ty->getPrimitiveSize()*8;
187 int64_t Val = -1; // All ones
188 Val <<= TypeBits-1; // Shift over to the right spot
189 return ConstantInt::get(Ty, Val);
192 case Type::UByteTyID:
193 case Type::UShortTyID:
195 case Type::ULongTyID: return ConstantInt::get(Ty, 0);
201 // Static constructor to create an integral constant with all bits set
202 ConstantIntegral *ConstantIntegral::getAllOnesValue(const Type *Ty) {
203 switch (Ty->getTypeID()) {
204 case Type::BoolTyID: return ConstantBool::getTrue();
205 case Type::SByteTyID:
206 case Type::ShortTyID:
208 case Type::LongTyID: return ConstantInt::get(Ty, -1);
210 case Type::UByteTyID:
211 case Type::UShortTyID:
213 case Type::ULongTyID: {
214 // Calculate ~0 of the right type...
215 unsigned TypeBits = Ty->getPrimitiveSize()*8;
216 uint64_t Val = ~0ULL; // All ones
217 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
218 return ConstantInt::get(Ty, Val);
224 //===----------------------------------------------------------------------===//
225 // ConstantXXX Classes
226 //===----------------------------------------------------------------------===//
228 //===----------------------------------------------------------------------===//
229 // Normal Constructors
231 ConstantIntegral::ConstantIntegral(const Type *Ty, ValueTy VT, uint64_t V)
232 : Constant(Ty, VT, 0, 0), Val(V) {
235 ConstantBool::ConstantBool(bool V)
236 : ConstantIntegral(Type::BoolTy, ConstantBoolVal, uint64_t(V)) {
239 ConstantInt::ConstantInt(const Type *Ty, uint64_t V)
240 : ConstantIntegral(Ty, ConstantIntVal, V) {
243 ConstantFP::ConstantFP(const Type *Ty, double V)
244 : Constant(Ty, ConstantFPVal, 0, 0) {
245 assert(isValueValidForType(Ty, V) && "Value too large for type!");
249 ConstantArray::ConstantArray(const ArrayType *T,
250 const std::vector<Constant*> &V)
251 : Constant(T, ConstantArrayVal, new Use[V.size()], V.size()) {
252 assert(V.size() == T->getNumElements() &&
253 "Invalid initializer vector for constant array");
254 Use *OL = OperandList;
255 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
258 assert((C->getType() == T->getElementType() ||
260 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
261 "Initializer for array element doesn't match array element type!");
266 ConstantArray::~ConstantArray() {
267 delete [] OperandList;
270 ConstantStruct::ConstantStruct(const StructType *T,
271 const std::vector<Constant*> &V)
272 : Constant(T, ConstantStructVal, new Use[V.size()], V.size()) {
273 assert(V.size() == T->getNumElements() &&
274 "Invalid initializer vector for constant structure");
275 Use *OL = OperandList;
276 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
279 assert((C->getType() == T->getElementType(I-V.begin()) ||
280 ((T->getElementType(I-V.begin())->isAbstract() ||
281 C->getType()->isAbstract()) &&
282 T->getElementType(I-V.begin())->getTypeID() ==
283 C->getType()->getTypeID())) &&
284 "Initializer for struct element doesn't match struct element type!");
289 ConstantStruct::~ConstantStruct() {
290 delete [] OperandList;
294 ConstantPacked::ConstantPacked(const PackedType *T,
295 const std::vector<Constant*> &V)
296 : Constant(T, ConstantPackedVal, new Use[V.size()], V.size()) {
297 Use *OL = OperandList;
298 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
301 assert((C->getType() == T->getElementType() ||
303 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
304 "Initializer for packed element doesn't match packed element type!");
309 ConstantPacked::~ConstantPacked() {
310 delete [] OperandList;
313 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
314 /// behind the scenes to implement unary constant exprs.
316 class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
319 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
320 : ConstantExpr(Ty, Opcode, &Op, 1), Op(C, this) {}
324 static bool isSetCC(unsigned Opcode) {
325 return Opcode == Instruction::SetEQ || Opcode == Instruction::SetNE ||
326 Opcode == Instruction::SetLT || Opcode == Instruction::SetGT ||
327 Opcode == Instruction::SetLE || Opcode == Instruction::SetGE;
330 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
331 /// behind the scenes to implement binary constant exprs.
333 class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
336 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
337 : ConstantExpr(isSetCC(Opcode) ? Type::BoolTy : C1->getType(),
339 Ops[0].init(C1, this);
340 Ops[1].init(C2, this);
345 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
346 /// behind the scenes to implement select constant exprs.
348 class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
351 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
352 : ConstantExpr(C2->getType(), Instruction::Select, Ops, 3) {
353 Ops[0].init(C1, this);
354 Ops[1].init(C2, this);
355 Ops[2].init(C3, this);
360 /// ExtractElementConstantExpr - This class is private to
361 /// Constants.cpp, and is used behind the scenes to implement
362 /// extractelement constant exprs.
364 class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
367 ExtractElementConstantExpr(Constant *C1, Constant *C2)
368 : ConstantExpr(cast<PackedType>(C1->getType())->getElementType(),
369 Instruction::ExtractElement, Ops, 2) {
370 Ops[0].init(C1, this);
371 Ops[1].init(C2, this);
376 /// InsertElementConstantExpr - This class is private to
377 /// Constants.cpp, and is used behind the scenes to implement
378 /// insertelement constant exprs.
380 class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
383 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
384 : ConstantExpr(C1->getType(), Instruction::InsertElement,
386 Ops[0].init(C1, this);
387 Ops[1].init(C2, this);
388 Ops[2].init(C3, this);
393 /// ShuffleVectorConstantExpr - This class is private to
394 /// Constants.cpp, and is used behind the scenes to implement
395 /// shufflevector constant exprs.
397 class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
400 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
401 : ConstantExpr(C1->getType(), Instruction::ShuffleVector,
403 Ops[0].init(C1, this);
404 Ops[1].init(C2, this);
405 Ops[2].init(C3, this);
410 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
411 /// used behind the scenes to implement getelementpr constant exprs.
413 struct VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
414 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
416 : ConstantExpr(DestTy, Instruction::GetElementPtr,
417 new Use[IdxList.size()+1], IdxList.size()+1) {
418 OperandList[0].init(C, this);
419 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
420 OperandList[i+1].init(IdxList[i], this);
422 ~GetElementPtrConstantExpr() {
423 delete [] OperandList;
428 /// ConstantExpr::get* - Return some common constants without having to
429 /// specify the full Instruction::OPCODE identifier.
431 Constant *ConstantExpr::getNeg(Constant *C) {
432 if (!C->getType()->isFloatingPoint())
433 return get(Instruction::Sub, getNullValue(C->getType()), C);
435 return get(Instruction::Sub, ConstantFP::get(C->getType(), -0.0), C);
437 Constant *ConstantExpr::getNot(Constant *C) {
438 assert(isa<ConstantIntegral>(C) && "Cannot NOT a nonintegral type!");
439 return get(Instruction::Xor, C,
440 ConstantIntegral::getAllOnesValue(C->getType()));
442 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
443 return get(Instruction::Add, C1, C2);
445 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
446 return get(Instruction::Sub, C1, C2);
448 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
449 return get(Instruction::Mul, C1, C2);
451 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2) {
452 return get(Instruction::UDiv, C1, C2);
454 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2) {
455 return get(Instruction::SDiv, C1, C2);
457 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
458 return get(Instruction::FDiv, C1, C2);
460 Constant *ConstantExpr::getRem(Constant *C1, Constant *C2) {
461 return get(Instruction::Rem, C1, C2);
463 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
464 return get(Instruction::And, C1, C2);
466 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
467 return get(Instruction::Or, C1, C2);
469 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
470 return get(Instruction::Xor, C1, C2);
472 Constant *ConstantExpr::getSetEQ(Constant *C1, Constant *C2) {
473 return get(Instruction::SetEQ, C1, C2);
475 Constant *ConstantExpr::getSetNE(Constant *C1, Constant *C2) {
476 return get(Instruction::SetNE, C1, C2);
478 Constant *ConstantExpr::getSetLT(Constant *C1, Constant *C2) {
479 return get(Instruction::SetLT, C1, C2);
481 Constant *ConstantExpr::getSetGT(Constant *C1, Constant *C2) {
482 return get(Instruction::SetGT, C1, C2);
484 Constant *ConstantExpr::getSetLE(Constant *C1, Constant *C2) {
485 return get(Instruction::SetLE, C1, C2);
487 Constant *ConstantExpr::getSetGE(Constant *C1, Constant *C2) {
488 return get(Instruction::SetGE, C1, C2);
490 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
491 return get(Instruction::Shl, C1, C2);
493 Constant *ConstantExpr::getShr(Constant *C1, Constant *C2) {
494 return get(Instruction::Shr, C1, C2);
497 Constant *ConstantExpr::getUShr(Constant *C1, Constant *C2) {
498 if (C1->getType()->isUnsigned()) return getShr(C1, C2);
499 return getCast(getShr(getCast(C1,
500 C1->getType()->getUnsignedVersion()), C2), C1->getType());
503 Constant *ConstantExpr::getSShr(Constant *C1, Constant *C2) {
504 if (C1->getType()->isSigned()) return getShr(C1, C2);
505 return getCast(getShr(getCast(C1,
506 C1->getType()->getSignedVersion()), C2), C1->getType());
509 /// getWithOperandReplaced - Return a constant expression identical to this
510 /// one, but with the specified operand set to the specified value.
511 Constant *ConstantExpr::getWithOperandReplaced(unsigned OpNo,
512 Constant *Op) const {
513 assert(OpNo < getNumOperands() && "Operand num is out of range!");
514 assert(Op->getType() == getOperand(OpNo)->getType() &&
515 "Replacing operand with value of different type!");
516 if (getOperand(OpNo) == Op)
517 return const_cast<ConstantExpr*>(this);
519 Constant *Op0, *Op1, *Op2;
520 switch (getOpcode()) {
521 case Instruction::Cast:
522 return ConstantExpr::getCast(Op, getType());
523 case Instruction::Select:
524 Op0 = (OpNo == 0) ? Op : getOperand(0);
525 Op1 = (OpNo == 1) ? Op : getOperand(1);
526 Op2 = (OpNo == 2) ? Op : getOperand(2);
527 return ConstantExpr::getSelect(Op0, Op1, Op2);
528 case Instruction::InsertElement:
529 Op0 = (OpNo == 0) ? Op : getOperand(0);
530 Op1 = (OpNo == 1) ? Op : getOperand(1);
531 Op2 = (OpNo == 2) ? Op : getOperand(2);
532 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
533 case Instruction::ExtractElement:
534 Op0 = (OpNo == 0) ? Op : getOperand(0);
535 Op1 = (OpNo == 1) ? Op : getOperand(1);
536 return ConstantExpr::getExtractElement(Op0, Op1);
537 case Instruction::ShuffleVector:
538 Op0 = (OpNo == 0) ? Op : getOperand(0);
539 Op1 = (OpNo == 1) ? Op : getOperand(1);
540 Op2 = (OpNo == 2) ? Op : getOperand(2);
541 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
542 case Instruction::GetElementPtr: {
543 std::vector<Constant*> Ops;
544 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
545 Ops.push_back(getOperand(i));
547 return ConstantExpr::getGetElementPtr(Op, Ops);
549 return ConstantExpr::getGetElementPtr(getOperand(0), Ops);
552 assert(getNumOperands() == 2 && "Must be binary operator?");
553 Op0 = (OpNo == 0) ? Op : getOperand(0);
554 Op1 = (OpNo == 1) ? Op : getOperand(1);
555 return ConstantExpr::get(getOpcode(), Op0, Op1);
559 /// getWithOperands - This returns the current constant expression with the
560 /// operands replaced with the specified values. The specified operands must
561 /// match count and type with the existing ones.
562 Constant *ConstantExpr::
563 getWithOperands(const std::vector<Constant*> &Ops) const {
564 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
565 bool AnyChange = false;
566 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
567 assert(Ops[i]->getType() == getOperand(i)->getType() &&
568 "Operand type mismatch!");
569 AnyChange |= Ops[i] != getOperand(i);
571 if (!AnyChange) // No operands changed, return self.
572 return const_cast<ConstantExpr*>(this);
574 switch (getOpcode()) {
575 case Instruction::Cast:
576 return ConstantExpr::getCast(Ops[0], getType());
577 case Instruction::Select:
578 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
579 case Instruction::InsertElement:
580 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
581 case Instruction::ExtractElement:
582 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
583 case Instruction::ShuffleVector:
584 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
585 case Instruction::GetElementPtr: {
586 std::vector<Constant*> ActualOps(Ops.begin()+1, Ops.end());
587 return ConstantExpr::getGetElementPtr(Ops[0], ActualOps);
590 assert(getNumOperands() == 2 && "Must be binary operator?");
591 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
596 //===----------------------------------------------------------------------===//
597 // isValueValidForType implementations
599 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
600 switch (Ty->getTypeID()) {
602 return false; // These can't be represented as integers!!!
604 case Type::SByteTyID:
605 return (Val <= INT8_MAX && Val >= INT8_MIN);
606 case Type::UByteTyID:
607 return (Val >= 0) && (Val <= UINT8_MAX);
608 case Type::ShortTyID:
609 return (Val <= INT16_MAX && Val >= INT16_MIN);
610 case Type::UShortTyID:
611 return (Val >= 0) && (Val <= UINT16_MAX);
613 return (Val <= int(INT32_MAX) && Val >= int(INT32_MIN));
615 return (Val >= 0) && (Val <= UINT32_MAX);
617 case Type::ULongTyID:
618 return true; // always true, has to fit in largest type
622 bool ConstantFP::isValueValidForType(const Type *Ty, double Val) {
623 switch (Ty->getTypeID()) {
625 return false; // These can't be represented as floating point!
627 // TODO: Figure out how to test if a double can be cast to a float!
628 case Type::FloatTyID:
629 case Type::DoubleTyID:
630 return true; // This is the largest type...
634 //===----------------------------------------------------------------------===//
635 // Factory Function Implementation
637 // ConstantCreator - A class that is used to create constants by
638 // ValueMap*. This class should be partially specialized if there is
639 // something strange that needs to be done to interface to the ctor for the
643 template<class ConstantClass, class TypeClass, class ValType>
644 struct VISIBILITY_HIDDEN ConstantCreator {
645 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
646 return new ConstantClass(Ty, V);
650 template<class ConstantClass, class TypeClass>
651 struct VISIBILITY_HIDDEN ConvertConstantType {
652 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
653 assert(0 && "This type cannot be converted!\n");
658 template<class ValType, class TypeClass, class ConstantClass,
659 bool HasLargeKey = false /*true for arrays and structs*/ >
660 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
662 typedef std::pair<const Type*, ValType> MapKey;
663 typedef std::map<MapKey, Constant *> MapTy;
664 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
665 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
667 /// Map - This is the main map from the element descriptor to the Constants.
668 /// This is the primary way we avoid creating two of the same shape
672 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
673 /// from the constants to their element in Map. This is important for
674 /// removal of constants from the array, which would otherwise have to scan
675 /// through the map with very large keys.
676 InverseMapTy InverseMap;
678 /// AbstractTypeMap - Map for abstract type constants.
680 AbstractTypeMapTy AbstractTypeMap;
683 void clear(std::vector<Constant *> &Constants) {
684 for(typename MapTy::iterator I = Map.begin(); I != Map.end(); ++I)
685 Constants.push_back(I->second);
687 AbstractTypeMap.clear();
692 typename MapTy::iterator map_end() { return Map.end(); }
694 /// InsertOrGetItem - Return an iterator for the specified element.
695 /// If the element exists in the map, the returned iterator points to the
696 /// entry and Exists=true. If not, the iterator points to the newly
697 /// inserted entry and returns Exists=false. Newly inserted entries have
698 /// I->second == 0, and should be filled in.
699 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
702 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
708 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
710 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
711 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
712 IMI->second->second == CP &&
713 "InverseMap corrupt!");
717 typename MapTy::iterator I =
718 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
719 if (I == Map.end() || I->second != CP) {
720 // FIXME: This should not use a linear scan. If this gets to be a
721 // performance problem, someone should look at this.
722 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
729 /// getOrCreate - Return the specified constant from the map, creating it if
731 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
732 MapKey Lookup(Ty, V);
733 typename MapTy::iterator I = Map.lower_bound(Lookup);
735 if (I != Map.end() && I->first == Lookup)
736 return static_cast<ConstantClass *>(I->second);
738 // If no preexisting value, create one now...
739 ConstantClass *Result =
740 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
742 /// FIXME: why does this assert fail when loading 176.gcc?
743 //assert(Result->getType() == Ty && "Type specified is not correct!");
744 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
746 if (HasLargeKey) // Remember the reverse mapping if needed.
747 InverseMap.insert(std::make_pair(Result, I));
749 // If the type of the constant is abstract, make sure that an entry exists
750 // for it in the AbstractTypeMap.
751 if (Ty->isAbstract()) {
752 typename AbstractTypeMapTy::iterator TI =
753 AbstractTypeMap.lower_bound(Ty);
755 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
756 // Add ourselves to the ATU list of the type.
757 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
759 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
765 void remove(ConstantClass *CP) {
766 typename MapTy::iterator I = FindExistingElement(CP);
767 assert(I != Map.end() && "Constant not found in constant table!");
768 assert(I->second == CP && "Didn't find correct element?");
770 if (HasLargeKey) // Remember the reverse mapping if needed.
771 InverseMap.erase(CP);
773 // Now that we found the entry, make sure this isn't the entry that
774 // the AbstractTypeMap points to.
775 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
776 if (Ty->isAbstract()) {
777 assert(AbstractTypeMap.count(Ty) &&
778 "Abstract type not in AbstractTypeMap?");
779 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
780 if (ATMEntryIt == I) {
781 // Yes, we are removing the representative entry for this type.
782 // See if there are any other entries of the same type.
783 typename MapTy::iterator TmpIt = ATMEntryIt;
785 // First check the entry before this one...
786 if (TmpIt != Map.begin()) {
788 if (TmpIt->first.first != Ty) // Not the same type, move back...
792 // If we didn't find the same type, try to move forward...
793 if (TmpIt == ATMEntryIt) {
795 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
796 --TmpIt; // No entry afterwards with the same type
799 // If there is another entry in the map of the same abstract type,
800 // update the AbstractTypeMap entry now.
801 if (TmpIt != ATMEntryIt) {
804 // Otherwise, we are removing the last instance of this type
805 // from the table. Remove from the ATM, and from user list.
806 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
807 AbstractTypeMap.erase(Ty);
816 /// MoveConstantToNewSlot - If we are about to change C to be the element
817 /// specified by I, update our internal data structures to reflect this
819 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
820 // First, remove the old location of the specified constant in the map.
821 typename MapTy::iterator OldI = FindExistingElement(C);
822 assert(OldI != Map.end() && "Constant not found in constant table!");
823 assert(OldI->second == C && "Didn't find correct element?");
825 // If this constant is the representative element for its abstract type,
826 // update the AbstractTypeMap so that the representative element is I.
827 if (C->getType()->isAbstract()) {
828 typename AbstractTypeMapTy::iterator ATI =
829 AbstractTypeMap.find(C->getType());
830 assert(ATI != AbstractTypeMap.end() &&
831 "Abstract type not in AbstractTypeMap?");
832 if (ATI->second == OldI)
836 // Remove the old entry from the map.
839 // Update the inverse map so that we know that this constant is now
840 // located at descriptor I.
842 assert(I->second == C && "Bad inversemap entry!");
847 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
848 typename AbstractTypeMapTy::iterator I =
849 AbstractTypeMap.find(cast<Type>(OldTy));
851 assert(I != AbstractTypeMap.end() &&
852 "Abstract type not in AbstractTypeMap?");
854 // Convert a constant at a time until the last one is gone. The last one
855 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
856 // eliminated eventually.
858 ConvertConstantType<ConstantClass,
860 static_cast<ConstantClass *>(I->second->second),
861 cast<TypeClass>(NewTy));
863 I = AbstractTypeMap.find(cast<Type>(OldTy));
864 } while (I != AbstractTypeMap.end());
867 // If the type became concrete without being refined to any other existing
868 // type, we just remove ourselves from the ATU list.
869 void typeBecameConcrete(const DerivedType *AbsTy) {
870 AbsTy->removeAbstractTypeUser(this);
874 std::cerr << "Constant.cpp: ValueMap\n";
880 //---- ConstantBool::get*() implementation.
882 ConstantBool *ConstantBool::getTrue() {
883 static ConstantBool *T = 0;
885 return T = new ConstantBool(true);
887 ConstantBool *ConstantBool::getFalse() {
888 static ConstantBool *F = 0;
890 return F = new ConstantBool(false);
893 //---- ConstantInt::get() implementations...
895 static ManagedStatic<ValueMap<uint64_t, Type, ConstantInt> > IntConstants;
897 // Get a ConstantInt from an int64_t. Note here that we canoncialize the value
898 // to a uint64_t value that has been zero extended down to the size of the
899 // integer type of the ConstantInt. This allows the getZExtValue method to
900 // just return the stored value while getSExtValue has to convert back to sign
901 // extended. getZExtValue is more common in LLVM than getSExtValue().
902 ConstantInt *ConstantInt::get(const Type *Ty, int64_t V) {
903 unsigned Size = Ty->getPrimitiveSizeInBits();
904 uint64_t ZeroExtendedCanonicalization = V & (~uint64_t(0UL) >> (64-Size));
905 return IntConstants->getOrCreate(Ty, ZeroExtendedCanonicalization );
908 //---- ConstantFP::get() implementation...
912 struct ConstantCreator<ConstantFP, Type, uint64_t> {
913 static ConstantFP *create(const Type *Ty, uint64_t V) {
914 assert(Ty == Type::DoubleTy);
915 return new ConstantFP(Ty, BitsToDouble(V));
919 struct ConstantCreator<ConstantFP, Type, uint32_t> {
920 static ConstantFP *create(const Type *Ty, uint32_t V) {
921 assert(Ty == Type::FloatTy);
922 return new ConstantFP(Ty, BitsToFloat(V));
927 static ManagedStatic<ValueMap<uint64_t, Type, ConstantFP> > DoubleConstants;
928 static ManagedStatic<ValueMap<uint32_t, Type, ConstantFP> > FloatConstants;
930 bool ConstantFP::isNullValue() const {
931 return DoubleToBits(Val) == 0;
934 bool ConstantFP::isExactlyValue(double V) const {
935 return DoubleToBits(V) == DoubleToBits(Val);
939 ConstantFP *ConstantFP::get(const Type *Ty, double V) {
940 if (Ty == Type::FloatTy) {
941 // Force the value through memory to normalize it.
942 return FloatConstants->getOrCreate(Ty, FloatToBits(V));
944 assert(Ty == Type::DoubleTy);
945 return DoubleConstants->getOrCreate(Ty, DoubleToBits(V));
949 //---- ConstantAggregateZero::get() implementation...
952 // ConstantAggregateZero does not take extra "value" argument...
953 template<class ValType>
954 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
955 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
956 return new ConstantAggregateZero(Ty);
961 struct ConvertConstantType<ConstantAggregateZero, Type> {
962 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
963 // Make everyone now use a constant of the new type...
964 Constant *New = ConstantAggregateZero::get(NewTy);
965 assert(New != OldC && "Didn't replace constant??");
966 OldC->uncheckedReplaceAllUsesWith(New);
967 OldC->destroyConstant(); // This constant is now dead, destroy it.
972 static ManagedStatic<ValueMap<char, Type,
973 ConstantAggregateZero> > AggZeroConstants;
975 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
977 Constant *ConstantAggregateZero::get(const Type *Ty) {
978 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<PackedType>(Ty)) &&
979 "Cannot create an aggregate zero of non-aggregate type!");
980 return AggZeroConstants->getOrCreate(Ty, 0);
983 // destroyConstant - Remove the constant from the constant table...
985 void ConstantAggregateZero::destroyConstant() {
986 AggZeroConstants->remove(this);
987 destroyConstantImpl();
990 //---- ConstantArray::get() implementation...
994 struct ConvertConstantType<ConstantArray, ArrayType> {
995 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
996 // Make everyone now use a constant of the new type...
997 std::vector<Constant*> C;
998 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
999 C.push_back(cast<Constant>(OldC->getOperand(i)));
1000 Constant *New = ConstantArray::get(NewTy, C);
1001 assert(New != OldC && "Didn't replace constant??");
1002 OldC->uncheckedReplaceAllUsesWith(New);
1003 OldC->destroyConstant(); // This constant is now dead, destroy it.
1008 static std::vector<Constant*> getValType(ConstantArray *CA) {
1009 std::vector<Constant*> Elements;
1010 Elements.reserve(CA->getNumOperands());
1011 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1012 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1016 typedef ValueMap<std::vector<Constant*>, ArrayType,
1017 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1018 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1020 Constant *ConstantArray::get(const ArrayType *Ty,
1021 const std::vector<Constant*> &V) {
1022 // If this is an all-zero array, return a ConstantAggregateZero object
1025 if (!C->isNullValue())
1026 return ArrayConstants->getOrCreate(Ty, V);
1027 for (unsigned i = 1, e = V.size(); i != e; ++i)
1029 return ArrayConstants->getOrCreate(Ty, V);
1031 return ConstantAggregateZero::get(Ty);
1034 // destroyConstant - Remove the constant from the constant table...
1036 void ConstantArray::destroyConstant() {
1037 ArrayConstants->remove(this);
1038 destroyConstantImpl();
1041 /// ConstantArray::get(const string&) - Return an array that is initialized to
1042 /// contain the specified string. If length is zero then a null terminator is
1043 /// added to the specified string so that it may be used in a natural way.
1044 /// Otherwise, the length parameter specifies how much of the string to use
1045 /// and it won't be null terminated.
1047 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1048 std::vector<Constant*> ElementVals;
1049 for (unsigned i = 0; i < Str.length(); ++i)
1050 ElementVals.push_back(ConstantInt::get(Type::SByteTy, Str[i]));
1052 // Add a null terminator to the string...
1054 ElementVals.push_back(ConstantInt::get(Type::SByteTy, 0));
1057 ArrayType *ATy = ArrayType::get(Type::SByteTy, ElementVals.size());
1058 return ConstantArray::get(ATy, ElementVals);
1061 /// isString - This method returns true if the array is an array of sbyte or
1062 /// ubyte, and if the elements of the array are all ConstantInt's.
1063 bool ConstantArray::isString() const {
1064 // Check the element type for sbyte or ubyte...
1065 if (getType()->getElementType() != Type::UByteTy &&
1066 getType()->getElementType() != Type::SByteTy)
1068 // Check the elements to make sure they are all integers, not constant
1070 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1071 if (!isa<ConstantInt>(getOperand(i)))
1076 // getAsString - If the sub-element type of this array is either sbyte or ubyte,
1077 // then this method converts the array to an std::string and returns it.
1078 // Otherwise, it asserts out.
1080 std::string ConstantArray::getAsString() const {
1081 assert(isString() && "Not a string!");
1083 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1084 Result += (char)cast<ConstantInt>(getOperand(i))->getZExtValue();
1089 //---- ConstantStruct::get() implementation...
1094 struct ConvertConstantType<ConstantStruct, StructType> {
1095 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1096 // Make everyone now use a constant of the new type...
1097 std::vector<Constant*> C;
1098 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1099 C.push_back(cast<Constant>(OldC->getOperand(i)));
1100 Constant *New = ConstantStruct::get(NewTy, C);
1101 assert(New != OldC && "Didn't replace constant??");
1103 OldC->uncheckedReplaceAllUsesWith(New);
1104 OldC->destroyConstant(); // This constant is now dead, destroy it.
1109 typedef ValueMap<std::vector<Constant*>, StructType,
1110 ConstantStruct, true /*largekey*/> StructConstantsTy;
1111 static ManagedStatic<StructConstantsTy> StructConstants;
1113 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1114 std::vector<Constant*> Elements;
1115 Elements.reserve(CS->getNumOperands());
1116 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1117 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1121 Constant *ConstantStruct::get(const StructType *Ty,
1122 const std::vector<Constant*> &V) {
1123 // Create a ConstantAggregateZero value if all elements are zeros...
1124 for (unsigned i = 0, e = V.size(); i != e; ++i)
1125 if (!V[i]->isNullValue())
1126 return StructConstants->getOrCreate(Ty, V);
1128 return ConstantAggregateZero::get(Ty);
1131 Constant *ConstantStruct::get(const std::vector<Constant*> &V) {
1132 std::vector<const Type*> StructEls;
1133 StructEls.reserve(V.size());
1134 for (unsigned i = 0, e = V.size(); i != e; ++i)
1135 StructEls.push_back(V[i]->getType());
1136 return get(StructType::get(StructEls), V);
1139 // destroyConstant - Remove the constant from the constant table...
1141 void ConstantStruct::destroyConstant() {
1142 StructConstants->remove(this);
1143 destroyConstantImpl();
1146 //---- ConstantPacked::get() implementation...
1150 struct ConvertConstantType<ConstantPacked, PackedType> {
1151 static void convert(ConstantPacked *OldC, const PackedType *NewTy) {
1152 // Make everyone now use a constant of the new type...
1153 std::vector<Constant*> C;
1154 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1155 C.push_back(cast<Constant>(OldC->getOperand(i)));
1156 Constant *New = ConstantPacked::get(NewTy, C);
1157 assert(New != OldC && "Didn't replace constant??");
1158 OldC->uncheckedReplaceAllUsesWith(New);
1159 OldC->destroyConstant(); // This constant is now dead, destroy it.
1164 static std::vector<Constant*> getValType(ConstantPacked *CP) {
1165 std::vector<Constant*> Elements;
1166 Elements.reserve(CP->getNumOperands());
1167 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1168 Elements.push_back(CP->getOperand(i));
1172 static ManagedStatic<ValueMap<std::vector<Constant*>, PackedType,
1173 ConstantPacked> > PackedConstants;
1175 Constant *ConstantPacked::get(const PackedType *Ty,
1176 const std::vector<Constant*> &V) {
1177 // If this is an all-zero packed, return a ConstantAggregateZero object
1180 if (!C->isNullValue())
1181 return PackedConstants->getOrCreate(Ty, V);
1182 for (unsigned i = 1, e = V.size(); i != e; ++i)
1184 return PackedConstants->getOrCreate(Ty, V);
1186 return ConstantAggregateZero::get(Ty);
1189 Constant *ConstantPacked::get(const std::vector<Constant*> &V) {
1190 assert(!V.empty() && "Cannot infer type if V is empty");
1191 return get(PackedType::get(V.front()->getType(),V.size()), V);
1194 // destroyConstant - Remove the constant from the constant table...
1196 void ConstantPacked::destroyConstant() {
1197 PackedConstants->remove(this);
1198 destroyConstantImpl();
1201 //---- ConstantPointerNull::get() implementation...
1205 // ConstantPointerNull does not take extra "value" argument...
1206 template<class ValType>
1207 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1208 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1209 return new ConstantPointerNull(Ty);
1214 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1215 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1216 // Make everyone now use a constant of the new type...
1217 Constant *New = ConstantPointerNull::get(NewTy);
1218 assert(New != OldC && "Didn't replace constant??");
1219 OldC->uncheckedReplaceAllUsesWith(New);
1220 OldC->destroyConstant(); // This constant is now dead, destroy it.
1225 static ManagedStatic<ValueMap<char, PointerType,
1226 ConstantPointerNull> > NullPtrConstants;
1228 static char getValType(ConstantPointerNull *) {
1233 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1234 return NullPtrConstants->getOrCreate(Ty, 0);
1237 // destroyConstant - Remove the constant from the constant table...
1239 void ConstantPointerNull::destroyConstant() {
1240 NullPtrConstants->remove(this);
1241 destroyConstantImpl();
1245 //---- UndefValue::get() implementation...
1249 // UndefValue does not take extra "value" argument...
1250 template<class ValType>
1251 struct ConstantCreator<UndefValue, Type, ValType> {
1252 static UndefValue *create(const Type *Ty, const ValType &V) {
1253 return new UndefValue(Ty);
1258 struct ConvertConstantType<UndefValue, Type> {
1259 static void convert(UndefValue *OldC, const Type *NewTy) {
1260 // Make everyone now use a constant of the new type.
1261 Constant *New = UndefValue::get(NewTy);
1262 assert(New != OldC && "Didn't replace constant??");
1263 OldC->uncheckedReplaceAllUsesWith(New);
1264 OldC->destroyConstant(); // This constant is now dead, destroy it.
1269 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1271 static char getValType(UndefValue *) {
1276 UndefValue *UndefValue::get(const Type *Ty) {
1277 return UndefValueConstants->getOrCreate(Ty, 0);
1280 // destroyConstant - Remove the constant from the constant table.
1282 void UndefValue::destroyConstant() {
1283 UndefValueConstants->remove(this);
1284 destroyConstantImpl();
1290 //---- ConstantExpr::get() implementations...
1292 typedef std::pair<unsigned, std::vector<Constant*> > ExprMapKeyType;
1296 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1297 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V) {
1298 if (V.first == Instruction::Cast)
1299 return new UnaryConstantExpr(Instruction::Cast, V.second[0], Ty);
1300 if ((V.first >= Instruction::BinaryOpsBegin &&
1301 V.first < Instruction::BinaryOpsEnd) ||
1302 V.first == Instruction::Shl || V.first == Instruction::Shr)
1303 return new BinaryConstantExpr(V.first, V.second[0], V.second[1]);
1304 if (V.first == Instruction::Select)
1305 return new SelectConstantExpr(V.second[0], V.second[1], V.second[2]);
1306 if (V.first == Instruction::ExtractElement)
1307 return new ExtractElementConstantExpr(V.second[0], V.second[1]);
1308 if (V.first == Instruction::InsertElement)
1309 return new InsertElementConstantExpr(V.second[0], V.second[1],
1311 if (V.first == Instruction::ShuffleVector)
1312 return new ShuffleVectorConstantExpr(V.second[0], V.second[1],
1315 assert(V.first == Instruction::GetElementPtr && "Invalid ConstantExpr!");
1317 std::vector<Constant*> IdxList(V.second.begin()+1, V.second.end());
1318 return new GetElementPtrConstantExpr(V.second[0], IdxList, Ty);
1323 struct ConvertConstantType<ConstantExpr, Type> {
1324 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1326 switch (OldC->getOpcode()) {
1327 case Instruction::Cast:
1328 New = ConstantExpr::getCast(OldC->getOperand(0), NewTy);
1330 case Instruction::Select:
1331 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1332 OldC->getOperand(1),
1333 OldC->getOperand(2));
1335 case Instruction::Shl:
1336 case Instruction::Shr:
1337 New = ConstantExpr::getShiftTy(NewTy, OldC->getOpcode(),
1338 OldC->getOperand(0), OldC->getOperand(1));
1341 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1342 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1343 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1344 OldC->getOperand(1));
1346 case Instruction::GetElementPtr:
1347 // Make everyone now use a constant of the new type...
1348 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1349 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0), Idx);
1353 assert(New != OldC && "Didn't replace constant??");
1354 OldC->uncheckedReplaceAllUsesWith(New);
1355 OldC->destroyConstant(); // This constant is now dead, destroy it.
1358 } // end namespace llvm
1361 static ExprMapKeyType getValType(ConstantExpr *CE) {
1362 std::vector<Constant*> Operands;
1363 Operands.reserve(CE->getNumOperands());
1364 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1365 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1366 return ExprMapKeyType(CE->getOpcode(), Operands);
1369 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1370 ConstantExpr> > ExprConstants;
1372 Constant *ConstantExpr::getCast(Constant *C, const Type *Ty) {
1373 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1375 if (Constant *FC = ConstantFoldCastInstruction(C, Ty))
1376 return FC; // Fold a few common cases...
1378 // Look up the constant in the table first to ensure uniqueness
1379 std::vector<Constant*> argVec(1, C);
1380 ExprMapKeyType Key = std::make_pair(Instruction::Cast, argVec);
1381 return ExprConstants->getOrCreate(Ty, Key);
1384 Constant *ConstantExpr::getSignExtend(Constant *C, const Type *Ty) {
1385 assert(C->getType()->isIntegral() && Ty->isIntegral() &&
1386 C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() &&
1387 "This is an illegal sign extension!");
1388 if (C->getType() != Type::BoolTy) {
1389 C = ConstantExpr::getCast(C, C->getType()->getSignedVersion());
1390 return ConstantExpr::getCast(C, Ty);
1392 if (C == ConstantBool::getTrue())
1393 return ConstantIntegral::getAllOnesValue(Ty);
1395 return ConstantIntegral::getNullValue(Ty);
1399 Constant *ConstantExpr::getZeroExtend(Constant *C, const Type *Ty) {
1400 assert(C->getType()->isIntegral() && Ty->isIntegral() &&
1401 C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() &&
1402 "This is an illegal zero extension!");
1403 if (C->getType() != Type::BoolTy)
1404 C = ConstantExpr::getCast(C, C->getType()->getUnsignedVersion());
1405 return ConstantExpr::getCast(C, Ty);
1408 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1409 // sizeof is implemented as: (ulong) gep (Ty*)null, 1
1411 getGetElementPtr(getNullValue(PointerType::get(Ty)),
1412 std::vector<Constant*>(1, ConstantInt::get(Type::UIntTy, 1))),
1416 Constant *ConstantExpr::getPtrPtrFromArrayPtr(Constant *C) {
1417 // pointer from array is implemented as: getelementptr arr ptr, 0, 0
1418 static std::vector<Constant*> Indices(2, ConstantInt::get(Type::UIntTy, 0));
1420 return ConstantExpr::getGetElementPtr(C, Indices);
1423 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1424 Constant *C1, Constant *C2) {
1425 if (Opcode == Instruction::Shl || Opcode == Instruction::Shr)
1426 return getShiftTy(ReqTy, Opcode, C1, C2);
1427 // Check the operands for consistency first
1428 assert((Opcode >= Instruction::BinaryOpsBegin &&
1429 Opcode < Instruction::BinaryOpsEnd) &&
1430 "Invalid opcode in binary constant expression");
1431 assert(C1->getType() == C2->getType() &&
1432 "Operand types in binary constant expression should match");
1434 if (ReqTy == C1->getType() || (Instruction::isComparison(Opcode) &&
1435 ReqTy == Type::BoolTy))
1436 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1437 return FC; // Fold a few common cases...
1439 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1440 ExprMapKeyType Key = std::make_pair(Opcode, argVec);
1441 return ExprConstants->getOrCreate(ReqTy, Key);
1444 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
1447 case Instruction::Add: case Instruction::Sub:
1448 case Instruction::Mul:
1449 case Instruction::Rem:
1450 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1451 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
1452 isa<PackedType>(C1->getType())) &&
1453 "Tried to create an arithmetic operation on a non-arithmetic type!");
1456 case Instruction::UDiv:
1457 case Instruction::SDiv:
1458 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1459 assert((C1->getType()->isInteger() || (isa<PackedType>(C1->getType()) &&
1460 cast<PackedType>(C1->getType())->getElementType()->isInteger())) &&
1461 "Tried to create an arithmetic operation on a non-arithmetic type!");
1463 case Instruction::FDiv:
1464 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1465 assert((C1->getType()->isFloatingPoint() || (isa<PackedType>(C1->getType())
1466 && cast<PackedType>(C1->getType())->getElementType()->isFloatingPoint()))
1467 && "Tried to create an arithmetic operation on a non-arithmetic type!");
1469 case Instruction::And:
1470 case Instruction::Or:
1471 case Instruction::Xor:
1472 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1473 assert((C1->getType()->isIntegral() || isa<PackedType>(C1->getType())) &&
1474 "Tried to create a logical operation on a non-integral type!");
1476 case Instruction::SetLT: case Instruction::SetGT: case Instruction::SetLE:
1477 case Instruction::SetGE: case Instruction::SetEQ: case Instruction::SetNE:
1478 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1480 case Instruction::Shl:
1481 case Instruction::Shr:
1482 assert(C2->getType() == Type::UByteTy && "Shift should be by ubyte!");
1483 assert((C1->getType()->isInteger() || isa<PackedType>(C1->getType())) &&
1484 "Tried to create a shift operation on a non-integer type!");
1491 if (Instruction::isComparison(Opcode))
1492 return getTy(Type::BoolTy, Opcode, C1, C2);
1494 return getTy(C1->getType(), Opcode, C1, C2);
1497 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
1498 Constant *V1, Constant *V2) {
1499 assert(C->getType() == Type::BoolTy && "Select condition must be bool!");
1500 assert(V1->getType() == V2->getType() && "Select value types must match!");
1501 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
1503 if (ReqTy == V1->getType())
1504 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1505 return SC; // Fold common cases
1507 std::vector<Constant*> argVec(3, C);
1510 ExprMapKeyType Key = std::make_pair(Instruction::Select, argVec);
1511 return ExprConstants->getOrCreate(ReqTy, Key);
1514 /// getShiftTy - Return a shift left or shift right constant expr
1515 Constant *ConstantExpr::getShiftTy(const Type *ReqTy, unsigned Opcode,
1516 Constant *C1, Constant *C2) {
1517 // Check the operands for consistency first
1518 assert((Opcode == Instruction::Shl ||
1519 Opcode == Instruction::Shr) &&
1520 "Invalid opcode in binary constant expression");
1521 assert(C1->getType()->isIntegral() && C2->getType() == Type::UByteTy &&
1522 "Invalid operand types for Shift constant expr!");
1524 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1525 return FC; // Fold a few common cases...
1527 // Look up the constant in the table first to ensure uniqueness
1528 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1529 ExprMapKeyType Key = std::make_pair(Opcode, argVec);
1530 return ExprConstants->getOrCreate(ReqTy, Key);
1534 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
1535 const std::vector<Value*> &IdxList) {
1536 assert(GetElementPtrInst::getIndexedType(C->getType(), IdxList, true) &&
1537 "GEP indices invalid!");
1539 if (Constant *FC = ConstantFoldGetElementPtr(C, IdxList))
1540 return FC; // Fold a few common cases...
1542 assert(isa<PointerType>(C->getType()) &&
1543 "Non-pointer type for constant GetElementPtr expression");
1544 // Look up the constant in the table first to ensure uniqueness
1545 std::vector<Constant*> ArgVec;
1546 ArgVec.reserve(IdxList.size()+1);
1547 ArgVec.push_back(C);
1548 for (unsigned i = 0, e = IdxList.size(); i != e; ++i)
1549 ArgVec.push_back(cast<Constant>(IdxList[i]));
1550 const ExprMapKeyType &Key = std::make_pair(Instruction::GetElementPtr,ArgVec);
1551 return ExprConstants->getOrCreate(ReqTy, Key);
1554 Constant *ConstantExpr::getGetElementPtr(Constant *C,
1555 const std::vector<Constant*> &IdxList){
1556 // Get the result type of the getelementptr!
1557 std::vector<Value*> VIdxList(IdxList.begin(), IdxList.end());
1559 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), VIdxList,
1561 assert(Ty && "GEP indices invalid!");
1562 return getGetElementPtrTy(PointerType::get(Ty), C, VIdxList);
1565 Constant *ConstantExpr::getGetElementPtr(Constant *C,
1566 const std::vector<Value*> &IdxList) {
1567 // Get the result type of the getelementptr!
1568 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), IdxList,
1570 assert(Ty && "GEP indices invalid!");
1571 return getGetElementPtrTy(PointerType::get(Ty), C, IdxList);
1574 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
1576 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
1577 return FC; // Fold a few common cases...
1578 // Look up the constant in the table first to ensure uniqueness
1579 std::vector<Constant*> ArgVec(1, Val);
1580 ArgVec.push_back(Idx);
1581 const ExprMapKeyType &Key = std::make_pair(Instruction::ExtractElement,ArgVec);
1582 return ExprConstants->getOrCreate(ReqTy, Key);
1585 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
1586 assert(isa<PackedType>(Val->getType()) &&
1587 "Tried to create extractelement operation on non-packed type!");
1588 assert(Idx->getType() == Type::UIntTy &&
1589 "Extractelement index must be uint type!");
1590 return getExtractElementTy(cast<PackedType>(Val->getType())->getElementType(),
1594 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
1595 Constant *Elt, Constant *Idx) {
1596 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
1597 return FC; // Fold a few common cases...
1598 // Look up the constant in the table first to ensure uniqueness
1599 std::vector<Constant*> ArgVec(1, Val);
1600 ArgVec.push_back(Elt);
1601 ArgVec.push_back(Idx);
1602 const ExprMapKeyType &Key = std::make_pair(Instruction::InsertElement,ArgVec);
1603 return ExprConstants->getOrCreate(ReqTy, Key);
1606 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
1608 assert(isa<PackedType>(Val->getType()) &&
1609 "Tried to create insertelement operation on non-packed type!");
1610 assert(Elt->getType() == cast<PackedType>(Val->getType())->getElementType()
1611 && "Insertelement types must match!");
1612 assert(Idx->getType() == Type::UIntTy &&
1613 "Insertelement index must be uint type!");
1614 return getInsertElementTy(cast<PackedType>(Val->getType())->getElementType(),
1618 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
1619 Constant *V2, Constant *Mask) {
1620 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
1621 return FC; // Fold a few common cases...
1622 // Look up the constant in the table first to ensure uniqueness
1623 std::vector<Constant*> ArgVec(1, V1);
1624 ArgVec.push_back(V2);
1625 ArgVec.push_back(Mask);
1626 const ExprMapKeyType &Key = std::make_pair(Instruction::ShuffleVector,ArgVec);
1627 return ExprConstants->getOrCreate(ReqTy, Key);
1630 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
1632 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
1633 "Invalid shuffle vector constant expr operands!");
1634 return getShuffleVectorTy(V1->getType(), V1, V2, Mask);
1638 // destroyConstant - Remove the constant from the constant table...
1640 void ConstantExpr::destroyConstant() {
1641 ExprConstants->remove(this);
1642 destroyConstantImpl();
1645 const char *ConstantExpr::getOpcodeName() const {
1646 return Instruction::getOpcodeName(getOpcode());
1649 //===----------------------------------------------------------------------===//
1650 // replaceUsesOfWithOnConstant implementations
1652 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
1654 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1655 Constant *ToC = cast<Constant>(To);
1657 unsigned OperandToUpdate = U-OperandList;
1658 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
1660 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
1661 Lookup.first.first = getType();
1662 Lookup.second = this;
1664 std::vector<Constant*> &Values = Lookup.first.second;
1665 Values.reserve(getNumOperands()); // Build replacement array.
1667 // Fill values with the modified operands of the constant array. Also,
1668 // compute whether this turns into an all-zeros array.
1669 bool isAllZeros = false;
1670 if (!ToC->isNullValue()) {
1671 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
1672 Values.push_back(cast<Constant>(O->get()));
1675 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
1676 Constant *Val = cast<Constant>(O->get());
1677 Values.push_back(Val);
1678 if (isAllZeros) isAllZeros = Val->isNullValue();
1681 Values[OperandToUpdate] = ToC;
1683 Constant *Replacement = 0;
1685 Replacement = ConstantAggregateZero::get(getType());
1687 // Check to see if we have this array type already.
1689 ArrayConstantsTy::MapTy::iterator I =
1690 ArrayConstants->InsertOrGetItem(Lookup, Exists);
1693 Replacement = I->second;
1695 // Okay, the new shape doesn't exist in the system yet. Instead of
1696 // creating a new constant array, inserting it, replaceallusesof'ing the
1697 // old with the new, then deleting the old... just update the current one
1699 ArrayConstants->MoveConstantToNewSlot(this, I);
1701 // Update to the new value.
1702 setOperand(OperandToUpdate, ToC);
1707 // Otherwise, I do need to replace this with an existing value.
1708 assert(Replacement != this && "I didn't contain From!");
1710 // Everyone using this now uses the replacement.
1711 uncheckedReplaceAllUsesWith(Replacement);
1713 // Delete the old constant!
1717 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
1719 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1720 Constant *ToC = cast<Constant>(To);
1722 unsigned OperandToUpdate = U-OperandList;
1723 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
1725 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
1726 Lookup.first.first = getType();
1727 Lookup.second = this;
1728 std::vector<Constant*> &Values = Lookup.first.second;
1729 Values.reserve(getNumOperands()); // Build replacement struct.
1732 // Fill values with the modified operands of the constant struct. Also,
1733 // compute whether this turns into an all-zeros struct.
1734 bool isAllZeros = false;
1735 if (!ToC->isNullValue()) {
1736 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
1737 Values.push_back(cast<Constant>(O->get()));
1740 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
1741 Constant *Val = cast<Constant>(O->get());
1742 Values.push_back(Val);
1743 if (isAllZeros) isAllZeros = Val->isNullValue();
1746 Values[OperandToUpdate] = ToC;
1748 Constant *Replacement = 0;
1750 Replacement = ConstantAggregateZero::get(getType());
1752 // Check to see if we have this array type already.
1754 StructConstantsTy::MapTy::iterator I =
1755 StructConstants->InsertOrGetItem(Lookup, Exists);
1758 Replacement = I->second;
1760 // Okay, the new shape doesn't exist in the system yet. Instead of
1761 // creating a new constant struct, inserting it, replaceallusesof'ing the
1762 // old with the new, then deleting the old... just update the current one
1764 StructConstants->MoveConstantToNewSlot(this, I);
1766 // Update to the new value.
1767 setOperand(OperandToUpdate, ToC);
1772 assert(Replacement != this && "I didn't contain From!");
1774 // Everyone using this now uses the replacement.
1775 uncheckedReplaceAllUsesWith(Replacement);
1777 // Delete the old constant!
1781 void ConstantPacked::replaceUsesOfWithOnConstant(Value *From, Value *To,
1783 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1785 std::vector<Constant*> Values;
1786 Values.reserve(getNumOperands()); // Build replacement array...
1787 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1788 Constant *Val = getOperand(i);
1789 if (Val == From) Val = cast<Constant>(To);
1790 Values.push_back(Val);
1793 Constant *Replacement = ConstantPacked::get(getType(), Values);
1794 assert(Replacement != this && "I didn't contain From!");
1796 // Everyone using this now uses the replacement.
1797 uncheckedReplaceAllUsesWith(Replacement);
1799 // Delete the old constant!
1803 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
1805 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
1806 Constant *To = cast<Constant>(ToV);
1808 Constant *Replacement = 0;
1809 if (getOpcode() == Instruction::GetElementPtr) {
1810 std::vector<Constant*> Indices;
1811 Constant *Pointer = getOperand(0);
1812 Indices.reserve(getNumOperands()-1);
1813 if (Pointer == From) Pointer = To;
1815 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1816 Constant *Val = getOperand(i);
1817 if (Val == From) Val = To;
1818 Indices.push_back(Val);
1820 Replacement = ConstantExpr::getGetElementPtr(Pointer, Indices);
1821 } else if (getOpcode() == Instruction::Cast) {
1822 assert(getOperand(0) == From && "Cast only has one use!");
1823 Replacement = ConstantExpr::getCast(To, getType());
1824 } else if (getOpcode() == Instruction::Select) {
1825 Constant *C1 = getOperand(0);
1826 Constant *C2 = getOperand(1);
1827 Constant *C3 = getOperand(2);
1828 if (C1 == From) C1 = To;
1829 if (C2 == From) C2 = To;
1830 if (C3 == From) C3 = To;
1831 Replacement = ConstantExpr::getSelect(C1, C2, C3);
1832 } else if (getOpcode() == Instruction::ExtractElement) {
1833 Constant *C1 = getOperand(0);
1834 Constant *C2 = getOperand(1);
1835 if (C1 == From) C1 = To;
1836 if (C2 == From) C2 = To;
1837 Replacement = ConstantExpr::getExtractElement(C1, C2);
1838 } else if (getOpcode() == Instruction::InsertElement) {
1839 Constant *C1 = getOperand(0);
1840 Constant *C2 = getOperand(1);
1841 Constant *C3 = getOperand(1);
1842 if (C1 == From) C1 = To;
1843 if (C2 == From) C2 = To;
1844 if (C3 == From) C3 = To;
1845 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
1846 } else if (getOpcode() == Instruction::ShuffleVector) {
1847 Constant *C1 = getOperand(0);
1848 Constant *C2 = getOperand(1);
1849 Constant *C3 = getOperand(2);
1850 if (C1 == From) C1 = To;
1851 if (C2 == From) C2 = To;
1852 if (C3 == From) C3 = To;
1853 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
1854 } else if (getNumOperands() == 2) {
1855 Constant *C1 = getOperand(0);
1856 Constant *C2 = getOperand(1);
1857 if (C1 == From) C1 = To;
1858 if (C2 == From) C2 = To;
1859 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
1861 assert(0 && "Unknown ConstantExpr type!");
1865 assert(Replacement != this && "I didn't contain From!");
1867 // Everyone using this now uses the replacement.
1868 uncheckedReplaceAllUsesWith(Replacement);
1870 // Delete the old constant!
1875 /// getStringValue - Turn an LLVM constant pointer that eventually points to a
1876 /// global into a string value. Return an empty string if we can't do it.
1877 /// Parameter Chop determines if the result is chopped at the first null
1880 std::string Constant::getStringValue(bool Chop, unsigned Offset) {
1881 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(this)) {
1882 if (GV->hasInitializer() && isa<ConstantArray>(GV->getInitializer())) {
1883 ConstantArray *Init = cast<ConstantArray>(GV->getInitializer());
1884 if (Init->isString()) {
1885 std::string Result = Init->getAsString();
1886 if (Offset < Result.size()) {
1887 // If we are pointing INTO The string, erase the beginning...
1888 Result.erase(Result.begin(), Result.begin()+Offset);
1890 // Take off the null terminator, and any string fragments after it.
1892 std::string::size_type NullPos = Result.find_first_of((char)0);
1893 if (NullPos != std::string::npos)
1894 Result.erase(Result.begin()+NullPos, Result.end());
1900 } else if (Constant *C = dyn_cast<Constant>(this)) {
1901 if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
1902 return GV->getStringValue(Chop, Offset);
1903 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1904 if (CE->getOpcode() == Instruction::GetElementPtr) {
1905 // Turn a gep into the specified offset.
1906 if (CE->getNumOperands() == 3 &&
1907 cast<Constant>(CE->getOperand(1))->isNullValue() &&
1908 isa<ConstantInt>(CE->getOperand(2))) {
1909 Offset += cast<ConstantInt>(CE->getOperand(2))->getZExtValue();
1910 return CE->getOperand(0)->getStringValue(Chop, Offset);