Searched refs:MIN_INT (Results 1 – 6 of 6) sorted by relevance
9 ; EG: MIN_INT22 ; EG: MIN_INT33 ; EG: MIN_INT47 ; EG: MIN_INT48 ; EG: MIN_INT49 ; EG: MIN_INT50 ; EG: MIN_INT91 ; EG: MIN_INT92 ; EG: MIN_INT93 ; EG: MIN_INT[all …]
67 ; If %M >= MIN_INT + 1, this predicated backedge taken count would be correct (even68 ; without predicates). However, for %M < MIN_INT this would be an infinite loop.73 ; There is also a limit case here where the value of %M is MIN_INT. In this case74 ; we still have an infinite loop, since icmp sge %x, MIN_INT will always return
47 #define MIN_INT(BITS) ((BITS) == 32 ? INT32_MIN : (-(1 << (BITS - 1)))) macro176 return CLAMP(src, MIN_INT(dst_size), MAX_INT(dst_size)); in _mesa_signed_to_signed()
3 ; MIN_INT cannot be negated during reassociation
797 def MIN_INT : R600_2OP_Helper <0x37, "MIN_INT", smin>;
3129 * xpath.c: work for #303289, fix a formatting bug for MIN_INT