Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
N
NiuTrans.Tensor
概览
Overview
Details
Activity
Cycle Analytics
版本库
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
问题
0
Issues
0
列表
Board
标记
里程碑
合并请求
0
Merge Requests
0
CI / CD
CI / CD
流水线
作业
日程表
图表
维基
Wiki
代码片段
Snippets
成员
Collapse sidebar
Close sidebar
活动
图像
聊天
创建新问题
作业
提交
Issue Boards
Open sidebar
杨迪
NiuTrans.Tensor
Commits
cb90f909
Commit
cb90f909
authored
Sep 10, 2018
by
xiaotong
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
test XMem for gpu memory allocation
parent
91fdf94e
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
15 行增加
和
12 行删除
+15
-12
source/tensor/Main.cpp
+0
-3
source/tensor/XMem.cpp
+3
-3
source/tensor/XMem.h
+1
-1
source/tensor/test/TXMem.cpp
+11
-5
没有找到文件。
source/tensor/Main.cpp
查看文件 @
cb90f909
...
...
@@ -44,9 +44,6 @@ int main( int argc, const char ** argv )
{
//_CrtSetBreakAlloc(123);
TestXMem
();
return
0
;
/* a tiny test */
//SmallTest();
...
...
source/tensor/XMem.cpp
查看文件 @
cb90f909
...
...
@@ -150,6 +150,9 @@ void XMem::Initialize(int myDevID, MEMPOOL_MODE myMode, MTYPE myBlockSize, int m
}
bufSize
=
myBufSize
;
if
(
myMode
==
FREE_ON_THE_FLY
)
SetIndex
(
MILLION
);
}
/* free memory */
...
...
@@ -718,9 +721,6 @@ void * XMem::AllocStandard(int myDevID, MTYPE mySize, bool myIsRebuiltIndex)
RebuildIndex
();
CheckNTErrors
(
nodeNumUsed
<
nodeNum
,
"No enough index nodes for the memory pool!"
);
}
//if(testxmemid == 106)
// recordp = result;
return
result
;
}
...
...
source/tensor/XMem.h
查看文件 @
cb90f909
...
...
@@ -328,7 +328,7 @@ public:
/* remove an index node for memory pieces in use */
void
RemoveAllocIndexNode
(
MPieceNode
*
node
,
MPieceNode
*
entry
=
NULL
);
/* add an index node for available memory pieces
∂
*/
/* add an index node for available memory pieces */
void
AddAllocIndexNode
(
MPieceNode
*
node
,
MPieceNode
*
entry
=
NULL
);
/* release a piece of memory as "free" */
...
...
source/tensor/test/TXMem.cpp
查看文件 @
cb90f909
...
...
@@ -44,10 +44,11 @@ bool TestXMemCase1()
devNum = 1;
}*/
int
*
buf
=
new
int
[
blcokSize
*
10
];
for
(
int
id
=
0
;
id
<
devNum
;
id
++
)
{
int
devID
=
devIDs
[
id
];
for
(
int
i
=
0
,
scalar
=
1
;
i
<
3
;
i
++
)
{
for
(
int
i
ter
=
0
,
scalar
=
1
;
iter
<
3
;
iter
++
)
{
XMem
mem
;
mem
.
Initialize
(
devID
,
FREE_ON_THE_FLY
,
blcokSize
*
sizeof
(
int
)
*
scalar
*
scalar
,
1000
,
0
);
mem
.
SetIndex
(
10000
,
blcokSize
*
sizeof
(
int
)
/
2
);
...
...
@@ -64,25 +65,28 @@ bool TestXMemCase1()
for
(
int
i
=
0
;
i
<
testNum
*
scalar
;
i
++
)
{
testxmemid
++
;
//fprintf(stderr, "%d
\n", testxmemid
);
//fprintf(stderr, "%d
%d\n", testxmemid, ok
);
int
j
=
rand
()
%
caseNum
;
if
(
p
[
j
]
==
NULL
)
{
p
[
j
]
=
(
int
*
)
mem
.
AllocStandard
(
mem
.
devID
,
size
[
j
]
*
sizeof
(
int
));
for
(
int
k
=
0
;
k
<
size
[
j
];
k
++
)
p
[
j
][
k
]
=
j
;
buf
[
k
]
=
j
;
XMemCopy
(
p
[
j
],
devID
,
buf
,
-
1
,
sizeof
(
int
)
*
size
[
j
]);
}
else
{
mem
.
ReleaseStandard
(
mem
.
devID
,
p
[
j
],
size
[
j
]
*
sizeof
(
int
));
for
(
int
k
=
0
;
k
<
size
[
j
];
k
++
)
p
[
j
][
k
]
=
-
1
;
buf
[
k
]
=
-
1
;
XMemCopy
(
p
[
j
],
devID
,
buf
,
-
1
,
sizeof
(
int
)
*
size
[
j
]);
p
[
j
]
=
NULL
;
}
for
(
int
k
=
0
;
k
<
caseNum
;
k
++
)
{
if
(
p
[
k
]
!=
NULL
)
{
XMemCopy
(
buf
,
-
1
,
p
[
k
],
devID
,
sizeof
(
int
)
*
size
[
k
]);
for
(
int
o
=
0
;
o
<
size
[
k
];
o
++
)
{
if
(
p
[
k
]
[
o
]
!=
k
)
{
if
(
buf
[
o
]
!=
k
)
{
ok
=
false
;
}
}
...
...
@@ -151,6 +155,8 @@ bool TestXMemCase1()
}
}
delete
[]
buf
;
return
ok
;
}
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论