You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tvm.apache.org by tq...@apache.org on 2023/07/03 20:38:24 UTC

[tvm] 02/02: [MERGE] Fix testcase after merge

This is an automated email from the ASF dual-hosted git repository.

tqchen pushed a commit to branch unity
in repository https://gitbox.apache.org/repos/asf/tvm.git

commit 1631c3d4cedec006271c4db6ebf440dd0126e488
Author: tqchen <ti...@gmail.com>
AuthorDate: Mon Jul 3 16:38:04 2023 -0400

    [MERGE] Fix testcase after merge
---
 tests/python/dlight/test_gpu_reduction.py | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/tests/python/dlight/test_gpu_reduction.py b/tests/python/dlight/test_gpu_reduction.py
index ce3a05e771..f890788b4d 100644
--- a/tests/python/dlight/test_gpu_reduction.py
+++ b/tests/python/dlight/test_gpu_reduction.py
@@ -100,7 +100,7 @@ def test_softmax():
                             v0 = T.axis.spatial(T.int64(32), ax0_ax1_fused // n + ax0)
                             v1 = T.axis.spatial(n, ax0_ax1_fused % n + ax1)
                             v2 = T.axis.reduce(m, ax2_fused_0 * T.int64(256) + ax2_fused_1)
-                            T.where(T.int64(0) <= ax0_ax1_fused // n and ax0_ax1_fused // n < T.int64(32) and T.int64(0) <= ax0_ax1_fused % n and ax0_ax1_fused % n < n and ax2_fused_0 * T.int64(256) + ax2_fused_1 < m)
+                            T.where(ax2_fused_0 * T.int64(256) + ax2_fused_1 < m)
                             T.reads(lv44[T.int64(0), v0, v1, v2])
                             T.writes(T_softmax_maxelem_shared[T.int64(0), v0, v1])
                             with T.init():
@@ -112,7 +112,7 @@ def test_softmax():
                             v0 = T.axis.spatial(T.int64(32), ax0_ax1_fused // n + ax0)
                             v1 = T.axis.spatial(n, ax0_ax1_fused % n + ax1)
                             v2 = T.axis.reduce(m, ax2_fused_0 * T.int64(256) + ax2_fused_1)
-                            T.where(T.int64(0) <= ax0_ax1_fused // n and ax0_ax1_fused // n < T.int64(32) and T.int64(0) <= ax0_ax1_fused % n and ax0_ax1_fused % n < n and ax2_fused_0 * T.int64(256) + ax2_fused_1 < m)
+                            T.where(ax2_fused_0 * T.int64(256) + ax2_fused_1 < m)
                             T.reads(lv44[T.int64(0), v0, v1, v2], T_softmax_maxelem_shared[T.int64(0), v0, v1])
                             T.writes(T_softmax_expsum_shared[T.int64(0), v0, v1])
                             with T.init():