File: pointer.ll

package info (click to toggle)
swiftlang 6.1.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,791,604 kB
  • sloc: cpp: 9,901,740; ansic: 2,201,431; asm: 1,091,827; python: 308,252; objc: 82,166; f90: 80,126; lisp: 38,358; pascal: 25,559; sh: 20,429; ml: 5,058; perl: 4,745; makefile: 4,484; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (35 lines) | stat: -rw-r--r-- 1,113 bytes parent folder | download | duplicates (16)
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
26
27
28
29
30
31
32
33
34
35
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -passes=correlated-propagation -S -o - %s | FileCheck %s

; Testcase that checks that we don't end in a neverending recursion resulting in
; a segmentation fault. The checks below verify that nothing is changed.

declare dso_local ptr @f2(ptr readnone returned) local_unnamed_addr

define dso_local void @f3() local_unnamed_addr {
; CHECK-LABEL: @f3(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    br label [[FOR_COND:%.*]]
; CHECK:       for.end:
; CHECK-NEXT:    [[CALL6:%.*]] = call ptr @f2(ptr [[CALL6]])
; CHECK-NEXT:    br i1 false, label [[FOR_COND]], label [[FOR_COND3:%.*]]
; CHECK:       for.cond:
; CHECK-NEXT:    [[C_0:%.*]] = phi ptr [ undef, [[ENTRY:%.*]] ], [ [[CALL6]], [[FOR_END:%.*]] ]
; CHECK-NEXT:    br label [[FOR_COND3]]
; CHECK:       for.cond3:
; CHECK-NEXT:    ret void
;
entry:
  br label %for.cond

for.end:
  %call6 = call ptr @f2(ptr %call6)
  br i1 false, label %for.cond, label %for.cond3

for.cond:
  %c.0 = phi ptr [ undef, %entry ], [ %call6, %for.end ]
  br label %for.cond3

for.cond3:
  ret void
}