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

taosdata / TDengine / #4295

14 Jun 2025 08:14AM UTC coverage: 62.777% (-0.1%) from 62.881%
#4295

push

travis-ci

web-flow
refactor: update container_build.sh to include branch option for taosadapter (#31367)

157612 of 320085 branches covered (49.24%)

Branch coverage included in aggregate %.

243488 of 318844 relevant lines covered (76.37%)

6438123.12 hits per line

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

81.02
/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) {
3,341,370✔
27
  *pInfo = NULL;
3,341,370✔
28

29
  SSttBlockLoadInfo *pLoadInfo = taosMemoryCalloc(1, sizeof(SSttBlockLoadInfo));
3,341,370!
30
  if (pLoadInfo == NULL) {
3,344,587!
31
    return terrno;
×
32
  }
33

34
  pLoadInfo->blockData[0].sttBlockIndex = -1;
3,344,587✔
35
  pLoadInfo->blockData[1].sttBlockIndex = -1;
3,344,587✔
36

37
  pLoadInfo->currentLoadBlockIndex = 1;
3,344,587✔
38

39
  int32_t code = tBlockDataCreate(&pLoadInfo->blockData[0].data);
3,344,587✔
40
  if (code) {
3,343,170!
41
    taosMemoryFreeClear(pLoadInfo);
×
42
    return code;
×
43
  }
44

45
  code = tBlockDataCreate(&pLoadInfo->blockData[1].data);
3,343,170✔
46
  if (code) {
3,342,055!
47
    taosMemoryFreeClear(pLoadInfo);
×
48
    return code;
×
49
  }
50

51
  pLoadInfo->aSttBlk = taosArrayInit(4, sizeof(SSttBlk));
3,342,055✔
52
  if (pLoadInfo->aSttBlk == NULL) {
3,344,569✔
53
    taosMemoryFreeClear(pLoadInfo);
715!
54
    return terrno;
715✔
55
  }
56

57
  pLoadInfo->pSchema = pSchema;
3,343,854✔
58
  pLoadInfo->colIds = colList;
3,343,854✔
59
  pLoadInfo->numOfCols = numOfCols;
3,343,854✔
60

61
  *pInfo = pLoadInfo;
3,343,854✔
62
  return code;
3,343,854✔
63
}
64

65
static void freeItem(void *pValue) {
29,424,563✔
66
  SValue *p = (SValue *)pValue;
29,424,563✔
67
  if (IS_VAR_DATA_TYPE(p->type) || p->type == TSDB_DATA_TYPE_DECIMAL) {
29,424,563!
68
    taosMemoryFree(p->pData);
579,936!
69
  }
70
}
29,439,750✔
71

72
void destroySttBlockLoadInfo(SSttBlockLoadInfo *pLoadInfo) {
3,348,566✔
73
  if (pLoadInfo == NULL) {
3,348,566!
74
    return;
×
75
  }
76

77
  pLoadInfo->currentLoadBlockIndex = 1;
3,348,566✔
78

79
  SBlockDataInfo *pInfo = &pLoadInfo->blockData[0];
3,348,566✔
80
  tBlockDataDestroy(&pInfo->data);
3,348,566✔
81
  pInfo->sttBlockIndex = -1;
3,347,277✔
82
  pInfo->pin = false;
3,347,277✔
83

84
  pInfo = &pLoadInfo->blockData[1];
3,347,277✔
85
  tBlockDataDestroy(&pInfo->data);
3,347,277✔
86
  pInfo->sttBlockIndex = -1;
3,347,020✔
87
  pInfo->pin = false;
3,347,020✔
88

89
  taosArrayDestroy(pLoadInfo->info.pUid);
3,347,020✔
90
  taosArrayDestroyEx(pLoadInfo->info.pFirstKey, freeItem);
3,347,017✔
91
  taosArrayDestroyEx(pLoadInfo->info.pLastKey, freeItem);
3,347,105✔
92
  taosArrayDestroy(pLoadInfo->info.pCount);
3,347,337✔
93
  taosArrayDestroy(pLoadInfo->info.pFirstTs);
3,347,139✔
94
  taosArrayDestroy(pLoadInfo->info.pLastTs);
3,346,909✔
95

96
  pLoadInfo->info.pUid = NULL;
3,347,247✔
97
  pLoadInfo->info.pFirstKey = NULL;
3,347,247✔
98
  pLoadInfo->info.pLastKey = NULL;
3,347,247✔
99
  pLoadInfo->info.pCount = NULL;
3,347,247✔
100
  pLoadInfo->info.pFirstTs = NULL;
3,347,247✔
101
  pLoadInfo->info.pLastTs = NULL;
3,347,247✔
102

103
  taosArrayDestroy(pLoadInfo->aSttBlk);
3,347,247✔
104
  taosMemoryFree(pLoadInfo);
3,347,610!
105
}
106

107
void destroyLDataIter(SLDataIter *pIter) {
3,343,118✔
108
  tLDataIterClose2(pIter);
3,343,118✔
109
  destroySttBlockLoadInfo(pIter->pBlockLoadInfo);
3,348,875✔
110
  taosMemoryFree(pIter);
3,348,339!
111
}
3,349,104✔
112

