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

taosdata / TDengine / #3615

18 Feb 2025 07:41AM UTC coverage: 62.953% (+1.6%) from 61.4%
#3615

push

travis-ci

web-flow
Merge pull request #29812 from taosdata/doc/analysis

doc: update tdgpt doc.

146885 of 299602 branches covered (49.03%)

Branch coverage included in aggregate %.

230802 of 300346 relevant lines covered (76.85%)

17263824.17 hits per line

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

78.54
/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) {
5,894,907✔
27
  *pInfo = NULL;
5,894,907✔
28

29
  SSttBlockLoadInfo *pLoadInfo = taosMemoryCalloc(1, sizeof(SSttBlockLoadInfo));
5,894,907!
30
  if (pLoadInfo == NULL) {
5,898,790!
31
    return terrno;
×
32
  }
33

34
  pLoadInfo->blockData[0].sttBlockIndex = -1;
5,898,790✔
35
  pLoadInfo->blockData[1].sttBlockIndex = -1;
5,898,790✔
36

37
  pLoadInfo->currentLoadBlockIndex = 1;
5,898,790✔
38

39
  int32_t code = tBlockDataCreate(&pLoadInfo->blockData[0].data);
5,898,790✔
40
  if (code) {
5,899,339!
41
    taosMemoryFreeClear(pLoadInfo);
×
42
    return code;
×
43
  }
44

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

51
  pLoadInfo->aSttBlk = taosArrayInit(4, sizeof(SSttBlk));
5,899,671✔
52
  if (pLoadInfo->aSttBlk == NULL) {
5,899,125✔
53
    taosMemoryFreeClear(pLoadInfo);
260!
54
    return terrno;
260✔
55
  }
56

57
  pLoadInfo->pSchema = pSchema;
5,898,865✔
58
  pLoadInfo->colIds = colList;
5,898,865✔
59
  pLoadInfo->numOfCols = numOfCols;
5,898,865✔
60

61
  *pInfo = pLoadInfo;
5,898,865✔
62
  return code;
5,898,865✔
63
}
64

65
static void freeItem(void *pValue) {
37,035,104✔
66
  SValue *p = (SValue *)pValue;
37,035,104✔
67
  if (IS_VAR_DATA_TYPE(p->type)) {
37,035,104!
68
    taosMemoryFree(p->pData);
×
69
  }
70
}
37,042,176✔
71

72
void destroySttBlockLoadInfo(SSttBlockLoadInfo *pLoadInfo) {
5,902,398✔
73
  if (pLoadInfo == NULL) {
5,902,398!
74
    return;
×
75
  }
76

77
  pLoadInfo->currentLoadBlockIndex = 1;
5,902,398✔
78

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

84
  pInfo = &pLoadInfo->blockData[1];
5,902,358✔
85
  tBlockDataDestroy(&pInfo->data);
5,902,358✔
86
  pInfo->sttBlockIndex = -1;
5,902,318✔
87
  pInfo->pin = false;
5,902,318✔
88

89
  taosArrayDestroy(pLoadInfo->info.pUid);
5,902,318✔
90
  taosArrayDestroyEx(pLoadInfo->info.pFirstKey, freeItem);
5,902,199✔
91
  taosArrayDestroyEx(pLoadInfo->info.pLastKey, freeItem);
5,902,179✔
92
  taosArrayDestroy(pLoadInfo->info.pCount);
5,902,299✔
93
  taosArrayDestroy(pLoadInfo->info.pFirstTs);
5,902,242✔
94
  taosArrayDestroy(pLoadInfo->info.pLastTs);
5,902,269✔
95

96
  pLoadInfo->info.pUid = NULL;
5,902,323✔
97
  pLoadInfo->info.pFirstKey = NULL;
5,902,323✔
98
  pLoadInfo->info.pLastKey = NULL;
5,902,323✔
99
  pLoadInfo->info.pCount = NULL;
5,902,323✔
100
  pLoadInfo->info.pFirstTs = NULL;
5,902,323✔
101
  pLoadInfo->info.pLastTs = NULL;
5,902,323✔
102

103
  taosArrayDestroy(pLoadInfo->aSttBlk);
5,902,323✔
104
  taosMemoryFree(pLoadInfo);
5,902,420!
105
}
106

107
void destroyLDataIter(SLDataIter *pIter) {
5,900,837✔
108
  tLDataIterClose2(pIter);
5,900,837✔
109
  destroySttBlockLoadInfo(pIter->pBlockLoadInfo);
5,902,475✔
110
  taosMemoryFree(pIter);
5,902,377!
111
}
5,902,482✔
112

