• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

taosdata / TDengine / #3655

14 Mar 2025 08:10AM UTC coverage: 59.532% (+22.6%) from 36.951%
#3655

push

travis-ci

web-flow
feat(keep): support keep on super table level. (#30097)

* Feat: support use keep while create super table.

* Test(keep): add test for create super table with keep option.

* Feat(keep): Add tmsg for create keep.

* Feat(keep): support alter table option keep.

* Fix(keep): Add baisc test for alter table option.

* Fix(keep): memory leek.

* Feat(keep): add keep to metaEntry&metaCache and fix earliestTs with stn keep.

* Test(keep): add some cases for select with stb keep.

* Fix: fix ci core while alter stb.

* Feat(keep): delete expired data in super table level.

* Feat: remove get stb keep while query.

* Fix : build error.

* Revert "Fix : build error."

This reverts commit 0ed66e4e8.

* Revert "Feat(keep): delete expired data in super table level."

This reverts commit 36330f6b4.

* Fix : build errors.

* Feat : support restart taosd.

* Fix : alter table comment problems.

* Test : add tests for super table keep.

* Fix: change sdb stb reserve size.

* Test: add more tests.

* Feat: Disable normal tables and sub tables from setting the keep parameter

* Fix: add more checks to avoid unknown address.

* Docs: Add docs for stable keep.

* Fix: some review changes.

* Fix: review errors.

139898 of 302527 branches covered (46.24%)

Branch coverage included in aggregate %.

71 of 99 new or added lines in 12 files covered. (71.72%)

2746 existing lines in 57 files now uncovered.

220499 of 302857 relevant lines covered (72.81%)

5509252.7 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

74.79
/source/dnode/vnode/src/tsdb/tsdbMergeTree.c
1
/*
2
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
3
 *
4
 * This program is free software: you can use, redistribute, and/or modify
5
 * it under the terms of the GNU Affero General Public License, version 3
6
 * or later ("AGPL"), as published by the Free Software Foundation.
7
 *
8
 * This program is distributed in the hope that it will be useful, but WITHOUT
9
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10
 * FITNESS FOR A PARTICULAR PURPOSE.
11
 *
12
 * You should have received a copy of the GNU Affero General Public License
13
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
14
 */
15

16
#include "tsdb.h"
17
#include "tsdbFSet2.h"
18
#include "tsdbMerge.h"
19
#include "tsdbReadUtil.h"
20
#include "tsdbSttFileRW.h"
21
#include "tsdbUtil2.h"
22

23
static void tLDataIterClose2(SLDataIter *pIter);
24

25
// SLDataIter =================================================
26
int32_t tCreateSttBlockLoadInfo(STSchema *pSchema, int16_t *colList, int32_t numOfCols, SSttBlockLoadInfo **pInfo) {
1,596,862✔
27
  *pInfo = NULL;
1,596,862✔
28

29
  SSttBlockLoadInfo *pLoadInfo = taosMemoryCalloc(1, sizeof(SSttBlockLoadInfo));
1,596,862!
30
  if (pLoadInfo == NULL) {
1,598,704!
31
    return terrno;
×
32
  }
33

34
  pLoadInfo->blockData[0].sttBlockIndex = -1;
1,598,704✔
35
  pLoadInfo->blockData[1].sttBlockIndex = -1;
1,598,704✔
36

37
  pLoadInfo->currentLoadBlockIndex = 1;
1,598,704✔
38

39
  int32_t code = tBlockDataCreate(&pLoadInfo->blockData[0].data);
1,598,704✔
40
  if (code) {
1,598,271!
41
    taosMemoryFreeClear(pLoadInfo);
×
42
    return code;
×
43
  }
44

45
  code = tBlockDataCreate(&pLoadInfo->blockData[1].data);
1,598,271✔
46
  if (code) {
1,598,276!
47
    taosMemoryFreeClear(pLoadInfo);
×
48
    return code;
×
49
  }
50

51
  pLoadInfo->aSttBlk = taosArrayInit(4, sizeof(SSttBlk));
1,598,276✔
52
  if (pLoadInfo->aSttBlk == NULL) {
1,598,771✔
53
    taosMemoryFreeClear(pLoadInfo);
131!
54
    return terrno;
131✔
55
  }
56

57
  pLoadInfo->pSchema = pSchema;
1,598,640✔
58
  pLoadInfo->colIds = colList;
1,598,640✔
59
  pLoadInfo->numOfCols = numOfCols;
1,598,640✔
60

61
  *pInfo = pLoadInfo;
1,598,640✔
62
  return code;
1,598,640✔
63
}
64

65
static void freeItem(void *pValue) {
28,139,696✔
66
  SValue *p = (SValue *)pValue;
28,139,696✔
67
  if (IS_VAR_DATA_TYPE(p->type)) {
28,139,696!
68
    taosMemoryFree(p->pData);
×
69
  }
70
}
28,148,364✔
71

72
void destroySttBlockLoadInfo(SSttBlockLoadInfo *pLoadInfo) {
1,599,250✔
73
  if (pLoadInfo == NULL) {
1,599,250!
74
    return;
×
75
  }
76

77
  pLoadInfo->currentLoadBlockIndex = 1;
1,599,250✔
78

79
  SBlockDataInfo *pInfo = &pLoadInfo->blockData[0];
1,599,250✔
80
  tBlockDataDestroy(&pInfo->data);
1,599,250✔
81
  pInfo->sttBlockIndex = -1;
1,599,224✔
82
  pInfo->pin = false;
1,599,224✔
83

84
  pInfo = &pLoadInfo->blockData[1];
1,599,224✔
85
  tBlockDataDestroy(&pInfo->data);
1,599,224✔
86
  pInfo->sttBlockIndex = -1;
1,599,201✔
87
  pInfo->pin = false;
1,599,201✔
88

89
  taosArrayDestroy(pLoadInfo->info.pUid);
1,599,201✔
90
  taosArrayDestroyEx(pLoadInfo->info.pFirstKey, freeItem);
1,599,224✔
91
  taosArrayDestroyEx(pLoadInfo->info.pLastKey, freeItem);
1,599,127✔
92
  taosArrayDestroy(pLoadInfo->info.pCount);
1,599,154✔
93
  taosArrayDestroy(pLoadInfo->info.pFirstTs);
1,599,101✔
94
  taosArrayDestroy(pLoadInfo->info.pLastTs);
1,599,045✔
95

96
  pLoadInfo->info.pUid = NULL;
1,599,185✔
97
  pLoadInfo->info.pFirstKey = NULL;
1,599,185✔
98
  pLoadInfo->info.pLastKey = NULL;
1,599,185✔
99
  pLoadInfo->info.pCount = NULL;
1,599,185✔
100
  pLoadInfo->info.pFirstTs = NULL;
1,599,185✔
101
  pLoadInfo->info.pLastTs = NULL;
1,599,185✔
102

103
  taosArrayDestroy(pLoadInfo->aSttBlk);
1,599,185✔
104
  taosMemoryFree(pLoadInfo);
1,599,227!
105
}
106

107
void destroyLDataIter(SLDataIter *pIter) {
1,597,877✔
108
  tLDataIterClose2(pIter);
1,597,877✔
109
  destroySttBlockLoadInfo(pIter->pBlockLoadInfo);
1,599,320✔
110
  taosMemoryFree(pIter);
1,599,189!
111
}
1,599,353✔
112

113
void destroySttBlockReader(SArray *pLDataIterArray, SSttBlockLoadCostInfo *pLoadCost) {
2,819,248✔
114
  if (pLDataIterArray == NULL) {
2,819,248✔
115
    return;
55,178✔
116
  }
117

118
  int32_t numOfLevel = taosArrayGetSize(pLDataIterArray);
2,764,070✔
119
  for (int32_t i = 0; i < numOfLevel; ++i) {
4,363,564✔
120
    SArray *pList = taosArrayGetP(pLDataIterArray, i);
1,597,115✔
121
    for (int32_t j = 0; j < taosArrayGetSize(pList); ++j) {
3,196,649✔
122
      SLDataIter *pIter = taosArrayGetP(pList, j);
1,597,897✔
123
      if (pIter->pBlockLoadInfo != NULL) {
1,597,778!
124
        SSttBlockLoadCostInfo *pCost = &pIter->pBlockLoadInfo->cost;
1,597,826✔
125
        if (pLoadCost != NULL) {
1,597,826!
126
          pLoadCost->loadBlocks += pCost->loadBlocks;
1,597,849✔
127
          pLoadCost->loadStatisBlocks += pCost->loadStatisBlocks;
1,597,849✔
128
          pLoadCost->blockElapsedTime += pCost->blockElapsedTime;
1,597,849✔
129
          pLoadCost->statisElapsedTime += pCost->statisElapsedTime;
1,597,849✔
130
        }
131
      }
132

133
      destroyLDataIter(pIter);
1,597,778✔
134
    }
135

136
    taosArrayDestroy(pList);
1,597,645✔
137
  }
138

139
  taosArrayDestroy(pLDataIterArray);
2,766,449✔
140
}
141

142
// choose the unpinned slot to load next data block
143
static void updateBlockLoadSlot(SSttBlockLoadInfo *pLoadInfo) {
1,068,276✔
144
  int32_t nextSlotIndex = pLoadInfo->currentLoadBlockIndex ^ 1;
1,068,276✔
145
  if (pLoadInfo->blockData[nextSlotIndex].pin) {
1,068,276!
146
    nextSlotIndex = nextSlotIndex ^ 1;
×
147
  }
148

149
  pLoadInfo->currentLoadBlockIndex = nextSlotIndex;
1,068,276✔
150
}
1,068,276✔
151

152
static int32_t loadLastBlock(SLDataIter *pIter, const char *idStr, SBlockData **pResBlock) {
599,460,354✔
153
  if (pResBlock != NULL) {
599,460,354!
154
    *pResBlock = NULL;
599,857,974✔
155
  }
156

157
  int32_t            code = 0;
599,460,354✔
158
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
599,460,354✔
159

160
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
599,460,354✔
161
    if (pInfo->currentLoadBlockIndex != 0) {
334,007,898✔
162
      tsdbDebug("current load index is set to 0, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
407✔
163
                ", load data, %s",
164
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
165
      pInfo->currentLoadBlockIndex = 0;
407✔
166
    }
167

168
    *pResBlock = &pInfo->blockData[0].data;
334,007,898✔
169
    return code;
334,007,898✔
170
  }
171

172
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
265,452,456!
173
    if (pInfo->currentLoadBlockIndex != 1) {
285,872,074✔
174
      tsdbDebug("current load index is set to 1, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
414✔
175
                ", load data, %s",
176
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
177
      pInfo->currentLoadBlockIndex = 1;
414✔
178
    }
179

180
    *pResBlock = &pInfo->blockData[1].data;
285,872,074✔
181
    return code;
285,872,074✔
182
  }
183

UNCOV
184
  if (pIter->pSttBlk == NULL || pInfo->pSchema == NULL) {
×
185
    return code;
×
186
  }
187

188
  updateBlockLoadSlot(pInfo);
1,068,467✔
189
  int64_t st = taosGetTimestampUs();
1,069,199✔
190

191
  SBlockData *pBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
1,069,199✔
192
  code = tsdbSttFileReadBlockDataByColumn(pIter->pReader, pIter->pSttBlk, pBlock, pInfo->pSchema, &pInfo->colIds[1],
1,069,199✔
193
                                          pInfo->numOfCols - 1);
1,069,199✔
194
  if (code != TSDB_CODE_SUCCESS) {
1,069,482!
195
    return code;
×
196
  }
197

198
  double el = (taosGetTimestampUs() - st) / 1000.0;
1,069,559✔
199
  pInfo->cost.blockElapsedTime += el;
1,069,559✔
200
  pInfo->cost.loadBlocks += 1;
1,069,559✔
201

202
  tsdbDebug("read stt block, total load:%" PRId64 ", trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
1,069,559✔
203
            ", last block index:%d, entry:%d, rows:%d, uidRange:%" PRId64 "-%" PRId64 " tsRange:%" PRId64 "-%" PRId64
204
            " %p, elapsed time:%.2f ms, %s",
205
            pInfo->cost.loadBlocks, pIter->uid, pIter->cid, pIter->iSttBlk, pInfo->currentLoadBlockIndex, pBlock->nRow,
206
            pIter->pSttBlk->minUid, pIter->pSttBlk->maxUid, pIter->pSttBlk->minKey, pIter->pSttBlk->maxKey, pBlock, el,
207
            idStr);
208

209
  pInfo->blockData[pInfo->currentLoadBlockIndex].sttBlockIndex = pIter->iSttBlk;
1,069,694✔
210
  pIter->iRow = (pIter->backward) ? pInfo->blockData[pInfo->currentLoadBlockIndex].data.nRow : -1;
1,069,694✔
211

212
  tsdbDebug("last block index list:%d, %d, rowIndex:%d %s", pInfo->blockData[0].sttBlockIndex,
1,069,694✔
213
            pInfo->blockData[1].sttBlockIndex, pIter->iRow, idStr);
214

215
  *pResBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
1,069,647✔
216
  return code;
1,069,647✔
217
}
218

219
// find the earliest block that contains the required records
220
static FORCE_INLINE int32_t findEarliestIndex(int32_t index, uint64_t uid, const SSttBlk *pBlockList, int32_t num,
221
                                              int32_t backward) {
222
  int32_t i = index;
1,400,821✔
223
  int32_t step = backward ? 1 : -1;
1,400,821✔
224
  while (i >= 0 && i < num && uid >= pBlockList[i].minUid && uid <= pBlockList[i].maxUid) {
2,836,497!
225
    i += step;
1,435,676✔
226
  }
227
  return i - step;
1,400,821✔
228
}
229

230
static int32_t binarySearchForStartBlock(SSttBlk *pBlockList, int32_t num, uint64_t uid, int32_t backward) {
2,321,253✔
231
  int32_t midPos = -1;
2,321,253✔
232
  if (num <= 0) {
2,321,253✔
233
    return -1;
383,895✔
234
  }
235

236
  int32_t firstPos = 0;
1,937,358✔
237
  int32_t lastPos = num - 1;
1,937,358✔
238

239
  // find the first position which is bigger than the key
240
  if ((uid > pBlockList[lastPos].maxUid) || (uid < pBlockList[firstPos].minUid)) {
1,937,358✔
241
    return -1;
536,357✔
242
  }
243

244
  while (1) {
227,975✔
245
    if (uid >= pBlockList[firstPos].minUid && uid <= pBlockList[firstPos].maxUid) {
1,628,976✔
246
      return findEarliestIndex(firstPos, uid, pBlockList, num, backward);
1,317,075✔
247
    }
248

249
    if (uid > pBlockList[lastPos].maxUid || uid < pBlockList[firstPos].minUid) {
311,901!
250
      return -1;
180✔
251
    }
252

253
    int32_t numOfRows = lastPos - firstPos + 1;
311,721✔
254
    midPos = (numOfRows >> 1u) + firstPos;
311,721✔
255

256
    if (uid < pBlockList[midPos].minUid) {
311,721✔
257
      lastPos = midPos - 1;
107,312✔
258
    } else if (uid > pBlockList[midPos].maxUid) {
204,409✔
259
      firstPos = midPos + 1;
120,663✔
260
    } else {
261
      return findEarliestIndex(midPos, uid, pBlockList, num, backward);
83,746✔
262
    }
263
  }
264
}
265

266
static FORCE_INLINE int32_t findEarliestRow(int32_t index, uint64_t uid, const uint64_t *uidList, int32_t num,
267
                                            int32_t backward) {
268
  int32_t i = index;
1,415,232✔
269
  int32_t step = backward ? 1 : -1;
1,415,232✔
270
  while (i >= 0 && i < num && uid == uidList[i]) {
53,433,990!
271
    i += step;
52,018,758✔
272
  }
273
  return i - step;
1,415,232✔
274
}
275

276
static int32_t binarySearchForStartRowIndex(uint64_t *uidList, int32_t num, uint64_t uid, int32_t backward) {
1,434,061✔
277
  int32_t firstPos = 0;
1,434,061✔
278
  int32_t lastPos = num - 1;
1,434,061✔
279

280
  // find the first position which is bigger than the key
281
  if ((uid > uidList[lastPos]) || (uid < uidList[firstPos])) {
1,434,061!
282
    return -1;
×
283
  }
284

285
  while (1) {
862,872✔
286
    if (uid == uidList[firstPos]) {
2,296,933✔
287
      return findEarliestRow(firstPos, uid, uidList, num, backward);
996,518✔
288
    }
289

290
    if (uid > uidList[lastPos] || uid < uidList[firstPos]) {
1,300,415✔
291
      return -1;
18,829✔
292
    }
293

294
    int32_t numOfRows = lastPos - firstPos + 1;
1,281,586✔
295
    int32_t midPos = (numOfRows >> 1u) + firstPos;
1,281,586✔
296

297
    if (uid < uidList[midPos]) {
1,281,586✔
298
      lastPos = midPos - 1;
298,493✔
299
    } else if (uid > uidList[midPos]) {
983,093✔
300
      firstPos = midPos + 1;
564,379✔
301
    } else {
302
      return findEarliestRow(midPos, uid, uidList, num, backward);
418,714✔
303
    }
304
  }
305
}
306

307
static int32_t extractSttBlockInfo(SLDataIter *pIter, const TSttBlkArray *pArray, SSttBlockLoadInfo *pBlockLoadInfo,
1,597,773✔
308
                                   uint64_t suid) {
309
  void   *px = NULL;
1,597,773✔
310
  int32_t code = TSDB_CODE_SUCCESS;
1,597,773✔
311
  if (TARRAY2_SIZE(pArray) <= 0) {
1,597,773✔
312
    return code;
56✔
313
  }
314

315
  SSttBlk *pStart = &pArray->data[0];
1,597,717✔
316
  SSttBlk *pEnd = &pArray->data[TARRAY2_SIZE(pArray) - 1];
1,597,717✔
317

318
  // all identical
319
  if (pStart->suid == pEnd->suid) {
1,597,717✔
320
    if (pStart->suid != suid) {  // no qualified stt block existed
1,423,971✔
321
      taosArrayClear(pBlockLoadInfo->aSttBlk);
362,615✔
322
      pIter->iSttBlk = -1;
362,564✔
323
      return TSDB_CODE_SUCCESS;
362,564✔
324
    } else {  // all blocks are qualified
325
      taosArrayClear(pBlockLoadInfo->aSttBlk);
1,061,356✔
326
      px = taosArrayAddBatch(pBlockLoadInfo->aSttBlk, pArray->data, pArray->size);
1,061,292✔
327
      if (px == NULL) {
1,060,655!
328
        return terrno;
×
329
      }
330
    }
331
  } else {
332
    SArray *pTmp = taosArrayInit(TARRAY2_SIZE(pArray), sizeof(SSttBlk));
173,746✔
333
    if (pTmp == NULL) {
174,545!
334
      return terrno;
×
335
    }
336

337
    for (int32_t i = 0; i < TARRAY2_SIZE(pArray); ++i) {
825,745✔
338
      SSttBlk *p = &pArray->data[i];
707,109✔
339
      if (p->suid < suid) {
707,109✔
340
        continue;
439,888✔
341
      }
342

343
      if (p->suid == suid) {
267,221✔
344
        void *px = taosArrayPush(pTmp, p);
211,316✔
345
        if (px == NULL) {
211,316!
346
          code = terrno;
×
347
          break;
×
348
        }
349
      } else if (p->suid > suid) {
55,892!
350
        break;
55,901✔
351
      }
352
    }
353

354
    taosArrayDestroy(pBlockLoadInfo->aSttBlk);
174,537✔
355
    pBlockLoadInfo->aSttBlk = pTmp;
174,553✔
356
  }
357

358
  return code;
1,235,208✔
359
}
360

361
static int32_t tValueDupPayload(SValue *pVal) {
×
362
  if (IS_VAR_DATA_TYPE(pVal->type)) {
×
363
    char *p = (char *)pVal->pData;
×
364
    char *pBuf = taosMemoryMalloc(pVal->nData);
×
365
    if (pBuf == NULL) {
×
366
      return terrno;
×
367
    }
368

369
    memcpy(pBuf, p, pVal->nData);
×
370
    pVal->pData = (uint8_t *)pBuf;
×
371
  }
372

373
  return TSDB_CODE_SUCCESS;
×
374
}
375

376
static int32_t loadSttStatisticsBlockData(SSttFileReader *pSttFileReader, SSttBlockLoadInfo *pBlockLoadInfo,
1,596,936✔
377
                                          TStatisBlkArray *pStatisBlkArray, uint64_t suid, const char *id) {
378
  int32_t code = TSDB_CODE_SUCCESS;
1,596,936✔
379
  int32_t lino = 0;
1,596,936✔
380
  void   *px = NULL;
1,596,936✔
381
  int32_t startIndex = 0;
1,596,936✔
382
  int32_t ret = 0;
1,596,936✔
383

384
  int32_t numOfBlocks = TARRAY2_SIZE(pStatisBlkArray);
1,596,936✔
385
  if (numOfBlocks <= 0) {
1,596,936✔
386
    return code;
56✔
387
  }
388

389
  while ((startIndex < numOfBlocks) && (pStatisBlkArray->data[startIndex].maxTbid.suid < suid)) {
1,603,306✔
390
    ++startIndex;
6,426✔
391
  }
392

393
  if (startIndex >= numOfBlocks || pStatisBlkArray->data[startIndex].minTbid.suid > suid) {
1,596,880✔
394
    return 0;
363,094✔
395
  }
396

397
  int32_t endIndex = startIndex;
1,233,786✔
398
  while (endIndex < numOfBlocks && pStatisBlkArray->data[endIndex].minTbid.suid <= suid) {
2,470,394!
399
    ++endIndex;
1,236,608✔
400
  }
401

402
  int32_t num = endIndex - startIndex;
1,233,786✔
403
  pBlockLoadInfo->cost.loadStatisBlocks += num;
1,233,786✔
404

405
  STbStatisBlock block;
406
  code = tStatisBlockInit(&block);
1,233,786✔
407
  QUERY_CHECK_CODE(code, lino, _end);
1,233,865!
408

409
  int64_t st = taosGetTimestampUs();
1,233,929✔
410

411
  for (int32_t k = startIndex; k < endIndex; ++k) {
2,446,336✔
412
    code = tsdbSttFileReadStatisBlock(pSttFileReader, &pStatisBlkArray->data[k], &block);
1,235,470✔
413
    QUERY_CHECK_CODE(code, lino, _end);
1,236,479!
414

415
    int32_t i = 0;
1,236,479✔
416
    int32_t rows = block.numOfRecords;
1,236,479✔
417
    while (i < rows && ((int64_t *)block.suids.data)[i] != suid) {
1,668,276✔
418
      ++i;
431,797✔
419
    }
420

421
    // existed
422
    if (i < rows) {
1,236,479✔
423
      SSttTableRowsInfo *pInfo = &pBlockLoadInfo->info;
1,235,357✔
424

425
      if (pInfo->pUid == NULL) {
1,235,357✔
426
        pInfo->pUid = taosArrayInit(rows, sizeof(int64_t));
1,232,757✔
427
        pInfo->pFirstTs = taosArrayInit(rows, sizeof(int64_t));
1,232,895✔
428
        pInfo->pLastTs = taosArrayInit(rows, sizeof(int64_t));
1,232,965✔
429
        pInfo->pCount = taosArrayInit(rows, sizeof(int64_t));
1,232,973✔
430

431
        pInfo->pFirstKey = taosArrayInit(rows, sizeof(SValue));
1,232,963✔
432
        pInfo->pLastKey = taosArrayInit(rows, sizeof(SValue));
1,232,941✔
433

434
        if (pInfo->pUid == NULL || pInfo->pFirstTs == NULL || pInfo->pLastTs == NULL || pInfo->pCount == NULL ||
1,232,956!
435
            pInfo->pFirstKey == NULL || pInfo->pLastKey == NULL) {
1,232,968✔
436
          code = terrno;
10✔
437
          goto _end;
×
438
        }
439
      }
440

441
      if (pStatisBlkArray->data[k].maxTbid.suid == suid) {
1,235,546✔
442
        int32_t size = rows - i;
1,181,674✔
443
        int32_t offset = i * sizeof(int64_t);
1,181,674✔
444

445
        px = taosArrayAddBatch(pInfo->pUid, tBufferGetDataAt(&block.uids, offset), size);
1,181,674✔
446
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,181,593!
447

448
        px = taosArrayAddBatch(pInfo->pFirstTs, tBufferGetDataAt(&block.firstKeyTimestamps, offset), size);
1,181,593✔
449
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,181,402!
450

451
        px = taosArrayAddBatch(pInfo->pLastTs, tBufferGetDataAt(&block.lastKeyTimestamps, offset), size);
1,181,402✔
452
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,181,182!
453

454
        px = taosArrayAddBatch(pInfo->pCount, tBufferGetDataAt(&block.counts, offset), size);
1,181,182✔
455
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,181,021✔
456

457
        if (block.numOfPKs > 0) {
1,180,877!
458
          SValue vFirst = {0}, vLast = {0};
×
459
          for (int32_t f = i; f < rows; ++f) {
×
460
            code = tValueColumnGet(&block.firstKeyPKs[0], f, &vFirst);
×
461
            TSDB_CHECK_CODE(code, lino, _end);
×
462

463
            code = tValueDupPayload(&vFirst);
×
464
            TSDB_CHECK_CODE(code, lino, _end);
×
465

466
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
×
467
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
×
468

469
            // todo add api to clone the original data
470
            code = tValueColumnGet(&block.lastKeyPKs[0], f, &vLast);
×
471
            TSDB_CHECK_CODE(code, lino, _end);
×
472

473
            code = tValueDupPayload(&vLast);
×
474
            TSDB_CHECK_CODE(code, lino, _end);
×
475

476
            px = taosArrayPush(pInfo->pLastKey, &vLast);
×
477
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
×
478
          }
479
        } else {
480
          SValue vFirst = {0};
1,180,877✔
481
          for (int32_t j = 0; j < size; ++j) {
14,517,586✔
482
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
13,360,206✔
483
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
13,330,164!
484

485
            px = taosArrayPush(pInfo->pLastKey, &vFirst);
13,330,164✔
486
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
13,336,709!
487
          }
488
        }
489
      } else {
490
        STbStatisRecord record = {0};
53,872✔
491
        while (i < rows) {
197,547✔
492
          code = tStatisBlockGet(&block, i, &record);
197,536✔
493
          TSDB_CHECK_CODE(code, lino, _end);
197,463!
494

495
          if (record.suid != suid) {
197,463✔
496
            break;
53,894✔
497
          }
498

499
          px = taosArrayPush(pInfo->pUid, &record.uid);
143,569✔
500
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,635!
501

502
          px = taosArrayPush(pInfo->pCount, &record.count);
143,635✔
503
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,628!
504

505
          px = taosArrayPush(pInfo->pFirstTs, &record.firstKey.ts);
143,628✔
506
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,626!
507

508
          px = taosArrayPush(pInfo->pLastTs, &record.lastKey.ts);
143,626✔
509
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,623!
510

511
          if (record.firstKey.numOfPKs > 0) {
143,623!
512
            SValue s = record.firstKey.pks[0];
×
513
            code = tValueDupPayload(&s);
×
514
            TSDB_CHECK_CODE(code, lino, _end);
×
515

516
            px = taosArrayPush(pInfo->pFirstKey, &s);
×
517
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
×
518

519
            s = record.lastKey.pks[0];
×
520
            code = tValueDupPayload(&s);
×
521
            TSDB_CHECK_CODE(code, lino, _end);
×
522

523
            px = taosArrayPush(pInfo->pLastKey, &s);
×
524
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
×
525
          } else {
526
            SValue v = {0};
143,623✔
527
            px = taosArrayPush(pInfo->pFirstKey, &v);
143,623✔
528
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,644!
529

530
            px = taosArrayPush(pInfo->pLastKey, &v);
143,644✔
531
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
143,675!
532
          }
533

534
          i += 1;
143,675✔
535
        }
536
      }
537
    }
538
  }
539

540
_end:
1,210,866✔
541
  tStatisBlockDestroy(&block);
1,210,866✔
542
  if (code != 0) {
1,233,650!
543
    tsdbError("%s error happens at:%s line number: %d, code:%s", id, __func__, lino, tstrerror(code));
×
544
  } else {
545
    double el = (taosGetTimestampUs() - st) / 1000.0;
1,233,451✔
546
    pBlockLoadInfo->cost.statisElapsedTime += el;
1,233,451✔
547

548
    tsdbDebug("%s load %d statis blocks into buf, elapsed time:%.2fms", id, num, el);
1,233,451✔
549
  }
550
  return code;
1,233,714✔
551
}
552

553
static int32_t doLoadSttFilesBlk(SSttBlockLoadInfo *pBlockLoadInfo, SLDataIter *pIter, int64_t suid,
1,598,147✔
554
                                 _load_tomb_fn loadTombFn, void *pReader1, const char *idStr) {
555
  int64_t st = taosGetTimestampUs();
1,598,741✔
556

557
  const TSttBlkArray *pSttBlkArray = NULL;
1,598,741✔
558
  pBlockLoadInfo->sttBlockLoaded = true;
1,598,741✔
559

560
  // load the stt block info for each stt-block
561
  int32_t code = tsdbSttFileReadSttBlk(pIter->pReader, &pSttBlkArray);
1,598,741✔
562
  if (code != TSDB_CODE_SUCCESS) {
1,598,641!
563
    tsdbError("load stt blk failed, code:%s, %s", tstrerror(code), idStr);
×
564
    return code;
×
565
  }
566

567
  // load the stt block info for each stt file block
568
  code = extractSttBlockInfo(pIter, pSttBlkArray, pBlockLoadInfo, suid);
1,598,641✔
569
  if (code != TSDB_CODE_SUCCESS) {
1,597,571!
570
    tsdbError("load stt block info failed, code:%s, %s", tstrerror(code), idStr);
×
571
    return code;
×
572
  }
573

574
  // load stt statistics block for all stt-blocks, to decide if the data of queried table exists in current stt file
575
  TStatisBlkArray *pStatisBlkArray = NULL;
1,597,571✔
576
  code = tsdbSttFileReadStatisBlk(pIter->pReader, (const TStatisBlkArray **)&pStatisBlkArray);
1,597,571✔
577
  if (code != TSDB_CODE_SUCCESS) {
1,598,295!
578
    tsdbError("failed to load stt block statistics, code:%s, %s", tstrerror(code), idStr);
×
579
    return code;
×
580
  }
581

582
  // load statistics block for all tables in current stt file
583
  code = loadSttStatisticsBlockData(pIter->pReader, pIter->pBlockLoadInfo, pStatisBlkArray, suid, idStr);
1,598,295✔
584
  if (code != TSDB_CODE_SUCCESS) {
1,598,241!
585
    tsdbError("failed to load stt statistics block data, code:%s, %s", tstrerror(code), idStr);
×
586
    return code;
×
587
  }
588

589
  code = loadTombFn(pReader1, pIter->pReader, pIter->pBlockLoadInfo);
1,598,241✔
590

591
  double el = (taosGetTimestampUs() - st) / 1000.0;
1,597,997✔
592
  tsdbDebug("load the stt file blk info completed, elapsed time:%.2fms, %s", el, idStr);
1,597,997✔
593
  return code;
1,598,099✔
594
}
595

596
static int32_t uidComparFn(const void *p1, const void *p2) {
3,039,328✔
597
  const uint64_t *pFirst = p1;
3,039,328✔
598
  const uint64_t *pVal = p2;
3,039,328✔
599

600
  if (*pFirst == *pVal) {
3,039,328✔
601
    return 0;
1,384,019✔
602
  } else {
603
    return *pFirst < *pVal ? -1 : 1;
1,655,309✔
604
  }
605
}
606

607
static void setSttInfoForCurrentTable(SSttBlockLoadInfo *pLoadInfo, uint64_t uid, SSttKeyRange *pRange,
2,323,440✔
608
                                      int64_t *numOfRows) {
609
  if (pRange == NULL || taosArrayGetSize(pLoadInfo->info.pUid) == 0) {
2,323,440!
610
    return;
384,012✔
611
  }
612

613
  int32_t index = taosArraySearchIdx(pLoadInfo->info.pUid, &uid, uidComparFn, TD_EQ);
1,939,084✔
614
  if (index >= 0) {
1,938,681✔
615
    pRange->skey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pFirstTs, index);
1,383,952✔
616
    pRange->ekey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pLastTs, index);
1,383,593✔
617

618
    *numOfRows += *(int64_t *)taosArrayGet(pLoadInfo->info.pCount, index);
1,383,481✔
619

620
    if (pRange->skey.numOfPKs > 0) {
1,383,331!
621
      memcpy(&pRange->skey.pks[0], taosArrayGet(pLoadInfo->info.pFirstKey, index), sizeof(SValue));
×
622
      memcpy(&pRange->ekey.pks[0], taosArrayGet(pLoadInfo->info.pLastKey, index), sizeof(SValue));
×
623
    }
624
  }
