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

taosdata / TDengine / #3523

06 Nov 2024 02:29AM UTC coverage: 55.861% (-2.4%) from 58.216%
#3523

push

travis-ci

web-flow
Merge pull request #28551 from taosdata/feat/TS-5215-2

test(blob): testing & fixes for blob

106075 of 245834 branches covered (43.15%)

Branch coverage included in aggregate %.

0 of 15 new or added lines in 2 files covered. (0.0%)

17003 existing lines in 254 files now uncovered.

181910 of 269703 relevant lines covered (67.45%)

1527639.59 hits per line

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

82.78
/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) {
52,673✔
27
  *pInfo = NULL;
52,673✔
28

29
  SSttBlockLoadInfo *pLoadInfo = taosMemoryCalloc(1, sizeof(SSttBlockLoadInfo));
52,673✔
30
  if (pLoadInfo == NULL) {
52,723✔
31
    return terrno;
1✔
32
  }
33

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

37
  pLoadInfo->currentLoadBlockIndex = 1;
52,722✔
38

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

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

51
  pLoadInfo->aSttBlk = taosArrayInit(4, sizeof(SSttBlk));
52,730✔
52
  if (pLoadInfo->aSttBlk == NULL) {
52,731✔
53
    taosMemoryFreeClear(pLoadInfo);
6!
54
    return terrno;
6✔
55
  }
56

57
  pLoadInfo->pSchema = pSchema;
52,725✔
58
  pLoadInfo->colIds = colList;
52,725✔
59
  pLoadInfo->numOfCols = numOfCols;
52,725✔
60

61
  *pInfo = pLoadInfo;
52,725✔
62
  return code;
52,725✔
63
}
64

65
static void freeItem(void *pValue) {
179,505✔
66
  SValue *p = (SValue *)pValue;
179,505✔
67
  if (IS_VAR_DATA_TYPE(p->type)) {
179,505!
68
    taosMemoryFree(p->pData);
4✔
69
  }
70
}
179,507✔
71

72
void destroySttBlockLoadInfo(SSttBlockLoadInfo *pLoadInfo) {
52,737✔
73
  if (pLoadInfo == NULL) {
52,737✔
74
    return;
7✔
75
  }
76

77
  pLoadInfo->currentLoadBlockIndex = 1;
52,730✔
78

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

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

89
  taosArrayDestroy(pLoadInfo->info.pUid);
52,731✔
90
  taosArrayDestroyEx(pLoadInfo->info.pFirstKey, freeItem);
52,726✔
91
  taosArrayDestroyEx(pLoadInfo->info.pLastKey, freeItem);
52,724✔
92
  taosArrayDestroy(pLoadInfo->info.pCount);
52,728✔
93
  taosArrayDestroy(pLoadInfo->info.pFirstTs);
52,731✔
94
  taosArrayDestroy(pLoadInfo->info.pLastTs);
52,724✔
95

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

103
  taosArrayDestroy(pLoadInfo->aSttBlk);
52,727✔
104
  taosMemoryFree(pLoadInfo);
52,731✔
105
}
106

107
void destroyLDataIter(SLDataIter *pIter) {
52,733✔
108
  tLDataIterClose2(pIter);
52,733✔
109
  destroySttBlockLoadInfo(pIter->pBlockLoadInfo);
52,738✔
110
  taosMemoryFree(pIter);
52,738✔
111
}
52,738✔
112