113
void destroySttBlockReader(SArray *pLDataIterArray, SSttBlockLoadCostInfo *pLoadCost) {
11,401,270✔
114
  if (pLDataIterArray == NULL) {
11,401,270✔
115
    return;
38,321✔
116
  }
117

118
  int32_t numOfLevel = taosArrayGetSize(pLDataIterArray);
11,362,949✔
119
  for (int32_t i = 0; i < numOfLevel; ++i) {
17,261,401✔
120
    SArray *pList = taosArrayGetP(pLDataIterArray, i);
5,897,629✔
121
    for (int32_t j = 0; j < taosArrayGetSize(pList); ++j) {
11,800,059✔
122
      SLDataIter *pIter = taosArrayGetP(pList, j);
5,900,888✔
123
      if (pIter->pBlockLoadInfo != NULL) {
5,900,625!
124
        SSttBlockLoadCostInfo *pCost = &pIter->pBlockLoadInfo->cost;
5,900,688✔
125
        if (pLoadCost != NULL) {
5,900,688✔
126
          pLoadCost->loadBlocks += pCost->loadBlocks;
5,900,609✔
127
          pLoadCost->loadStatisBlocks += pCost->loadStatisBlocks;
5,900,609✔
128
          pLoadCost->blockElapsedTime += pCost->blockElapsedTime;
5,900,609✔
129
          pLoadCost->statisElapsedTime += pCost->statisElapsedTime;
5,900,609✔
130
        }
131
      }
132

133
      destroyLDataIter(pIter);
5,900,625✔
134
    }
135

136
    taosArrayDestroy(pList);
5,897,363✔
137
  }
138

139
  taosArrayDestroy(pLDataIterArray);
11,363,772✔
140
}
141

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

149
  pLoadInfo->currentLoadBlockIndex = nextSlotIndex;
4,496,307✔
150
}
4,496,307✔
151

152
static int32_t loadLastBlock(SLDataIter *pIter, const char *idStr, SBlockData **pResBlock) {
746,456,132✔
153
  if (pResBlock != NULL) {
746,456,132!
154
    *pResBlock = NULL;
746,584,405✔
155
  }
156

157
  int32_t            code = 0;
746,456,132✔
158
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
746,456,132✔
159

160
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
746,456,132✔
161
    if (pInfo->currentLoadBlockIndex != 0) {
554,852,271✔
162
      tsdbDebug("current load index is set to 0, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
23✔
163
                ", load data, %s",
164
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
165
      pInfo->currentLoadBlockIndex = 0;
23✔
166
    }
167

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

172
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
191,603,861!
173
    if (pInfo->currentLoadBlockIndex != 1) {
198,762,876✔
174
      tsdbDebug("current load index is set to 1, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
10✔
175
                ", load data, %s",
176
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
177
      pInfo->currentLoadBlockIndex = 1;
10✔
178
    }
179

180
    *pResBlock = &pInfo->blockData[1].data;
198,762,876✔
181
    return code;
198,762,876✔
182
  }
183

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

188
  updateBlockLoadSlot(pInfo);
4,496,968✔
189
  int64_t st = taosGetTimestampUs();
4,498,055✔
190

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

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

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

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

215
  *pResBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
4,498,963✔
216
  return code;
4,498,963✔
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;
4,994,167✔
223
  int32_t step = backward ? 1 : -1;
4,994,167✔
224
  while (i >= 0 && i < num && uid >= pBlockList[i].minUid && uid <= pBlockList[i].maxUid) {
10,015,073!
225
    i += step;
5,020,906✔
226
  }
227
  return i - step;
4,994,167✔
228
}
229

230
static int32_t binarySearchForStartBlock(SSttBlk *pBlockList, int32_t num, uint64_t uid, int32_t backward) {
12,469,523✔
231
  int32_t midPos = -1;
12,469,523✔
232
  if (num <= 0) {
12,469,523✔
233
    return -1;
2,239,452✔
234
  }
235

236
  int32_t firstPos = 0;
10,230,071✔
237
  int32_t lastPos = num - 1;
10,230,071✔
238

239
  // find the first position which is bigger than the key
240
  if ((uid > pBlockList[lastPos].maxUid) || (uid < pBlockList[firstPos].minUid)) {
10,230,071✔
241
    return -1;
5,235,675✔
242
  }
243

244
  while (1) {
353,279✔
245
    if (uid >= pBlockList[firstPos].minUid && uid <= pBlockList[firstPos].maxUid) {
5,347,675!
246
      return findEarliestIndex(firstPos, uid, pBlockList, num, backward);
4,920,460✔
247
    }
248

249
    if (uid > pBlockList[lastPos].maxUid || uid < pBlockList[firstPos].minUid) {
427,215✔
250
      return -1;
229✔
251
    }
252

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

256
    if (uid < pBlockList[midPos].minUid) {
426,986✔
257
      lastPos = midPos - 1;
177,114✔
258
    } else if (uid > pBlockList[midPos].maxUid) {
249,872✔
259
      firstPos = midPos + 1;
176,165✔
260
    } else {
261
      return findEarliestIndex(midPos, uid, pBlockList, num, backward);
73,707✔
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;
4,919,215✔
269
  int32_t step = backward ? 1 : -1;
4,919,215✔
270
  while (i >= 0 && i < num && uid == uidList[i]) {
68,427,073!
271
    i += step;
63,507,858✔
272
  }
273
  return i - step;
4,919,215✔
274
}
275

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

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

285
  while (1) {
841,626✔
286
    if (uid == uidList[firstPos]) {
5,806,326✔
287
      return findEarliestRow(firstPos, uid, uidList, num, backward);
4,385,587✔
288
    }
289

290
    if (uid > uidList[lastPos] || uid < uidList[firstPos]) {
1,420,739✔
291
      return -1;
45,485✔
292
    }
293

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

297
    if (uid < uidList[midPos]) {
1,375,254✔
298
      lastPos = midPos - 1;
313,744✔
299
    } else if (uid > uidList[midPos]) {
1,061,510✔
300
      firstPos = midPos + 1;
527,882✔
301
    } else {
302
      return findEarliestRow(midPos, uid, uidList, num, backward);
533,628✔
303
    }
304
  }
305
}
306

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

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

318
  // all identical
319
  if (pStart->suid == pEnd->suid) {
5,884,106✔
320
    if (pStart->suid != suid) {  // no qualified stt block existed
2,352,691✔
321
      taosArrayClear(pBlockLoadInfo->aSttBlk);
781,213✔
322
      pIter->iSttBlk = -1;
781,111✔
323
      return TSDB_CODE_SUCCESS;
781,111✔
324
    } else {  // all blocks are qualified
325
      taosArrayClear(pBlockLoadInfo->aSttBlk);
1,571,478✔
326
      px = taosArrayAddBatch(pBlockLoadInfo->aSttBlk, pArray->data, pArray->size);
1,571,459✔
327
      if (px == NULL) {
1,570,802!
328
        return terrno;
×
329
      }
330
    }
331
  } else {
332
    SArray *pTmp = taosArrayInit(TARRAY2_SIZE(pArray), sizeof(SSttBlk));
3,531,415✔
333
    if (pTmp == NULL) {
3,535,724!
334
      return terrno;
×
335
    }
336

337
    for (int32_t i = 0; i < TARRAY2_SIZE(pArray); ++i) {
12,821,677✔
338
      SSttBlk *p = &pArray->data[i];
10,458,390✔
339
      if (p->suid < suid) {
10,458,390✔
340
        continue;
6,062,095✔
341
      }
342

343
      if (p->suid == suid) {
4,396,295✔
344
        void *px = taosArrayPush(pTmp, p);
3,224,336✔
345
        if (px == NULL) {
3,224,336!
346
          code = terrno;
×
347
          break;
×
348
        }
349
      } else if (p->suid > suid) {
1,172,052!
350
        break;
1,172,554✔
351
      }
352
    }
353

354
    taosArrayDestroy(pBlockLoadInfo->aSttBlk);
3,535,841✔
355
    pBlockLoadInfo->aSttBlk = pTmp;
3,536,874✔
356
  }
357

358
  return code;
5,107,676✔
359
}
360

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

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

373
  return TSDB_CODE_SUCCESS;
2,100,715✔
374
}
375

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

