File: extractelement-shuffle.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; 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
}