File: recursion_infinite_optimized.sil

package info (click to toggle)
swiftlang 6.2.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,856,264 kB
  • sloc: cpp: 9,995,718; ansic: 2,234,019; asm: 1,092,167; python: 313,940; objc: 82,726; f90: 80,126; lisp: 38,373; pascal: 25,580; sh: 20,378; ml: 5,058; perl: 4,751; makefile: 4,725; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (22 lines) | stat: -rw-r--r-- 581 bytes parent folder | download 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
// RUN: %target-swift-emit-ir %s -O | %FileCheck %s

// https://github.com/apple/swift/issues/43069

sil_stage canonical

import Swift

sil @rec : $@convention(thin) (Int) -> Int {
bb0(%arg : $Int):
  %ref = function_ref @rec : $@convention(thin) (Int) -> Int
  %res = apply %ref(%arg) : $@convention(thin) (Int) -> Int
  return %res : $Int
}

// CHECK: define{{.*}} swiftcc{{( noundef)?}} [[T:i[0-9]+]] @rec([[T]] %0) #0 {
// CHECK-NEXT: entry:
// CHECK-NEXT: br label %tailrecurse
// CHECK-EMPTY:
// CHECK-NEXT: tailrecurse:
// CHECK-NEXT: br label %tailrecurse
// CHECK-NEXT: }