625
}
626

627
int32_t tLDataIterOpen2(SLDataIter *pIter, SSttFileReader *pSttFileReader, int32_t cid, int8_t backward,
2,324,126✔
628
                        SMergeTreeConf *pConf, SSttBlockLoadInfo *pBlockLoadInfo, SSttKeyRange *pKeyRange,
629
                        int64_t *numOfRows, const char *idStr) {
630
  int32_t code = TSDB_CODE_SUCCESS;
2,324,126✔
631

632
  pIter->uid = pConf->uid;
2,324,126✔
633
  pIter->cid = cid;
2,324,126✔
634
  pIter->backward = backward;
2,324,126✔
635
  pIter->verRange.minVer = pConf->verRange.minVer;
2,324,126✔
636
  pIter->verRange.maxVer = pConf->verRange.maxVer;
2,324,126✔
637
  pIter->timeWindow.skey = pConf->timewindow.skey;
2,324,126✔
638
  pIter->timeWindow.ekey = pConf->timewindow.ekey;
2,324,126✔
639

640
  pIter->pStartRowKey = pConf->pCurRowKey;
2,324,126✔
641
  pIter->pReader = pSttFileReader;
2,324,126✔
642
  pIter->pBlockLoadInfo = pBlockLoadInfo;
2,324,126✔
643

644
  // open stt file failed, ignore and continue
645
  if (pIter->pReader == NULL) {
2,324,126!
646
    tsdbError("stt file reader is null, %s", idStr);
×
647
    pIter->pSttBlk = NULL;
×
648
    pIter->iSttBlk = -1;
×
649
    return TSDB_CODE_SUCCESS;
×
650
  }
651

652
  if (!pBlockLoadInfo->sttBlockLoaded) {
2,324,126✔
653
    code = doLoadSttFilesBlk(pBlockLoadInfo, pIter, pConf->suid, pConf->loadTombFn, pConf->pReader, idStr);
1,598,695✔
654
    if (code != TSDB_CODE_SUCCESS) {
1,597,963!
655
      return code;
×
656
    }
657
  }
658

659
  setSttInfoForCurrentTable(pBlockLoadInfo, pConf->uid, pKeyRange, numOfRows);
2,323,394✔
660

661
  // find the start block, actually we could load the position to avoid repeatly searching for the start position when
662
  // the skey is updated.
663
  size_t size = taosArrayGetSize(pBlockLoadInfo->aSttBlk);
2,322,187✔
664
  pIter->iSttBlk = binarySearchForStartBlock(pBlockLoadInfo->aSttBlk->pData, size, pConf->uid, backward);
2,322,222✔
665
  if (pIter->iSttBlk != -1) {
2,321,654✔
666
    pIter->pSttBlk = taosArrayGet(pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
1,402,467✔
667
    pIter->iRow = (pIter->backward) ? pIter->pSttBlk->nRow : -1;
1,402,412✔
668

669
    if ((!backward) && ((pConf->strictTimeRange && pIter->pSttBlk->minKey >= pIter->timeWindow.ekey) ||
1,402,412!
670
                        (!pConf->strictTimeRange && pIter->pSttBlk->minKey > pIter->timeWindow.ekey))) {
1,362,446!
671
      pIter->pSttBlk = NULL;
53✔
672
    }
673

674
    if (backward && ((pConf->strictTimeRange && pIter->pSttBlk->maxKey <= pIter->timeWindow.skey) ||
1,402,412!
675
                     (!pConf->strictTimeRange && pIter->pSttBlk->maxKey < pIter->timeWindow.skey))) {
39,855!
676
      pIter->pSttBlk = NULL;
381✔
677
      pIter->ignoreEarlierTs = true;
381✔
678
    }
679
  }
680

681
  return code;
2,321,599✔
682
}
683

684
void tLDataIterClose2(SLDataIter *pIter) {
1,597,790✔
685
  tsdbSttFileReaderClose(&pIter->pReader);
1,597,790✔
686
  pIter->pReader = NULL;
1,599,328✔
687
}
1,599,328✔
688

689
void tLDataIterNextBlock(SLDataIter *pIter, const char *idStr) {
1,458,598✔
690
  int32_t step = pIter->backward ? -1 : 1;
1,458,598✔
691
  int32_t oldIndex = pIter->iSttBlk;
1,458,598✔
692

693
  pIter->iSttBlk += step;
1,458,598✔
694

695
  int32_t index = -1;
1,458,598✔
696
  size_t  size = pIter->pBlockLoadInfo->aSttBlk->size;
1,458,598✔
697
  for (int32_t i = pIter->iSttBlk; i < size && i >= 0; i += step) {
1,459,680!
698
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, i);
192,507✔
699
    if ((!pIter->backward) && p->minUid > pIter->uid) {
192,499✔
700
      break;
107,634✔
701
    }
702

703
    if (pIter->backward && p->maxUid < pIter->uid) {
84,865✔
704
      break;
5,917✔
705
    }
706

707
    // check uid firstly
708
    if (p->minUid <= pIter->uid && p->maxUid >= pIter->uid) {
78,948!
709
      if ((!pIter->backward) && p->minKey > pIter->timeWindow.ekey) {
78,957✔
710
        break;
651✔
711
      }
712

713
      if (pIter->backward && p->maxKey < pIter->timeWindow.skey) {
78,306✔
714
        break;
2✔
715
      }
716

717
      // check time range secondly
718
      if (p->minKey <= pIter->timeWindow.ekey && p->maxKey >= pIter->timeWindow.skey) {
78,304✔
719
        if ((!pIter->backward) && p->minVer > pIter->verRange.maxVer) {
77,214!
720
          break;
×
721
        }
722

723
        if (pIter->backward && p->maxVer < pIter->verRange.minVer) {
77,214!
724
          break;
×
725
        }
726

727
        if (p->minVer <= pIter->verRange.maxVer && p->maxVer >= pIter->verRange.minVer) {
77,214!
728
          index = i;
77,213✔
729
          break;
77,213✔
730
        }
731
      }
732
    }
733
  }
734

735
  pIter->pSttBlk = NULL;
1,458,590✔
736
  if (index != -1) {
1,458,590✔
737
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, index);
77,212✔
738

739
    pIter->iSttBlk = index;
77,213✔
740
    pIter->pSttBlk = (SSttBlk *)taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
77,213✔
741
    tsdbDebug("try next stt-file block:%d from %d, trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
77,213✔
742
              ", uidRange:%" PRId64 "-%" PRId64 " %s",
743
              pIter->iSttBlk, oldIndex, pIter->uid, pIter->cid, p->minUid, p->maxUid, idStr);
744
  } else {
745
    tsdbDebug("no more last block qualified, uid:%" PRIu64 ", stt-file block:%d, %s", pIter->uid, oldIndex, idStr);
1,381,378✔
746
  }
