llvm-mirror/test/CodeGen/X86/i2k.ll

; RUN: llvm-as < %s | llc -march=x86

define void @foo(i2011* %x, i2011* %y, i2011* %p) nounwind {
  %a = load i2011* %x
  %b = load i2011* %y
  %c = add i2011 %a, %b
  store i2011 %c, i2011* %p
  ret void
}
Change how extended types are represented in MVTs. Instead of fiddling bits, use a union of a SimpleValueType enum and a regular Type*. This increases the size of MVT on 64-bit hosts from 32 bits to 64 bits. In most cases, this doesn't add significant overhead. There are places in codegen that use arrays of MVTs, so these are now larger, but they're small in common cases. This eliminates restrictions on the size of integer types and vector types that can be represented in codegen. As the included testcase demonstrates, it's now possible to codegen very large add operations. There are still some complications with using very large types. PR2880 is still open so they can't be used as return values on normal targets, there are no libcalls defined for very large integers so operations like multiply and divide aren't supported. This also introduces a minimal tablgen Type library, capable of handling IntegerType and VectorType. This will allow parts of TableGen that don't depend on using SimpleValueType values to handle arbitrary integer and vector types. llvm-svn: 58623 2008-11-03 18:56:27 +01:00			`; RUN: llvm-as < %s \| llc -march=x86`

			`define void @foo(i2011* %x, i2011* %y, i2011* %p) nounwind {`
			`%a = load i2011* %x`
			`%b = load i2011* %y`
			`%c = add i2011 %a, %b`
			`store i2011 %c, i2011* %p`
			`ret void`
			`}`