113
void destroySttBlockReader(SArray *pLDataIterArray, SSttBlockLoadCostInfo *pLoadCost) {
4,808,308✔
114
  if (pLDataIterArray == NULL) {
4,808,308✔
115
    return;
63,586✔
116
  }
117

118
  int32_t numOfLevel = taosArrayGetSize(pLDataIterArray);
4,744,722✔
119
  for (int32_t i = 0; i < numOfLevel; ++i) {
8,092,470✔
120
    SArray *pList = taosArrayGetP(pLDataIterArray, i);
3,343,262✔
121
    for (int32_t j = 0; j < taosArrayGetSize(pList); ++j) {
6,691,405✔
122
      SLDataIter *pIter = taosArrayGetP(pList, j);
3,343,387✔
123
      if (pIter->pBlockLoadInfo != NULL) {
3,343,085!
124
        SSttBlockLoadCostInfo *pCost = &pIter->pBlockLoadInfo->cost;
3,343,318✔
125
        if (pLoadCost != NULL) {
3,343,318✔
126
          pLoadCost->loadBlocks += pCost->loadBlocks;
3,336,716✔
127
          pLoadCost->loadStatisBlocks += pCost->loadStatisBlocks;
3,336,716✔
128
          pLoadCost->blockElapsedTime += pCost->blockElapsedTime;
3,336,716✔
129
          pLoadCost->statisElapsedTime += pCost->statisElapsedTime;
3,336,716✔
130
        }
131
      }
132

133
      destroyLDataIter(pIter);
3,343,085✔
134
    }
135

136
    taosArrayDestroy(pList);
3,340,165✔
137
  }
138

139
  taosArrayDestroy(pLDataIterArray);
4,749,208✔
140
}
141

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

149
  pLoadInfo->currentLoadBlockIndex = nextSlotIndex;
1,614,608✔
150
}
1,614,608✔
151

