sbinabdullah opened a new pull request, #19995:
URL: https://github.com/apache/tvm/pull/19995
## Summary
Followup to #19978 ([Arith] Fix const-int-bound modular-set tightening for
Mod/FloorMod).
The const-int-bound fix correctly prevents the simplifier from over-folding
the adaptive pool window extent expression. The previous expected IR in
`test_adaptive_pooling_window` used the simplified closed form `(v_ax2 % 3 * 4
+ 16) // 12 + 1`, which was only reachable because the buggy FloorMod bound let
`CanProve` validate an invalid predicate. After the fix, the generated IR
correctly retains the `T.Select` form, so this PR updates the expected IR to
match and removes the `xfail` marker that was added in #19978.
## Changes
- `tests/python/te/test_te_create_primfunc.py`: updated the `tir_workload`
in `test_adaptive_pooling_window` to match the generated IR (loop extents and
division now use `T.Select` form; block name `adaptive_pool_sum_l1`), and
removed the `@pytest.mark.xfail` decorator.
## Verification
- The test now passes (was `xfail`):
```
45 passed, 0 failed, 0 xfailed
```
- The full `test_te_create_primfunc.py` suite passes with no regressions.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
