1 //===- ConstantFolding.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) ConstantFolding.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 "ConstantFolding.h"
22 #include "llvm/Constants.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Function.h"
26 #include "llvm/Support/GetElementPtrTypeIterator.h"
34 virtual ~ConstRules() {}
36 // Binary Operators...
37 virtual Constant *add(const Constant *V1, const Constant *V2) const = 0;
38 virtual Constant *sub(const Constant *V1, const Constant *V2) const = 0;
39 virtual Constant *mul(const Constant *V1, const Constant *V2) const = 0;
40 virtual Constant *div(const Constant *V1, const Constant *V2) const = 0;
41 virtual Constant *rem(const Constant *V1, const Constant *V2) const = 0;
42 virtual Constant *op_and(const Constant *V1, const Constant *V2) const = 0;
43 virtual Constant *op_or (const Constant *V1, const Constant *V2) const = 0;
44 virtual Constant *op_xor(const Constant *V1, const Constant *V2) const = 0;
45 virtual Constant *shl(const Constant *V1, const Constant *V2) const = 0;
46 virtual Constant *shr(const Constant *V1, const Constant *V2) const = 0;
47 virtual Constant *lessthan(const Constant *V1, const Constant *V2) const =0;
48 virtual Constant *equalto(const Constant *V1, const Constant *V2) const = 0;
51 virtual Constant *castToBool (const Constant *V) const = 0;
52 virtual Constant *castToSByte (const Constant *V) const = 0;
53 virtual Constant *castToUByte (const Constant *V) const = 0;
54 virtual Constant *castToShort (const Constant *V) const = 0;
55 virtual Constant *castToUShort(const Constant *V) const = 0;
56 virtual Constant *castToInt (const Constant *V) const = 0;
57 virtual Constant *castToUInt (const Constant *V) const = 0;
58 virtual Constant *castToLong (const Constant *V) const = 0;
59 virtual Constant *castToULong (const Constant *V) const = 0;
60 virtual Constant *castToFloat (const Constant *V) const = 0;
61 virtual Constant *castToDouble(const Constant *V) const = 0;
62 virtual Constant *castToPointer(const Constant *V,
63 const PointerType *Ty) const = 0;
65 // ConstRules::get - Return an instance of ConstRules for the specified
68 static ConstRules &get(const Constant *V1, const Constant *V2);
70 ConstRules(const ConstRules &); // Do not implement
71 ConstRules &operator=(const ConstRules &); // Do not implement
76 //===----------------------------------------------------------------------===//
77 // TemplateRules Class
78 //===----------------------------------------------------------------------===//
80 // TemplateRules - Implement a subclass of ConstRules that provides all
81 // operations as noops. All other rules classes inherit from this class so
82 // that if functionality is needed in the future, it can simply be added here
83 // and to ConstRules without changing anything else...
85 // This class also provides subclasses with typesafe implementations of methods
86 // so that don't have to do type casting.
88 template<class ArgType, class SubClassName>
89 class TemplateRules : public ConstRules {
92 //===--------------------------------------------------------------------===//
93 // Redirecting functions that cast to the appropriate types
94 //===--------------------------------------------------------------------===//
96 virtual Constant *add(const Constant *V1, const Constant *V2) const {
97 return SubClassName::Add((const ArgType *)V1, (const ArgType *)V2);
99 virtual Constant *sub(const Constant *V1, const Constant *V2) const {
100 return SubClassName::Sub((const ArgType *)V1, (const ArgType *)V2);
102 virtual Constant *mul(const Constant *V1, const Constant *V2) const {
103 return SubClassName::Mul((const ArgType *)V1, (const ArgType *)V2);
105 virtual Constant *div(const Constant *V1, const Constant *V2) const {
106 return SubClassName::Div((const ArgType *)V1, (const ArgType *)V2);
108 virtual Constant *rem(const Constant *V1, const Constant *V2) const {
109 return SubClassName::Rem((const ArgType *)V1, (const ArgType *)V2);
111 virtual Constant *op_and(const Constant *V1, const Constant *V2) const {
112 return SubClassName::And((const ArgType *)V1, (const ArgType *)V2);
114 virtual Constant *op_or(const Constant *V1, const Constant *V2) const {
115 return SubClassName::Or((const ArgType *)V1, (const ArgType *)V2);
117 virtual Constant *op_xor(const Constant *V1, const Constant *V2) const {
118 return SubClassName::Xor((const ArgType *)V1, (const ArgType *)V2);
120 virtual Constant *shl(const Constant *V1, const Constant *V2) const {
121 return SubClassName::Shl((const ArgType *)V1, (const ArgType *)V2);
123 virtual Constant *shr(const Constant *V1, const Constant *V2) const {
124 return SubClassName::Shr((const ArgType *)V1, (const ArgType *)V2);
127 virtual Constant *lessthan(const Constant *V1, const Constant *V2) const {
128 return SubClassName::LessThan((const ArgType *)V1, (const ArgType *)V2);
130 virtual Constant *equalto(const Constant *V1, const Constant *V2) const {
131 return SubClassName::EqualTo((const ArgType *)V1, (const ArgType *)V2);
134 // Casting operators. ick
135 virtual Constant *castToBool(const Constant *V) const {
136 return SubClassName::CastToBool((const ArgType*)V);
138 virtual Constant *castToSByte(const Constant *V) const {
139 return SubClassName::CastToSByte((const ArgType*)V);
141 virtual Constant *castToUByte(const Constant *V) const {
142 return SubClassName::CastToUByte((const ArgType*)V);
144 virtual Constant *castToShort(const Constant *V) const {
145 return SubClassName::CastToShort((const ArgType*)V);
147 virtual Constant *castToUShort(const Constant *V) const {
148 return SubClassName::CastToUShort((const ArgType*)V);
150 virtual Constant *castToInt(const Constant *V) const {
151 return SubClassName::CastToInt((const ArgType*)V);
153 virtual Constant *castToUInt(const Constant *V) const {
154 return SubClassName::CastToUInt((const ArgType*)V);
156 virtual Constant *castToLong(const Constant *V) const {
157 return SubClassName::CastToLong((const ArgType*)V);
159 virtual Constant *castToULong(const Constant *V) const {
160 return SubClassName::CastToULong((const ArgType*)V);
162 virtual Constant *castToFloat(const Constant *V) const {
163 return SubClassName::CastToFloat((const ArgType*)V);
165 virtual Constant *castToDouble(const Constant *V) const {
166 return SubClassName::CastToDouble((const ArgType*)V);
168 virtual Constant *castToPointer(const Constant *V,
169 const PointerType *Ty) const {
170 return SubClassName::CastToPointer((const ArgType*)V, Ty);
173 //===--------------------------------------------------------------------===//
174 // Default "noop" implementations
175 //===--------------------------------------------------------------------===//
177 static Constant *Add(const ArgType *V1, const ArgType *V2) { return 0; }
178 static Constant *Sub(const ArgType *V1, const ArgType *V2) { return 0; }
179 static Constant *Mul(const ArgType *V1, const ArgType *V2) { return 0; }
180 static Constant *Div(const ArgType *V1, const ArgType *V2) { return 0; }
181 static Constant *Rem(const ArgType *V1, const ArgType *V2) { return 0; }
182 static Constant *And(const ArgType *V1, const ArgType *V2) { return 0; }
183 static Constant *Or (const ArgType *V1, const ArgType *V2) { return 0; }
184 static Constant *Xor(const ArgType *V1, const ArgType *V2) { return 0; }
185 static Constant *Shl(const ArgType *V1, const ArgType *V2) { return 0; }
186 static Constant *Shr(const ArgType *V1, const ArgType *V2) { return 0; }
187 static Constant *LessThan(const ArgType *V1, const ArgType *V2) {
190 static Constant *EqualTo(const ArgType *V1, const ArgType *V2) {
194 // Casting operators. ick
195 static Constant *CastToBool (const Constant *V) { return 0; }
196 static Constant *CastToSByte (const Constant *V) { return 0; }
197 static Constant *CastToUByte (const Constant *V) { return 0; }
198 static Constant *CastToShort (const Constant *V) { return 0; }
199 static Constant *CastToUShort(const Constant *V) { return 0; }
200 static Constant *CastToInt (const Constant *V) { return 0; }
201 static Constant *CastToUInt (const Constant *V) { return 0; }
202 static Constant *CastToLong (const Constant *V) { return 0; }
203 static Constant *CastToULong (const Constant *V) { return 0; }
204 static Constant *CastToFloat (const Constant *V) { return 0; }
205 static Constant *CastToDouble(const Constant *V) { return 0; }
206 static Constant *CastToPointer(const Constant *,
207 const PointerType *) {return 0;}
210 virtual ~TemplateRules() {}
215 //===----------------------------------------------------------------------===//
217 //===----------------------------------------------------------------------===//
219 // EmptyRules provides a concrete base class of ConstRules that does nothing
221 struct EmptyRules : public TemplateRules<Constant, EmptyRules> {
222 static Constant *EqualTo(const Constant *V1, const Constant *V2) {
223 if (V1 == V2) return ConstantBool::True;
230 //===----------------------------------------------------------------------===//
232 //===----------------------------------------------------------------------===//
234 // BoolRules provides a concrete base class of ConstRules for the 'bool' type.
236 struct BoolRules : public TemplateRules<ConstantBool, BoolRules> {
238 static Constant *LessThan(const ConstantBool *V1, const ConstantBool *V2) {
239 return ConstantBool::get(V1->getValue() < V2->getValue());
242 static Constant *EqualTo(const Constant *V1, const Constant *V2) {
243 return ConstantBool::get(V1 == V2);
246 static Constant *And(const ConstantBool *V1, const ConstantBool *V2) {
247 return ConstantBool::get(V1->getValue() & V2->getValue());
250 static Constant *Or(const ConstantBool *V1, const ConstantBool *V2) {
251 return ConstantBool::get(V1->getValue() | V2->getValue());
254 static Constant *Xor(const ConstantBool *V1, const ConstantBool *V2) {
255 return ConstantBool::get(V1->getValue() ^ V2->getValue());
258 // Casting operators. ick
259 #define DEF_CAST(TYPE, CLASS, CTYPE) \
260 static Constant *CastTo##TYPE (const ConstantBool *V) { \
261 return CLASS::get(Type::TYPE##Ty, (CTYPE)(bool)V->getValue()); \
264 DEF_CAST(Bool , ConstantBool, bool)
265 DEF_CAST(SByte , ConstantSInt, signed char)
266 DEF_CAST(UByte , ConstantUInt, unsigned char)
267 DEF_CAST(Short , ConstantSInt, signed short)
268 DEF_CAST(UShort, ConstantUInt, unsigned short)
269 DEF_CAST(Int , ConstantSInt, signed int)
270 DEF_CAST(UInt , ConstantUInt, unsigned int)
271 DEF_CAST(Long , ConstantSInt, int64_t)
272 DEF_CAST(ULong , ConstantUInt, uint64_t)
273 DEF_CAST(Float , ConstantFP , float)
274 DEF_CAST(Double, ConstantFP , double)
279 //===----------------------------------------------------------------------===//
280 // NullPointerRules Class
281 //===----------------------------------------------------------------------===//
283 // NullPointerRules provides a concrete base class of ConstRules for null
286 struct NullPointerRules : public TemplateRules<ConstantPointerNull,
288 static Constant *EqualTo(const Constant *V1, const Constant *V2) {
289 return ConstantBool::True; // Null pointers are always equal
291 static Constant *CastToBool(const Constant *V) {
292 return ConstantBool::False;
294 static Constant *CastToSByte (const Constant *V) {
295 return ConstantSInt::get(Type::SByteTy, 0);
297 static Constant *CastToUByte (const Constant *V) {
298 return ConstantUInt::get(Type::UByteTy, 0);
300 static Constant *CastToShort (const Constant *V) {
301 return ConstantSInt::get(Type::ShortTy, 0);
303 static Constant *CastToUShort(const Constant *V) {
304 return ConstantUInt::get(Type::UShortTy, 0);
306 static Constant *CastToInt (const Constant *V) {
307 return ConstantSInt::get(Type::IntTy, 0);
309 static Constant *CastToUInt (const Constant *V) {
310 return ConstantUInt::get(Type::UIntTy, 0);
312 static Constant *CastToLong (const Constant *V) {
313 return ConstantSInt::get(Type::LongTy, 0);
315 static Constant *CastToULong (const Constant *V) {
316 return ConstantUInt::get(Type::ULongTy, 0);
318 static Constant *CastToFloat (const Constant *V) {
319 return ConstantFP::get(Type::FloatTy, 0);
321 static Constant *CastToDouble(const Constant *V) {
322 return ConstantFP::get(Type::DoubleTy, 0);
325 static Constant *CastToPointer(const ConstantPointerNull *V,
326 const PointerType *PTy) {
327 return ConstantPointerNull::get(PTy);
331 //===----------------------------------------------------------------------===//
332 // ConstantPackedRules Class
333 //===----------------------------------------------------------------------===//
335 /// DoVectorOp - Given two packed constants and a function pointer, apply the
336 /// function pointer to each element pair, producing a new ConstantPacked
338 static Constant *EvalVectorOp(const ConstantPacked *V1,
339 const ConstantPacked *V2,
340 Constant *(*FP)(Constant*, Constant*)) {
341 std::vector<Constant*> Res;
342 for (unsigned i = 0, e = V1->getNumOperands(); i != e; ++i)
343 Res.push_back(FP(const_cast<Constant*>(V1->getOperand(i)),
344 const_cast<Constant*>(V2->getOperand(i))));
345 return ConstantPacked::get(Res);
348 /// PackedTypeRules provides a concrete base class of ConstRules for
349 /// ConstantPacked operands.
351 struct ConstantPackedRules
352 : public TemplateRules<ConstantPacked, ConstantPackedRules> {
354 static Constant *Add(const ConstantPacked *V1, const ConstantPacked *V2) {
355 return EvalVectorOp(V1, V2, ConstantExpr::getAdd);
357 static Constant *Sub(const ConstantPacked *V1, const ConstantPacked *V2) {
358 return EvalVectorOp(V1, V2, ConstantExpr::getSub);
360 static Constant *Mul(const ConstantPacked *V1, const ConstantPacked *V2) {
361 return EvalVectorOp(V1, V2, ConstantExpr::getMul);
363 static Constant *Div(const ConstantPacked *V1, const ConstantPacked *V2) {
364 return EvalVectorOp(V1, V2, ConstantExpr::getDiv);
366 static Constant *Rem(const ConstantPacked *V1, const ConstantPacked *V2) {
367 return EvalVectorOp(V1, V2, ConstantExpr::getRem);
369 static Constant *And(const ConstantPacked *V1, const ConstantPacked *V2) {
370 return EvalVectorOp(V1, V2, ConstantExpr::getAnd);
372 static Constant *Or (const ConstantPacked *V1, const ConstantPacked *V2) {
373 return EvalVectorOp(V1, V2, ConstantExpr::getOr);
375 static Constant *Xor(const ConstantPacked *V1, const ConstantPacked *V2) {
376 return EvalVectorOp(V1, V2, ConstantExpr::getXor);
378 static Constant *Shl(const ConstantPacked *V1, const ConstantPacked *V2) {
379 return EvalVectorOp(V1, V2, ConstantExpr::getShl);
381 static Constant *Shr(const ConstantPacked *V1, const ConstantPacked *V2) {
382 return EvalVectorOp(V1, V2, ConstantExpr::getShr);
384 static Constant *LessThan(const ConstantPacked *V1, const ConstantPacked *V2){
387 static Constant *EqualTo(const ConstantPacked *V1, const ConstantPacked *V2) {
388 for (unsigned i = 0, e = V1->getNumOperands(); i != e; ++i) {
390 ConstantExpr::getSetEQ(const_cast<Constant*>(V1->getOperand(i)),
391 const_cast<Constant*>(V2->getOperand(i)));
392 if (ConstantBool *CB = dyn_cast<ConstantBool>(C))
395 // Otherwise, could not decide from any element pairs.
401 //===----------------------------------------------------------------------===//
402 // GeneralPackedRules Class
403 //===----------------------------------------------------------------------===//
405 /// GeneralPackedRules provides a concrete base class of ConstRules for
406 /// PackedType operands, where both operands are not ConstantPacked. The usual
407 /// cause for this is that one operand is a ConstantAggregateZero.
409 struct GeneralPackedRules : public TemplateRules<Constant, GeneralPackedRules> {
413 //===----------------------------------------------------------------------===//
415 //===----------------------------------------------------------------------===//
417 // DirectRules provides a concrete base classes of ConstRules for a variety of
418 // different types. This allows the C++ compiler to automatically generate our
419 // constant handling operations in a typesafe and accurate manner.
421 template<class ConstantClass, class BuiltinType, Type **Ty, class SuperClass>
422 struct DirectRules : public TemplateRules<ConstantClass, SuperClass> {
423 static Constant *Add(const ConstantClass *V1, const ConstantClass *V2) {
424 BuiltinType R = (BuiltinType)V1->getValue() + (BuiltinType)V2->getValue();
425 return ConstantClass::get(*Ty, R);
428 static Constant *Sub(const ConstantClass *V1, const ConstantClass *V2) {
429 BuiltinType R = (BuiltinType)V1->getValue() - (BuiltinType)V2->getValue();
430 return ConstantClass::get(*Ty, R);
433 static Constant *Mul(const ConstantClass *V1, const ConstantClass *V2) {
434 BuiltinType R = (BuiltinType)V1->getValue() * (BuiltinType)V2->getValue();
435 return ConstantClass::get(*Ty, R);
438 static Constant *Div(const ConstantClass *V1, const ConstantClass *V2) {
439 if (V2->isNullValue()) return 0;
440 BuiltinType R = (BuiltinType)V1->getValue() / (BuiltinType)V2->getValue();
441 return ConstantClass::get(*Ty, R);
444 static Constant *LessThan(const ConstantClass *V1, const ConstantClass *V2) {
445 bool R = (BuiltinType)V1->getValue() < (BuiltinType)V2->getValue();
446 return ConstantBool::get(R);
449 static Constant *EqualTo(const ConstantClass *V1, const ConstantClass *V2) {
450 bool R = (BuiltinType)V1->getValue() == (BuiltinType)V2->getValue();
451 return ConstantBool::get(R);
454 static Constant *CastToPointer(const ConstantClass *V,
455 const PointerType *PTy) {
456 if (V->isNullValue()) // Is it a FP or Integral null value?
457 return ConstantPointerNull::get(PTy);
458 return 0; // Can't const prop other types of pointers
461 // Casting operators. ick
462 #define DEF_CAST(TYPE, CLASS, CTYPE) \
463 static Constant *CastTo##TYPE (const ConstantClass *V) { \
464 return CLASS::get(Type::TYPE##Ty, (CTYPE)(BuiltinType)V->getValue()); \
467 DEF_CAST(Bool , ConstantBool, bool)
468 DEF_CAST(SByte , ConstantSInt, signed char)
469 DEF_CAST(UByte , ConstantUInt, unsigned char)
470 DEF_CAST(Short , ConstantSInt, signed short)
471 DEF_CAST(UShort, ConstantUInt, unsigned short)
472 DEF_CAST(Int , ConstantSInt, signed int)
473 DEF_CAST(UInt , ConstantUInt, unsigned int)
474 DEF_CAST(Long , ConstantSInt, int64_t)
475 DEF_CAST(ULong , ConstantUInt, uint64_t)
476 DEF_CAST(Float , ConstantFP , float)
477 DEF_CAST(Double, ConstantFP , double)
482 //===----------------------------------------------------------------------===//
483 // DirectIntRules Class
484 //===----------------------------------------------------------------------===//
486 // DirectIntRules provides implementations of functions that are valid on
487 // integer types, but not all types in general.
489 template <class ConstantClass, class BuiltinType, Type **Ty>
490 struct DirectIntRules
491 : public DirectRules<ConstantClass, BuiltinType, Ty,
492 DirectIntRules<ConstantClass, BuiltinType, Ty> > {
494 static Constant *Div(const ConstantClass *V1, const ConstantClass *V2) {
495 if (V2->isNullValue()) return 0;
496 if (V2->isAllOnesValue() && // MIN_INT / -1
497 (BuiltinType)V1->getValue() == -(BuiltinType)V1->getValue())
499 BuiltinType R = (BuiltinType)V1->getValue() / (BuiltinType)V2->getValue();
500 return ConstantClass::get(*Ty, R);
503 static Constant *Rem(const ConstantClass *V1,
504 const ConstantClass *V2) {
505 if (V2->isNullValue()) return 0; // X / 0
506 if (V2->isAllOnesValue() && // MIN_INT / -1
507 (BuiltinType)V1->getValue() == -(BuiltinType)V1->getValue())
509 BuiltinType R = (BuiltinType)V1->getValue() % (BuiltinType)V2->getValue();
510 return ConstantClass::get(*Ty, R);
513 static Constant *And(const ConstantClass *V1, const ConstantClass *V2) {
514 BuiltinType R = (BuiltinType)V1->getValue() & (BuiltinType)V2->getValue();
515 return ConstantClass::get(*Ty, R);
517 static Constant *Or(const ConstantClass *V1, const ConstantClass *V2) {
518 BuiltinType R = (BuiltinType)V1->getValue() | (BuiltinType)V2->getValue();
519 return ConstantClass::get(*Ty, R);
521 static Constant *Xor(const ConstantClass *V1, const ConstantClass *V2) {
522 BuiltinType R = (BuiltinType)V1->getValue() ^ (BuiltinType)V2->getValue();
523 return ConstantClass::get(*Ty, R);
526 static Constant *Shl(const ConstantClass *V1, const ConstantClass *V2) {
527 BuiltinType R = (BuiltinType)V1->getValue() << (BuiltinType)V2->getValue();
528 return ConstantClass::get(*Ty, R);
531 static Constant *Shr(const ConstantClass *V1, const ConstantClass *V2) {
532 BuiltinType R = (BuiltinType)V1->getValue() >> (BuiltinType)V2->getValue();
533 return ConstantClass::get(*Ty, R);
538 //===----------------------------------------------------------------------===//
539 // DirectFPRules Class
540 //===----------------------------------------------------------------------===//
542 /// DirectFPRules provides implementations of functions that are valid on
543 /// floating point types, but not all types in general.
545 template <class ConstantClass, class BuiltinType, Type **Ty>
547 : public DirectRules<ConstantClass, BuiltinType, Ty,
548 DirectFPRules<ConstantClass, BuiltinType, Ty> > {
549 static Constant *Rem(const ConstantClass *V1, const ConstantClass *V2) {
550 if (V2->isNullValue()) return 0;
551 BuiltinType Result = std::fmod((BuiltinType)V1->getValue(),
552 (BuiltinType)V2->getValue());
553 return ConstantClass::get(*Ty, Result);
555 static Constant *Div(const ConstantClass *V1, const ConstantClass *V2) {
556 BuiltinType inf = std::numeric_limits<BuiltinType>::infinity();
557 if (V2->isExactlyValue(0.0)) return ConstantClass::get(*Ty, inf);
558 if (V2->isExactlyValue(-0.0)) return ConstantClass::get(*Ty, -inf);
559 BuiltinType R = (BuiltinType)V1->getValue() / (BuiltinType)V2->getValue();
560 return ConstantClass::get(*Ty, R);
565 /// ConstRules::get - This method returns the constant rules implementation that
566 /// implements the semantics of the two specified constants.
567 ConstRules &ConstRules::get(const Constant *V1, const Constant *V2) {
568 static EmptyRules EmptyR;
569 static BoolRules BoolR;
570 static NullPointerRules NullPointerR;
571 static ConstantPackedRules ConstantPackedR;
572 static GeneralPackedRules GeneralPackedR;
573 static DirectIntRules<ConstantSInt, signed char , &Type::SByteTy> SByteR;
574 static DirectIntRules<ConstantUInt, unsigned char , &Type::UByteTy> UByteR;
575 static DirectIntRules<ConstantSInt, signed short, &Type::ShortTy> ShortR;
576 static DirectIntRules<ConstantUInt, unsigned short, &Type::UShortTy> UShortR;
577 static DirectIntRules<ConstantSInt, signed int , &Type::IntTy> IntR;
578 static DirectIntRules<ConstantUInt, unsigned int , &Type::UIntTy> UIntR;
579 static DirectIntRules<ConstantSInt, int64_t , &Type::LongTy> LongR;
580 static DirectIntRules<ConstantUInt, uint64_t , &Type::ULongTy> ULongR;
581 static DirectFPRules <ConstantFP , float , &Type::FloatTy> FloatR;
582 static DirectFPRules <ConstantFP , double , &Type::DoubleTy> DoubleR;
584 if (isa<ConstantExpr>(V1) || isa<ConstantExpr>(V2) ||
585 isa<GlobalValue>(V1) || isa<GlobalValue>(V2) ||
586 isa<UndefValue>(V1) || isa<UndefValue>(V2))
589 switch (V1->getType()->getTypeID()) {
590 default: assert(0 && "Unknown value type for constant folding!");
591 case Type::BoolTyID: return BoolR;
592 case Type::PointerTyID: return NullPointerR;
593 case Type::SByteTyID: return SByteR;
594 case Type::UByteTyID: return UByteR;
595 case Type::ShortTyID: return ShortR;
596 case Type::UShortTyID: return UShortR;
597 case Type::IntTyID: return IntR;
598 case Type::UIntTyID: return UIntR;
599 case Type::LongTyID: return LongR;
600 case Type::ULongTyID: return ULongR;
601 case Type::FloatTyID: return FloatR;
602 case Type::DoubleTyID: return DoubleR;
603 case Type::PackedTyID:
604 if (isa<ConstantPacked>(V1) && isa<ConstantPacked>(V2))
605 return ConstantPackedR;
606 return GeneralPackedR; // Constant folding rules for ConstantAggregateZero.
611 //===----------------------------------------------------------------------===//
612 // ConstantFold*Instruction Implementations
613 //===----------------------------------------------------------------------===//
615 // These methods contain the special case hackery required to symbolically
616 // evaluate some constant expression cases, and use the ConstantRules class to
617 // evaluate normal constants.
619 static unsigned getSize(const Type *Ty) {
620 unsigned S = Ty->getPrimitiveSize();
621 return S ? S : 8; // Treat pointers at 8 bytes
624 Constant *llvm::ConstantFoldCastInstruction(const Constant *V,
625 const Type *DestTy) {
626 if (V->getType() == DestTy) return (Constant*)V;
628 // Cast of a global address to boolean is always true.
629 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
630 if (DestTy == Type::BoolTy)
631 // FIXME: When we support 'external weak' references, we have to prevent
632 // this transformation from happening. This code will need to be updated
633 // to ignore external weak symbols when we support it.
634 return ConstantBool::True;
635 } else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
636 if (CE->getOpcode() == Instruction::Cast) {
637 Constant *Op = const_cast<Constant*>(CE->getOperand(0));
638 // Try to not produce a cast of a cast, which is almost always redundant.
639 if (!Op->getType()->isFloatingPoint() &&
640 !CE->getType()->isFloatingPoint() &&
641 !DestTy->isFloatingPoint()) {
642 unsigned S1 = getSize(Op->getType()), S2 = getSize(CE->getType());
643 unsigned S3 = getSize(DestTy);
644 if (Op->getType() == DestTy && S3 >= S2)
646 if (S1 >= S2 && S2 >= S3)
647 return ConstantExpr::getCast(Op, DestTy);
648 if (S1 <= S2 && S2 >= S3 && S1 <= S3)
649 return ConstantExpr::getCast(Op, DestTy);
651 } else if (CE->getOpcode() == Instruction::GetElementPtr) {
652 // If all of the indexes in the GEP are null values, there is no pointer
653 // adjustment going on. We might as well cast the source pointer.
654 bool isAllNull = true;
655 for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
656 if (!CE->getOperand(i)->isNullValue()) {
661 return ConstantExpr::getCast(CE->getOperand(0), DestTy);
663 } else if (isa<UndefValue>(V)) {
664 return UndefValue::get(DestTy);
667 // Check to see if we are casting an pointer to an aggregate to a pointer to
668 // the first element. If so, return the appropriate GEP instruction.
669 if (const PointerType *PTy = dyn_cast<PointerType>(V->getType()))
670 if (const PointerType *DPTy = dyn_cast<PointerType>(DestTy)) {
671 std::vector<Value*> IdxList;
672 IdxList.push_back(Constant::getNullValue(Type::IntTy));
673 const Type *ElTy = PTy->getElementType();
674 while (ElTy != DPTy->getElementType()) {
675 if (const StructType *STy = dyn_cast<StructType>(ElTy)) {
676 if (STy->getNumElements() == 0) break;
677 ElTy = STy->getElementType(0);
678 IdxList.push_back(Constant::getNullValue(Type::UIntTy));
679 } else if (const SequentialType *STy = dyn_cast<SequentialType>(ElTy)) {
680 if (isa<PointerType>(ElTy)) break; // Can't index into pointers!
681 ElTy = STy->getElementType();
682 IdxList.push_back(IdxList[0]);
688 if (ElTy == DPTy->getElementType())
689 return ConstantExpr::getGetElementPtr(const_cast<Constant*>(V),IdxList);
692 ConstRules &Rules = ConstRules::get(V, V);
694 switch (DestTy->getTypeID()) {
695 case Type::BoolTyID: return Rules.castToBool(V);
696 case Type::UByteTyID: return Rules.castToUByte(V);
697 case Type::SByteTyID: return Rules.castToSByte(V);
698 case Type::UShortTyID: return Rules.castToUShort(V);
699 case Type::ShortTyID: return Rules.castToShort(V);
700 case Type::UIntTyID: return Rules.castToUInt(V);
701 case Type::IntTyID: return Rules.castToInt(V);
702 case Type::ULongTyID: return Rules.castToULong(V);
703 case Type::LongTyID: return Rules.castToLong(V);
704 case Type::FloatTyID: return Rules.castToFloat(V);
705 case Type::DoubleTyID: return Rules.castToDouble(V);
706 case Type::PointerTyID:
707 return Rules.castToPointer(V, cast<PointerType>(DestTy));
712 Constant *llvm::ConstantFoldSelectInstruction(const Constant *Cond,
714 const Constant *V2) {
715 if (Cond == ConstantBool::True)
716 return const_cast<Constant*>(V1);
717 else if (Cond == ConstantBool::False)
718 return const_cast<Constant*>(V2);
720 if (isa<UndefValue>(V1)) return const_cast<Constant*>(V2);
721 if (isa<UndefValue>(V2)) return const_cast<Constant*>(V1);
722 if (isa<UndefValue>(Cond)) return const_cast<Constant*>(V1);
723 if (V1 == V2) return const_cast<Constant*>(V1);
727 Constant *llvm::ConstantFoldExtractElementInstruction(const Constant *Val,
728 const Constant *Idx) {
729 if (isa<UndefValue>(Val)) // ee(undef, x) -> undef
730 return UndefValue::get(cast<PackedType>(Val->getType())->getElementType());
732 if (const ConstantPacked *CVal = dyn_cast<ConstantPacked>(Val)) {
733 if (const ConstantUInt *CIdx = dyn_cast<ConstantUInt>(Idx)) {
734 return const_cast<Constant*>(CVal->getOperand(CIdx->getValue()));
735 } else if (isa<UndefValue>(Idx)) {
736 // ee({w,x,y,z}, undef) -> w (an arbitrary value).
737 return const_cast<Constant*>(CVal->getOperand(0));
743 Constant *llvm::ConstantFoldInsertElementInstruction(const Constant *Val,
745 const Constant *Idx) {
746 const ConstantUInt *CIdx = dyn_cast<ConstantUInt>(Idx);
748 unsigned idxVal = CIdx->getValue();
749 if (const UndefValue *UVal = dyn_cast<UndefValue>(Val)) {
750 // Insertion of scalar constant into packed undef
751 // Optimize away insertion of undef
752 if (isa<UndefValue>(Elt))
753 return const_cast<Constant*>(Val);
754 // Otherwise break the aggregate undef into multiple undefs and do
757 cast<PackedType>(Val->getType())->getNumElements();
758 std::vector<Constant*> Ops;
760 for (unsigned i = 0; i < numOps; ++i) {
762 (i == idxVal) ? Elt : UndefValue::get(Elt->getType());
763 Ops.push_back(const_cast<Constant*>(Op));
765 return ConstantPacked::get(Ops);
767 if (const ConstantAggregateZero *CVal =
768 dyn_cast<ConstantAggregateZero>(Val)) {
769 // Insertion of scalar constant into packed aggregate zero
770 // Optimize away insertion of zero
771 if (Elt->isNullValue())
772 return const_cast<Constant*>(Val);
773 // Otherwise break the aggregate zero into multiple zeros and do
776 cast<PackedType>(Val->getType())->getNumElements();
777 std::vector<Constant*> Ops;
779 for (unsigned i = 0; i < numOps; ++i) {
781 (i == idxVal) ? Elt : Constant::getNullValue(Elt->getType());
782 Ops.push_back(const_cast<Constant*>(Op));
784 return ConstantPacked::get(Ops);
786 if (const ConstantPacked *CVal = dyn_cast<ConstantPacked>(Val)) {
787 // Insertion of scalar constant into packed constant
788 std::vector<Constant*> Ops;
789 Ops.reserve(CVal->getNumOperands());
790 for (unsigned i = 0; i < CVal->getNumOperands(); ++i) {
792 (i == idxVal) ? Elt : cast<Constant>(CVal->getOperand(i));
793 Ops.push_back(const_cast<Constant*>(Op));
795 return ConstantPacked::get(Ops);
800 /// isZeroSizedType - This type is zero sized if its an array or structure of
801 /// zero sized types. The only leaf zero sized type is an empty structure.
802 static bool isMaybeZeroSizedType(const Type *Ty) {
803 if (isa<OpaqueType>(Ty)) return true; // Can't say.
804 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
806 // If all of elements have zero size, this does too.
807 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
808 if (!isMaybeZeroSizedType(STy->getElementType(i))) return false;
811 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
812 return isMaybeZeroSizedType(ATy->getElementType());
817 /// IdxCompare - Compare the two constants as though they were getelementptr
818 /// indices. This allows coersion of the types to be the same thing.
820 /// If the two constants are the "same" (after coersion), return 0. If the
821 /// first is less than the second, return -1, if the second is less than the
822 /// first, return 1. If the constants are not integral, return -2.
824 static int IdxCompare(Constant *C1, Constant *C2, const Type *ElTy) {
825 if (C1 == C2) return 0;
827 // Ok, we found a different index. Are either of the operands
828 // ConstantExprs? If so, we can't do anything with them.
829 if (!isa<ConstantInt>(C1) || !isa<ConstantInt>(C2))
830 return -2; // don't know!
832 // Ok, we have two differing integer indices. Sign extend them to be the same
833 // type. Long is always big enough, so we use it.
834 C1 = ConstantExpr::getSignExtend(C1, Type::LongTy);
835 C2 = ConstantExpr::getSignExtend(C2, Type::LongTy);
836 if (C1 == C2) return 0; // Are they just differing types?
838 // If the type being indexed over is really just a zero sized type, there is
839 // no pointer difference being made here.
840 if (isMaybeZeroSizedType(ElTy))
843 // If they are really different, now that they are the same type, then we
844 // found a difference!
845 if (cast<ConstantSInt>(C1)->getValue() < cast<ConstantSInt>(C2)->getValue())
851 /// evaluateRelation - This function determines if there is anything we can
852 /// decide about the two constants provided. This doesn't need to handle simple
853 /// things like integer comparisons, but should instead handle ConstantExprs
854 /// and GlobalValuess. If we can determine that the two constants have a
855 /// particular relation to each other, we should return the corresponding SetCC
856 /// code, otherwise return Instruction::BinaryOpsEnd.
858 /// To simplify this code we canonicalize the relation so that the first
859 /// operand is always the most "complex" of the two. We consider simple
860 /// constants (like ConstantInt) to be the simplest, followed by
861 /// GlobalValues, followed by ConstantExpr's (the most complex).
863 static Instruction::BinaryOps evaluateRelation(Constant *V1, Constant *V2) {
864 assert(V1->getType() == V2->getType() &&
865 "Cannot compare different types of values!");
866 if (V1 == V2) return Instruction::SetEQ;
868 if (!isa<ConstantExpr>(V1) && !isa<GlobalValue>(V1)) {
869 if (!isa<GlobalValue>(V2) && !isa<ConstantExpr>(V2)) {
870 // We distilled this down to a simple case, use the standard constant
872 ConstantBool *R = dyn_cast<ConstantBool>(ConstantExpr::getSetEQ(V1, V2));
873 if (R == ConstantBool::True) return Instruction::SetEQ;
874 R = dyn_cast<ConstantBool>(ConstantExpr::getSetLT(V1, V2));
875 if (R == ConstantBool::True) return Instruction::SetLT;
876 R = dyn_cast<ConstantBool>(ConstantExpr::getSetGT(V1, V2));
877 if (R == ConstantBool::True) return Instruction::SetGT;
879 // If we couldn't figure it out, bail.
880 return Instruction::BinaryOpsEnd;
883 // If the first operand is simple, swap operands.
884 Instruction::BinaryOps SwappedRelation = evaluateRelation(V2, V1);
885 if (SwappedRelation != Instruction::BinaryOpsEnd)
886 return SetCondInst::getSwappedCondition(SwappedRelation);
888 } else if (const GlobalValue *CPR1 = dyn_cast<GlobalValue>(V1)) {
889 if (isa<ConstantExpr>(V2)) { // Swap as necessary.
890 Instruction::BinaryOps SwappedRelation = evaluateRelation(V2, V1);
891 if (SwappedRelation != Instruction::BinaryOpsEnd)
892 return SetCondInst::getSwappedCondition(SwappedRelation);
894 return Instruction::BinaryOpsEnd;
897 // Now we know that the RHS is a GlobalValue or simple constant,
898 // which (since the types must match) means that it's a ConstantPointerNull.
899 if (const GlobalValue *CPR2 = dyn_cast<GlobalValue>(V2)) {
900 assert(CPR1 != CPR2 &&
901 "GVs for the same value exist at different addresses??");
902 // FIXME: If both globals are external weak, they might both be null!
903 return Instruction::SetNE;
905 assert(isa<ConstantPointerNull>(V2) && "Canonicalization guarantee!");
906 // Global can never be null. FIXME: if we implement external weak
907 // linkage, this is not necessarily true!
908 return Instruction::SetNE;
912 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a
913 // constantexpr, a CPR, or a simple constant.
914 ConstantExpr *CE1 = cast<ConstantExpr>(V1);
915 Constant *CE1Op0 = CE1->getOperand(0);
917 switch (CE1->getOpcode()) {
918 case Instruction::Cast:
919 // If the cast is not actually changing bits, and the second operand is a
920 // null pointer, do the comparison with the pre-casted value.
921 if (V2->isNullValue() &&
922 (isa<PointerType>(CE1->getType()) || CE1->getType()->isIntegral()))
923 return evaluateRelation(CE1Op0,
924 Constant::getNullValue(CE1Op0->getType()));
926 // If the dest type is a pointer type, and the RHS is a constantexpr cast
927 // from the same type as the src of the LHS, evaluate the inputs. This is
928 // important for things like "seteq (cast 4 to int*), (cast 5 to int*)",
929 // which happens a lot in compilers with tagged integers.
930 if (ConstantExpr *CE2 = dyn_cast<ConstantExpr>(V2))
931 if (isa<PointerType>(CE1->getType()) &&
932 CE2->getOpcode() == Instruction::Cast &&
933 CE1->getOperand(0)->getType() == CE2->getOperand(0)->getType() &&
934 CE1->getOperand(0)->getType()->isIntegral()) {
935 return evaluateRelation(CE1->getOperand(0), CE2->getOperand(0));
939 case Instruction::GetElementPtr:
940 // Ok, since this is a getelementptr, we know that the constant has a
941 // pointer type. Check the various cases.
942 if (isa<ConstantPointerNull>(V2)) {
943 // If we are comparing a GEP to a null pointer, check to see if the base
944 // of the GEP equals the null pointer.
945 if (isa<GlobalValue>(CE1Op0)) {
946 // FIXME: this is not true when we have external weak references!
947 // No offset can go from a global to a null pointer.
948 return Instruction::SetGT;
949 } else if (isa<ConstantPointerNull>(CE1Op0)) {
950 // If we are indexing from a null pointer, check to see if we have any
952 for (unsigned i = 1, e = CE1->getNumOperands(); i != e; ++i)
953 if (!CE1->getOperand(i)->isNullValue())
954 // Offsetting from null, must not be equal.
955 return Instruction::SetGT;
956 // Only zero indexes from null, must still be zero.
957 return Instruction::SetEQ;
959 // Otherwise, we can't really say if the first operand is null or not.
960 } else if (const GlobalValue *CPR2 = dyn_cast<GlobalValue>(V2)) {
961 if (isa<ConstantPointerNull>(CE1Op0)) {
962 // FIXME: This is not true with external weak references.
963 return Instruction::SetLT;
964 } else if (const GlobalValue *CPR1 = dyn_cast<GlobalValue>(CE1Op0)) {
966 // If this is a getelementptr of the same global, then it must be
967 // different. Because the types must match, the getelementptr could
968 // only have at most one index, and because we fold getelementptr's
969 // with a single zero index, it must be nonzero.
970 assert(CE1->getNumOperands() == 2 &&
971 !CE1->getOperand(1)->isNullValue() &&
972 "Suprising getelementptr!");
973 return Instruction::SetGT;
975 // If they are different globals, we don't know what the value is,
976 // but they can't be equal.
977 return Instruction::SetNE;
981 const ConstantExpr *CE2 = cast<ConstantExpr>(V2);
982 const Constant *CE2Op0 = CE2->getOperand(0);
984 // There are MANY other foldings that we could perform here. They will
985 // probably be added on demand, as they seem needed.
986 switch (CE2->getOpcode()) {
988 case Instruction::GetElementPtr:
989 // By far the most common case to handle is when the base pointers are
990 // obviously to the same or different globals.
991 if (isa<GlobalValue>(CE1Op0) && isa<GlobalValue>(CE2Op0)) {
992 if (CE1Op0 != CE2Op0) // Don't know relative ordering, but not equal
993 return Instruction::SetNE;
994 // Ok, we know that both getelementptr instructions are based on the
995 // same global. From this, we can precisely determine the relative
996 // ordering of the resultant pointers.
999 // Compare all of the operands the GEP's have in common.
1000 gep_type_iterator GTI = gep_type_begin(CE1);
1001 for (;i != CE1->getNumOperands() && i != CE2->getNumOperands();
1003 switch (IdxCompare(CE1->getOperand(i), CE2->getOperand(i),
1004 GTI.getIndexedType())) {
1005 case -1: return Instruction::SetLT;
1006 case 1: return Instruction::SetGT;
1007 case -2: return Instruction::BinaryOpsEnd;
1010 // Ok, we ran out of things they have in common. If any leftovers
1011 // are non-zero then we have a difference, otherwise we are equal.
1012 for (; i < CE1->getNumOperands(); ++i)
1013 if (!CE1->getOperand(i)->isNullValue())
1014 if (isa<ConstantIntegral>(CE1->getOperand(i)))
1015 return Instruction::SetGT;
1017 return Instruction::BinaryOpsEnd; // Might be equal.
1019 for (; i < CE2->getNumOperands(); ++i)
1020 if (!CE2->getOperand(i)->isNullValue())
1021 if (isa<ConstantIntegral>(CE2->getOperand(i)))
1022 return Instruction::SetLT;
1024 return Instruction::BinaryOpsEnd; // Might be equal.
1025 return Instruction::SetEQ;
1035 return Instruction::BinaryOpsEnd;
1038 Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode,
1040 const Constant *V2) {
1044 case Instruction::Add: C = ConstRules::get(V1, V2).add(V1, V2); break;
1045 case Instruction::Sub: C = ConstRules::get(V1, V2).sub(V1, V2); break;
1046 case Instruction::Mul: C = ConstRules::get(V1, V2).mul(V1, V2); break;
1047 case Instruction::Div: C = ConstRules::get(V1, V2).div(V1, V2); break;
1048 case Instruction::Rem: C = ConstRules::get(V1, V2).rem(V1, V2); break;
1049 case Instruction::And: C = ConstRules::get(V1, V2).op_and(V1, V2); break;
1050 case Instruction::Or: C = ConstRules::get(V1, V2).op_or (V1, V2); break;
1051 case Instruction::Xor: C = ConstRules::get(V1, V2).op_xor(V1, V2); break;
1052 case Instruction::Shl: C = ConstRules::get(V1, V2).shl(V1, V2); break;
1053 case Instruction::Shr: C = ConstRules::get(V1, V2).shr(V1, V2); break;
1054 case Instruction::SetEQ: C = ConstRules::get(V1, V2).equalto(V1, V2); break;
1055 case Instruction::SetLT: C = ConstRules::get(V1, V2).lessthan(V1, V2);break;
1056 case Instruction::SetGT: C = ConstRules::get(V1, V2).lessthan(V2, V1);break;
1057 case Instruction::SetNE: // V1 != V2 === !(V1 == V2)
1058 C = ConstRules::get(V1, V2).equalto(V1, V2);
1059 if (C) return ConstantExpr::getNot(C);
1061 case Instruction::SetLE: // V1 <= V2 === !(V2 < V1)
1062 C = ConstRules::get(V1, V2).lessthan(V2, V1);
1063 if (C) return ConstantExpr::getNot(C);
1065 case Instruction::SetGE: // V1 >= V2 === !(V1 < V2)
1066 C = ConstRules::get(V1, V2).lessthan(V1, V2);
1067 if (C) return ConstantExpr::getNot(C);
1071 // If we successfully folded the expression, return it now.
1074 if (SetCondInst::isRelational(Opcode)) {
1075 if (isa<UndefValue>(V1) || isa<UndefValue>(V2))
1076 return UndefValue::get(Type::BoolTy);
1077 switch (evaluateRelation(const_cast<Constant*>(V1),
1078 const_cast<Constant*>(V2))) {
1079 default: assert(0 && "Unknown relational!");
1080 case Instruction::BinaryOpsEnd:
1081 break; // Couldn't determine anything about these constants.
1082 case Instruction::SetEQ: // We know the constants are equal!
1083 // If we know the constants are equal, we can decide the result of this
1084 // computation precisely.
1085 return ConstantBool::get(Opcode == Instruction::SetEQ ||
1086 Opcode == Instruction::SetLE ||
1087 Opcode == Instruction::SetGE);
1088 case Instruction::SetLT:
1089 // If we know that V1 < V2, we can decide the result of this computation
1091 return ConstantBool::get(Opcode == Instruction::SetLT ||
1092 Opcode == Instruction::SetNE ||
1093 Opcode == Instruction::SetLE);
1094 case Instruction::SetGT:
1095 // If we know that V1 > V2, we can decide the result of this computation
1097 return ConstantBool::get(Opcode == Instruction::SetGT ||
1098 Opcode == Instruction::SetNE ||
1099 Opcode == Instruction::SetGE);
1100 case Instruction::SetLE:
1101 // If we know that V1 <= V2, we can only partially decide this relation.
1102 if (Opcode == Instruction::SetGT) return ConstantBool::False;
1103 if (Opcode == Instruction::SetLT) return ConstantBool::True;
1106 case Instruction::SetGE:
1107 // If we know that V1 >= V2, we can only partially decide this relation.
1108 if (Opcode == Instruction::SetLT) return ConstantBool::False;
1109 if (Opcode == Instruction::SetGT) return ConstantBool::True;
1112 case Instruction::SetNE:
1113 // If we know that V1 != V2, we can only partially decide this relation.
1114 if (Opcode == Instruction::SetEQ) return ConstantBool::False;
1115 if (Opcode == Instruction::SetNE) return ConstantBool::True;
1120 if (isa<UndefValue>(V1) || isa<UndefValue>(V2)) {
1122 case Instruction::Add:
1123 case Instruction::Sub:
1124 case Instruction::Xor:
1125 return UndefValue::get(V1->getType());
1127 case Instruction::Mul:
1128 case Instruction::And:
1129 return Constant::getNullValue(V1->getType());
1130 case Instruction::Div:
1131 case Instruction::Rem:
1132 if (!isa<UndefValue>(V2)) // undef/X -> 0
1133 return Constant::getNullValue(V1->getType());
1134 return const_cast<Constant*>(V2); // X/undef -> undef
1135 case Instruction::Or: // X|undef -> -1
1136 return ConstantInt::getAllOnesValue(V1->getType());
1137 case Instruction::Shr:
1138 if (!isa<UndefValue>(V2)) {
1139 if (V1->getType()->isSigned())
1140 return const_cast<Constant*>(V1); // undef >>s X -> undef
1142 } else if (isa<UndefValue>(V1)) {
1143 return const_cast<Constant*>(V1); // undef >> undef -> undef
1145 if (V1->getType()->isSigned())
1146 return const_cast<Constant*>(V1); // X >>s undef -> X
1149 return Constant::getNullValue(V1->getType());
1151 case Instruction::Shl:
1152 // undef << X -> 0 X << undef -> 0
1153 return Constant::getNullValue(V1->getType());
1157 if (const ConstantExpr *CE1 = dyn_cast<ConstantExpr>(V1)) {
1158 if (const ConstantExpr *CE2 = dyn_cast<ConstantExpr>(V2)) {
1159 // There are many possible foldings we could do here. We should probably
1160 // at least fold add of a pointer with an integer into the appropriate
1161 // getelementptr. This will improve alias analysis a bit.
1167 // Just implement a couple of simple identities.
1169 case Instruction::Add:
1170 if (V2->isNullValue()) return const_cast<Constant*>(V1); // X + 0 == X
1172 case Instruction::Sub:
1173 if (V2->isNullValue()) return const_cast<Constant*>(V1); // X - 0 == X
1175 case Instruction::Mul:
1176 if (V2->isNullValue()) return const_cast<Constant*>(V2); // X * 0 == 0
1177 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V2))
1178 if (CI->getRawValue() == 1)
1179 return const_cast<Constant*>(V1); // X * 1 == X
1181 case Instruction::Div:
1182 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V2))
1183 if (CI->getRawValue() == 1)
1184 return const_cast<Constant*>(V1); // X / 1 == X
1186 case Instruction::Rem:
1187 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V2))
1188 if (CI->getRawValue() == 1)
1189 return Constant::getNullValue(CI->getType()); // X % 1 == 0
1191 case Instruction::And:
1192 if (cast<ConstantIntegral>(V2)->isAllOnesValue())
1193 return const_cast<Constant*>(V1); // X & -1 == X
1194 if (V2->isNullValue()) return const_cast<Constant*>(V2); // X & 0 == 0
1195 if (CE1->getOpcode() == Instruction::Cast &&
1196 isa<GlobalValue>(CE1->getOperand(0))) {
1197 GlobalValue *CPR = cast<GlobalValue>(CE1->getOperand(0));
1199 // Functions are at least 4-byte aligned. If and'ing the address of a
1200 // function with a constant < 4, fold it to zero.
1201 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V2))
1202 if (CI->getRawValue() < 4 && isa<Function>(CPR))
1203 return Constant::getNullValue(CI->getType());
1206 case Instruction::Or:
1207 if (V2->isNullValue()) return const_cast<Constant*>(V1); // X | 0 == X
1208 if (cast<ConstantIntegral>(V2)->isAllOnesValue())
1209 return const_cast<Constant*>(V2); // X | -1 == -1
1211 case Instruction::Xor:
1212 if (V2->isNullValue()) return const_cast<Constant*>(V1); // X ^ 0 == X
1217 } else if (const ConstantExpr *CE2 = dyn_cast<ConstantExpr>(V2)) {
1218 // If V2 is a constant expr and V1 isn't, flop them around and fold the
1219 // other way if possible.
1221 case Instruction::Add:
1222 case Instruction::Mul:
1223 case Instruction::And:
1224 case Instruction::Or:
1225 case Instruction::Xor:
1226 case Instruction::SetEQ:
1227 case Instruction::SetNE:
1228 // No change of opcode required.
1229 return ConstantFoldBinaryInstruction(Opcode, V2, V1);
1231 case Instruction::SetLT:
1232 case Instruction::SetGT:
1233 case Instruction::SetLE:
1234 case Instruction::SetGE:
1235 // Change the opcode as necessary to swap the operands.
1236 Opcode = SetCondInst::getSwappedCondition((Instruction::BinaryOps)Opcode);
1237 return ConstantFoldBinaryInstruction(Opcode, V2, V1);
1239 case Instruction::Shl:
1240 case Instruction::Shr:
1241 case Instruction::Sub:
1242 case Instruction::Div:
1243 case Instruction::Rem:
1244 default: // These instructions cannot be flopped around.
1251 Constant *llvm::ConstantFoldGetElementPtr(const Constant *C,
1252 const std::vector<Value*> &IdxList) {
1253 if (IdxList.size() == 0 ||
1254 (IdxList.size() == 1 && cast<Constant>(IdxList[0])->isNullValue()))
1255 return const_cast<Constant*>(C);
1257 if (isa<UndefValue>(C)) {
1258 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), IdxList,
1260 assert(Ty != 0 && "Invalid indices for GEP!");
1261 return UndefValue::get(PointerType::get(Ty));
1264 Constant *Idx0 = cast<Constant>(IdxList[0]);
1265 if (C->isNullValue()) {
1267 for (unsigned i = 0, e = IdxList.size(); i != e; ++i)
1268 if (!cast<Constant>(IdxList[i])->isNullValue()) {
1273 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), IdxList,
1275 assert(Ty != 0 && "Invalid indices for GEP!");
1276 return ConstantPointerNull::get(PointerType::get(Ty));
1279 if (IdxList.size() == 1) {
1280 const Type *ElTy = cast<PointerType>(C->getType())->getElementType();
1281 if (unsigned ElSize = ElTy->getPrimitiveSize()) {
1282 // gep null, C is equal to C*sizeof(nullty). If nullty is a known llvm
1283 // type, we can statically fold this.
1284 Constant *R = ConstantUInt::get(Type::UIntTy, ElSize);
1285 R = ConstantExpr::getCast(R, Idx0->getType());
1286 R = ConstantExpr::getMul(R, Idx0);
1287 return ConstantExpr::getCast(R, C->getType());
1292 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(const_cast<Constant*>(C))) {
1293 // Combine Indices - If the source pointer to this getelementptr instruction
1294 // is a getelementptr instruction, combine the indices of the two
1295 // getelementptr instructions into a single instruction.
1297 if (CE->getOpcode() == Instruction::GetElementPtr) {
1298 const Type *LastTy = 0;
1299 for (gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE);
1303 if ((LastTy && isa<ArrayType>(LastTy)) || Idx0->isNullValue()) {
1304 std::vector<Value*> NewIndices;
1305 NewIndices.reserve(IdxList.size() + CE->getNumOperands());
1306 for (unsigned i = 1, e = CE->getNumOperands()-1; i != e; ++i)
1307 NewIndices.push_back(CE->getOperand(i));
1309 // Add the last index of the source with the first index of the new GEP.
1310 // Make sure to handle the case when they are actually different types.
1311 Constant *Combined = CE->getOperand(CE->getNumOperands()-1);
1312 // Otherwise it must be an array.
1313 if (!Idx0->isNullValue()) {
1314 const Type *IdxTy = Combined->getType();
1315 if (IdxTy != Idx0->getType()) IdxTy = Type::LongTy;
1317 ConstantExpr::get(Instruction::Add,
1318 ConstantExpr::getCast(Idx0, IdxTy),
1319 ConstantExpr::getCast(Combined, IdxTy));
1322 NewIndices.push_back(Combined);
1323 NewIndices.insert(NewIndices.end(), IdxList.begin()+1, IdxList.end());
1324 return ConstantExpr::getGetElementPtr(CE->getOperand(0), NewIndices);
1328 // Implement folding of:
1329 // int* getelementptr ([2 x int]* cast ([3 x int]* %X to [2 x int]*),
1331 // To: int* getelementptr ([3 x int]* %X, long 0, long 0)
1333 if (CE->getOpcode() == Instruction::Cast && IdxList.size() > 1 &&
1334 Idx0->isNullValue())
1335 if (const PointerType *SPT =
1336 dyn_cast<PointerType>(CE->getOperand(0)->getType()))
1337 if (const ArrayType *SAT = dyn_cast<ArrayType>(SPT->getElementType()))
1338 if (const ArrayType *CAT =
1339 dyn_cast<ArrayType>(cast<PointerType>(C->getType())->getElementType()))
1340 if (CAT->getElementType() == SAT->getElementType())
1341 return ConstantExpr::getGetElementPtr(
1342 (Constant*)CE->getOperand(0), IdxList);