aboutsummaryrefslogtreecommitdiff
path: root/llvm/unittests/Support/FileCheckTest.cpp
diff options
context:
space:
mode:
authordfukalov <daniil.fukalov@amd.com>2020-01-20 16:40:02 +0300
committerdfukalov <daniil.fukalov@amd.com>2020-01-20 16:41:16 +0300
commitde34b54edce4b7b4e4a68a02fae10283b3e2d7ea (patch)
tree6b0b138c6d6a516bf4c459553e66fa33f9cc2cbe /llvm/unittests/Support/FileCheckTest.cpp
parent22447a61d405a9e279c7dad72b342dcc6e8b1b4b (diff)
downloadllvm-de34b54edce4b7b4e4a68a02fae10283b3e2d7ea.zip
llvm-de34b54edce4b7b4e4a68a02fae10283b3e2d7ea.tar.gz
llvm-de34b54edce4b7b4e4a68a02fae10283b3e2d7ea.tar.bz2
[SCEV] Swap guards estimation sequence. NFC
Summary: Loop unroll spends a lot of time in SCEVs processing in case when a function contains hundreds of simple 'for' loops with a quite complex arrays indexes like for (int i = 0; i < 8; ++i) { for (int j = 0; j < 32; ++j) { C[j*8+i] = B[j*32+i+128] + A[i*64+128]; } } for (int i = 0; i < 8; ++i) { for (int j = 0; j < 8; ++j) { for (int k = 0; k < 32; ++k) { D[k*64+i*8+j] = D[k*64+i*8+j] + E[i+16] * C[k*8+j+256]; } } } The patch improves loop unroll speed since isLoopBackedgeGuardedByCond takes much less time than isLoopEntryGuardedByCond in the edge case. Reviewers: skatkov, sanjoy, mkazantsev Reviewed By: sanjoy Subscribers: fhahn, hiraditya, javed.absar, llvm-commits Tags: #llvm Differential Revision: https://reviews.llvm.org/D72929
Diffstat (limited to 'llvm/unittests/Support/FileCheckTest.cpp')
0 files changed, 0 insertions, 0 deletions