aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorRazvan Lupusoru <razvan.lupusoru@gmail.com>2025-04-30 13:48:51 -0700
committerGitHub <noreply@github.com>2025-04-30 13:48:51 -0700
commite8f590e0e3507e6ad30d17bfd52530e70d372315 (patch)
tree58c44e5e74eee70b76c53743e77ca699d87881f6 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent4a6c81dc0e2790ec48a7da483970b95d847be8d7 (diff)
downloadllvm-e8f590e0e3507e6ad30d17bfd52530e70d372315.zip
llvm-e8f590e0e3507e6ad30d17bfd52530e70d372315.tar.gz
llvm-e8f590e0e3507e6ad30d17bfd52530e70d372315.tar.bz2
[mlir][acc] Improve acc.loop support as a container (#137887)
Dialects which have their own loop representation not representable with numeric bounds + steps cannot be represented cleanly with acc.loop. In such a case, we permit the dialects representation with acc.loop merely encompasing its loop representation. This limitation became obvious when looking at range / random iterator C++ loops. The API of acc.loop was updated to test for this differentiation. Additionally, the verifier was updated to check for consistent bounds and whether inner-loops are contained when it works as a container.
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions