File: recursive-type-3.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (11 lines) | stat: -rw-r--r-- 280 bytes parent folder | download | duplicates (12) 
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
}