aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2015-02-15 12:01:14 +0000
committerChandler Carruth <chandlerc@gmail.com>2015-02-15 12:01:14 +0000
commit4fe214b1f24c46b0d69643619b1d2bc826872cd3 (patch)
tree273d29ae994a066de99a36fc06288982c54f70bf /llvm/lib/Bitcode/Reader
parent64a399a8c753c305c7dfc10b3e5a59517952cf0e (diff)
downloadllvm-4fe214b1f24c46b0d69643619b1d2bc826872cd3.zip
llvm-4fe214b1f24c46b0d69643619b1d2bc826872cd3.tar.gz
llvm-4fe214b1f24c46b0d69643619b1d2bc826872cd3.tar.bz2
[x86] Tweak the ordering of unpack matching vs. element insertion, and
don't try to do element insertion for non-zero-index floating point vectors. We don't have any useful patterns or lowering for element insertion into high elements of a floating point vector, and the generic shuffle lowering will end up being better -- namely it will fall back to unpck. But we should try to handle other forms of element insertion before matching unpck patterns. While this doesn't matter much right now, I'm working on a patch that makes unpck matching much more powerful, and that patch will break without this re-ordering. llvm-svn: 229306
Diffstat (limited to 'llvm/lib/Bitcode/Reader')
0 files changed, 0 insertions, 0 deletions