Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
PaddlePaddle
Paddle-Lite
提交
e83a5963
P
Paddle-Lite
项目概览
PaddlePaddle
/
Paddle-Lite
通知
331
Star
4
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
271
列表
看板
标记
里程碑
合并请求
78
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle-Lite
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
271
Issue
271
列表
看板
标记
里程碑
合并请求
78
合并请求
78
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
未验证
提交
e83a5963
编写于
6月 13, 2018
作者:
E
eclipsycn
提交者:
GitHub
6月 13, 2018
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #419 from dolphin8/develop
#418
a faster transpose implementation
上级
cc07fff2
b3781d28
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
44 addition
and
35 deletion
+44
-35
src/operators/kernel/arm/transpose_kernel.cpp
src/operators/kernel/arm/transpose_kernel.cpp
+44
-35
未找到文件。
src/operators/kernel/arm/transpose_kernel.cpp
浏览文件 @
e83a5963
...
...
@@ -11,29 +11,28 @@ distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License. */
#ifdef TRANSPOSE_OP
#include "operators/kernel/transpose_kernel.h"
namespace
paddle_mobile
{
namespace
operators
{
template
<
typename
T
>
void
TransposeFunc
(
const
int
numel
,
const
T
*
input
,
const
vector
<
int
>
axis
,
const
vector
<
int
>
old_strides
,
const
vector
<
int
>
new_strides
,
T
*
output
)
{
for
(
int
i
=
0
;
i
<
numel
;
++
i
)
{
int
old_idx
=
0
;
int
idx
=
i
;
for
(
int
j
=
0
;
j
<
axis
.
size
();
++
j
)
{
int
order
=
axis
[
j
];
old_idx
+=
(
idx
/
new_strides
[
j
])
*
old_strides
[
order
];
idx
%=
new_strides
[
j
];
}
output
[
i
]
=
input
[
old_idx
];
}
}
// vector<int> pos;
// template <typename T>
// void TransposeFunc(const int numel, const T* input, const vector<int> axis,
// const vector<int> old_strides, const vector<int>
// new_strides, T* output) {
// for (int i = 0; i < numel; ++i) {
// int old_idx = 0;
// int idx = i;
// for (int j = 0; j < axis.size(); ++j) {
// int order = axis[j];
// old_idx += (idx / new_strides[j]) * old_strides[order];
// idx %= new_strides[j];
// }
// output[i] = input[old_idx];
// }
// }
template
<
>
void
TransposeKernel
<
CPU
,
float
>::
Compute
(
const
TransposeParam
&
param
)
const
{
...
...
@@ -44,28 +43,38 @@ void TransposeKernel<CPU, float>::Compute(const TransposeParam& param) const {
const
auto
*
input_x_data
=
input_x
->
data
<
float
>
();
auto
*
out_data
=
out
->
mutable_data
<
float
>
();
size_t
axis_size
=
axis
.
size
();
std
::
vector
<
int
>
new_dims
;
new_dims
.
reserve
(
axis_size
);
for
(
auto
c
:
axis
)
{
new_dims
.
push_back
(
input_x_dims
[
c
]);
size_t
ndim
=
axis
.
size
();
std
::
vector
<
int
>
xdim
(
ndim
);
std
::
vector
<
int
>
xstride
(
ndim
);
std
::
vector
<
int
>
xout
(
ndim
);
for
(
int
i
=
0
;
i
<
ndim
;
i
++
)
{
int
j
=
ndim
-
1
-
i
;
xdim
[
j
]
=
input_x_dims
[
axis
[
i
]];
xstride
[
j
]
=
1
;
for
(
int
k
=
axis
[
i
]
+
1
;
k
<
ndim
;
k
++
)
{
xstride
[
j
]
*=
input_x_dims
[
k
];
}
xout
[
j
]
=
xstride
[
j
]
*
xdim
[
j
];
}
std
::
vector
<
int
>
old_strides
;
std
::
vector
<
int
>
new_strides
;
for
(
int
i
=
0
;
i
<
axis
.
size
();
i
++
)
{
int
temp_old
=
1
;
int
temp_new
=
1
;
for
(
int
j
=
i
+
1
;
j
<
axis
.
size
();
j
++
)
{
temp_old
*=
input_x_dims
[
j
];
temp_new
*=
new_dims
[
j
];
auto
numel
=
input_x
->
numel
();
size_t
pind
=
0
;
std
::
vector
<
int
>
ind
(
ndim
);
for
(
int
i
=
0
;
i
<
numel
;
i
++
)
{
out_data
[
i
]
=
input_x_data
[
pind
];
ind
[
0
]
++
;
pind
+=
xstride
[
0
];
for
(
int
j
=
0
;
j
<
ndim
-
1
;
j
++
)
{
if
(
ind
[
j
]
==
xdim
[
j
])
{
ind
[
j
+
1
]
++
;
ind
[
j
]
=
0
;
pind
+=
xstride
[
j
+
1
];
pind
-=
xout
[
j
];
}
else
{
break
;
}
}
old_strides
.
push_back
(
temp_old
);
new_strides
.
push_back
(
temp_new
);
}
TransposeFunc
<
float
>
(
input_x
->
numel
(),
input_x_data
,
axis
,
old_strides
,
new_strides
,
out_data
);
}
}
// namespace operators
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录