File: pointer.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 (35 lines) | stat: -rw-r--r-- 1,113 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
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
}