File: recursive-type-3.ll

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.6-1~exp1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,304 kB
  • sloc: cpp: 7,438,677; ansic: 1,393,822; asm: 1,012,926; python: 241,650; f90: 86,635; objc: 75,479; lisp: 42,144; pascal: 17,286; sh: 10,027; ml: 5,082; perl: 4,730; awk: 3,523; makefile: 3,349; javascript: 2,251; xml: 892; fortran: 672
file content (11 lines) | stat: -rw-r--r-- 280 bytes parent folder | download | duplicates (14) 
1
2
3
4
5
6
7
8
9
10
11
 
; RUN: llvm-as %s -o /dev/null 2>&1

%rt2 = type { i32, { i8, ptr, i8 }, i32 }

define i32 @main() nounwind {
entry:
  ; Check that linked-list-style recursive types where the recursion is through
  ; a pointer of the type is valid for an alloca.
  %0 = alloca %rt2
  ret i32 0
}