747
}
1,458,595✔
748

749
static int32_t findNextValidRow(SLDataIter *pIter, const char *idStr) {
313,551,829✔
750
  bool        hasVal = false;
313,551,829✔
751
  int32_t     step = pIter->backward ? -1 : 1;
313,551,829✔
752
  int32_t     i = pIter->iRow;
313,551,829✔
753
  SBlockData *pData = NULL;
313,551,829✔
754

755
  int32_t code = loadLastBlock(pIter, idStr, &pData);
313,551,829✔
756
  if (code) {
308,056,919!
757
    tsdbError("failed to load stt block, code:%s, %s", tstrerror(code), idStr);
×
758
    return code;
×
759
  }
760

761
  // mostly we only need to find the start position for a given table
762
  if ((((i == 0) && (!pIter->backward)) || (i == pData->nRow - 1 && pIter->backward)) && pData->aUid != NULL) {
308,056,919✔
763
    i = binarySearchForStartRowIndex((uint64_t *)pData->aUid, pData->nRow, pIter->uid, pIter->backward);
1,434,124✔
764
    if (i == -1) {
1,435,089!
765
      tsdbDebug("failed to find the data in pBlockData, uid:%" PRIu64 " , %s", pIter->uid, idStr);
×
766
      pIter->iRow = -1;
18,931✔
767
      return code;
18,931✔
768
    }
769
  }
770

771
  for (; i < pData->nRow && i >= 0; i += step) {
313,319,899!
772
    if (pData->aUid != NULL) {
315,266,113✔
773
      if (!pIter->backward) {
313,712,804✔
774
        if (pData->aUid[i] > pIter->uid) {
306,681,206✔
775
          break;
415,780✔
776
        }
777
      } else {
778
        if (pData->aUid[i] < pIter->uid) {
7,031,598✔
779
          break;
28,990✔
780
        }
781
      }
782
    }
783

784
    int64_t ts = pData->aTSKEY[i];
314,821,343✔
785
    if (!pIter->backward) {               // asc
314,821,343✔
786
      if (ts > pIter->timeWindow.ekey) {  // no more data
307,410,781✔
787
        break;
4,255✔
788
      } else {
789
        if (ts < pIter->timeWindow.skey) {
307,406,526✔
790
          continue;
1,253,576✔
791
        }
792

793
        if (ts == pIter->timeWindow.skey && pIter->pStartRowKey->numOfPKs > 0) {
306,152,950!
794
          SRowKey key;
795
          tColRowGetKey(pData, i, &key);
×
796
          int32_t ret = pkCompEx(&key, pIter->pStartRowKey);
×
797
          if (ret < 0) {
×
798
            continue;
×
799
          }
800
        }
801
      }
802
    } else {
803
      if (ts < pIter->timeWindow.skey) {
7,410,562✔
804
        break;
2,445✔
805
      } else {
806
        if (ts > pIter->timeWindow.ekey) {
7,408,117✔
807
          continue;
3,294,354✔
808
        }
809

810
        if (ts == pIter->timeWindow.ekey && pIter->pStartRowKey->numOfPKs > 0) {
4,113,763!
811
          SRowKey key;
812
          tColRowGetKey(pData, i, &key);
×
813
          int32_t ret = pkCompEx(&key, pIter->pStartRowKey);
×
814
          if (ret > 0) {
×
815
            continue;
×
816
          }
817
        }
818
      }
819
    }
820

821
    int64_t ver = pData->aVersion[i];
310,266,713✔
822
    if (ver < pIter->verRange.minVer) {
310,266,713!
823
      continue;
×
824
    }
825

826
    // todo opt handle desc case
827
    if (ver > pIter->verRange.maxVer) {
310,266,713✔
828
      continue;
20✔
829
    }
830

831
    hasVal = true;
310,266,693✔
832
    break;
310,266,693✔
833
  }
834

835
  pIter->iRow = (hasVal) ? i : -1;
308,771,949!
836
  return code;
308,771,949✔
837
}
838

