Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
taosdata
TDengine
提交
8914c0cc
T
TDengine
项目概览
taosdata
/
TDengine
1 年多 前同步成功
通知
1185
Star
22016
Fork
4786
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
TDengine
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
未验证
提交
8914c0cc
编写于
9月 05, 2019
作者:
S
slguan
提交者:
GitHub
9月 05, 2019
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #345 from localvar/improve-memory-pool
improve memory pool
上级
977550a1
a97aac4e
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
19 addition
and
18 deletion
+19
-18
src/util/src/tmempool.c
src/util/src/tmempool.c
+19
-18
未找到文件。
src/util/src/tmempool.c
浏览文件 @
8914c0cc
...
@@ -64,6 +64,7 @@ mpool_h taosMemPoolInit(int numOfBlock, int blockSize) {
...
@@ -64,6 +64,7 @@ mpool_h taosMemPoolInit(int numOfBlock, int blockSize) {
pthread_mutex_init
(
&
(
pool_p
->
mutex
),
NULL
);
pthread_mutex_init
(
&
(
pool_p
->
mutex
),
NULL
);
memset
(
pool_p
->
pool
,
0
,
(
size_t
)(
blockSize
*
numOfBlock
));
for
(
i
=
0
;
i
<
pool_p
->
numOfBlock
;
++
i
)
pool_p
->
freeList
[
i
]
=
i
;
for
(
i
=
0
;
i
<
pool_p
->
numOfBlock
;
++
i
)
pool_p
->
freeList
[
i
]
=
i
;
pool_p
->
first
=
0
;
pool_p
->
first
=
0
;
...
@@ -78,9 +79,7 @@ char *taosMemPoolMalloc(mpool_h handle) {
...
@@ -78,9 +79,7 @@ char *taosMemPoolMalloc(mpool_h handle) {
pthread_mutex_lock
(
&
(
pool_p
->
mutex
));
pthread_mutex_lock
(
&
(
pool_p
->
mutex
));
if
(
pool_p
->
numOfFree
<=
0
)
{
if
(
pool_p
->
numOfFree
>
0
)
{
pTrace
(
"mempool: out of memory"
);
}
else
{
pos
=
pool_p
->
pool
+
pool_p
->
blockSize
*
(
pool_p
->
freeList
[
pool_p
->
first
]);
pos
=
pool_p
->
pool
+
pool_p
->
blockSize
*
(
pool_p
->
freeList
[
pool_p
->
first
]);
pool_p
->
first
++
;
pool_p
->
first
++
;
pool_p
->
first
=
pool_p
->
first
%
pool_p
->
numOfBlock
;
pool_p
->
first
=
pool_p
->
first
%
pool_p
->
numOfBlock
;
...
@@ -88,7 +87,8 @@ char *taosMemPoolMalloc(mpool_h handle) {
...
@@ -88,7 +87,8 @@ char *taosMemPoolMalloc(mpool_h handle) {
}
}
pthread_mutex_unlock
(
&
(
pool_p
->
mutex
));
pthread_mutex_unlock
(
&
(
pool_p
->
mutex
));
if
(
pos
!=
NULL
)
memset
(
pos
,
0
,
(
size_t
)
pool_p
->
blockSize
);
if
(
pos
==
NULL
)
pTrace
(
"mempool: out of memory"
);
return
pos
;
return
pos
;
}
}
...
@@ -98,23 +98,24 @@ void taosMemPoolFree(mpool_h handle, char *pMem) {
...
@@ -98,23 +98,24 @@ void taosMemPoolFree(mpool_h handle, char *pMem) {
if
(
pMem
==
NULL
)
return
;
if
(
pMem
==
NULL
)
return
;
pthread_mutex_lock
(
&
pool_p
->
mutex
);
index
=
(
int
)(
pMem
-
pool_p
->
pool
)
%
pool_p
->
blockSize
;
index
=
(
int
)(
pMem
-
pool_p
->
pool
)
%
pool_p
->
blockSize
;
if
(
index
!=
0
)
{
if
(
index
!=
0
)
{
pError
(
"invalid free address:%p
\n
"
,
pMem
);
pError
(
"invalid free address:%p
\n
"
,
pMem
);
}
else
{
return
;
index
=
(
int
)((
pMem
-
pool_p
->
pool
)
/
pool_p
->
blockSize
);
}
index
=
(
int
)((
pMem
-
pool_p
->
pool
)
/
pool_p
->
blockSize
);
if
(
index
<
0
||
index
>=
pool_p
->
numOfBlock
)
{
if
(
index
<
0
||
index
>=
pool_p
->
numOfBlock
)
{
pError
(
"mempool: error, invalid address:%p
\n
"
,
pMem
);
pError
(
"mempool: error, invalid address:%p
\n
"
,
pMem
);
}
else
{
return
;
}
memset
(
pMem
,
0
,
(
size_t
)
pool_p
->
blockSize
);
pthread_mutex_lock
(
&
pool_p
->
mutex
);
pool_p
->
freeList
[(
pool_p
->
first
+
pool_p
->
numOfFree
)
%
pool_p
->
numOfBlock
]
=
index
;
pool_p
->
freeList
[(
pool_p
->
first
+
pool_p
->
numOfFree
)
%
pool_p
->
numOfBlock
]
=
index
;
pool_p
->
numOfFree
++
;
pool_p
->
numOfFree
++
;
memset
(
pMem
,
0
,
(
size_t
)
pool_p
->
blockSize
);
}
}
pthread_mutex_unlock
(
&
pool_p
->
mutex
);
pthread_mutex_unlock
(
&
pool_p
->
mutex
);
}
}
...
@@ -125,6 +126,6 @@ void taosMemPoolCleanUp(mpool_h handle) {
...
@@ -125,6 +126,6 @@ void taosMemPoolCleanUp(mpool_h handle) {
pthread_mutex_destroy
(
&
pool_p
->
mutex
);
pthread_mutex_destroy
(
&
pool_p
->
mutex
);
if
(
pool_p
->
pool
)
free
(
pool_p
->
pool
);
if
(
pool_p
->
pool
)
free
(
pool_p
->
pool
);
if
(
pool_p
->
freeList
)
free
(
pool_p
->
freeList
);
if
(
pool_p
->
freeList
)
free
(
pool_p
->
freeList
);
memset
(
&
pool_p
,
0
,
sizeof
(
pool_p
));
memset
(
pool_p
,
0
,
sizeof
(
*
pool_p
));
free
(
pool_p
);
free
(
pool_p
);
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录