384
  int32_t numOfBlocks = TARRAY2_SIZE(pStatisBlkArray);
5,895,500✔
385
  if (numOfBlocks <= 0) {
5,895,500✔
386
    return code;
9,772✔
387
  }
388

389
  while ((startIndex < numOfBlocks) && (pStatisBlkArray->data[startIndex].maxTbid.suid < suid)) {
6,579,272✔
390
    ++startIndex;
693,544✔
391
  }
392

393
  if (startIndex >= numOfBlocks || pStatisBlkArray->data[startIndex].minTbid.suid > suid) {
5,885,728✔
394
    return 0;
1,103,470✔
395
  }
396

397
  int32_t endIndex = startIndex;
4,782,258✔
398
  while (endIndex < numOfBlocks && pStatisBlkArray->data[endIndex].minTbid.suid <= suid) {
9,567,320✔
399
    ++endIndex;
4,785,062✔
400
  }
401

402
  int32_t num = endIndex - startIndex;
4,782,258✔
403
  pBlockLoadInfo->cost.loadStatisBlocks += num;
4,782,258✔
404

405
  STbStatisBlock block;
406
  code = tStatisBlockInit(&block);
4,782,258✔
407
  QUERY_CHECK_CODE(code, lino, _end);
4,782,079!
408

409
  int64_t st = taosGetTimestampUs();
4,781,948✔
410