152
static int32_t loadLastBlock(SLDataIter *pIter, const char *idStr, SBlockData **pResBlock) {
590,001,243✔
153
  if (pResBlock != NULL) {
590,001,243!
154
    *pResBlock = NULL;
590,270,408✔
155
  }
156

157
  int32_t            code = 0;
590,001,243✔
158
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
590,001,243✔
159

160
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
590,001,243✔
161
    if (pInfo->currentLoadBlockIndex != 0) {
335,510,168✔
162
      tsdbDebug("current load index is set to 0, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
294✔
163
                ", load data, %s",
164
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
165
      pInfo->currentLoadBlockIndex = 0;
294✔
166
    }
167

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

172
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
254,491,075!
173
    if (pInfo->currentLoadBlockIndex != 1) {
271,672,161✔
174
      tsdbDebug("current load index is set to 1, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
274✔
175
                ", load data, %s",
176
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
177
      pInfo->currentLoadBlockIndex = 1;
274✔
178
    }
179

180
    *pResBlock = &pInfo->blockData[1].data;
271,672,161✔
181
    return code;
271,672,161✔
182
  }
183

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

188
  updateBlockLoadSlot(pInfo);
1,615,017✔
189
  int64_t st = taosGetTimestampUs();
1,615,986✔
190

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

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

202
  tsdbDebug("read stt block, total load:%" PRId64 ", trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
1,616,437✔
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,615,974✔
210
  pIter->iRow = (pIter->backward) ? pInfo->blockData[pInfo->currentLoadBlockIndex].data.nRow : -1;
1,615,974✔
211

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

215
  *pResBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
1,616,025✔
216
  return code;
1,616,025✔
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;
2,315,490✔
223
  int32_t step = backward ? 1 : -1;
2,315,490✔
224
  while (i >= 0 && i < num && uid >= pBlockList[i].minUid && uid <= pBlockList[i].maxUid) {
4,667,742!
225
    i += step;
2,352,252✔
226
  }
227
  return i - step;
2,315,490✔
228
}
229

230
static int32_t binarySearchForStartBlock(SSttBlk *pBlockList, int32_t num, uint64_t uid, int32_t backward) {
5,662,591✔
231
  int32_t midPos = -1;
5,662,591✔
232
  if (num <= 0) {
5,662,591✔
233
    return -1;
2,606,880✔
234
  }
235

236
  int32_t firstPos = 0;
3,055,711✔
237
  int32_t lastPos = num - 1;
3,055,711✔
238

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

244
  while (1) {
210,485✔
245
    if (uid >= pBlockList[firstPos].minUid && uid <= pBlockList[firstPos].maxUid) {
2,526,156✔
246
      return findEarliestIndex(firstPos, uid, pBlockList, num, backward);
2,239,964✔
247
    }
248

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

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

256
    if (uid < pBlockList[midPos].minUid) {
286,011✔
257
      lastPos = midPos - 1;
94,133✔
258
    } else if (uid > pBlockList[midPos].maxUid) {
191,878✔
259
      firstPos = midPos + 1;
116,352✔
260
    } else {
261
      return findEarliestIndex(midPos, uid, pBlockList, num, backward);
75,526✔
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;
2,291,518✔
269
  int32_t step = backward ? 1 : -1;
2,291,518✔
270
  while (i >= 0 && i < num && uid == uidList[i]) {
61,286,032!
271
    i += step;
58,994,514✔
272
  }
273
  return i - step;
2,291,518✔
274
}
275

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

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

285
  while (1) {
1,134,307✔
286
    if (uid == uidList[firstPos]) {
3,443,011✔
287
      return findEarliestRow(firstPos, uid, uidList, num, backward);
1,528,872✔
288
    }
289

290
    if (uid > uidList[lastPos] || uid < uidList[firstPos]) {
1,914,139✔
291
      return -1;
17,186✔
292
    }
293

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

297
    if (uid < uidList[midPos]) {
1,896,953✔
298
      lastPos = midPos - 1;
386,421✔
299
    } else if (uid > uidList[midPos]) {
1,510,532✔
300
      firstPos = midPos + 1;
747,886✔
301
    } else {
302
      return findEarliestRow(midPos, uid, uidList, num, backward);
762,646✔
303
    }
304
  }
305
}
306

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

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

318
  // all identical
319
  if (pStart->suid == pEnd->suid) {
3,327,588✔
320
    if (pStart->suid != suid) {  // no qualified stt block existed
2,666,950✔
321
      taosArrayClear(pBlockLoadInfo->aSttBlk);
1,166,989✔
322
      pIter->iSttBlk = -1;
1,166,395✔
323
      return TSDB_CODE_SUCCESS;
1,166,395✔
324
    } else {  // all blocks are qualified
325
      taosArrayClear(pBlockLoadInfo->aSttBlk);
1,499,961✔
326
      px = taosArrayAddBatch(pBlockLoadInfo->aSttBlk, pArray->data, pArray->size);
1,501,436✔
327
      if (px == NULL) {
1,500,229!
328
        return terrno;
×
329
      }
330
    }
331
  } else {
332
    SArray *pTmp = taosArrayInit(TARRAY2_SIZE(pArray), sizeof(SSttBlk));
660,638✔
333
    if (pTmp == NULL) {
665,464✔
334
      return terrno;
3✔
335
    }
336

337
    for (int32_t i = 0; i < TARRAY2_SIZE(pArray); ++i) {
2,152,082✔
338
      SSttBlk *p = &pArray->data[i];
1,833,344✔
339
      if (p->suid < suid) {
1,833,344✔
340
        continue;
1,028,335✔
341
      }
342

343
      if (p->suid == suid) {
805,009✔
344
        void *px = taosArrayPush(pTmp, p);
458,359✔
345
        if (px == NULL) {
458,359!
346
          code = terrno;
×
347
          break;
×
348
        }
349
      } else if (p->suid > suid) {
346,605!
350
        break;
346,678✔
351
      }
352
    }
353

354
    taosArrayDestroy(pBlockLoadInfo->aSttBlk);
665,416✔
355
    pBlockLoadInfo->aSttBlk = pTmp;
665,365✔
356
  }
357

358
  return code;
2,165,594✔
359
}
360

361
static int32_t tValueDupPayload(SValue *pVal) {
1,474,970✔
362
  if (IS_VAR_DATA_TYPE(pVal->type) || pVal->type == TSDB_DATA_TYPE_DECIMAL) {
1,474,970!
363
    char *p = (char *)pVal->pData;
594,114✔
364
    char *pBuf = taosMemoryMalloc(pVal->nData);
594,114!
365
    if (pBuf == NULL) {
594,542!
366
      return terrno;
×
367
    }
368

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

373
  return TSDB_CODE_SUCCESS;
1,475,398✔
374
}
375

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

384
  int32_t numOfBlocks = TARRAY2_SIZE(pStatisBlkArray);
3,327,306✔
385
  if (numOfBlocks <= 0) {
3,327,306✔
386
    return code;
291✔
387
  }
388

389
  while ((startIndex < numOfBlocks) && (pStatisBlkArray->data[startIndex].maxTbid.suid < suid)) {
4,140,606✔
390
    ++startIndex;
813,591✔
391
  }
392

393
  if (startIndex >= numOfBlocks || pStatisBlkArray->data[startIndex].minTbid.suid > suid) {
3,327,015✔
394
    return 0;
1,358,097✔
395
  }
396

397
  int32_t endIndex = startIndex;
1,968,918✔
398
  while (endIndex < numOfBlocks && pStatisBlkArray->data[endIndex].minTbid.suid <= suid) {
3,957,576✔
399
    ++endIndex;
1,988,658✔
400
  }
401

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

405
  STbStatisBlock block;
406
  code = tStatisBlockInit(&block);
1,968,918✔
407
  QUERY_CHECK_CODE(code, lino, _end);
1,968,558!
408

409
  int64_t st = taosGetTimestampUs();
1,968,534✔
410

411
  for (int32_t k = startIndex; k < endIndex; ++k) {
3,943,294✔
412
    code = tsdbSttFileReadStatisBlock(pSttFileReader, &pStatisBlkArray->data[k], &block);
1,986,080✔
413
    QUERY_CHECK_CODE(code, lino, _end);
1,988,588!
414

415
    int32_t i = 0;
1,988,588✔
416
    int32_t rows = block.numOfRecords;
1,988,588✔
417
    while (i < rows && ((int64_t *)block.suids.data)[i] != suid) {
2,851,528✔
418
      ++i;
862,940✔
419
    }
420

421
    // existed
422
    if (i < rows) {
1,988,588✔
423
      SSttTableRowsInfo *pInfo = &pBlockLoadInfo->info;
1,918,893✔
424

425
      if (pInfo->pUid == NULL) {
1,918,893✔
426
        pInfo->pUid = taosArrayInit(rows, sizeof(int64_t));
1,899,195✔
427
        pInfo->pFirstTs = taosArrayInit(rows, sizeof(int64_t));
1,899,370✔
428
        pInfo->pLastTs = taosArrayInit(rows, sizeof(int64_t));
1,899,626✔
429
        pInfo->pCount = taosArrayInit(rows, sizeof(int64_t));
1,899,606✔
430

431
        pInfo->pFirstKey = taosArrayInit(rows, sizeof(SValue));
1,899,610✔
432
        pInfo->pLastKey = taosArrayInit(rows, sizeof(SValue));
1,899,572✔
433

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

441
      if (pStatisBlkArray->data[k].maxTbid.suid == suid) {
1,919,016✔
442
        int32_t size = rows - i;
1,797,682✔
443
        int32_t offset = i * sizeof(int64_t);
1,797,682✔
444

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

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

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

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

457
        if (block.numOfPKs > 0) {
1,796,242✔
458
          SValue vFirst = {0}, vLast = {0};
302,163✔
459
          for (int32_t f = i; f < rows; ++f) {
946,195✔
460
            code = tValueColumnGet(&block.firstKeyPKs[0], f, &vFirst);
643,494✔
461
            TSDB_CHECK_CODE(code, lino, _end);
643,623!
462

463
            code = tValueDupPayload(&vFirst);
643,623✔
464
            TSDB_CHECK_CODE(code, lino, _end);
643,794!
465

466
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
643,794✔
467
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
643,929!
468

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

473
            code = tValueDupPayload(&vLast);
643,951✔
474
            TSDB_CHECK_CODE(code, lino, _end);
643,979!
475

476
            px = taosArrayPush(pInfo->pLastKey, &vLast);
643,979✔
477
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
644,032!
478
          }
479
        } else {
480
          SValue vFirst = {0};
1,494,079✔
481
          for (int32_t j = 0; j < size; ++j) {
14,816,211✔
482
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
13,335,201✔
483
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
13,321,943!
484

485
            px = taosArrayPush(pInfo->pLastKey, &vFirst);
13,321,943✔
486
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
13,322,132!
487
          }
488
        }
489
      } else {
490
        STbStatisRecord record = {0};
121,334✔
491
        while (i < rows) {
290,631✔
492
          code = tStatisBlockGet(&block, i, &record);
290,623✔
493
          TSDB_CHECK_CODE(code, lino, _end);
290,502!
494

495
          if (record.suid != suid) {
290,502✔
496
            break;
121,346✔
497
          }
498

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

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

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

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

511
          if (record.firstKey.numOfPKs > 0) {
169,193✔
512
            SValue s = record.firstKey.pks[0];
94,379✔
513
            code = tValueDupPayload(&s);
94,379✔
514
            TSDB_CHECK_CODE(code, lino, _end);
94,388!
515

516
            px = taosArrayPush(pInfo->pFirstKey, &s);
94,388✔
517
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
94,398!
518

519
            s = record.lastKey.pks[0];
94,398✔
520
            code = tValueDupPayload(&s);
94,398✔
521
            TSDB_CHECK_CODE(code, lino, _end);
94,394!
522

523
            px = taosArrayPush(pInfo->pLastKey, &s);
94,394✔
524
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
94,400!
525
          } else {
526
            SValue v = {0};
74,814✔
527
            px = taosArrayPush(pInfo->pFirstKey, &v);
74,814✔
528
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
74,925!
529

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

534
          i += 1;
169,297✔
535
        }
536
      }
537
    }
538
  }
539

540
_end:
1,957,214✔
541
  tStatisBlockDestroy(&block);
1,957,214✔
542
  if (code != 0) {
1,968,508!
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,968,735✔
546
    pBlockLoadInfo->cost.statisElapsedTime += el;
1,968,735✔
547

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

553
static int32_t doLoadSttFilesBlk(SSttBlockLoadInfo *pBlockLoadInfo, SLDataIter *pIter, int64_t suid,
3,329,596✔
554
                                 _load_tomb_fn loadTombFn, void *pReader1, const char *idStr) {
555
  int64_t st = taosGetTimestampUs();
3,332,085✔
556

557
  const TSttBlkArray *pSttBlkArray = NULL;
3,332,085✔
558
  pBlockLoadInfo->sttBlockLoaded = true;
3,332,085✔
559

560
  // load the stt block info for each stt-block
561
  int32_t code = tsdbSttFileReadSttBlk(pIter->pReader, &pSttBlkArray);
3,332,085✔
562
  if (code != TSDB_CODE_SUCCESS) {
3,332,593!
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);
3,332,593✔
569
  if (code != TSDB_CODE_SUCCESS) {
3,330,659!
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;
3,330,659✔
576
  code = tsdbSttFileReadStatisBlk(pIter->pReader, (const TStatisBlkArray **)&pStatisBlkArray);
3,330,659✔
577
  if (code != TSDB_CODE_SUCCESS) {
3,330,085!
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);
3,330,085✔
584
  if (code != TSDB_CODE_SUCCESS) {
3,330,488!
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);
3,330,488✔
590

591
  double el = (taosGetTimestampUs() - st) / 1000.0;
3,329,721✔
592
  tsdbDebug("load the stt file blk info completed, elapsed time:%.2fms, %s", el, idStr);
3,329,721✔
593
  return code;
3,330,254✔
594
}
595

596
static int32_t uidComparFn(const void *p1, const void *p2) {
4,703,270✔
597
  const uint64_t *pFirst = p1;
4,703,270✔
598
  const uint64_t *pVal = p2;
4,703,270✔
599

600
  if (*pFirst == *pVal) {
4,703,270✔
601
    return 0;
2,304,815✔
602
  } else {
603
    return *pFirst < *pVal ? -1 : 1;
2,398,455✔
604
  }
605
}
606

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

613
  int32_t index = taosArraySearchIdx(pLoadInfo->info.pUid, &uid, uidComparFn, TD_EQ);
3,059,234✔
614
  if (index >= 0) {
3,062,050✔
615
    pRange->skey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pFirstTs, index);
2,305,026✔
616
    pRange->ekey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pLastTs, index);
2,304,371✔
617

618
    *numOfRows += *(int64_t *)taosArrayGet(pLoadInfo->info.pCount, index);
2,304,182✔
619

620
    if (pRange->skey.numOfPKs > 0) {
2,304,173✔
621
      memcpy(&pRange->skey.pks[0], taosArrayGet(pLoadInfo->info.pFirstKey, index), sizeof(SValue));
649,012✔
622
      memcpy(&pRange->ekey.pks[0], taosArrayGet(pLoadInfo->info.pLastKey, index), sizeof(SValue));
648,860✔
623
    }
624
  }
625
}
626

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

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

640
  pIter->pStartRowKey = pConf->pCurRowKey;
5,683,225✔
641
  pIter->pReader = pSttFileReader;
5,683,225✔
642
  pIter->pBlockLoadInfo = pBlockLoadInfo;
5,683,225✔
643

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

652
  if (!pBlockLoadInfo->sttBlockLoaded) {
5,671,095✔
653
    code = doLoadSttFilesBlk(pBlockLoadInfo, pIter, pConf->suid, pConf->loadTombFn, pConf->pReader, idStr);
3,332,021✔
654
    if (code != TSDB_CODE_SUCCESS) {
3,329,758!
655
      return code;
×
656
    }
657
  }
658

659
  setSttInfoForCurrentTable(pBlockLoadInfo, pConf->uid, pKeyRange, numOfRows);
5,668,832✔
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);
5,665,814✔
664
  pIter->iSttBlk = binarySearchForStartBlock(pBlockLoadInfo->aSttBlk->pData, size, pConf->uid, backward);
5,664,672✔
665
  if (pIter->iSttBlk != -1) {
5,661,007✔
666
    pIter->pSttBlk = taosArrayGet(pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
2,321,518✔
667
    pIter->iRow = (pIter->backward) ? pIter->pSttBlk->nRow : -1;
2,321,388✔
668

669
    if ((!backward) && ((pConf->strictTimeRange && pIter->pSttBlk->minKey >= pIter->timeWindow.ekey) ||
2,321,388!
670
                        (!pConf->strictTimeRange && pIter->pSttBlk->minKey > pIter->timeWindow.ekey))) {
2,017,962✔
671
      pIter->pSttBlk = NULL;
922✔
672
    }
673

674
    if (backward && ((pConf->strictTimeRange && pIter->pSttBlk->maxKey <= pIter->timeWindow.skey) ||
2,321,388!
675
                     (!pConf->strictTimeRange && pIter->pSttBlk->maxKey < pIter->timeWindow.skey))) {
303,387!
676
      pIter->pSttBlk = NULL;
368✔
677
      pIter->ignoreEarlierTs = true;
368✔
678
    }
679
  }
680

681
  return code;
5,660,877✔
682
}
683

684
void tLDataIterClose2(SLDataIter *pIter) {
3,342,113✔
685
  tsdbSttFileReaderClose(&pIter->pReader);
3,342,113✔
686
  pIter->pReader = NULL;
3,348,963✔
687
}
3,348,963✔
688

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

693
  pIter->iSttBlk += step;
2,358,876✔
694

695
  int32_t index = -1;
2,358,876✔
696
  size_t  size = pIter->pBlockLoadInfo->aSttBlk->size;
2,358,876✔
697
  for (int32_t i = pIter->iSttBlk; i < size && i >= 0; i += step) {
2,360,552!
698
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, i);
188,757✔
699
    if ((!pIter->backward) && p->minUid > pIter->uid) {
188,747✔
700
      break;
107,058✔
701
    }
702

703
    if (pIter->backward && p->maxUid < pIter->uid) {
81,689✔
704
      break;
4,592✔
705
    }
706

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

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

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

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

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

735
  pIter->pSttBlk = NULL;
2,358,866✔
736
  if (index != -1) {
2,358,866✔
737
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, index);
74,922✔
738

739
    pIter->iSttBlk = index;
74,921✔
740
    pIter->pSttBlk = (SSttBlk *)taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
74,921✔
741
    tsdbDebug("try next stt-file block:%d from %d, trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
74,921✔
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);
2,283,944✔
746
  }
747
}
2,358,868✔
748

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

755
  int32_t code = loadLastBlock(pIter, idStr, &pData);
305,335,700✔
756
  if (code) {
302,800,673!
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) {
302,800,673✔
763
    i = binarySearchForStartRowIndex((uint64_t *)pData->aUid, pData->nRow, pIter->uid, pIter->backward);
2,309,246✔
764
    if (i == -1) {
2,309,506!
765
      tsdbDebug("failed to find the data in pBlockData, uid:%" PRIu64 " , %s", pIter->uid, idStr);
×
766
      pIter->iRow = -1;
17,387✔
767
      return code;
17,387✔
768
    }
769
  }
770

771
  for (; i < pData->nRow && i >= 0; i += step) {
312,834,687!
772
    if (pData->aUid != NULL) {
312,278,171✔
773
      if (!pIter->backward) {
310,467,331✔
774
        if (pData->aUid[i] > pIter->uid) {
294,364,138✔
775
          break;
656,173✔
776
        }
777
      } else {
778
        if (pData->aUid[i] < pIter->uid) {
16,103,193✔
779
          break;
162,693✔
780
        }
781
      }
782
    }
783

784
    int64_t ts = pData->aTSKEY[i];
311,459,305✔
785
    if (!pIter->backward) {               // asc
311,459,305✔
786
      if (ts > pIter->timeWindow.ekey) {  // no more data
295,059,360✔
787
        break;
5,023✔
788
      } else {
789
        if (ts < pIter->timeWindow.skey) {
295,054,337✔
790
          continue;
7,857,231✔
791
        }
792

793
        if (ts == pIter->timeWindow.skey && pIter->pStartRowKey->numOfPKs > 0) {
287,197,106✔
794
          SRowKey key;
795
          tColRowGetKey(pData, i, &key);
245!
796
          int32_t ret = pkCompEx(&key, pIter->pStartRowKey);
245✔
797
          if (ret < 0) {
245!
798
            continue;
×
799
          }
800
        }
801
      }
802
    } else {
803
      if (ts < pIter->timeWindow.skey) {
16,399,945✔
804
        break;
2,479✔
805
      } else {
806
        if (ts > pIter->timeWindow.ekey) {
16,397,466✔
807
          continue;
1,912,356✔
808
        }
809

810
        if (ts == pIter->timeWindow.ekey && pIter->pStartRowKey->numOfPKs > 0) {
14,485,110!
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];
301,682,216✔
822
    if (ver < pIter->verRange.minVer) {
301,682,216!
823
      continue;
×
824
    }
825

826
    // todo opt handle desc case
827
    if (ver > pIter->verRange.maxVer) {
301,682,216!
828
      continue;
×
829
    }
830

831
    hasVal = true;
301,682,216✔
832
    break;
301,682,216✔
833
  }
834

835
  pIter->iRow = (hasVal) ? i : -1;
303,065,100✔
836
  return code;
303,065,100✔
837
}
838

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

846
  *hasNext = false;
309,030,178✔
847

848
  // no qualified last file block in current file, no need to fetch row
849
  if (pIter->pSttBlk == NULL) {
309,030,178✔
850
    return code;
3,359,559✔
851
  }
852

853
  code = loadLastBlock(pIter, idStr, &pBlockData);
305,670,619✔
854
  if (pBlockData == NULL || code != TSDB_CODE_SUCCESS) {
304,762,385!
855
    lino = __LINE__;
×
856
    goto _exit;
×
857
  }
858

859
  pIter->iRow += step;
305,341,244✔
860

861
  while (1) {
74,084✔
862
    bool skipBlock = false;
305,415,328✔
863
    code = findNextValidRow(pIter, idStr);
305,415,328✔
864
    TSDB_CHECK_CODE(code, lino, _exit);
303,090,275!
865

866
    if (pIter->pBlockLoadInfo->checkRemainingRow) {
303,090,275!
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) {
303,090,275!
890
      tLDataIterNextBlock(pIter, idStr);
2,175,017✔
891
      if (pIter->pSttBlk == NULL) {  // no more data
2,358,140✔
892
        goto _exit;
2,284,054✔
893
      }
894
    } else {
895
      break;
896
    }
897

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

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

910
  pIter->rInfo.suid = pBlockData->suid;
300,915,258✔
911
  pIter->rInfo.uid = pBlockData->uid;
300,915,258✔
912
  pIter->rInfo.row = tsdbRowFromBlockData(pBlockData, pIter->iRow);
300,915,258✔
913

914
_exit:
302,620,439✔
915
  if (code) {
302,620,439!
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);
303,002,250!
920
  return code;
303,002,250✔
921
}
922

923
// SMergeTree =================================================
924
static FORCE_INLINE int32_t tLDataIterCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
62,139,115✔
925
  SLDataIter *pIter1 = (SLDataIter *)(((uint8_t *)p1) - offsetof(SLDataIter, node));
62,239,530✔
926
  SLDataIter *pIter2 = (SLDataIter *)(((uint8_t *)p2) - offsetof(SLDataIter, node));
62,239,530✔
927

928
  SRowKey rkey1 = {0}, rkey2 = {0};
62,239,530✔
929
  tRowGetKeyEx(&pIter1->rInfo.row, &rkey1);
62,239,530!
930
  tRowGetKeyEx(&pIter2->rInfo.row, &rkey2);
62,506,011!
931

932
  int32_t ret = tRowKeyCompare(&rkey1, &rkey2);
62,290,978✔
933
  if (ret < 0) {
62,248,235✔
934
    return -1;
42,543,799✔
935
  } else if (ret > 0) {
19,704,436✔
936
    return 1;
7,782,028✔
937
  } else {
938
    int64_t ver1 = TSDBROW_VERSION(&pIter1->rInfo.row);
11,922,408!
939
    int64_t ver2 = TSDBROW_VERSION(&pIter2->rInfo.row);
11,922,408!
940

941
    if (ver1 < ver2) {
11,922,408✔
942
      return -1;
4,835,218✔
943
    } else if (ver1 > ver2) {
7,087,190!
944
      return 1;
7,612,550✔
945
    } else {
946
      return 0;
×
947
    }
948
  }
949
}
950

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

955
int32_t tMergeTreeOpen2(SMergeTree *pMTree, SMergeTreeConf *pConf, SSttDataInfoForTable *pSttDataInfo) {
6,029,618✔
956
  int32_t code = TSDB_CODE_SUCCESS;
6,029,618✔
957

958
  pMTree->pIter = NULL;
6,029,618✔
959
  pMTree->backward = pConf->backward;
6,029,618✔
960
  pMTree->idStr = pConf->idstr;
6,029,618✔
961
  int32_t lino = 0;
6,029,618✔
962

963
  if (!pMTree->backward) {  // asc
6,029,618✔
964
    tRBTreeCreate(&pMTree->rbt, tLDataIterCmprFn);
4,820,555✔
965
  } else {  // desc
966
    tRBTreeCreate(&pMTree->rbt, tLDataIterDescCmprFn);
1,209,063✔
967
  }
968

969
  pMTree->ignoreEarlierTs = false;
6,030,387✔
970

971
  // no data exists, go to end
972
  int32_t numOfLevels = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->size;
6,030,387✔
973
  if (numOfLevels == 0) {
6,030,387✔
974
    goto _end;
534,444✔
975
  }
976

977
  code = adjustSttDataIters(pConf->pSttFileBlockIterArray, pConf->pCurrentFileset);
5,495,943✔
978
  if (code) {
5,493,707!
979
    goto _end;
×
980
  }
981

982
  for (int32_t j = 0; j < numOfLevels; ++j) {
11,155,352✔
983
    SSttLvl *pSttLevel = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->data[j];
5,665,162✔
984
    SArray  *pList = taosArrayGetP(pConf->pSttFileBlockIterArray, j);
5,665,162✔
985

986
    for (int32_t i = 0; i < TARRAY2_SIZE(pSttLevel->fobjArr); ++i) {  // open all last file
11,341,074✔
987
      SLDataIter *pIter = taosArrayGetP(pList, i);
5,679,429✔
988

989
      SSttFileReader    *pSttFileReader = pIter->pReader;
5,676,612✔
990
      SSttBlockLoadInfo *pLoadInfo = pIter->pBlockLoadInfo;
5,676,612✔
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) {
5,676,612✔
995
        SSttFileReaderConfig conf = {.tsdb = pConf->pTsdb, .szPage = pConf->pTsdb->pVnode->config.tsdbPageSize};
3,342,106✔
996
        conf.file[0] = *pSttLevel->fobjArr->data[i]->f;
3,342,106✔
997

998
        code = tsdbSttFileReaderOpen(pSttLevel->fobjArr->data[i]->fname, &conf, &pSttFileReader);
3,342,106✔
999
        if (code != TSDB_CODE_SUCCESS) {
3,339,413✔
1000
          tsdbError("open stt file reader error. file name %s, code %s, %s", pSttLevel->fobjArr->data[i]->fname,
12,130!
1001
                    tstrerror(code), pMTree->idStr);
1002
        }
1003
      }
1004

1005
      if (pLoadInfo == NULL) {
5,675,703✔
1006
        code = tCreateSttBlockLoadInfo(pConf->pSchema, pConf->pCols, pConf->numOfCols, &pLoadInfo);
3,344,235✔
1007
        if (code != TSDB_CODE_SUCCESS) {
3,343,654!
1008
          goto _end;
×
1009
        }
1010
      }
1011

1012
      memset(pIter, 0, sizeof(SLDataIter));
5,675,122✔
1013

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

1018
      code = tLDataIterOpen2(pIter, pSttFileReader, cid, pMTree->backward, pConf, pLoadInfo, &range, &numOfRows,
5,675,122✔
1019
                             pMTree->idStr);
1020
      if (code != TSDB_CODE_SUCCESS) {
5,672,842!
1021
        goto _end;
×
1022
      }
1023

1024
      bool hasVal = NULL;
5,672,842✔
1025
      code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
5,672,842✔
1026
      if (code) {
5,676,251!
1027
        goto _end;
×
1028
      }
1029

1030
      if (hasVal) {
5,676,251✔
1031
        tMergeTreeAddIter(pMTree, pIter);
2,295,761✔
1032

1033
        // let's record the time window for current table of uid in the stt files
1034
        if (pSttDataInfo != NULL && numOfRows > 0) {
2,295,020!
1035
          void *px = taosArrayPush(pSttDataInfo->pKeyRangeList, &range);
2,294,663✔
1036
          QUERY_CHECK_NULL(px, code, lino, _end, terrno);
2,293,607!
1037

1038
          pSttDataInfo->numOfRows += numOfRows;
2,293,607✔
1039
        }
1040
      } else {
1041
        if (!pMTree->ignoreEarlierTs) {
3,380,490!
1042
          pMTree->ignoreEarlierTs = pIter->ignoreEarlierTs;
3,382,320✔
1043
        }
1044
      }
1045
    }
1046
  }
1047

1048
  return code;
5,490,190✔
1049

1050
_end:
534,444✔
1051
  tMergeTreeClose(pMTree);
534,444✔
1052
  return code;
534,300✔
1053
}
1054

