Lines Matching defs:AN
11 // Promotion is the act of changing a computation in an illegal type into a
12 // computation in a larger type. For example, implementing i8 arithmetic in an
14 // Expansion is the act of changing a computation in an illegal type into a
258 // Convert the element to an integer and promote it by hand.
425 // to an in-register extension.
427 // The high bits are not guaranteed to be anything. Insert an extend.
458 /// Promote the overflow flag of an overflowing arithmetic node.
862 // many machines (an AND instead of two shifts), so prefer it.
900 // This should only occur in unusual situations like bitcasting to an
1173 AtomicSDNode *AN = cast<AtomicSDNode>(N);
1176 ISD::ATOMIC_CMP_SWAP, SDLoc(N), AN->getMemoryVT(), VTs,
1178 AN->getMemOperand(), AN->getSuccessOrdering(), AN->getFailureOrdering(),
1179 AN->getSynchScope());
1223 /// Lower an atomic node to the appropriate builtin call.
1462 // Calculate 31-x. 31 is used instead of 32 to avoid creating an undefined
1527 // FIXME: If Amt is zero, the following shift generates an undefined result
1543 // FIXME: If Amt is zero, the following shift generates an undefined result
1559 // FIXME: If Amt is zero, the following shift generates an undefined result
1698 // For example, extension of an i48 to an i64. The operand type necessarily
2071 // If we can emit an efficient shift operation, do so now. Check to see if
2077 // the low bits are variable, emit this shift in an optimized form.
2104 // have an illegal type. Fix that first by casting the operand, otherwise
2180 // For example, extension of an i48 to an i64. The operand type necessarily
2215 // For example, extension of an i48 to an i64. Leave the low part alone,
2415 // For example, extension of an i48 to an i64. The operand type necessarily