aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode
diff options
context:
space:
mode:
authorMatthias Springer <me@m-sp.org>2024-04-05 13:27:50 +0900
committerGitHub <noreply@github.com>2024-04-05 13:27:50 +0900
commit24e4429980b3df039166c1ee6a9e530cc6f054c9 (patch)
tree2af2d3159862877ebbc01b13a521baa0cd615502 /llvm/lib/Bitcode
parent6b30ffef28c35c24bfd8190e06eeaa0c5cd73cbd (diff)
downloadllvm-24e4429980b3df039166c1ee6a9e530cc6f054c9.zip
llvm-24e4429980b3df039166c1ee6a9e530cc6f054c9.tar.gz
llvm-24e4429980b3df039166c1ee6a9e530cc6f054c9.tar.bz2
[mlir][SCF][NFC] `ValueBoundsConstraintSet`: Simplify `scf.for` implementation (#86239)
This commit simplifies the implementation of the `ValueBoundsOpInterface` for `scf.for` based on the newly added `ValueBoundsConstraintSet::compare` API and adds additional documentation. Previously, the interface implementation created a new constraint set just to check if the yielded value and iter_arg are equal. This was inefficient because constraints were added multiple times (to two different constraint sets) for ops that are inside the loop.
Diffstat (limited to 'llvm/lib/Bitcode')
0 files changed, 0 insertions, 0 deletions