File: reduce-operands-skip-repeated-phi-input.ll

package info (click to toggle)
llvm-toolchain-snapshot 1%3A22~%2B%2B20251023025710%2B3f47a7be1ae6-1~exp5
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,336,076 kB
  • sloc: cpp: 7,822,956; ansic: 1,531,523; asm: 1,088,291; python: 260,779; f90: 98,765; objc: 70,846; lisp: 47,149; pascal: 17,852; sh: 8,636; ml: 5,111; perl: 4,720; makefile: 3,680; awk: 3,523; javascript: 2,270; xml: 892; fortran: 793
file content (32 lines) | stat: -rw-r--r-- 974 bytes parent folder | download | duplicates (17) 
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
 
; RUN: llvm-reduce --abort-on-invalid-reduction --delta-passes=operands-skip --test FileCheck --test-arg --check-prefixes=CHECK-INTERESTINGNESS --test-arg %s --test-arg --input-file %s -o %t
; RUN: FileCheck --check-prefixes=CHECK %s < %t

; Make sure if we're replacing the value in a phi, it's replaced for
; all repeats of the same incoming block.

; CHECK-INTERESTINGNESS: switch
; CHECK-INTERESTINGNESS: phi
; CHECK-INTERESTINGNESS-SAME: [ %gep1, %bb1 ]

; CHECK: %phi.ptr = phi ptr [ %arg1, %entry ], [ %arg1, %entry ], [ %gep1, %bb1 ]
define void @foo(i32 %arg0, ptr %arg1, ptr %arg2) {
entry:
  %gep0 = getelementptr i32, ptr %arg1, i32 10
  %gep1 = getelementptr i32, ptr %arg2, i32 12
  switch i32 %arg0, label %ret [
    i32 3, label %bb1
    i32 4, label %bb2
    i32 12, label %bb2
  ]

bb1:
  br label %bb2

bb2:
  %phi.ptr = phi ptr [ %gep0, %entry ], [ %gep0, %entry ], [ %gep1, %bb1 ]
  store volatile i32 0, ptr %phi.ptr
  br label %ret

ret:
  ret void
}