Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
taosdata
TDengine
提交
7da7390d
T
TDengine
项目概览
taosdata
/
TDengine
大约 2 年 前同步成功
通知
1192
Star
22018
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看板
提交
7da7390d
编写于
12月 21, 2021
作者:
A
Alex Duan
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[TS-445] offset think about memory data
上级
07ce9aa3
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
59 addition
and
32 deletion
+59
-32
src/tsdb/src/tsdbRead.c
src/tsdb/src/tsdbRead.c
+59
-32
未找到文件。
src/tsdb/src/tsdbRead.c
浏览文件 @
7da7390d
...
@@ -1077,7 +1077,7 @@ int32_t memMoveByArray(SBlock *blocks, SArray *pArray) {
...
@@ -1077,7 +1077,7 @@ int32_t memMoveByArray(SBlock *blocks, SArray *pArray) {
int32_t
*
idxs
=
(
int32_t
*
)
TARRAY_GET_START
(
pArray
);
int32_t
*
idxs
=
(
int32_t
*
)
TARRAY_GET_START
(
pArray
);
size_t
i
=
0
;
size_t
i
=
0
;
assert
(
count
>
0
);
assert
(
count
>
0
);
assert
(
idxs
[
0
]
>
0
);
assert
(
idxs
[
0
]
>
=
0
);
// memmove while
// memmove while
while
(
i
<
count
)
{
while
(
i
<
count
)
{
...
@@ -1117,48 +1117,65 @@ int32_t memMoveByArray(SBlock *blocks, SArray *pArray) {
...
@@ -1117,48 +1117,65 @@ int32_t memMoveByArray(SBlock *blocks, SArray *pArray) {
break
;
break
;
}
}
return
i
+
1
;
return
i
;
}
}
// if block data in memory return false else true
// if block data in memory return false else true
bool
blockNoItemInMem
(
STsdbQueryHandle
*
q
,
SBlock
*
pBlock
)
{
bool
blockNoItemInMem
(
STsdbQueryHandle
*
q
,
SBlock
*
pBlock
)
{
// mem->first
TSKEY
key
;
TSKEY
key
=
q
->
pMemRef
->
snapshot
.
mem
->
keyFirst
;
if
(
q
->
pMemRef
==
NULL
)
{
return
false
;
}
// mem
if
(
q
->
pMemRef
->
snapshot
.
mem
)
{
// first
key
=
q
->
pMemRef
->
snapshot
.
mem
->
keyFirst
;
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
return
false
;
return
false
;
}
}
// mem->
last
//
last
key
=
q
->
pMemRef
->
snapshot
.
mem
->
keyLast
;
key
=
q
->
pMemRef
->
snapshot
.
mem
->
keyLast
;
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
return
false
;
return
false
;
}
}
// imem->first
}
// imem
if
(
q
->
pMemRef
->
snapshot
.
imem
)
{
// first
key
=
q
->
pMemRef
->
snapshot
.
imem
->
keyFirst
;
key
=
q
->
pMemRef
->
snapshot
.
imem
->
keyFirst
;
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
return
false
;
return
false
;
}
}
// imem->
last
//
last
key
=
q
->
pMemRef
->
snapshot
.
imem
->
keyLast
;
key
=
q
->
pMemRef
->
snapshot
.
imem
->
keyLast
;
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
if
(
key
>=
pBlock
->
keyFirst
&&
key
<=
pBlock
->
keyLast
)
{
return
false
;
return
false
;
}
}
}
return
true
;
return
true
;
}
}
// skip blocks . return value is skip blocks number, skip rows reduce from *pOffset
// skip blocks . return value is skip blocks number, skip rows reduce from *pOffset
static
int32_t
offsetSkipBlock
(
STsdbQueryHandle
*
q
,
SBlockInfo
*
pBlockInfo
,
uint32_t
numBlocks
,
static
int32_t
offsetSkipBlock
(
STsdbQueryHandle
*
q
,
SBlockInfo
*
pBlockInfo
,
int64_t
skey
,
int64_t
ekey
,
int
64_t
s
,
int64_t
e
,
SArray
**
ppArray
)
{
int
32_t
sblock
,
int32_t
eblock
,
SArray
**
ppArray
)
{
int32_t
num
=
0
;
int32_t
num
=
0
;
SBlock
*
blocks
=
pBlockInfo
->
blocks
;
SBlock
*
blocks
=
pBlockInfo
->
blocks
;
SArray
*
pArray
=
NULL
;
SArray
*
pArray
=
NULL
;
// ASC
// ASC
if
(
ASCENDING_TRAVERSE
(
q
->
order
))
{
if
(
ASCENDING_TRAVERSE
(
q
->
order
))
{
for
(
int32_t
i
=
0
;
i
<
numBlocks
;
i
++
)
{
for
(
int32_t
i
=
0
;
i
<=
eblock
;
i
++
)
{
// in block index range
if
(
i
<
sblock
)
{
continue
;
}
bool
skip
=
false
;
bool
skip
=
false
;
SBlock
*
pBlock
=
&
blocks
[
i
];
SBlock
*
pBlock
=
&
blocks
[
i
];
if
(
i
==
0
&&
pBlock
->
keyFirst
!=
s
)
{
if
(
i
==
sblock
&&
skey
>
pBlock
->
keyFirst
)
{
q
->
frows
+=
pBlock
->
numOfRows
;
// some rows time < s
q
->
frows
+=
pBlock
->
numOfRows
;
// some rows time < s
}
else
{
}
else
{
// check can skip
// check can skip
...
@@ -1175,7 +1192,7 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
...
@@ -1175,7 +1192,7 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
pArray
=
taosArrayInit
(
2
,
sizeof
(
int32_t
));
pArray
=
taosArrayInit
(
2
,
sizeof
(
int32_t
));
taosArrayPush
(
pArray
,
&
i
);
taosArrayPush
(
pArray
,
&
i
);
//the remainder be put to pArray
//the remainder be put to pArray
int32_t
numRemain
=
numBlocks
-
(
i
+
1
)
;
int32_t
numRemain
=
eblock
-
i
;
if
(
numRemain
>
0
)
{
if
(
numRemain
>
0
)
{
numRemain
*=
-
1
;
//if list end element is negative, that is number for the remainder
numRemain
*=
-
1
;
//if list end element is negative, that is number for the remainder
taosArrayPush
(
pArray
,
&
numRemain
);
taosArrayPush
(
pArray
,
&
numRemain
);
...
@@ -1194,10 +1211,15 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
...
@@ -1194,10 +1211,15 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
}
}
}
}
}
else
{
// DES
}
else
{
// DES
for
(
int32_t
i
=
numBlocks
-
1
;
i
>=
0
;
i
--
)
{
for
(
int32_t
i
=
eblock
;
i
>=
0
;
i
--
)
{
// in block index range
if
(
i
<
sblock
)
{
break
;
}
bool
skip
=
false
;
bool
skip
=
false
;
SBlock
*
pBlock
=
&
blocks
[
i
];
SBlock
*
pBlock
=
&
blocks
[
i
];
if
(
i
==
numBlocks
-
1
&&
pBlock
->
keyLast
!=
e
)
{
if
(
i
==
eblock
&&
ekey
<
pBlock
->
keyLast
)
{
q
->
frows
+=
pBlock
->
numOfRows
;
// some rows time > e
q
->
frows
+=
pBlock
->
numOfRows
;
// some rows time > e
}
else
{
}
else
{
// check can skip
// check can skip
...
@@ -1214,7 +1236,7 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
...
@@ -1214,7 +1236,7 @@ static int32_t offsetSkipBlock(STsdbQueryHandle* q, SBlockInfo* pBlockInfo, uint
pArray
=
taosArrayInit
(
2
,
sizeof
(
int32_t
));
pArray
=
taosArrayInit
(
2
,
sizeof
(
int32_t
));
taosArrayPush
(
pArray
,
&
i
);
taosArrayPush
(
pArray
,
&
i
);
//the remainder be put to pArray
//the remainder be put to pArray
int32_t
numRemain
=
i
;
int32_t
numRemain
=
i
-
sblock
;
if
(
numRemain
>
0
)
{
if
(
numRemain
>
0
)
{
numRemain
*=
-
1
;
//if list end element is negative, that is number for the remainder
numRemain
*=
-
1
;
//if list end element is negative, that is number for the remainder
taosArrayPush
(
pArray
,
&
numRemain
);
taosArrayPush
(
pArray
,
&
numRemain
);
...
@@ -1263,23 +1285,28 @@ static void shrinkBlocksByQuery(STsdbQueryHandle *pQueryHandle, STableCheckInfo
...
@@ -1263,23 +1285,28 @@ static void shrinkBlocksByQuery(STsdbQueryHandle *pQueryHandle, STableCheckInfo
}
}
int32_t
end
=
start
;
int32_t
end
=
start
;
// todo speedup the procedure of located end block
// locate e index of blocks -> end
while
(
end
<
(
int32_t
)
compIndex
->
numOfBlocks
&&
(
pCompInfo
->
blocks
[
end
].
keyFirst
<=
e
))
{
while
(
end
<
(
int32_t
)
compIndex
->
numOfBlocks
)
{
if
(
pCompInfo
->
blocks
[
end
].
keyFirst
<=
e
)
{
end
+=
1
;
end
+=
1
;
}
else
{
end
-=
1
;
break
;
}
}
}
// calc offset can skip blocks number
// calc offset can skip blocks number
int32_t
nSkip
=
0
;
int32_t
nSkip
=
0
;
SArray
*
pArray
=
NULL
;
SArray
*
pArray
=
NULL
;
if
(
pQueryHandle
->
offset
>
0
)
{
if
(
pQueryHandle
->
offset
>
0
)
{
nSkip
=
offsetSkipBlock
(
pQueryHandle
,
pCompInfo
,
compIndex
->
numOfBlocks
,
s
,
e
,
&
pArray
);
nSkip
=
offsetSkipBlock
(
pQueryHandle
,
pCompInfo
,
s
,
e
,
start
,
end
,
&
pArray
);
}
}
if
(
nSkip
>
0
)
{
// have offset and can skip
if
(
nSkip
>
0
)
{
// have offset and can skip
assert
(
pArray
);
assert
(
pArray
);
pCheckInfo
->
numOfBlocks
=
memMoveByArray
(
pCompInfo
->
blocks
,
pArray
);
pCheckInfo
->
numOfBlocks
=
memMoveByArray
(
pCompInfo
->
blocks
,
pArray
);
}
else
{
// no offset
}
else
{
// no offset
pCheckInfo
->
numOfBlocks
=
end
-
start
;
pCheckInfo
->
numOfBlocks
=
end
-
start
+
1
;
if
(
start
>
0
)
if
(
start
>
0
)
memmove
(
pCompInfo
->
blocks
,
&
pCompInfo
->
blocks
[
start
],
pCheckInfo
->
numOfBlocks
*
sizeof
(
SBlock
));
memmove
(
pCompInfo
->
blocks
,
&
pCompInfo
->
blocks
[
start
],
pCheckInfo
->
numOfBlocks
*
sizeof
(
SBlock
));
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录