411
  for (int32_t k = startIndex; k < endIndex; ++k) {
9,558,796✔
412
    code = tsdbSttFileReadStatisBlock(pSttFileReader, &pStatisBlkArray->data[k], &block);
4,782,475✔
413
    QUERY_CHECK_CODE(code, lino, _end);
4,785,288!
414

415
    int32_t i = 0;
4,785,288✔
416
    int32_t rows = block.numOfRecords;
4,785,288✔
417
    while (i < rows && ((int64_t *)block.suids.data)[i] != suid) {
10,567,179✔
418
      ++i;
5,781,891✔
419
    }
420

421
    // existed
422
    if (i < rows) {
4,785,288✔
423
      SSttTableRowsInfo *pInfo = &pBlockLoadInfo->info;
4,747,313✔
424

425
      if (pInfo->pUid == NULL) {
4,747,313✔
426
        pInfo->pUid = taosArrayInit(rows, sizeof(int64_t));
4,745,198✔
427
        pInfo->pFirstTs = taosArrayInit(rows, sizeof(int64_t));
4,745,455✔
428
        pInfo->pLastTs = taosArrayInit(rows, sizeof(int64_t));
4,745,575✔
429
        pInfo->pCount = taosArrayInit(rows, sizeof(int64_t));
4,745,642✔
430

431
        pInfo->pFirstKey = taosArrayInit(rows, sizeof(SValue));
4,745,469✔
432
        pInfo->pLastKey = taosArrayInit(rows, sizeof(SValue));
4,745,607✔
433

434
        if (pInfo->pUid == NULL || pInfo->pFirstTs == NULL || pInfo->pLastTs == NULL || pInfo->pCount == NULL ||
4,745,637!
435
            pInfo->pFirstKey == NULL || pInfo->pLastKey == NULL) {
4,745,677!
436
          code = terrno;
×
437
          goto _end;
×
438
        }
439
      }
440

441
      if (pStatisBlkArray->data[k].maxTbid.suid == suid) {
4,748,764✔
442
        int32_t size = rows - i;
3,617,164✔
443
        int32_t offset = i * sizeof(int64_t);
3,617,164✔
444

445
        px = taosArrayAddBatch(pInfo->pUid, tBufferGetDataAt(&block.uids, offset), size);
3,617,164✔
446
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
3,617,105!
447

448
        px = taosArrayAddBatch(pInfo->pFirstTs, tBufferGetDataAt(&block.firstKeyTimestamps, offset), size);
3,617,105✔
449
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
3,616,861!
450

451
        px = taosArrayAddBatch(pInfo->pLastTs, tBufferGetDataAt(&block.lastKeyTimestamps, offset), size);
3,616,861✔
452
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
3,616,592!
453

454
        px = taosArrayAddBatch(pInfo->pCount, tBufferGetDataAt(&block.counts, offset), size);
3,616,592✔
455
        TSDB_CHECK_NULL(px, code, lino, _end, terrno);
3,616,581✔
456

457
        if (block.numOfPKs > 0) {
3,616,327✔
458
          SValue vFirst = {0}, vLast = {0};
15,139✔
459
          for (int32_t f = i; f < rows; ++f) {
1,065,503✔
460
            code = tValueColumnGet(&block.firstKeyPKs[0], f, &vFirst);
1,050,362✔
461
            TSDB_CHECK_CODE(code, lino, _end);
1,050,440!
462

463
            code = tValueDupPayload(&vFirst);
1,050,440✔
464
            TSDB_CHECK_CODE(code, lino, _end);
1,050,453!
465

466
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
1,050,453✔
467
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,050,368!
468

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

473
            code = tValueDupPayload(&vLast);
1,050,405✔
474
            TSDB_CHECK_CODE(code, lino, _end);
1,050,399!
475

476
            px = taosArrayPush(pInfo->pLastKey, &vLast);
1,050,399✔
477
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,050,364!
478
          }
479
        } else {
480
          SValue vFirst = {0};
3,601,188✔
481
          for (int32_t j = 0; j < size; ++j) {
19,253,594✔
482
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
15,661,480✔
483
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
15,651,349!
484

485
            px = taosArrayPush(pInfo->pLastKey, &vFirst);
15,651,349✔
486
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
15,652,406!
487
          }
488
        }
489
      } else {
490
        STbStatisRecord record = {0};
1,131,600✔
491
        while (i < rows) {
2,559,177✔
492
          code = tStatisBlockGet(&block, i, &record);
2,559,176✔
493
          TSDB_CHECK_CODE(code, lino, _end);
2,559,081!
494

495
          if (record.suid != suid) {
2,559,081✔
496
            break;
1,131,617✔
497
          }
498

499
          px = taosArrayPush(pInfo->pUid, &record.uid);
1,427,464✔
500
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,512!
501

502
          px = taosArrayPush(pInfo->pCount, &record.count);
1,427,512✔
503
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,497!
504

505
          px = taosArrayPush(pInfo->pFirstTs, &record.firstKey.ts);
1,427,497✔
506
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,482!
507

508
          px = taosArrayPush(pInfo->pLastTs, &record.lastKey.ts);
1,427,482✔
509
          TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,474!
510

511
          if (record.firstKey.numOfPKs > 0) {
1,427,474!
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};
1,427,474✔
527
            px = taosArrayPush(pInfo->pFirstKey, &v);
1,427,474✔
528
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,588!
529

530
            px = taosArrayPush(pInfo->pLastKey, &v);
1,427,588✔
531
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,427,577!
532
          }
533

534
          i += 1;
1,427,577✔
535
        }
536
      }
537
    }
538
  }
539

540
_end:
4,776,321✔
541
  tStatisBlockDestroy(&block);
4,776,321✔
542
  if (code != 0) {
4,781,928!
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;
4,782,116✔
546
    pBlockLoadInfo->cost.statisElapsedTime += el;
4,782,116✔
547

548
    tsdbDebug("%s load %d statis blocks into buf, elapsed time:%.2fms", id, num, el);
4,782,116✔
549
  }
