File: forward-unreachable.ll

package info (click to toggle)
llvm-toolchain-6.0 1%3A6.0.1-10
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 598,080 kB
  • sloc: cpp: 3,046,253; ansic: 595,057; asm: 271,965; python: 128,926; objc: 106,554; sh: 21,906; lisp: 10,191; pascal: 6,094; ml: 5,544; perl: 5,265; makefile: 2,227; cs: 2,027; xml: 686; php: 212; csh: 117
file content (23 lines) | stat: -rw-r--r-- 705 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
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"

define void @test() {
entry:
  br i1 undef, label %split1, label %split2

split1:
  store i16 undef, i16* undef, align 2
 br label %merge
split2:
 br label %merge
forwardunreachable:
  br label %merge
merge:
; The forwardunreachable block still needs an entry in the phi node,
; because it is reverse reachable, so the CFG still has it as a
; predecessor of the block
; CHECK:  3 = MemoryPhi({split1,1},{split2,liveOnEntry},{forwardunreachable,liveOnEntry})
  store i16 undef, i16* undef, align 2
  ret void
}