File: pre-no-cost-phi.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (31 lines) | stat: -rw-r--r-- 710 bytes parent folder | download | duplicates (22) 
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
 
; RUN: opt < %s -gvn -S | FileCheck %s
; This testcase tests insertion of no-cost phis.  That is,
; when the value is already available in every predecessor,
; and we just need to insert a phi node to merge the available values.

@c = global i32 0, align 4
@d = global i32 0, align 4


define i32 @mai(i32 %foo, i32 %a, i32 %b) {
  %1 = icmp ne i32 %foo, 0
  br i1 %1, label %bb1, label %bb2

bb1:
  %2 = add nsw i32 %a, %b
  store i32 %2, i32* @c, align 4
  br label %mergeblock

bb2:
  %3 = add nsw i32 %a, %b
  store i32 %3, i32* @d, align 4
  br label %mergeblock

mergeblock:
; CHECK: pre-phi = phi i32 [ %3, %bb2 ], [ %2, %bb1 ]
; CHECK-NEXT: ret i32 %.pre-phi
  %4 = add nsw i32 %a, %b
  ret i32 %4
}