diff options
| author | Erick Ochoa Lopez <eochoalo@amd.com> | 2025-08-05 12:10:31 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-08-05 12:10:31 -0400 |
| commit | 2e40c567fbf5b7366df4f2b1fcb9b748da685d96 (patch) | |
| tree | c6e668b10319db080580f005a955539b70b3d885 /llvm/lib/TextAPI | |
| parent | 2bbc6147138187946616c1b30743e09825fb61b8 (diff) | |
| download | llvm-2e40c567fbf5b7366df4f2b1fcb9b748da685d96.zip llvm-2e40c567fbf5b7366df4f2b1fcb9b748da685d96.tar.gz llvm-2e40c567fbf5b7366df4f2b1fcb9b748da685d96.tar.bz2 | |
[MLIR][Transform] Prefer entry points in current module (#151323)
The transform interpreter previously looked for the entry point using a
recursive walk in pre-order. This makes it so that any named_sequence
operation with an arbitrary level of nested-ness will be used as the
entry point for the transform interpreter as long as it is placed before
another one.
This change makes it so that code like the one reported in
https://github.com/llvm/llvm-project/issues/119578 works as expected.
Closes #119578
Some comments: alternatively, it would also be possible to solve this
issue in a slightly more elegant manner. We could define a new walker
iterator that iterates through the operations in a breadth first search.
---------
Co-authored-by: Jakub Kuderski <kubakuderski@gmail.com>
Diffstat (limited to 'llvm/lib/TextAPI')
0 files changed, 0 insertions, 0 deletions