Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
王长生-AnH
TDengine
提交
4e2c124c
T
TDengine
项目概览
王长生-AnH
/
TDengine
与 Fork 源项目一致
Fork自
taosdata / TDengine
通知
5
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
TDengine
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
4e2c124c
编写于
3月 20, 2020
作者:
H
hzcheng
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
TD-34
上级
72f871f0
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
186 addition
and
0 deletion
+186
-0
src/util/inc/tlist.h
src/util/inc/tlist.h
+61
-0
src/util/src/tlist.c
src/util/src/tlist.c
+125
-0
未找到文件。
src/util/inc/tlist.h
0 → 100644
浏览文件 @
4e2c124c
/*
* Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
*
* This program is free software: you can use, redistribute, and/or modify
* it under the terms of the GNU Affero General Public License, version 3
* or later ("AGPL"), as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _TD_LIST_
#define _TD_LIST_
#ifdef __cplusplus
extern
"C"
{
#endif
typedef
struct
_list_node
{
struct
_list_node
*
next
;
struct
_list_node
*
prev
;
char
data
[];
}
SListNode
;
typedef
struct
{
struct
_list_node
*
head
;
struct
_list_node
*
tail
;
int
numOfEles
;
int
eleSize
;
}
SList
;
typedef
struct
{
SListNode
*
node
;
}
SListIter
;
#define listHead(l) (l)->head
#define listTail(l) (l)->tail
#define listNEles(l) (l)->numOfEles
#define listEleSize(l) (l)->eleSize
#define isListEmpty(l) ((l)->numOfEles == 0)
#define listNodeFree(n) free(n);
SList
*
tdListNew
(
int
eleSize
);
void
tdListFree
(
SList
*
list
);
void
tdListEmpty
(
SList
*
list
);
int
tdListPrepend
(
SList
*
list
,
void
*
data
);
int
tdListAppend
(
SList
*
list
,
void
*
data
);
SListNode
*
tdListPopHead
(
SList
*
list
);
SListNode
*
tdListPopTail
(
SList
*
list
);
SListNode
*
tdListPopNode
(
SList
*
list
,
SListNode
*
node
);
void
tdListNodeGetData
(
SList
*
list
,
SListNode
*
node
,
void
*
target
);
#ifdef __cplusplus
}
#endif
#endif
\ No newline at end of file
src/util/src/tlist.c
0 → 100644
浏览文件 @
4e2c124c
/*
* Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
*
* This program is free software: you can use, redistribute, and/or modify
* it under the terms of the GNU Affero General Public License, version 3
* or later ("AGPL"), as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include <string.h>
#include "tlist.h"
SList
*
tdListNew
(
int
eleSize
)
{
SList
*
list
=
(
SList
*
)
malloc
(
sizeof
(
SList
));
if
(
list
==
NULL
)
return
NULL
;
list
->
eleSize
=
eleSize
;
list
->
numOfEles
=
0
;
list
->
head
=
list
->
tail
=
NULL
;
return
NULL
;
}
void
tdListEmpty
(
SList
*
list
)
{
SListNode
*
node
=
list
->
head
;
while
(
node
)
{
list
->
head
=
node
->
next
;
free
(
node
);
node
=
list
->
head
;
}
list
->
head
=
list
->
tail
=
0
;
list
->
numOfEles
=
0
;
}
void
tdListFree
(
SList
*
list
)
{
tdListEmpty
(
list
);
free
(
list
);
}
int
tdListPrepend
(
SList
*
list
,
void
*
data
)
{
SListNode
*
node
=
(
SListNode
*
)
malloc
(
sizeof
(
SListNode
)
+
list
->
eleSize
);
if
(
node
==
NULL
)
return
-
1
;
if
(
list
->
head
==
NULL
)
{
list
->
head
=
node
;
list
->
tail
=
node
;
}
else
{
node
->
next
=
list
->
head
;
node
->
prev
=
NULL
;
list
->
head
->
prev
=
node
;
list
->
head
=
node
;
}
list
->
numOfEles
++
;
return
0
;
}
int
tdListAppend
(
SList
*
list
,
void
*
data
)
{
SListNode
*
node
=
(
SListNode
*
)
malloc
(
sizeof
(
SListNode
)
+
list
->
eleSize
);
if
(
node
==
NULL
)
return
-
1
;
if
(
list
->
head
==
NULL
)
{
list
->
head
=
node
;
list
->
tail
=
node
;
}
else
{
node
->
prev
=
list
->
tail
;
node
->
next
=
NULL
;
list
->
tail
->
next
=
node
;
list
->
tail
=
node
;
}
list
->
numOfEles
++
;
return
0
;
}
SListNode
*
tdListPopHead
(
SList
*
list
)
{
if
(
list
->
head
==
NULL
)
return
NULL
;
SListNode
*
node
=
list
->
head
;
if
(
node
->
next
==
NULL
)
{
list
->
head
=
NULL
;
list
->
tail
=
NULL
;
}
else
{
list
->
head
=
node
->
next
;
}
list
->
numOfEles
--
;
return
node
;
}
SListNode
*
tdListPopTail
(
SList
*
list
)
{
if
(
list
->
tail
==
NULL
)
return
NULL
;
SListNode
*
node
=
list
->
tail
;
if
(
node
->
prev
==
NULL
)
{
list
->
head
=
NULL
;
list
->
tail
=
NULL
;
}
else
{
list
->
tail
=
node
->
prev
;
}
list
->
numOfEles
--
;
return
node
;
}
SListNode
*
tdListPopNode
(
SList
*
list
,
SListNode
*
node
)
{
if
(
list
->
head
==
node
)
{
list
->
head
=
node
->
next
;
}
if
(
list
->
tail
==
node
)
{
list
->
tail
=
node
->
prev
;
}
if
(
node
->
prev
!=
NULL
)
{
node
->
prev
->
next
=
node
->
next
;
}
if
(
node
->
next
!=
NULL
)
{
node
->
next
->
prev
=
node
->
prev
;
}
list
->
numOfEles
--
;
return
node
;
}
void
tdListNodeGetData
(
SList
*
list
,
SListNode
*
node
,
void
*
target
)
{
memcpy
(
node
->
data
,
target
,
list
->
eleSize
);
}
\ No newline at end of file
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录