File: recursion.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 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 (25 lines) | stat: -rw-r--r-- 647 bytes parent folder | download | duplicates (12) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -passes=ipsccp,deadargelim -S | FileCheck %s

; CHECK-NOT: %X

define internal i32 @foo(i32 %X) {
; CHECK-LABEL: @foo(
; CHECK-NEXT:    [[Y:%.*]] = call i32 @foo()
; CHECK-NEXT:    [[Z:%.*]] = add i32 [[Y]], 1
; CHECK-NEXT:    ret i32 [[Z]]
;
  %Y = call i32 @foo( i32 %X )            ; <i32> [#uses=1]
  %Z = add i32 %Y, 1              ; <i32> [#uses=1]
  ret i32 %Z
}

define void @bar() {
; CHECK-LABEL: @bar(
; CHECK-NEXT:    [[TMP1:%.*]] = call i32 @foo()
; CHECK-NEXT:    ret void
;
  call i32 @foo( i32 17 )         ; <i32>:1 [#uses=0]
  ret void
}