550
  return code;
4,781,984✔
551
}
552

553
static int32_t doLoadSttFilesBlk(SSttBlockLoadInfo *pBlockLoadInfo, SLDataIter *pIter, int64_t suid,
5,895,726✔
554
                                 _load_tomb_fn loadTombFn, void *pReader1, const char *idStr) {
555
  int64_t st = taosGetTimestampUs();
5,896,683✔
556

557
  const TSttBlkArray *pSttBlkArray = NULL;
5,896,683✔
558
  pBlockLoadInfo->sttBlockLoaded = true;
5,896,683✔
559

560
  // load the stt block info for each stt-block
561
  int32_t code = tsdbSttFileReadSttBlk(pIter->pReader, &pSttBlkArray);
5,896,683✔
562
  if (code != TSDB_CODE_SUCCESS) {
5,895,063!
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);
5,895,063✔
569
  if (code != TSDB_CODE_SUCCESS) {
5,898,345!
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;
5,898,345✔
576
  code = tsdbSttFileReadStatisBlk(pIter->pReader, (const TStatisBlkArray **)&pStatisBlkArray);
5,898,345✔
577
  if (code != TSDB_CODE_SUCCESS) {
5,898,215!
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);
5,898,215✔
584
  if (code != TSDB_CODE_SUCCESS) {
5,899,049!
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);
5,899,049✔
590

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

596
static int32_t uidComparFn(const void *p1, const void *p2) {
11,947,899✔
597
  const uint64_t *pFirst = p1;
11,947,899✔
598
  const uint64_t *pVal = p2;
11,947,899✔
599

600
  if (*pFirst == *pVal) {
11,947,899✔
601
    return 0;
4,953,700✔
602
  } else {
603
    return *pFirst < *pVal ? -1 : 1;
6,994,199✔
604
  }
605
}
606

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

613
  int32_t index = taosArraySearchIdx(pLoadInfo->info.pUid, &uid, uidComparFn, TD_EQ);
10,233,395✔
614
  if (index >= 0) {
10,234,976✔
615
    pRange->skey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pFirstTs, index);
4,954,070✔
616
    pRange->ekey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pLastTs, index);
4,952,401✔
617

618
    *numOfRows += *(int64_t *)taosArrayGet(pLoadInfo->info.pCount, index);
4,952,679✔
619

620
    if (pRange->skey.numOfPKs > 0) {
4,952,516✔
621
      memcpy(&pRange->skey.pks[0], taosArrayGet(pLoadInfo->info.pFirstKey, index), sizeof(SValue));
11,006✔
622
      memcpy(&pRange->ekey.pks[0], taosArrayGet(pLoadInfo->info.pLastKey, index), sizeof(SValue));
11,006✔
623
    }
624
  }
625
}
626

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

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

640
  pIter->pStartRowKey = pConf->pCurRowKey;
12,473,285✔
641
  pIter->pReader = pSttFileReader;
12,473,285✔
642
  pIter->pBlockLoadInfo = pBlockLoadInfo;
12,473,285✔
643

644
  // open stt file failed, ignore and continue
645
  if (pIter->pReader == NULL) {
12,473,285!
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) {
12,473,285✔
653
    code = doLoadSttFilesBlk(pBlockLoadInfo, pIter, pConf->suid, pConf->loadTombFn, pConf->pReader, idStr);
5,897,293✔
654
    if (code != TSDB_CODE_SUCCESS) {
5,898,467!
655
      return code;
×
656
    }
657
  }
658

659
  setSttInfoForCurrentTable(pBlockLoadInfo, pConf->uid, pKeyRange, numOfRows);
12,474,459✔
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);
12,471,126✔
664
  pIter->iSttBlk = binarySearchForStartBlock(pBlockLoadInfo->aSttBlk->pData, size, pConf->uid, backward);
12,470,359✔
665
  if (pIter->iSttBlk != -1) {
12,470,035✔
666
    pIter->pSttBlk = taosArrayGet(pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
4,998,650✔
667
    pIter->iRow = (pIter->backward) ? pIter->pSttBlk->nRow : -1;
4,997,756✔
668

669
    if ((!backward) && ((pConf->strictTimeRange && pIter->pSttBlk->minKey >= pIter->timeWindow.ekey) ||
4,997,756!
670
                        (!pConf->strictTimeRange && pIter->pSttBlk->minKey > pIter->timeWindow.ekey))) {
4,504,687✔
671
      pIter->pSttBlk = NULL;
333✔
672
    }
673

674
    if (backward && ((pConf->strictTimeRange && pIter->pSttBlk->maxKey <= pIter->timeWindow.skey) ||
4,997,756!
675
                     (!pConf->strictTimeRange && pIter->pSttBlk->maxKey < pIter->timeWindow.skey))) {
493,221!
676
      pIter->pSttBlk = NULL;
549✔
677
      pIter->ignoreEarlierTs = true;
549✔
678
    }
679
  }
680

681
  return code;
12,469,141✔
682
}
683

