File: recursive-type-3.ll

package info (click to toggle)
llvm-toolchain-7 1%3A7.0.1-8
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 733,456 kB
  • sloc: cpp: 3,776,651; ansic: 633,271; asm: 350,301; python: 142,716; objc: 107,612; sh: 22,626; lisp: 11,056; perl: 7,999; pascal: 6,742; ml: 5,537; awk: 3,536; makefile: 2,557; cs: 2,027; xml: 841; ruby: 156
file content (11 lines) | stat: -rw-r--r-- 282 bytes parent folder | download | duplicates (23) 
1
2
3
4
5
6
7
8
9
10
11
 
; RUN: llvm-as %s -o /dev/null 2>&1

%rt2 = type { i32, { i8, %rt2*, 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
}