Evan Cheng b4162fd393 Because we promote SSE logical ops and loads to v2i64, we often end up generate ...

code that cross integer / floating point domains (e.g. generate pxor / pand for
logical ops on floating point value, movdqa to load / store floating point SSE
values). Given that, it's better to use movaps instead of movdqa and movups
instead of movdqu. They have the same latency but the "aps" variants are one
byte shorter.
If the domain crossing problem is a real performance issue, then we will have to
fix it with dynamic programming based isel.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40076 91177308-0d34-0410-b5e6-96231b3b80d8

2007-07-20 00:27:43 +00:00

..

Analysis

Verify loop info.

2007-07-19 18:02:32 +00:00

Archive

finishing touches of bytecode -> bitcode changes. also unbreak Windows

2007-07-06 20:28:40 +00:00

AsmParser

For PR1553:

2007-07-19 23:13:04 +00:00

Bitcode

remove a dead case

2007-07-05 17:18:32 +00:00

CodeGen

As pointed out by g++-4.2, the original code didn't do

2007-07-19 07:31:58 +00:00

Debugger

…

ExecutionEngine

Hush a noisy warning from GCC 4.2 about overflow during conversion by using

2007-07-19 21:05:30 +00:00

Linker

eliminate residual cruft related to recognizing bytecode

2007-07-06 13:38:17 +00:00

Support

Remember to free the heap allocated array if we're not going to use it.

2007-07-19 06:45:33 +00:00

System

finishing touches of bytecode -> bitcode changes. also unbreak Windows

2007-07-06 20:28:40 +00:00

Target

Because we promote SSE logical ops and loads to v2i64, we often end up generate

2007-07-20 00:27:43 +00:00

Transforms

Make val_replace fail early, which reduces the time to optimize 403.gcc to 14.8s.

2007-07-19 19:57:13 +00:00

VMCore

For PR1553:

2007-07-19 23:13:04 +00:00

Makefile

…