| 39f4e8d9cce22b60a3417a5f17c847fa5b1daebf |
|
14-Jul-2013 |
Stephen Lin <stephenwlin@gmail.com> |
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change.
This update was done with the following bash script:
find test/Transforms -name "*.ll" | \
while read NAME; do
echo "$NAME"
if ! grep -q "^; *RUN: *llc" $NAME; then
TEMP=`mktemp -t temp`
cp $NAME $TEMP
sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \
while read FUNC; do
sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP
done
mv $TEMP $NAME
fi
done
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@186268 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/test/Transforms/BBVectorize/X86/simple.ll
|
| 9eb366acba65b5779d2129db3a6fb6a0414572d4 |
|
12-Apr-2013 |
Nadav Rotem <nrotem@apple.com> |
CostModel: increase the default cost of supported floating point operations from 1 to two. Fixed a few tests that changes because now the cost of one insert + a vector operation on two doubles is lower than two scalar operations on doubles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@179413 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/test/Transforms/BBVectorize/X86/simple.ll
|
| 78fd353d5e5daedc47ecc31b6193ca48793c249c |
|
01-Nov-2012 |
Hal Finkel <hfinkel@anl.gov> |
BBVectorize: Use target costs for incoming and outgoing values instead of the depth heuristic.
When target cost information is available, compute explicit costs of inserting and
extracting values from vectors. At this point, all costs are estimated using the
target information, and the chain-depth heuristic is not needed. As a result, it is now, by
default, disabled when using target costs.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167256 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/test/Transforms/BBVectorize/X86/simple.ll
|
| 72465ea23d010507d3746adc126d719005981e05 |
|
31-Oct-2012 |
Hal Finkel <hfinkel@anl.gov> |
BBVectorize: Choose pair ordering to minimize shuffles
BBVectorize would, except for loads and stores, always fuse instructions
so that the first instruction (in the current source order) would always
represent the low part of the input vectors and the second instruction
would always represent the high part. This lead to too many shuffles
being produced because sometimes the opposite order produces fewer of them.
With this change, BBVectorize tracks the kind of pair connections that form
the DAG of candidate pairs, and uses that information to reorder the pairs to
avoid excess shuffles. Using this information, a future commit will be able
to add VTTI-based shuffle costs to the pair selection procedure. Importantly,
the number of remaining shuffles can now be estimated during pair selection.
There are some trivial instruction reorderings in the test cases, and one
simple additional test where we certainly want to do a reordering to
avoid an unnecessary shuffle.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167122 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/test/Transforms/BBVectorize/X86/simple.ll
|
| ecc69a1d99963b2b1bba92bdcefbfa8a8f1c497a |
|
26-Oct-2012 |
Hal Finkel <hfinkel@anl.gov> |
Move target-specific BBVectorize tests into a separate directory.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@166802 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/test/Transforms/BBVectorize/X86/simple.ll
|