未验证 提交 24168252 编写于 作者: B BUG1989 提交者: GitHub

Fix, disable pool sse op, yolov2 is error (#433)

上级 086e3ce9
......@@ -130,18 +130,18 @@ static int score(struct node_ops* node_ops, struct exec_graph* exec_graph, struc
if (type == POOL_MAX && (pad_h0 == pad_w0) && (pad_h1 == pad_w1) && pad_tf != -1)
{
if (pad_h0 == 0 && (pool_size == POOL_K2S2 || pool_size == POOL_K3S2))
return OPS_SCORE_BEST;
return 0;
if (pad_h0 == 1 && (pool_size == POOL_K2S2 || pool_size == POOL_K3S2 || pool_size == POOL_K3S1))
return OPS_SCORE_BEST;
return 0;
}
/* general avg pooling, k2s2, k2s2p1, k3s2, k3s2p1 */
if (type == POOL_AVG && (pad_h0 == pad_w0) && (pad_h1 == pad_w1))
{
if (pad_h0 == 0 && pad_h1 == 0 && (pool_size == POOL_K2S2 || pool_size == POOL_K3S2))
return OPS_SCORE_BEST;
return 0;
if (pad_h0 == 1 && pad_h1 == 1 && (pool_size == POOL_K2S2 || pool_size == POOL_K3S2))
return OPS_SCORE_BEST;
return 0;
}
}
......
......@@ -52,7 +52,7 @@ int ref_shuffle_channel_fp32(struct ir_tensor* input_tensor, struct ir_tensor* o
{
int src_q = n * c * h * w + (chs_per_group * i + j) * h * w;
int dst_q = n * c * h * w + (group * j + i) * h * w;
memcpy(input_fp32 + dst_q, output_fp32 + src_q, h * w * elemsize);
memcpy(output_fp32 + dst_q, input_fp32 + src_q, h * w * elemsize);
}
}
}
......@@ -81,7 +81,7 @@ int ref_shuffle_channel_uint8(struct ir_tensor* input_tensor, struct ir_tensor*
{
int src_q = n * c * h * w + (chs_per_group * i + j) * h * w;
int dst_q = n * c * h * w + (group * j + i) * h * w;
memcpy(input_uint8 + dst_q, output_uint8 + src_q, h * w * elemsize);
memcpy(output_uint8 + dst_q, input_uint8 + src_q, h * w * elemsize);
}
}
}
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册