Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Crayon鑫
Paddle
提交
eec133ca
P
Paddle
项目概览
Crayon鑫
/
Paddle
与 Fork 源项目一致
Fork自
PaddlePaddle / Paddle
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
eec133ca
编写于
1月 18, 2019
作者:
T
Tao Luo
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
remove legacy testing code
上级
1777017a
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
0 addition
and
322 deletion
+0
-322
paddle/testing/TestMain.cpp
paddle/testing/TestMain.cpp
+0
-22
paddle/testing/TestUtil.cpp
paddle/testing/TestUtil.cpp
+0
-222
paddle/testing/TestUtil.h
paddle/testing/TestUtil.h
+0
-78
未找到文件。
paddle/testing/TestMain.cpp
已删除
100644 → 0
浏览文件 @
1777017a
/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
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. */
#include <gtest/gtest.h>
#include "paddle/legacy/utils/Util.h"
int
main
(
int
argc
,
char
**
argv
)
{
testing
::
InitGoogleTest
(
&
argc
,
argv
);
paddle
::
initMain
(
argc
,
argv
);
return
RUN_ALL_TESTS
();
}
paddle/testing/TestUtil.cpp
已删除
100644 → 0
浏览文件 @
1777017a
/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
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. */
#include "TestUtil.h"
#include <gflags/gflags.h>
#include "paddle/legacy/math/SparseMatrix.h"
DEFINE_int32
(
fixed_seq_length
,
0
,
"Produce some sequence of fixed length"
);
namespace
paddle
{
std
::
string
randStr
(
const
int
len
)
{
std
::
string
str
=
"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
;
std
::
string
s
=
""
;
for
(
int
i
=
0
;
i
<
len
;
++
i
)
s
+=
str
[(
rand
()
%
62
)];
// NOLINT
return
s
;
}
MatrixPtr
makeRandomSparseMatrix
(
size_t
height
,
size_t
width
,
bool
withValue
,
bool
useGpu
,
bool
equalNnzPerSample
)
{
#ifndef PADDLE_MOBILE_INFERENCE
std
::
vector
<
int64_t
>
ids
(
height
);
std
::
vector
<
int64_t
>
indices
(
height
+
1
);
indices
[
0
]
=
0
;
std
::
function
<
size_t
()
>
randomer
=
[]
{
return
uniformRandom
(
10
);
};
if
(
equalNnzPerSample
)
{
size_t
n
=
0
;
do
{
n
=
uniformRandom
(
10
);
}
while
(
!
n
);
randomer
=
[
=
]
{
return
n
;
};
}
for
(
size_t
i
=
0
;
i
<
height
;
++
i
)
{
indices
[
i
+
1
]
=
indices
[
i
]
+
std
::
min
(
randomer
(),
width
);
ids
[
i
]
=
i
;
}
if
(
!
withValue
)
{
std
::
vector
<
sparse_non_value_t
>
data
;
data
.
resize
(
indices
[
height
]
-
indices
[
0
]);
for
(
size_t
i
=
0
;
i
<
data
.
size
();
++
i
)
{
data
[
i
].
col
=
uniformRandom
(
width
);
}
auto
mat
=
Matrix
::
createSparseMatrix
(
height
,
width
,
data
.
size
(),
NO_VALUE
,
SPARSE_CSR
,
false
,
useGpu
);
if
(
useGpu
)
{
std
::
dynamic_pointer_cast
<
GpuSparseMatrix
>
(
mat
)
->
copyFrom
(
ids
.
data
(),
indices
.
data
(),
data
.
data
(),
HPPL_STREAM_DEFAULT
);
}
else
{
std
::
dynamic_pointer_cast
<
CpuSparseMatrix
>
(
mat
)
->
copyFrom
(
ids
.
data
(),
indices
.
data
(),
data
.
data
());
}
return
mat
;
}
else
{
std
::
vector
<
sparse_float_value_t
>
data
;
data
.
resize
(
indices
[
height
]
-
indices
[
0
]);
for
(
size_t
i
=
0
;
i
<
data
.
size
();
++
i
)
{
data
[
i
].
col
=
uniformRandom
(
width
);
data
[
i
].
value
=
rand
()
/
static_cast
<
float
>
(
RAND_MAX
);
// NOLINT
}
auto
mat
=
Matrix
::
createSparseMatrix
(
height
,
width
,
data
.
size
(),
FLOAT_VALUE
,
SPARSE_CSR
,
false
,
useGpu
);
if
(
useGpu
)
{
std
::
dynamic_pointer_cast
<
GpuSparseMatrix
>
(
mat
)
->
copyFrom
(
ids
.
data
(),
indices
.
data
(),
data
.
data
(),
HPPL_STREAM_DEFAULT
);
}
else
{
std
::
dynamic_pointer_cast
<
CpuSparseMatrix
>
(
mat
)
->
copyFrom
(
ids
.
data
(),
indices
.
data
(),
data
.
data
());
}
return
mat
;
}
#endif
return
nullptr
;
}
void
generateSequenceStartPositions
(
size_t
batchSize
,
IVectorPtr
&
sequenceStartPositions
)
{
ICpuGpuVectorPtr
gpuCpuVec
;
generateSequenceStartPositions
(
batchSize
,
gpuCpuVec
);
sequenceStartPositions
=
gpuCpuVec
->
getMutableVector
(
false
);
}
void
generateSequenceStartPositions
(
size_t
batchSize
,
ICpuGpuVectorPtr
&
sequenceStartPositions
)
{
int
numSeqs
;
if
(
FLAGS_fixed_seq_length
!=
0
)
{
numSeqs
=
std
::
ceil
((
float
)
batchSize
/
(
float
)
FLAGS_fixed_seq_length
);
}
else
{
numSeqs
=
batchSize
/
10
+
1
;
}
sequenceStartPositions
=
ICpuGpuVector
::
create
(
numSeqs
+
1
,
/* useGpu= */
false
);
int
*
buf
=
sequenceStartPositions
->
getMutableData
(
false
);
int64_t
pos
=
0
;
int
len
=
FLAGS_fixed_seq_length
;
int
maxLen
=
2
*
batchSize
/
numSeqs
;
for
(
int
i
=
0
;
i
<
numSeqs
;
++
i
)
{
if
(
FLAGS_fixed_seq_length
==
0
)
{
len
=
uniformRandom
(
std
::
min
<
int64_t
>
(
maxLen
,
batchSize
-
pos
-
numSeqs
+
i
))
+
1
;
}
buf
[
i
]
=
pos
;
pos
+=
len
;
VLOG
(
1
)
<<
" len="
<<
len
;
}
buf
[
numSeqs
]
=
batchSize
;
}
void
generateSubSequenceStartPositions
(
const
ICpuGpuVectorPtr
&
sequenceStartPositions
,
ICpuGpuVectorPtr
&
subSequenceStartPositions
)
{
int
numSeqs
=
sequenceStartPositions
->
getSize
()
-
1
;
const
int
*
buf
=
sequenceStartPositions
->
getData
(
false
);
int
numOnes
=
0
;
for
(
int
i
=
0
;
i
<
numSeqs
;
++
i
)
{
if
(
buf
[
i
+
1
]
-
buf
[
i
]
==
1
)
{
++
numOnes
;
}
}
// each seq has two sub-seq except length 1
int
numSubSeqs
=
numSeqs
*
2
-
numOnes
;
subSequenceStartPositions
=
ICpuGpuVector
::
create
(
numSubSeqs
+
1
,
/* useGpu= */
false
);
int
*
subBuf
=
subSequenceStartPositions
->
getMutableData
(
false
);
int
j
=
0
;
for
(
int
i
=
0
;
i
<
numSeqs
;
++
i
)
{
if
(
buf
[
i
+
1
]
-
buf
[
i
]
==
1
)
{
subBuf
[
j
++
]
=
buf
[
i
];
}
else
{
int
len
=
uniformRandom
(
buf
[
i
+
1
]
-
buf
[
i
]
-
1
)
+
1
;
subBuf
[
j
++
]
=
buf
[
i
];
subBuf
[
j
++
]
=
buf
[
i
]
+
len
;
}
}
subBuf
[
j
]
=
buf
[
numSeqs
];
}
void
generateMDimSequenceData
(
const
IVectorPtr
&
sequenceStartPositions
,
IVectorPtr
&
cpuSequenceDims
)
{
/* generate sequences with 2 dims */
int
numSeqs
=
sequenceStartPositions
->
getSize
()
-
1
;
int
numDims
=
2
;
cpuSequenceDims
=
IVector
::
create
(
numSeqs
*
numDims
,
/* useGpu= */
false
);
int
*
bufStarts
=
sequenceStartPositions
->
getData
();
int
*
bufDims
=
cpuSequenceDims
->
getData
();
for
(
int
i
=
0
;
i
<
numSeqs
;
i
++
)
{
int
len
=
bufStarts
[
i
+
1
]
-
bufStarts
[
i
];
/* get width and height randomly */
std
::
vector
<
int
>
dimVec
;
for
(
int
j
=
0
;
j
<
len
;
j
++
)
{
if
(
len
%
(
j
+
1
)
==
0
)
{
dimVec
.
push_back
(
1
);
}
}
int
idx
=
rand
()
%
dimVec
.
size
();
// NOLINT use rand_r
bufDims
[
i
*
numDims
]
=
dimVec
[
idx
];
bufDims
[
i
*
numDims
+
1
]
=
len
/
dimVec
[
idx
];
}
}
void
generateMDimSequenceData
(
const
ICpuGpuVectorPtr
&
sequenceStartPositions
,
IVectorPtr
&
cpuSequenceDims
)
{
/* generate sequences with 2 dims */
int
numSeqs
=
sequenceStartPositions
->
getSize
()
-
1
;
int
numDims
=
2
;
cpuSequenceDims
=
IVector
::
create
(
numSeqs
*
numDims
,
/* useGpu= */
false
);
const
int
*
bufStarts
=
sequenceStartPositions
->
getData
(
false
);
int
*
bufDims
=
cpuSequenceDims
->
getData
();
for
(
int
i
=
0
;
i
<
numSeqs
;
i
++
)
{
int
len
=
bufStarts
[
i
+
1
]
-
bufStarts
[
i
];
/* get width and height randomly */
std
::
vector
<
int
>
dimVec
;
for
(
int
j
=
0
;
j
<
len
;
j
++
)
{
if
(
len
%
(
j
+
1
)
==
0
)
{
dimVec
.
push_back
(
1
);
}
}
int
idx
=
rand
()
%
dimVec
.
size
();
// NOLINT use rand_r
bufDims
[
i
*
numDims
]
=
dimVec
[
idx
];
bufDims
[
i
*
numDims
+
1
]
=
len
/
dimVec
[
idx
];
}
}
void
checkMatrixEqual
(
const
MatrixPtr
&
a
,
const
MatrixPtr
&
b
)
{
EXPECT_EQ
(
a
->
getWidth
(),
b
->
getWidth
());
EXPECT_EQ
(
a
->
getHeight
(),
b
->
getHeight
());
EXPECT_EQ
(
a
->
isTransposed
(),
b
->
isTransposed
());
for
(
size_t
r
=
0
;
r
<
a
->
getHeight
();
++
r
)
{
for
(
size_t
c
=
0
;
c
<
a
->
getWidth
();
++
c
)
{
EXPECT_FLOAT_EQ
(
a
->
getElement
(
r
,
c
),
b
->
getElement
(
r
,
c
));
}
}
}
void
checkVectorEqual
(
const
IVectorPtr
&
a
,
const
IVectorPtr
&
b
)
{
EXPECT_EQ
(
a
->
getSize
(),
b
->
getSize
());
for
(
size_t
r
=
0
;
r
<
a
->
getSize
();
++
r
)
{
EXPECT_FLOAT_EQ
(
a
->
get
(
r
),
b
->
get
(
r
));
}
}
}
// namespace paddle
paddle/testing/TestUtil.h
已删除
100644 → 0
浏览文件 @
1777017a
/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
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. */
#pragma once
#include <gtest/gtest.h>
#include "paddle/legacy/math/Matrix.h"
namespace
paddle
{
std
::
string
randStr
(
const
int
len
);
inline
int
uniformRandom
(
int
n
)
{
return
n
==
0
?
0
:
rand
()
%
n
;
}
inline
bool
approximatelyEqual
(
float
a
,
float
b
,
float
epsilon
)
{
return
fabs
(
a
-
b
)
<=
((
fabs
(
a
)
<
fabs
(
b
)
?
fabs
(
b
)
:
fabs
(
a
))
*
epsilon
);
}
MatrixPtr
makeRandomSparseMatrix
(
size_t
height
,
size_t
width
,
bool
withValue
,
bool
useGpu
,
bool
equalNnzPerSample
=
false
);
/**
* @brief generate sequenceStartPositions for INPUT_SEQUENCE_DATA,
* INPUT_HASSUB_SEQUENCE_DATA and INPUT_SEQUENCE_LABEL
*
* @param batchSize batchSize
* sequenceStartPositions[out] generation output
*/
void
generateSequenceStartPositions
(
size_t
batchSize
,
IVectorPtr
&
sequenceStartPositions
);
void
generateSequenceStartPositions
(
size_t
batchSize
,
ICpuGpuVectorPtr
&
sequenceStartPositions
);
/**
* @brief generate subSequenceStartPositions for INPUT_HASSUB_SEQUENCE_DATA
* according to sequenceStartPositions
*
* @param sequenceStartPositions[in] input
* subSequenceStartPositions[out] generation output
*/
void
generateSubSequenceStartPositions
(
const
IVectorPtr
&
sequenceStartPositions
,
IVectorPtr
&
subSequenceStartPositions
);
void
generateSubSequenceStartPositions
(
const
ICpuGpuVectorPtr
&
sequenceStartPositions
,
ICpuGpuVectorPtr
&
subSequenceStartPositions
);
/**
* @brief generate cpuSequenceDims for INPUT_SEQUENCE_MDIM_DATA according to
* sequenceStartPositions
*
* @param sequenceStartPositions[in] input
* cpuSequenceDims[out] generation output
*/
void
generateMDimSequenceData
(
const
IVectorPtr
&
sequenceStartPositions
,
IVectorPtr
&
cpuSequenceDims
);
void
generateMDimSequenceData
(
const
ICpuGpuVectorPtr
&
sequenceStartPositions
,
IVectorPtr
&
cpuSequenceDims
);
void
checkMatrixEqual
(
const
MatrixPtr
&
a
,
const
MatrixPtr
&
b
);
void
checkVectorEqual
(
const
IVectorPtr
&
a
,
const
IVectorPtr
&
b
);
}
// namespace paddle
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录