684
void tLDataIterClose2(SLDataIter *pIter) {
5,900,823✔
685
  tsdbSttFileReaderClose(&pIter->pReader);
5,900,823✔
686
  pIter->pReader = NULL;
5,902,481✔
687
}
5,902,481✔
688

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

693
  pIter->iSttBlk += step;
5,034,481✔
694

695
  int32_t index = -1;
5,034,481✔
696
  size_t  size = pIter->pBlockLoadInfo->aSttBlk->size;
5,034,481✔
697
  for (int32_t i = pIter->iSttBlk; i < size && i >= 0; i += step) {
5,034,776!
698
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, i);
175,875✔
699
    if ((!pIter->backward) && p->minUid > pIter->uid) {
175,872✔
700
      break;
113,013✔
701
    }
702

703
    if (pIter->backward && p->maxUid < pIter->uid) {
62,859✔
704
      break;
8,151✔
705
    }
706

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

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

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

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

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

735
  pIter->pSttBlk = NULL;
5,034,478✔
736
  if (index != -1) {
5,034,478✔
737
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, index);
54,245✔
738

739
    pIter->iSttBlk = index;
54,244✔
740
    pIter->pSttBlk = (SSttBlk *)taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
54,244✔
741
    tsdbDebug("try next stt-file block:%d from %d, trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
54,244✔
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);
4,980,233✔
746
  }
747
}
5,034,480✔
748

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

755
  int32_t code = loadLastBlock(pIter, idStr, &pData);
381,993,068✔
756
  if (code) {
377,456,063!
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) {
377,456,063✔
763
    i = binarySearchForStartRowIndex((uint64_t *)pData->aUid, pData->nRow, pIter->uid, pIter->backward);
4,965,384✔
764
    if (i == -1) {
4,966,011!
765
      tsdbDebug("failed to find the data in pBlockData, uid:%" PRIu64 " , %s", pIter->uid, idStr);
×
766
      pIter->iRow = -1;
45,508✔
767
      return code;
45,508✔
768
    }
769
  }
770

771
  for (; i < pData->nRow && i >= 0; i += step) {
382,786,431!
772
    if (pData->aUid != NULL) {
379,765,383✔
773
      if (!pIter->backward) {
377,650,360✔
774
        if (pData->aUid[i] > pIter->uid) {
354,261,173✔
775
          break;
645,461✔
776
        }
777
      } else {
778
        if (pData->aUid[i] < pIter->uid) {
23,389,187✔
779
          break;
29,867✔
780
        }
781
      }
782
    }
783

784
    int64_t ts = pData->aTSKEY[i];
379,090,055✔
785
    if (!pIter->backward) {               // asc
379,090,055✔
786
      if (ts > pIter->timeWindow.ekey) {  // no more data
355,462,167✔
787
        break;
289,811✔
788
      } else {
789
        if (ts < pIter->timeWindow.skey) {
355,172,356✔
790
          continue;
1,145,416✔
791
        }
792

793
        if (ts == pIter->timeWindow.skey && pIter->pStartRowKey->numOfPKs > 0) {
354,026,940✔
794
          SRowKey key;
795
          tColRowGetKey(pData, i, &key);
100,004!
796
          int32_t ret = pkCompEx(&key, pIter->pStartRowKey);
100,004✔
797
          if (ret < 0) {
100,004!
798
            continue;
×
799
          }
800
        }
801
      }
802
    } else {
803
      if (ts < pIter->timeWindow.skey) {
23,627,888✔
804
        break;
138,549✔
805
      } else {
806
        if (ts > pIter->timeWindow.ekey) {
23,489,339✔
807
          continue;
3,890,860✔
808
        }
809

810
        if (ts == pIter->timeWindow.ekey && pIter->pStartRowKey->numOfPKs > 0) {
19,598,479!
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];
373,625,419✔
822
    if (ver < pIter->verRange.minVer) {
373,625,419!
823
      continue;
×
824
    }
825

826
    // todo opt handle desc case
827
    if (ver > pIter->verRange.maxVer) {
373,625,419✔
828
      continue;
24✔
829
    }
830

831
    hasVal = true;
373,625,395✔
832
    break;
373,625,395✔
833
  }
834

835
  pIter->iRow = (hasVal) ? i : -1;
377,750,131✔
836
  return code;
377,750,131✔
837
}
838

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

846
  *hasNext = false;
388,428,172✔
847

848
  // no qualified last file block in current file, no need to fetch row
849
  if (pIter->pSttBlk == NULL) {
388,428,172✔
850
    return code;
7,475,952✔
851
  }
852

853
  code = loadLastBlock(pIter, idStr, &pBlockData);
380,952,220✔
854
  if (pBlockData == NULL || code != TSDB_CODE_SUCCESS) {
382,060,105!
855
    lino = __LINE__;
×
856
    goto _exit;
×
857
  }
858

859
  pIter->iRow += step;
382,275,467✔
860

861
  while (1) {
53,676✔
862
    bool skipBlock = false;
382,329,143✔
863
    code = findNextValidRow(pIter, idStr);
382,329,143✔
864
    TSDB_CHECK_CODE(code, lino, _exit);
378,141,621!
865

866
    if (pIter->pBlockLoadInfo->checkRemainingRow) {
378,141,621!
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) {
378,141,621!
890
      tLDataIterNextBlock(pIter, idStr);
4,934,912✔
891
      if (pIter->pSttBlk == NULL) {  // no more data
5,034,100✔
892
        goto _exit;
4,980,431✔
893
      }
894
    } else {
895
      break;
896
    }
897

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

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

910
  pIter->rInfo.suid = pBlockData->suid;
373,206,709✔
911
  pIter->rInfo.uid = pBlockData->uid;
373,206,709✔
912
  pIter->rInfo.row = tsdbRowFromBlockData(pBlockData, pIter->iRow);
373,206,709✔
913

914
_exit:
377,971,774✔
915
  if (code) {
377,971,774!
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);
378,023,536!
920
  return code;
378,023,536✔
921
}
922

923
// SMergeTree =================================================
924
static FORCE_INLINE int32_t tLDataIterCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
18,573,651✔
925
  SLDataIter *pIter1 = (SLDataIter *)(((uint8_t *)p1) - offsetof(SLDataIter, node));
18,697,112✔
926
  SLDataIter *pIter2 = (SLDataIter *)(((uint8_t *)p2) - offsetof(SLDataIter, node));
18,697,112✔
927

928
  SRowKey rkey1 = {0}, rkey2 = {0};
18,697,112✔
929
  tRowGetKeyEx(&pIter1->rInfo.row, &rkey1);
18,697,112!
930
  tRowGetKeyEx(&pIter2->rInfo.row, &rkey2);
18,866,020!
931

932
  int32_t ret = tRowKeyCompare(&rkey1, &rkey2);
18,850,327✔
933
  if (ret < 0) {
18,872,920✔
934
    return -1;
3,903,967✔
935
  } else if (ret > 0) {
14,968,953✔
936
    return 1;
6,083,458✔
937
  } else {
938
    int64_t ver1 = TSDBROW_VERSION(&pIter1->rInfo.row);
8,885,495!
939
    int64_t ver2 = TSDBROW_VERSION(&pIter2->rInfo.row);
8,885,495!
940

941
    if (ver1 < ver2) {
8,885,495✔
942
      return -1;
3,568,818✔
943
    } else if (ver1 > ver2) {
5,316,677!
944
      return 1;
5,676,368✔
945
    } else {
946
      return 0;
×
947
    }
948
  }
949
}
950

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

