mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-04 01:11:44 +00:00
7cad5c0bec
This patch fixes the logic in the DAGCombiner that folds an AND node according to rule: (and (X (load V)), C) -> (X (load V)) An AND between a vector load 'X' and a constant build_vector 'C' can be folded into the load itself only if we can prove that the AND operation is redundant. The algorithm implemented by 'visitAND' firstly computes the splat value 'S' from C, and then checks if S has the lower 'B' bits set (where B is the size in bits of the vector element type). The algorithm takes into account also the 'undef' bits in the splat mask. Unfortunately, the algorithm only worked under the assumption that the size of S is a multiple of the vector element type. With this patch, we conservatively avoid folding the AND if the splat bits are not compatible with the vector element type. Added X86 test and-load-fold.ll Differential Revision: http://reviews.llvm.org/D8085 llvm-svn: 231563
16 lines
441 B
LLVM
16 lines
441 B
LLVM
; RUN: llc -mtriple=x86_64-unknown-unknown -mcpu=generic < %s | FileCheck %s
|
|
|
|
; Verify that the DAGCombiner doesn't wrongly remove the 'and' from the dag.
|
|
|
|
define i8 @foo(<4 x i8>* %V) {
|
|
; CHECK-LABEL: foo:
|
|
; CHECK: pand
|
|
; CHECK: ret
|
|
entry:
|
|
%Vp = bitcast <4 x i8>* %V to <3 x i8>*
|
|
%V3i8 = load <3 x i8>, <3 x i8>* %Vp, align 4
|
|
%0 = and <3 x i8> %V3i8, <i8 undef, i8 undef, i8 95>
|
|
%1 = extractelement <3 x i8> %0, i64 2
|
|
ret i8 %1
|
|
}
|