Clear value data entries and edge counters.

If the specified instruction defines any predicate or condition code register(s) used for predication, returns true as well as the definition predicat

The evaluation order is always stable, regardless of Commutability. The LHS is always matched first.

Collect metadata with IDs \p MetadataKinds from \p Src which should be added to all created instructions. Entries present in MedataDataToCopy but not

Return true if complex patterns for this target can mutate the DAG.

Compute the number of operands to allocate.

Compute the number of operands to allocate.

Compute the number of operands to allocate.

Constructor for an iterator past the last iteration.

Default constructor.

Return the total number of values used in \p Bundles.

CountLeadingOnes_64 - This function performs the operation of counting the number of ones from the most significant bit to the first zero bit (64 bit

CountPopulation_32 - this function counts the number of set bits in a value. Ex. CountPopulation(0xF000F000) = 8 Returns 0 if the word is zero.

CountPopulation_64 - this function counts the number of set bits in a value, (64 bit edition.)

CountTrailingOnes_64 - This function performs the operation of counting the number of ones from the least significant bit to the first zero bit (64 bi

Constructors - NumReservedValues is a hint for the number of incoming edges that this phi node will have (use 0 if you really have no idea).

Creates a new BasicBlock. If the Parent parameter is specified, the basic block is automatically inserted at either the end of the function (if Inser

Create a sequence of N insertvalue instructions, with one Value from the retVals array each, that build a aggregate return value one value at a time,

Create a call to the arithmetic_fence intrinsic.