955
int32_t tMergeTreeOpen2(SMergeTree *pMTree, SMergeTreeConf *pConf, SSttDataInfoForTable *pSttDataInfo) {
12,938,081✔
956
  int32_t code = TSDB_CODE_SUCCESS;
12,938,081✔
957

958
  pMTree->pIter = NULL;
12,938,081✔
959
  pMTree->backward = pConf->backward;
12,938,081✔
960
  pMTree->idStr = pConf->idstr;
12,938,081✔
961
  int32_t lino = 0;
12,938,081✔
962

963
  if (!pMTree->backward) {  // asc
12,938,081✔
964
    tRBTreeCreate(&pMTree->rbt, tLDataIterCmprFn);
11,337,740✔
965
  } else {  // desc
966
    tRBTreeCreate(&pMTree->rbt, tLDataIterDescCmprFn);
1,600,341✔
967
  }
968

969
  pMTree->ignoreEarlierTs = false;
12,942,543✔
970

971
  // no data exists, go to end
972
  int32_t numOfLevels = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->size;
12,942,543✔
973
  if (numOfLevels == 0) {
12,942,543✔
974
    goto _end;
650,384✔
975
  }
976

977
  code = adjustSttDataIters(pConf->pSttFileBlockIterArray, pConf->pCurrentFileset);
12,292,159✔
978
  if (code) {
12,290,419!
979
    goto _end;
×
980
  }
981

982
  for (int32_t j = 0; j < numOfLevels; ++j) {
24,754,393✔
983
    SSttLvl *pSttLevel = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->data[j];
12,460,424✔
984
    SArray  *pList = taosArrayGetP(pConf->pSttFileBlockIterArray, j);
12,460,424✔
985

986
    for (int32_t i = 0; i < TARRAY2_SIZE(pSttLevel->fobjArr); ++i) {  // open all last file
24,934,368✔
987
      SLDataIter *pIter = taosArrayGetP(pList, i);
12,470,394✔
988

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

998
        code = tsdbSttFileReaderOpen(pSttLevel->fobjArr->data[i]->fname, &conf, &pSttFileReader);
5,896,972✔
999
        if (code != TSDB_CODE_SUCCESS) {
5,895,387!
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) {
12,468,453✔
1006
        code = tCreateSttBlockLoadInfo(pConf->pSchema, pConf->pCols, pConf->numOfCols, &pLoadInfo);
5,898,345✔
1007
        if (code != TSDB_CODE_SUCCESS) {
5,897,089!
1008
          goto _end;
×
1009
        }
1010
      }
1011

1012
      memset(pIter, 0, sizeof(SLDataIter));
12,467,197✔
1013

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

1018
      code = tLDataIterOpen2(pIter, pSttFileReader, cid, pMTree->backward, pConf, pLoadInfo, &range, &numOfRows,
12,467,197✔
1019
                             pMTree->idStr);
1020
      if (code != TSDB_CODE_SUCCESS) {
12,469,832!
1021
        goto _end;
×
1022
      }
1023

1024
      bool hasVal = NULL;
12,469,832✔
1025
      code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
12,469,832✔
1026
      if (code) {
12,473,464!
1027
        goto _end;
×
1028
      }
1029

1030
      if (hasVal) {
12,473,464✔
1031
        tMergeTreeAddIter(pMTree, pIter);
4,948,478✔
1032

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

1038
          pSttDataInfo->numOfRows += numOfRows;
4,947,071✔
1039
        }
1040
      } else {
1041
        if (!pMTree->ignoreEarlierTs) {
7,524,986✔
1042
          pMTree->ignoreEarlierTs = pIter->ignoreEarlierTs;
7,524,916✔
1043
        }
1044
      }
1045
    }
1046
  }
