1 //===-- Constants.cpp - Implement Constant nodes --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Constant* classes...
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Constants.h"
15 #include "ConstantFold.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/GlobalValue.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Module.h"
20 #include "llvm/ADT/StringExtras.h"
21 #include "llvm/Support/Compiler.h"
22 #include "llvm/Support/Debug.h"
23 #include "llvm/Support/ManagedStatic.h"
24 #include "llvm/Support/MathExtras.h"
25 #include "llvm/ADT/DenseMap.h"
26 #include "llvm/ADT/SmallVector.h"
31 //===----------------------------------------------------------------------===//
33 //===----------------------------------------------------------------------===//
35 void Constant::destroyConstantImpl() {
36 // When a Constant is destroyed, there may be lingering
37 // references to the constant by other constants in the constant pool. These
38 // constants are implicitly dependent on the module that is being deleted,
39 // but they don't know that. Because we only find out when the CPV is
40 // deleted, we must now notify all of our users (that should only be
41 // Constants) that they are, in fact, invalid now and should be deleted.
43 while (!use_empty()) {
44 Value *V = use_back();
45 #ifndef NDEBUG // Only in -g mode...
46 if (!isa<Constant>(V))
47 DOUT << "While deleting: " << *this
48 << "\n\nUse still stuck around after Def is destroyed: "
51 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
52 Constant *CV = cast<Constant>(V);
53 CV->destroyConstant();
55 // The constant should remove itself from our use list...
56 assert((use_empty() || use_back() != V) && "Constant not removed!");
59 // Value has no outstanding references it is safe to delete it now...
63 /// canTrap - Return true if evaluation of this constant could trap. This is
64 /// true for things like constant expressions that could divide by zero.
65 bool Constant::canTrap() const {
66 assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
67 // The only thing that could possibly trap are constant exprs.
68 const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
69 if (!CE) return false;
71 // ConstantExpr traps if any operands can trap.
72 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
73 if (getOperand(i)->canTrap())
76 // Otherwise, only specific operations can trap.
77 switch (CE->getOpcode()) {
80 case Instruction::UDiv:
81 case Instruction::SDiv:
82 case Instruction::FDiv:
83 case Instruction::URem:
84 case Instruction::SRem:
85 case Instruction::FRem:
86 // Div and rem can trap if the RHS is not known to be non-zero.
87 if (!isa<ConstantInt>(getOperand(1)) || getOperand(1)->isNullValue())
93 /// ContaintsRelocations - Return true if the constant value contains
94 /// relocations which cannot be resolved at compile time.
95 bool Constant::ContainsRelocations() const {
96 if (isa<GlobalValue>(this))
98 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
99 if (getOperand(i)->ContainsRelocations())
104 // Static constructor to create a '0' constant of arbitrary type...
105 Constant *Constant::getNullValue(const Type *Ty) {
106 static uint64_t zero[2] = {0, 0};
107 switch (Ty->getTypeID()) {
108 case Type::IntegerTyID:
109 return ConstantInt::get(Ty, 0);
110 case Type::FloatTyID:
111 return ConstantFP::get(Ty, APFloat(APInt(32, 0)));
112 case Type::DoubleTyID:
113 return ConstantFP::get(Ty, APFloat(APInt(64, 0)));
114 case Type::X86_FP80TyID:
115 return ConstantFP::get(Ty, APFloat(APInt(80, 2, zero)));
116 case Type::FP128TyID:
117 return ConstantFP::get(Ty, APFloat(APInt(128, 2, zero), true));
118 case Type::PPC_FP128TyID:
119 return ConstantFP::get(Ty, APFloat(APInt(128, 2, zero)));
120 case Type::PointerTyID:
121 return ConstantPointerNull::get(cast<PointerType>(Ty));
122 case Type::StructTyID:
123 case Type::ArrayTyID:
124 case Type::VectorTyID:
125 return ConstantAggregateZero::get(Ty);
127 // Function, Label, or Opaque type?
128 assert(!"Cannot create a null constant of that type!");
133 Constant *Constant::getAllOnesValue(const Type *Ty) {
134 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty))
135 return ConstantInt::get(APInt::getAllOnesValue(ITy->getBitWidth()));
136 return ConstantVector::getAllOnesValue(cast<VectorType>(Ty));
139 // Static constructor to create an integral constant with all bits set
140 ConstantInt *ConstantInt::getAllOnesValue(const Type *Ty) {
141 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty))
142 return ConstantInt::get(APInt::getAllOnesValue(ITy->getBitWidth()));
146 /// @returns the value for a vector integer constant of the given type that
147 /// has all its bits set to true.
148 /// @brief Get the all ones value
149 ConstantVector *ConstantVector::getAllOnesValue(const VectorType *Ty) {
150 std::vector<Constant*> Elts;
151 Elts.resize(Ty->getNumElements(),
152 ConstantInt::getAllOnesValue(Ty->getElementType()));
153 assert(Elts[0] && "Not a vector integer type!");
154 return cast<ConstantVector>(ConstantVector::get(Elts));
158 //===----------------------------------------------------------------------===//
160 //===----------------------------------------------------------------------===//
162 ConstantInt::ConstantInt(const IntegerType *Ty, const APInt& V)
163 : Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
164 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
167 ConstantInt *ConstantInt::TheTrueVal = 0;
168 ConstantInt *ConstantInt::TheFalseVal = 0;
171 void CleanupTrueFalse(void *) {
172 ConstantInt::ResetTrueFalse();
176 static ManagedCleanup<llvm::CleanupTrueFalse> TrueFalseCleanup;
178 ConstantInt *ConstantInt::CreateTrueFalseVals(bool WhichOne) {
179 assert(TheTrueVal == 0 && TheFalseVal == 0);
180 TheTrueVal = get(Type::Int1Ty, 1);
181 TheFalseVal = get(Type::Int1Ty, 0);
183 // Ensure that llvm_shutdown nulls out TheTrueVal/TheFalseVal.
184 TrueFalseCleanup.Register();
186 return WhichOne ? TheTrueVal : TheFalseVal;
191 struct DenseMapAPIntKeyInfo {
195 KeyTy(const APInt& V, const Type* Ty) : val(V), type(Ty) {}
196 KeyTy(const KeyTy& that) : val(that.val), type(that.type) {}
197 bool operator==(const KeyTy& that) const {
198 return type == that.type && this->val == that.val;
200 bool operator!=(const KeyTy& that) const {
201 return !this->operator==(that);
204 static inline KeyTy getEmptyKey() { return KeyTy(APInt(1,0), 0); }
205 static inline KeyTy getTombstoneKey() { return KeyTy(APInt(1,1), 0); }
206 static unsigned getHashValue(const KeyTy &Key) {
207 return DenseMapInfo<void*>::getHashValue(Key.type) ^
208 Key.val.getHashValue();
210 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
213 static bool isPod() { return false; }
218 typedef DenseMap<DenseMapAPIntKeyInfo::KeyTy, ConstantInt*,
219 DenseMapAPIntKeyInfo> IntMapTy;
220 static ManagedStatic<IntMapTy> IntConstants;
222 ConstantInt *ConstantInt::get(const Type *Ty, uint64_t V, bool isSigned) {
223 const IntegerType *ITy = cast<IntegerType>(Ty);
224 return get(APInt(ITy->getBitWidth(), V, isSigned));
227 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
228 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
229 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
230 // compare APInt's of different widths, which would violate an APInt class
231 // invariant which generates an assertion.
232 ConstantInt *ConstantInt::get(const APInt& V) {
233 // Get the corresponding integer type for the bit width of the value.
234 const IntegerType *ITy = IntegerType::get(V.getBitWidth());
235 // get an existing value or the insertion position
236 DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
237 ConstantInt *&Slot = (*IntConstants)[Key];
238 // if it exists, return it.
241 // otherwise create a new one, insert it, and return it.
242 return Slot = new ConstantInt(ITy, V);
245 //===----------------------------------------------------------------------===//
247 //===----------------------------------------------------------------------===//
249 ConstantFP::ConstantFP(const Type *Ty, const APFloat& V)
250 : Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
252 if (Ty==Type::FloatTy)
253 assert(&V.getSemantics()==&APFloat::IEEEsingle);
254 else if (Ty==Type::DoubleTy)
255 assert(&V.getSemantics()==&APFloat::IEEEdouble);
256 else if (Ty==Type::X86_FP80Ty)
257 assert(&V.getSemantics()==&APFloat::x87DoubleExtended);
258 else if (Ty==Type::FP128Ty)
259 assert(&V.getSemantics()==&APFloat::IEEEquad);
260 else if (Ty==Type::PPC_FP128Ty)
261 assert(&V.getSemantics()==&APFloat::PPCDoubleDouble);
266 bool ConstantFP::isNullValue() const {
267 return Val.isZero() && !Val.isNegative();
270 ConstantFP *ConstantFP::getNegativeZero(const Type *Ty) {
271 APFloat apf = cast <ConstantFP>(Constant::getNullValue(Ty))->getValueAPF();
273 return ConstantFP::get(Ty, apf);
276 bool ConstantFP::isExactlyValue(const APFloat& V) const {
277 return Val.bitwiseIsEqual(V);
281 struct DenseMapAPFloatKeyInfo {
284 KeyTy(const APFloat& V) : val(V){}
285 KeyTy(const KeyTy& that) : val(that.val) {}
286 bool operator==(const KeyTy& that) const {
287 return this->val.bitwiseIsEqual(that.val);
289 bool operator!=(const KeyTy& that) const {
290 return !this->operator==(that);
293 static inline KeyTy getEmptyKey() {
294 return KeyTy(APFloat(APFloat::Bogus,1));
296 static inline KeyTy getTombstoneKey() {
297 return KeyTy(APFloat(APFloat::Bogus,2));
299 static unsigned getHashValue(const KeyTy &Key) {
300 return Key.val.getHashValue();
302 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
305 static bool isPod() { return false; }
309 //---- ConstantFP::get() implementation...
311 typedef DenseMap<DenseMapAPFloatKeyInfo::KeyTy, ConstantFP*,
312 DenseMapAPFloatKeyInfo> FPMapTy;
314 static ManagedStatic<FPMapTy> FPConstants;
316 ConstantFP *ConstantFP::get(const Type *Ty, const APFloat& V) {
318 if (Ty==Type::FloatTy)
319 assert(&V.getSemantics()==&APFloat::IEEEsingle);
320 else if (Ty==Type::DoubleTy)
321 assert(&V.getSemantics()==&APFloat::IEEEdouble);
322 else if (Ty==Type::X86_FP80Ty)
323 assert(&V.getSemantics()==&APFloat::x87DoubleExtended);
324 else if (Ty==Type::FP128Ty)
325 assert(&V.getSemantics()==&APFloat::IEEEquad);
326 else if (Ty==Type::PPC_FP128Ty)
327 assert(&V.getSemantics()==&APFloat::PPCDoubleDouble);
331 DenseMapAPFloatKeyInfo::KeyTy Key(V);
332 ConstantFP *&Slot = (*FPConstants)[Key];
333 if (Slot) return Slot;
334 return Slot = new ConstantFP(Ty, V);
337 //===----------------------------------------------------------------------===//
338 // ConstantXXX Classes
339 //===----------------------------------------------------------------------===//
342 ConstantArray::ConstantArray(const ArrayType *T,
343 const std::vector<Constant*> &V)
344 : Constant(T, ConstantArrayVal, new Use[V.size()], V.size()) {
345 assert(V.size() == T->getNumElements() &&
346 "Invalid initializer vector for constant array");
347 Use *OL = OperandList;
348 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
351 assert((C->getType() == T->getElementType() ||
353 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
354 "Initializer for array element doesn't match array element type!");
359 ConstantArray::~ConstantArray() {
360 delete [] OperandList;
363 ConstantStruct::ConstantStruct(const StructType *T,
364 const std::vector<Constant*> &V)
365 : Constant(T, ConstantStructVal, new Use[V.size()], V.size()) {
366 assert(V.size() == T->getNumElements() &&
367 "Invalid initializer vector for constant structure");
368 Use *OL = OperandList;
369 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
372 assert((C->getType() == T->getElementType(I-V.begin()) ||
373 ((T->getElementType(I-V.begin())->isAbstract() ||
374 C->getType()->isAbstract()) &&
375 T->getElementType(I-V.begin())->getTypeID() ==
376 C->getType()->getTypeID())) &&
377 "Initializer for struct element doesn't match struct element type!");
382 ConstantStruct::~ConstantStruct() {
383 delete [] OperandList;
387 ConstantVector::ConstantVector(const VectorType *T,
388 const std::vector<Constant*> &V)
389 : Constant(T, ConstantVectorVal, new Use[V.size()], V.size()) {
390 Use *OL = OperandList;
391 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
394 assert((C->getType() == T->getElementType() ||
396 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
397 "Initializer for vector element doesn't match vector element type!");
402 ConstantVector::~ConstantVector() {
403 delete [] OperandList;
406 // We declare several classes private to this file, so use an anonymous
410 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
411 /// behind the scenes to implement unary constant exprs.
412 class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
415 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
416 : ConstantExpr(Ty, Opcode, &Op, 1), Op(C, this) {}
419 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
420 /// behind the scenes to implement binary constant exprs.
421 class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
424 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
425 : ConstantExpr(C1->getType(), Opcode, Ops, 2) {
426 Ops[0].init(C1, this);
427 Ops[1].init(C2, this);
431 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
432 /// behind the scenes to implement select constant exprs.
433 class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
436 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
437 : ConstantExpr(C2->getType(), Instruction::Select, Ops, 3) {
438 Ops[0].init(C1, this);
439 Ops[1].init(C2, this);
440 Ops[2].init(C3, this);
444 /// ExtractElementConstantExpr - This class is private to
445 /// Constants.cpp, and is used behind the scenes to implement
446 /// extractelement constant exprs.
447 class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
450 ExtractElementConstantExpr(Constant *C1, Constant *C2)
451 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(),
452 Instruction::ExtractElement, Ops, 2) {
453 Ops[0].init(C1, this);
454 Ops[1].init(C2, this);
458 /// InsertElementConstantExpr - This class is private to
459 /// Constants.cpp, and is used behind the scenes to implement
460 /// insertelement constant exprs.
461 class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
464 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
465 : ConstantExpr(C1->getType(), Instruction::InsertElement,
467 Ops[0].init(C1, this);
468 Ops[1].init(C2, this);
469 Ops[2].init(C3, this);
473 /// ShuffleVectorConstantExpr - This class is private to
474 /// Constants.cpp, and is used behind the scenes to implement
475 /// shufflevector constant exprs.
476 class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
479 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
480 : ConstantExpr(C1->getType(), Instruction::ShuffleVector,
482 Ops[0].init(C1, this);
483 Ops[1].init(C2, this);
484 Ops[2].init(C3, this);
488 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
489 /// used behind the scenes to implement getelementpr constant exprs.
490 struct VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
491 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
493 : ConstantExpr(DestTy, Instruction::GetElementPtr,
494 new Use[IdxList.size()+1], IdxList.size()+1) {
495 OperandList[0].init(C, this);
496 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
497 OperandList[i+1].init(IdxList[i], this);
499 ~GetElementPtrConstantExpr() {
500 delete [] OperandList;
504 // CompareConstantExpr - This class is private to Constants.cpp, and is used
505 // behind the scenes to implement ICmp and FCmp constant expressions. This is
506 // needed in order to store the predicate value for these instructions.
507 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
508 unsigned short predicate;
510 CompareConstantExpr(Instruction::OtherOps opc, unsigned short pred,
511 Constant* LHS, Constant* RHS)
512 : ConstantExpr(Type::Int1Ty, opc, Ops, 2), predicate(pred) {
513 OperandList[0].init(LHS, this);
514 OperandList[1].init(RHS, this);
518 } // end anonymous namespace
521 // Utility function for determining if a ConstantExpr is a CastOp or not. This
522 // can't be inline because we don't want to #include Instruction.h into
524 bool ConstantExpr::isCast() const {
525 return Instruction::isCast(getOpcode());
528 bool ConstantExpr::isCompare() const {
529 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
532 /// ConstantExpr::get* - Return some common constants without having to
533 /// specify the full Instruction::OPCODE identifier.
535 Constant *ConstantExpr::getNeg(Constant *C) {
536 return get(Instruction::Sub,
537 ConstantExpr::getZeroValueForNegationExpr(C->getType()),
540 Constant *ConstantExpr::getNot(Constant *C) {
541 assert(isa<IntegerType>(C->getType()) && "Cannot NOT a nonintegral value!");
542 return get(Instruction::Xor, C,
543 ConstantInt::getAllOnesValue(C->getType()));
545 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
546 return get(Instruction::Add, C1, C2);
548 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
549 return get(Instruction::Sub, C1, C2);
551 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
552 return get(Instruction::Mul, C1, C2);
554 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2) {
555 return get(Instruction::UDiv, C1, C2);
557 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2) {
558 return get(Instruction::SDiv, C1, C2);
560 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
561 return get(Instruction::FDiv, C1, C2);
563 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
564 return get(Instruction::URem, C1, C2);
566 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
567 return get(Instruction::SRem, C1, C2);
569 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
570 return get(Instruction::FRem, C1, C2);
572 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
573 return get(Instruction::And, C1, C2);
575 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
576 return get(Instruction::Or, C1, C2);
578 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
579 return get(Instruction::Xor, C1, C2);
581 unsigned ConstantExpr::getPredicate() const {
582 assert(getOpcode() == Instruction::FCmp || getOpcode() == Instruction::ICmp);
583 return ((const CompareConstantExpr*)this)->predicate;
585 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
586 return get(Instruction::Shl, C1, C2);
588 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2) {
589 return get(Instruction::LShr, C1, C2);
591 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2) {
592 return get(Instruction::AShr, C1, C2);
595 /// getWithOperandReplaced - Return a constant expression identical to this
596 /// one, but with the specified operand set to the specified value.
598 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
599 assert(OpNo < getNumOperands() && "Operand num is out of range!");
600 assert(Op->getType() == getOperand(OpNo)->getType() &&
601 "Replacing operand with value of different type!");
602 if (getOperand(OpNo) == Op)
603 return const_cast<ConstantExpr*>(this);
605 Constant *Op0, *Op1, *Op2;
606 switch (getOpcode()) {
607 case Instruction::Trunc:
608 case Instruction::ZExt:
609 case Instruction::SExt:
610 case Instruction::FPTrunc:
611 case Instruction::FPExt:
612 case Instruction::UIToFP:
613 case Instruction::SIToFP:
614 case Instruction::FPToUI:
615 case Instruction::FPToSI:
616 case Instruction::PtrToInt:
617 case Instruction::IntToPtr:
618 case Instruction::BitCast:
619 return ConstantExpr::getCast(getOpcode(), Op, getType());
620 case Instruction::Select:
621 Op0 = (OpNo == 0) ? Op : getOperand(0);
622 Op1 = (OpNo == 1) ? Op : getOperand(1);
623 Op2 = (OpNo == 2) ? Op : getOperand(2);
624 return ConstantExpr::getSelect(Op0, Op1, Op2);
625 case Instruction::InsertElement:
626 Op0 = (OpNo == 0) ? Op : getOperand(0);
627 Op1 = (OpNo == 1) ? Op : getOperand(1);
628 Op2 = (OpNo == 2) ? Op : getOperand(2);
629 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
630 case Instruction::ExtractElement:
631 Op0 = (OpNo == 0) ? Op : getOperand(0);
632 Op1 = (OpNo == 1) ? Op : getOperand(1);
633 return ConstantExpr::getExtractElement(Op0, Op1);
634 case Instruction::ShuffleVector:
635 Op0 = (OpNo == 0) ? Op : getOperand(0);
636 Op1 = (OpNo == 1) ? Op : getOperand(1);
637 Op2 = (OpNo == 2) ? Op : getOperand(2);
638 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
639 case Instruction::GetElementPtr: {
640 SmallVector<Constant*, 8> Ops;
641 Ops.resize(getNumOperands());
642 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
643 Ops[i] = getOperand(i);
645 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
647 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
650 assert(getNumOperands() == 2 && "Must be binary operator?");
651 Op0 = (OpNo == 0) ? Op : getOperand(0);
652 Op1 = (OpNo == 1) ? Op : getOperand(1);
653 return ConstantExpr::get(getOpcode(), Op0, Op1);
657 /// getWithOperands - This returns the current constant expression with the
658 /// operands replaced with the specified values. The specified operands must
659 /// match count and type with the existing ones.
660 Constant *ConstantExpr::
661 getWithOperands(const std::vector<Constant*> &Ops) const {
662 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
663 bool AnyChange = false;
664 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
665 assert(Ops[i]->getType() == getOperand(i)->getType() &&
666 "Operand type mismatch!");
667 AnyChange |= Ops[i] != getOperand(i);
669 if (!AnyChange) // No operands changed, return self.
670 return const_cast<ConstantExpr*>(this);
672 switch (getOpcode()) {
673 case Instruction::Trunc:
674 case Instruction::ZExt:
675 case Instruction::SExt:
676 case Instruction::FPTrunc:
677 case Instruction::FPExt:
678 case Instruction::UIToFP:
679 case Instruction::SIToFP:
680 case Instruction::FPToUI:
681 case Instruction::FPToSI:
682 case Instruction::PtrToInt:
683 case Instruction::IntToPtr:
684 case Instruction::BitCast:
685 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
686 case Instruction::Select:
687 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
688 case Instruction::InsertElement:
689 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
690 case Instruction::ExtractElement:
691 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
692 case Instruction::ShuffleVector:
693 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
694 case Instruction::GetElementPtr:
695 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], Ops.size()-1);
696 case Instruction::ICmp:
697 case Instruction::FCmp:
698 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
700 assert(getNumOperands() == 2 && "Must be binary operator?");
701 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
706 //===----------------------------------------------------------------------===//
707 // isValueValidForType implementations
709 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
710 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
711 if (Ty == Type::Int1Ty)
712 return Val == 0 || Val == 1;
714 return true; // always true, has to fit in largest type
715 uint64_t Max = (1ll << NumBits) - 1;
719 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
720 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
721 if (Ty == Type::Int1Ty)
722 return Val == 0 || Val == 1 || Val == -1;
724 return true; // always true, has to fit in largest type
725 int64_t Min = -(1ll << (NumBits-1));
726 int64_t Max = (1ll << (NumBits-1)) - 1;
727 return (Val >= Min && Val <= Max);
730 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
731 // convert modifies in place, so make a copy.
732 APFloat Val2 = APFloat(Val);
733 switch (Ty->getTypeID()) {
735 return false; // These can't be represented as floating point!
737 // FIXME rounding mode needs to be more flexible
738 case Type::FloatTyID:
739 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
740 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
742 case Type::DoubleTyID:
743 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
744 &Val2.getSemantics() == &APFloat::IEEEdouble ||
745 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
747 case Type::X86_FP80TyID:
748 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
749 &Val2.getSemantics() == &APFloat::IEEEdouble ||
750 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
751 case Type::FP128TyID:
752 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
753 &Val2.getSemantics() == &APFloat::IEEEdouble ||
754 &Val2.getSemantics() == &APFloat::IEEEquad;
755 case Type::PPC_FP128TyID:
756 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
757 &Val2.getSemantics() == &APFloat::IEEEdouble ||
758 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
762 //===----------------------------------------------------------------------===//
763 // Factory Function Implementation
765 // ConstantCreator - A class that is used to create constants by
766 // ValueMap*. This class should be partially specialized if there is
767 // something strange that needs to be done to interface to the ctor for the
771 template<class ConstantClass, class TypeClass, class ValType>
772 struct VISIBILITY_HIDDEN ConstantCreator {
773 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
774 return new ConstantClass(Ty, V);
778 template<class ConstantClass, class TypeClass>
779 struct VISIBILITY_HIDDEN ConvertConstantType {
780 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
781 assert(0 && "This type cannot be converted!\n");
786 template<class ValType, class TypeClass, class ConstantClass,
787 bool HasLargeKey = false /*true for arrays and structs*/ >
788 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
790 typedef std::pair<const Type*, ValType> MapKey;
791 typedef std::map<MapKey, Constant *> MapTy;
792 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
793 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
795 /// Map - This is the main map from the element descriptor to the Constants.
796 /// This is the primary way we avoid creating two of the same shape
800 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
801 /// from the constants to their element in Map. This is important for
802 /// removal of constants from the array, which would otherwise have to scan
803 /// through the map with very large keys.
804 InverseMapTy InverseMap;
806 /// AbstractTypeMap - Map for abstract type constants.
808 AbstractTypeMapTy AbstractTypeMap;
811 typename MapTy::iterator map_end() { return Map.end(); }
813 /// InsertOrGetItem - Return an iterator for the specified element.
814 /// If the element exists in the map, the returned iterator points to the
815 /// entry and Exists=true. If not, the iterator points to the newly
816 /// inserted entry and returns Exists=false. Newly inserted entries have
817 /// I->second == 0, and should be filled in.
818 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
821 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
827 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
829 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
830 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
831 IMI->second->second == CP &&
832 "InverseMap corrupt!");
836 typename MapTy::iterator I =
837 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
838 if (I == Map.end() || I->second != CP) {
839 // FIXME: This should not use a linear scan. If this gets to be a
840 // performance problem, someone should look at this.
841 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
848 /// getOrCreate - Return the specified constant from the map, creating it if
850 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
851 MapKey Lookup(Ty, V);
852 typename MapTy::iterator I = Map.lower_bound(Lookup);
854 if (I != Map.end() && I->first == Lookup)
855 return static_cast<ConstantClass *>(I->second);
857 // If no preexisting value, create one now...
858 ConstantClass *Result =
859 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
861 /// FIXME: why does this assert fail when loading 176.gcc?
862 //assert(Result->getType() == Ty && "Type specified is not correct!");
863 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
865 if (HasLargeKey) // Remember the reverse mapping if needed.
866 InverseMap.insert(std::make_pair(Result, I));
868 // If the type of the constant is abstract, make sure that an entry exists
869 // for it in the AbstractTypeMap.
870 if (Ty->isAbstract()) {
871 typename AbstractTypeMapTy::iterator TI =
872 AbstractTypeMap.lower_bound(Ty);
874 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
875 // Add ourselves to the ATU list of the type.
876 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
878 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
884 void remove(ConstantClass *CP) {
885 typename MapTy::iterator I = FindExistingElement(CP);
886 assert(I != Map.end() && "Constant not found in constant table!");
887 assert(I->second == CP && "Didn't find correct element?");
889 if (HasLargeKey) // Remember the reverse mapping if needed.
890 InverseMap.erase(CP);
892 // Now that we found the entry, make sure this isn't the entry that
893 // the AbstractTypeMap points to.
894 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
895 if (Ty->isAbstract()) {
896 assert(AbstractTypeMap.count(Ty) &&
897 "Abstract type not in AbstractTypeMap?");
898 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
899 if (ATMEntryIt == I) {
900 // Yes, we are removing the representative entry for this type.
901 // See if there are any other entries of the same type.
902 typename MapTy::iterator TmpIt = ATMEntryIt;
904 // First check the entry before this one...
905 if (TmpIt != Map.begin()) {
907 if (TmpIt->first.first != Ty) // Not the same type, move back...
911 // If we didn't find the same type, try to move forward...
912 if (TmpIt == ATMEntryIt) {
914 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
915 --TmpIt; // No entry afterwards with the same type
918 // If there is another entry in the map of the same abstract type,
919 // update the AbstractTypeMap entry now.
920 if (TmpIt != ATMEntryIt) {
923 // Otherwise, we are removing the last instance of this type
924 // from the table. Remove from the ATM, and from user list.
925 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
926 AbstractTypeMap.erase(Ty);
935 /// MoveConstantToNewSlot - If we are about to change C to be the element
936 /// specified by I, update our internal data structures to reflect this
938 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
939 // First, remove the old location of the specified constant in the map.
940 typename MapTy::iterator OldI = FindExistingElement(C);
941 assert(OldI != Map.end() && "Constant not found in constant table!");
942 assert(OldI->second == C && "Didn't find correct element?");
944 // If this constant is the representative element for its abstract type,
945 // update the AbstractTypeMap so that the representative element is I.
946 if (C->getType()->isAbstract()) {
947 typename AbstractTypeMapTy::iterator ATI =
948 AbstractTypeMap.find(C->getType());
949 assert(ATI != AbstractTypeMap.end() &&
950 "Abstract type not in AbstractTypeMap?");
951 if (ATI->second == OldI)
955 // Remove the old entry from the map.
958 // Update the inverse map so that we know that this constant is now
959 // located at descriptor I.
961 assert(I->second == C && "Bad inversemap entry!");
966 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
967 typename AbstractTypeMapTy::iterator I =
968 AbstractTypeMap.find(cast<Type>(OldTy));
970 assert(I != AbstractTypeMap.end() &&
971 "Abstract type not in AbstractTypeMap?");
973 // Convert a constant at a time until the last one is gone. The last one
974 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
975 // eliminated eventually.
977 ConvertConstantType<ConstantClass,
979 static_cast<ConstantClass *>(I->second->second),
980 cast<TypeClass>(NewTy));
982 I = AbstractTypeMap.find(cast<Type>(OldTy));
983 } while (I != AbstractTypeMap.end());
986 // If the type became concrete without being refined to any other existing
987 // type, we just remove ourselves from the ATU list.
988 void typeBecameConcrete(const DerivedType *AbsTy) {
989 AbsTy->removeAbstractTypeUser(this);
993 DOUT << "Constant.cpp: ValueMap\n";
1000 //---- ConstantAggregateZero::get() implementation...
1003 // ConstantAggregateZero does not take extra "value" argument...
1004 template<class ValType>
1005 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1006 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1007 return new ConstantAggregateZero(Ty);
1012 struct ConvertConstantType<ConstantAggregateZero, Type> {
1013 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1014 // Make everyone now use a constant of the new type...
1015 Constant *New = ConstantAggregateZero::get(NewTy);
1016 assert(New != OldC && "Didn't replace constant??");
1017 OldC->uncheckedReplaceAllUsesWith(New);
1018 OldC->destroyConstant(); // This constant is now dead, destroy it.
1023 static ManagedStatic<ValueMap<char, Type,
1024 ConstantAggregateZero> > AggZeroConstants;
1026 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1028 Constant *ConstantAggregateZero::get(const Type *Ty) {
1029 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1030 "Cannot create an aggregate zero of non-aggregate type!");
1031 return AggZeroConstants->getOrCreate(Ty, 0);
1034 // destroyConstant - Remove the constant from the constant table...
1036 void ConstantAggregateZero::destroyConstant() {
1037 AggZeroConstants->remove(this);
1038 destroyConstantImpl();
1041 //---- ConstantArray::get() implementation...
1045 struct ConvertConstantType<ConstantArray, ArrayType> {
1046 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1047 // Make everyone now use a constant of the new type...
1048 std::vector<Constant*> C;
1049 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1050 C.push_back(cast<Constant>(OldC->getOperand(i)));
1051 Constant *New = ConstantArray::get(NewTy, C);
1052 assert(New != OldC && "Didn't replace constant??");
1053 OldC->uncheckedReplaceAllUsesWith(New);
1054 OldC->destroyConstant(); // This constant is now dead, destroy it.
1059 static std::vector<Constant*> getValType(ConstantArray *CA) {
1060 std::vector<Constant*> Elements;
1061 Elements.reserve(CA->getNumOperands());
1062 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1063 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1067 typedef ValueMap<std::vector<Constant*>, ArrayType,
1068 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1069 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1071 Constant *ConstantArray::get(const ArrayType *Ty,
1072 const std::vector<Constant*> &V) {
1073 // If this is an all-zero array, return a ConstantAggregateZero object
1076 if (!C->isNullValue())
1077 return ArrayConstants->getOrCreate(Ty, V);
1078 for (unsigned i = 1, e = V.size(); i != e; ++i)
1080 return ArrayConstants->getOrCreate(Ty, V);
1082 return ConstantAggregateZero::get(Ty);
1085 // destroyConstant - Remove the constant from the constant table...
1087 void ConstantArray::destroyConstant() {
1088 ArrayConstants->remove(this);
1089 destroyConstantImpl();
1092 /// ConstantArray::get(const string&) - Return an array that is initialized to
1093 /// contain the specified string. If length is zero then a null terminator is
1094 /// added to the specified string so that it may be used in a natural way.
1095 /// Otherwise, the length parameter specifies how much of the string to use
1096 /// and it won't be null terminated.
1098 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1099 std::vector<Constant*> ElementVals;
1100 for (unsigned i = 0; i < Str.length(); ++i)
1101 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, Str[i]));
1103 // Add a null terminator to the string...
1105 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, 0));
1108 ArrayType *ATy = ArrayType::get(Type::Int8Ty, ElementVals.size());
1109 return ConstantArray::get(ATy, ElementVals);
1112 /// isString - This method returns true if the array is an array of i8, and
1113 /// if the elements of the array are all ConstantInt's.
1114 bool ConstantArray::isString() const {
1115 // Check the element type for i8...
1116 if (getType()->getElementType() != Type::Int8Ty)
1118 // Check the elements to make sure they are all integers, not constant
1120 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1121 if (!isa<ConstantInt>(getOperand(i)))
1126 /// isCString - This method returns true if the array is a string (see
1127 /// isString) and it ends in a null byte \0 and does not contains any other
1128 /// null bytes except its terminator.
1129 bool ConstantArray::isCString() const {
1130 // Check the element type for i8...
1131 if (getType()->getElementType() != Type::Int8Ty)
1133 Constant *Zero = Constant::getNullValue(getOperand(0)->getType());
1134 // Last element must be a null.
1135 if (getOperand(getNumOperands()-1) != Zero)
1137 // Other elements must be non-null integers.
1138 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1139 if (!isa<ConstantInt>(getOperand(i)))
1141 if (getOperand(i) == Zero)
1148 // getAsString - If the sub-element type of this array is i8
1149 // then this method converts the array to an std::string and returns it.
1150 // Otherwise, it asserts out.
1152 std::string ConstantArray::getAsString() const {
1153 assert(isString() && "Not a string!");
1155 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1156 Result += (char)cast<ConstantInt>(getOperand(i))->getZExtValue();
1161 //---- ConstantStruct::get() implementation...
1166 struct ConvertConstantType<ConstantStruct, StructType> {
1167 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1168 // Make everyone now use a constant of the new type...
1169 std::vector<Constant*> C;
1170 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1171 C.push_back(cast<Constant>(OldC->getOperand(i)));
1172 Constant *New = ConstantStruct::get(NewTy, C);
1173 assert(New != OldC && "Didn't replace constant??");
1175 OldC->uncheckedReplaceAllUsesWith(New);
1176 OldC->destroyConstant(); // This constant is now dead, destroy it.
1181 typedef ValueMap<std::vector<Constant*>, StructType,
1182 ConstantStruct, true /*largekey*/> StructConstantsTy;
1183 static ManagedStatic<StructConstantsTy> StructConstants;
1185 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1186 std::vector<Constant*> Elements;
1187 Elements.reserve(CS->getNumOperands());
1188 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1189 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1193 Constant *ConstantStruct::get(const StructType *Ty,
1194 const std::vector<Constant*> &V) {
1195 // Create a ConstantAggregateZero value if all elements are zeros...
1196 for (unsigned i = 0, e = V.size(); i != e; ++i)
1197 if (!V[i]->isNullValue())
1198 return StructConstants->getOrCreate(Ty, V);
1200 return ConstantAggregateZero::get(Ty);
1203 Constant *ConstantStruct::get(const std::vector<Constant*> &V, bool packed) {
1204 std::vector<const Type*> StructEls;
1205 StructEls.reserve(V.size());
1206 for (unsigned i = 0, e = V.size(); i != e; ++i)
1207 StructEls.push_back(V[i]->getType());
1208 return get(StructType::get(StructEls, packed), V);
1211 // destroyConstant - Remove the constant from the constant table...
1213 void ConstantStruct::destroyConstant() {
1214 StructConstants->remove(this);
1215 destroyConstantImpl();
1218 //---- ConstantVector::get() implementation...
1222 struct ConvertConstantType<ConstantVector, VectorType> {
1223 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1224 // Make everyone now use a constant of the new type...
1225 std::vector<Constant*> C;
1226 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1227 C.push_back(cast<Constant>(OldC->getOperand(i)));
1228 Constant *New = ConstantVector::get(NewTy, C);
1229 assert(New != OldC && "Didn't replace constant??");
1230 OldC->uncheckedReplaceAllUsesWith(New);
1231 OldC->destroyConstant(); // This constant is now dead, destroy it.
1236 static std::vector<Constant*> getValType(ConstantVector *CP) {
1237 std::vector<Constant*> Elements;
1238 Elements.reserve(CP->getNumOperands());
1239 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1240 Elements.push_back(CP->getOperand(i));
1244 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1245 ConstantVector> > VectorConstants;
1247 Constant *ConstantVector::get(const VectorType *Ty,
1248 const std::vector<Constant*> &V) {
1249 // If this is an all-zero vector, return a ConstantAggregateZero object
1252 if (!C->isNullValue())
1253 return VectorConstants->getOrCreate(Ty, V);
1254 for (unsigned i = 1, e = V.size(); i != e; ++i)
1256 return VectorConstants->getOrCreate(Ty, V);
1258 return ConstantAggregateZero::get(Ty);
1261 Constant *ConstantVector::get(const std::vector<Constant*> &V) {
1262 assert(!V.empty() && "Cannot infer type if V is empty");
1263 return get(VectorType::get(V.front()->getType(),V.size()), V);
1266 // destroyConstant - Remove the constant from the constant table...
1268 void ConstantVector::destroyConstant() {
1269 VectorConstants->remove(this);
1270 destroyConstantImpl();
1273 /// This function will return true iff every element in this vector constant
1274 /// is set to all ones.
1275 /// @returns true iff this constant's emements are all set to all ones.
1276 /// @brief Determine if the value is all ones.
1277 bool ConstantVector::isAllOnesValue() const {
1278 // Check out first element.
1279 const Constant *Elt = getOperand(0);
1280 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1281 if (!CI || !CI->isAllOnesValue()) return false;
1282 // Then make sure all remaining elements point to the same value.
1283 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1284 if (getOperand(I) != Elt) return false;
1289 /// getSplatValue - If this is a splat constant, where all of the
1290 /// elements have the same value, return that value. Otherwise return null.
1291 Constant *ConstantVector::getSplatValue() {
1292 // Check out first element.
1293 Constant *Elt = getOperand(0);
1294 // Then make sure all remaining elements point to the same value.
1295 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1296 if (getOperand(I) != Elt) return 0;
1300 //---- ConstantPointerNull::get() implementation...
1304 // ConstantPointerNull does not take extra "value" argument...
1305 template<class ValType>
1306 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1307 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1308 return new ConstantPointerNull(Ty);
1313 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1314 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1315 // Make everyone now use a constant of the new type...
1316 Constant *New = ConstantPointerNull::get(NewTy);
1317 assert(New != OldC && "Didn't replace constant??");
1318 OldC->uncheckedReplaceAllUsesWith(New);
1319 OldC->destroyConstant(); // This constant is now dead, destroy it.
1324 static ManagedStatic<ValueMap<char, PointerType,
1325 ConstantPointerNull> > NullPtrConstants;
1327 static char getValType(ConstantPointerNull *) {
1332 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1333 return NullPtrConstants->getOrCreate(Ty, 0);
1336 // destroyConstant - Remove the constant from the constant table...
1338 void ConstantPointerNull::destroyConstant() {
1339 NullPtrConstants->remove(this);
1340 destroyConstantImpl();
1344 //---- UndefValue::get() implementation...
1348 // UndefValue does not take extra "value" argument...
1349 template<class ValType>
1350 struct ConstantCreator<UndefValue, Type, ValType> {
1351 static UndefValue *create(const Type *Ty, const ValType &V) {
1352 return new UndefValue(Ty);
1357 struct ConvertConstantType<UndefValue, Type> {
1358 static void convert(UndefValue *OldC, const Type *NewTy) {
1359 // Make everyone now use a constant of the new type.
1360 Constant *New = UndefValue::get(NewTy);
1361 assert(New != OldC && "Didn't replace constant??");
1362 OldC->uncheckedReplaceAllUsesWith(New);
1363 OldC->destroyConstant(); // This constant is now dead, destroy it.
1368 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1370 static char getValType(UndefValue *) {
1375 UndefValue *UndefValue::get(const Type *Ty) {
1376 return UndefValueConstants->getOrCreate(Ty, 0);
1379 // destroyConstant - Remove the constant from the constant table.
1381 void UndefValue::destroyConstant() {
1382 UndefValueConstants->remove(this);
1383 destroyConstantImpl();
1387 //---- ConstantExpr::get() implementations...
1390 struct ExprMapKeyType {
1391 explicit ExprMapKeyType(unsigned opc, std::vector<Constant*> ops,
1392 unsigned short pred = 0) : opcode(opc), predicate(pred), operands(ops) { }
1395 std::vector<Constant*> operands;
1396 bool operator==(const ExprMapKeyType& that) const {
1397 return this->opcode == that.opcode &&
1398 this->predicate == that.predicate &&
1399 this->operands == that.operands;
1401 bool operator<(const ExprMapKeyType & that) const {
1402 return this->opcode < that.opcode ||
1403 (this->opcode == that.opcode && this->predicate < that.predicate) ||
1404 (this->opcode == that.opcode && this->predicate == that.predicate &&
1405 this->operands < that.operands);
1408 bool operator!=(const ExprMapKeyType& that) const {
1409 return !(*this == that);
1415 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1416 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
1417 unsigned short pred = 0) {
1418 if (Instruction::isCast(V.opcode))
1419 return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
1420 if ((V.opcode >= Instruction::BinaryOpsBegin &&
1421 V.opcode < Instruction::BinaryOpsEnd))
1422 return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
1423 if (V.opcode == Instruction::Select)
1424 return new SelectConstantExpr(V.operands[0], V.operands[1],
1426 if (V.opcode == Instruction::ExtractElement)
1427 return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
1428 if (V.opcode == Instruction::InsertElement)
1429 return new InsertElementConstantExpr(V.operands[0], V.operands[1],
1431 if (V.opcode == Instruction::ShuffleVector)
1432 return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
1434 if (V.opcode == Instruction::GetElementPtr) {
1435 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1436 return new GetElementPtrConstantExpr(V.operands[0], IdxList, Ty);
1439 // The compare instructions are weird. We have to encode the predicate
1440 // value and it is combined with the instruction opcode by multiplying
1441 // the opcode by one hundred. We must decode this to get the predicate.
1442 if (V.opcode == Instruction::ICmp)
1443 return new CompareConstantExpr(Instruction::ICmp, V.predicate,
1444 V.operands[0], V.operands[1]);
1445 if (V.opcode == Instruction::FCmp)
1446 return new CompareConstantExpr(Instruction::FCmp, V.predicate,
1447 V.operands[0], V.operands[1]);
1448 assert(0 && "Invalid ConstantExpr!");
1454 struct ConvertConstantType<ConstantExpr, Type> {
1455 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1457 switch (OldC->getOpcode()) {
1458 case Instruction::Trunc:
1459 case Instruction::ZExt:
1460 case Instruction::SExt:
1461 case Instruction::FPTrunc:
1462 case Instruction::FPExt:
1463 case Instruction::UIToFP:
1464 case Instruction::SIToFP:
1465 case Instruction::FPToUI:
1466 case Instruction::FPToSI:
1467 case Instruction::PtrToInt:
1468 case Instruction::IntToPtr:
1469 case Instruction::BitCast:
1470 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1473 case Instruction::Select:
1474 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1475 OldC->getOperand(1),
1476 OldC->getOperand(2));
1479 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1480 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1481 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1482 OldC->getOperand(1));
1484 case Instruction::GetElementPtr:
1485 // Make everyone now use a constant of the new type...
1486 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1487 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1488 &Idx[0], Idx.size());
1492 assert(New != OldC && "Didn't replace constant??");
1493 OldC->uncheckedReplaceAllUsesWith(New);
1494 OldC->destroyConstant(); // This constant is now dead, destroy it.
1497 } // end namespace llvm
1500 static ExprMapKeyType getValType(ConstantExpr *CE) {
1501 std::vector<Constant*> Operands;
1502 Operands.reserve(CE->getNumOperands());
1503 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1504 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1505 return ExprMapKeyType(CE->getOpcode(), Operands,
1506 CE->isCompare() ? CE->getPredicate() : 0);
1509 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1510 ConstantExpr> > ExprConstants;
1512 /// This is a utility function to handle folding of casts and lookup of the
1513 /// cast in the ExprConstants map. It is usedby the various get* methods below.
1514 static inline Constant *getFoldedCast(
1515 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1516 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1517 // Fold a few common cases
1518 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1521 // Look up the constant in the table first to ensure uniqueness
1522 std::vector<Constant*> argVec(1, C);
1523 ExprMapKeyType Key(opc, argVec);
1524 return ExprConstants->getOrCreate(Ty, Key);
1527 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1528 Instruction::CastOps opc = Instruction::CastOps(oc);
1529 assert(Instruction::isCast(opc) && "opcode out of range");
1530 assert(C && Ty && "Null arguments to getCast");
1531 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1535 assert(0 && "Invalid cast opcode");
1537 case Instruction::Trunc: return getTrunc(C, Ty);
1538 case Instruction::ZExt: return getZExt(C, Ty);
1539 case Instruction::SExt: return getSExt(C, Ty);
1540 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1541 case Instruction::FPExt: return getFPExtend(C, Ty);
1542 case Instruction::UIToFP: return getUIToFP(C, Ty);
1543 case Instruction::SIToFP: return getSIToFP(C, Ty);
1544 case Instruction::FPToUI: return getFPToUI(C, Ty);
1545 case Instruction::FPToSI: return getFPToSI(C, Ty);
1546 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1547 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1548 case Instruction::BitCast: return getBitCast(C, Ty);
1553 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1554 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1555 return getCast(Instruction::BitCast, C, Ty);
1556 return getCast(Instruction::ZExt, C, Ty);
1559 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1560 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1561 return getCast(Instruction::BitCast, C, Ty);
1562 return getCast(Instruction::SExt, C, Ty);
1565 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1566 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1567 return getCast(Instruction::BitCast, C, Ty);
1568 return getCast(Instruction::Trunc, C, Ty);
1571 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1572 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1573 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1575 if (Ty->isInteger())
1576 return getCast(Instruction::PtrToInt, S, Ty);
1577 return getCast(Instruction::BitCast, S, Ty);
1580 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1582 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1583 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1584 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1585 Instruction::CastOps opcode =
1586 (SrcBits == DstBits ? Instruction::BitCast :
1587 (SrcBits > DstBits ? Instruction::Trunc :
1588 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1589 return getCast(opcode, C, Ty);
1592 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1593 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1595 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1596 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1597 if (SrcBits == DstBits)
1598 return C; // Avoid a useless cast
1599 Instruction::CastOps opcode =
1600 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1601 return getCast(opcode, C, Ty);
1604 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1605 assert(C->getType()->isInteger() && "Trunc operand must be integer");
1606 assert(Ty->isInteger() && "Trunc produces only integral");
1607 assert(C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1608 "SrcTy must be larger than DestTy for Trunc!");
1610 return getFoldedCast(Instruction::Trunc, C, Ty);
1613 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1614 assert(C->getType()->isInteger() && "SEXt operand must be integral");
1615 assert(Ty->isInteger() && "SExt produces only integer");
1616 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1617 "SrcTy must be smaller than DestTy for SExt!");
1619 return getFoldedCast(Instruction::SExt, C, Ty);
1622 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1623 assert(C->getType()->isInteger() && "ZEXt operand must be integral");
1624 assert(Ty->isInteger() && "ZExt produces only integer");
1625 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1626 "SrcTy must be smaller than DestTy for ZExt!");
1628 return getFoldedCast(Instruction::ZExt, C, Ty);
1631 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1632 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1633 C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1634 "This is an illegal floating point truncation!");
1635 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1638 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1639 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1640 C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1641 "This is an illegal floating point extension!");
1642 return getFoldedCast(Instruction::FPExt, C, Ty);
1645 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1646 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1647 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1648 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1649 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1650 "This is an illegal uint to floating point cast!");
1651 return getFoldedCast(Instruction::UIToFP, C, Ty);
1654 Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
1655 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1656 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1657 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1658 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1659 "This is an illegal sint to floating point cast!");
1660 return getFoldedCast(Instruction::SIToFP, C, Ty);
1663 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1664 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1665 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1666 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1667 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1668 "This is an illegal floating point to uint cast!");
1669 return getFoldedCast(Instruction::FPToUI, C, Ty);
1672 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1673 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1674 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1675 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1676 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1677 "This is an illegal floating point to sint cast!");
1678 return getFoldedCast(Instruction::FPToSI, C, Ty);
1681 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1682 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1683 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1684 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1687 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
1688 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
1689 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
1690 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1693 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
1694 // BitCast implies a no-op cast of type only. No bits change. However, you
1695 // can't cast pointers to anything but pointers.
1696 const Type *SrcTy = C->getType();
1697 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
1698 "BitCast cannot cast pointer to non-pointer and vice versa");
1700 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
1701 // or nonptr->ptr). For all the other types, the cast is okay if source and
1702 // destination bit widths are identical.
1703 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1704 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1705 assert(SrcBitSize == DstBitSize && "BitCast requies types of same width");
1706 return getFoldedCast(Instruction::BitCast, C, DstTy);
1709 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1710 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1711 Constant *GEPIdx = ConstantInt::get(Type::Int32Ty, 1);
1713 getGetElementPtr(getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
1714 return getCast(Instruction::PtrToInt, GEP, Type::Int64Ty);
1717 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1718 Constant *C1, Constant *C2) {
1719 // Check the operands for consistency first
1720 assert(Opcode >= Instruction::BinaryOpsBegin &&
1721 Opcode < Instruction::BinaryOpsEnd &&
1722 "Invalid opcode in binary constant expression");
1723 assert(C1->getType() == C2->getType() &&
1724 "Operand types in binary constant expression should match");
1726 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
1727 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1728 return FC; // Fold a few common cases...
1730 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1731 ExprMapKeyType Key(Opcode, argVec);
1732 return ExprConstants->getOrCreate(ReqTy, Key);
1735 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
1736 Constant *C1, Constant *C2) {
1737 switch (predicate) {
1738 default: assert(0 && "Invalid CmpInst predicate");
1739 case FCmpInst::FCMP_FALSE: case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_OGT:
1740 case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OLE:
1741 case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_ORD: case FCmpInst::FCMP_UNO:
1742 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UGT: case FCmpInst::FCMP_UGE:
1743 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_ULE: case FCmpInst::FCMP_UNE:
1744 case FCmpInst::FCMP_TRUE:
1745 return getFCmp(predicate, C1, C2);
1746 case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGT:
1747 case ICmpInst::ICMP_UGE: case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE:
1748 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_SGE: case ICmpInst::ICMP_SLT:
1749 case ICmpInst::ICMP_SLE:
1750 return getICmp(predicate, C1, C2);
1754 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
1757 case Instruction::Add:
1758 case Instruction::Sub:
1759 case Instruction::Mul:
1760 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1761 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
1762 isa<VectorType>(C1->getType())) &&
1763 "Tried to create an arithmetic operation on a non-arithmetic type!");
1765 case Instruction::UDiv:
1766 case Instruction::SDiv:
1767 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1768 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
1769 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
1770 "Tried to create an arithmetic operation on a non-arithmetic type!");
1772 case Instruction::FDiv:
1773 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1774 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
1775 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
1776 && "Tried to create an arithmetic operation on a non-arithmetic type!");
1778 case Instruction::URem:
1779 case Instruction::SRem:
1780 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1781 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
1782 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
1783 "Tried to create an arithmetic operation on a non-arithmetic type!");
1785 case Instruction::FRem:
1786 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1787 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
1788 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
1789 && "Tried to create an arithmetic operation on a non-arithmetic type!");
1791 case Instruction::And:
1792 case Instruction::Or:
1793 case Instruction::Xor:
1794 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1795 assert((C1->getType()->isInteger() || isa<VectorType>(C1->getType())) &&
1796 "Tried to create a logical operation on a non-integral type!");
1798 case Instruction::Shl:
1799 case Instruction::LShr:
1800 case Instruction::AShr:
1801 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1802 assert(C1->getType()->isInteger() &&
1803 "Tried to create a shift operation on a non-integer type!");
1810 return getTy(C1->getType(), Opcode, C1, C2);
1813 Constant *ConstantExpr::getCompare(unsigned short pred,
1814 Constant *C1, Constant *C2) {
1815 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1816 return getCompareTy(pred, C1, C2);
1819 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
1820 Constant *V1, Constant *V2) {
1821 assert(C->getType() == Type::Int1Ty && "Select condition must be i1!");
1822 assert(V1->getType() == V2->getType() && "Select value types must match!");
1823 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
1825 if (ReqTy == V1->getType())
1826 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1827 return SC; // Fold common cases
1829 std::vector<Constant*> argVec(3, C);
1832 ExprMapKeyType Key(Instruction::Select, argVec);
1833 return ExprConstants->getOrCreate(ReqTy, Key);
1836 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
1839 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx, true) &&
1840 "GEP indices invalid!");
1842 if (Constant *FC = ConstantFoldGetElementPtr(C, (Constant**)Idxs, NumIdx))
1843 return FC; // Fold a few common cases...
1845 assert(isa<PointerType>(C->getType()) &&
1846 "Non-pointer type for constant GetElementPtr expression");
1847 // Look up the constant in the table first to ensure uniqueness
1848 std::vector<Constant*> ArgVec;
1849 ArgVec.reserve(NumIdx+1);
1850 ArgVec.push_back(C);
1851 for (unsigned i = 0; i != NumIdx; ++i)
1852 ArgVec.push_back(cast<Constant>(Idxs[i]));
1853 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
1854 return ExprConstants->getOrCreate(ReqTy, Key);
1857 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
1859 // Get the result type of the getelementptr!
1861 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx, true);
1862 assert(Ty && "GEP indices invalid!");
1863 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
1864 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
1867 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
1869 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
1874 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
1875 assert(LHS->getType() == RHS->getType());
1876 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
1877 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
1879 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
1880 return FC; // Fold a few common cases...
1882 // Look up the constant in the table first to ensure uniqueness
1883 std::vector<Constant*> ArgVec;
1884 ArgVec.push_back(LHS);
1885 ArgVec.push_back(RHS);
1886 // Get the key type with both the opcode and predicate
1887 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
1888 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
1892 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
1893 assert(LHS->getType() == RHS->getType());
1894 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
1896 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
1897 return FC; // Fold a few common cases...
1899 // Look up the constant in the table first to ensure uniqueness
1900 std::vector<Constant*> ArgVec;
1901 ArgVec.push_back(LHS);
1902 ArgVec.push_back(RHS);
1903 // Get the key type with both the opcode and predicate
1904 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
1905 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
1908 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
1910 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
1911 return FC; // Fold a few common cases...
1912 // Look up the constant in the table first to ensure uniqueness
1913 std::vector<Constant*> ArgVec(1, Val);
1914 ArgVec.push_back(Idx);
1915 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
1916 return ExprConstants->getOrCreate(ReqTy, Key);
1919 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
1920 assert(isa<VectorType>(Val->getType()) &&
1921 "Tried to create extractelement operation on non-vector type!");
1922 assert(Idx->getType() == Type::Int32Ty &&
1923 "Extractelement index must be i32 type!");
1924 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
1928 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
1929 Constant *Elt, Constant *Idx) {
1930 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
1931 return FC; // Fold a few common cases...
1932 // Look up the constant in the table first to ensure uniqueness
1933 std::vector<Constant*> ArgVec(1, Val);
1934 ArgVec.push_back(Elt);
1935 ArgVec.push_back(Idx);
1936 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
1937 return ExprConstants->getOrCreate(ReqTy, Key);
1940 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
1942 assert(isa<VectorType>(Val->getType()) &&
1943 "Tried to create insertelement operation on non-vector type!");
1944 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
1945 && "Insertelement types must match!");
1946 assert(Idx->getType() == Type::Int32Ty &&
1947 "Insertelement index must be i32 type!");
1948 return getInsertElementTy(cast<VectorType>(Val->getType())->getElementType(),
1952 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
1953 Constant *V2, Constant *Mask) {
1954 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
1955 return FC; // Fold a few common cases...
1956 // Look up the constant in the table first to ensure uniqueness
1957 std::vector<Constant*> ArgVec(1, V1);
1958 ArgVec.push_back(V2);
1959 ArgVec.push_back(Mask);
1960 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
1961 return ExprConstants->getOrCreate(ReqTy, Key);
1964 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
1966 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
1967 "Invalid shuffle vector constant expr operands!");
1968 return getShuffleVectorTy(V1->getType(), V1, V2, Mask);
1971 Constant *ConstantExpr::getZeroValueForNegationExpr(const Type *Ty) {
1972 if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
1973 if (PTy->getElementType()->isFloatingPoint()) {
1974 std::vector<Constant*> zeros(PTy->getNumElements(),
1975 ConstantFP::getNegativeZero(PTy->getElementType()));
1976 return ConstantVector::get(PTy, zeros);
1979 if (Ty->isFloatingPoint())
1980 return ConstantFP::getNegativeZero(Ty);
1982 return Constant::getNullValue(Ty);
1985 // destroyConstant - Remove the constant from the constant table...
1987 void ConstantExpr::destroyConstant() {
1988 ExprConstants->remove(this);
1989 destroyConstantImpl();
1992 const char *ConstantExpr::getOpcodeName() const {
1993 return Instruction::getOpcodeName(getOpcode());
1996 //===----------------------------------------------------------------------===//
1997 // replaceUsesOfWithOnConstant implementations
1999 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2000 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2003 /// Note that we intentionally replace all uses of From with To here. Consider
2004 /// a large array that uses 'From' 1000 times. By handling this case all here,
2005 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2006 /// single invocation handles all 1000 uses. Handling them one at a time would
2007 /// work, but would be really slow because it would have to unique each updated
2009 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2011 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2012 Constant *ToC = cast<Constant>(To);
2014 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2015 Lookup.first.first = getType();
2016 Lookup.second = this;
2018 std::vector<Constant*> &Values = Lookup.first.second;
2019 Values.reserve(getNumOperands()); // Build replacement array.
2021 // Fill values with the modified operands of the constant array. Also,
2022 // compute whether this turns into an all-zeros array.
2023 bool isAllZeros = false;
2024 unsigned NumUpdated = 0;
2025 if (!ToC->isNullValue()) {
2026 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2027 Constant *Val = cast<Constant>(O->get());
2032 Values.push_back(Val);
2036 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2037 Constant *Val = cast<Constant>(O->get());
2042 Values.push_back(Val);
2043 if (isAllZeros) isAllZeros = Val->isNullValue();
2047 Constant *Replacement = 0;
2049 Replacement = ConstantAggregateZero::get(getType());
2051 // Check to see if we have this array type already.
2053 ArrayConstantsTy::MapTy::iterator I =
2054 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2057 Replacement = I->second;
2059 // Okay, the new shape doesn't exist in the system yet. Instead of
2060 // creating a new constant array, inserting it, replaceallusesof'ing the
2061 // old with the new, then deleting the old... just update the current one
2063 ArrayConstants->MoveConstantToNewSlot(this, I);
2065 // Update to the new value. Optimize for the case when we have a single
2066 // operand that we're changing, but handle bulk updates efficiently.
2067 if (NumUpdated == 1) {
2068 unsigned OperandToUpdate = U-OperandList;
2069 assert(getOperand(OperandToUpdate) == From &&
2070 "ReplaceAllUsesWith broken!");
2071 setOperand(OperandToUpdate, ToC);
2073 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2074 if (getOperand(i) == From)
2081 // Otherwise, I do need to replace this with an existing value.
2082 assert(Replacement != this && "I didn't contain From!");
2084 // Everyone using this now uses the replacement.
2085 uncheckedReplaceAllUsesWith(Replacement);
2087 // Delete the old constant!
2091 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2093 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2094 Constant *ToC = cast<Constant>(To);
2096 unsigned OperandToUpdate = U-OperandList;
2097 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2099 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2100 Lookup.first.first = getType();
2101 Lookup.second = this;
2102 std::vector<Constant*> &Values = Lookup.first.second;
2103 Values.reserve(getNumOperands()); // Build replacement struct.
2106 // Fill values with the modified operands of the constant struct. Also,
2107 // compute whether this turns into an all-zeros struct.
2108 bool isAllZeros = false;
2109 if (!ToC->isNullValue()) {
2110 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2111 Values.push_back(cast<Constant>(O->get()));
2114 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2115 Constant *Val = cast<Constant>(O->get());
2116 Values.push_back(Val);
2117 if (isAllZeros) isAllZeros = Val->isNullValue();
2120 Values[OperandToUpdate] = ToC;
2122 Constant *Replacement = 0;
2124 Replacement = ConstantAggregateZero::get(getType());
2126 // Check to see if we have this array type already.
2128 StructConstantsTy::MapTy::iterator I =
2129 StructConstants->InsertOrGetItem(Lookup, Exists);
2132 Replacement = I->second;
2134 // Okay, the new shape doesn't exist in the system yet. Instead of
2135 // creating a new constant struct, inserting it, replaceallusesof'ing the
2136 // old with the new, then deleting the old... just update the current one
2138 StructConstants->MoveConstantToNewSlot(this, I);
2140 // Update to the new value.
2141 setOperand(OperandToUpdate, ToC);
2146 assert(Replacement != this && "I didn't contain From!");
2148 // Everyone using this now uses the replacement.
2149 uncheckedReplaceAllUsesWith(Replacement);
2151 // Delete the old constant!
2155 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2157 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2159 std::vector<Constant*> Values;
2160 Values.reserve(getNumOperands()); // Build replacement array...
2161 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2162 Constant *Val = getOperand(i);
2163 if (Val == From) Val = cast<Constant>(To);
2164 Values.push_back(Val);
2167 Constant *Replacement = ConstantVector::get(getType(), Values);
2168 assert(Replacement != this && "I didn't contain From!");
2170 // Everyone using this now uses the replacement.
2171 uncheckedReplaceAllUsesWith(Replacement);
2173 // Delete the old constant!
2177 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2179 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2180 Constant *To = cast<Constant>(ToV);
2182 Constant *Replacement = 0;
2183 if (getOpcode() == Instruction::GetElementPtr) {
2184 SmallVector<Constant*, 8> Indices;
2185 Constant *Pointer = getOperand(0);
2186 Indices.reserve(getNumOperands()-1);
2187 if (Pointer == From) Pointer = To;
2189 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2190 Constant *Val = getOperand(i);
2191 if (Val == From) Val = To;
2192 Indices.push_back(Val);
2194 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2195 &Indices[0], Indices.size());
2196 } else if (isCast()) {
2197 assert(getOperand(0) == From && "Cast only has one use!");
2198 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2199 } else if (getOpcode() == Instruction::Select) {
2200 Constant *C1 = getOperand(0);
2201 Constant *C2 = getOperand(1);
2202 Constant *C3 = getOperand(2);
2203 if (C1 == From) C1 = To;
2204 if (C2 == From) C2 = To;
2205 if (C3 == From) C3 = To;
2206 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2207 } else if (getOpcode() == Instruction::ExtractElement) {
2208 Constant *C1 = getOperand(0);
2209 Constant *C2 = getOperand(1);
2210 if (C1 == From) C1 = To;
2211 if (C2 == From) C2 = To;
2212 Replacement = ConstantExpr::getExtractElement(C1, C2);
2213 } else if (getOpcode() == Instruction::InsertElement) {
2214 Constant *C1 = getOperand(0);
2215 Constant *C2 = getOperand(1);
2216 Constant *C3 = getOperand(1);
2217 if (C1 == From) C1 = To;
2218 if (C2 == From) C2 = To;
2219 if (C3 == From) C3 = To;
2220 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2221 } else if (getOpcode() == Instruction::ShuffleVector) {
2222 Constant *C1 = getOperand(0);
2223 Constant *C2 = getOperand(1);
2224 Constant *C3 = getOperand(2);
2225 if (C1 == From) C1 = To;
2226 if (C2 == From) C2 = To;
2227 if (C3 == From) C3 = To;
2228 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2229 } else if (isCompare()) {
2230 Constant *C1 = getOperand(0);
2231 Constant *C2 = getOperand(1);
2232 if (C1 == From) C1 = To;
2233 if (C2 == From) C2 = To;
2234 if (getOpcode() == Instruction::ICmp)
2235 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2237 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2238 } else if (getNumOperands() == 2) {
2239 Constant *C1 = getOperand(0);
2240 Constant *C2 = getOperand(1);
2241 if (C1 == From) C1 = To;
2242 if (C2 == From) C2 = To;
2243 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2245 assert(0 && "Unknown ConstantExpr type!");
2249 assert(Replacement != this && "I didn't contain From!");
2251 // Everyone using this now uses the replacement.
2252 uncheckedReplaceAllUsesWith(Replacement);
2254 // Delete the old constant!
2259 /// getStringValue - Turn an LLVM constant pointer that eventually points to a
2260 /// global into a string value. Return an empty string if we can't do it.
2261 /// Parameter Chop determines if the result is chopped at the first null
2264 std::string Constant::getStringValue(bool Chop, unsigned Offset) {
2265 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(this)) {
2266 if (GV->hasInitializer() && isa<ConstantArray>(GV->getInitializer())) {
2267 ConstantArray *Init = cast<ConstantArray>(GV->getInitializer());
2268 if (Init->isString()) {
2269 std::string Result = Init->getAsString();
2270 if (Offset < Result.size()) {
2271 // If we are pointing INTO The string, erase the beginning...
2272 Result.erase(Result.begin(), Result.begin()+Offset);
2274 // Take off the null terminator, and any string fragments after it.
2276 std::string::size_type NullPos = Result.find_first_of((char)0);
2277 if (NullPos != std::string::npos)
2278 Result.erase(Result.begin()+NullPos, Result.end());
2284 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(this)) {
2285 if (CE->getOpcode() == Instruction::GetElementPtr) {
2286 // Turn a gep into the specified offset.
2287 if (CE->getNumOperands() == 3 &&
2288 cast<Constant>(CE->getOperand(1))->isNullValue() &&
2289 isa<ConstantInt>(CE->getOperand(2))) {
2290 Offset += cast<ConstantInt>(CE->getOperand(2))->getZExtValue();
2291 return CE->getOperand(0)->getStringValue(Chop, Offset);