839
int32_t tLDataIterNextRow(SLDataIter *pIter, const char *idStr, bool *hasNext) {
314,520,396✔
840
  int32_t     step = pIter->backward ? -1 : 1;
314,520,396✔
841
  int32_t     code = 0;
314,520,396✔
842
  int32_t     iBlockL = pIter->iSttBlk;
314,520,396✔
843
  SBlockData *pBlockData = NULL;
314,520,396✔
844
  int32_t     lino = 0;
314,520,396✔
845

846
  *hasNext = false;
314,520,396✔
847

848
  // no qualified last file block in current file, no need to fetch row
849
  if (pIter->pSttBlk == NULL) {
314,520,396✔
850
    return code;
920,425✔
851
  }
852

853
  code = loadLastBlock(pIter, idStr, &pBlockData);
313,599,971✔
854
  if (pBlockData == NULL || code != TSDB_CODE_SUCCESS) {
313,715,005!
855
    lino = __LINE__;
×
856
    goto _exit;
×
857
  }
858

859
  pIter->iRow += step;
313,960,933✔
860

861
  while (1) {
76,315✔
862
    bool skipBlock = false;
314,037,248✔
863
    code = findNextValidRow(pIter, idStr);
314,037,248✔
864
    TSDB_CHECK_CODE(code, lino, _exit);
310,573,039!
865

866
    if (pIter->pBlockLoadInfo->checkRemainingRow) {
310,573,039!
867
      skipBlock = true;
×
868
      int16_t *aCols = pIter->pBlockLoadInfo->colIds;
×
869
      int      nCols = pIter->pBlockLoadInfo->numOfCols;
×
870
      bool     isLast = pIter->pBlockLoadInfo->isLast;
×
871
      for (int inputColIndex = 0; inputColIndex < nCols; ++inputColIndex) {
×
872
        for (int colIndex = 0; colIndex < pBlockData->nColData; ++colIndex) {
×
873
          SColData *pColData = &pBlockData->aColData[colIndex];
×
874
          int16_t   cid = pColData->cid;
×
875

876
          if (cid == aCols[inputColIndex]) {
×
877
            if (isLast && (pColData->flag & HAS_VALUE)) {
×
878
              skipBlock = false;
×
879
              break;
×
880
            } else if (pColData->flag & (HAS_VALUE | HAS_NULL)) {
×
881
              skipBlock = false;
×
882
              break;
×
883
            }
884
          }
885
        }
886
      }
887
    }
888

889
    if (skipBlock || pIter->iRow >= pBlockData->nRow || pIter->iRow < 0) {
310,573,039✔
890
      tLDataIterNextBlock(pIter, idStr);
1,751,861✔
891
      if (pIter->pSttBlk == NULL) {  // no more data
1,457,817✔
892
        goto _exit;
1,381,507✔
893
      }
894
    } else {
895
      break;
896
    }
897

898
    if (iBlockL != pIter->iSttBlk) {
76,310!
899
      code = loadLastBlock(pIter, idStr, &pBlockData);
77,213✔
900
      if ((pBlockData == NULL) || (code != 0)) {
77,215!
901
        lino = __LINE__;
×
902
        goto _exit;
×
903
      }
904

905
      // set start row index
906
      pIter->iRow = pIter->backward ? pBlockData->nRow - 1 : 0;
77,218✔
907
    }
908
  }
909

910
  pIter->rInfo.suid = pBlockData->suid;
308,821,178✔
911
  pIter->rInfo.uid = pBlockData->uid;
308,821,178✔
912
  pIter->rInfo.row = tsdbRowFromBlockData(pBlockData, pIter->iRow);
308,821,178✔
913

914
_exit:
309,956,754✔
915
  if (code) {
309,956,754!
916
    tsdbError("failed to exec stt-file nextIter, lino:%d, code:%s, %s", lino, tstrerror(code), idStr);
×
917
  }
918

919
  *hasNext = (code == TSDB_CODE_SUCCESS) && (pIter->pSttBlk != NULL) && (pBlockData != NULL);
310,069,730!
920
  return code;
310,069,730✔
921
}
922

