File: shr-scalar-vector-consistency.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 (25 lines) | stat: -rw-r--r-- 699 bytes parent folder | download | duplicates (10) 
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
 
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -instsimplify -S | FileCheck %s

; This tests checks optimization consistency for scalar and vector code.
; If m_Zero() is able to match a vector undef, but not a scalar undef,
; the two cases will simplify differently.

define i32 @test_scalar(i32 %a, i1 %b) {
; CHECK-LABEL: @test_scalar(
; CHECK-NEXT:    ret i32 undef
;
  %c = sext i1 %b to i32
  %d = ashr i32 undef, %c
  ret i32 %d
}

define <2 x i32> @test_vector(<2 x i32> %a, <2 x i1> %b) {
; CHECK-LABEL: @test_vector(
; CHECK-NEXT:    ret <2 x i32> undef
;
  %c = sext <2 x i1> %b to <2 x i32>
  %d = ashr <2 x i32> undef, %c
  ret <2 x i32> %d
}