Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
taosdata
TDengine
提交
138d1d26
TDengine
项目概览
taosdata
/
TDengine
大约 2 年 前同步成功
通知
1192
Star
22018
Fork
4786
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
TDengine
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
138d1d26
编写于
1月 16, 2023
作者:
H
Haojun Liao
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
refactor: opt hash perf.
上级
82f4db30
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
58 addition
and
12 deletion
+58
-12
source/libs/executor/src/tsimplehash.c
source/libs/executor/src/tsimplehash.c
+51
-11
source/util/src/tarray.c
source/util/src/tarray.c
+7
-1
未找到文件。
source/libs/executor/src/tsimplehash.c
浏览文件 @
138d1d26
...
...
@@ -18,12 +18,13 @@
#include "tlog.h"
#include "tdef.h"
#define DEFAULT_BUF_PAGE_SIZE 1024
#define SHASH_DEFAULT_LOAD_FACTOR 0.75
#define HASH_MAX_CAPACITY (1024 * 1024 * 16L)
#define SHASH_NEED_RESIZE(_h) ((_h)->size >= (_h)->capacity * SHASH_DEFAULT_LOAD_FACTOR)
#define GET_SHASH_NODE_
KEY(_n, _dl) ((char *)(_n) + sizeof(SHNode) + (_dl)
)
#define GET_SHASH_NODE_
DATA(_n) ((char *)(_n) + sizeof(SHNode
))
#define GET_SHASH_NODE_
DATA(_n) (((SHNode*)_n)->data
)
#define GET_SHASH_NODE_
KEY(_n, _dl) ((char*)GET_SHASH_NODE_DATA(_n) + (_dl
))
#define HASH_INDEX(v, c) ((v) & ((c)-1))
...
...
@@ -38,6 +39,8 @@ struct SSHashObj {
int64_t
size
;
// number of elements in hash table
_hash_fn_t
hashFp
;
// hash function
_equal_fn_t
equalFp
;
// equal function
SArray
*
pHashNodeBuf
;
// hash node allocation buffer, 1k size of each page by default
int32_t
offset
;
// allocation offset in current page
};
static
FORCE_INLINE
int32_t
taosHashCapacity
(
int32_t
length
)
{
...
...
@@ -57,18 +60,21 @@ SSHashObj *tSimpleHashInit(size_t capacity, _hash_fn_t fn) {
capacity
=
4
;
}
SSHashObj
*
pHashObj
=
(
SSHashObj
*
)
taosMemory
Calloc
(
1
,
sizeof
(
SSHashObj
));
SSHashObj
*
pHashObj
=
(
SSHashObj
*
)
taosMemory
Malloc
(
sizeof
(
SSHashObj
));
if
(
!
pHashObj
)
{
terrno
=
TSDB_CODE_OUT_OF_MEMORY
;
return
NULL
;
}
// the max slots is not defined by user
pHashObj
->
hashFp
=
fn
;
pHashObj
->
capacity
=
taosHashCapacity
((
int32_t
)
capacity
);
pHashObj
->
equalFp
=
memcmp
;
pHashObj
->
hashFp
=
fn
;
pHashObj
->
pHashNodeBuf
=
taosArrayInit
(
10
,
sizeof
(
void
*
));
pHashObj
->
offset
=
0
;
pHashObj
->
size
=
0
;
pHashObj
->
hashList
=
(
SHNode
**
)
taosMemoryCalloc
(
pHashObj
->
capacity
,
sizeof
(
void
*
));
if
(
!
pHashObj
->
hashList
)
{
taosMemoryFree
(
pHashObj
);
...
...
@@ -85,16 +91,43 @@ int32_t tSimpleHashGetSize(const SSHashObj *pHashObj) {
return
(
int32_t
)
atomic_load_64
((
int64_t
*
)
&
pHashObj
->
size
);
}
static
SHNode
*
doCreateHashNode
(
const
void
*
key
,
size_t
keyLen
,
const
void
*
data
,
size_t
dataLen
,
uint32_t
hashVal
)
{
SHNode
*
pNewNode
=
taosMemoryMalloc
(
sizeof
(
SHNode
)
+
keyLen
+
dataLen
);
static
void
*
doInternalAlloc
(
SSHashObj
*
pHashObj
,
int32_t
size
)
{
void
**
p
=
taosArrayGetLast
(
pHashObj
->
pHashNodeBuf
);
if
(
p
==
NULL
||
(
pHashObj
->
offset
+
size
)
>
DEFAULT_BUF_PAGE_SIZE
)
{
// let's allocate one new page
if
(
size
>
DEFAULT_BUF_PAGE_SIZE
)
{
// TODO
}
void
*
pNewPage
=
taosMemoryMalloc
(
DEFAULT_BUF_PAGE_SIZE
);
if
(
pNewPage
==
NULL
)
{
return
NULL
;
}
pHashObj
->
offset
=
size
;
taosArrayPush
(
pHashObj
->
pHashNodeBuf
,
&
pNewPage
);
return
pNewPage
;
}
else
{
void
*
pPos
=
(
*
p
)
+
pHashObj
->
offset
;
pHashObj
->
offset
+=
size
;
return
pPos
;
}
}
static
SHNode
*
doCreateHashNode
(
SSHashObj
*
pHashObj
,
const
void
*
key
,
size_t
keyLen
,
const
void
*
data
,
size_t
dataLen
)
{
SHNode
*
pNewNode
=
doInternalAlloc
(
pHashObj
,
sizeof
(
SHNode
)
+
keyLen
+
dataLen
);
if
(
!
pNewNode
)
{
terrno
=
TSDB_CODE_OUT_OF_MEMORY
;
return
NULL
;
}
pNewNode
->
keyLen
=
keyLen
;
pNewNode
->
dataLen
=
dataLen
;
pNewNode
->
next
=
NULL
;
if
(
data
)
memcpy
(
GET_SHASH_NODE_DATA
(
pNewNode
),
data
,
dataLen
);
if
(
data
)
{
memcpy
(
GET_SHASH_NODE_DATA
(
pNewNode
),
data
,
dataLen
);
}
memcpy
(
GET_SHASH_NODE_KEY
(
pNewNode
,
dataLen
),
key
,
keyLen
);
return
pNewNode
;
}
...
...
@@ -179,7 +212,7 @@ int32_t tSimpleHashPut(SSHashObj *pHashObj, const void *key, size_t keyLen, cons
SHNode
*
pNode
=
pHashObj
->
hashList
[
slot
];
if
(
!
pNode
)
{
SHNode
*
pNewNode
=
doCreateHashNode
(
key
,
keyLen
,
data
,
dataLen
,
hashVal
);
SHNode
*
pNewNode
=
doCreateHashNode
(
pHashObj
,
key
,
keyLen
,
data
,
dataLen
);
if
(
!
pNewNode
)
{
return
-
1
;
}
...
...
@@ -197,7 +230,7 @@ int32_t tSimpleHashPut(SSHashObj *pHashObj, const void *key, size_t keyLen, cons
}
if
(
!
pNode
)
{
SHNode
*
pNewNode
=
doCreateHashNode
(
key
,
keyLen
,
data
,
dataLen
,
hashVal
);
SHNode
*
pNewNode
=
doCreateHashNode
(
pHashObj
,
key
,
keyLen
,
data
,
dataLen
);
if
(
!
pNewNode
)
{
return
-
1
;
}
...
...
@@ -320,6 +353,7 @@ void tSimpleHashClear(SSHashObj *pHashObj) {
return
;
}
// TODO recycle the allocated buffer.
SHNode
*
pNode
=
NULL
,
*
pNext
=
NULL
;
for
(
int32_t
i
=
0
;
i
<
pHashObj
->
capacity
;
++
i
)
{
pNode
=
pHashObj
->
hashList
[
i
];
...
...
@@ -329,7 +363,7 @@ void tSimpleHashClear(SSHashObj *pHashObj) {
while
(
pNode
)
{
pNext
=
pNode
->
next
;
FREE_HASH_NODE
(
pNode
);
//
FREE_HASH_NODE(pNode);
pNode
=
pNext
;
}
pHashObj
->
hashList
[
i
]
=
NULL
;
...
...
@@ -337,6 +371,10 @@ void tSimpleHashClear(SSHashObj *pHashObj) {
atomic_store_64
(
&
pHashObj
->
size
,
0
);
}
static
void
destroyItems
(
void
*
pItem
)
{
taosMemoryFree
(
*
(
void
**
)
pItem
);
}
void
tSimpleHashCleanup
(
SSHashObj
*
pHashObj
)
{
if
(
!
pHashObj
)
{
return
;
...
...
@@ -344,6 +382,8 @@ void tSimpleHashCleanup(SSHashObj *pHashObj) {
tSimpleHashClear
(
pHashObj
);
taosMemoryFreeClear
(
pHashObj
->
hashList
);
taosArrayDestroyEx
(
pHashObj
->
pHashNodeBuf
,
destroyItems
);
taosMemoryFree
(
pHashObj
);
}
...
...
source/util/src/tarray.c
浏览文件 @
138d1d26
...
...
@@ -220,7 +220,13 @@ void* taosArrayGetP(const SArray* pArray, size_t index) {
return
*
(
void
**
)
d
;
}
void
*
taosArrayGetLast
(
const
SArray
*
pArray
)
{
return
TARRAY_GET_ELEM
(
pArray
,
pArray
->
size
-
1
);
}
void
*
taosArrayGetLast
(
const
SArray
*
pArray
)
{
if
(
pArray
->
size
==
0
)
{
return
NULL
;
}
return
TARRAY_GET_ELEM
(
pArray
,
pArray
->
size
-
1
);
}
size_t
taosArrayGetSize
(
const
SArray
*
pArray
)
{
if
(
pArray
==
NULL
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录