| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| |
|
|
| |
llvm-svn: 222634
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
Introduced new target-independent intrinsics in order to support masked vector loads and stores. The loop vectorizer optimizes loops containing conditional memory accesses by generating these intrinsics for existing targets AVX2 and AVX-512. The vectorizer asks the target about availability of masked vector loads and stores.
Added SDNodes for masked operations and lowering patterns for X86 code generator.
Examples:
<16 x i32> @llvm.masked.load.v16i32(i8* %addr, <16 x i32> %passthru, i32 4 /* align */, <16 x i1> %mask)
declare void @llvm.masked.store.v8f64(i8* %addr, <8 x double> %value, i32 4, <8 x i1> %mask)
Scalarizer for other targets (not AVX2/AVX-512) will be done in a separate patch.
http://reviews.llvm.org/D6191
llvm-svn: 222632
|
| |
|
|
| |
llvm-svn: 222631
|
| |
|
|
|
|
|
| |
i1 is not a legal type on Evergreen, so this combine proceeded
and tried to produce a bitcast between i1 and i8.
llvm-svn: 222630
|
| |
|
|
| |
llvm-svn: 222625
|
| |
|
|
| |
llvm-svn: 222624
|
| |
|
|
| |
llvm-svn: 222623
|
| |
|
|
|
|
| |
Use Triple::isOS*() helper functions where possible.
llvm-svn: 222622
|
| |
|
|
| |
llvm-svn: 222620
|
| |
|
|
|
|
|
|
| |
No functionality changed yet, but this will prevent subsequent patches
from having to handle permutations of various interleaved shuffle
patterns.
llvm-svn: 222614
|
| |
|
|
| |
llvm-svn: 222613
|
| |
|
|
| |
llvm-svn: 222612
|
| |
|
|
|
|
| |
This is a generalization of the X - (0 - Y) -> X transform.
llvm-svn: 222611
|
| |
|
|
| |
llvm-svn: 222609
|
| |
|
|
| |
llvm-svn: 222606
|
| |
|
|
| |
llvm-svn: 222605
|
| |
|
|
| |
llvm-svn: 222604
|
| |
|
|
|
|
|
| |
Fixes the self-host fail. Note that this commit activates dominator
analysis in the combiner by default (like the original commit did).
llvm-svn: 222590
|
| |
|
|
|
|
| |
arguments.
llvm-svn: 222587
|
| |
|
|
| |
llvm-svn: 222586
|
| |
|
|
|
|
|
| |
We need to use a s_mov_b32 rather than a copy, so that CSE will
eliminate redundant moves to the m0 register.
llvm-svn: 222584
|
| |
|
|
|
|
|
|
|
|
|
|
| |
This s_mov_b32 will write to a virtual register from the M0Reg
class and all the ds instructions now take an extra M0Reg explicit
argument.
This change is necessary to prevent issues with the scheduler
mixing together instructions that expect different values in the m0
registers.
llvm-svn: 222583
|
| |
|
|
|
|
|
| |
This pass attempts to fold the source operands of mov and copy
instructions into their uses.
llvm-svn: 222581
|
| |
|
|
|
|
|
|
|
|
|
| |
filler such as if delay slot filler have to put NOP instruction into the
delay slot of microMIPS BEQ or BNE instruction which uses the register $0,
then instead of emitting NOP this instruction is replaced by the corresponding
microMIPS compact branch instruction, i.e. BEQZC or BNEZC.
Differential Revision: http://reviews.llvm.org/D3566
llvm-svn: 222580
|
| |
|
|
| |
llvm-svn: 222579
|
| |
|
|
| |
llvm-svn: 222577
|
| |
|
|
|
|
| |
that will be removed after converting referencing defs.
llvm-svn: 222575
|
| |
|
|
| |
llvm-svn: 222573
|
| |
|
|
| |
llvm-svn: 222571
|
| |
|
|
|
|
|
|
|
|
| |
We can now use the ELF relocation .def files to create the mapping
of relocation numbers to names and avoid having to duplicate the
list of relocations.
Patch by Will Newton.
llvm-svn: 222567
|
| |
|
|
|
|
|
|
|
|
| |
We can now use the ELF relocation .def files to create the mapping
of relocation numbers to names and avoid having to duplicate the
list of relocations.
Patch by Will Newton.
llvm-svn: 222566
|
| |
|
|
|
|
|
| |
This is no longer needed after David's fix at r222377 + r222485.
rdar://18958417
llvm-svn: 222563
|
| |
|
|
| |
llvm-svn: 222562
|
| |
|
|
|
|
|
|
|
|
|
| |
be a DIType with identifier.
This makes sure that there is no need to use DIScopeRef for global variable's
context.
rdar://18958417
llvm-svn: 222561
|
| |
|
|
|
|
|
|
| |
objc_imageinfo struct.
rdar://17954668
llvm-svn: 222558
|
| |
|
|
| |
llvm-svn: 222557
|
| |
|
|
|
|
| |
While at it, also use makeArrayRef in elements().
llvm-svn: 222556
|
| |
|
|
| |
llvm-svn: 222555
|
| |
|
|
| |
llvm-svn: 222554
|
| |
|
|
| |
llvm-svn: 222553
|
| |
|
|
|
|
| |
Debug output is shown if any of the -debug-only arguments match.
llvm-svn: 222547
|
| |
|
|
| |
llvm-svn: 222546
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
This patch adds a feature flag to avoid unaligned 32-byte load/store AVX codegen
for Sandy Bridge and Ivy Bridge. There is no functionality change intended for
those chips. Previously, the absence of AVX2 was being used as a proxy to detect
this feature. But that hindered codegen for AVX-enabled AMD chips such as btver2
that do not have the 32-byte unaligned access slowdown.
Performance measurements are included in PR21541 ( http://llvm.org/bugs/show_bug.cgi?id=21541 ).
Differential Revision: http://reviews.llvm.org/D6355
llvm-svn: 222544
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
relative offsets for code models other than small/medium. For JIT application, memory layout is less controlled and can result in truncations otherwise."
This reverts commit r222538.
It's causing test failures for CFI, at least on Darwin:
http://lab.llvm.org:8080/green/job/clang-stage1-cmake-RA-incremental/1189/
http://lab.llvm.org:8080/green/job/clang-stage1-configure-RA_check/1391/
Note that the previous incremental build was on r222537, and the CFI
tests weren't failing:
http://lab.llvm.org:8080/green/job/clang-stage1-cmake-RA-incremental/1188/
llvm-svn: 222542
|
| |
|
|
|
|
|
|
|
|
| |
shuffle lowering to allow much better blend matching.
Specifically, with the new structure the code seems clearer to me and we
correctly can hit the cases where merging two 128-bit lanes is a clear
win and can be shuffled cheaply afterward.
llvm-svn: 222539
|
| |
|
|
|
|
|
|
|
|
|
|
| |
offsets for code models other than small/medium. For JIT application,
memory layout is less controlled and can result in truncations
otherwise.
Patch from Akos Kiss.
Differential Revision: http://reviews.llvm.org/D6079
llvm-svn: 222538
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
a bunch more improvements.
Non-lane-crossing is fine, the key is that lane merging only makes sense
for single-input shuffles. Not sure why I got so turned around here. The
code all works, I was just using the wrong model for it.
This only updates v4 and v8 lowering. The v16 and v32 lowering requires
restructuring the entire check sequence.
llvm-svn: 222537
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
operands are zero.
Before this patch, the DAGCombiner only tried to convert build_vector dag nodes
into shuffles if all operands were either extract_vector_elt or undef.
This patch improves that logic and teaches the DAGCombiner how to deal with
build_vector dag nodes where one or more operands are zero. A build_vector
dag node with some zero operands is turned into a shuffle only if the resulting
shuffle mask is legal for the target.
llvm-svn: 222536
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
lanes.
By special casing these we can often either reduce the total number of
shuffles significantly or reduce the number of (high latency on Haswell)
AVX2 shuffles that potentially cross 128-bit lanes. Even when these
don't actually cross lanes, they have much higher latency to support
that. Doing two of them and a blend is worse than doing a single insert
across the 128-bit lanes to blend and then doing a single interleaved
shuffle.
While this seems like a narrow case, it kept cropping up on me and the
difference is *huge* as you can see in many of the test cases. I first
hit this trying to perfectly fix the interleaving shuffle patterns used
by Halide for AVX2.
llvm-svn: 222533
|
| |
|
|
|
|
|
|
| |
This patch simplifies the logic that combines a pair of shuffle nodes into
a single shuffle if there is a legal mask. Also added comments to better
describe the algorithm. No functional change intended.
llvm-svn: 222522
|