junrushao opened a new pull request, #15210: URL: https://github.com/apache/tvm/pull/15210
This PR enhance the arithmetic analysis used in compute-at to further help symbolic bound simplification. Previously, when a variable `n` appears in the shape of an input buffer `T.Buffer((n * 32), "float32")`, we could safely assume that `n` is nonnegative as it is part of the shape. This could help us simplify some bounds during scheduling as well as lowering. For example, for integers `n` and `bx` where `bx` has a symbolic bound `[0, 32 * n)`, if `n` is nonnegative, we could simplify the following expressions to True: ``` 0 <= floordiv(bx, n) < 32 0 <= floormod(bx, n) < n ``` This PR depends on #15193 to provide an interface that hints analyzer. -- 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]
