1 //===-- llvm/Instruction.h - Instruction class definition -------*- C++ -*-===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This file contains the declaration of the Instruction class, which is the 10 // base class for all of the LLVM instructions. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #ifndef LLVM_IR_INSTRUCTION_H 15 #define LLVM_IR_INSTRUCTION_H 16 17 #include "llvm/ADT/ArrayRef.h" 18 #include "llvm/ADT/Bitfields.h" 19 #include "llvm/ADT/None.h" 20 #include "llvm/ADT/StringRef.h" 21 #include "llvm/ADT/ilist_node.h" 22 #include "llvm/IR/DebugLoc.h" 23 #include "llvm/IR/SymbolTableListTraits.h" 24 #include "llvm/IR/User.h" 25 #include "llvm/IR/Value.h" 26 #include "llvm/Support/AtomicOrdering.h" 27 #include "llvm/Support/Casting.h" 28 #include <algorithm> 29 #include <cassert> 30 #include <cstdint> 31 #include <utility> 32 33 namespace llvm { 34 35 class BasicBlock; 36 class FastMathFlags; 37 class MDNode; 38 class Module; 39 struct AAMDNodes; 40 41 template <> struct ilist_alloc_traits<Instruction> { 42 static inline void deleteNode(Instruction *V); 43 }; 44 45 class Instruction : public User, 46 public ilist_node_with_parent<Instruction, BasicBlock> { 47 BasicBlock *Parent; 48 DebugLoc DbgLoc; // 'dbg' Metadata cache. 49 50 /// Relative order of this instruction in its parent basic block. Used for 51 /// O(1) local dominance checks between instructions. 52 mutable unsigned Order = 0; 53 54 protected: 55 // The 15 first bits of `Value::SubclassData` are available for subclasses of 56 // `Instruction` to use. 57 using OpaqueField = Bitfield::Element<uint16_t, 0, 15>; 58 59 // Template alias so that all Instruction storing alignment use the same 60 // definiton. 61 // Valid alignments are powers of two from 2^0 to 2^MaxAlignmentExponent = 62 // 2^29. We store them as Log2(Alignment), so we need 5 bits to encode the 30 63 // possible values. 64 template <unsigned Offset> 65 using AlignmentBitfieldElementT = 66 typename Bitfield::Element<unsigned, Offset, 5, 67 Value::MaxAlignmentExponent>; 68 69 template <unsigned Offset> 70 using BoolBitfieldElementT = typename Bitfield::Element<bool, Offset, 1>; 71 72 template <unsigned Offset> 73 using AtomicOrderingBitfieldElementT = 74 typename Bitfield::Element<AtomicOrdering, Offset, 3, 75 AtomicOrdering::LAST>; 76 77 private: 78 // The last bit is used to store whether the instruction has metadata attached 79 // or not. 80 using HasMetadataField = Bitfield::Element<bool, 15, 1>; 81 82 protected: 83 ~Instruction(); // Use deleteValue() to delete a generic Instruction. 84 85 public: 86 Instruction(const Instruction &) = delete; 87 Instruction &operator=(const Instruction &) = delete; 88 89 /// Specialize the methods defined in Value, as we know that an instruction 90 /// can only be used by other instructions. 91 Instruction *user_back() { return cast<Instruction>(*user_begin());} 92 const Instruction *user_back() const { return cast<Instruction>(*user_begin());} 93 94 inline const BasicBlock *getParent() const { return Parent; } 95 inline BasicBlock *getParent() { return Parent; } 96 97 /// Return the module owning the function this instruction belongs to 98 /// or nullptr it the function does not have a module. 99 /// 100 /// Note: this is undefined behavior if the instruction does not have a 101 /// parent, or the parent basic block does not have a parent function. 102 const Module *getModule() const; 103 Module *getModule() { 104 return const_cast<Module *>( 105 static_cast<const Instruction *>(this)->getModule()); 106 } 107 108 /// Return the function this instruction belongs to. 109 /// 110 /// Note: it is undefined behavior to call this on an instruction not 111 /// currently inserted into a function. 112 const Function *getFunction() const; 113 Function *getFunction() { 114 return const_cast<Function *>( 115 static_cast<const Instruction *>(this)->getFunction()); 116 } 117 118 /// This method unlinks 'this' from the containing basic block, but does not 119 /// delete it. 120 void removeFromParent(); 121 122 /// This method unlinks 'this' from the containing basic block and deletes it. 123 /// 124 /// \returns an iterator pointing to the element after the erased one 125 SymbolTableList<Instruction>::iterator eraseFromParent(); 126 127 /// Insert an unlinked instruction into a basic block immediately before 128 /// the specified instruction. 129 void insertBefore(Instruction *InsertPos); 130 131 /// Insert an unlinked instruction into a basic block immediately after the 132 /// specified instruction. 133 void insertAfter(Instruction *InsertPos); 134 135 /// Unlink this instruction from its current basic block and insert it into 136 /// the basic block that MovePos lives in, right before MovePos. 137 void moveBefore(Instruction *MovePos); 138 139 /// Unlink this instruction and insert into BB before I. 140 /// 141 /// \pre I is a valid iterator into BB. 142 void moveBefore(BasicBlock &BB, SymbolTableList<Instruction>::iterator I); 143 144 /// Unlink this instruction from its current basic block and insert it into 145 /// the basic block that MovePos lives in, right after MovePos. 146 void moveAfter(Instruction *MovePos); 147 148 /// Given an instruction Other in the same basic block as this instruction, 149 /// return true if this instruction comes before Other. In this worst case, 150 /// this takes linear time in the number of instructions in the block. The 151 /// results are cached, so in common cases when the block remains unmodified, 152 /// it takes constant time. 153 bool comesBefore(const Instruction *Other) const; 154 155 //===--------------------------------------------------------------------===// 156 // Subclass classification. 157 //===--------------------------------------------------------------------===// 158 159 /// Returns a member of one of the enums like Instruction::Add. 160 unsigned getOpcode() const { return getValueID() - InstructionVal; } 161 162 const char *getOpcodeName() const { return getOpcodeName(getOpcode()); } 163 bool isTerminator() const { return isTerminator(getOpcode()); } 164 bool isUnaryOp() const { return isUnaryOp(getOpcode()); } 165 bool isBinaryOp() const { return isBinaryOp(getOpcode()); } 166 bool isIntDivRem() const { return isIntDivRem(getOpcode()); } 167 bool isShift() const { return isShift(getOpcode()); } 168 bool isCast() const { return isCast(getOpcode()); } 169 bool isFuncletPad() const { return isFuncletPad(getOpcode()); } 170 bool isExceptionalTerminator() const { 171 return isExceptionalTerminator(getOpcode()); 172 } 173 174 /// It checks if this instruction is the only user of at least one of 175 /// its operands. 176 bool isOnlyUserOfAnyOperand(); 177 178 bool isIndirectTerminator() const { 179 return isIndirectTerminator(getOpcode()); 180 } 181 182 static const char* getOpcodeName(unsigned OpCode); 183 184 static inline bool isTerminator(unsigned OpCode) { 185 return OpCode >= TermOpsBegin && OpCode < TermOpsEnd; 186 } 187 188 static inline bool isUnaryOp(unsigned Opcode) { 189 return Opcode >= UnaryOpsBegin && Opcode < UnaryOpsEnd; 190 } 191 static inline bool isBinaryOp(unsigned Opcode) { 192 return Opcode >= BinaryOpsBegin && Opcode < BinaryOpsEnd; 193 } 194 195 static inline bool isIntDivRem(unsigned Opcode) { 196 return Opcode == UDiv || Opcode == SDiv || Opcode == URem || Opcode == SRem; 197 } 198 199 /// Determine if the Opcode is one of the shift instructions. 200 static inline bool isShift(unsigned Opcode) { 201 return Opcode >= Shl && Opcode <= AShr; 202 } 203 204 /// Return true if this is a logical shift left or a logical shift right. 205 inline bool isLogicalShift() const { 206 return getOpcode() == Shl || getOpcode() == LShr; 207 } 208 209 /// Return true if this is an arithmetic shift right. 210 inline bool isArithmeticShift() const { 211 return getOpcode() == AShr; 212 } 213 214 /// Determine if the Opcode is and/or/xor. 215 static inline bool isBitwiseLogicOp(unsigned Opcode) { 216 return Opcode == And || Opcode == Or || Opcode == Xor; 217 } 218 219 /// Return true if this is and/or/xor. 220 inline bool isBitwiseLogicOp() const { 221 return isBitwiseLogicOp(getOpcode()); 222 } 223 224 /// Determine if the OpCode is one of the CastInst instructions. 225 static inline bool isCast(unsigned OpCode) { 226 return OpCode >= CastOpsBegin && OpCode < CastOpsEnd; 227 } 228 229 /// Determine if the OpCode is one of the FuncletPadInst instructions. 230 static inline bool isFuncletPad(unsigned OpCode) { 231 return OpCode >= FuncletPadOpsBegin && OpCode < FuncletPadOpsEnd; 232 } 233 234 /// Returns true if the OpCode is a terminator related to exception handling. 235 static inline bool isExceptionalTerminator(unsigned OpCode) { 236 switch (OpCode) { 237 case Instruction::CatchSwitch: 238 case Instruction::CatchRet: 239 case Instruction::CleanupRet: 240 case Instruction::Invoke: 241 case Instruction::Resume: 242 return true; 243 default: 244 return false; 245 } 246 } 247 248 /// Returns true if the OpCode is a terminator with indirect targets. 249 static inline bool isIndirectTerminator(unsigned OpCode) { 250 switch (OpCode) { 251 case Instruction::IndirectBr: 252 case Instruction::CallBr: 253 return true; 254 default: 255 return false; 256 } 257 } 258 259 //===--------------------------------------------------------------------===// 260 // Metadata manipulation. 261 //===--------------------------------------------------------------------===// 262 263 /// Return true if this instruction has any metadata attached to it. 264 bool hasMetadata() const { return DbgLoc || Value::hasMetadata(); } 265 266 /// Return true if this instruction has metadata attached to it other than a 267 /// debug location. 268 bool hasMetadataOtherThanDebugLoc() const { return Value::hasMetadata(); } 269 270 /// Return true if this instruction has the given type of metadata attached. 271 bool hasMetadata(unsigned KindID) const { 272 return getMetadata(KindID) != nullptr; 273 } 274 275 /// Return true if this instruction has the given type of metadata attached. 276 bool hasMetadata(StringRef Kind) const { 277 return getMetadata(Kind) != nullptr; 278 } 279 280 /// Get the metadata of given kind attached to this Instruction. 281 /// If the metadata is not found then return null. 282 MDNode *getMetadata(unsigned KindID) const { 283 if (!hasMetadata()) return nullptr; 284 return getMetadataImpl(KindID); 285 } 286 287 /// Get the metadata of given kind attached to this Instruction. 288 /// If the metadata is not found then return null. 289 MDNode *getMetadata(StringRef Kind) const { 290 if (!hasMetadata()) return nullptr; 291 return getMetadataImpl(Kind); 292 } 293 294 /// Get all metadata attached to this Instruction. The first element of each 295 /// pair returned is the KindID, the second element is the metadata value. 296 /// This list is returned sorted by the KindID. 297 void 298 getAllMetadata(SmallVectorImpl<std::pair<unsigned, MDNode *>> &MDs) const { 299 if (hasMetadata()) 300 getAllMetadataImpl(MDs); 301 } 302 303 /// This does the same thing as getAllMetadata, except that it filters out the 304 /// debug location. 305 void getAllMetadataOtherThanDebugLoc( 306 SmallVectorImpl<std::pair<unsigned, MDNode *>> &MDs) const { 307 Value::getAllMetadata(MDs); 308 } 309 310 /// Fills the AAMDNodes structure with AA metadata from this instruction. 311 /// When Merge is true, the existing AA metadata is merged with that from this 312 /// instruction providing the most-general result. 313 void getAAMetadata(AAMDNodes &N, bool Merge = false) const; 314 315 /// Set the metadata of the specified kind to the specified node. This updates 316 /// or replaces metadata if already present, or removes it if Node is null. 317 void setMetadata(unsigned KindID, MDNode *Node); 318 void setMetadata(StringRef Kind, MDNode *Node); 319 320 /// Copy metadata from \p SrcInst to this instruction. \p WL, if not empty, 321 /// specifies the list of meta data that needs to be copied. If \p WL is 322 /// empty, all meta data will be copied. 323 void copyMetadata(const Instruction &SrcInst, 324 ArrayRef<unsigned> WL = ArrayRef<unsigned>()); 325 326 /// If the instruction has "branch_weights" MD_prof metadata and the MDNode 327 /// has three operands (including name string), swap the order of the 328 /// metadata. 329 void swapProfMetadata(); 330 331 /// Drop all unknown metadata except for debug locations. 332 /// @{ 333 /// Passes are required to drop metadata they don't understand. This is a 334 /// convenience method for passes to do so. 335 /// dropUndefImplyingAttrsAndUnknownMetadata should be used instead of 336 /// this API if the Instruction being modified is a call. 337 void dropUnknownNonDebugMetadata(ArrayRef<unsigned> KnownIDs); 338 void dropUnknownNonDebugMetadata() { 339 return dropUnknownNonDebugMetadata(None); 340 } 341 void dropUnknownNonDebugMetadata(unsigned ID1) { 342 return dropUnknownNonDebugMetadata(makeArrayRef(ID1)); 343 } 344 void dropUnknownNonDebugMetadata(unsigned ID1, unsigned ID2) { 345 unsigned IDs[] = {ID1, ID2}; 346 return dropUnknownNonDebugMetadata(IDs); 347 } 348 /// @} 349 350 /// Adds an !annotation metadata node with \p Annotation to this instruction. 351 /// If this instruction already has !annotation metadata, append \p Annotation 352 /// to the existing node. 353 void addAnnotationMetadata(StringRef Annotation); 354 355 /// Sets the metadata on this instruction from the AAMDNodes structure. 356 void setAAMetadata(const AAMDNodes &N); 357 358 /// Retrieve the raw weight values of a conditional branch or select. 359 /// Returns true on success with profile weights filled in. 360 /// Returns false if no metadata or invalid metadata was found. 361 bool extractProfMetadata(uint64_t &TrueVal, uint64_t &FalseVal) const; 362 363 /// Retrieve total raw weight values of a branch. 364 /// Returns true on success with profile total weights filled in. 365 /// Returns false if no metadata was found. 366 bool extractProfTotalWeight(uint64_t &TotalVal) const; 367 368 /// Set the debug location information for this instruction. 369 void setDebugLoc(DebugLoc Loc) { DbgLoc = std::move(Loc); } 370 371 /// Return the debug location for this node as a DebugLoc. 372 const DebugLoc &getDebugLoc() const { return DbgLoc; } 373 374 /// Set or clear the nuw flag on this instruction, which must be an operator 375 /// which supports this flag. See LangRef.html for the meaning of this flag. 376 void setHasNoUnsignedWrap(bool b = true); 377 378 /// Set or clear the nsw flag on this instruction, which must be an operator 379 /// which supports this flag. See LangRef.html for the meaning of this flag. 380 void setHasNoSignedWrap(bool b = true); 381 382 /// Set or clear the exact flag on this instruction, which must be an operator 383 /// which supports this flag. See LangRef.html for the meaning of this flag. 384 void setIsExact(bool b = true); 385 386 /// Determine whether the no unsigned wrap flag is set. 387 bool hasNoUnsignedWrap() const; 388 389 /// Determine whether the no signed wrap flag is set. 390 bool hasNoSignedWrap() const; 391 392 /// Drops flags that may cause this instruction to evaluate to poison despite 393 /// having non-poison inputs. 394 void dropPoisonGeneratingFlags(); 395 396 /// This function drops non-debug unknown metadata (through 397 /// dropUnknownNonDebugMetadata). For calls, it also drops parameter and 398 /// return attributes that can cause undefined behaviour. Both of these should 399 /// be done by passes which move instructions in IR. 400 void 401 dropUndefImplyingAttrsAndUnknownMetadata(ArrayRef<unsigned> KnownIDs = {}); 402 403 /// Determine whether the exact flag is set. 404 bool isExact() const; 405 406 /// Set or clear all fast-math-flags on this instruction, which must be an 407 /// operator which supports this flag. See LangRef.html for the meaning of 408 /// this flag. 409 void setFast(bool B); 410 411 /// Set or clear the reassociation flag on this instruction, which must be 412 /// an operator which supports this flag. See LangRef.html for the meaning of 413 /// this flag. 414 void setHasAllowReassoc(bool B); 415 416 /// Set or clear the no-nans flag on this instruction, which must be an 417 /// operator which supports this flag. See LangRef.html for the meaning of 418 /// this flag. 419 void setHasNoNaNs(bool B); 420 421 /// Set or clear the no-infs flag on this instruction, which must be an 422 /// operator which supports this flag. See LangRef.html for the meaning of 423 /// this flag. 424 void setHasNoInfs(bool B); 425 426 /// Set or clear the no-signed-zeros flag on this instruction, which must be 427 /// an operator which supports this flag. See LangRef.html for the meaning of 428 /// this flag. 429 void setHasNoSignedZeros(bool B); 430 431 /// Set or clear the allow-reciprocal flag on this instruction, which must be 432 /// an operator which supports this flag. See LangRef.html for the meaning of 433 /// this flag. 434 void setHasAllowReciprocal(bool B); 435 436 /// Set or clear the allow-contract flag on this instruction, which must be 437 /// an operator which supports this flag. See LangRef.html for the meaning of 438 /// this flag. 439 void setHasAllowContract(bool B); 440 441 /// Set or clear the approximate-math-functions flag on this instruction, 442 /// which must be an operator which supports this flag. See LangRef.html for 443 /// the meaning of this flag. 444 void setHasApproxFunc(bool B); 445 446 /// Convenience function for setting multiple fast-math flags on this 447 /// instruction, which must be an operator which supports these flags. See 448 /// LangRef.html for the meaning of these flags. 449 void setFastMathFlags(FastMathFlags FMF); 450 451 /// Convenience function for transferring all fast-math flag values to this 452 /// instruction, which must be an operator which supports these flags. See 453 /// LangRef.html for the meaning of these flags. 454 void copyFastMathFlags(FastMathFlags FMF); 455 456 /// Determine whether all fast-math-flags are set. 457 bool isFast() const; 458 459 /// Determine whether the allow-reassociation flag is set. 460 bool hasAllowReassoc() const; 461 462 /// Determine whether the no-NaNs flag is set. 463 bool hasNoNaNs() const; 464 465 /// Determine whether the no-infs flag is set. 466 bool hasNoInfs() const; 467 468 /// Determine whether the no-signed-zeros flag is set. 469 bool hasNoSignedZeros() const; 470 471 /// Determine whether the allow-reciprocal flag is set. 472 bool hasAllowReciprocal() const; 473 474 /// Determine whether the allow-contract flag is set. 475 bool hasAllowContract() const; 476 477 /// Determine whether the approximate-math-functions flag is set. 478 bool hasApproxFunc() const; 479 480 /// Convenience function for getting all the fast-math flags, which must be an 481 /// operator which supports these flags. See LangRef.html for the meaning of 482 /// these flags. 483 FastMathFlags getFastMathFlags() const; 484 485 /// Copy I's fast-math flags 486 void copyFastMathFlags(const Instruction *I); 487 488 /// Convenience method to copy supported exact, fast-math, and (optionally) 489 /// wrapping flags from V to this instruction. 490 void copyIRFlags(const Value *V, bool IncludeWrapFlags = true); 491 492 /// Logical 'and' of any supported wrapping, exact, and fast-math flags of 493 /// V and this instruction. 494 void andIRFlags(const Value *V); 495 496 /// Merge 2 debug locations and apply it to the Instruction. If the 497 /// instruction is a CallIns, we need to traverse the inline chain to find 498 /// the common scope. This is not efficient for N-way merging as each time 499 /// you merge 2 iterations, you need to rebuild the hashmap to find the 500 /// common scope. However, we still choose this API because: 501 /// 1) Simplicity: it takes 2 locations instead of a list of locations. 502 /// 2) In worst case, it increases the complexity from O(N*I) to 503 /// O(2*N*I), where N is # of Instructions to merge, and I is the 504 /// maximum level of inline stack. So it is still linear. 505 /// 3) Merging of call instructions should be extremely rare in real 506 /// applications, thus the N-way merging should be in code path. 507 /// The DebugLoc attached to this instruction will be overwritten by the 508 /// merged DebugLoc. 509 void applyMergedLocation(const DILocation *LocA, const DILocation *LocB); 510 511 /// Updates the debug location given that the instruction has been hoisted 512 /// from a block to a predecessor of that block. 513 /// Note: it is undefined behavior to call this on an instruction not 514 /// currently inserted into a function. 515 void updateLocationAfterHoist(); 516 517 /// Drop the instruction's debug location. This does not guarantee removal 518 /// of the !dbg source location attachment, as it must set a line 0 location 519 /// with scope information attached on call instructions. To guarantee 520 /// removal of the !dbg attachment, use the \ref setDebugLoc() API. 521 /// Note: it is undefined behavior to call this on an instruction not 522 /// currently inserted into a function. 523 void dropLocation(); 524 525 private: 526 // These are all implemented in Metadata.cpp. 527 MDNode *getMetadataImpl(unsigned KindID) const; 528 MDNode *getMetadataImpl(StringRef Kind) const; 529 void 530 getAllMetadataImpl(SmallVectorImpl<std::pair<unsigned, MDNode *>> &) const; 531 532 public: 533 //===--------------------------------------------------------------------===// 534 // Predicates and helper methods. 535 //===--------------------------------------------------------------------===// 536 537 /// Return true if the instruction is associative: 538 /// 539 /// Associative operators satisfy: x op (y op z) === (x op y) op z 540 /// 541 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. 542 /// 543 bool isAssociative() const LLVM_READONLY; 544 static bool isAssociative(unsigned Opcode) { 545 return Opcode == And || Opcode == Or || Opcode == Xor || 546 Opcode == Add || Opcode == Mul; 547 } 548 549 /// Return true if the instruction is commutative: 550 /// 551 /// Commutative operators satisfy: (x op y) === (y op x) 552 /// 553 /// In LLVM, these are the commutative operators, plus SetEQ and SetNE, when 554 /// applied to any type. 555 /// 556 bool isCommutative() const LLVM_READONLY; 557 static bool isCommutative(unsigned Opcode) { 558 switch (Opcode) { 559 case Add: case FAdd: 560 case Mul: case FMul: 561 case And: case Or: case Xor: 562 return true; 563 default: 564 return false; 565 } 566 } 567 568 /// Return true if the instruction is idempotent: 569 /// 570 /// Idempotent operators satisfy: x op x === x 571 /// 572 /// In LLVM, the And and Or operators are idempotent. 573 /// 574 bool isIdempotent() const { return isIdempotent(getOpcode()); } 575 static bool isIdempotent(unsigned Opcode) { 576 return Opcode == And || Opcode == Or; 577 } 578 579 /// Return true if the instruction is nilpotent: 580 /// 581 /// Nilpotent operators satisfy: x op x === Id, 582 /// 583 /// where Id is the identity for the operator, i.e. a constant such that 584 /// x op Id === x and Id op x === x for all x. 585 /// 586 /// In LLVM, the Xor operator is nilpotent. 587 /// 588 bool isNilpotent() const { return isNilpotent(getOpcode()); } 589 static bool isNilpotent(unsigned Opcode) { 590 return Opcode == Xor; 591 } 592 593 /// Return true if this instruction may modify memory. 594 bool mayWriteToMemory() const; 595 596 /// Return true if this instruction may read memory. 597 bool mayReadFromMemory() const; 598 599 /// Return true if this instruction may read or write memory. 600 bool mayReadOrWriteMemory() const { 601 return mayReadFromMemory() || mayWriteToMemory(); 602 } 603 604 /// Return true if this instruction has an AtomicOrdering of unordered or 605 /// higher. 606 bool isAtomic() const; 607 608 /// Return true if this atomic instruction loads from memory. 609 bool hasAtomicLoad() const; 610 611 /// Return true if this atomic instruction stores to memory. 612 bool hasAtomicStore() const; 613 614 /// Return true if this instruction has a volatile memory access. 615 bool isVolatile() const; 616 617 /// Return true if this instruction may throw an exception. 618 bool mayThrow() const; 619 620 /// Return true if this instruction behaves like a memory fence: it can load 621 /// or store to memory location without being given a memory location. 622 bool isFenceLike() const { 623 switch (getOpcode()) { 624 default: 625 return false; 626 // This list should be kept in sync with the list in mayWriteToMemory for 627 // all opcodes which don't have a memory location. 628 case Instruction::Fence: 629 case Instruction::CatchPad: 630 case Instruction::CatchRet: 631 case Instruction::Call: 632 case Instruction::Invoke: 633 return true; 634 } 635 } 636 637 /// Return true if the instruction may have side effects. 638 /// 639 /// Side effects are: 640 /// * Writing to memory. 641 /// * Unwinding. 642 /// * Not returning (e.g. an infinite loop). 643 /// 644 /// Note that this does not consider malloc and alloca to have side 645 /// effects because the newly allocated memory is completely invisible to 646 /// instructions which don't use the returned value. For cases where this 647 /// matters, isSafeToSpeculativelyExecute may be more appropriate. 648 bool mayHaveSideEffects() const; 649 650 /// Return true if the instruction can be removed if the result is unused. 651 /// 652 /// When constant folding some instructions cannot be removed even if their 653 /// results are unused. Specifically terminator instructions and calls that 654 /// may have side effects cannot be removed without semantically changing the 655 /// generated program. 656 bool isSafeToRemove() const; 657 658 /// Return true if the instruction will return (unwinding is considered as 659 /// a form of returning control flow here). 660 bool willReturn() const; 661 662 /// Return true if the instruction is a variety of EH-block. 663 bool isEHPad() const { 664 switch (getOpcode()) { 665 case Instruction::CatchSwitch: 666 case Instruction::CatchPad: 667 case Instruction::CleanupPad: 668 case Instruction::LandingPad: 669 return true; 670 default: 671 return false; 672 } 673 } 674 675 /// Return true if the instruction is a llvm.lifetime.start or 676 /// llvm.lifetime.end marker. 677 bool isLifetimeStartOrEnd() const; 678 679 /// Return true if the instruction is a llvm.launder.invariant.group or 680 /// llvm.strip.invariant.group. 681 bool isLaunderOrStripInvariantGroup() const; 682 683 /// Return true if the instruction is a DbgInfoIntrinsic or PseudoProbeInst. 684 bool isDebugOrPseudoInst() const; 685 686 /// Return a pointer to the next non-debug instruction in the same basic 687 /// block as 'this', or nullptr if no such instruction exists. Skip any pseudo 688 /// operations if \c SkipPseudoOp is true. 689 const Instruction * 690 getNextNonDebugInstruction(bool SkipPseudoOp = false) const; 691 Instruction *getNextNonDebugInstruction(bool SkipPseudoOp = false) { 692 return const_cast<Instruction *>( 693 static_cast<const Instruction *>(this)->getNextNonDebugInstruction( 694 SkipPseudoOp)); 695 } 696 697 /// Return a pointer to the previous non-debug instruction in the same basic 698 /// block as 'this', or nullptr if no such instruction exists. Skip any pseudo 699 /// operations if \c SkipPseudoOp is true. 700 const Instruction * 701 getPrevNonDebugInstruction(bool SkipPseudoOp = false) const; 702 Instruction *getPrevNonDebugInstruction(bool SkipPseudoOp = false) { 703 return const_cast<Instruction *>( 704 static_cast<const Instruction *>(this)->getPrevNonDebugInstruction( 705 SkipPseudoOp)); 706 } 707 708 /// Create a copy of 'this' instruction that is identical in all ways except 709 /// the following: 710 /// * The instruction has no parent 711 /// * The instruction has no name 712 /// 713 Instruction *clone() const; 714 715 /// Return true if the specified instruction is exactly identical to the 716 /// current one. This means that all operands match and any extra information 717 /// (e.g. load is volatile) agree. 718 bool isIdenticalTo(const Instruction *I) const; 719 720 /// This is like isIdenticalTo, except that it ignores the 721 /// SubclassOptionalData flags, which may specify conditions under which the 722 /// instruction's result is undefined. 723 bool isIdenticalToWhenDefined(const Instruction *I) const; 724 725 /// When checking for operation equivalence (using isSameOperationAs) it is 726 /// sometimes useful to ignore certain attributes. 727 enum OperationEquivalenceFlags { 728 /// Check for equivalence ignoring load/store alignment. 729 CompareIgnoringAlignment = 1<<0, 730 /// Check for equivalence treating a type and a vector of that type 731 /// as equivalent. 732 CompareUsingScalarTypes = 1<<1 733 }; 734 735 /// This function determines if the specified instruction executes the same 736 /// operation as the current one. This means that the opcodes, type, operand 737 /// types and any other factors affecting the operation must be the same. This 738 /// is similar to isIdenticalTo except the operands themselves don't have to 739 /// be identical. 740 /// @returns true if the specified instruction is the same operation as 741 /// the current one. 742 /// Determine if one instruction is the same operation as another. 743 bool isSameOperationAs(const Instruction *I, unsigned flags = 0) const; 744 745 /// Return true if there are any uses of this instruction in blocks other than 746 /// the specified block. Note that PHI nodes are considered to evaluate their 747 /// operands in the corresponding predecessor block. 748 bool isUsedOutsideOfBlock(const BasicBlock *BB) const; 749 750 /// Return the number of successors that this instruction has. The instruction 751 /// must be a terminator. 752 unsigned getNumSuccessors() const; 753 754 /// Return the specified successor. This instruction must be a terminator. 755 BasicBlock *getSuccessor(unsigned Idx) const; 756 757 /// Update the specified successor to point at the provided block. This 758 /// instruction must be a terminator. 759 void setSuccessor(unsigned Idx, BasicBlock *BB); 760 761 /// Replace specified successor OldBB to point at the provided block. 762 /// This instruction must be a terminator. 763 void replaceSuccessorWith(BasicBlock *OldBB, BasicBlock *NewBB); 764 765 /// Methods for support type inquiry through isa, cast, and dyn_cast: 766 static bool classof(const Value *V) { 767 return V->getValueID() >= Value::InstructionVal; 768 } 769 770 //---------------------------------------------------------------------- 771 // Exported enumerations. 772 // 773 enum TermOps { // These terminate basic blocks 774 #define FIRST_TERM_INST(N) TermOpsBegin = N, 775 #define HANDLE_TERM_INST(N, OPC, CLASS) OPC = N, 776 #define LAST_TERM_INST(N) TermOpsEnd = N+1 777 #include "llvm/IR/Instruction.def" 778 }; 779 780 enum UnaryOps { 781 #define FIRST_UNARY_INST(N) UnaryOpsBegin = N, 782 #define HANDLE_UNARY_INST(N, OPC, CLASS) OPC = N, 783 #define LAST_UNARY_INST(N) UnaryOpsEnd = N+1 784 #include "llvm/IR/Instruction.def" 785 }; 786 787 enum BinaryOps { 788 #define FIRST_BINARY_INST(N) BinaryOpsBegin = N, 789 #define HANDLE_BINARY_INST(N, OPC, CLASS) OPC = N, 790 #define LAST_BINARY_INST(N) BinaryOpsEnd = N+1 791 #include "llvm/IR/Instruction.def" 792 }; 793 794 enum MemoryOps { 795 #define FIRST_MEMORY_INST(N) MemoryOpsBegin = N, 796 #define HANDLE_MEMORY_INST(N, OPC, CLASS) OPC = N, 797 #define LAST_MEMORY_INST(N) MemoryOpsEnd = N+1 798 #include "llvm/IR/Instruction.def" 799 }; 800 801 enum CastOps { 802 #define FIRST_CAST_INST(N) CastOpsBegin = N, 803 #define HANDLE_CAST_INST(N, OPC, CLASS) OPC = N, 804 #define LAST_CAST_INST(N) CastOpsEnd = N+1 805 #include "llvm/IR/Instruction.def" 806 }; 807 808 enum FuncletPadOps { 809 #define FIRST_FUNCLETPAD_INST(N) FuncletPadOpsBegin = N, 810 #define HANDLE_FUNCLETPAD_INST(N, OPC, CLASS) OPC = N, 811 #define LAST_FUNCLETPAD_INST(N) FuncletPadOpsEnd = N+1 812 #include "llvm/IR/Instruction.def" 813 }; 814 815 enum OtherOps { 816 #define FIRST_OTHER_INST(N) OtherOpsBegin = N, 817 #define HANDLE_OTHER_INST(N, OPC, CLASS) OPC = N, 818 #define LAST_OTHER_INST(N) OtherOpsEnd = N+1 819 #include "llvm/IR/Instruction.def" 820 }; 821 822 private: 823 friend class SymbolTableListTraits<Instruction>; 824 friend class BasicBlock; // For renumbering. 825 826 // Shadow Value::setValueSubclassData with a private forwarding method so that 827 // subclasses cannot accidentally use it. 828 void setValueSubclassData(unsigned short D) { 829 Value::setValueSubclassData(D); 830 } 831 832 unsigned short getSubclassDataFromValue() const { 833 return Value::getSubclassDataFromValue(); 834 } 835 836 void setParent(BasicBlock *P); 837 838 protected: 839 // Instruction subclasses can stick up to 15 bits of stuff into the 840 // SubclassData field of instruction with these members. 841 842 template <typename BitfieldElement> 843 typename BitfieldElement::Type getSubclassData() const { 844 static_assert( 845 std::is_same<BitfieldElement, HasMetadataField>::value || 846 !Bitfield::isOverlapping<BitfieldElement, HasMetadataField>(), 847 "Must not overlap with the metadata bit"); 848 return Bitfield::get<BitfieldElement>(getSubclassDataFromValue()); 849 } 850 851 template <typename BitfieldElement> 852 void setSubclassData(typename BitfieldElement::Type Value) { 853 static_assert( 854 std::is_same<BitfieldElement, HasMetadataField>::value || 855 !Bitfield::isOverlapping<BitfieldElement, HasMetadataField>(), 856 "Must not overlap with the metadata bit"); 857 auto Storage = getSubclassDataFromValue(); 858 Bitfield::set<BitfieldElement>(Storage, Value); 859 setValueSubclassData(Storage); 860 } 861 862 Instruction(Type *Ty, unsigned iType, Use *Ops, unsigned NumOps, 863 Instruction *InsertBefore = nullptr); 864 Instruction(Type *Ty, unsigned iType, Use *Ops, unsigned NumOps, 865 BasicBlock *InsertAtEnd); 866 867 private: 868 /// Create a copy of this instruction. 869 Instruction *cloneImpl() const; 870 }; 871 872 inline void ilist_alloc_traits<Instruction>::deleteNode(Instruction *V) { 873 V->deleteValue(); 874 } 875 876 } // end namespace llvm 877 878 #endif // LLVM_IR_INSTRUCTION_H 879