923
// SMergeTree =================================================
924
static FORCE_INLINE int32_t tLDataIterCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
67,286,863✔
925
  SLDataIter *pIter1 = (SLDataIter *)(((uint8_t *)p1) - offsetof(SLDataIter, node));
67,447,061✔
926
  SLDataIter *pIter2 = (SLDataIter *)(((uint8_t *)p2) - offsetof(SLDataIter, node));
67,447,061✔
927

928
  SRowKey rkey1 = {0}, rkey2 = {0};
67,447,061✔
929
  tRowGetKeyEx(&pIter1->rInfo.row, &rkey1);
67,447,061!
930
  tRowGetKeyEx(&pIter2->rInfo.row, &rkey2);
67,712,660!
931

932
  int32_t ret = tRowKeyCompare(&rkey1, &rkey2);
67,279,768✔
933
  if (ret < 0) {
67,292,504✔
934
    return -1;
48,606,521✔
935
  } else if (ret > 0) {
18,685,983✔
936
    return 1;
7,405,576✔
937
  } else {
938
    int64_t ver1 = TSDBROW_VERSION(&pIter1->rInfo.row);
11,280,407!
939
    int64_t ver2 = TSDBROW_VERSION(&pIter2->rInfo.row);
11,280,407!
940

941
    if (ver1 < ver2) {
11,280,407✔
942
      return -1;
4,522,254✔
943
    } else if (ver1 > ver2) {
6,758,153!
944
      return 1;
7,203,367✔
945
    } else {
946
      return 0;
×
947
    }
948
  }