1055
void tMergeTreeAddIter(SMergeTree *pMTree, SLDataIter *pIter) {
2,294,538✔
1056
  SRBTreeNode *node = tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pIter);
2,294,538✔
1057
}
2,295,009✔
1058

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

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

1064
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
257,240,022✔
1065
    pInfo->blockData[0].pin = true;
144,816,107✔
1066
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
144,816,107✔
1067
    return;
144,995,101✔
1068
  }
1069

1070
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
112,423,915!
1071
    pInfo->blockData[1].pin = true;
117,221,481✔
1072
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
117,221,481✔
1073
    return;
117,161,609✔
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) {
251,100,076✔
1080
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
251,100,076✔
1081
  if (pInfo->blockData[0].pin) {
251,100,076✔
1082
    pInfo->blockData[0].pin = false;
142,005,146✔
1083
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[0].sttBlockIndex, pIter->cid, id);
142,005,146✔
1084
    return;
142,022,382✔
1085
  }
1086

1087
  if (pInfo->blockData[1].pin) {
109,094,930!
1088
    pInfo->blockData[1].pin = false;
115,129,334✔
1089
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[1].sttBlockIndex, pIter->cid, id);
115,129,334✔
1090
    return;
115,131,729✔
1091
  }
1092

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) {
257,271,254✔
1097
  if (pMTree->pIter == NULL) {
257,271,254!
1098
    return;
×
1099
  }
1100

1101
  SLDataIter *pIter = pMTree->pIter;
257,271,254✔
1102
  pMTree->pPinnedBlockIter = pIter;
257,271,254✔
1103
  tLDataIterPinSttBlock(pIter, pMTree->idStr);
257,271,254✔
1104
}
1105

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

