diff options
| author | Mohammed Agabaria <mohammed.agabaria@intel.com> | 2017-01-05 14:03:41 +0000 |
|---|---|---|
| committer | Mohammed Agabaria <mohammed.agabaria@intel.com> | 2017-01-05 14:03:41 +0000 |
| commit | 23599ba7940d9891ed5eb982aaaed116f97aea74 (patch) | |
| tree | 910698abcc007239ab93b2f167fcd7ff96a75603 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | a983e7c4a415bc28b8bc6218f4881d11b3a2d995 (diff) | |
| download | llvm-23599ba7940d9891ed5eb982aaaed116f97aea74.zip llvm-23599ba7940d9891ed5eb982aaaed116f97aea74.tar.gz llvm-23599ba7940d9891ed5eb982aaaed116f97aea74.tar.bz2 | |
Currently isLikelyComplexAddressComputation tries to figure out if the given stride seems to be 'complex' and need some extra cost for address computation handling.
This code seems to be target dependent which may not be the same for all targets.
Passed the decision whether the given stride is complex or not to the target by sending stride information via SCEV to getAddressComputationCost instead of 'IsComplex'.
Specifically at X86 targets we dont see any significant address computation cost in case of the strided access in general.
Differential Revision: https://reviews.llvm.org/D27518
llvm-svn: 291106
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions