File: extractelement-shuffle.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (14 lines) | stat: -rw-r--r-- 590 bytes parent folder | download | duplicates (28) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
 
; RUN: llc < %s
; REQUIRES: default_triple

; Examples that exhibits a bug in DAGCombine.  The case is triggered by the
; following program.  The bug is DAGCombine assumes that the bit convert
; preserves the number of elements so the optimization code tries to read
; through the 3rd mask element, which doesn't exist.
define i32 @update(<2 x i64> %val1, <2 x i64> %val2) nounwind readnone {
entry:
	%shuf = shufflevector <2 x i64> %val1, <2 x i64> %val2, <2 x i32> <i32 0, i32 3>
	%bit  = bitcast <2 x i64> %shuf to <4 x i32>
	%res =  extractelement <4 x i32> %bit, i32 3
	ret i32 %res
}