949
}
950

951
static FORCE_INLINE int32_t tLDataIterDescCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
160,198!
952
  return -1 * tLDataIterCmprFn(p1, p2);
160,201✔
953
}
954

955
int32_t tMergeTreeOpen2(SMergeTree *pMTree, SMergeTreeConf *pConf, SSttDataInfoForTable *pSttDataInfo) {
2,674,919✔
956
  int32_t code = TSDB_CODE_SUCCESS;
2,674,919✔
957

958
  pMTree->pIter = NULL;
2,674,919✔
959
  pMTree->backward = pConf->backward;
2,674,919✔
960
  pMTree->idStr = pConf->idstr;
2,674,919✔
961
  int32_t lino = 0;
2,674,919✔
962

963
  if (!pMTree->backward) {  // asc
2,674,919✔
964
    tRBTreeCreate(&pMTree->rbt, tLDataIterCmprFn);
2,637,259✔
965
  } else {  // desc
966
    tRBTreeCreate(&pMTree->rbt, tLDataIterDescCmprFn);
37,660✔
967
  }
968

969
  pMTree->ignoreEarlierTs = false;
2,675,695✔
970

971
  // no data exists, go to end
972
  int32_t numOfLevels = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->size;
2,675,695✔
973
  if (numOfLevels == 0) {
2,675,695✔
974
    goto _end;
520,487✔
975
  }
976

977
  code = adjustSttDataIters(pConf->pSttFileBlockIterArray, pConf->pCurrentFileset);
2,155,208✔
978
  if (code) {
2,154,478!
979
    goto _end;
×
980
  }
981

982
  for (int32_t j = 0; j < numOfLevels; ++j) {
4,457,451✔
983
    SSttLvl *pSttLevel = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->data[j];
2,303,623✔
984
    SArray  *pList = taosArrayGetP(pConf->pSttFileBlockIterArray, j);
2,303,623✔
985

986
    for (int32_t i = 0; i < TARRAY2_SIZE(pSttLevel->fobjArr); ++i) {  // open all last file
4,626,079✔
987
      SLDataIter *pIter = taosArrayGetP(pList, i);
2,323,106✔
988

989
      SSttFileReader    *pSttFileReader = pIter->pReader;
2,322,818✔
990
      SSttBlockLoadInfo *pLoadInfo = pIter->pBlockLoadInfo;
2,322,818✔
991

992
      // open stt file reader if not opened yet
993
      // if failed to open this stt file, ignore the error and try next one
994
      if (pSttFileReader == NULL) {
2,322,818✔
995
        SSttFileReaderConfig conf = {.tsdb = pConf->pTsdb, .szPage = pConf->pTsdb->pVnode->config.tsdbPageSize};
1,598,266✔
996
        conf.file[0] = *pSttLevel->fobjArr->data[i]->f;
1,598,266✔
997

998
        code = tsdbSttFileReaderOpen(pSttLevel->fobjArr->data[i]->fname, &conf, &pSttFileReader);
1,598,266✔
999
        if (code != TSDB_CODE_SUCCESS) {
1,596,947!
1000
          tsdbError("open stt file reader error. file name %s, code %s, %s", pSttLevel->fobjArr->data[i]->fname,
×
1001
                    tstrerror(code), pMTree->idStr);
1002
        }
1003
      }
1004

1005
      if (pLoadInfo == NULL) {
2,320,803✔
1006
        code = tCreateSttBlockLoadInfo(pConf->pSchema, pConf->pCols, pConf->numOfCols, &pLoadInfo);
1,596,932✔
1007
        if (code != TSDB_CODE_SUCCESS) {
1,598,641!
1008
          goto _end;
×
1009
        }
1010
      }
1011

1012
      memset(pIter, 0, sizeof(SLDataIter));
2,322,512✔
1013

1014
      SSttKeyRange range = {.skey.numOfPKs = pConf->pCurRowKey->numOfPKs, .ekey.numOfPKs = pConf->pCurRowKey->numOfPKs};
2,322,512✔
1015
      int64_t      numOfRows = 0;
2,322,512✔
1016
      int64_t      cid = pSttLevel->fobjArr->data[i]->f->cid;
2,322,512✔
1017

1018
      code = tLDataIterOpen2(pIter, pSttFileReader, cid, pMTree->backward, pConf, pLoadInfo, &range, &numOfRows,
2,322,512✔
1019
                             pMTree->idStr);
1020
      if (code != TSDB_CODE_SUCCESS) {
2,321,494!
1021
        goto _end;
×
1022
      }
1023

1024
      bool hasVal = NULL;
2,321,494✔
1025
      code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
2,321,494✔
1026
      if (code) {
2,322,553!
1027
        goto _end;
×
1028
      }
1029

1030
      if (hasVal) {
2,322,553✔
1031
        tMergeTreeAddIter(pMTree, pIter);
1,382,038✔
1032

1033
        // let's record the time window for current table of uid in the stt files
1034
        if (pSttDataInfo != NULL && numOfRows > 0) {
1,381,741!
1035
          void *px = taosArrayPush(pSttDataInfo->pKeyRangeList, &range);
1,382,035✔
1036
          QUERY_CHECK_NULL(px, code, lino, _end, terrno);
1,381,342!
1037

1038
          pSttDataInfo->numOfRows += numOfRows;
1,381,342✔
1039
        }
1040
      } else {
1041
        if (!pMTree->ignoreEarlierTs) {
940,515✔
1042
          pMTree->ignoreEarlierTs = pIter->ignoreEarlierTs;
940,260✔
1043
        }
1044
      }
1045
    }
1046
  }
1047

1048
  return code;
2,153,828✔
1049

1050
_end:
520,487✔
1051
  tMergeTreeClose(pMTree);
520,487✔
1052
  return code;
520,372✔
1053
}
1054

