llvm/test/Transforms/BBVectorize, branch stablehttp://llvm.orghttps://git.amat.us/llvm/atom/test/Transforms/BBVectorize?h=stable2013-02-20T07:21:42ZModify the LLVM assembly output so that it uses references to represent function attributes.2013-02-20T07:21:42ZBill Wendlingisanbard@gmail.com2013-02-20T07:21:42Zurn:sha1:7ab6c76ad1cbf36284ca5b6bd5ee33c625fe3e60
This makes the LLVM assembly look better. E.g.:
define void @foo() #0 { ret void }
attributes #0 = { nounwind noinline ssp }
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@175605 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Fix an invalid reference bug2013-02-17T15:59:26ZHal Finkelhfinkel@anl.gov2013-02-17T15:59:26Zurn:sha1:f79f136cc64b0625b77c7b9008ed8c5b848b6b17
This fixes PR15289. This bug was introduced (recently) in r175215; collecting
all std::vector references for candidate pairs to delete at once is invalid
because subsequent lookups in the owning DenseMap could invalidate the
references.
bugpoint was able to reduce a useful test case. Unfortunately, because whether
or not this asserts depends on memory layout, this test case will sometimes
appear to produce valid output. Nevertheless, running under valgrind will
reveal the error.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@175397 91177308-0d34-0410-b5e6-96231b3b80d8
Switch BBVectorize to directly depend on having a TTI analysis.2013-01-07T10:22:36ZChandler Carruthchandlerc@gmail.com2013-01-07T10:22:36Zurn:sha1:8bd6c52396ab6e7955fdcc1bce099b7cba29a308
This could be simplified further, but Hal has a specific feature for
ignoring TTI, and so I preserved that.
Also, I needed to use it because a number of tests fail when switching
from a null TTI to the NoTTI nonce implementation. That seems suspicious
to me and so may be something that you need to look into Hal. I worked
it by preserving the old behavior for these tests with the flag that
ignores all target info.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171722 91177308-0d34-0410-b5e6-96231b3b80d8
Make opt grab the triple from the module and use it to initialize the target machine.2013-01-01T08:00:32ZNadav Rotemnrotem@apple.com2013-01-01T08:00:32Zurn:sha1:b338d897f9063ed6f02ed52527722c61ef827d5a
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171341 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Use VTTI to compute costs for intrinsics vectorization2012-12-26T01:36:57ZHal Finkelhfinkel@anl.gov2012-12-26T01:36:57Zurn:sha1:a77728415857196035c0090f7b2749d7971811a2
For the time being this includes only some dummy test cases. Once the
generic implementation of the intrinsics cost function does something other
than assuming scalarization in all cases, or some target specializes the
interface, some real test cases can be added.
Also, for consistency, I changed the type of IID from unsigned to Intrinsic::ID
in a few other places.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171079 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Enable vectorization of the fmuladd intrinsic2012-12-25T22:36:08ZHal Finkelhfinkel@anl.gov2012-12-25T22:36:08Zurn:sha1:64a7a24edf719bb6ffacc030c23f4cd99312f3fb
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171075 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Correctly merge SubclassOptionalData2012-11-28T03:04:10ZHal Finkelhfinkel@anl.gov2012-11-28T03:04:10Zurn:sha1:430b9079c614cd3f45015a6516590d33742cc802
When two instructions are combined into a vector instruction,
the resulting instruction must have the most-conservative flags.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@168765 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Don't vectorize vector-manipulation chains2012-11-13T03:12:40ZHal Finkelhfinkel@anl.gov2012-11-13T03:12:40Zurn:sha1:4387b8c95971a512e07bfda30dea6459e8419e8f
Don't choose a vectorization plan containing only shuffles and
vector inserts/extracts. Due to inperfections in the cost model,
these can lead to infinite recusion.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167811 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Only some insert element operand pairs are free.2012-11-12T23:55:36ZHal Finkelhfinkel@anl.gov2012-11-12T23:55:36Zurn:sha1:b2b2469a9178f7e22cd7a69f3093e54d67d6b712
This fixes another infinite recursion case when using target costs.
We can only replace insert element input chains that are pure (end
with inserting into an undef).
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167784 91177308-0d34-0410-b5e6-96231b3b80d8
BBVectorize: Use a more sophisticated check for input cost2012-11-12T21:21:02ZHal Finkelhfinkel@anl.gov2012-11-12T21:21:02Zurn:sha1:86c88c938aec8006d2ce83325ec1f31e1154620b
The old checking code, which assumed that input shuffles and insert-elements
could always be folded (and thus were free) is too simple.
This can only happen in special circumstances.
Using the simple check caused infinite recursion.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167750 91177308-0d34-0410-b5e6-96231b3b80d8