提交 6a17943e authored 作者: Li Yao's avatar Li Yao

more comment

上级 a7018221
...@@ -5909,6 +5909,8 @@ def local_merge_alloc(node): ...@@ -5909,6 +5909,8 @@ def local_merge_alloc(node):
dims_outer_rev = dims_outer[::-1] dims_outer_rev = dims_outer[::-1]
dims_inner_rev = dims_inner[::-1] dims_inner_rev = dims_inner[::-1]
# check if the pattern of broadcasting is matched, in the reversed ordering # check if the pattern of broadcasting is matched, in the reversed ordering
# The for loop below will run at most len(dims_inner_rev) times, sufficient
# to cover all the cases.
for dim_inner, dim_outer in zip(dims_inner_rev, dims_outer_rev): for dim_inner, dim_outer in zip(dims_inner_rev, dims_outer_rev):
if dim_inner != dim_outer: if dim_inner != dim_outer:
if isinstance(dim_inner, Constant) and dim_inner.data == 1: if isinstance(dim_inner, Constant) and dim_inner.data == 1:
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论