1047

1048
  return code;
12,293,969✔
1049

1050
_end:
650,384✔
1051
  tMergeTreeClose(pMTree);
650,384✔
1052
  return code;
650,267✔
1053
}
1054

1055
void tMergeTreeAddIter(SMergeTree *pMTree, SLDataIter *pIter) {
4,947,374✔
1056
  SRBTreeNode *node = tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pIter);
4,947,374✔
1057
}
4,947,855✔
1058

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

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

1064
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
233,279,949✔
1065
    pInfo->blockData[0].pin = true;
136,031,292✔
1066
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
136,031,292✔
1067
    return;
136,034,142✔
1068
  }
1069

1070
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
97,248,657!
1071
    pInfo->blockData[1].pin = true;
100,889,122✔
1072
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
100,889,122!
1073
    return;
100,896,627✔
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) {
226,438,429✔
1080
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
226,438,429✔
1081
  if (pInfo->blockData[0].pin) {
226,438,429✔
1082
    pInfo->blockData[0].pin = false;
133,462,341✔
1083
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[0].sttBlockIndex, pIter->cid, id);
133,462,341✔
1084
    return;
133,467,718✔
1085
  }
1086

1087
  if (pInfo->blockData[1].pin) {
92,976,088!
1088
    pInfo->blockData[1].pin = false;
98,595,553✔
1089
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[1].sttBlockIndex, pIter->cid, id);
98,595,553!
1090
    return;
98,606,024✔
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) {
233,285,184✔
1097
  if (pMTree->pIter == NULL) {
233,285,184!
1098
    return;
×
1099
  }
1100

1101
  SLDataIter *pIter = pMTree->pIter;
233,285,184✔
1102
  pMTree->pPinnedBlockIter = pIter;
233,285,184✔
1103
  tLDataIterPinSttBlock(pIter, pMTree->idStr);
233,285,184✔
1104
}
1105

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

1111
  SLDataIter *pIter = pMTree->pPinnedBlockIter;
226,483,302✔
1112
  pMTree->pPinnedBlockIter = NULL;
226,483,302✔
1113
  tLDataIterUnpinSttBlock(pIter, pMTree->idStr);
226,483,302✔
1114
}
1115

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

1122
  *pHasNext = false;
388,421,995✔
1123
  if (pMTree->pIter) {
388,421,995✔
1124
    SLDataIter *pIter = pMTree->pIter;
375,695,221✔
1125
    bool        hasVal = false;
375,695,221✔
1126
    code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
375,695,221✔
1127
    if (!hasVal || (code != 0)) {
372,807,731✔
1128
      if (code == TSDB_CODE_FILE_CORRUPTED) {
4,930,012!
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;
4,930,012✔
1133
    }
1134

1135
    // compare with min in RB Tree
1136
    pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
372,807,731✔
1137
    if (pMTree->pIter && pIter) {
372,807,731✔
1138
      int32_t c = pMTree->rbt.cmprFn(&pMTree->pIter->node, &pIter->node);
3,642,507✔
1139
      if (c > 0) {
3,644,847✔
1140
        (void)tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
3,591,764✔
1141
        pMTree->pIter = NULL;
3,456,456✔
1142
      } else if (!c) {
53,083!
1143
        return TSDB_CODE_INTERNAL_ERROR;
×
1144
      }
1145
    }
1146
  }
1147

1148
  if (pMTree->pIter == NULL) {
385,401,537✔
1149
    pMTree->pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
21,303,837✔
1150
    if (pMTree->pIter) {
21,303,837✔
1151
      tRBTreeDrop(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
8,383,972✔
1152
    }
1153
  }
1154

1155
  *pHasNext = (pMTree->pIter != NULL);
385,553,948✔
1156
  return code;
385,553,948✔
1157
}
1158

1159
void tMergeTreeClose(SMergeTree *pMTree) {
23,216,511✔
1160
  pMTree->pIter = NULL;
23,216,511✔
1161
  pMTree->pPinnedBlockIter = NULL;
23,216,511✔
1162
}
23,216,511✔
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