File: verify-undef.ll

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (35 lines) | stat: -rw-r--r-- 1,128 bytes parent folder | download | duplicates (14) 
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
 
; RUN: llc -march=hexagon -enable-pipeliner -verify-machineinstrs < %s
; REQUIRES: asserts

; This test fails in the machine verifier because the verifier thinks the
; return register is undefined, and because there is a basic block that
; ends with an unconditional branch that is not marked as a barrier.
;
; Enabling SWP exposes these bugs because the live variable analysis is
; performed earlier than the process implicit def pass.  This ordering
; causes the JMPR machine instruction to contain two R0 operands, one
; with an undef and one with a kill flag.

@g0 = common global i32 0, align 4

; Function Attrs: nounwind
define i32 @f0(i32 %a0) #0 {
b0:
  %v0 = icmp eq i32 %a0, 0
  br i1 %v0, label %b2, label %b1

b1:                                               ; preds = %b0
  %v1 = tail call i32 bitcast (i32 (...)* @f1 to i32 (i32)*)(i32 %a0) #0
  br label %b3

b2:                                               ; preds = %b0
  store i32 0, i32* @g0, align 4
  br label %b3

b3:                                               ; preds = %b2, %b1
  ret i32 undef
}

declare i32 @f1(...)

attributes #0 = { nounwind }