113
void destroySttBlockReader(SArray *pLDataIterArray, SSttBlockLoadCostInfo *pLoadCost) {
188,168✔
114
  if (pLDataIterArray == NULL) {
188,168✔
115
    return;
274✔
116
  }
117

118
  int32_t numOfLevel = taosArrayGetSize(pLDataIterArray);
187,894✔
119
  for (int32_t i = 0; i < numOfLevel; ++i) {
240,527✔
120
    SArray *pList = taosArrayGetP(pLDataIterArray, i);
52,612✔
121
    for (int32_t j = 0; j < taosArrayGetSize(pList); ++j) {
105,352✔
122
      SLDataIter *pIter = taosArrayGetP(pList, j);
52,734✔
123
      if (pIter->pBlockLoadInfo != NULL) {
52,732✔
124
        SSttBlockLoadCostInfo *pCost = &pIter->pBlockLoadInfo->cost;
52,725✔
125
        if (pLoadCost != NULL) {
52,725✔
126
          pLoadCost->loadBlocks += pCost->loadBlocks;
52,689✔
127
          pLoadCost->loadStatisBlocks += pCost->loadStatisBlocks;
52,689✔
128
          pLoadCost->blockElapsedTime += pCost->blockElapsedTime;
52,689✔
129
          pLoadCost->statisElapsedTime += pCost->statisElapsedTime;
52,689✔
130
        }
131
      }
132

133
      destroyLDataIter(pIter);
52,732✔
134
    }
135

136
    taosArrayDestroy(pList);
52,600✔
137
  }
138

139
  taosArrayDestroy(pLDataIterArray);
187,915✔
140
}
141

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

149
  pLoadInfo->currentLoadBlockIndex = nextSlotIndex;
46,967✔
150
}
46,967✔
151

152
static int32_t loadLastBlock(SLDataIter *pIter, const char *idStr, SBlockData **pResBlock) {
4,477,489✔
153
  if (pResBlock != NULL) {
4,477,489!
154
    *pResBlock = NULL;
4,477,517✔
155
  }
156

157
  int32_t            code = 0;
4,477,489✔
158
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
4,477,489✔
159

160
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
4,477,489✔
161
    if (pInfo->currentLoadBlockIndex != 0) {
3,624,067✔
162
      tsdbDebug("current load index is set to 0, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
1!
163
                ", load data, %s",
164
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
165
      pInfo->currentLoadBlockIndex = 0;
1✔
166
    }
167

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

172
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
853,422✔
173
    if (pInfo->currentLoadBlockIndex != 1) {
807,291!
UNCOV
174
      tsdbDebug("current load index is set to 1, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
×
175
                ", load data, %s",
176
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
UNCOV
177
      pInfo->currentLoadBlockIndex = 1;
×
178
    }
179

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

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

188
  updateBlockLoadSlot(pInfo);
46,968✔
189
  int64_t st = taosGetTimestampUs();
46,973✔
190

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

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

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

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

215
  *pResBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
46,959✔
216
  return code;
46,959✔
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;
112,313✔
223
  int32_t step = backward ? 1 : -1;
112,313✔
224
  while (i >= 0 && i < num && uid >= pBlockList[i].minUid && uid <= pBlockList[i].maxUid) {
229,632!
225
    i += step;
117,319✔
226
  }
227
  return i - step;
112,313✔
228
}
229

230
static int32_t binarySearchForStartBlock(SSttBlk *pBlockList, int32_t num, uint64_t uid, int32_t backward) {
203,037✔
231
  int32_t midPos = -1;
203,037✔
232
  if (num <= 0) {
203,037✔
233
    return -1;
30,487✔
234
  }
235

236
  int32_t firstPos = 0;
172,550✔
237
  int32_t lastPos = num - 1;
172,550✔
238

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

244
  while (1) {
415,436✔
245
    if (uid >= pBlockList[firstPos].minUid && uid <= pBlockList[firstPos].maxUid) {
527,749!
246
      return findEarliestIndex(firstPos, uid, pBlockList, num, backward);
66,221✔
247
    }
248

249
    if (uid > pBlockList[lastPos].maxUid || uid < pBlockList[firstPos].minUid) {
461,528!
UNCOV
250
      return -1;
×
251
    }
252

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

256
    if (uid < pBlockList[midPos].minUid) {
461,528✔
257
      lastPos = midPos - 1;
211,700✔
258
    } else if (uid > pBlockList[midPos].maxUid) {
249,828✔
259
      firstPos = midPos + 1;
203,736✔
260
    } else {
261
      return findEarliestIndex(midPos, uid, pBlockList, num, backward);
46,092✔
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;
56,697✔
269
  int32_t step = backward ? 1 : -1;
56,697✔
270
  while (i >= 0 && i < num && uid == uidList[i]) {
16,944,026!
271
    i += step;
16,887,329✔
272
  }
273
  return i - step;
56,697✔
274
}
275

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

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

285
  while (1) {
574,621✔
286
    if (uid == uidList[firstPos]) {
685,990✔
287
      return findEarliestRow(firstPos, uid, uidList, num, backward);
27,654✔
288
    }
289

290
    if (uid > uidList[lastPos] || uid < uidList[firstPos]) {
658,336✔
291
      return -1;
54,672✔
292
    }
293

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

297
    if (uid < uidList[midPos]) {
603,664✔
298
      lastPos = midPos - 1;
269,030✔
299
    } else if (uid > uidList[midPos]) {
334,634✔
300
      firstPos = midPos + 1;
305,591✔
301
    } else {
302
      return findEarliestRow(midPos, uid, uidList, num, backward);
29,043✔
303
    }
304
  }
305
}
306

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

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

318
  // all identical
319
  if (pStart->suid == pEnd->suid) {
46,793✔
320
    if (pStart->suid != suid) {  // no qualified stt block existed
11,590✔
321
      taosArrayClear(pBlockLoadInfo->aSttBlk);
6,895✔
322
      pIter->iSttBlk = -1;
6,894✔
323
      return TSDB_CODE_SUCCESS;
6,894✔
324
    } else {  // all blocks are qualified
325
      taosArrayClear(pBlockLoadInfo->aSttBlk);
4,695✔
326
      px = taosArrayAddBatch(pBlockLoadInfo->aSttBlk, pArray->data, pArray->size);
4,694✔
327
      if (px == NULL) {
4,694!
328
        return terrno;
×
329
      }
330
    }
331
  } else {
332
    SArray *pTmp = taosArrayInit(TARRAY2_SIZE(pArray), sizeof(SSttBlk));
35,203✔
333
    if (pTmp == NULL) {
35,215✔
334
      return terrno;
2✔
335
    }
336

337
    for (int32_t i = 0; i < TARRAY2_SIZE(pArray); ++i) {
128,407✔
338
      SSttBlk *p = &pArray->data[i];
99,433✔
339
      if (p->suid < suid) {
99,433✔
340
        continue;
67,645✔
341
      }
342

343
      if (p->suid == suid) {
31,788✔
344
        void *px = taosArrayPush(pTmp, p);
25,550✔
345
        if (px == NULL) {
25,550!
346
          code = terrno;
×
347
          break;
×
348
        }
349
      } else if (p->suid > suid) {
6,238!
350
        break;
6,239✔
351
      }
352
    }
353

354
    taosArrayDestroy(pBlockLoadInfo->aSttBlk);
35,213✔
355
    pBlockLoadInfo->aSttBlk = pTmp;
35,212✔
356
  }
357

358
  return code;
39,906✔
359
}
360

361
static int32_t tValueDupPayload(SValue *pVal) {
106,796✔
362
  if (IS_VAR_DATA_TYPE(pVal->type)) {
106,796!
363
    char *p = (char *)pVal->pData;
6✔
364
    char *pBuf = taosMemoryMalloc(pVal->nData);
6✔
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;
106,796✔
374
}
375

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

384
  int32_t numOfBlocks = TARRAY2_SIZE(pStatisBlkArray);
47,790✔
385
  if (numOfBlocks <= 0) {
47,790✔
386
    return code;
996✔
387
  }
388

389
  while ((startIndex < numOfBlocks) && (pStatisBlkArray->data[startIndex].maxTbid.suid < suid)) {
63,260✔
390
    ++startIndex;
16,466✔
391
  }
392

393
  if (startIndex >= numOfBlocks || pStatisBlkArray->data[startIndex].minTbid.suid > suid) {
46,794✔
394
    return 0;
16,612✔
395
  }
396

397
  int32_t endIndex = startIndex;
30,182✔
398
  while (endIndex < numOfBlocks && pStatisBlkArray->data[endIndex].minTbid.suid <= suid) {
60,385✔
399
    ++endIndex;
30,203✔
400
  }
401

402
  int32_t num = endIndex - startIndex;
30,182✔
403
  pBlockLoadInfo->cost.loadStatisBlocks += num;
30,182✔
404

405
  STbStatisBlock block;
406
  code = tStatisBlockInit(&block);
30,182✔
407
  QUERY_CHECK_CODE(code, lino, _end);
30,179!
408

409
  int64_t st = taosGetTimestampUs();
30,179✔
410

411
  for (int32_t k = startIndex; k < endIndex; ++k) {
60,364✔
412
    code = tsdbSttFileReadStatisBlock(pSttFileReader, &pStatisBlkArray->data[k], &block);
30,199✔
413
    QUERY_CHECK_CODE(code, lino, _end);
30,206✔
414

415
    int32_t i = 0;
30,194✔
416
    int32_t rows = block.numOfRecords;
30,194✔
417
    while (i < rows && ((int64_t *)block.suids.data)[i] != suid) {
77,861✔
418
      ++i;
47,667✔
419
    }
420

421
    // existed
422
    if (i < rows) {
30,194✔
423
      SSttTableRowsInfo *pInfo = &pBlockLoadInfo->info;
29,861✔
424

425
      if (pInfo->pUid == NULL) {
29,861✔
426
        pInfo->pUid = taosArrayInit(rows, sizeof(int64_t));
29,837✔
427
        pInfo->pFirstTs = taosArrayInit(rows, sizeof(int64_t));
29,838✔
428
        pInfo->pLastTs = taosArrayInit(rows, sizeof(int64_t));
29,838✔
429
        pInfo->pCount = taosArrayInit(rows, sizeof(int64_t));
29,838✔
430

431
        pInfo->pFirstKey = taosArrayInit(rows, sizeof(SValue));
29,838✔
432
        pInfo->pLastKey = taosArrayInit(rows, sizeof(SValue));
29,838✔
433

434
        if (pInfo->pUid == NULL || pInfo->pFirstTs == NULL || pInfo->pLastTs == NULL || pInfo->pCount == NULL ||
29,838!
435
            pInfo->pFirstKey == NULL || pInfo->pLastKey == NULL) {
29,833✔
436
          code = terrno;
9✔
437
          goto _end;
9✔
438
        }
439
      }
440

441
      if (pStatisBlkArray->data[k].maxTbid.suid == suid) {
29,853✔
442
        int32_t size = rows - i;
24,329✔
443
        int32_t offset = i * sizeof(int64_t);
24,329✔
444

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

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

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

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

457
        if (block.numOfPKs > 0) {
24,328✔
458
          SValue vFirst = {0}, vLast = {0};
171✔
459
          for (int32_t f = i; f < rows; ++f) {
53,569✔
460
            code = tValueColumnGet(&block.firstKeyPKs[0], f, &vFirst);
53,398✔
461
            TSDB_CHECK_CODE(code, lino, _end);
53,398!
462

463
            code = tValueDupPayload(&vFirst);
53,398✔
464
            TSDB_CHECK_CODE(code, lino, _end);
53,398!
465

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

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

473
            code = tValueDupPayload(&vLast);
53,398✔
474
            TSDB_CHECK_CODE(code, lino, _end);
53,398!
475

476
            px = taosArrayPush(pInfo->pLastKey, &vLast);
53,398✔
477
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
53,398!
478
          }
479
        } else {
480
          SValue vFirst = {0};
24,157✔
481
          for (int32_t j = 0; j < size; ++j) {
51,835✔
482
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
27,678✔
483
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
27,677!
484

485
            px = taosArrayPush(pInfo->pLastKey, &vFirst);
27,677✔
486
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
27,678!
487
          }
488
        }
489
      } else {
490
        STbStatisRecord record = {0};
5,524✔
491
        while (i < rows) {
14,203!
492
          code = tStatisBlockGet(&block, i, &record);
14,203✔
493
          TSDB_CHECK_CODE(code, lino, _end);
14,203!
494

495
          if (record.suid != suid) {
14,203✔
496
            break;
5,524✔
497
          }
498

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

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

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

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

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

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

534
          i += 1;
8,679✔
535
        }
536
      }
537
    }
538
  }
539

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

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

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

557
  const TSttBlkArray *pSttBlkArray = NULL;
47,795✔
558
  pBlockLoadInfo->sttBlockLoaded = true;
47,795✔
559

560
  // load the stt block info for each stt-block
561
  int32_t code = tsdbSttFileReadSttBlk(pIter->pReader, &pSttBlkArray);
47,795✔
562
  if (code != TSDB_CODE_SUCCESS) {
47,798!
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);
47,798✔
569
  if (code != TSDB_CODE_SUCCESS) {
47,799✔
570
    tsdbError("load stt block info failed, code:%s, %s", tstrerror(code), idStr);
2!
571
    return code;
2✔
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;
47,797✔
576
  code = tsdbSttFileReadStatisBlk(pIter->pReader, (const TStatisBlkArray **)&pStatisBlkArray);
47,797✔
577
  if (code != TSDB_CODE_SUCCESS) {
47,800✔
578
    tsdbError("failed to load stt block statistics, code:%s, %s", tstrerror(code), idStr);
1!
579
    return code;
1✔
580
  }
581

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

589
  code = loadTombFn(pReader1, pIter->pReader, pIter->pBlockLoadInfo);
47,778✔
590

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

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

600
  if (*pFirst == *pVal) {
753,015✔
601
    return 0;
57,659✔
602
  } else {
603
    return *pFirst < *pVal ? -1 : 1;
695,356✔
604
  }
605
}
606

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

613
  int32_t index = taosArraySearchIdx(pLoadInfo->info.pUid, &uid, uidComparFn, TD_EQ);
172,559✔
614
  if (index >= 0) {
172,566✔
615
    pRange->skey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pFirstTs, index);
57,660✔
616
    pRange->ekey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pLastTs, index);
57,655✔
617

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

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

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

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

640
  pIter->pStartRowKey = pConf->pCurRowKey;
203,079✔
641
  pIter->pReader = pSttFileReader;
203,079✔
642
  pIter->pBlockLoadInfo = pBlockLoadInfo;
203,079✔
643

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

652
  if (!pBlockLoadInfo->sttBlockLoaded) {
203,072✔
653
    code = doLoadSttFilesBlk(pBlockLoadInfo, pIter, pConf->suid, pConf->loadTombFn, pConf->pReader, idStr);
47,802✔
654
    if (code != TSDB_CODE_SUCCESS) {
47,798✔
655
      return code;
24✔
656
    }
657
  }
658

659
  setSttInfoForCurrentTable(pBlockLoadInfo, pConf->uid, pKeyRange, numOfRows);
203,044✔
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);
203,040✔
664
  pIter->iSttBlk = binarySearchForStartBlock(pBlockLoadInfo->aSttBlk->pData, size, pConf->uid, backward);
203,039✔
665
  if (pIter->iSttBlk != -1) {
203,034✔
666
    pIter->pSttBlk = taosArrayGet(pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
112,331✔
667
    pIter->iRow = (pIter->backward) ? pIter->pSttBlk->nRow : -1;
112,331✔
668

669
    if ((!backward) && ((pConf->strictTimeRange && pIter->pSttBlk->minKey >= pIter->timeWindow.ekey) ||
112,331!
670
                        (!pConf->strictTimeRange && pIter->pSttBlk->minKey > pIter->timeWindow.ekey))) {
107,508✔
671
      pIter->pSttBlk = NULL;
1✔
672
    }
673

674
    if (backward && ((pConf->strictTimeRange && pIter->pSttBlk->maxKey <= pIter->timeWindow.skey) ||
112,331!
675
                     (!pConf->strictTimeRange && pIter->pSttBlk->maxKey < pIter->timeWindow.skey))) {
4,824!
676
      pIter->pSttBlk = NULL;
10✔
677
      pIter->ignoreEarlierTs = true;
10✔
678
    }
679
  }
680

681
  return code;
203,034✔
682
}
683

684
void tLDataIterClose2(SLDataIter *pIter) {
52,732✔
685
  tsdbSttFileReaderClose(&pIter->pReader);
52,732✔
686
  pIter->pReader = NULL;
52,738✔
687
}
52,738✔
688

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

693
  pIter->iSttBlk += step;
86,048✔
694

695
  int32_t index = -1;
86,048✔
696
  size_t  size = pIter->pBlockLoadInfo->aSttBlk->size;
86,048✔
697
  for (int32_t i = pIter->iSttBlk; i < size && i >= 0; i += step) {
86,051!
698
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, i);
55,566✔
699
    if ((!pIter->backward) && p->minUid > pIter->uid) {
55,566✔
700
      break;
55,343✔
701
    }
702

703
    if (pIter->backward && p->maxUid < pIter->uid) {
223✔
704
      break;
34✔
705
    }
706

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

713
      if (pIter->backward && p->maxKey < pIter->timeWindow.skey) {
189!
714
        break;
×
715
      }
716

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

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

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

735
  pIter->pSttBlk = NULL;
86,048✔
736
  if (index != -1) {
86,048✔
737
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, index);
186✔
738

739
    pIter->iSttBlk = index;
186✔
740
    pIter->pSttBlk = (SSttBlk *)taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
186✔
741
    tsdbDebug("try next stt-file block:%d from %d, trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
186✔
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);
85,862✔
746
  }
747
}
86,048✔
748

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

755
  int32_t code = loadLastBlock(pIter, idStr, &pData);
2,240,922✔
756
  if (code) {
2,239,949!
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) {
2,239,949✔
763
    i = binarySearchForStartRowIndex((uint64_t *)pData->aUid, pData->nRow, pIter->uid, pIter->backward);
111,369✔
764
    if (i == -1) {
111,370✔
765
      tsdbDebug("failed to find the data in pBlockData, uid:%" PRIu64 " , %s", pIter->uid, idStr);
54,610✔
766
      pIter->iRow = -1;
54,672✔
767
      return code;
54,672✔
768
    }
769
  }
770

771
  for (; i < pData->nRow && i >= 0; i += step) {
2,197,741✔
772
    if (pData->aUid != NULL) {
2,173,577✔
773
      if (!pIter->backward) {
2,028,281✔
774
        if (pData->aUid[i] > pIter->uid) {
1,873,523✔
775
          break;
4,581✔
776
        }
777
      } else {
778
        if (pData->aUid[i] < pIter->uid) {
154,758✔
779
          break;
253✔
780
        }
781
      }
782
    }
783

784
    int64_t ts = pData->aTSKEY[i];
2,168,743✔
785
    if (!pIter->backward) {               // asc
2,168,743✔
786
      if (ts > pIter->timeWindow.ekey) {  // no more data
1,978,168✔
787
        break;
1,205✔
788
      } else {
789
        if (ts < pIter->timeWindow.skey) {
1,976,963✔
790
          continue;
2,161✔
791
        }
792

793
        if (ts == pIter->timeWindow.skey && pIter->pStartRowKey->numOfPKs > 0) {
1,974,802✔
794
          SRowKey key;
795
          tColRowGetKey(pData, i, &key);
4!
796
          int32_t ret = pkCompEx(&key, pIter->pStartRowKey);
4✔
797
          if (ret < 0) {
4!
798
            continue;
×
799
          }
800
        }
801
      }
802
    } else {
803
      if (ts < pIter->timeWindow.skey) {
190,575✔
804
        break;
569✔
805
      } else {
806
        if (ts > pIter->timeWindow.ekey) {
190,006✔
807
          continue;
10,226✔
808
        }
809

810
        if (ts == pIter->timeWindow.ekey && pIter->pStartRowKey->numOfPKs > 0) {
179,780!
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];
2,154,582✔
822
    if (ver < pIter->verRange.minVer) {
2,154,582!
823
      continue;
×
824
    }
825

826
    // todo opt handle desc case
827
    if (ver > pIter->verRange.maxVer) {
2,154,582✔
828
      continue;
14✔
829
    }
830

831
    hasVal = true;
2,154,568✔
832
    break;
2,154,568✔
833
  }
834

835
  pIter->iRow = (hasVal) ? i : -1;
2,185,340✔
836
  return code;
2,185,340✔
837
}
838

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

846
  *hasNext = false;
2,330,884✔
847

848
  // no qualified last file block in current file, no need to fetch row
849
  if (pIter->pSttBlk == NULL) {
2,330,884✔
850
    return code;
90,738✔
851
  }
852

853
  code = loadLastBlock(pIter, idStr, &pBlockData);
2,240,146✔
854
  if (pBlockData == NULL || code != TSDB_CODE_SUCCESS) {
2,240,765!
855
    lino = __LINE__;
×
856
    goto _exit;
×
857
  }
858

859
  pIter->iRow += step;
2,240,771✔
860

861
  while (1) {
185✔
862
    bool skipBlock = false;
2,240,956✔
863
    code = findNextValidRow(pIter, idStr);
2,240,956✔
864
    TSDB_CHECK_CODE(code, lino, _exit);
2,240,340!
865

866
    if (pIter->pBlockLoadInfo->checkRemainingRow) {
2,240,340!
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) {
2,240,340!
890
      tLDataIterNextBlock(pIter, idStr);
85,977✔
891
      if (pIter->pSttBlk == NULL) {  // no more data
86,049✔
892
        goto _exit;
85,863✔
893
      }
894
    } else {
895
      break;
896
    }
897

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

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

910
  pIter->rInfo.suid = pBlockData->suid;
2,154,363✔
911
  pIter->rInfo.uid = pBlockData->uid;
2,154,363✔
912
  pIter->rInfo.row = tsdbRowFromBlockData(pBlockData, pIter->iRow);
2,154,363✔
913

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

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

923
// SMergeTree =================================================
924
static FORCE_INLINE int32_t tLDataIterCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
821✔
925
  SLDataIter *pIter1 = (SLDataIter *)(((uint8_t *)p1) - offsetof(SLDataIter, node));
1,211✔
926
  SLDataIter *pIter2 = (SLDataIter *)(((uint8_t *)p2) - offsetof(SLDataIter, node));
1,211✔
927

928
  SRowKey rkey1 = {0}, rkey2 = {0};
1,211✔
929
  tRowGetKeyEx(&pIter1->rInfo.row, &rkey1);
1,211!
930
  tRowGetKeyEx(&pIter2->rInfo.row, &rkey2);
1,211!
931

932
  int32_t ret = tRowKeyCompare(&rkey1, &rkey2);
1,211✔
933
  if (ret < 0) {
1,211✔
934
    return -1;
640✔
935
  } else if (ret > 0) {
571✔
936
    return 1;
561✔
937
  } else {
938
    int64_t ver1 = TSDBROW_VERSION(&pIter1->rInfo.row);
10!
939
    int64_t ver2 = TSDBROW_VERSION(&pIter2->rInfo.row);
10!
940

941
    if (ver1 < ver2) {
10!
942
      return -1;
4✔
943
    } else if (ver1 > ver2) {
6!
944
      return 1;
6✔
945
    } else {
946
      return 0;
×
947
    }
948
  }
949
}
950

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

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

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

963
  if (!pMTree->backward) {  // asc
202,937✔
964
    tRBTreeCreate(&pMTree->rbt, tLDataIterCmprFn);
175,438✔
965
  } else {  // desc
966
    tRBTreeCreate(&pMTree->rbt, tLDataIterDescCmprFn);
27,499✔
967
  }
968

969
  pMTree->ignoreEarlierTs = false;
202,938✔
970

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

977
  code = adjustSttDataIters(pConf->pSttFileBlockIterArray, pConf->pCurrentFileset);
202,096✔
978
  if (code) {
202,106✔
979
    goto _end;
4✔
980
  }
981

982
  for (int32_t j = 0; j < numOfLevels; ++j) {
404,863✔
983
    SSttLvl *pSttLevel = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->data[j];
202,814✔
984
    SArray  *pList = taosArrayGetP(pConf->pSttFileBlockIterArray, j);
202,814✔
985

986
    for (int32_t i = 0; i < TARRAY2_SIZE(pSttLevel->fobjArr); ++i) {  // open all last file
405,846✔
987
      SLDataIter *pIter = taosArrayGetP(pList, i);
203,085✔
988

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

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

1005
      if (pLoadInfo == NULL) {
203,052✔
1006
        code = tCreateSttBlockLoadInfo(pConf->pSchema, pConf->pCols, pConf->numOfCols, &pLoadInfo);
47,787✔
1007
        if (code != TSDB_CODE_SUCCESS) {
47,808✔
1008
          goto _end;
44✔
1009
        }
1010
      }
1011

1012
      memset(pIter, 0, sizeof(SLDataIter));
203,066✔
1013

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

1018
      code = tLDataIterOpen2(pIter, pSttFileReader, cid, pMTree->backward, pConf, pLoadInfo, &range, &numOfRows,
203,066✔
1019
                             pMTree->idStr);
1020
      if (code != TSDB_CODE_SUCCESS) {
203,063✔
1021
        goto _end;
24✔
1022
      }
1023

1024
      bool hasVal = NULL;
203,039✔
1025
      code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
203,039✔
1026
      if (code) {
203,044✔
1027
        goto _end;
13✔
1028
      }
1029

1030
      if (hasVal) {
203,031✔
1031
        tMergeTreeAddIter(pMTree, pIter);
57,606✔
1032

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

1038
          pSttDataInfo->numOfRows += numOfRows;
57,607✔
1039
        }
1040
      } else {
1041
        if (!pMTree->ignoreEarlierTs) {
145,425!
1042
          pMTree->ignoreEarlierTs = pIter->ignoreEarlierTs;
145,439✔
1043
        }
1044
      }
1045
    }
1046
  }
1047

1048
  return code;
202,049✔
1049

1050
_end:
890✔
1051
  tMergeTreeClose(pMTree);
890✔
1052
  return code;
890✔
1053
}
1054

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

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

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

1064
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
502,170✔
1065
    pInfo->blockData[0].pin = true;
419,136✔
1066
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
419,136!
1067
    return;
419,099✔
1068
  }
1069

1070
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
83,034!
1071
    pInfo->blockData[1].pin = true;
83,097✔
1072
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
83,097!
1073
    return;
83,099✔
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) {
501,693✔
1080
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
501,693✔
1081
  if (pInfo->blockData[0].pin) {
501,693✔
1082
    pInfo->blockData[0].pin = false;
418,831✔
1083
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[0].sttBlockIndex, pIter->cid, id);
418,831!
1084
    return;
418,831✔
1085
  }
1086

1087
  if (pInfo->blockData[1].pin) {
82,862!
1088
    pInfo->blockData[1].pin = false;
83,076✔
1089
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[1].sttBlockIndex, pIter->cid, id);
83,076!
1090
    return;
83,076✔
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) {
502,223✔
1097
  if (pMTree->pIter == NULL) {
502,223!
1098
    return;
×
1099
  }
1100

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

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

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

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

1122
  *pHasNext = false;
2,304,310✔
1123
  if (pMTree->pIter) {
2,304,310✔
1124
    SLDataIter *pIter = pMTree->pIter;
2,127,798✔
1125
    bool        hasVal = false;
2,127,798✔
1126
    code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
2,127,798✔
1127
    if (!hasVal || (code != 0)) {
2,127,831✔
1128
      if (code == TSDB_CODE_FILE_CORRUPTED) {
31,163!
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;
31,163✔
1133
    }
1134

1135
    // compare with min in RB Tree
1136
    pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
2,127,831✔
1137
    if (pMTree->pIter && pIter) {
2,127,831✔
1138
      int32_t c = pMTree->rbt.cmprFn(&pMTree->pIter->node, &pIter->node);
687✔
1139
      if (c > 0) {
687✔
1140
        (void)tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
156✔
1141
        pMTree->pIter = NULL;
123✔
1142
      } else if (!c) {
531!
1143
        return TSDB_CODE_INTERNAL_ERROR;
×
1144
      }
1145
    }
1146
  }
1147

1148
  if (pMTree->pIter == NULL) {
2,304,310✔
1149
    pMTree->pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
207,910✔
1150
    if (pMTree->pIter) {
207,910✔
1151
      tRBTreeDrop(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
31,474✔
1152
    }
1153
  }
1154

1155
  *pHasNext = (pMTree->pIter != NULL);
2,304,307✔
1156
  return code;
2,304,307✔
1157
}
1158

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