1055
void tMergeTreeAddIter(SMergeTree *pMTree, SLDataIter *pIter) {
1,381,902✔
1056
  SRBTreeNode *node = tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pIter);
1,381,902✔
1057
}
1,381,661✔
1058

1059
bool tMergeTreeIgnoreEarlierTs(SMergeTree *pMTree) { return pMTree->ignoreEarlierTs; }
×
1060

1061
static void tLDataIterPinSttBlock(SLDataIter *pIter, const char *id) {
261,475,961✔
1062
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
261,475,961✔
1063

1064
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
261,475,961✔
1065
    pInfo->blockData[0].pin = true;
142,736,506✔
1066
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
142,736,506✔
1067
    return;
142,776,009✔
1068
  }
1069

1070
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
118,739,455!
1071
    pInfo->blockData[1].pin = true;
123,348,012✔
1072
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
123,348,012✔
1073
    return;
123,351,060✔
1074
  }
1075

1076
  tsdbError("failed to pin any stt block, sttBlock:%d stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
×
1077
}
1078

1079
static void tLDataIterUnpinSttBlock(SLDataIter *pIter, const char *id) {
255,697,816✔
1080
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
255,697,816✔
1081
  if (pInfo->blockData[0].pin) {
255,697,816✔
1082
    pInfo->blockData[0].pin = false;
139,799,968✔
1083
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[0].sttBlockIndex, pIter->cid, id);
139,799,968✔
1084
    return;
139,654,968✔
1085
  }
