The GitHub Actions job "Lint" on tvm.git/fix-arith-const-int-bound-modular-set has failed. Run started by GitHub user sbinabdullah (triggered by tqchen).
Head commit for run: 5bdd9f62f04530177e7cc7855b05de5f78b668ba / sbinabdullah <[email protected]> [Arith] Tighten truncmod bound for entirely-negative dividends with |a| < b When the dividend of a truncated mod is entirely negative (a.max < 0) but |a| < b for every value in range, no reduction happens and the result equals a, so the bound is [a.min, a.max] rather than the loose [a.min, 0]. This mirrors the existing non-negative "return a" case (a.min >= 0, a.max < b.min). Addresses review feedback from spectrometerHBH: the else branch (a.min < 0) gave an upper bound of 0 even when a.max < 0 and |a| < b, where the true upper bound is a.max. A negative dividend that spans a multiple of the divisor can still reach 0, so the upper bound stays 0 in that case (unchanged). Report URL: https://github.com/apache/tvm/actions/runs/29136809975 With regards, GitHub Actions via GitBox --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
