bcm5719-llvm/llvm/test/Transforms/LoopIdiom/X86, branch meklort-10.0.1Project Ortega BCM5719 LLVMhttps://git.raptorcs.com/git/bcm5719-llvm/atom?h=meklort-10.0.12019-06-17T10:05:18+00:00[SCEV] Use NoWrapFlags when expanding a simple mul2019-06-17T10:05:18+00:00Sam Parkersam.parker@arm.com2019-06-17T10:05:18+00:00urn:sha1:60d6fb2a6344c4badfbc62daee6e71c588749312
Second functional change following on from rL362687. Pass the
NoWrapFlags from the MulExpr to InsertBinop when we're generating a
shl or mul.
Differential Revision: https://reviews.llvm.org/D61934
llvm-svn: 363540
[lit] Delete empty lines at the end of lit.local.cfg NFC2019-06-17T09:51:07+00:00Fangrui Songmaskray@google.com2019-06-17T09:51:07+00:00urn:sha1:ac14f7b10cffe2be548607269e036244cd16acc3
llvm-svn: 363538
Revert "[SCEV] Use wrap flags in InsertBinop"2019-06-06T12:35:46+00:00Benjamin Kramerbenny.kra@googlemail.com2019-06-06T12:35:46+00:00urn:sha1:f1249442cf3beacdf18fad448351285173069d44
This reverts commit r362687. Miscompiles llvm-profdata during selfhost.
llvm-svn: 362699
[SCEV] Use wrap flags in InsertBinop2019-06-06T08:56:26+00:00Sam Parkersam.parker@arm.com2019-06-06T08:56:26+00:00urn:sha1:7cc580f5e95e7e5dd84db2c276f58709258cd120
If the given SCEVExpr has no (un)signed flags attached to it, transfer
these to the resulting instruction or use them to find an existing
instruction.
Differential Revision: https://reviews.llvm.org/D61934
llvm-svn: 362687
Revert "Temporarily Revert "Add basic loop fusion pass.""2019-04-17T04:52:47+00:00Eric Christopherechristo@gmail.com2019-04-17T04:52:47+00:00urn:sha1:cee313d288a4faf0355d76fb6e0e927e211d08a5
The reversion apparently deleted the test/Transforms directory.
Will be re-reverting again.
llvm-svn: 358552
Temporarily Revert "Add basic loop fusion pass."2019-04-17T02:12:23+00:00Eric Christopherechristo@gmail.com2019-04-17T02:12:23+00:00urn:sha1:a86343512845c9c1fdbac865fea88aa5fce7142a
As it's causing some bot failures (and per request from kbarton).
This reverts commit r358543/ab70da07286e618016e78247e4a24fcb84077fda.
llvm-svn: 358546
[LoopIdiomRecognize] Add CTTZ support2018-12-26T21:59:48+00:00Craig Toppercraig.topper@intel.com2018-12-26T21:59:48+00:00urn:sha1:c9a6000755b46ecee5199ae52c89a6b537f1520c
Summary:
Existing LIR recognizes CTLZ where shifting input variable right until it is zero. (Shift-Until-Zero idiom)
This commit:
1. Augments Shift-Until-Zero idiom to recognize CTTZ where input variable is shifted left.
2. Prepare for BitScan idiom recognition.
Patch by Yuanfang Chen (tabloid.adroit)
Reviewers: craig.topper, evstupac
Reviewed By: craig.topper
Subscribers: llvm-commits
Differential Revision: https://reviews.llvm.org/D55876
llvm-svn: 350074
[LoopIdiomRecognize] Don't convert a do while loop to ctlz.2018-07-11T22:35:28+00:00Craig Toppercraig.topper@intel.com2018-07-11T22:35:28+00:00urn:sha1:ed6acde8cf2f764fce5df495d5f2a24bc08a3e80
This commit suppresses turning loops like this into "(bitwidth - ctlz(input))".
unsigned foo(unsigned input) {
unsigned num = 0;
do {
++num;
input >>= 1;
} while (input != 0);
return num;
}
The loop version returns a value of 1 for both an input of 0 and an input of 1. Converting to a naive ctlz does not preserve that.
Theoretically we could do better if we checked isKnownNonZero or we could insert a select to handle the divergence. But until we have motivating cases for that, this is the easiest solution.
llvm-svn: 336864
[LoopIdiomRecognize] Add a test case showing a loop we turn into ctlz that we shouldn't.2018-07-11T22:17:26+00:00Craig Toppercraig.topper@intel.com2018-07-11T22:17:26+00:00urn:sha1:ef08aec9352a4827a2f9c83fffd7844155b1a633
This loop executes one iteration without checking the input value. This produces a count of 1 for an input of 0 and 1. We are turning this into 32 - ctlz(n), but that returns 0 if n is 0.
llvm-svn: 336862
[LoopIdiomRecognize] Support for converting loops that use LSHR to CTLZ.2018-07-08T01:45:47+00:00Craig Toppercraig.topper@intel.com2018-07-08T01:45:47+00:00urn:sha1:2835278ee08fcfb9e3dad56c7c24496f9aaaeeaf
In the 'detectCTLZIdiom' function support for loops that use LSHR instruction instead of ASHR has been added.
This supports creating ctlz from the following code.
int lzcnt(int x) {
int count = 0;
while (x > 0) {
count++;
x = x >> 1;
}
return count;
}
Patch by Olga Moldovanova
Differential Revision: https://reviews.llvm.org/D48354
llvm-svn: 336509