1111
  SLDataIter *pIter = pMTree->pPinnedBlockIter;
251,208,393✔
1112
  pMTree->pPinnedBlockIter = NULL;
251,208,393✔
1113
  tLDataIterUnpinSttBlock(pIter, pMTree->idStr);
251,208,393✔
1114
}
1115

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

1122
  *pHasNext = false;
309,286,619✔
1123
  while (pMTree->pIter) {
309,286,619✔
1124
    SLDataIter *pIter = pMTree->pIter;
303,214,603✔
1125
    bool        hasVal = false;
303,214,603✔
1126
    code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
303,214,603✔
1127
    if (!hasVal || (code != 0)) {
300,313,699✔
1128
      if (code == TSDB_CODE_FILE_CORRUPTED) {
2,258,220!
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;
2,258,220✔
1133
    }
1134

1135
    // compare with min in RB Tree
1136
    pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
300,313,699✔
1137
    if (pMTree->pIter && pIter) {
300,313,699✔
1138
      int32_t c = pMTree->rbt.cmprFn(&pMTree->pIter->node, &pIter->node);
42,463,808✔
1139
      if (c > 0) {
42,244,348✔
1140
        (void)tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
4,253,694✔
1141
        pMTree->pIter = NULL;
4,637,865✔
1142
      } else if (!c) {
37,990,654!
1143
        continue;
×
1144
      }
1145
    }
1146

1147
    break;
300,478,410✔
1148
  }
1149

1150
  if (pMTree->pIter == NULL) {
306,550,426✔
1151
    pMTree->pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
12,874,994✔
1152
    if (pMTree->pIter) {
12,874,994✔
1153
      tRBTreeDrop(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
6,896,808✔
1154
    }
1155
  }
1156

1157
  *pHasNext = (pMTree->pIter != NULL);
306,428,303✔
1158
  return code;
306,428,303✔
1159
}
1160

1161
void tMergeTreeClose(SMergeTree *pMTree) {
9,181,746✔
1162
  pMTree->pIter = NULL;
9,181,746✔
1163
  pMTree->pPinnedBlockIter = NULL;
9,181,746✔
1164
}
9,181,746✔
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