1 //===- ConstantFold.cpp - LLVM constant folder ----------------------------===//
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 folding of constants for LLVM. This implements the
11 // (internal) ConstantFold.h interface, which is used by the
12 // ConstantExpr::get* methods to automatically fold constants when possible.
14 // The current constant folding implementation is implemented in two pieces: the
15 // template-based folder for simple primitive constants like ConstantInt, and
16 // the special case hackery that we use to symbolically evaluate expressions
17 // that use ConstantExprs.
19 //===----------------------------------------------------------------------===//
21 #include "ConstantFold.h"
22 #include "llvm/Constants.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Function.h"
26 #include "llvm/GlobalAlias.h"
27 #include "llvm/ADT/SmallVector.h"
28 #include "llvm/Support/Compiler.h"
29 #include "llvm/Support/GetElementPtrTypeIterator.h"
30 #include "llvm/Support/ManagedStatic.h"
31 #include "llvm/Support/MathExtras.h"
35 //===----------------------------------------------------------------------===//
36 // ConstantFold*Instruction Implementations
37 //===----------------------------------------------------------------------===//
39 /// CastConstantVector - Convert the specified ConstantVector node to the
40 /// specified vector type. At this point, we know that the elements of the
41 /// input vector constant are all simple integer or FP values.
42 static Constant *CastConstantVector(ConstantVector *CV,
43 const VectorType *DstTy) {
44 unsigned SrcNumElts = CV->getType()->getNumElements();
45 unsigned DstNumElts = DstTy->getNumElements();
46 const Type *SrcEltTy = CV->getType()->getElementType();
47 const Type *DstEltTy = DstTy->getElementType();
49 // If both vectors have the same number of elements (thus, the elements
50 // are the same size), perform the conversion now.
51 if (SrcNumElts == DstNumElts) {
52 std::vector<Constant*> Result;
54 // If the src and dest elements are both integers, or both floats, we can
55 // just BitCast each element because the elements are the same size.
56 if ((SrcEltTy->isInteger() && DstEltTy->isInteger()) ||
57 (SrcEltTy->isFloatingPoint() && DstEltTy->isFloatingPoint())) {
58 for (unsigned i = 0; i != SrcNumElts; ++i)
60 ConstantExpr::getBitCast(CV->getOperand(i), DstEltTy));
61 return ConstantVector::get(Result);
64 // If this is an int-to-fp cast ..
65 if (SrcEltTy->isInteger()) {
66 // Ensure that it is int-to-fp cast
67 assert(DstEltTy->isFloatingPoint());
68 if (DstEltTy->getTypeID() == Type::DoubleTyID) {
69 for (unsigned i = 0; i != SrcNumElts; ++i) {
70 ConstantInt *CI = cast<ConstantInt>(CV->getOperand(i));
71 double V = CI->getValue().bitsToDouble();
72 Result.push_back(ConstantFP::get(Type::DoubleTy, APFloat(V)));
74 return ConstantVector::get(Result);
76 assert(DstEltTy == Type::FloatTy && "Unknown fp type!");
77 for (unsigned i = 0; i != SrcNumElts; ++i) {
78 ConstantInt *CI = cast<ConstantInt>(CV->getOperand(i));
79 float V = CI->getValue().bitsToFloat();
80 Result.push_back(ConstantFP::get(Type::FloatTy, APFloat(V)));
82 return ConstantVector::get(Result);
85 // Otherwise, this is an fp-to-int cast.
86 assert(SrcEltTy->isFloatingPoint() && DstEltTy->isInteger());
88 if (SrcEltTy->getTypeID() == Type::DoubleTyID) {
89 for (unsigned i = 0; i != SrcNumElts; ++i) {
90 uint64_t V = cast<ConstantFP>(CV->getOperand(i))->
91 getValueAPF().convertToAPInt().getZExtValue();
92 Constant *C = ConstantInt::get(Type::Int64Ty, V);
93 Result.push_back(ConstantExpr::getBitCast(C, DstEltTy ));
95 return ConstantVector::get(Result);
98 assert(SrcEltTy->getTypeID() == Type::FloatTyID);
99 for (unsigned i = 0; i != SrcNumElts; ++i) {
100 uint32_t V = (uint32_t)cast<ConstantFP>(CV->getOperand(i))->
101 getValueAPF().convertToAPInt().getZExtValue();
102 Constant *C = ConstantInt::get(Type::Int32Ty, V);
103 Result.push_back(ConstantExpr::getBitCast(C, DstEltTy));
105 return ConstantVector::get(Result);
108 // Otherwise, this is a cast that changes element count and size. Handle
109 // casts which shrink the elements here.
111 // FIXME: We need to know endianness to do this!
116 /// This function determines which opcode to use to fold two constant cast
117 /// expressions together. It uses CastInst::isEliminableCastPair to determine
118 /// the opcode. Consequently its just a wrapper around that function.
119 /// @brief Determine if it is valid to fold a cast of a cast
121 foldConstantCastPair(
122 unsigned opc, ///< opcode of the second cast constant expression
123 const ConstantExpr*Op, ///< the first cast constant expression
124 const Type *DstTy ///< desintation type of the first cast
126 assert(Op && Op->isCast() && "Can't fold cast of cast without a cast!");
127 assert(DstTy && DstTy->isFirstClassType() && "Invalid cast destination type");
128 assert(CastInst::isCast(opc) && "Invalid cast opcode");
130 // The the types and opcodes for the two Cast constant expressions
131 const Type *SrcTy = Op->getOperand(0)->getType();
132 const Type *MidTy = Op->getType();
133 Instruction::CastOps firstOp = Instruction::CastOps(Op->getOpcode());
134 Instruction::CastOps secondOp = Instruction::CastOps(opc);
136 // Let CastInst::isEliminableCastPair do the heavy lifting.
137 return CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy, DstTy,
141 Constant *llvm::ConstantFoldCastInstruction(unsigned opc, const Constant *V,
142 const Type *DestTy) {
143 const Type *SrcTy = V->getType();
145 if (isa<UndefValue>(V)) {
146 // zext(undef) = 0, because the top bits will be zero.
147 // sext(undef) = 0, because the top bits will all be the same.
148 if (opc == Instruction::ZExt || opc == Instruction::SExt)
149 return Constant::getNullValue(DestTy);
150 return UndefValue::get(DestTy);
152 // No compile-time operations on this type yet.
153 if (V->getType() == Type::PPC_FP128Ty || DestTy == Type::PPC_FP128Ty)
156 // If the cast operand is a constant expression, there's a few things we can
157 // do to try to simplify it.
158 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
160 // Try hard to fold cast of cast because they are often eliminable.
161 if (unsigned newOpc = foldConstantCastPair(opc, CE, DestTy))
162 return ConstantExpr::getCast(newOpc, CE->getOperand(0), DestTy);
163 } else if (CE->getOpcode() == Instruction::GetElementPtr) {
164 // If all of the indexes in the GEP are null values, there is no pointer
165 // adjustment going on. We might as well cast the source pointer.
166 bool isAllNull = true;
167 for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
168 if (!CE->getOperand(i)->isNullValue()) {
173 // This is casting one pointer type to another, always BitCast
174 return ConstantExpr::getPointerCast(CE->getOperand(0), DestTy);
178 // We actually have to do a cast now. Perform the cast according to the
181 case Instruction::FPTrunc:
182 case Instruction::FPExt:
183 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
184 APFloat Val = FPC->getValueAPF();
185 Val.convert(DestTy == Type::FloatTy ? APFloat::IEEEsingle :
186 DestTy == Type::DoubleTy ? APFloat::IEEEdouble :
187 DestTy == Type::X86_FP80Ty ? APFloat::x87DoubleExtended :
188 DestTy == Type::FP128Ty ? APFloat::IEEEquad :
190 APFloat::rmNearestTiesToEven);
191 return ConstantFP::get(DestTy, Val);
193 return 0; // Can't fold.
194 case Instruction::FPToUI:
195 case Instruction::FPToSI:
196 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
197 const APFloat &V = FPC->getValueAPF();
199 uint32_t DestBitWidth = cast<IntegerType>(DestTy)->getBitWidth();
200 (void) V.convertToInteger(x, DestBitWidth, opc==Instruction::FPToSI,
201 APFloat::rmTowardZero);
202 APInt Val(DestBitWidth, 2, x);
203 return ConstantInt::get(Val);
205 return 0; // Can't fold.
206 case Instruction::IntToPtr: //always treated as unsigned
207 if (V->isNullValue()) // Is it an integral null value?
208 return ConstantPointerNull::get(cast<PointerType>(DestTy));
209 return 0; // Other pointer types cannot be casted
210 case Instruction::PtrToInt: // always treated as unsigned
211 if (V->isNullValue()) // is it a null pointer value?
212 return ConstantInt::get(DestTy, 0);
213 return 0; // Other pointer types cannot be casted
214 case Instruction::UIToFP:
215 case Instruction::SIToFP:
216 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
217 APInt api = CI->getValue();
218 const uint64_t zero[] = {0, 0};
219 uint32_t BitWidth = cast<IntegerType>(SrcTy)->getBitWidth();
220 APFloat apf = APFloat(APInt(DestTy->getPrimitiveSizeInBits(),
222 (void)apf.convertFromZeroExtendedInteger(api.getRawData(), BitWidth,
223 opc==Instruction::SIToFP,
224 APFloat::rmNearestTiesToEven);
225 return ConstantFP::get(DestTy, apf);
228 case Instruction::ZExt:
229 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
230 uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
231 APInt Result(CI->getValue());
232 Result.zext(BitWidth);
233 return ConstantInt::get(Result);
236 case Instruction::SExt:
237 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
238 uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
239 APInt Result(CI->getValue());
240 Result.sext(BitWidth);
241 return ConstantInt::get(Result);
244 case Instruction::Trunc:
245 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
246 uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
247 APInt Result(CI->getValue());
248 Result.trunc(BitWidth);
249 return ConstantInt::get(Result);
252 case Instruction::BitCast:
254 return (Constant*)V; // no-op cast
256 // Check to see if we are casting a pointer to an aggregate to a pointer to
257 // the first element. If so, return the appropriate GEP instruction.
258 if (const PointerType *PTy = dyn_cast<PointerType>(V->getType()))
259 if (const PointerType *DPTy = dyn_cast<PointerType>(DestTy)) {
260 SmallVector<Value*, 8> IdxList;
261 IdxList.push_back(Constant::getNullValue(Type::Int32Ty));
262 const Type *ElTy = PTy->getElementType();
263 while (ElTy != DPTy->getElementType()) {
264 if (const StructType *STy = dyn_cast<StructType>(ElTy)) {
265 if (STy->getNumElements() == 0) break;
266 ElTy = STy->getElementType(0);
267 IdxList.push_back(Constant::getNullValue(Type::Int32Ty));
268 } else if (const SequentialType *STy =
269 dyn_cast<SequentialType>(ElTy)) {
270 if (isa<PointerType>(ElTy)) break; // Can't index into pointers!
271 ElTy = STy->getElementType();
272 IdxList.push_back(IdxList[0]);
278 if (ElTy == DPTy->getElementType())
279 return ConstantExpr::getGetElementPtr(
280 const_cast<Constant*>(V), &IdxList[0], IdxList.size());
283 // Handle casts from one vector constant to another. We know that the src
284 // and dest type have the same size (otherwise its an illegal cast).
285 if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
286 if (const VectorType *SrcTy = dyn_cast<VectorType>(V->getType())) {
287 assert(DestPTy->getBitWidth() == SrcTy->getBitWidth() &&
288 "Not cast between same sized vectors!");
289 // First, check for null and undef
290 if (isa<ConstantAggregateZero>(V))
291 return Constant::getNullValue(DestTy);
292 if (isa<UndefValue>(V))
293 return UndefValue::get(DestTy);
295 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V)) {
296 // This is a cast from a ConstantVector of one type to a
297 // ConstantVector of another type. Check to see if all elements of
298 // the input are simple.
299 bool AllSimpleConstants = true;
300 for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i) {
301 if (!isa<ConstantInt>(CV->getOperand(i)) &&
302 !isa<ConstantFP>(CV->getOperand(i))) {
303 AllSimpleConstants = false;
308 // If all of the elements are simple constants, we can fold this.
309 if (AllSimpleConstants)
310 return CastConstantVector(const_cast<ConstantVector*>(CV), DestPTy);
315 // Finally, implement bitcast folding now. The code below doesn't handle
317 if (isa<ConstantPointerNull>(V)) // ptr->ptr cast.
318 return ConstantPointerNull::get(cast<PointerType>(DestTy));
320 // Handle integral constant input.
321 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
322 if (DestTy->isInteger())
323 // Integral -> Integral. This is a no-op because the bit widths must
324 // be the same. Consequently, we just fold to V.
325 return const_cast<Constant*>(V);
327 if (DestTy->isFloatingPoint()) {
328 assert((DestTy == Type::DoubleTy || DestTy == Type::FloatTy) &&
330 return ConstantFP::get(DestTy, APFloat(CI->getValue()));
332 // Otherwise, can't fold this (vector?)
336 // Handle ConstantFP input.
337 if (const ConstantFP *FP = dyn_cast<ConstantFP>(V)) {
339 if (DestTy == Type::Int32Ty) {
340 return ConstantInt::get(FP->getValueAPF().convertToAPInt());
342 assert(DestTy == Type::Int64Ty && "only support f32/f64 for now!");
343 return ConstantInt::get(FP->getValueAPF().convertToAPInt());
348 assert(!"Invalid CE CastInst opcode");
352 assert(0 && "Failed to cast constant expression");
356 Constant *llvm::ConstantFoldSelectInstruction(const Constant *Cond,
358 const Constant *V2) {
359 if (const ConstantInt *CB = dyn_cast<ConstantInt>(Cond))
360 return const_cast<Constant*>(CB->getZExtValue() ? V1 : V2);
362 if (isa<UndefValue>(V1)) return const_cast<Constant*>(V2);
363 if (isa<UndefValue>(V2)) return const_cast<Constant*>(V1);
364 if (isa<UndefValue>(Cond)) return const_cast<Constant*>(V1);
365 if (V1 == V2) return const_cast<Constant*>(V1);
369 Constant *llvm::ConstantFoldExtractElementInstruction(const Constant *Val,
370 const Constant *Idx) {
371 if (isa<UndefValue>(Val)) // ee(undef, x) -> undef
372 return UndefValue::get(cast<VectorType>(Val->getType())->getElementType());
373 if (Val->isNullValue()) // ee(zero, x) -> zero
374 return Constant::getNullValue(
375 cast<VectorType>(Val->getType())->getElementType());
377 if (const ConstantVector *CVal = dyn_cast<ConstantVector>(Val)) {
378 if (const ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx)) {
379 return const_cast<Constant*>(CVal->getOperand(CIdx->getZExtValue()));
380 } else if (isa<UndefValue>(Idx)) {
381 // ee({w,x,y,z}, undef) -> w (an arbitrary value).
382 return const_cast<Constant*>(CVal->getOperand(0));
388 Constant *llvm::ConstantFoldInsertElementInstruction(const Constant *Val,
390 const Constant *Idx) {
391 const ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx);
393 APInt idxVal = CIdx->getValue();
394 if (isa<UndefValue>(Val)) {
395 // Insertion of scalar constant into vector undef
396 // Optimize away insertion of undef
397 if (isa<UndefValue>(Elt))
398 return const_cast<Constant*>(Val);
399 // Otherwise break the aggregate undef into multiple undefs and do
402 cast<VectorType>(Val->getType())->getNumElements();
403 std::vector<Constant*> Ops;
405 for (unsigned i = 0; i < numOps; ++i) {
407 (idxVal == i) ? Elt : UndefValue::get(Elt->getType());
408 Ops.push_back(const_cast<Constant*>(Op));
410 return ConstantVector::get(Ops);
412 if (isa<ConstantAggregateZero>(Val)) {
413 // Insertion of scalar constant into vector aggregate zero
414 // Optimize away insertion of zero
415 if (Elt->isNullValue())
416 return const_cast<Constant*>(Val);
417 // Otherwise break the aggregate zero into multiple zeros and do
420 cast<VectorType>(Val->getType())->getNumElements();
421 std::vector<Constant*> Ops;
423 for (unsigned i = 0; i < numOps; ++i) {
425 (idxVal == i) ? Elt : Constant::getNullValue(Elt->getType());
426 Ops.push_back(const_cast<Constant*>(Op));
428 return ConstantVector::get(Ops);
430 if (const ConstantVector *CVal = dyn_cast<ConstantVector>(Val)) {
431 // Insertion of scalar constant into vector constant
432 std::vector<Constant*> Ops;
433 Ops.reserve(CVal->getNumOperands());
434 for (unsigned i = 0; i < CVal->getNumOperands(); ++i) {
436 (idxVal == i) ? Elt : cast<Constant>(CVal->getOperand(i));
437 Ops.push_back(const_cast<Constant*>(Op));
439 return ConstantVector::get(Ops);
444 Constant *llvm::ConstantFoldShuffleVectorInstruction(const Constant *V1,
446 const Constant *Mask) {
451 /// EvalVectorOp - Given two vector constants and a function pointer, apply the
452 /// function pointer to each element pair, producing a new ConstantVector
453 /// constant. Either or both of V1 and V2 may be NULL, meaning a
454 /// ConstantAggregateZero operand.
455 static Constant *EvalVectorOp(const ConstantVector *V1,
456 const ConstantVector *V2,
457 const VectorType *VTy,
458 Constant *(*FP)(Constant*, Constant*)) {
459 std::vector<Constant*> Res;
460 const Type *EltTy = VTy->getElementType();
461 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
462 const Constant *C1 = V1 ? V1->getOperand(i) : Constant::getNullValue(EltTy);
463 const Constant *C2 = V2 ? V2->getOperand(i) : Constant::getNullValue(EltTy);
464 Res.push_back(FP(const_cast<Constant*>(C1),
465 const_cast<Constant*>(C2)));
467 return ConstantVector::get(Res);
470 Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode,
472 const Constant *C2) {
473 // No compile-time operations on this type yet.
474 if (C1->getType() == Type::PPC_FP128Ty)
477 // Handle UndefValue up front
478 if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) {
480 case Instruction::Add:
481 case Instruction::Sub:
482 case Instruction::Xor:
483 return UndefValue::get(C1->getType());
484 case Instruction::Mul:
485 case Instruction::And:
486 return Constant::getNullValue(C1->getType());
487 case Instruction::UDiv:
488 case Instruction::SDiv:
489 case Instruction::FDiv:
490 case Instruction::URem:
491 case Instruction::SRem:
492 case Instruction::FRem:
493 if (!isa<UndefValue>(C2)) // undef / X -> 0
494 return Constant::getNullValue(C1->getType());
495 return const_cast<Constant*>(C2); // X / undef -> undef
496 case Instruction::Or: // X | undef -> -1
497 if (const VectorType *PTy = dyn_cast<VectorType>(C1->getType()))
498 return ConstantVector::getAllOnesValue(PTy);
499 return ConstantInt::getAllOnesValue(C1->getType());
500 case Instruction::LShr:
501 if (isa<UndefValue>(C2) && isa<UndefValue>(C1))
502 return const_cast<Constant*>(C1); // undef lshr undef -> undef
503 return Constant::getNullValue(C1->getType()); // X lshr undef -> 0
505 case Instruction::AShr:
506 if (!isa<UndefValue>(C2))
507 return const_cast<Constant*>(C1); // undef ashr X --> undef
508 else if (isa<UndefValue>(C1))
509 return const_cast<Constant*>(C1); // undef ashr undef -> undef
511 return const_cast<Constant*>(C1); // X ashr undef --> X
512 case Instruction::Shl:
513 // undef << X -> 0 or X << undef -> 0
514 return Constant::getNullValue(C1->getType());
518 if (const ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
519 if (isa<ConstantExpr>(C2)) {
520 // There are many possible foldings we could do here. We should probably
521 // at least fold add of a pointer with an integer into the appropriate
522 // getelementptr. This will improve alias analysis a bit.
524 // Just implement a couple of simple identities.
526 case Instruction::Add:
527 if (C2->isNullValue()) return const_cast<Constant*>(C1); // X + 0 == X
529 case Instruction::Sub:
530 if (C2->isNullValue()) return const_cast<Constant*>(C1); // X - 0 == X
532 case Instruction::Mul:
533 if (C2->isNullValue()) return const_cast<Constant*>(C2); // X * 0 == 0
534 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2))
535 if (CI->equalsInt(1))
536 return const_cast<Constant*>(C1); // X * 1 == X
538 case Instruction::UDiv:
539 case Instruction::SDiv:
540 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2))
541 if (CI->equalsInt(1))
542 return const_cast<Constant*>(C1); // X / 1 == X
544 case Instruction::URem:
545 case Instruction::SRem:
546 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2))
547 if (CI->equalsInt(1))
548 return Constant::getNullValue(CI->getType()); // X % 1 == 0
550 case Instruction::And:
551 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2)) {
552 if (CI->isZero()) return const_cast<Constant*>(C2); // X & 0 == 0
553 if (CI->isAllOnesValue())
554 return const_cast<Constant*>(C1); // X & -1 == X
556 // (zext i32 to i64) & 4294967295 -> (zext i32 to i64)
557 if (CE1->getOpcode() == Instruction::ZExt) {
558 APInt PossiblySetBits
559 = cast<IntegerType>(CE1->getOperand(0)->getType())->getMask();
560 PossiblySetBits.zext(C1->getType()->getPrimitiveSizeInBits());
561 if ((PossiblySetBits & CI->getValue()) == PossiblySetBits)
562 return const_cast<Constant*>(C1);
565 if (CE1->isCast() && isa<GlobalValue>(CE1->getOperand(0))) {
566 GlobalValue *CPR = cast<GlobalValue>(CE1->getOperand(0));
568 // Functions are at least 4-byte aligned. If and'ing the address of a
569 // function with a constant < 4, fold it to zero.
570 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2))
571 if (CI->getValue().ult(APInt(CI->getType()->getBitWidth(),4)) &&
573 return Constant::getNullValue(CI->getType());
576 case Instruction::Or:
577 if (C2->isNullValue()) return const_cast<Constant*>(C1); // X | 0 == X
578 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C2))
579 if (CI->isAllOnesValue())
580 return const_cast<Constant*>(C2); // X | -1 == -1
582 case Instruction::Xor:
583 if (C2->isNullValue()) return const_cast<Constant*>(C1); // X ^ 0 == X
585 case Instruction::AShr:
586 // ashr (zext C to Ty), C2 -> lshr (zext C, CSA), C2
587 if (CE1->getOpcode() == Instruction::ZExt) // Top bits known zero.
588 return ConstantExpr::getLShr(const_cast<Constant*>(C1),
589 const_cast<Constant*>(C2));
593 } else if (isa<ConstantExpr>(C2)) {
594 // If C2 is a constant expr and C1 isn't, flop them around and fold the
595 // other way if possible.
597 case Instruction::Add:
598 case Instruction::Mul:
599 case Instruction::And:
600 case Instruction::Or:
601 case Instruction::Xor:
602 // No change of opcode required.
603 return ConstantFoldBinaryInstruction(Opcode, C2, C1);
605 case Instruction::Shl:
606 case Instruction::LShr:
607 case Instruction::AShr:
608 case Instruction::Sub:
609 case Instruction::SDiv:
610 case Instruction::UDiv:
611 case Instruction::FDiv:
612 case Instruction::URem:
613 case Instruction::SRem:
614 case Instruction::FRem:
615 default: // These instructions cannot be flopped around.
620 // At this point we know neither constant is an UndefValue nor a ConstantExpr
621 // so look at directly computing the value.
622 if (const ConstantInt *CI1 = dyn_cast<ConstantInt>(C1)) {
623 if (const ConstantInt *CI2 = dyn_cast<ConstantInt>(C2)) {
624 using namespace APIntOps;
625 APInt C1V = CI1->getValue();
626 APInt C2V = CI2->getValue();
630 case Instruction::Add:
631 return ConstantInt::get(C1V + C2V);
632 case Instruction::Sub:
633 return ConstantInt::get(C1V - C2V);
634 case Instruction::Mul:
635 return ConstantInt::get(C1V * C2V);
636 case Instruction::UDiv:
637 if (CI2->isNullValue())
638 return 0; // X / 0 -> can't fold
639 return ConstantInt::get(C1V.udiv(C2V));
640 case Instruction::SDiv:
641 if (CI2->isNullValue())
642 return 0; // X / 0 -> can't fold
643 if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
644 return 0; // MIN_INT / -1 -> overflow
645 return ConstantInt::get(C1V.sdiv(C2V));
646 case Instruction::URem:
647 if (C2->isNullValue())
648 return 0; // X / 0 -> can't fold
649 return ConstantInt::get(C1V.urem(C2V));
650 case Instruction::SRem:
651 if (CI2->isNullValue())
652 return 0; // X % 0 -> can't fold
653 if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
654 return 0; // MIN_INT % -1 -> overflow
655 return ConstantInt::get(C1V.srem(C2V));
656 case Instruction::And:
657 return ConstantInt::get(C1V & C2V);
658 case Instruction::Or:
659 return ConstantInt::get(C1V | C2V);
660 case Instruction::Xor:
661 return ConstantInt::get(C1V ^ C2V);
662 case Instruction::Shl:
663 if (uint32_t shiftAmt = C2V.getZExtValue())
664 if (shiftAmt < C1V.getBitWidth())
665 return ConstantInt::get(C1V.shl(shiftAmt));
667 return UndefValue::get(C1->getType()); // too big shift is undef
668 return const_cast<ConstantInt*>(CI1); // Zero shift is identity
669 case Instruction::LShr:
670 if (uint32_t shiftAmt = C2V.getZExtValue())
671 if (shiftAmt < C1V.getBitWidth())
672 return ConstantInt::get(C1V.lshr(shiftAmt));
674 return UndefValue::get(C1->getType()); // too big shift is undef
675 return const_cast<ConstantInt*>(CI1); // Zero shift is identity
676 case Instruction::AShr:
677 if (uint32_t shiftAmt = C2V.getZExtValue())
678 if (shiftAmt < C1V.getBitWidth())
679 return ConstantInt::get(C1V.ashr(shiftAmt));
681 return UndefValue::get(C1->getType()); // too big shift is undef
682 return const_cast<ConstantInt*>(CI1); // Zero shift is identity
685 } else if (const ConstantFP *CFP1 = dyn_cast<ConstantFP>(C1)) {
686 if (const ConstantFP *CFP2 = dyn_cast<ConstantFP>(C2)) {
687 APFloat C1V = CFP1->getValueAPF();
688 APFloat C2V = CFP2->getValueAPF();
689 APFloat C3V = C1V; // copy for modification
690 bool isDouble = CFP1->getType()==Type::DoubleTy;
694 case Instruction::Add:
695 (void)C3V.add(C2V, APFloat::rmNearestTiesToEven);
696 return ConstantFP::get(CFP1->getType(), C3V);
697 case Instruction::Sub:
698 (void)C3V.subtract(C2V, APFloat::rmNearestTiesToEven);
699 return ConstantFP::get(CFP1->getType(), C3V);
700 case Instruction::Mul:
701 (void)C3V.multiply(C2V, APFloat::rmNearestTiesToEven);
702 return ConstantFP::get(CFP1->getType(), C3V);
703 case Instruction::FDiv:
704 (void)C3V.divide(C2V, APFloat::rmNearestTiesToEven);
705 return ConstantFP::get(CFP1->getType(), C3V);
706 case Instruction::FRem:
708 // IEEE 754, Section 7.1, #5
709 return ConstantFP::get(CFP1->getType(), isDouble ?
710 APFloat(std::numeric_limits<double>::quiet_NaN()) :
711 APFloat(std::numeric_limits<float>::quiet_NaN()));
712 (void)C3V.mod(C2V, APFloat::rmNearestTiesToEven);
713 return ConstantFP::get(CFP1->getType(), C3V);
716 } else if (const VectorType *VTy = dyn_cast<VectorType>(C1->getType())) {
717 const ConstantVector *CP1 = dyn_cast<ConstantVector>(C1);
718 const ConstantVector *CP2 = dyn_cast<ConstantVector>(C2);
719 assert((CP1 != NULL || isa<ConstantAggregateZero>(C1)) &&
720 "Unexpected kind of vector constant!");
721 assert((CP2 != NULL || isa<ConstantAggregateZero>(C2)) &&
722 "Unexpected kind of vector constant!");
726 case Instruction::Add:
727 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getAdd);
728 case Instruction::Sub:
729 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getSub);
730 case Instruction::Mul:
731 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getMul);
732 case Instruction::UDiv:
733 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getUDiv);
734 case Instruction::SDiv:
735 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getSDiv);
736 case Instruction::FDiv:
737 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getFDiv);
738 case Instruction::URem:
739 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getURem);
740 case Instruction::SRem:
741 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getSRem);
742 case Instruction::FRem:
743 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getFRem);
744 case Instruction::And:
745 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getAnd);
746 case Instruction::Or:
747 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getOr);
748 case Instruction::Xor:
749 return EvalVectorOp(CP1, CP2, VTy, ConstantExpr::getXor);
753 // We don't know how to fold this
757 /// isZeroSizedType - This type is zero sized if its an array or structure of
758 /// zero sized types. The only leaf zero sized type is an empty structure.
759 static bool isMaybeZeroSizedType(const Type *Ty) {
760 if (isa<OpaqueType>(Ty)) return true; // Can't say.
761 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
763 // If all of elements have zero size, this does too.
764 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
765 if (!isMaybeZeroSizedType(STy->getElementType(i))) return false;
768 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
769 return isMaybeZeroSizedType(ATy->getElementType());
774 /// IdxCompare - Compare the two constants as though they were getelementptr
775 /// indices. This allows coersion of the types to be the same thing.
777 /// If the two constants are the "same" (after coersion), return 0. If the
778 /// first is less than the second, return -1, if the second is less than the
779 /// first, return 1. If the constants are not integral, return -2.
781 static int IdxCompare(Constant *C1, Constant *C2, const Type *ElTy) {
782 if (C1 == C2) return 0;
784 // Ok, we found a different index. If they are not ConstantInt, we can't do
785 // anything with them.
786 if (!isa<ConstantInt>(C1) || !isa<ConstantInt>(C2))
787 return -2; // don't know!
789 // Ok, we have two differing integer indices. Sign extend them to be the same
790 // type. Long is always big enough, so we use it.
791 if (C1->getType() != Type::Int64Ty)
792 C1 = ConstantExpr::getSExt(C1, Type::Int64Ty);
794 if (C2->getType() != Type::Int64Ty)
795 C2 = ConstantExpr::getSExt(C2, Type::Int64Ty);
797 if (C1 == C2) return 0; // They are equal
799 // If the type being indexed over is really just a zero sized type, there is
800 // no pointer difference being made here.
801 if (isMaybeZeroSizedType(ElTy))
804 // If they are really different, now that they are the same type, then we
805 // found a difference!
806 if (cast<ConstantInt>(C1)->getSExtValue() <
807 cast<ConstantInt>(C2)->getSExtValue())
813 /// evaluateFCmpRelation - This function determines if there is anything we can
814 /// decide about the two constants provided. This doesn't need to handle simple
815 /// things like ConstantFP comparisons, but should instead handle ConstantExprs.
816 /// If we can determine that the two constants have a particular relation to
817 /// each other, we should return the corresponding FCmpInst predicate,
818 /// otherwise return FCmpInst::BAD_FCMP_PREDICATE. This is used below in
819 /// ConstantFoldCompareInstruction.
821 /// To simplify this code we canonicalize the relation so that the first
822 /// operand is always the most "complex" of the two. We consider ConstantFP
823 /// to be the simplest, and ConstantExprs to be the most complex.
824 static FCmpInst::Predicate evaluateFCmpRelation(const Constant *V1,
825 const Constant *V2) {
826 assert(V1->getType() == V2->getType() &&
827 "Cannot compare values of different types!");
829 // No compile-time operations on this type yet.
830 if (V1->getType() == Type::PPC_FP128Ty)
831 return FCmpInst::BAD_FCMP_PREDICATE;
833 // Handle degenerate case quickly
834 if (V1 == V2) return FCmpInst::FCMP_OEQ;
836 if (!isa<ConstantExpr>(V1)) {
837 if (!isa<ConstantExpr>(V2)) {
838 // We distilled thisUse the standard constant folder for a few cases
840 Constant *C1 = const_cast<Constant*>(V1);
841 Constant *C2 = const_cast<Constant*>(V2);
842 R = dyn_cast<ConstantInt>(
843 ConstantExpr::getFCmp(FCmpInst::FCMP_OEQ, C1, C2));
844 if (R && !R->isZero())
845 return FCmpInst::FCMP_OEQ;
846 R = dyn_cast<ConstantInt>(
847 ConstantExpr::getFCmp(FCmpInst::FCMP_OLT, C1, C2));
848 if (R && !R->isZero())
849 return FCmpInst::FCMP_OLT;
850 R = dyn_cast<ConstantInt>(
851 ConstantExpr::getFCmp(FCmpInst::FCMP_OGT, C1, C2));
852 if (R && !R->isZero())
853 return FCmpInst::FCMP_OGT;
855 // Nothing more we can do
856 return FCmpInst::BAD_FCMP_PREDICATE;
859 // If the first operand is simple and second is ConstantExpr, swap operands.
860 FCmpInst::Predicate SwappedRelation = evaluateFCmpRelation(V2, V1);
861 if (SwappedRelation != FCmpInst::BAD_FCMP_PREDICATE)
862 return FCmpInst::getSwappedPredicate(SwappedRelation);
864 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a
865 // constantexpr or a simple constant.
866 const ConstantExpr *CE1 = cast<ConstantExpr>(V1);
867 switch (CE1->getOpcode()) {
868 case Instruction::FPTrunc:
869 case Instruction::FPExt:
870 case Instruction::UIToFP:
871 case Instruction::SIToFP:
872 // We might be able to do something with these but we don't right now.
878 // There are MANY other foldings that we could perform here. They will
879 // probably be added on demand, as they seem needed.
880 return FCmpInst::BAD_FCMP_PREDICATE;
883 /// evaluateICmpRelation - This function determines if there is anything we can
884 /// decide about the two constants provided. This doesn't need to handle simple
885 /// things like integer comparisons, but should instead handle ConstantExprs
886 /// and GlobalValues. If we can determine that the two constants have a
887 /// particular relation to each other, we should return the corresponding ICmp
888 /// predicate, otherwise return ICmpInst::BAD_ICMP_PREDICATE.
890 /// To simplify this code we canonicalize the relation so that the first
891 /// operand is always the most "complex" of the two. We consider simple
892 /// constants (like ConstantInt) to be the simplest, followed by
893 /// GlobalValues, followed by ConstantExpr's (the most complex).
895 static ICmpInst::Predicate evaluateICmpRelation(const Constant *V1,
898 assert(V1->getType() == V2->getType() &&
899 "Cannot compare different types of values!");
900 if (V1 == V2) return ICmpInst::ICMP_EQ;
902 if (!isa<ConstantExpr>(V1) && !isa<GlobalValue>(V1)) {
903 if (!isa<GlobalValue>(V2) && !isa<ConstantExpr>(V2)) {
904 // We distilled this down to a simple case, use the standard constant
907 Constant *C1 = const_cast<Constant*>(V1);
908 Constant *C2 = const_cast<Constant*>(V2);
909 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ;
910 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, C1, C2));
911 if (R && !R->isZero())
913 pred = isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
914 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, C1, C2));
915 if (R && !R->isZero())
917 pred = isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
918 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, C1, C2));
919 if (R && !R->isZero())
922 // If we couldn't figure it out, bail.
923 return ICmpInst::BAD_ICMP_PREDICATE;
926 // If the first operand is simple, swap operands.
927 ICmpInst::Predicate SwappedRelation =
928 evaluateICmpRelation(V2, V1, isSigned);
929 if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
930 return ICmpInst::getSwappedPredicate(SwappedRelation);
932 } else if (const GlobalValue *CPR1 = dyn_cast<GlobalValue>(V1)) {
933 if (isa<ConstantExpr>(V2)) { // Swap as necessary.
934 ICmpInst::Predicate SwappedRelation =
935 evaluateICmpRelation(V2, V1, isSigned);
936 if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
937 return ICmpInst::getSwappedPredicate(SwappedRelation);
939 return ICmpInst::BAD_ICMP_PREDICATE;
942 // Now we know that the RHS is a GlobalValue or simple constant,
943 // which (since the types must match) means that it's a ConstantPointerNull.
944 if (const GlobalValue *CPR2 = dyn_cast<GlobalValue>(V2)) {
945 // Don't try to decide equality of aliases.
946 if (!isa<GlobalAlias>(CPR1) && !isa<GlobalAlias>(CPR2))
947 if (!CPR1->hasExternalWeakLinkage() || !CPR2->hasExternalWeakLinkage())
948 return ICmpInst::ICMP_NE;
950 assert(isa<ConstantPointerNull>(V2) && "Canonicalization guarantee!");
951 // GlobalVals can never be null. Don't try to evaluate aliases.
952 if (!CPR1->hasExternalWeakLinkage() && !isa<GlobalAlias>(CPR1))
953 return ICmpInst::ICMP_NE;
956 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a
957 // constantexpr, a CPR, or a simple constant.
958 const ConstantExpr *CE1 = cast<ConstantExpr>(V1);
959 const Constant *CE1Op0 = CE1->getOperand(0);
961 switch (CE1->getOpcode()) {
962 case Instruction::Trunc:
963 case Instruction::FPTrunc:
964 case Instruction::FPExt:
965 case Instruction::FPToUI:
966 case Instruction::FPToSI:
967 break; // We can't evaluate floating point casts or truncations.
969 case Instruction::UIToFP:
970 case Instruction::SIToFP:
971 case Instruction::IntToPtr:
972 case Instruction::BitCast:
973 case Instruction::ZExt:
974 case Instruction::SExt:
975 case Instruction::PtrToInt:
976 // If the cast is not actually changing bits, and the second operand is a
977 // null pointer, do the comparison with the pre-casted value.
978 if (V2->isNullValue() &&
979 (isa<PointerType>(CE1->getType()) || CE1->getType()->isInteger())) {
980 bool sgnd = CE1->getOpcode() == Instruction::ZExt ? false :
981 (CE1->getOpcode() == Instruction::SExt ? true :
982 (CE1->getOpcode() == Instruction::PtrToInt ? false : isSigned));
983 return evaluateICmpRelation(
984 CE1Op0, Constant::getNullValue(CE1Op0->getType()), sgnd);
987 // If the dest type is a pointer type, and the RHS is a constantexpr cast
988 // from the same type as the src of the LHS, evaluate the inputs. This is
989 // important for things like "icmp eq (cast 4 to int*), (cast 5 to int*)",
990 // which happens a lot in compilers with tagged integers.
991 if (const ConstantExpr *CE2 = dyn_cast<ConstantExpr>(V2))
992 if (CE2->isCast() && isa<PointerType>(CE1->getType()) &&
993 CE1->getOperand(0)->getType() == CE2->getOperand(0)->getType() &&
994 CE1->getOperand(0)->getType()->isInteger()) {
995 bool sgnd = CE1->getOpcode() == Instruction::ZExt ? false :
996 (CE1->getOpcode() == Instruction::SExt ? true :
997 (CE1->getOpcode() == Instruction::PtrToInt ? false : isSigned));
998 return evaluateICmpRelation(CE1->getOperand(0), CE2->getOperand(0),
1003 case Instruction::GetElementPtr:
1004 // Ok, since this is a getelementptr, we know that the constant has a
1005 // pointer type. Check the various cases.
1006 if (isa<ConstantPointerNull>(V2)) {
1007 // If we are comparing a GEP to a null pointer, check to see if the base
1008 // of the GEP equals the null pointer.
1009 if (const GlobalValue *GV = dyn_cast<GlobalValue>(CE1Op0)) {
1010 if (GV->hasExternalWeakLinkage())
1011 // Weak linkage GVals could be zero or not. We're comparing that
1012 // to null pointer so its greater-or-equal
1013 return isSigned ? ICmpInst::ICMP_SGE : ICmpInst::ICMP_UGE;
1015 // If its not weak linkage, the GVal must have a non-zero address
1016 // so the result is greater-than
1017 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1018 } else if (isa<ConstantPointerNull>(CE1Op0)) {
1019 // If we are indexing from a null pointer, check to see if we have any
1020 // non-zero indices.
1021 for (unsigned i = 1, e = CE1->getNumOperands(); i != e; ++i)
1022 if (!CE1->getOperand(i)->isNullValue())
1023 // Offsetting from null, must not be equal.
1024 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1025 // Only zero indexes from null, must still be zero.
1026 return ICmpInst::ICMP_EQ;
1028 // Otherwise, we can't really say if the first operand is null or not.
1029 } else if (const GlobalValue *CPR2 = dyn_cast<GlobalValue>(V2)) {
1030 if (isa<ConstantPointerNull>(CE1Op0)) {
1031 if (CPR2->hasExternalWeakLinkage())
1032 // Weak linkage GVals could be zero or not. We're comparing it to
1033 // a null pointer, so its less-or-equal
1034 return isSigned ? ICmpInst::ICMP_SLE : ICmpInst::ICMP_ULE;
1036 // If its not weak linkage, the GVal must have a non-zero address
1037 // so the result is less-than
1038 return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
1039 } else if (const GlobalValue *CPR1 = dyn_cast<GlobalValue>(CE1Op0)) {
1041 // If this is a getelementptr of the same global, then it must be
1042 // different. Because the types must match, the getelementptr could
1043 // only have at most one index, and because we fold getelementptr's
1044 // with a single zero index, it must be nonzero.
1045 assert(CE1->getNumOperands() == 2 &&
1046 !CE1->getOperand(1)->isNullValue() &&
1047 "Suprising getelementptr!");
1048 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1050 // If they are different globals, we don't know what the value is,
1051 // but they can't be equal.
1052 return ICmpInst::ICMP_NE;
1056 const ConstantExpr *CE2 = cast<ConstantExpr>(V2);
1057 const Constant *CE2Op0 = CE2->getOperand(0);
1059 // There are MANY other foldings that we could perform here. They will
1060 // probably be added on demand, as they seem needed.
1061 switch (CE2->getOpcode()) {
1063 case Instruction::GetElementPtr:
1064 // By far the most common case to handle is when the base pointers are
1065 // obviously to the same or different globals.
1066 if (isa<GlobalValue>(CE1Op0) && isa<GlobalValue>(CE2Op0)) {
1067 if (CE1Op0 != CE2Op0) // Don't know relative ordering, but not equal
1068 return ICmpInst::ICMP_NE;
1069 // Ok, we know that both getelementptr instructions are based on the
1070 // same global. From this, we can precisely determine the relative
1071 // ordering of the resultant pointers.
1074 // Compare all of the operands the GEP's have in common.
1075 gep_type_iterator GTI = gep_type_begin(CE1);
1076 for (;i != CE1->getNumOperands() && i != CE2->getNumOperands();
1078 switch (IdxCompare(CE1->getOperand(i), CE2->getOperand(i),
1079 GTI.getIndexedType())) {
1080 case -1: return isSigned ? ICmpInst::ICMP_SLT:ICmpInst::ICMP_ULT;
1081 case 1: return isSigned ? ICmpInst::ICMP_SGT:ICmpInst::ICMP_UGT;
1082 case -2: return ICmpInst::BAD_ICMP_PREDICATE;
1085 // Ok, we ran out of things they have in common. If any leftovers
1086 // are non-zero then we have a difference, otherwise we are equal.
1087 for (; i < CE1->getNumOperands(); ++i)
1088 if (!CE1->getOperand(i)->isNullValue())
1089 if (isa<ConstantInt>(CE1->getOperand(i)))
1090 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1092 return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
1094 for (; i < CE2->getNumOperands(); ++i)
1095 if (!CE2->getOperand(i)->isNullValue())
1096 if (isa<ConstantInt>(CE2->getOperand(i)))
1097 return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
1099 return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
1100 return ICmpInst::ICMP_EQ;
1109 return ICmpInst::BAD_ICMP_PREDICATE;
1112 Constant *llvm::ConstantFoldCompareInstruction(unsigned short pred,
1114 const Constant *C2) {
1116 // Handle some degenerate cases first
1117 if (isa<UndefValue>(C1) || isa<UndefValue>(C2))
1118 return UndefValue::get(Type::Int1Ty);
1120 // No compile-time operations on this type yet.
1121 if (C1->getType() == Type::PPC_FP128Ty)
1124 // icmp eq/ne(null,GV) -> false/true
1125 if (C1->isNullValue()) {
1126 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C2))
1127 // Don't try to evaluate aliases. External weak GV can be null.
1128 if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage())
1129 if (pred == ICmpInst::ICMP_EQ)
1130 return ConstantInt::getFalse();
1131 else if (pred == ICmpInst::ICMP_NE)
1132 return ConstantInt::getTrue();
1133 // icmp eq/ne(GV,null) -> false/true
1134 } else if (C2->isNullValue()) {
1135 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C1))
1136 // Don't try to evaluate aliases. External weak GV can be null.
1137 if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage())
1138 if (pred == ICmpInst::ICMP_EQ)
1139 return ConstantInt::getFalse();
1140 else if (pred == ICmpInst::ICMP_NE)
1141 return ConstantInt::getTrue();
1144 if (isa<ConstantInt>(C1) && isa<ConstantInt>(C2)) {
1145 APInt V1 = cast<ConstantInt>(C1)->getValue();
1146 APInt V2 = cast<ConstantInt>(C2)->getValue();
1148 default: assert(0 && "Invalid ICmp Predicate"); return 0;
1149 case ICmpInst::ICMP_EQ: return ConstantInt::get(Type::Int1Ty, V1 == V2);
1150 case ICmpInst::ICMP_NE: return ConstantInt::get(Type::Int1Ty, V1 != V2);
1151 case ICmpInst::ICMP_SLT:return ConstantInt::get(Type::Int1Ty, V1.slt(V2));
1152 case ICmpInst::ICMP_SGT:return ConstantInt::get(Type::Int1Ty, V1.sgt(V2));
1153 case ICmpInst::ICMP_SLE:return ConstantInt::get(Type::Int1Ty, V1.sle(V2));
1154 case ICmpInst::ICMP_SGE:return ConstantInt::get(Type::Int1Ty, V1.sge(V2));
1155 case ICmpInst::ICMP_ULT:return ConstantInt::get(Type::Int1Ty, V1.ult(V2));
1156 case ICmpInst::ICMP_UGT:return ConstantInt::get(Type::Int1Ty, V1.ugt(V2));
1157 case ICmpInst::ICMP_ULE:return ConstantInt::get(Type::Int1Ty, V1.ule(V2));
1158 case ICmpInst::ICMP_UGE:return ConstantInt::get(Type::Int1Ty, V1.uge(V2));
1160 } else if (isa<ConstantFP>(C1) && isa<ConstantFP>(C2)) {
1161 APFloat C1V = cast<ConstantFP>(C1)->getValueAPF();
1162 APFloat C2V = cast<ConstantFP>(C2)->getValueAPF();
1163 APFloat::cmpResult R = C1V.compare(C2V);
1165 default: assert(0 && "Invalid FCmp Predicate"); return 0;
1166 case FCmpInst::FCMP_FALSE: return ConstantInt::getFalse();
1167 case FCmpInst::FCMP_TRUE: return ConstantInt::getTrue();
1168 case FCmpInst::FCMP_UNO:
1169 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpUnordered);
1170 case FCmpInst::FCMP_ORD:
1171 return ConstantInt::get(Type::Int1Ty, R!=APFloat::cmpUnordered);
1172 case FCmpInst::FCMP_UEQ:
1173 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpUnordered ||
1174 R==APFloat::cmpEqual);
1175 case FCmpInst::FCMP_OEQ:
1176 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpEqual);
1177 case FCmpInst::FCMP_UNE:
1178 return ConstantInt::get(Type::Int1Ty, R!=APFloat::cmpEqual);
1179 case FCmpInst::FCMP_ONE:
1180 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpLessThan ||
1181 R==APFloat::cmpGreaterThan);
1182 case FCmpInst::FCMP_ULT:
1183 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpUnordered ||
1184 R==APFloat::cmpLessThan);
1185 case FCmpInst::FCMP_OLT:
1186 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpLessThan);
1187 case FCmpInst::FCMP_UGT:
1188 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpUnordered ||
1189 R==APFloat::cmpGreaterThan);
1190 case FCmpInst::FCMP_OGT:
1191 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpGreaterThan);
1192 case FCmpInst::FCMP_ULE:
1193 return ConstantInt::get(Type::Int1Ty, R!=APFloat::cmpGreaterThan);
1194 case FCmpInst::FCMP_OLE:
1195 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpLessThan ||
1196 R==APFloat::cmpEqual);
1197 case FCmpInst::FCMP_UGE:
1198 return ConstantInt::get(Type::Int1Ty, R!=APFloat::cmpLessThan);
1199 case FCmpInst::FCMP_OGE:
1200 return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpGreaterThan ||
1201 R==APFloat::cmpEqual);
1203 } else if (const ConstantVector *CP1 = dyn_cast<ConstantVector>(C1)) {
1204 if (const ConstantVector *CP2 = dyn_cast<ConstantVector>(C2)) {
1205 if (pred == FCmpInst::FCMP_OEQ || pred == FCmpInst::FCMP_UEQ) {
1206 for (unsigned i = 0, e = CP1->getNumOperands(); i != e; ++i) {
1207 Constant *C= ConstantExpr::getFCmp(FCmpInst::FCMP_OEQ,
1208 const_cast<Constant*>(CP1->getOperand(i)),
1209 const_cast<Constant*>(CP2->getOperand(i)));
1210 if (ConstantInt *CB = dyn_cast<ConstantInt>(C))
1213 // Otherwise, could not decide from any element pairs.
1215 } else if (pred == ICmpInst::ICMP_EQ) {
1216 for (unsigned i = 0, e = CP1->getNumOperands(); i != e; ++i) {
1217 Constant *C = ConstantExpr::getICmp(ICmpInst::ICMP_EQ,
1218 const_cast<Constant*>(CP1->getOperand(i)),
1219 const_cast<Constant*>(CP2->getOperand(i)));
1220 if (ConstantInt *CB = dyn_cast<ConstantInt>(C))
1223 // Otherwise, could not decide from any element pairs.
1229 if (C1->getType()->isFloatingPoint()) {
1230 switch (evaluateFCmpRelation(C1, C2)) {
1231 default: assert(0 && "Unknown relation!");
1232 case FCmpInst::FCMP_UNO:
1233 case FCmpInst::FCMP_ORD:
1234 case FCmpInst::FCMP_UEQ:
1235 case FCmpInst::FCMP_UNE:
1236 case FCmpInst::FCMP_ULT:
1237 case FCmpInst::FCMP_UGT:
1238 case FCmpInst::FCMP_ULE:
1239 case FCmpInst::FCMP_UGE:
1240 case FCmpInst::FCMP_TRUE:
1241 case FCmpInst::FCMP_FALSE:
1242 case FCmpInst::BAD_FCMP_PREDICATE:
1243 break; // Couldn't determine anything about these constants.
1244 case FCmpInst::FCMP_OEQ: // We know that C1 == C2
1245 return ConstantInt::get(Type::Int1Ty,
1246 pred == FCmpInst::FCMP_UEQ || pred == FCmpInst::FCMP_OEQ ||
1247 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE ||
1248 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
1249 case FCmpInst::FCMP_OLT: // We know that C1 < C2
1250 return ConstantInt::get(Type::Int1Ty,
1251 pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
1252 pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT ||
1253 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE);
1254 case FCmpInst::FCMP_OGT: // We know that C1 > C2
1255 return ConstantInt::get(Type::Int1Ty,
1256 pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
1257 pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT ||
1258 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
1259 case FCmpInst::FCMP_OLE: // We know that C1 <= C2
1260 // We can only partially decide this relation.
1261 if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
1262 return ConstantInt::getFalse();
1263 if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
1264 return ConstantInt::getTrue();
1266 case FCmpInst::FCMP_OGE: // We known that C1 >= C2
1267 // We can only partially decide this relation.
1268 if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
1269 return ConstantInt::getFalse();
1270 if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
1271 return ConstantInt::getTrue();
1273 case ICmpInst::ICMP_NE: // We know that C1 != C2
1274 // We can only partially decide this relation.
1275 if (pred == FCmpInst::FCMP_OEQ || pred == FCmpInst::FCMP_UEQ)
1276 return ConstantInt::getFalse();
1277 if (pred == FCmpInst::FCMP_ONE || pred == FCmpInst::FCMP_UNE)
1278 return ConstantInt::getTrue();
1282 // Evaluate the relation between the two constants, per the predicate.
1283 switch (evaluateICmpRelation(C1, C2, CmpInst::isSigned(pred))) {
1284 default: assert(0 && "Unknown relational!");
1285 case ICmpInst::BAD_ICMP_PREDICATE:
1286 break; // Couldn't determine anything about these constants.
1287 case ICmpInst::ICMP_EQ: // We know the constants are equal!
1288 // If we know the constants are equal, we can decide the result of this
1289 // computation precisely.
1290 return ConstantInt::get(Type::Int1Ty,
1291 pred == ICmpInst::ICMP_EQ ||
1292 pred == ICmpInst::ICMP_ULE ||
1293 pred == ICmpInst::ICMP_SLE ||
1294 pred == ICmpInst::ICMP_UGE ||
1295 pred == ICmpInst::ICMP_SGE);
1296 case ICmpInst::ICMP_ULT:
1297 // If we know that C1 < C2, we can decide the result of this computation
1299 return ConstantInt::get(Type::Int1Ty,
1300 pred == ICmpInst::ICMP_ULT ||
1301 pred == ICmpInst::ICMP_NE ||
1302 pred == ICmpInst::ICMP_ULE);
1303 case ICmpInst::ICMP_SLT:
1304 // If we know that C1 < C2, we can decide the result of this computation
1306 return ConstantInt::get(Type::Int1Ty,
1307 pred == ICmpInst::ICMP_SLT ||
1308 pred == ICmpInst::ICMP_NE ||
1309 pred == ICmpInst::ICMP_SLE);
1310 case ICmpInst::ICMP_UGT:
1311 // If we know that C1 > C2, we can decide the result of this computation
1313 return ConstantInt::get(Type::Int1Ty,
1314 pred == ICmpInst::ICMP_UGT ||
1315 pred == ICmpInst::ICMP_NE ||
1316 pred == ICmpInst::ICMP_UGE);
1317 case ICmpInst::ICMP_SGT:
1318 // If we know that C1 > C2, we can decide the result of this computation
1320 return ConstantInt::get(Type::Int1Ty,
1321 pred == ICmpInst::ICMP_SGT ||
1322 pred == ICmpInst::ICMP_NE ||
1323 pred == ICmpInst::ICMP_SGE);
1324 case ICmpInst::ICMP_ULE:
1325 // If we know that C1 <= C2, we can only partially decide this relation.
1326 if (pred == ICmpInst::ICMP_UGT) return ConstantInt::getFalse();
1327 if (pred == ICmpInst::ICMP_ULT) return ConstantInt::getTrue();
1329 case ICmpInst::ICMP_SLE:
1330 // If we know that C1 <= C2, we can only partially decide this relation.
1331 if (pred == ICmpInst::ICMP_SGT) return ConstantInt::getFalse();
1332 if (pred == ICmpInst::ICMP_SLT) return ConstantInt::getTrue();
1335 case ICmpInst::ICMP_UGE:
1336 // If we know that C1 >= C2, we can only partially decide this relation.
1337 if (pred == ICmpInst::ICMP_ULT) return ConstantInt::getFalse();
1338 if (pred == ICmpInst::ICMP_UGT) return ConstantInt::getTrue();
1340 case ICmpInst::ICMP_SGE:
1341 // If we know that C1 >= C2, we can only partially decide this relation.
1342 if (pred == ICmpInst::ICMP_SLT) return ConstantInt::getFalse();
1343 if (pred == ICmpInst::ICMP_SGT) return ConstantInt::getTrue();
1346 case ICmpInst::ICMP_NE:
1347 // If we know that C1 != C2, we can only partially decide this relation.
1348 if (pred == ICmpInst::ICMP_EQ) return ConstantInt::getFalse();
1349 if (pred == ICmpInst::ICMP_NE) return ConstantInt::getTrue();
1353 if (!isa<ConstantExpr>(C1) && isa<ConstantExpr>(C2)) {
1354 // If C2 is a constant expr and C1 isn't, flop them around and fold the
1355 // other way if possible.
1357 case ICmpInst::ICMP_EQ:
1358 case ICmpInst::ICMP_NE:
1359 // No change of predicate required.
1360 return ConstantFoldCompareInstruction(pred, C2, C1);
1362 case ICmpInst::ICMP_ULT:
1363 case ICmpInst::ICMP_SLT:
1364 case ICmpInst::ICMP_UGT:
1365 case ICmpInst::ICMP_SGT:
1366 case ICmpInst::ICMP_ULE:
1367 case ICmpInst::ICMP_SLE:
1368 case ICmpInst::ICMP_UGE:
1369 case ICmpInst::ICMP_SGE:
1370 // Change the predicate as necessary to swap the operands.
1371 pred = ICmpInst::getSwappedPredicate((ICmpInst::Predicate)pred);
1372 return ConstantFoldCompareInstruction(pred, C2, C1);
1374 default: // These predicates cannot be flopped around.
1382 Constant *llvm::ConstantFoldGetElementPtr(const Constant *C,
1383 Constant* const *Idxs,
1386 (NumIdx == 1 && Idxs[0]->isNullValue()))
1387 return const_cast<Constant*>(C);
1389 if (isa<UndefValue>(C)) {
1390 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(),
1392 (Value **)Idxs+NumIdx,
1394 assert(Ty != 0 && "Invalid indices for GEP!");
1395 return UndefValue::get(PointerType::get(Ty));
1398 Constant *Idx0 = Idxs[0];
1399 if (C->isNullValue()) {
1401 for (unsigned i = 0, e = NumIdx; i != e; ++i)
1402 if (!Idxs[i]->isNullValue()) {
1407 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(),
1409 (Value**)Idxs+NumIdx,
1411 assert(Ty != 0 && "Invalid indices for GEP!");
1412 return ConstantPointerNull::get(PointerType::get(Ty));
1416 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(const_cast<Constant*>(C))) {
1417 // Combine Indices - If the source pointer to this getelementptr instruction
1418 // is a getelementptr instruction, combine the indices of the two
1419 // getelementptr instructions into a single instruction.
1421 if (CE->getOpcode() == Instruction::GetElementPtr) {
1422 const Type *LastTy = 0;
1423 for (gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE);
1427 if ((LastTy && isa<ArrayType>(LastTy)) || Idx0->isNullValue()) {
1428 SmallVector<Value*, 16> NewIndices;
1429 NewIndices.reserve(NumIdx + CE->getNumOperands());
1430 for (unsigned i = 1, e = CE->getNumOperands()-1; i != e; ++i)
1431 NewIndices.push_back(CE->getOperand(i));
1433 // Add the last index of the source with the first index of the new GEP.
1434 // Make sure to handle the case when they are actually different types.
1435 Constant *Combined = CE->getOperand(CE->getNumOperands()-1);
1436 // Otherwise it must be an array.
1437 if (!Idx0->isNullValue()) {
1438 const Type *IdxTy = Combined->getType();
1439 if (IdxTy != Idx0->getType()) {
1440 Constant *C1 = ConstantExpr::getSExtOrBitCast(Idx0, Type::Int64Ty);
1441 Constant *C2 = ConstantExpr::getSExtOrBitCast(Combined,
1443 Combined = ConstantExpr::get(Instruction::Add, C1, C2);
1446 ConstantExpr::get(Instruction::Add, Idx0, Combined);
1450 NewIndices.push_back(Combined);
1451 NewIndices.insert(NewIndices.end(), Idxs+1, Idxs+NumIdx);
1452 return ConstantExpr::getGetElementPtr(CE->getOperand(0), &NewIndices[0],
1457 // Implement folding of:
1458 // int* getelementptr ([2 x int]* cast ([3 x int]* %X to [2 x int]*),
1460 // To: int* getelementptr ([3 x int]* %X, long 0, long 0)
1462 if (CE->isCast() && NumIdx > 1 && Idx0->isNullValue()) {
1463 if (const PointerType *SPT =
1464 dyn_cast<PointerType>(CE->getOperand(0)->getType()))
1465 if (const ArrayType *SAT = dyn_cast<ArrayType>(SPT->getElementType()))
1466 if (const ArrayType *CAT =
1467 dyn_cast<ArrayType>(cast<PointerType>(C->getType())->getElementType()))
1468 if (CAT->getElementType() == SAT->getElementType())
1469 return ConstantExpr::getGetElementPtr(
1470 (Constant*)CE->getOperand(0), Idxs, NumIdx);
1473 // Fold: getelementptr (i8* inttoptr (i64 1 to i8*), i32 -1)
1474 // Into: inttoptr (i64 0 to i8*)
1475 // This happens with pointers to member functions in C++.
1476 if (CE->getOpcode() == Instruction::IntToPtr && NumIdx == 1 &&
1477 isa<ConstantInt>(CE->getOperand(0)) && isa<ConstantInt>(Idxs[0]) &&
1478 cast<PointerType>(CE->getType())->getElementType() == Type::Int8Ty) {
1479 Constant *Base = CE->getOperand(0);
1480 Constant *Offset = Idxs[0];
1482 // Convert the smaller integer to the larger type.
1483 if (Offset->getType()->getPrimitiveSizeInBits() <
1484 Base->getType()->getPrimitiveSizeInBits())
1485 Offset = ConstantExpr::getSExt(Offset, Base->getType());
1486 else if (Base->getType()->getPrimitiveSizeInBits() <
1487 Offset->getType()->getPrimitiveSizeInBits())
1488 Base = ConstantExpr::getZExt(Base, Base->getType());
1490 Base = ConstantExpr::getAdd(Base, Offset);
1491 return ConstantExpr::getIntToPtr(Base, CE->getType());