1 //===-- Constants.cpp - Implement Constant nodes --------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This file implements the Constant* classes. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "llvm/IR/Constants.h" 15 #include "ConstantFold.h" 16 #include "LLVMContextImpl.h" 17 #include "llvm/ADT/DenseMap.h" 18 #include "llvm/ADT/FoldingSet.h" 19 #include "llvm/ADT/STLExtras.h" 20 #include "llvm/ADT/SmallVector.h" 21 #include "llvm/ADT/StringExtras.h" 22 #include "llvm/ADT/StringMap.h" 23 #include "llvm/IR/DerivedTypes.h" 24 #include "llvm/IR/GetElementPtrTypeIterator.h" 25 #include "llvm/IR/GlobalValue.h" 26 #include "llvm/IR/Instructions.h" 27 #include "llvm/IR/Module.h" 28 #include "llvm/IR/Operator.h" 29 #include "llvm/Support/Compiler.h" 30 #include "llvm/Support/Debug.h" 31 #include "llvm/Support/ErrorHandling.h" 32 #include "llvm/Support/ManagedStatic.h" 33 #include "llvm/Support/MathExtras.h" 34 #include "llvm/Support/raw_ostream.h" 35 #include <algorithm> 36 #include <cstdarg> 37 using namespace llvm; 38 39 //===----------------------------------------------------------------------===// 40 // Constant Class 41 //===----------------------------------------------------------------------===// 42 43 void Constant::anchor() { } 44 45 bool Constant::isNegativeZeroValue() const { 46 // Floating point values have an explicit -0.0 value. 47 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 48 return CFP->isZero() && CFP->isNegative(); 49 50 // Equivalent for a vector of -0.0's. 51 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 52 if (ConstantFP *SplatCFP = dyn_cast_or_null<ConstantFP>(CV->getSplatValue())) 53 if (SplatCFP && SplatCFP->isZero() && SplatCFP->isNegative()) 54 return true; 55 56 // We've already handled true FP case; any other FP vectors can't represent -0.0. 57 if (getType()->isFPOrFPVectorTy()) 58 return false; 59 60 // Otherwise, just use +0.0. 61 return isNullValue(); 62 } 63 64 // Return true iff this constant is positive zero (floating point), negative 65 // zero (floating point), or a null value. 66 bool Constant::isZeroValue() const { 67 // Floating point values have an explicit -0.0 value. 68 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 69 return CFP->isZero(); 70 71 // Otherwise, just use +0.0. 72 return isNullValue(); 73 } 74 75 bool Constant::isNullValue() const { 76 // 0 is null. 77 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 78 return CI->isZero(); 79 80 // +0.0 is null. 81 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 82 return CFP->isZero() && !CFP->isNegative(); 83 84 // constant zero is zero for aggregates and cpnull is null for pointers. 85 return isa<ConstantAggregateZero>(this) || isa<ConstantPointerNull>(this); 86 } 87 88 bool Constant::isAllOnesValue() const { 89 // Check for -1 integers 90 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 91 return CI->isMinusOne(); 92 93 // Check for FP which are bitcasted from -1 integers 94 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 95 return CFP->getValueAPF().bitcastToAPInt().isAllOnesValue(); 96 97 // Check for constant vectors which are splats of -1 values. 98 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 99 if (Constant *Splat = CV->getSplatValue()) 100 return Splat->isAllOnesValue(); 101 102 // Check for constant vectors which are splats of -1 values. 103 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 104 if (Constant *Splat = CV->getSplatValue()) 105 return Splat->isAllOnesValue(); 106 107 return false; 108 } 109 110 bool Constant::isOneValue() const { 111 // Check for 1 integers 112 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 113 return CI->isOne(); 114 115 // Check for FP which are bitcasted from 1 integers 116 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 117 return CFP->getValueAPF().bitcastToAPInt() == 1; 118 119 // Check for constant vectors which are splats of 1 values. 120 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 121 if (Constant *Splat = CV->getSplatValue()) 122 return Splat->isOneValue(); 123 124 // Check for constant vectors which are splats of 1 values. 125 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 126 if (Constant *Splat = CV->getSplatValue()) 127 return Splat->isOneValue(); 128 129 return false; 130 } 131 132 bool Constant::isMinSignedValue() const { 133 // Check for INT_MIN integers 134 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 135 return CI->isMinValue(/*isSigned=*/true); 136 137 // Check for FP which are bitcasted from INT_MIN integers 138 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 139 return CFP->getValueAPF().bitcastToAPInt().isMinSignedValue(); 140 141 // Check for constant vectors which are splats of INT_MIN values. 142 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 143 if (Constant *Splat = CV->getSplatValue()) 144 return Splat->isMinSignedValue(); 145 146 // Check for constant vectors which are splats of INT_MIN values. 147 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 148 if (Constant *Splat = CV->getSplatValue()) 149 return Splat->isMinSignedValue(); 150 151 return false; 152 } 153 154 bool Constant::isNotMinSignedValue() const { 155 // Check for INT_MIN integers 156 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 157 return !CI->isMinValue(/*isSigned=*/true); 158 159 // Check for FP which are bitcasted from INT_MIN integers 160 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this)) 161 return !CFP->getValueAPF().bitcastToAPInt().isMinSignedValue(); 162 163 // Check for constant vectors which are splats of INT_MIN values. 164 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 165 if (Constant *Splat = CV->getSplatValue()) 166 return Splat->isNotMinSignedValue(); 167 168 // Check for constant vectors which are splats of INT_MIN values. 169 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 170 if (Constant *Splat = CV->getSplatValue()) 171 return Splat->isNotMinSignedValue(); 172 173 // It *may* contain INT_MIN, we can't tell. 174 return false; 175 } 176 177 // Constructor to create a '0' constant of arbitrary type... 178 Constant *Constant::getNullValue(Type *Ty) { 179 switch (Ty->getTypeID()) { 180 case Type::IntegerTyID: 181 return ConstantInt::get(Ty, 0); 182 case Type::HalfTyID: 183 return ConstantFP::get(Ty->getContext(), 184 APFloat::getZero(APFloat::IEEEhalf)); 185 case Type::FloatTyID: 186 return ConstantFP::get(Ty->getContext(), 187 APFloat::getZero(APFloat::IEEEsingle)); 188 case Type::DoubleTyID: 189 return ConstantFP::get(Ty->getContext(), 190 APFloat::getZero(APFloat::IEEEdouble)); 191 case Type::X86_FP80TyID: 192 return ConstantFP::get(Ty->getContext(), 193 APFloat::getZero(APFloat::x87DoubleExtended)); 194 case Type::FP128TyID: 195 return ConstantFP::get(Ty->getContext(), 196 APFloat::getZero(APFloat::IEEEquad)); 197 case Type::PPC_FP128TyID: 198 return ConstantFP::get(Ty->getContext(), 199 APFloat(APFloat::PPCDoubleDouble, 200 APInt::getNullValue(128))); 201 case Type::PointerTyID: 202 return ConstantPointerNull::get(cast<PointerType>(Ty)); 203 case Type::StructTyID: 204 case Type::ArrayTyID: 205 case Type::VectorTyID: 206 return ConstantAggregateZero::get(Ty); 207 default: 208 // Function, Label, or Opaque type? 209 llvm_unreachable("Cannot create a null constant of that type!"); 210 } 211 } 212 213 Constant *Constant::getIntegerValue(Type *Ty, const APInt &V) { 214 Type *ScalarTy = Ty->getScalarType(); 215 216 // Create the base integer constant. 217 Constant *C = ConstantInt::get(Ty->getContext(), V); 218 219 // Convert an integer to a pointer, if necessary. 220 if (PointerType *PTy = dyn_cast<PointerType>(ScalarTy)) 221 C = ConstantExpr::getIntToPtr(C, PTy); 222 223 // Broadcast a scalar to a vector, if necessary. 224 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 225 C = ConstantVector::getSplat(VTy->getNumElements(), C); 226 227 return C; 228 } 229 230 Constant *Constant::getAllOnesValue(Type *Ty) { 231 if (IntegerType *ITy = dyn_cast<IntegerType>(Ty)) 232 return ConstantInt::get(Ty->getContext(), 233 APInt::getAllOnesValue(ITy->getBitWidth())); 234 235 if (Ty->isFloatingPointTy()) { 236 APFloat FL = APFloat::getAllOnesValue(Ty->getPrimitiveSizeInBits(), 237 !Ty->isPPC_FP128Ty()); 238 return ConstantFP::get(Ty->getContext(), FL); 239 } 240 241 VectorType *VTy = cast<VectorType>(Ty); 242 return ConstantVector::getSplat(VTy->getNumElements(), 243 getAllOnesValue(VTy->getElementType())); 244 } 245 246 /// getAggregateElement - For aggregates (struct/array/vector) return the 247 /// constant that corresponds to the specified element if possible, or null if 248 /// not. This can return null if the element index is a ConstantExpr, or if 249 /// 'this' is a constant expr. 250 Constant *Constant::getAggregateElement(unsigned Elt) const { 251 if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(this)) 252 return Elt < CS->getNumOperands() ? CS->getOperand(Elt) : nullptr; 253 254 if (const ConstantArray *CA = dyn_cast<ConstantArray>(this)) 255 return Elt < CA->getNumOperands() ? CA->getOperand(Elt) : nullptr; 256 257 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 258 return Elt < CV->getNumOperands() ? CV->getOperand(Elt) : nullptr; 259 260 if (const ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(this)) 261 return Elt < CAZ->getNumElements() ? CAZ->getElementValue(Elt) : nullptr; 262 263 if (const UndefValue *UV = dyn_cast<UndefValue>(this)) 264 return Elt < UV->getNumElements() ? UV->getElementValue(Elt) : nullptr; 265 266 if (const ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(this)) 267 return Elt < CDS->getNumElements() ? CDS->getElementAsConstant(Elt) 268 : nullptr; 269 return nullptr; 270 } 271 272 Constant *Constant::getAggregateElement(Constant *Elt) const { 273 assert(isa<IntegerType>(Elt->getType()) && "Index must be an integer"); 274 if (ConstantInt *CI = dyn_cast<ConstantInt>(Elt)) 275 return getAggregateElement(CI->getZExtValue()); 276 return nullptr; 277 } 278 279 280 void Constant::destroyConstantImpl() { 281 // When a Constant is destroyed, there may be lingering 282 // references to the constant by other constants in the constant pool. These 283 // constants are implicitly dependent on the module that is being deleted, 284 // but they don't know that. Because we only find out when the CPV is 285 // deleted, we must now notify all of our users (that should only be 286 // Constants) that they are, in fact, invalid now and should be deleted. 287 // 288 while (!use_empty()) { 289 Value *V = user_back(); 290 #ifndef NDEBUG // Only in -g mode... 291 if (!isa<Constant>(V)) { 292 dbgs() << "While deleting: " << *this 293 << "\n\nUse still stuck around after Def is destroyed: " 294 << *V << "\n\n"; 295 } 296 #endif 297 assert(isa<Constant>(V) && "References remain to Constant being destroyed"); 298 cast<Constant>(V)->destroyConstant(); 299 300 // The constant should remove itself from our use list... 301 assert((use_empty() || user_back() != V) && "Constant not removed!"); 302 } 303 304 // Value has no outstanding references it is safe to delete it now... 305 delete this; 306 } 307 308 static bool canTrapImpl(const Constant *C, 309 SmallPtrSetImpl<const ConstantExpr *> &NonTrappingOps) { 310 assert(C->getType()->isFirstClassType() && "Cannot evaluate aggregate vals!"); 311 // The only thing that could possibly trap are constant exprs. 312 const ConstantExpr *CE = dyn_cast<ConstantExpr>(C); 313 if (!CE) 314 return false; 315 316 // ConstantExpr traps if any operands can trap. 317 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) { 318 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(CE->getOperand(i))) { 319 if (NonTrappingOps.insert(Op).second && canTrapImpl(Op, NonTrappingOps)) 320 return true; 321 } 322 } 323 324 // Otherwise, only specific operations can trap. 325 switch (CE->getOpcode()) { 326 default: 327 return false; 328 case Instruction::UDiv: 329 case Instruction::SDiv: 330 case Instruction::FDiv: 331 case Instruction::URem: 332 case Instruction::SRem: 333 case Instruction::FRem: 334 // Div and rem can trap if the RHS is not known to be non-zero. 335 if (!isa<ConstantInt>(CE->getOperand(1)) ||CE->getOperand(1)->isNullValue()) 336 return true; 337 return false; 338 } 339 } 340 341 /// canTrap - Return true if evaluation of this constant could trap. This is 342 /// true for things like constant expressions that could divide by zero. 343 bool Constant::canTrap() const { 344 SmallPtrSet<const ConstantExpr *, 4> NonTrappingOps; 345 return canTrapImpl(this, NonTrappingOps); 346 } 347 348 /// Check if C contains a GlobalValue for which Predicate is true. 349 static bool 350 ConstHasGlobalValuePredicate(const Constant *C, 351 bool (*Predicate)(const GlobalValue *)) { 352 SmallPtrSet<const Constant *, 8> Visited; 353 SmallVector<const Constant *, 8> WorkList; 354 WorkList.push_back(C); 355 Visited.insert(C); 356 357 while (!WorkList.empty()) { 358 const Constant *WorkItem = WorkList.pop_back_val(); 359 if (const auto *GV = dyn_cast<GlobalValue>(WorkItem)) 360 if (Predicate(GV)) 361 return true; 362 for (const Value *Op : WorkItem->operands()) { 363 const Constant *ConstOp = dyn_cast<Constant>(Op); 364 if (!ConstOp) 365 continue; 366 if (Visited.insert(ConstOp).second) 367 WorkList.push_back(ConstOp); 368 } 369 } 370 return false; 371 } 372 373 /// Return true if the value can vary between threads. 374 bool Constant::isThreadDependent() const { 375 auto DLLImportPredicate = [](const GlobalValue *GV) { 376 return GV->isThreadLocal(); 377 }; 378 return ConstHasGlobalValuePredicate(this, DLLImportPredicate); 379 } 380 381 bool Constant::isDLLImportDependent() const { 382 auto DLLImportPredicate = [](const GlobalValue *GV) { 383 return GV->hasDLLImportStorageClass(); 384 }; 385 return ConstHasGlobalValuePredicate(this, DLLImportPredicate); 386 } 387 388 /// Return true if the constant has users other than constant exprs and other 389 /// dangling things. 390 bool Constant::isConstantUsed() const { 391 for (const User *U : users()) { 392 const Constant *UC = dyn_cast<Constant>(U); 393 if (!UC || isa<GlobalValue>(UC)) 394 return true; 395 396 if (UC->isConstantUsed()) 397 return true; 398 } 399 return false; 400 } 401 402 403 404 /// getRelocationInfo - This method classifies the entry according to 405 /// whether or not it may generate a relocation entry. This must be 406 /// conservative, so if it might codegen to a relocatable entry, it should say 407 /// so. The return values are: 408 /// 409 /// NoRelocation: This constant pool entry is guaranteed to never have a 410 /// relocation applied to it (because it holds a simple constant like 411 /// '4'). 412 /// LocalRelocation: This entry has relocations, but the entries are 413 /// guaranteed to be resolvable by the static linker, so the dynamic 414 /// linker will never see them. 415 /// GlobalRelocations: This entry may have arbitrary relocations. 416 /// 417 /// FIXME: This really should not be in IR. 418 Constant::PossibleRelocationsTy Constant::getRelocationInfo() const { 419 if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) { 420 if (GV->hasLocalLinkage() || GV->hasHiddenVisibility()) 421 return LocalRelocation; // Local to this file/library. 422 return GlobalRelocations; // Global reference. 423 } 424 425 if (const BlockAddress *BA = dyn_cast<BlockAddress>(this)) 426 return BA->getFunction()->getRelocationInfo(); 427 428 // While raw uses of blockaddress need to be relocated, differences between 429 // two of them don't when they are for labels in the same function. This is a 430 // common idiom when creating a table for the indirect goto extension, so we 431 // handle it efficiently here. 432 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(this)) 433 if (CE->getOpcode() == Instruction::Sub) { 434 ConstantExpr *LHS = dyn_cast<ConstantExpr>(CE->getOperand(0)); 435 ConstantExpr *RHS = dyn_cast<ConstantExpr>(CE->getOperand(1)); 436 if (LHS && RHS && 437 LHS->getOpcode() == Instruction::PtrToInt && 438 RHS->getOpcode() == Instruction::PtrToInt && 439 isa<BlockAddress>(LHS->getOperand(0)) && 440 isa<BlockAddress>(RHS->getOperand(0)) && 441 cast<BlockAddress>(LHS->getOperand(0))->getFunction() == 442 cast<BlockAddress>(RHS->getOperand(0))->getFunction()) 443 return NoRelocation; 444 } 445 446 PossibleRelocationsTy Result = NoRelocation; 447 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) 448 Result = std::max(Result, 449 cast<Constant>(getOperand(i))->getRelocationInfo()); 450 451 return Result; 452 } 453 454 /// removeDeadUsersOfConstant - If the specified constantexpr is dead, remove 455 /// it. This involves recursively eliminating any dead users of the 456 /// constantexpr. 457 static bool removeDeadUsersOfConstant(const Constant *C) { 458 if (isa<GlobalValue>(C)) return false; // Cannot remove this 459 460 while (!C->use_empty()) { 461 const Constant *User = dyn_cast<Constant>(C->user_back()); 462 if (!User) return false; // Non-constant usage; 463 if (!removeDeadUsersOfConstant(User)) 464 return false; // Constant wasn't dead 465 } 466 467 const_cast<Constant*>(C)->destroyConstant(); 468 return true; 469 } 470 471 472 /// removeDeadConstantUsers - If there are any dead constant users dangling 473 /// off of this constant, remove them. This method is useful for clients 474 /// that want to check to see if a global is unused, but don't want to deal 475 /// with potentially dead constants hanging off of the globals. 476 void Constant::removeDeadConstantUsers() const { 477 Value::const_user_iterator I = user_begin(), E = user_end(); 478 Value::const_user_iterator LastNonDeadUser = E; 479 while (I != E) { 480 const Constant *User = dyn_cast<Constant>(*I); 481 if (!User) { 482 LastNonDeadUser = I; 483 ++I; 484 continue; 485 } 486 487 if (!removeDeadUsersOfConstant(User)) { 488 // If the constant wasn't dead, remember that this was the last live use 489 // and move on to the next constant. 490 LastNonDeadUser = I; 491 ++I; 492 continue; 493 } 494 495 // If the constant was dead, then the iterator is invalidated. 496 if (LastNonDeadUser == E) { 497 I = user_begin(); 498 if (I == E) break; 499 } else { 500 I = LastNonDeadUser; 501 ++I; 502 } 503 } 504 } 505 506 507 508 //===----------------------------------------------------------------------===// 509 // ConstantInt 510 //===----------------------------------------------------------------------===// 511 512 void ConstantInt::anchor() { } 513 514 ConstantInt::ConstantInt(IntegerType *Ty, const APInt& V) 515 : Constant(Ty, ConstantIntVal, nullptr, 0), Val(V) { 516 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type"); 517 } 518 519 ConstantInt *ConstantInt::getTrue(LLVMContext &Context) { 520 LLVMContextImpl *pImpl = Context.pImpl; 521 if (!pImpl->TheTrueVal) 522 pImpl->TheTrueVal = ConstantInt::get(Type::getInt1Ty(Context), 1); 523 return pImpl->TheTrueVal; 524 } 525 526 ConstantInt *ConstantInt::getFalse(LLVMContext &Context) { 527 LLVMContextImpl *pImpl = Context.pImpl; 528 if (!pImpl->TheFalseVal) 529 pImpl->TheFalseVal = ConstantInt::get(Type::getInt1Ty(Context), 0); 530 return pImpl->TheFalseVal; 531 } 532 533 Constant *ConstantInt::getTrue(Type *Ty) { 534 VectorType *VTy = dyn_cast<VectorType>(Ty); 535 if (!VTy) { 536 assert(Ty->isIntegerTy(1) && "True must be i1 or vector of i1."); 537 return ConstantInt::getTrue(Ty->getContext()); 538 } 539 assert(VTy->getElementType()->isIntegerTy(1) && 540 "True must be vector of i1 or i1."); 541 return ConstantVector::getSplat(VTy->getNumElements(), 542 ConstantInt::getTrue(Ty->getContext())); 543 } 544 545 Constant *ConstantInt::getFalse(Type *Ty) { 546 VectorType *VTy = dyn_cast<VectorType>(Ty); 547 if (!VTy) { 548 assert(Ty->isIntegerTy(1) && "False must be i1 or vector of i1."); 549 return ConstantInt::getFalse(Ty->getContext()); 550 } 551 assert(VTy->getElementType()->isIntegerTy(1) && 552 "False must be vector of i1 or i1."); 553 return ConstantVector::getSplat(VTy->getNumElements(), 554 ConstantInt::getFalse(Ty->getContext())); 555 } 556 557 // Get a ConstantInt from an APInt. 558 ConstantInt *ConstantInt::get(LLVMContext &Context, const APInt &V) { 559 // get an existing value or the insertion position 560 LLVMContextImpl *pImpl = Context.pImpl; 561 ConstantInt *&Slot = pImpl->IntConstants[V]; 562 if (!Slot) { 563 // Get the corresponding integer type for the bit width of the value. 564 IntegerType *ITy = IntegerType::get(Context, V.getBitWidth()); 565 Slot = new ConstantInt(ITy, V); 566 } 567 assert(Slot->getType() == IntegerType::get(Context, V.getBitWidth())); 568 return Slot; 569 } 570 571 Constant *ConstantInt::get(Type *Ty, uint64_t V, bool isSigned) { 572 Constant *C = get(cast<IntegerType>(Ty->getScalarType()), V, isSigned); 573 574 // For vectors, broadcast the value. 575 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 576 return ConstantVector::getSplat(VTy->getNumElements(), C); 577 578 return C; 579 } 580 581 ConstantInt *ConstantInt::get(IntegerType *Ty, uint64_t V, 582 bool isSigned) { 583 return get(Ty->getContext(), APInt(Ty->getBitWidth(), V, isSigned)); 584 } 585 586 ConstantInt *ConstantInt::getSigned(IntegerType *Ty, int64_t V) { 587 return get(Ty, V, true); 588 } 589 590 Constant *ConstantInt::getSigned(Type *Ty, int64_t V) { 591 return get(Ty, V, true); 592 } 593 594 Constant *ConstantInt::get(Type *Ty, const APInt& V) { 595 ConstantInt *C = get(Ty->getContext(), V); 596 assert(C->getType() == Ty->getScalarType() && 597 "ConstantInt type doesn't match the type implied by its value!"); 598 599 // For vectors, broadcast the value. 600 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 601 return ConstantVector::getSplat(VTy->getNumElements(), C); 602 603 return C; 604 } 605 606 ConstantInt *ConstantInt::get(IntegerType* Ty, StringRef Str, 607 uint8_t radix) { 608 return get(Ty->getContext(), APInt(Ty->getBitWidth(), Str, radix)); 609 } 610 611 //===----------------------------------------------------------------------===// 612 // ConstantFP 613 //===----------------------------------------------------------------------===// 614 615 static const fltSemantics *TypeToFloatSemantics(Type *Ty) { 616 if (Ty->isHalfTy()) 617 return &APFloat::IEEEhalf; 618 if (Ty->isFloatTy()) 619 return &APFloat::IEEEsingle; 620 if (Ty->isDoubleTy()) 621 return &APFloat::IEEEdouble; 622 if (Ty->isX86_FP80Ty()) 623 return &APFloat::x87DoubleExtended; 624 else if (Ty->isFP128Ty()) 625 return &APFloat::IEEEquad; 626 627 assert(Ty->isPPC_FP128Ty() && "Unknown FP format"); 628 return &APFloat::PPCDoubleDouble; 629 } 630 631 void ConstantFP::anchor() { } 632 633 /// get() - This returns a constant fp for the specified value in the 634 /// specified type. This should only be used for simple constant values like 635 /// 2.0/1.0 etc, that are known-valid both as double and as the target format. 636 Constant *ConstantFP::get(Type *Ty, double V) { 637 LLVMContext &Context = Ty->getContext(); 638 639 APFloat FV(V); 640 bool ignored; 641 FV.convert(*TypeToFloatSemantics(Ty->getScalarType()), 642 APFloat::rmNearestTiesToEven, &ignored); 643 Constant *C = get(Context, FV); 644 645 // For vectors, broadcast the value. 646 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 647 return ConstantVector::getSplat(VTy->getNumElements(), C); 648 649 return C; 650 } 651 652 653 Constant *ConstantFP::get(Type *Ty, StringRef Str) { 654 LLVMContext &Context = Ty->getContext(); 655 656 APFloat FV(*TypeToFloatSemantics(Ty->getScalarType()), Str); 657 Constant *C = get(Context, FV); 658 659 // For vectors, broadcast the value. 660 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 661 return ConstantVector::getSplat(VTy->getNumElements(), C); 662 663 return C; 664 } 665 666 Constant *ConstantFP::getNaN(Type *Ty, bool Negative, unsigned Type) { 667 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType()); 668 APFloat NaN = APFloat::getNaN(Semantics, Negative, Type); 669 Constant *C = get(Ty->getContext(), NaN); 670 671 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 672 return ConstantVector::getSplat(VTy->getNumElements(), C); 673 674 return C; 675 } 676 677 Constant *ConstantFP::getNegativeZero(Type *Ty) { 678 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType()); 679 APFloat NegZero = APFloat::getZero(Semantics, /*Negative=*/true); 680 Constant *C = get(Ty->getContext(), NegZero); 681 682 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 683 return ConstantVector::getSplat(VTy->getNumElements(), C); 684 685 return C; 686 } 687 688 689 Constant *ConstantFP::getZeroValueForNegation(Type *Ty) { 690 if (Ty->isFPOrFPVectorTy()) 691 return getNegativeZero(Ty); 692 693 return Constant::getNullValue(Ty); 694 } 695 696 697 // ConstantFP accessors. 698 ConstantFP* ConstantFP::get(LLVMContext &Context, const APFloat& V) { 699 LLVMContextImpl* pImpl = Context.pImpl; 700 701 ConstantFP *&Slot = pImpl->FPConstants[V]; 702 703 if (!Slot) { 704 Type *Ty; 705 if (&V.getSemantics() == &APFloat::IEEEhalf) 706 Ty = Type::getHalfTy(Context); 707 else if (&V.getSemantics() == &APFloat::IEEEsingle) 708 Ty = Type::getFloatTy(Context); 709 else if (&V.getSemantics() == &APFloat::IEEEdouble) 710 Ty = Type::getDoubleTy(Context); 711 else if (&V.getSemantics() == &APFloat::x87DoubleExtended) 712 Ty = Type::getX86_FP80Ty(Context); 713 else if (&V.getSemantics() == &APFloat::IEEEquad) 714 Ty = Type::getFP128Ty(Context); 715 else { 716 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble && 717 "Unknown FP format"); 718 Ty = Type::getPPC_FP128Ty(Context); 719 } 720 Slot = new ConstantFP(Ty, V); 721 } 722 723 return Slot; 724 } 725 726 Constant *ConstantFP::getInfinity(Type *Ty, bool Negative) { 727 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType()); 728 Constant *C = get(Ty->getContext(), APFloat::getInf(Semantics, Negative)); 729 730 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) 731 return ConstantVector::getSplat(VTy->getNumElements(), C); 732 733 return C; 734 } 735 736 ConstantFP::ConstantFP(Type *Ty, const APFloat& V) 737 : Constant(Ty, ConstantFPVal, nullptr, 0), Val(V) { 738 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) && 739 "FP type Mismatch"); 740 } 741 742 bool ConstantFP::isExactlyValue(const APFloat &V) const { 743 return Val.bitwiseIsEqual(V); 744 } 745 746 //===----------------------------------------------------------------------===// 747 // ConstantAggregateZero Implementation 748 //===----------------------------------------------------------------------===// 749 750 /// getSequentialElement - If this CAZ has array or vector type, return a zero 751 /// with the right element type. 752 Constant *ConstantAggregateZero::getSequentialElement() const { 753 return Constant::getNullValue(getType()->getSequentialElementType()); 754 } 755 756 /// getStructElement - If this CAZ has struct type, return a zero with the 757 /// right element type for the specified element. 758 Constant *ConstantAggregateZero::getStructElement(unsigned Elt) const { 759 return Constant::getNullValue(getType()->getStructElementType(Elt)); 760 } 761 762 /// getElementValue - Return a zero of the right value for the specified GEP 763 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr). 764 Constant *ConstantAggregateZero::getElementValue(Constant *C) const { 765 if (isa<SequentialType>(getType())) 766 return getSequentialElement(); 767 return getStructElement(cast<ConstantInt>(C)->getZExtValue()); 768 } 769 770 /// getElementValue - Return a zero of the right value for the specified GEP 771 /// index. 772 Constant *ConstantAggregateZero::getElementValue(unsigned Idx) const { 773 if (isa<SequentialType>(getType())) 774 return getSequentialElement(); 775 return getStructElement(Idx); 776 } 777 778 unsigned ConstantAggregateZero::getNumElements() const { 779 const Type *Ty = getType(); 780 if (const auto *AT = dyn_cast<ArrayType>(Ty)) 781 return AT->getNumElements(); 782 if (const auto *VT = dyn_cast<VectorType>(Ty)) 783 return VT->getNumElements(); 784 return Ty->getStructNumElements(); 785 } 786 787 //===----------------------------------------------------------------------===// 788 // UndefValue Implementation 789 //===----------------------------------------------------------------------===// 790 791 /// getSequentialElement - If this undef has array or vector type, return an 792 /// undef with the right element type. 793 UndefValue *UndefValue::getSequentialElement() const { 794 return UndefValue::get(getType()->getSequentialElementType()); 795 } 796 797 /// getStructElement - If this undef has struct type, return a zero with the 798 /// right element type for the specified element. 799 UndefValue *UndefValue::getStructElement(unsigned Elt) const { 800 return UndefValue::get(getType()->getStructElementType(Elt)); 801 } 802 803 /// getElementValue - Return an undef of the right value for the specified GEP 804 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr). 805 UndefValue *UndefValue::getElementValue(Constant *C) const { 806 if (isa<SequentialType>(getType())) 807 return getSequentialElement(); 808 return getStructElement(cast<ConstantInt>(C)->getZExtValue()); 809 } 810 811 /// getElementValue - Return an undef of the right value for the specified GEP 812 /// index. 813 UndefValue *UndefValue::getElementValue(unsigned Idx) const { 814 if (isa<SequentialType>(getType())) 815 return getSequentialElement(); 816 return getStructElement(Idx); 817 } 818 819 unsigned UndefValue::getNumElements() const { 820 const Type *Ty = getType(); 821 if (const auto *AT = dyn_cast<ArrayType>(Ty)) 822 return AT->getNumElements(); 823 if (const auto *VT = dyn_cast<VectorType>(Ty)) 824 return VT->getNumElements(); 825 return Ty->getStructNumElements(); 826 } 827 828 //===----------------------------------------------------------------------===// 829 // ConstantXXX Classes 830 //===----------------------------------------------------------------------===// 831 832 template <typename ItTy, typename EltTy> 833 static bool rangeOnlyContains(ItTy Start, ItTy End, EltTy Elt) { 834 for (; Start != End; ++Start) 835 if (*Start != Elt) 836 return false; 837 return true; 838 } 839 840 ConstantArray::ConstantArray(ArrayType *T, ArrayRef<Constant *> V) 841 : Constant(T, ConstantArrayVal, 842 OperandTraits<ConstantArray>::op_end(this) - V.size(), 843 V.size()) { 844 assert(V.size() == T->getNumElements() && 845 "Invalid initializer vector for constant array"); 846 for (unsigned i = 0, e = V.size(); i != e; ++i) 847 assert(V[i]->getType() == T->getElementType() && 848 "Initializer for array element doesn't match array element type!"); 849 std::copy(V.begin(), V.end(), op_begin()); 850 } 851 852 Constant *ConstantArray::get(ArrayType *Ty, ArrayRef<Constant*> V) { 853 if (Constant *C = getImpl(Ty, V)) 854 return C; 855 return Ty->getContext().pImpl->ArrayConstants.getOrCreate(Ty, V); 856 } 857 Constant *ConstantArray::getImpl(ArrayType *Ty, ArrayRef<Constant*> V) { 858 // Empty arrays are canonicalized to ConstantAggregateZero. 859 if (V.empty()) 860 return ConstantAggregateZero::get(Ty); 861 862 for (unsigned i = 0, e = V.size(); i != e; ++i) { 863 assert(V[i]->getType() == Ty->getElementType() && 864 "Wrong type in array element initializer"); 865 } 866 867 // If this is an all-zero array, return a ConstantAggregateZero object. If 868 // all undef, return an UndefValue, if "all simple", then return a 869 // ConstantDataArray. 870 Constant *C = V[0]; 871 if (isa<UndefValue>(C) && rangeOnlyContains(V.begin(), V.end(), C)) 872 return UndefValue::get(Ty); 873 874 if (C->isNullValue() && rangeOnlyContains(V.begin(), V.end(), C)) 875 return ConstantAggregateZero::get(Ty); 876 877 // Check to see if all of the elements are ConstantFP or ConstantInt and if 878 // the element type is compatible with ConstantDataVector. If so, use it. 879 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) { 880 // We speculatively build the elements here even if it turns out that there 881 // is a constantexpr or something else weird in the array, since it is so 882 // uncommon for that to happen. 883 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) { 884 if (CI->getType()->isIntegerTy(8)) { 885 SmallVector<uint8_t, 16> Elts; 886 for (unsigned i = 0, e = V.size(); i != e; ++i) 887 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 888 Elts.push_back(CI->getZExtValue()); 889 else 890 break; 891 if (Elts.size() == V.size()) 892 return ConstantDataArray::get(C->getContext(), Elts); 893 } else if (CI->getType()->isIntegerTy(16)) { 894 SmallVector<uint16_t, 16> Elts; 895 for (unsigned i = 0, e = V.size(); i != e; ++i) 896 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 897 Elts.push_back(CI->getZExtValue()); 898 else 899 break; 900 if (Elts.size() == V.size()) 901 return ConstantDataArray::get(C->getContext(), Elts); 902 } else if (CI->getType()->isIntegerTy(32)) { 903 SmallVector<uint32_t, 16> Elts; 904 for (unsigned i = 0, e = V.size(); i != e; ++i) 905 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 906 Elts.push_back(CI->getZExtValue()); 907 else 908 break; 909 if (Elts.size() == V.size()) 910 return ConstantDataArray::get(C->getContext(), Elts); 911 } else if (CI->getType()->isIntegerTy(64)) { 912 SmallVector<uint64_t, 16> Elts; 913 for (unsigned i = 0, e = V.size(); i != e; ++i) 914 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 915 Elts.push_back(CI->getZExtValue()); 916 else 917 break; 918 if (Elts.size() == V.size()) 919 return ConstantDataArray::get(C->getContext(), Elts); 920 } 921 } 922 923 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 924 if (CFP->getType()->isFloatTy()) { 925 SmallVector<uint32_t, 16> Elts; 926 for (unsigned i = 0, e = V.size(); i != e; ++i) 927 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i])) 928 Elts.push_back( 929 CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 930 else 931 break; 932 if (Elts.size() == V.size()) 933 return ConstantDataArray::getFP(C->getContext(), Elts); 934 } else if (CFP->getType()->isDoubleTy()) { 935 SmallVector<uint64_t, 16> Elts; 936 for (unsigned i = 0, e = V.size(); i != e; ++i) 937 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i])) 938 Elts.push_back( 939 CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 940 else 941 break; 942 if (Elts.size() == V.size()) 943 return ConstantDataArray::getFP(C->getContext(), Elts); 944 } 945 } 946 } 947 948 // Otherwise, we really do want to create a ConstantArray. 949 return nullptr; 950 } 951 952 /// getTypeForElements - Return an anonymous struct type to use for a constant 953 /// with the specified set of elements. The list must not be empty. 954 StructType *ConstantStruct::getTypeForElements(LLVMContext &Context, 955 ArrayRef<Constant*> V, 956 bool Packed) { 957 unsigned VecSize = V.size(); 958 SmallVector<Type*, 16> EltTypes(VecSize); 959 for (unsigned i = 0; i != VecSize; ++i) 960 EltTypes[i] = V[i]->getType(); 961 962 return StructType::get(Context, EltTypes, Packed); 963 } 964 965 966 StructType *ConstantStruct::getTypeForElements(ArrayRef<Constant*> V, 967 bool Packed) { 968 assert(!V.empty() && 969 "ConstantStruct::getTypeForElements cannot be called on empty list"); 970 return getTypeForElements(V[0]->getContext(), V, Packed); 971 } 972 973 974 ConstantStruct::ConstantStruct(StructType *T, ArrayRef<Constant *> V) 975 : Constant(T, ConstantStructVal, 976 OperandTraits<ConstantStruct>::op_end(this) - V.size(), 977 V.size()) { 978 assert(V.size() == T->getNumElements() && 979 "Invalid initializer vector for constant structure"); 980 for (unsigned i = 0, e = V.size(); i != e; ++i) 981 assert((T->isOpaque() || V[i]->getType() == T->getElementType(i)) && 982 "Initializer for struct element doesn't match struct element type!"); 983 std::copy(V.begin(), V.end(), op_begin()); 984 } 985 986 // ConstantStruct accessors. 987 Constant *ConstantStruct::get(StructType *ST, ArrayRef<Constant*> V) { 988 assert((ST->isOpaque() || ST->getNumElements() == V.size()) && 989 "Incorrect # elements specified to ConstantStruct::get"); 990 991 // Create a ConstantAggregateZero value if all elements are zeros. 992 bool isZero = true; 993 bool isUndef = false; 994 995 if (!V.empty()) { 996 isUndef = isa<UndefValue>(V[0]); 997 isZero = V[0]->isNullValue(); 998 if (isUndef || isZero) { 999 for (unsigned i = 0, e = V.size(); i != e; ++i) { 1000 if (!V[i]->isNullValue()) 1001 isZero = false; 1002 if (!isa<UndefValue>(V[i])) 1003 isUndef = false; 1004 } 1005 } 1006 } 1007 if (isZero) 1008 return ConstantAggregateZero::get(ST); 1009 if (isUndef) 1010 return UndefValue::get(ST); 1011 1012 return ST->getContext().pImpl->StructConstants.getOrCreate(ST, V); 1013 } 1014 1015 Constant *ConstantStruct::get(StructType *T, ...) { 1016 va_list ap; 1017 SmallVector<Constant*, 8> Values; 1018 va_start(ap, T); 1019 while (Constant *Val = va_arg(ap, llvm::Constant*)) 1020 Values.push_back(Val); 1021 va_end(ap); 1022 return get(T, Values); 1023 } 1024 1025 ConstantVector::ConstantVector(VectorType *T, ArrayRef<Constant *> V) 1026 : Constant(T, ConstantVectorVal, 1027 OperandTraits<ConstantVector>::op_end(this) - V.size(), 1028 V.size()) { 1029 for (size_t i = 0, e = V.size(); i != e; i++) 1030 assert(V[i]->getType() == T->getElementType() && 1031 "Initializer for vector element doesn't match vector element type!"); 1032 std::copy(V.begin(), V.end(), op_begin()); 1033 } 1034 1035 // ConstantVector accessors. 1036 Constant *ConstantVector::get(ArrayRef<Constant*> V) { 1037 if (Constant *C = getImpl(V)) 1038 return C; 1039 VectorType *Ty = VectorType::get(V.front()->getType(), V.size()); 1040 return Ty->getContext().pImpl->VectorConstants.getOrCreate(Ty, V); 1041 } 1042 Constant *ConstantVector::getImpl(ArrayRef<Constant*> V) { 1043 assert(!V.empty() && "Vectors can't be empty"); 1044 VectorType *T = VectorType::get(V.front()->getType(), V.size()); 1045 1046 // If this is an all-undef or all-zero vector, return a 1047 // ConstantAggregateZero or UndefValue. 1048 Constant *C = V[0]; 1049 bool isZero = C->isNullValue(); 1050 bool isUndef = isa<UndefValue>(C); 1051 1052 if (isZero || isUndef) { 1053 for (unsigned i = 1, e = V.size(); i != e; ++i) 1054 if (V[i] != C) { 1055 isZero = isUndef = false; 1056 break; 1057 } 1058 } 1059 1060 if (isZero) 1061 return ConstantAggregateZero::get(T); 1062 if (isUndef) 1063 return UndefValue::get(T); 1064 1065 // Check to see if all of the elements are ConstantFP or ConstantInt and if 1066 // the element type is compatible with ConstantDataVector. If so, use it. 1067 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) { 1068 // We speculatively build the elements here even if it turns out that there 1069 // is a constantexpr or something else weird in the array, since it is so 1070 // uncommon for that to happen. 1071 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) { 1072 if (CI->getType()->isIntegerTy(8)) { 1073 SmallVector<uint8_t, 16> Elts; 1074 for (unsigned i = 0, e = V.size(); i != e; ++i) 1075 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 1076 Elts.push_back(CI->getZExtValue()); 1077 else 1078 break; 1079 if (Elts.size() == V.size()) 1080 return ConstantDataVector::get(C->getContext(), Elts); 1081 } else if (CI->getType()->isIntegerTy(16)) { 1082 SmallVector<uint16_t, 16> Elts; 1083 for (unsigned i = 0, e = V.size(); i != e; ++i) 1084 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 1085 Elts.push_back(CI->getZExtValue()); 1086 else 1087 break; 1088 if (Elts.size() == V.size()) 1089 return ConstantDataVector::get(C->getContext(), Elts); 1090 } else if (CI->getType()->isIntegerTy(32)) { 1091 SmallVector<uint32_t, 16> Elts; 1092 for (unsigned i = 0, e = V.size(); i != e; ++i) 1093 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 1094 Elts.push_back(CI->getZExtValue()); 1095 else 1096 break; 1097 if (Elts.size() == V.size()) 1098 return ConstantDataVector::get(C->getContext(), Elts); 1099 } else if (CI->getType()->isIntegerTy(64)) { 1100 SmallVector<uint64_t, 16> Elts; 1101 for (unsigned i = 0, e = V.size(); i != e; ++i) 1102 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i])) 1103 Elts.push_back(CI->getZExtValue()); 1104 else 1105 break; 1106 if (Elts.size() == V.size()) 1107 return ConstantDataVector::get(C->getContext(), Elts); 1108 } 1109 } 1110 1111 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 1112 if (CFP->getType()->isFloatTy()) { 1113 SmallVector<uint32_t, 16> Elts; 1114 for (unsigned i = 0, e = V.size(); i != e; ++i) 1115 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i])) 1116 Elts.push_back( 1117 CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 1118 else 1119 break; 1120 if (Elts.size() == V.size()) 1121 return ConstantDataVector::getFP(C->getContext(), Elts); 1122 } else if (CFP->getType()->isDoubleTy()) { 1123 SmallVector<uint64_t, 16> Elts; 1124 for (unsigned i = 0, e = V.size(); i != e; ++i) 1125 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i])) 1126 Elts.push_back( 1127 CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 1128 else 1129 break; 1130 if (Elts.size() == V.size()) 1131 return ConstantDataVector::getFP(C->getContext(), Elts); 1132 } 1133 } 1134 } 1135 1136 // Otherwise, the element type isn't compatible with ConstantDataVector, or 1137 // the operand list constants a ConstantExpr or something else strange. 1138 return nullptr; 1139 } 1140 1141 Constant *ConstantVector::getSplat(unsigned NumElts, Constant *V) { 1142 // If this splat is compatible with ConstantDataVector, use it instead of 1143 // ConstantVector. 1144 if ((isa<ConstantFP>(V) || isa<ConstantInt>(V)) && 1145 ConstantDataSequential::isElementTypeCompatible(V->getType())) 1146 return ConstantDataVector::getSplat(NumElts, V); 1147 1148 SmallVector<Constant*, 32> Elts(NumElts, V); 1149 return get(Elts); 1150 } 1151 1152 1153 // Utility function for determining if a ConstantExpr is a CastOp or not. This 1154 // can't be inline because we don't want to #include Instruction.h into 1155 // Constant.h 1156 bool ConstantExpr::isCast() const { 1157 return Instruction::isCast(getOpcode()); 1158 } 1159 1160 bool ConstantExpr::isCompare() const { 1161 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp; 1162 } 1163 1164 bool ConstantExpr::isGEPWithNoNotionalOverIndexing() const { 1165 if (getOpcode() != Instruction::GetElementPtr) return false; 1166 1167 gep_type_iterator GEPI = gep_type_begin(this), E = gep_type_end(this); 1168 User::const_op_iterator OI = std::next(this->op_begin()); 1169 1170 // Skip the first index, as it has no static limit. 1171 ++GEPI; 1172 ++OI; 1173 1174 // The remaining indices must be compile-time known integers within the 1175 // bounds of the corresponding notional static array types. 1176 for (; GEPI != E; ++GEPI, ++OI) { 1177 ConstantInt *CI = dyn_cast<ConstantInt>(*OI); 1178 if (!CI) return false; 1179 if (ArrayType *ATy = dyn_cast<ArrayType>(*GEPI)) 1180 if (CI->getValue().getActiveBits() > 64 || 1181 CI->getZExtValue() >= ATy->getNumElements()) 1182 return false; 1183 } 1184 1185 // All the indices checked out. 1186 return true; 1187 } 1188 1189 bool ConstantExpr::hasIndices() const { 1190 return getOpcode() == Instruction::ExtractValue || 1191 getOpcode() == Instruction::InsertValue; 1192 } 1193 1194 ArrayRef<unsigned> ConstantExpr::getIndices() const { 1195 if (const ExtractValueConstantExpr *EVCE = 1196 dyn_cast<ExtractValueConstantExpr>(this)) 1197 return EVCE->Indices; 1198 1199 return cast<InsertValueConstantExpr>(this)->Indices; 1200 } 1201 1202 unsigned ConstantExpr::getPredicate() const { 1203 assert(isCompare()); 1204 return ((const CompareConstantExpr*)this)->predicate; 1205 } 1206 1207 /// getWithOperandReplaced - Return a constant expression identical to this 1208 /// one, but with the specified operand set to the specified value. 1209 Constant * 1210 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const { 1211 assert(Op->getType() == getOperand(OpNo)->getType() && 1212 "Replacing operand with value of different type!"); 1213 if (getOperand(OpNo) == Op) 1214 return const_cast<ConstantExpr*>(this); 1215 1216 SmallVector<Constant*, 8> NewOps; 1217 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) 1218 NewOps.push_back(i == OpNo ? Op : getOperand(i)); 1219 1220 return getWithOperands(NewOps); 1221 } 1222 1223 /// getWithOperands - This returns the current constant expression with the 1224 /// operands replaced with the specified values. The specified array must 1225 /// have the same number of operands as our current one. 1226 Constant *ConstantExpr::getWithOperands(ArrayRef<Constant *> Ops, Type *Ty, 1227 bool OnlyIfReduced) const { 1228 assert(Ops.size() == getNumOperands() && "Operand count mismatch!"); 1229 1230 // If no operands changed return self. 1231 if (Ty == getType() && std::equal(Ops.begin(), Ops.end(), op_begin())) 1232 return const_cast<ConstantExpr*>(this); 1233 1234 Type *OnlyIfReducedTy = OnlyIfReduced ? Ty : nullptr; 1235 switch (getOpcode()) { 1236 case Instruction::Trunc: 1237 case Instruction::ZExt: 1238 case Instruction::SExt: 1239 case Instruction::FPTrunc: 1240 case Instruction::FPExt: 1241 case Instruction::UIToFP: 1242 case Instruction::SIToFP: 1243 case Instruction::FPToUI: 1244 case Instruction::FPToSI: 1245 case Instruction::PtrToInt: 1246 case Instruction::IntToPtr: 1247 case Instruction::BitCast: 1248 case Instruction::AddrSpaceCast: 1249 return ConstantExpr::getCast(getOpcode(), Ops[0], Ty, OnlyIfReduced); 1250 case Instruction::Select: 1251 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2], OnlyIfReducedTy); 1252 case Instruction::InsertElement: 1253 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2], 1254 OnlyIfReducedTy); 1255 case Instruction::ExtractElement: 1256 return ConstantExpr::getExtractElement(Ops[0], Ops[1], OnlyIfReducedTy); 1257 case Instruction::InsertValue: 1258 return ConstantExpr::getInsertValue(Ops[0], Ops[1], getIndices(), 1259 OnlyIfReducedTy); 1260 case Instruction::ExtractValue: 1261 return ConstantExpr::getExtractValue(Ops[0], getIndices(), OnlyIfReducedTy); 1262 case Instruction::ShuffleVector: 1263 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2], 1264 OnlyIfReducedTy); 1265 case Instruction::GetElementPtr: 1266 return ConstantExpr::getGetElementPtr(nullptr, Ops[0], Ops.slice(1), 1267 cast<GEPOperator>(this)->isInBounds(), 1268 OnlyIfReducedTy); 1269 case Instruction::ICmp: 1270 case Instruction::FCmp: 1271 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1], 1272 OnlyIfReducedTy); 1273 default: 1274 assert(getNumOperands() == 2 && "Must be binary operator?"); 1275 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1], SubclassOptionalData, 1276 OnlyIfReducedTy); 1277 } 1278 } 1279 1280 1281 //===----------------------------------------------------------------------===// 1282 // isValueValidForType implementations 1283 1284 bool ConstantInt::isValueValidForType(Type *Ty, uint64_t Val) { 1285 unsigned NumBits = Ty->getIntegerBitWidth(); // assert okay 1286 if (Ty->isIntegerTy(1)) 1287 return Val == 0 || Val == 1; 1288 if (NumBits >= 64) 1289 return true; // always true, has to fit in largest type 1290 uint64_t Max = (1ll << NumBits) - 1; 1291 return Val <= Max; 1292 } 1293 1294 bool ConstantInt::isValueValidForType(Type *Ty, int64_t Val) { 1295 unsigned NumBits = Ty->getIntegerBitWidth(); 1296 if (Ty->isIntegerTy(1)) 1297 return Val == 0 || Val == 1 || Val == -1; 1298 if (NumBits >= 64) 1299 return true; // always true, has to fit in largest type 1300 int64_t Min = -(1ll << (NumBits-1)); 1301 int64_t Max = (1ll << (NumBits-1)) - 1; 1302 return (Val >= Min && Val <= Max); 1303 } 1304 1305 bool ConstantFP::isValueValidForType(Type *Ty, const APFloat& Val) { 1306 // convert modifies in place, so make a copy. 1307 APFloat Val2 = APFloat(Val); 1308 bool losesInfo; 1309 switch (Ty->getTypeID()) { 1310 default: 1311 return false; // These can't be represented as floating point! 1312 1313 // FIXME rounding mode needs to be more flexible 1314 case Type::HalfTyID: { 1315 if (&Val2.getSemantics() == &APFloat::IEEEhalf) 1316 return true; 1317 Val2.convert(APFloat::IEEEhalf, APFloat::rmNearestTiesToEven, &losesInfo); 1318 return !losesInfo; 1319 } 1320 case Type::FloatTyID: { 1321 if (&Val2.getSemantics() == &APFloat::IEEEsingle) 1322 return true; 1323 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo); 1324 return !losesInfo; 1325 } 1326 case Type::DoubleTyID: { 1327 if (&Val2.getSemantics() == &APFloat::IEEEhalf || 1328 &Val2.getSemantics() == &APFloat::IEEEsingle || 1329 &Val2.getSemantics() == &APFloat::IEEEdouble) 1330 return true; 1331 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo); 1332 return !losesInfo; 1333 } 1334 case Type::X86_FP80TyID: 1335 return &Val2.getSemantics() == &APFloat::IEEEhalf || 1336 &Val2.getSemantics() == &APFloat::IEEEsingle || 1337 &Val2.getSemantics() == &APFloat::IEEEdouble || 1338 &Val2.getSemantics() == &APFloat::x87DoubleExtended; 1339 case Type::FP128TyID: 1340 return &Val2.getSemantics() == &APFloat::IEEEhalf || 1341 &Val2.getSemantics() == &APFloat::IEEEsingle || 1342 &Val2.getSemantics() == &APFloat::IEEEdouble || 1343 &Val2.getSemantics() == &APFloat::IEEEquad; 1344 case Type::PPC_FP128TyID: 1345 return &Val2.getSemantics() == &APFloat::IEEEhalf || 1346 &Val2.getSemantics() == &APFloat::IEEEsingle || 1347 &Val2.getSemantics() == &APFloat::IEEEdouble || 1348 &Val2.getSemantics() == &APFloat::PPCDoubleDouble; 1349 } 1350 } 1351 1352 1353 //===----------------------------------------------------------------------===// 1354 // Factory Function Implementation 1355 1356 ConstantAggregateZero *ConstantAggregateZero::get(Type *Ty) { 1357 assert((Ty->isStructTy() || Ty->isArrayTy() || Ty->isVectorTy()) && 1358 "Cannot create an aggregate zero of non-aggregate type!"); 1359 1360 ConstantAggregateZero *&Entry = Ty->getContext().pImpl->CAZConstants[Ty]; 1361 if (!Entry) 1362 Entry = new ConstantAggregateZero(Ty); 1363 1364 return Entry; 1365 } 1366 1367 /// destroyConstant - Remove the constant from the constant table. 1368 /// 1369 void ConstantAggregateZero::destroyConstant() { 1370 getContext().pImpl->CAZConstants.erase(getType()); 1371 destroyConstantImpl(); 1372 } 1373 1374 /// destroyConstant - Remove the constant from the constant table... 1375 /// 1376 void ConstantArray::destroyConstant() { 1377 getType()->getContext().pImpl->ArrayConstants.remove(this); 1378 destroyConstantImpl(); 1379 } 1380 1381 1382 //---- ConstantStruct::get() implementation... 1383 // 1384 1385 // destroyConstant - Remove the constant from the constant table... 1386 // 1387 void ConstantStruct::destroyConstant() { 1388 getType()->getContext().pImpl->StructConstants.remove(this); 1389 destroyConstantImpl(); 1390 } 1391 1392 // destroyConstant - Remove the constant from the constant table... 1393 // 1394 void ConstantVector::destroyConstant() { 1395 getType()->getContext().pImpl->VectorConstants.remove(this); 1396 destroyConstantImpl(); 1397 } 1398 1399 /// getSplatValue - If this is a splat vector constant, meaning that all of 1400 /// the elements have the same value, return that value. Otherwise return 0. 1401 Constant *Constant::getSplatValue() const { 1402 assert(this->getType()->isVectorTy() && "Only valid for vectors!"); 1403 if (isa<ConstantAggregateZero>(this)) 1404 return getNullValue(this->getType()->getVectorElementType()); 1405 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this)) 1406 return CV->getSplatValue(); 1407 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) 1408 return CV->getSplatValue(); 1409 return nullptr; 1410 } 1411 1412 /// getSplatValue - If this is a splat constant, where all of the 1413 /// elements have the same value, return that value. Otherwise return null. 1414 Constant *ConstantVector::getSplatValue() const { 1415 // Check out first element. 1416 Constant *Elt = getOperand(0); 1417 // Then make sure all remaining elements point to the same value. 1418 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) 1419 if (getOperand(I) != Elt) 1420 return nullptr; 1421 return Elt; 1422 } 1423 1424 /// If C is a constant integer then return its value, otherwise C must be a 1425 /// vector of constant integers, all equal, and the common value is returned. 1426 const APInt &Constant::getUniqueInteger() const { 1427 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this)) 1428 return CI->getValue(); 1429 assert(this->getSplatValue() && "Doesn't contain a unique integer!"); 1430 const Constant *C = this->getAggregateElement(0U); 1431 assert(C && isa<ConstantInt>(C) && "Not a vector of numbers!"); 1432 return cast<ConstantInt>(C)->getValue(); 1433 } 1434 1435 1436 //---- ConstantPointerNull::get() implementation. 1437 // 1438 1439 ConstantPointerNull *ConstantPointerNull::get(PointerType *Ty) { 1440 ConstantPointerNull *&Entry = Ty->getContext().pImpl->CPNConstants[Ty]; 1441 if (!Entry) 1442 Entry = new ConstantPointerNull(Ty); 1443 1444 return Entry; 1445 } 1446 1447 // destroyConstant - Remove the constant from the constant table... 1448 // 1449 void ConstantPointerNull::destroyConstant() { 1450 getContext().pImpl->CPNConstants.erase(getType()); 1451 // Free the constant and any dangling references to it. 1452 destroyConstantImpl(); 1453 } 1454 1455 1456 //---- UndefValue::get() implementation. 1457 // 1458 1459 UndefValue *UndefValue::get(Type *Ty) { 1460 UndefValue *&Entry = Ty->getContext().pImpl->UVConstants[Ty]; 1461 if (!Entry) 1462 Entry = new UndefValue(Ty); 1463 1464 return Entry; 1465 } 1466 1467 // destroyConstant - Remove the constant from the constant table. 1468 // 1469 void UndefValue::destroyConstant() { 1470 // Free the constant and any dangling references to it. 1471 getContext().pImpl->UVConstants.erase(getType()); 1472 destroyConstantImpl(); 1473 } 1474 1475 //---- BlockAddress::get() implementation. 1476 // 1477 1478 BlockAddress *BlockAddress::get(BasicBlock *BB) { 1479 assert(BB->getParent() && "Block must have a parent"); 1480 return get(BB->getParent(), BB); 1481 } 1482 1483 BlockAddress *BlockAddress::get(Function *F, BasicBlock *BB) { 1484 BlockAddress *&BA = 1485 F->getContext().pImpl->BlockAddresses[std::make_pair(F, BB)]; 1486 if (!BA) 1487 BA = new BlockAddress(F, BB); 1488 1489 assert(BA->getFunction() == F && "Basic block moved between functions"); 1490 return BA; 1491 } 1492 1493 BlockAddress::BlockAddress(Function *F, BasicBlock *BB) 1494 : Constant(Type::getInt8PtrTy(F->getContext()), Value::BlockAddressVal, 1495 &Op<0>(), 2) { 1496 setOperand(0, F); 1497 setOperand(1, BB); 1498 BB->AdjustBlockAddressRefCount(1); 1499 } 1500 1501 BlockAddress *BlockAddress::lookup(const BasicBlock *BB) { 1502 if (!BB->hasAddressTaken()) 1503 return nullptr; 1504 1505 const Function *F = BB->getParent(); 1506 assert(F && "Block must have a parent"); 1507 BlockAddress *BA = 1508 F->getContext().pImpl->BlockAddresses.lookup(std::make_pair(F, BB)); 1509 assert(BA && "Refcount and block address map disagree!"); 1510 return BA; 1511 } 1512 1513 // destroyConstant - Remove the constant from the constant table. 1514 // 1515 void BlockAddress::destroyConstant() { 1516 getFunction()->getType()->getContext().pImpl 1517 ->BlockAddresses.erase(std::make_pair(getFunction(), getBasicBlock())); 1518 getBasicBlock()->AdjustBlockAddressRefCount(-1); 1519 destroyConstantImpl(); 1520 } 1521 1522 void BlockAddress::replaceUsesOfWithOnConstant(Value *From, Value *To, Use *U) { 1523 // This could be replacing either the Basic Block or the Function. In either 1524 // case, we have to remove the map entry. 1525 Function *NewF = getFunction(); 1526 BasicBlock *NewBB = getBasicBlock(); 1527 1528 if (U == &Op<0>()) 1529 NewF = cast<Function>(To->stripPointerCasts()); 1530 else 1531 NewBB = cast<BasicBlock>(To); 1532 1533 // See if the 'new' entry already exists, if not, just update this in place 1534 // and return early. 1535 BlockAddress *&NewBA = 1536 getContext().pImpl->BlockAddresses[std::make_pair(NewF, NewBB)]; 1537 if (NewBA) { 1538 replaceUsesOfWithOnConstantImpl(NewBA); 1539 return; 1540 } 1541 1542 getBasicBlock()->AdjustBlockAddressRefCount(-1); 1543 1544 // Remove the old entry, this can't cause the map to rehash (just a 1545 // tombstone will get added). 1546 getContext().pImpl->BlockAddresses.erase(std::make_pair(getFunction(), 1547 getBasicBlock())); 1548 NewBA = this; 1549 setOperand(0, NewF); 1550 setOperand(1, NewBB); 1551 getBasicBlock()->AdjustBlockAddressRefCount(1); 1552 } 1553 1554 //---- ConstantExpr::get() implementations. 1555 // 1556 1557 /// This is a utility function to handle folding of casts and lookup of the 1558 /// cast in the ExprConstants map. It is used by the various get* methods below. 1559 static Constant *getFoldedCast(Instruction::CastOps opc, Constant *C, Type *Ty, 1560 bool OnlyIfReduced = false) { 1561 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!"); 1562 // Fold a few common cases 1563 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty)) 1564 return FC; 1565 1566 if (OnlyIfReduced) 1567 return nullptr; 1568 1569 LLVMContextImpl *pImpl = Ty->getContext().pImpl; 1570 1571 // Look up the constant in the table first to ensure uniqueness. 1572 ConstantExprKeyType Key(opc, C); 1573 1574 return pImpl->ExprConstants.getOrCreate(Ty, Key); 1575 } 1576 1577 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, Type *Ty, 1578 bool OnlyIfReduced) { 1579 Instruction::CastOps opc = Instruction::CastOps(oc); 1580 assert(Instruction::isCast(opc) && "opcode out of range"); 1581 assert(C && Ty && "Null arguments to getCast"); 1582 assert(CastInst::castIsValid(opc, C, Ty) && "Invalid constantexpr cast!"); 1583 1584 switch (opc) { 1585 default: 1586 llvm_unreachable("Invalid cast opcode"); 1587 case Instruction::Trunc: 1588 return getTrunc(C, Ty, OnlyIfReduced); 1589 case Instruction::ZExt: 1590 return getZExt(C, Ty, OnlyIfReduced); 1591 case Instruction::SExt: 1592 return getSExt(C, Ty, OnlyIfReduced); 1593 case Instruction::FPTrunc: 1594 return getFPTrunc(C, Ty, OnlyIfReduced); 1595 case Instruction::FPExt: 1596 return getFPExtend(C, Ty, OnlyIfReduced); 1597 case Instruction::UIToFP: 1598 return getUIToFP(C, Ty, OnlyIfReduced); 1599 case Instruction::SIToFP: 1600 return getSIToFP(C, Ty, OnlyIfReduced); 1601 case Instruction::FPToUI: 1602 return getFPToUI(C, Ty, OnlyIfReduced); 1603 case Instruction::FPToSI: 1604 return getFPToSI(C, Ty, OnlyIfReduced); 1605 case Instruction::PtrToInt: 1606 return getPtrToInt(C, Ty, OnlyIfReduced); 1607 case Instruction::IntToPtr: 1608 return getIntToPtr(C, Ty, OnlyIfReduced); 1609 case Instruction::BitCast: 1610 return getBitCast(C, Ty, OnlyIfReduced); 1611 case Instruction::AddrSpaceCast: 1612 return getAddrSpaceCast(C, Ty, OnlyIfReduced); 1613 } 1614 } 1615 1616 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, Type *Ty) { 1617 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits()) 1618 return getBitCast(C, Ty); 1619 return getZExt(C, Ty); 1620 } 1621 1622 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, Type *Ty) { 1623 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits()) 1624 return getBitCast(C, Ty); 1625 return getSExt(C, Ty); 1626 } 1627 1628 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, Type *Ty) { 1629 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits()) 1630 return getBitCast(C, Ty); 1631 return getTrunc(C, Ty); 1632 } 1633 1634 Constant *ConstantExpr::getPointerCast(Constant *S, Type *Ty) { 1635 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast"); 1636 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) && 1637 "Invalid cast"); 1638 1639 if (Ty->isIntOrIntVectorTy()) 1640 return getPtrToInt(S, Ty); 1641 1642 unsigned SrcAS = S->getType()->getPointerAddressSpace(); 1643 if (Ty->isPtrOrPtrVectorTy() && SrcAS != Ty->getPointerAddressSpace()) 1644 return getAddrSpaceCast(S, Ty); 1645 1646 return getBitCast(S, Ty); 1647 } 1648 1649 Constant *ConstantExpr::getPointerBitCastOrAddrSpaceCast(Constant *S, 1650 Type *Ty) { 1651 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast"); 1652 assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast"); 1653 1654 if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace()) 1655 return getAddrSpaceCast(S, Ty); 1656 1657 return getBitCast(S, Ty); 1658 } 1659 1660 Constant *ConstantExpr::getIntegerCast(Constant *C, Type *Ty, 1661 bool isSigned) { 1662 assert(C->getType()->isIntOrIntVectorTy() && 1663 Ty->isIntOrIntVectorTy() && "Invalid cast"); 1664 unsigned SrcBits = C->getType()->getScalarSizeInBits(); 1665 unsigned DstBits = Ty->getScalarSizeInBits(); 1666 Instruction::CastOps opcode = 1667 (SrcBits == DstBits ? Instruction::BitCast : 1668 (SrcBits > DstBits ? Instruction::Trunc : 1669 (isSigned ? Instruction::SExt : Instruction::ZExt))); 1670 return getCast(opcode, C, Ty); 1671 } 1672 1673 Constant *ConstantExpr::getFPCast(Constant *C, Type *Ty) { 1674 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() && 1675 "Invalid cast"); 1676 unsigned SrcBits = C->getType()->getScalarSizeInBits(); 1677 unsigned DstBits = Ty->getScalarSizeInBits(); 1678 if (SrcBits == DstBits) 1679 return C; // Avoid a useless cast 1680 Instruction::CastOps opcode = 1681 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt); 1682 return getCast(opcode, C, Ty); 1683 } 1684 1685 Constant *ConstantExpr::getTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) { 1686 #ifndef NDEBUG 1687 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1688 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1689 #endif 1690 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1691 assert(C->getType()->isIntOrIntVectorTy() && "Trunc operand must be integer"); 1692 assert(Ty->isIntOrIntVectorTy() && "Trunc produces only integral"); 1693 assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&& 1694 "SrcTy must be larger than DestTy for Trunc!"); 1695 1696 return getFoldedCast(Instruction::Trunc, C, Ty, OnlyIfReduced); 1697 } 1698 1699 Constant *ConstantExpr::getSExt(Constant *C, Type *Ty, bool OnlyIfReduced) { 1700 #ifndef NDEBUG 1701 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1702 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1703 #endif 1704 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1705 assert(C->getType()->isIntOrIntVectorTy() && "SExt operand must be integral"); 1706 assert(Ty->isIntOrIntVectorTy() && "SExt produces only integer"); 1707 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&& 1708 "SrcTy must be smaller than DestTy for SExt!"); 1709 1710 return getFoldedCast(Instruction::SExt, C, Ty, OnlyIfReduced); 1711 } 1712 1713 Constant *ConstantExpr::getZExt(Constant *C, Type *Ty, bool OnlyIfReduced) { 1714 #ifndef NDEBUG 1715 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1716 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1717 #endif 1718 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1719 assert(C->getType()->isIntOrIntVectorTy() && "ZEXt operand must be integral"); 1720 assert(Ty->isIntOrIntVectorTy() && "ZExt produces only integer"); 1721 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&& 1722 "SrcTy must be smaller than DestTy for ZExt!"); 1723 1724 return getFoldedCast(Instruction::ZExt, C, Ty, OnlyIfReduced); 1725 } 1726 1727 Constant *ConstantExpr::getFPTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) { 1728 #ifndef NDEBUG 1729 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1730 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1731 #endif 1732 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1733 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() && 1734 C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&& 1735 "This is an illegal floating point truncation!"); 1736 return getFoldedCast(Instruction::FPTrunc, C, Ty, OnlyIfReduced); 1737 } 1738 1739 Constant *ConstantExpr::getFPExtend(Constant *C, Type *Ty, bool OnlyIfReduced) { 1740 #ifndef NDEBUG 1741 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1742 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1743 #endif 1744 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1745 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() && 1746 C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&& 1747 "This is an illegal floating point extension!"); 1748 return getFoldedCast(Instruction::FPExt, C, Ty, OnlyIfReduced); 1749 } 1750 1751 Constant *ConstantExpr::getUIToFP(Constant *C, Type *Ty, bool OnlyIfReduced) { 1752 #ifndef NDEBUG 1753 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1754 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1755 #endif 1756 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1757 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() && 1758 "This is an illegal uint to floating point cast!"); 1759 return getFoldedCast(Instruction::UIToFP, C, Ty, OnlyIfReduced); 1760 } 1761 1762 Constant *ConstantExpr::getSIToFP(Constant *C, Type *Ty, bool OnlyIfReduced) { 1763 #ifndef NDEBUG 1764 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1765 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1766 #endif 1767 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1768 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() && 1769 "This is an illegal sint to floating point cast!"); 1770 return getFoldedCast(Instruction::SIToFP, C, Ty, OnlyIfReduced); 1771 } 1772 1773 Constant *ConstantExpr::getFPToUI(Constant *C, Type *Ty, bool OnlyIfReduced) { 1774 #ifndef NDEBUG 1775 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1776 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1777 #endif 1778 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1779 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() && 1780 "This is an illegal floating point to uint cast!"); 1781 return getFoldedCast(Instruction::FPToUI, C, Ty, OnlyIfReduced); 1782 } 1783 1784 Constant *ConstantExpr::getFPToSI(Constant *C, Type *Ty, bool OnlyIfReduced) { 1785 #ifndef NDEBUG 1786 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID; 1787 bool toVec = Ty->getTypeID() == Type::VectorTyID; 1788 #endif 1789 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector"); 1790 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() && 1791 "This is an illegal floating point to sint cast!"); 1792 return getFoldedCast(Instruction::FPToSI, C, Ty, OnlyIfReduced); 1793 } 1794 1795 Constant *ConstantExpr::getPtrToInt(Constant *C, Type *DstTy, 1796 bool OnlyIfReduced) { 1797 assert(C->getType()->getScalarType()->isPointerTy() && 1798 "PtrToInt source must be pointer or pointer vector"); 1799 assert(DstTy->getScalarType()->isIntegerTy() && 1800 "PtrToInt destination must be integer or integer vector"); 1801 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy)); 1802 if (isa<VectorType>(C->getType())) 1803 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&& 1804 "Invalid cast between a different number of vector elements"); 1805 return getFoldedCast(Instruction::PtrToInt, C, DstTy, OnlyIfReduced); 1806 } 1807 1808 Constant *ConstantExpr::getIntToPtr(Constant *C, Type *DstTy, 1809 bool OnlyIfReduced) { 1810 assert(C->getType()->getScalarType()->isIntegerTy() && 1811 "IntToPtr source must be integer or integer vector"); 1812 assert(DstTy->getScalarType()->isPointerTy() && 1813 "IntToPtr destination must be a pointer or pointer vector"); 1814 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy)); 1815 if (isa<VectorType>(C->getType())) 1816 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&& 1817 "Invalid cast between a different number of vector elements"); 1818 return getFoldedCast(Instruction::IntToPtr, C, DstTy, OnlyIfReduced); 1819 } 1820 1821 Constant *ConstantExpr::getBitCast(Constant *C, Type *DstTy, 1822 bool OnlyIfReduced) { 1823 assert(CastInst::castIsValid(Instruction::BitCast, C, DstTy) && 1824 "Invalid constantexpr bitcast!"); 1825 1826 // It is common to ask for a bitcast of a value to its own type, handle this 1827 // speedily. 1828 if (C->getType() == DstTy) return C; 1829 1830 return getFoldedCast(Instruction::BitCast, C, DstTy, OnlyIfReduced); 1831 } 1832 1833 Constant *ConstantExpr::getAddrSpaceCast(Constant *C, Type *DstTy, 1834 bool OnlyIfReduced) { 1835 assert(CastInst::castIsValid(Instruction::AddrSpaceCast, C, DstTy) && 1836 "Invalid constantexpr addrspacecast!"); 1837 1838 // Canonicalize addrspacecasts between different pointer types by first 1839 // bitcasting the pointer type and then converting the address space. 1840 PointerType *SrcScalarTy = cast<PointerType>(C->getType()->getScalarType()); 1841 PointerType *DstScalarTy = cast<PointerType>(DstTy->getScalarType()); 1842 Type *DstElemTy = DstScalarTy->getElementType(); 1843 if (SrcScalarTy->getElementType() != DstElemTy) { 1844 Type *MidTy = PointerType::get(DstElemTy, SrcScalarTy->getAddressSpace()); 1845 if (VectorType *VT = dyn_cast<VectorType>(DstTy)) { 1846 // Handle vectors of pointers. 1847 MidTy = VectorType::get(MidTy, VT->getNumElements()); 1848 } 1849 C = getBitCast(C, MidTy); 1850 } 1851 return getFoldedCast(Instruction::AddrSpaceCast, C, DstTy, OnlyIfReduced); 1852 } 1853 1854 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2, 1855 unsigned Flags, Type *OnlyIfReducedTy) { 1856 // Check the operands for consistency first. 1857 assert(Opcode >= Instruction::BinaryOpsBegin && 1858 Opcode < Instruction::BinaryOpsEnd && 1859 "Invalid opcode in binary constant expression"); 1860 assert(C1->getType() == C2->getType() && 1861 "Operand types in binary constant expression should match"); 1862 1863 #ifndef NDEBUG 1864 switch (Opcode) { 1865 case Instruction::Add: 1866 case Instruction::Sub: 1867 case Instruction::Mul: 1868 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1869 assert(C1->getType()->isIntOrIntVectorTy() && 1870 "Tried to create an integer operation on a non-integer type!"); 1871 break; 1872 case Instruction::FAdd: 1873 case Instruction::FSub: 1874 case Instruction::FMul: 1875 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1876 assert(C1->getType()->isFPOrFPVectorTy() && 1877 "Tried to create a floating-point operation on a " 1878 "non-floating-point type!"); 1879 break; 1880 case Instruction::UDiv: 1881 case Instruction::SDiv: 1882 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1883 assert(C1->getType()->isIntOrIntVectorTy() && 1884 "Tried to create an arithmetic operation on a non-arithmetic type!"); 1885 break; 1886 case Instruction::FDiv: 1887 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1888 assert(C1->getType()->isFPOrFPVectorTy() && 1889 "Tried to create an arithmetic operation on a non-arithmetic type!"); 1890 break; 1891 case Instruction::URem: 1892 case Instruction::SRem: 1893 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1894 assert(C1->getType()->isIntOrIntVectorTy() && 1895 "Tried to create an arithmetic operation on a non-arithmetic type!"); 1896 break; 1897 case Instruction::FRem: 1898 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1899 assert(C1->getType()->isFPOrFPVectorTy() && 1900 "Tried to create an arithmetic operation on a non-arithmetic type!"); 1901 break; 1902 case Instruction::And: 1903 case Instruction::Or: 1904 case Instruction::Xor: 1905 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1906 assert(C1->getType()->isIntOrIntVectorTy() && 1907 "Tried to create a logical operation on a non-integral type!"); 1908 break; 1909 case Instruction::Shl: 1910 case Instruction::LShr: 1911 case Instruction::AShr: 1912 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1913 assert(C1->getType()->isIntOrIntVectorTy() && 1914 "Tried to create a shift operation on a non-integer type!"); 1915 break; 1916 default: 1917 break; 1918 } 1919 #endif 1920 1921 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2)) 1922 return FC; // Fold a few common cases. 1923 1924 if (OnlyIfReducedTy == C1->getType()) 1925 return nullptr; 1926 1927 Constant *ArgVec[] = { C1, C2 }; 1928 ConstantExprKeyType Key(Opcode, ArgVec, 0, Flags); 1929 1930 LLVMContextImpl *pImpl = C1->getContext().pImpl; 1931 return pImpl->ExprConstants.getOrCreate(C1->getType(), Key); 1932 } 1933 1934 Constant *ConstantExpr::getSizeOf(Type* Ty) { 1935 // sizeof is implemented as: (i64) gep (Ty*)null, 1 1936 // Note that a non-inbounds gep is used, as null isn't within any object. 1937 Constant *GEPIdx = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1); 1938 Constant *GEP = getGetElementPtr( 1939 Ty, Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx); 1940 return getPtrToInt(GEP, 1941 Type::getInt64Ty(Ty->getContext())); 1942 } 1943 1944 Constant *ConstantExpr::getAlignOf(Type* Ty) { 1945 // alignof is implemented as: (i64) gep ({i1,Ty}*)null, 0, 1 1946 // Note that a non-inbounds gep is used, as null isn't within any object. 1947 Type *AligningTy = 1948 StructType::get(Type::getInt1Ty(Ty->getContext()), Ty, nullptr); 1949 Constant *NullPtr = Constant::getNullValue(AligningTy->getPointerTo(0)); 1950 Constant *Zero = ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0); 1951 Constant *One = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1); 1952 Constant *Indices[2] = { Zero, One }; 1953 Constant *GEP = getGetElementPtr(AligningTy, NullPtr, Indices); 1954 return getPtrToInt(GEP, 1955 Type::getInt64Ty(Ty->getContext())); 1956 } 1957 1958 Constant *ConstantExpr::getOffsetOf(StructType* STy, unsigned FieldNo) { 1959 return getOffsetOf(STy, ConstantInt::get(Type::getInt32Ty(STy->getContext()), 1960 FieldNo)); 1961 } 1962 1963 Constant *ConstantExpr::getOffsetOf(Type* Ty, Constant *FieldNo) { 1964 // offsetof is implemented as: (i64) gep (Ty*)null, 0, FieldNo 1965 // Note that a non-inbounds gep is used, as null isn't within any object. 1966 Constant *GEPIdx[] = { 1967 ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0), 1968 FieldNo 1969 }; 1970 Constant *GEP = getGetElementPtr( 1971 Ty, Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx); 1972 return getPtrToInt(GEP, 1973 Type::getInt64Ty(Ty->getContext())); 1974 } 1975 1976 Constant *ConstantExpr::getCompare(unsigned short Predicate, Constant *C1, 1977 Constant *C2, bool OnlyIfReduced) { 1978 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1979 1980 switch (Predicate) { 1981 default: llvm_unreachable("Invalid CmpInst predicate"); 1982 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT: 1983 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE: 1984 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO: 1985 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE: 1986 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE: 1987 case CmpInst::FCMP_TRUE: 1988 return getFCmp(Predicate, C1, C2, OnlyIfReduced); 1989 1990 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT: 1991 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE: 1992 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT: 1993 case CmpInst::ICMP_SLE: 1994 return getICmp(Predicate, C1, C2, OnlyIfReduced); 1995 } 1996 } 1997 1998 Constant *ConstantExpr::getSelect(Constant *C, Constant *V1, Constant *V2, 1999 Type *OnlyIfReducedTy) { 2000 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands"); 2001 2002 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2)) 2003 return SC; // Fold common cases 2004 2005 if (OnlyIfReducedTy == V1->getType()) 2006 return nullptr; 2007 2008 Constant *ArgVec[] = { C, V1, V2 }; 2009 ConstantExprKeyType Key(Instruction::Select, ArgVec); 2010 2011 LLVMContextImpl *pImpl = C->getContext().pImpl; 2012 return pImpl->ExprConstants.getOrCreate(V1->getType(), Key); 2013 } 2014 2015 Constant *ConstantExpr::getGetElementPtr(Type *Ty, Constant *C, 2016 ArrayRef<Value *> Idxs, bool InBounds, 2017 Type *OnlyIfReducedTy) { 2018 if (Constant *FC = ConstantFoldGetElementPtr(C, InBounds, Idxs)) 2019 return FC; // Fold a few common cases. 2020 2021 if (!Ty) 2022 Ty = cast<PointerType>(C->getType()->getScalarType())->getElementType(); 2023 else 2024 assert(Ty == 2025 cast<PointerType>(C->getType()->getScalarType())->getElementType()); 2026 // Get the result type of the getelementptr! 2027 Type *DestTy = GetElementPtrInst::getIndexedType(Ty, Idxs); 2028 assert(DestTy && "GEP indices invalid!"); 2029 unsigned AS = C->getType()->getPointerAddressSpace(); 2030 Type *ReqTy = DestTy->getPointerTo(AS); 2031 if (VectorType *VecTy = dyn_cast<VectorType>(C->getType())) 2032 ReqTy = VectorType::get(ReqTy, VecTy->getNumElements()); 2033 2034 if (OnlyIfReducedTy == ReqTy) 2035 return nullptr; 2036 2037 // Look up the constant in the table first to ensure uniqueness 2038 std::vector<Constant*> ArgVec; 2039 ArgVec.reserve(1 + Idxs.size()); 2040 ArgVec.push_back(C); 2041 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) { 2042 assert(Idxs[i]->getType()->isVectorTy() == ReqTy->isVectorTy() && 2043 "getelementptr index type missmatch"); 2044 assert((!Idxs[i]->getType()->isVectorTy() || 2045 ReqTy->getVectorNumElements() == 2046 Idxs[i]->getType()->getVectorNumElements()) && 2047 "getelementptr index type missmatch"); 2048 ArgVec.push_back(cast<Constant>(Idxs[i])); 2049 } 2050 const ConstantExprKeyType Key(Instruction::GetElementPtr, ArgVec, 0, 2051 InBounds ? GEPOperator::IsInBounds : 0); 2052 2053 LLVMContextImpl *pImpl = C->getContext().pImpl; 2054 return pImpl->ExprConstants.getOrCreate(ReqTy, Key); 2055 } 2056 2057 Constant *ConstantExpr::getICmp(unsigned short pred, Constant *LHS, 2058 Constant *RHS, bool OnlyIfReduced) { 2059 assert(LHS->getType() == RHS->getType()); 2060 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE && 2061 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate"); 2062 2063 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS)) 2064 return FC; // Fold a few common cases... 2065 2066 if (OnlyIfReduced) 2067 return nullptr; 2068 2069 // Look up the constant in the table first to ensure uniqueness 2070 Constant *ArgVec[] = { LHS, RHS }; 2071 // Get the key type with both the opcode and predicate 2072 const ConstantExprKeyType Key(Instruction::ICmp, ArgVec, pred); 2073 2074 Type *ResultTy = Type::getInt1Ty(LHS->getContext()); 2075 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType())) 2076 ResultTy = VectorType::get(ResultTy, VT->getNumElements()); 2077 2078 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl; 2079 return pImpl->ExprConstants.getOrCreate(ResultTy, Key); 2080 } 2081 2082 Constant *ConstantExpr::getFCmp(unsigned short pred, Constant *LHS, 2083 Constant *RHS, bool OnlyIfReduced) { 2084 assert(LHS->getType() == RHS->getType()); 2085 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate"); 2086 2087 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS)) 2088 return FC; // Fold a few common cases... 2089 2090 if (OnlyIfReduced) 2091 return nullptr; 2092 2093 // Look up the constant in the table first to ensure uniqueness 2094 Constant *ArgVec[] = { LHS, RHS }; 2095 // Get the key type with both the opcode and predicate 2096 const ConstantExprKeyType Key(Instruction::FCmp, ArgVec, pred); 2097 2098 Type *ResultTy = Type::getInt1Ty(LHS->getContext()); 2099 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType())) 2100 ResultTy = VectorType::get(ResultTy, VT->getNumElements()); 2101 2102 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl; 2103 return pImpl->ExprConstants.getOrCreate(ResultTy, Key); 2104 } 2105 2106 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx, 2107 Type *OnlyIfReducedTy) { 2108 assert(Val->getType()->isVectorTy() && 2109 "Tried to create extractelement operation on non-vector type!"); 2110 assert(Idx->getType()->isIntegerTy() && 2111 "Extractelement index must be an integer type!"); 2112 2113 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx)) 2114 return FC; // Fold a few common cases. 2115 2116 Type *ReqTy = Val->getType()->getVectorElementType(); 2117 if (OnlyIfReducedTy == ReqTy) 2118 return nullptr; 2119 2120 // Look up the constant in the table first to ensure uniqueness 2121 Constant *ArgVec[] = { Val, Idx }; 2122 const ConstantExprKeyType Key(Instruction::ExtractElement, ArgVec); 2123 2124 LLVMContextImpl *pImpl = Val->getContext().pImpl; 2125 return pImpl->ExprConstants.getOrCreate(ReqTy, Key); 2126 } 2127 2128 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt, 2129 Constant *Idx, Type *OnlyIfReducedTy) { 2130 assert(Val->getType()->isVectorTy() && 2131 "Tried to create insertelement operation on non-vector type!"); 2132 assert(Elt->getType() == Val->getType()->getVectorElementType() && 2133 "Insertelement types must match!"); 2134 assert(Idx->getType()->isIntegerTy() && 2135 "Insertelement index must be i32 type!"); 2136 2137 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx)) 2138 return FC; // Fold a few common cases. 2139 2140 if (OnlyIfReducedTy == Val->getType()) 2141 return nullptr; 2142 2143 // Look up the constant in the table first to ensure uniqueness 2144 Constant *ArgVec[] = { Val, Elt, Idx }; 2145 const ConstantExprKeyType Key(Instruction::InsertElement, ArgVec); 2146 2147 LLVMContextImpl *pImpl = Val->getContext().pImpl; 2148 return pImpl->ExprConstants.getOrCreate(Val->getType(), Key); 2149 } 2150 2151 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2, 2152 Constant *Mask, Type *OnlyIfReducedTy) { 2153 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) && 2154 "Invalid shuffle vector constant expr operands!"); 2155 2156 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask)) 2157 return FC; // Fold a few common cases. 2158 2159 unsigned NElts = Mask->getType()->getVectorNumElements(); 2160 Type *EltTy = V1->getType()->getVectorElementType(); 2161 Type *ShufTy = VectorType::get(EltTy, NElts); 2162 2163 if (OnlyIfReducedTy == ShufTy) 2164 return nullptr; 2165 2166 // Look up the constant in the table first to ensure uniqueness 2167 Constant *ArgVec[] = { V1, V2, Mask }; 2168 const ConstantExprKeyType Key(Instruction::ShuffleVector, ArgVec); 2169 2170 LLVMContextImpl *pImpl = ShufTy->getContext().pImpl; 2171 return pImpl->ExprConstants.getOrCreate(ShufTy, Key); 2172 } 2173 2174 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val, 2175 ArrayRef<unsigned> Idxs, 2176 Type *OnlyIfReducedTy) { 2177 assert(Agg->getType()->isFirstClassType() && 2178 "Non-first-class type for constant insertvalue expression"); 2179 2180 assert(ExtractValueInst::getIndexedType(Agg->getType(), 2181 Idxs) == Val->getType() && 2182 "insertvalue indices invalid!"); 2183 Type *ReqTy = Val->getType(); 2184 2185 if (Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs)) 2186 return FC; 2187 2188 if (OnlyIfReducedTy == ReqTy) 2189 return nullptr; 2190 2191 Constant *ArgVec[] = { Agg, Val }; 2192 const ConstantExprKeyType Key(Instruction::InsertValue, ArgVec, 0, 0, Idxs); 2193 2194 LLVMContextImpl *pImpl = Agg->getContext().pImpl; 2195 return pImpl->ExprConstants.getOrCreate(ReqTy, Key); 2196 } 2197 2198 Constant *ConstantExpr::getExtractValue(Constant *Agg, ArrayRef<unsigned> Idxs, 2199 Type *OnlyIfReducedTy) { 2200 assert(Agg->getType()->isFirstClassType() && 2201 "Tried to create extractelement operation on non-first-class type!"); 2202 2203 Type *ReqTy = ExtractValueInst::getIndexedType(Agg->getType(), Idxs); 2204 (void)ReqTy; 2205 assert(ReqTy && "extractvalue indices invalid!"); 2206 2207 assert(Agg->getType()->isFirstClassType() && 2208 "Non-first-class type for constant extractvalue expression"); 2209 if (Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs)) 2210 return FC; 2211 2212 if (OnlyIfReducedTy == ReqTy) 2213 return nullptr; 2214 2215 Constant *ArgVec[] = { Agg }; 2216 const ConstantExprKeyType Key(Instruction::ExtractValue, ArgVec, 0, 0, Idxs); 2217 2218 LLVMContextImpl *pImpl = Agg->getContext().pImpl; 2219 return pImpl->ExprConstants.getOrCreate(ReqTy, Key); 2220 } 2221 2222 Constant *ConstantExpr::getNeg(Constant *C, bool HasNUW, bool HasNSW) { 2223 assert(C->getType()->isIntOrIntVectorTy() && 2224 "Cannot NEG a nonintegral value!"); 2225 return getSub(ConstantFP::getZeroValueForNegation(C->getType()), 2226 C, HasNUW, HasNSW); 2227 } 2228 2229 Constant *ConstantExpr::getFNeg(Constant *C) { 2230 assert(C->getType()->isFPOrFPVectorTy() && 2231 "Cannot FNEG a non-floating-point value!"); 2232 return getFSub(ConstantFP::getZeroValueForNegation(C->getType()), C); 2233 } 2234 2235 Constant *ConstantExpr::getNot(Constant *C) { 2236 assert(C->getType()->isIntOrIntVectorTy() && 2237 "Cannot NOT a nonintegral value!"); 2238 return get(Instruction::Xor, C, Constant::getAllOnesValue(C->getType())); 2239 } 2240 2241 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2, 2242 bool HasNUW, bool HasNSW) { 2243 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) | 2244 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0); 2245 return get(Instruction::Add, C1, C2, Flags); 2246 } 2247 2248 Constant *ConstantExpr::getFAdd(Constant *C1, Constant *C2) { 2249 return get(Instruction::FAdd, C1, C2); 2250 } 2251 2252 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2, 2253 bool HasNUW, bool HasNSW) { 2254 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) | 2255 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0); 2256 return get(Instruction::Sub, C1, C2, Flags); 2257 } 2258 2259 Constant *ConstantExpr::getFSub(Constant *C1, Constant *C2) { 2260 return get(Instruction::FSub, C1, C2); 2261 } 2262 2263 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2, 2264 bool HasNUW, bool HasNSW) { 2265 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) | 2266 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0); 2267 return get(Instruction::Mul, C1, C2, Flags); 2268 } 2269 2270 Constant *ConstantExpr::getFMul(Constant *C1, Constant *C2) { 2271 return get(Instruction::FMul, C1, C2); 2272 } 2273 2274 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2, bool isExact) { 2275 return get(Instruction::UDiv, C1, C2, 2276 isExact ? PossiblyExactOperator::IsExact : 0); 2277 } 2278 2279 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2, bool isExact) { 2280 return get(Instruction::SDiv, C1, C2, 2281 isExact ? PossiblyExactOperator::IsExact : 0); 2282 } 2283 2284 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) { 2285 return get(Instruction::FDiv, C1, C2); 2286 } 2287 2288 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) { 2289 return get(Instruction::URem, C1, C2); 2290 } 2291 2292 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) { 2293 return get(Instruction::SRem, C1, C2); 2294 } 2295 2296 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) { 2297 return get(Instruction::FRem, C1, C2); 2298 } 2299 2300 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) { 2301 return get(Instruction::And, C1, C2); 2302 } 2303 2304 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) { 2305 return get(Instruction::Or, C1, C2); 2306 } 2307 2308 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) { 2309 return get(Instruction::Xor, C1, C2); 2310 } 2311 2312 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2, 2313 bool HasNUW, bool HasNSW) { 2314 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) | 2315 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0); 2316 return get(Instruction::Shl, C1, C2, Flags); 2317 } 2318 2319 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2, bool isExact) { 2320 return get(Instruction::LShr, C1, C2, 2321 isExact ? PossiblyExactOperator::IsExact : 0); 2322 } 2323 2324 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2, bool isExact) { 2325 return get(Instruction::AShr, C1, C2, 2326 isExact ? PossiblyExactOperator::IsExact : 0); 2327 } 2328 2329 /// getBinOpIdentity - Return the identity for the given binary operation, 2330 /// i.e. a constant C such that X op C = X and C op X = X for every X. It 2331 /// returns null if the operator doesn't have an identity. 2332 Constant *ConstantExpr::getBinOpIdentity(unsigned Opcode, Type *Ty) { 2333 switch (Opcode) { 2334 default: 2335 // Doesn't have an identity. 2336 return nullptr; 2337 2338 case Instruction::Add: 2339 case Instruction::Or: 2340 case Instruction::Xor: 2341 return Constant::getNullValue(Ty); 2342 2343 case Instruction::Mul: 2344 return ConstantInt::get(Ty, 1); 2345 2346 case Instruction::And: 2347 return Constant::getAllOnesValue(Ty); 2348 } 2349 } 2350 2351 /// getBinOpAbsorber - Return the absorbing element for the given binary 2352 /// operation, i.e. a constant C such that X op C = C and C op X = C for 2353 /// every X. For example, this returns zero for integer multiplication. 2354 /// It returns null if the operator doesn't have an absorbing element. 2355 Constant *ConstantExpr::getBinOpAbsorber(unsigned Opcode, Type *Ty) { 2356 switch (Opcode) { 2357 default: 2358 // Doesn't have an absorber. 2359 return nullptr; 2360 2361 case Instruction::Or: 2362 return Constant::getAllOnesValue(Ty); 2363 2364 case Instruction::And: 2365 case Instruction::Mul: 2366 return Constant::getNullValue(Ty); 2367 } 2368 } 2369 2370 // destroyConstant - Remove the constant from the constant table... 2371 // 2372 void ConstantExpr::destroyConstant() { 2373 getType()->getContext().pImpl->ExprConstants.remove(this); 2374 destroyConstantImpl(); 2375 } 2376 2377 const char *ConstantExpr::getOpcodeName() const { 2378 return Instruction::getOpcodeName(getOpcode()); 2379 } 2380 2381 2382 2383 GetElementPtrConstantExpr:: 2384 GetElementPtrConstantExpr(Constant *C, ArrayRef<Constant*> IdxList, 2385 Type *DestTy) 2386 : ConstantExpr(DestTy, Instruction::GetElementPtr, 2387 OperandTraits<GetElementPtrConstantExpr>::op_end(this) 2388 - (IdxList.size()+1), IdxList.size()+1) { 2389 OperandList[0] = C; 2390 for (unsigned i = 0, E = IdxList.size(); i != E; ++i) 2391 OperandList[i+1] = IdxList[i]; 2392 } 2393 2394 //===----------------------------------------------------------------------===// 2395 // ConstantData* implementations 2396 2397 void ConstantDataArray::anchor() {} 2398 void ConstantDataVector::anchor() {} 2399 2400 /// getElementType - Return the element type of the array/vector. 2401 Type *ConstantDataSequential::getElementType() const { 2402 return getType()->getElementType(); 2403 } 2404 2405 StringRef ConstantDataSequential::getRawDataValues() const { 2406 return StringRef(DataElements, getNumElements()*getElementByteSize()); 2407 } 2408 2409 /// isElementTypeCompatible - Return true if a ConstantDataSequential can be 2410 /// formed with a vector or array of the specified element type. 2411 /// ConstantDataArray only works with normal float and int types that are 2412 /// stored densely in memory, not with things like i42 or x86_f80. 2413 bool ConstantDataSequential::isElementTypeCompatible(const Type *Ty) { 2414 if (Ty->isFloatTy() || Ty->isDoubleTy()) return true; 2415 if (const IntegerType *IT = dyn_cast<IntegerType>(Ty)) { 2416 switch (IT->getBitWidth()) { 2417 case 8: 2418 case 16: 2419 case 32: 2420 case 64: 2421 return true; 2422 default: break; 2423 } 2424 } 2425 return false; 2426 } 2427 2428 /// getNumElements - Return the number of elements in the array or vector. 2429 unsigned ConstantDataSequential::getNumElements() const { 2430 if (ArrayType *AT = dyn_cast<ArrayType>(getType())) 2431 return AT->getNumElements(); 2432 return getType()->getVectorNumElements(); 2433 } 2434 2435 2436 /// getElementByteSize - Return the size in bytes of the elements in the data. 2437 uint64_t ConstantDataSequential::getElementByteSize() const { 2438 return getElementType()->getPrimitiveSizeInBits()/8; 2439 } 2440 2441 /// getElementPointer - Return the start of the specified element. 2442 const char *ConstantDataSequential::getElementPointer(unsigned Elt) const { 2443 assert(Elt < getNumElements() && "Invalid Elt"); 2444 return DataElements+Elt*getElementByteSize(); 2445 } 2446 2447 2448 /// isAllZeros - return true if the array is empty or all zeros. 2449 static bool isAllZeros(StringRef Arr) { 2450 for (StringRef::iterator I = Arr.begin(), E = Arr.end(); I != E; ++I) 2451 if (*I != 0) 2452 return false; 2453 return true; 2454 } 2455 2456 /// getImpl - This is the underlying implementation of all of the 2457 /// ConstantDataSequential::get methods. They all thunk down to here, providing 2458 /// the correct element type. We take the bytes in as a StringRef because 2459 /// we *want* an underlying "char*" to avoid TBAA type punning violations. 2460 Constant *ConstantDataSequential::getImpl(StringRef Elements, Type *Ty) { 2461 assert(isElementTypeCompatible(Ty->getSequentialElementType())); 2462 // If the elements are all zero or there are no elements, return a CAZ, which 2463 // is more dense and canonical. 2464 if (isAllZeros(Elements)) 2465 return ConstantAggregateZero::get(Ty); 2466 2467 // Do a lookup to see if we have already formed one of these. 2468 auto &Slot = 2469 *Ty->getContext() 2470 .pImpl->CDSConstants.insert(std::make_pair(Elements, nullptr)) 2471 .first; 2472 2473 // The bucket can point to a linked list of different CDS's that have the same 2474 // body but different types. For example, 0,0,0,1 could be a 4 element array 2475 // of i8, or a 1-element array of i32. They'll both end up in the same 2476 /// StringMap bucket, linked up by their Next pointers. Walk the list. 2477 ConstantDataSequential **Entry = &Slot.second; 2478 for (ConstantDataSequential *Node = *Entry; Node; 2479 Entry = &Node->Next, Node = *Entry) 2480 if (Node->getType() == Ty) 2481 return Node; 2482 2483 // Okay, we didn't get a hit. Create a node of the right class, link it in, 2484 // and return it. 2485 if (isa<ArrayType>(Ty)) 2486 return *Entry = new ConstantDataArray(Ty, Slot.first().data()); 2487 2488 assert(isa<VectorType>(Ty)); 2489 return *Entry = new ConstantDataVector(Ty, Slot.first().data()); 2490 } 2491 2492 void ConstantDataSequential::destroyConstant() { 2493 // Remove the constant from the StringMap. 2494 StringMap<ConstantDataSequential*> &CDSConstants = 2495 getType()->getContext().pImpl->CDSConstants; 2496 2497 StringMap<ConstantDataSequential*>::iterator Slot = 2498 CDSConstants.find(getRawDataValues()); 2499 2500 assert(Slot != CDSConstants.end() && "CDS not found in uniquing table"); 2501 2502 ConstantDataSequential **Entry = &Slot->getValue(); 2503 2504 // Remove the entry from the hash table. 2505 if (!(*Entry)->Next) { 2506 // If there is only one value in the bucket (common case) it must be this 2507 // entry, and removing the entry should remove the bucket completely. 2508 assert((*Entry) == this && "Hash mismatch in ConstantDataSequential"); 2509 getContext().pImpl->CDSConstants.erase(Slot); 2510 } else { 2511 // Otherwise, there are multiple entries linked off the bucket, unlink the 2512 // node we care about but keep the bucket around. 2513 for (ConstantDataSequential *Node = *Entry; ; 2514 Entry = &Node->Next, Node = *Entry) { 2515 assert(Node && "Didn't find entry in its uniquing hash table!"); 2516 // If we found our entry, unlink it from the list and we're done. 2517 if (Node == this) { 2518 *Entry = Node->Next; 2519 break; 2520 } 2521 } 2522 } 2523 2524 // If we were part of a list, make sure that we don't delete the list that is 2525 // still owned by the uniquing map. 2526 Next = nullptr; 2527 2528 // Finally, actually delete it. 2529 destroyConstantImpl(); 2530 } 2531 2532 /// get() constructors - Return a constant with array type with an element 2533 /// count and element type matching the ArrayRef passed in. Note that this 2534 /// can return a ConstantAggregateZero object. 2535 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint8_t> Elts) { 2536 Type *Ty = ArrayType::get(Type::getInt8Ty(Context), Elts.size()); 2537 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2538 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty); 2539 } 2540 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){ 2541 Type *Ty = ArrayType::get(Type::getInt16Ty(Context), Elts.size()); 2542 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2543 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty); 2544 } 2545 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){ 2546 Type *Ty = ArrayType::get(Type::getInt32Ty(Context), Elts.size()); 2547 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2548 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty); 2549 } 2550 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){ 2551 Type *Ty = ArrayType::get(Type::getInt64Ty(Context), Elts.size()); 2552 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2553 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty); 2554 } 2555 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<float> Elts) { 2556 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size()); 2557 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2558 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty); 2559 } 2560 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<double> Elts) { 2561 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size()); 2562 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2563 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty); 2564 } 2565 2566 /// getFP() constructors - Return a constant with array type with an element 2567 /// count and element type of float with precision matching the number of 2568 /// bits in the ArrayRef passed in. (i.e. half for 16bits, float for 32bits, 2569 /// double for 64bits) Note that this can return a ConstantAggregateZero 2570 /// object. 2571 Constant *ConstantDataArray::getFP(LLVMContext &Context, 2572 ArrayRef<uint16_t> Elts) { 2573 Type *Ty = VectorType::get(Type::getHalfTy(Context), Elts.size()); 2574 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2575 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 2), Ty); 2576 } 2577 Constant *ConstantDataArray::getFP(LLVMContext &Context, 2578 ArrayRef<uint32_t> Elts) { 2579 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size()); 2580 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2581 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 4), Ty); 2582 } 2583 Constant *ConstantDataArray::getFP(LLVMContext &Context, 2584 ArrayRef<uint64_t> Elts) { 2585 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size()); 2586 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2587 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty); 2588 } 2589 2590 /// getString - This method constructs a CDS and initializes it with a text 2591 /// string. The default behavior (AddNull==true) causes a null terminator to 2592 /// be placed at the end of the array (increasing the length of the string by 2593 /// one more than the StringRef would normally indicate. Pass AddNull=false 2594 /// to disable this behavior. 2595 Constant *ConstantDataArray::getString(LLVMContext &Context, 2596 StringRef Str, bool AddNull) { 2597 if (!AddNull) { 2598 const uint8_t *Data = reinterpret_cast<const uint8_t *>(Str.data()); 2599 return get(Context, makeArrayRef(const_cast<uint8_t *>(Data), 2600 Str.size())); 2601 } 2602 2603 SmallVector<uint8_t, 64> ElementVals; 2604 ElementVals.append(Str.begin(), Str.end()); 2605 ElementVals.push_back(0); 2606 return get(Context, ElementVals); 2607 } 2608 2609 /// get() constructors - Return a constant with vector type with an element 2610 /// count and element type matching the ArrayRef passed in. Note that this 2611 /// can return a ConstantAggregateZero object. 2612 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint8_t> Elts){ 2613 Type *Ty = VectorType::get(Type::getInt8Ty(Context), Elts.size()); 2614 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2615 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty); 2616 } 2617 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){ 2618 Type *Ty = VectorType::get(Type::getInt16Ty(Context), Elts.size()); 2619 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2620 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty); 2621 } 2622 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){ 2623 Type *Ty = VectorType::get(Type::getInt32Ty(Context), Elts.size()); 2624 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2625 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty); 2626 } 2627 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){ 2628 Type *Ty = VectorType::get(Type::getInt64Ty(Context), Elts.size()); 2629 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2630 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty); 2631 } 2632 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<float> Elts) { 2633 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size()); 2634 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2635 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty); 2636 } 2637 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<double> Elts) { 2638 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size()); 2639 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2640 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty); 2641 } 2642 2643 /// getFP() constructors - Return a constant with vector type with an element 2644 /// count and element type of float with the precision matching the number of 2645 /// bits in the ArrayRef passed in. (i.e. half for 16bits, float for 32bits, 2646 /// double for 64bits) Note that this can return a ConstantAggregateZero 2647 /// object. 2648 Constant *ConstantDataVector::getFP(LLVMContext &Context, 2649 ArrayRef<uint16_t> Elts) { 2650 Type *Ty = VectorType::get(Type::getHalfTy(Context), Elts.size()); 2651 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2652 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 2), Ty); 2653 } 2654 Constant *ConstantDataVector::getFP(LLVMContext &Context, 2655 ArrayRef<uint32_t> Elts) { 2656 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size()); 2657 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2658 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 4), Ty); 2659 } 2660 Constant *ConstantDataVector::getFP(LLVMContext &Context, 2661 ArrayRef<uint64_t> Elts) { 2662 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size()); 2663 const char *Data = reinterpret_cast<const char *>(Elts.data()); 2664 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty); 2665 } 2666 2667 Constant *ConstantDataVector::getSplat(unsigned NumElts, Constant *V) { 2668 assert(isElementTypeCompatible(V->getType()) && 2669 "Element type not compatible with ConstantData"); 2670 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) { 2671 if (CI->getType()->isIntegerTy(8)) { 2672 SmallVector<uint8_t, 16> Elts(NumElts, CI->getZExtValue()); 2673 return get(V->getContext(), Elts); 2674 } 2675 if (CI->getType()->isIntegerTy(16)) { 2676 SmallVector<uint16_t, 16> Elts(NumElts, CI->getZExtValue()); 2677 return get(V->getContext(), Elts); 2678 } 2679 if (CI->getType()->isIntegerTy(32)) { 2680 SmallVector<uint32_t, 16> Elts(NumElts, CI->getZExtValue()); 2681 return get(V->getContext(), Elts); 2682 } 2683 assert(CI->getType()->isIntegerTy(64) && "Unsupported ConstantData type"); 2684 SmallVector<uint64_t, 16> Elts(NumElts, CI->getZExtValue()); 2685 return get(V->getContext(), Elts); 2686 } 2687 2688 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) { 2689 if (CFP->getType()->isFloatTy()) { 2690 SmallVector<uint32_t, 16> Elts( 2691 NumElts, CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 2692 return getFP(V->getContext(), Elts); 2693 } 2694 if (CFP->getType()->isDoubleTy()) { 2695 SmallVector<uint64_t, 16> Elts( 2696 NumElts, CFP->getValueAPF().bitcastToAPInt().getLimitedValue()); 2697 return getFP(V->getContext(), Elts); 2698 } 2699 } 2700 return ConstantVector::getSplat(NumElts, V); 2701 } 2702 2703 2704 /// getElementAsInteger - If this is a sequential container of integers (of 2705 /// any size), return the specified element in the low bits of a uint64_t. 2706 uint64_t ConstantDataSequential::getElementAsInteger(unsigned Elt) const { 2707 assert(isa<IntegerType>(getElementType()) && 2708 "Accessor can only be used when element is an integer"); 2709 const char *EltPtr = getElementPointer(Elt); 2710 2711 // The data is stored in host byte order, make sure to cast back to the right 2712 // type to load with the right endianness. 2713 switch (getElementType()->getIntegerBitWidth()) { 2714 default: llvm_unreachable("Invalid bitwidth for CDS"); 2715 case 8: 2716 return *const_cast<uint8_t *>(reinterpret_cast<const uint8_t *>(EltPtr)); 2717 case 16: 2718 return *const_cast<uint16_t *>(reinterpret_cast<const uint16_t *>(EltPtr)); 2719 case 32: 2720 return *const_cast<uint32_t *>(reinterpret_cast<const uint32_t *>(EltPtr)); 2721 case 64: 2722 return *const_cast<uint64_t *>(reinterpret_cast<const uint64_t *>(EltPtr)); 2723 } 2724 } 2725 2726 /// getElementAsAPFloat - If this is a sequential container of floating point 2727 /// type, return the specified element as an APFloat. 2728 APFloat ConstantDataSequential::getElementAsAPFloat(unsigned Elt) const { 2729 const char *EltPtr = getElementPointer(Elt); 2730 2731 switch (getElementType()->getTypeID()) { 2732 default: 2733 llvm_unreachable("Accessor can only be used when element is float/double!"); 2734 case Type::FloatTyID: { 2735 auto EltVal = *reinterpret_cast<const uint32_t *>(EltPtr); 2736 return APFloat(APFloat::IEEEsingle, APInt(32, EltVal)); 2737 } 2738 case Type::DoubleTyID: { 2739 auto EltVal = *reinterpret_cast<const uint64_t *>(EltPtr); 2740 return APFloat(APFloat::IEEEdouble, APInt(64, EltVal)); 2741 } 2742 } 2743 } 2744 2745 /// getElementAsFloat - If this is an sequential container of floats, return 2746 /// the specified element as a float. 2747 float ConstantDataSequential::getElementAsFloat(unsigned Elt) const { 2748 assert(getElementType()->isFloatTy() && 2749 "Accessor can only be used when element is a 'float'"); 2750 const float *EltPtr = reinterpret_cast<const float *>(getElementPointer(Elt)); 2751 return *const_cast<float *>(EltPtr); 2752 } 2753 2754 /// getElementAsDouble - If this is an sequential container of doubles, return 2755 /// the specified element as a float. 2756 double ConstantDataSequential::getElementAsDouble(unsigned Elt) const { 2757 assert(getElementType()->isDoubleTy() && 2758 "Accessor can only be used when element is a 'float'"); 2759 const double *EltPtr = 2760 reinterpret_cast<const double *>(getElementPointer(Elt)); 2761 return *const_cast<double *>(EltPtr); 2762 } 2763 2764 /// getElementAsConstant - Return a Constant for a specified index's element. 2765 /// Note that this has to compute a new constant to return, so it isn't as 2766 /// efficient as getElementAsInteger/Float/Double. 2767 Constant *ConstantDataSequential::getElementAsConstant(unsigned Elt) const { 2768 if (getElementType()->isFloatTy() || getElementType()->isDoubleTy()) 2769 return ConstantFP::get(getContext(), getElementAsAPFloat(Elt)); 2770 2771 return ConstantInt::get(getElementType(), getElementAsInteger(Elt)); 2772 } 2773 2774 /// isString - This method returns true if this is an array of i8. 2775 bool ConstantDataSequential::isString() const { 2776 return isa<ArrayType>(getType()) && getElementType()->isIntegerTy(8); 2777 } 2778 2779 /// isCString - This method returns true if the array "isString", ends with a 2780 /// nul byte, and does not contains any other nul bytes. 2781 bool ConstantDataSequential::isCString() const { 2782 if (!isString()) 2783 return false; 2784 2785 StringRef Str = getAsString(); 2786 2787 // The last value must be nul. 2788 if (Str.back() != 0) return false; 2789 2790 // Other elements must be non-nul. 2791 return Str.drop_back().find(0) == StringRef::npos; 2792 } 2793 2794 /// getSplatValue - If this is a splat constant, meaning that all of the 2795 /// elements have the same value, return that value. Otherwise return nullptr. 2796 Constant *ConstantDataVector::getSplatValue() const { 2797 const char *Base = getRawDataValues().data(); 2798 2799 // Compare elements 1+ to the 0'th element. 2800 unsigned EltSize = getElementByteSize(); 2801 for (unsigned i = 1, e = getNumElements(); i != e; ++i) 2802 if (memcmp(Base, Base+i*EltSize, EltSize)) 2803 return nullptr; 2804 2805 // If they're all the same, return the 0th one as a representative. 2806 return getElementAsConstant(0); 2807 } 2808 2809 //===----------------------------------------------------------------------===// 2810 // replaceUsesOfWithOnConstant implementations 2811 2812 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of 2813 /// 'From' to be uses of 'To'. This must update the uniquing data structures 2814 /// etc. 2815 /// 2816 /// Note that we intentionally replace all uses of From with To here. Consider 2817 /// a large array that uses 'From' 1000 times. By handling this case all here, 2818 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that 2819 /// single invocation handles all 1000 uses. Handling them one at a time would 2820 /// work, but would be really slow because it would have to unique each updated 2821 /// array instance. 2822 /// 2823 void Constant::replaceUsesOfWithOnConstantImpl(Constant *Replacement) { 2824 // I do need to replace this with an existing value. 2825 assert(Replacement != this && "I didn't contain From!"); 2826 2827 // Everyone using this now uses the replacement. 2828 replaceAllUsesWith(Replacement); 2829 2830 // Delete the old constant! 2831 destroyConstant(); 2832 } 2833 2834 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To, 2835 Use *U) { 2836 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!"); 2837 Constant *ToC = cast<Constant>(To); 2838 2839 SmallVector<Constant*, 8> Values; 2840 Values.reserve(getNumOperands()); // Build replacement array. 2841 2842 // Fill values with the modified operands of the constant array. Also, 2843 // compute whether this turns into an all-zeros array. 2844 unsigned NumUpdated = 0; 2845 2846 // Keep track of whether all the values in the array are "ToC". 2847 bool AllSame = true; 2848 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) { 2849 Constant *Val = cast<Constant>(O->get()); 2850 if (Val == From) { 2851 Val = ToC; 2852 ++NumUpdated; 2853 } 2854 Values.push_back(Val); 2855 AllSame &= Val == ToC; 2856 } 2857 2858 if (AllSame && ToC->isNullValue()) { 2859 replaceUsesOfWithOnConstantImpl(ConstantAggregateZero::get(getType())); 2860 return; 2861 } 2862 if (AllSame && isa<UndefValue>(ToC)) { 2863 replaceUsesOfWithOnConstantImpl(UndefValue::get(getType())); 2864 return; 2865 } 2866 2867 // Check for any other type of constant-folding. 2868 if (Constant *C = getImpl(getType(), Values)) { 2869 replaceUsesOfWithOnConstantImpl(C); 2870 return; 2871 } 2872 2873 // Update to the new value. 2874 if (Constant *C = getContext().pImpl->ArrayConstants.replaceOperandsInPlace( 2875 Values, this, From, ToC, NumUpdated, U - OperandList)) 2876 replaceUsesOfWithOnConstantImpl(C); 2877 } 2878 2879 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To, 2880 Use *U) { 2881 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!"); 2882 Constant *ToC = cast<Constant>(To); 2883 2884 unsigned OperandToUpdate = U-OperandList; 2885 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!"); 2886 2887 SmallVector<Constant*, 8> Values; 2888 Values.reserve(getNumOperands()); // Build replacement struct. 2889 2890 // Fill values with the modified operands of the constant struct. Also, 2891 // compute whether this turns into an all-zeros struct. 2892 bool isAllZeros = false; 2893 bool isAllUndef = false; 2894 if (ToC->isNullValue()) { 2895 isAllZeros = true; 2896 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) { 2897 Constant *Val = cast<Constant>(O->get()); 2898 Values.push_back(Val); 2899 if (isAllZeros) isAllZeros = Val->isNullValue(); 2900 } 2901 } else if (isa<UndefValue>(ToC)) { 2902 isAllUndef = true; 2903 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) { 2904 Constant *Val = cast<Constant>(O->get()); 2905 Values.push_back(Val); 2906 if (isAllUndef) isAllUndef = isa<UndefValue>(Val); 2907 } 2908 } else { 2909 for (Use *O = OperandList, *E = OperandList + getNumOperands(); O != E; ++O) 2910 Values.push_back(cast<Constant>(O->get())); 2911 } 2912 Values[OperandToUpdate] = ToC; 2913 2914 if (isAllZeros) { 2915 replaceUsesOfWithOnConstantImpl(ConstantAggregateZero::get(getType())); 2916 return; 2917 } 2918 if (isAllUndef) { 2919 replaceUsesOfWithOnConstantImpl(UndefValue::get(getType())); 2920 return; 2921 } 2922 2923 // Update to the new value. 2924 if (Constant *C = getContext().pImpl->StructConstants.replaceOperandsInPlace( 2925 Values, this, From, ToC)) 2926 replaceUsesOfWithOnConstantImpl(C); 2927 } 2928 2929 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To, 2930 Use *U) { 2931 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!"); 2932 Constant *ToC = cast<Constant>(To); 2933 2934 SmallVector<Constant*, 8> Values; 2935 Values.reserve(getNumOperands()); // Build replacement array... 2936 unsigned NumUpdated = 0; 2937 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 2938 Constant *Val = getOperand(i); 2939 if (Val == From) { 2940 ++NumUpdated; 2941 Val = ToC; 2942 } 2943 Values.push_back(Val); 2944 } 2945 2946 if (Constant *C = getImpl(Values)) { 2947 replaceUsesOfWithOnConstantImpl(C); 2948 return; 2949 } 2950 2951 // Update to the new value. 2952 if (Constant *C = getContext().pImpl->VectorConstants.replaceOperandsInPlace( 2953 Values, this, From, ToC, NumUpdated, U - OperandList)) 2954 replaceUsesOfWithOnConstantImpl(C); 2955 } 2956 2957 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV, 2958 Use *U) { 2959 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!"); 2960 Constant *To = cast<Constant>(ToV); 2961 2962 SmallVector<Constant*, 8> NewOps; 2963 unsigned NumUpdated = 0; 2964 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 2965 Constant *Op = getOperand(i); 2966 if (Op == From) { 2967 ++NumUpdated; 2968 Op = To; 2969 } 2970 NewOps.push_back(Op); 2971 } 2972 assert(NumUpdated && "I didn't contain From!"); 2973 2974 if (Constant *C = getWithOperands(NewOps, getType(), true)) { 2975 replaceUsesOfWithOnConstantImpl(C); 2976 return; 2977 } 2978 2979 // Update to the new value. 2980 if (Constant *C = getContext().pImpl->ExprConstants.replaceOperandsInPlace( 2981 NewOps, this, From, To, NumUpdated, U - OperandList)) 2982 replaceUsesOfWithOnConstantImpl(C); 2983 } 2984 2985 Instruction *ConstantExpr::getAsInstruction() { 2986 SmallVector<Value *, 4> ValueOperands(op_begin(), op_end()); 2987 ArrayRef<Value*> Ops(ValueOperands); 2988 2989 switch (getOpcode()) { 2990 case Instruction::Trunc: 2991 case Instruction::ZExt: 2992 case Instruction::SExt: 2993 case Instruction::FPTrunc: 2994 case Instruction::FPExt: 2995 case Instruction::UIToFP: 2996 case Instruction::SIToFP: 2997 case Instruction::FPToUI: 2998 case Instruction::FPToSI: 2999 case Instruction::PtrToInt: 3000 case Instruction::IntToPtr: 3001 case Instruction::BitCast: 3002 case Instruction::AddrSpaceCast: 3003 return CastInst::Create((Instruction::CastOps)getOpcode(), 3004 Ops[0], getType()); 3005 case Instruction::Select: 3006 return SelectInst::Create(Ops[0], Ops[1], Ops[2]); 3007 case Instruction::InsertElement: 3008 return InsertElementInst::Create(Ops[0], Ops[1], Ops[2]); 3009 case Instruction::ExtractElement: 3010 return ExtractElementInst::Create(Ops[0], Ops[1]); 3011 case Instruction::InsertValue: 3012 return InsertValueInst::Create(Ops[0], Ops[1], getIndices()); 3013 case Instruction::ExtractValue: 3014 return ExtractValueInst::Create(Ops[0], getIndices()); 3015 case Instruction::ShuffleVector: 3016 return new ShuffleVectorInst(Ops[0], Ops[1], Ops[2]); 3017 3018 case Instruction::GetElementPtr: { 3019 const auto *GO = cast<GEPOperator>(this); 3020 if (GO->isInBounds()) 3021 return GetElementPtrInst::CreateInBounds(GO->getSourceElementType(), 3022 Ops[0], Ops.slice(1)); 3023 return GetElementPtrInst::Create(GO->getSourceElementType(), Ops[0], 3024 Ops.slice(1)); 3025 } 3026 case Instruction::ICmp: 3027 case Instruction::FCmp: 3028 return CmpInst::Create((Instruction::OtherOps)getOpcode(), 3029 getPredicate(), Ops[0], Ops[1]); 3030 3031 default: 3032 assert(getNumOperands() == 2 && "Must be binary operator?"); 3033 BinaryOperator *BO = 3034 BinaryOperator::Create((Instruction::BinaryOps)getOpcode(), 3035 Ops[0], Ops[1]); 3036 if (isa<OverflowingBinaryOperator>(BO)) { 3037 BO->setHasNoUnsignedWrap(SubclassOptionalData & 3038 OverflowingBinaryOperator::NoUnsignedWrap); 3039 BO->setHasNoSignedWrap(SubclassOptionalData & 3040 OverflowingBinaryOperator::NoSignedWrap); 3041 } 3042 if (isa<PossiblyExactOperator>(BO)) 3043 BO->setIsExact(SubclassOptionalData & PossiblyExactOperator::IsExact); 3044 return BO; 3045 } 3046 } 3047