llvm-mirror/test/Integer/a33.ll

; RUN: llvm-as %s -o - | llvm-dis > %t.ll
; RUN: diff %t.ll %s.out

; test 33 bits
;
@b = constant i33 add(i33 8589934591, i33 1)
@c = constant i33 add(i33 8589934591, i33 8589934591)
@d = constant i33 add(i33 8589934584, i33 8)
@e = constant i33 sub(i33 0 , i33 1)
@f = constant i33 sub(i33 0 , i33 8589934591)
@g = constant i33 sub(i33 2 , i33 8589934591)

@h = constant i33 shl(i33 1 , i33 33)
@i = constant i33 shl(i33 1 , i33 32)
@j = constant i33 lshr(i33 8589934591 , i33 32)
@l = constant i33 ashr(i33 8589934591 , i33 32)

@n = constant i33 mul(i33 8589934591, i33 2)
@q = constant i33 sdiv(i33 -1,        i33 4294967295)
@r = constant i33 udiv(i33 -1,        i33 4294967295)
@s = constant i33 srem(i33  1,        i33 8589934590)
@t = constant i33 urem(i33 8589934591,i33 -1)
@o = constant i33 trunc( i34 8589934592 to i33 )
@p = constant i33 trunc( i34 8589934591  to i33 )
@u = constant i33 srem(i33  -1,       i33 17)
New test cases for bit accurate integers developed by Guoling Han. llvm-svn: 33259 2007-01-16 19:08:22 +01:00			`; RUN: llvm-as %s -o - \| llvm-dis > %t.ll`
			`; RUN: diff %t.ll %s.out`

			`; test 33 bits`
			`;`
For PR761: Remove "target endian/pointersize" or add "target datalayout" to make the test parse properly or set the datalayout because defaults changes. For PR645: Make global names use the @ prefix. For llvm-upgrade changes: Fix test cases or completely remove use of llvm-upgrade for test cases that cannot survive the new renaming or upgrade capabilities. llvm-svn: 33533 2007-01-26 09:25:06 +01:00			`@b = constant i33 add(i33 8589934591, i33 1)`
			`@c = constant i33 add(i33 8589934591, i33 8589934591)`
			`@d = constant i33 add(i33 8589934584, i33 8)`
			`@e = constant i33 sub(i33 0 , i33 1)`
			`@f = constant i33 sub(i33 0 , i33 8589934591)`
			`@g = constant i33 sub(i33 2 , i33 8589934591)`
New test cases for bit accurate integers developed by Guoling Han. llvm-svn: 33259 2007-01-16 19:08:22 +01:00
Changes to support making the shift instructions be true BinaryOperators. This feature is needed in order to support shifts of more than 255 bits on large integer types. This changes the syntax for llvm assembly to make shl, ashr and lshr instructions look like a binary operator: shl i32 %X, 1 instead of shl i32 %X, i8 1 Additionally, this should help a few passes perform additional optimizations. llvm-svn: 33776 2007-02-02 03:16:23 +01:00			`@h = constant i33 shl(i33 1 , i33 33)`
			`@i = constant i33 shl(i33 1 , i33 32)`
			`@j = constant i33 lshr(i33 8589934591 , i33 32)`
			`@l = constant i33 ashr(i33 8589934591 , i33 32)`
New test cases for bit accurate integers developed by Guoling Han. llvm-svn: 33259 2007-01-16 19:08:22 +01:00
For PR761: Remove "target endian/pointersize" or add "target datalayout" to make the test parse properly or set the datalayout because defaults changes. For PR645: Make global names use the @ prefix. For llvm-upgrade changes: Fix test cases or completely remove use of llvm-upgrade for test cases that cannot survive the new renaming or upgrade capabilities. llvm-svn: 33533 2007-01-26 09:25:06 +01:00			`@n = constant i33 mul(i33 8589934591, i33 2)`
			`@q = constant i33 sdiv(i33 -1, i33 4294967295)`
			`@r = constant i33 udiv(i33 -1, i33 4294967295)`
Fix incorrect test cases for srem. The definition of srem is a remainder so that the sign of the result follows the sign of the divisor. llvm-svn: 35301 2007-03-24 22:55:26 +01:00			`@s = constant i33 srem(i33 1, i33 8589934590)`
For PR761: Remove "target endian/pointersize" or add "target datalayout" to make the test parse properly or set the datalayout because defaults changes. For PR645: Make global names use the @ prefix. For llvm-upgrade changes: Fix test cases or completely remove use of llvm-upgrade for test cases that cannot survive the new renaming or upgrade capabilities. llvm-svn: 33533 2007-01-26 09:25:06 +01:00			`@t = constant i33 urem(i33 8589934591,i33 -1)`
			`@o = constant i33 trunc( i34 8589934592 to i33 )`
			`@p = constant i33 trunc( i34 8589934591 to i33 )`
Fix incorrect test cases for srem. The definition of srem is a remainder so that the sign of the result follows the sign of the divisor. llvm-svn: 35301 2007-03-24 22:55:26 +01:00			`@u = constant i33 srem(i33 -1, i33 17)`
New test cases for bit accurate integers developed by Guoling Han. llvm-svn: 33259 2007-01-16 19:08:22 +01:00