1086

1087
  if (pInfo->blockData[1].pin) {
115,897,848!
1088
    pInfo->blockData[1].pin = false;
121,425,202✔
1089
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[1].sttBlockIndex, pIter->cid, id);
121,425,202✔
1090
    return;
121,444,268✔
1091
  }
1092

UNCOV
1093
  tsdbError("failed to unpin any stt block, sttBlock:%d stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
×
1094
}
1095

1096
void tMergeTreePinSttBlock(SMergeTree *pMTree) {
262,391,580✔
1097
  if (pMTree->pIter == NULL) {
262,391,580!
1098
    return;
×
1099
  }
1100

1101
  SLDataIter *pIter = pMTree->pIter;
262,391,580✔
1102
  pMTree->pPinnedBlockIter = pIter;
262,391,580✔
1103
  tLDataIterPinSttBlock(pIter, pMTree->idStr);
262,391,580✔
1104
}
1105

1106
void tMergeTreeUnpinSttBlock(SMergeTree *pMTree) {
255,745,986✔
1107
  if (pMTree->pPinnedBlockIter == NULL) {
255,745,986!
1108
    return;
×
1109
  }
1110

1111
  SLDataIter *pIter = pMTree->pPinnedBlockIter;
255,745,986✔
1112
  pMTree->pPinnedBlockIter = NULL;
255,745,986✔
1113
  tLDataIterUnpinSttBlock(pIter, pMTree->idStr);
255,745,986✔
1114
}
1115

1116
int32_t tMergeTreeNext(SMergeTree *pMTree, bool *pHasNext) {
313,565,099✔
1117
  int32_t code = 0;
313,565,099✔
1118
  if (pHasNext == NULL) {
313,565,099!
1119
    return TSDB_CODE_INVALID_PARA;
×
1120
  }
1121

1122
  *pHasNext = false;
313,565,099✔
1123
  if (pMTree->pIter) {
313,565,099✔
1124
    SLDataIter *pIter = pMTree->pIter;
311,502,323✔
1125
    bool        hasVal = false;
311,502,323✔
1126
    code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
311,502,323✔
1127
    if (!hasVal || (code != 0)) {
308,095,188✔
1128
      if (code == TSDB_CODE_FILE_CORRUPTED) {
1,360,798!
1129
        code = 0;  // suppress the file corrupt error to enable all queries within this cluster can run without failed.
×
1130
      }
1131

1132
      pMTree->pIter = NULL;
1,360,798✔
1133
    }
1134

1135
    // compare with min in RB Tree
1136
    pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
308,095,188✔
1137
    if (pMTree->pIter && pIter) {
308,095,188✔
1138
      int32_t c = pMTree->rbt.cmprFn(&pMTree->pIter->node, &pIter->node);
48,675,873✔
1139
      if (c > 0) {
48,272,015✔
1140
        (void)tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
3,226,996✔
1141
        pMTree->pIter = NULL;
4,333,308✔
1142
      } else if (!c) {
45,045,019!
1143
        return TSDB_CODE_INTERNAL_ERROR;
×
1144
      }
1145
    }
1146
  }
1147

1148
  if (pMTree->pIter == NULL) {
310,860,418✔
1149
    pMTree->pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
8,349,570✔
1150
    if (pMTree->pIter) {
8,349,570✔
1151
      tRBTreeDrop(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
5,697,339✔
1152
    }
1153
  }
1154

1155
  *pHasNext = (pMTree->pIter != NULL);
309,985,968✔
1156
  return code;
309,985,968✔
1157
}
1158

1159
void tMergeTreeClose(SMergeTree *pMTree) {
5,365,372✔
1160
  pMTree->pIter = NULL;
5,365,372✔
1161
  pMTree->pPinnedBlockIter = NULL;
5,365,372✔
1162
}
5,365,372✔
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc