diff options
| author | Max Kazantsev <mkazantsev@azul.com> | 2022-12-08 16:04:01 +0700 |
|---|---|---|
| committer | Max Kazantsev <mkazantsev@azul.com> | 2022-12-08 16:04:42 +0700 |
| commit | 0130d0ed35e8788be502f14cdb8b5569a6db527a (patch) | |
| tree | 473bb076ca281734ab59d15b9f94703c997ca8d2 /llvm/tools/llvm-readobj/llvm-readobj.cpp | |
| parent | b94bd9c20a39758f7733cd4e7d493fe51200932c (diff) | |
| download | llvm-0130d0ed35e8788be502f14cdb8b5569a6db527a.zip llvm-0130d0ed35e8788be502f14cdb8b5569a6db527a.tar.gz llvm-0130d0ed35e8788be502f14cdb8b5569a6db527a.tar.bz2 | |
[SCEV] Compute symbolic exit count for 'and' conditions
If loop exits by condition like `A < B && X < Y`, and at least one of symbolic max
exit counts for these conditions is known, it can be used as estimate of symbolic
max exit count for whole branch. If both are known, then we can use their umin
as the estimate.
Differential Revision: https://reviews.llvm.org/D139403
Reviewed By: nikic
Diffstat (limited to 'llvm/tools/llvm-readobj/llvm-readobj.cpp')
0 files changed, 0 insertions, 0 deletions