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

taosdata / TDengine / #3569

28 Dec 2024 03:56AM UTC coverage: 62.96% (-0.3%) from 63.286%
#3569

push

travis-ci

web-flow
Merge pull request #29369 from taosdata/enh/TS-4994-more-test-case

enh: add more cases

139174 of 284303 branches covered (48.95%)

Branch coverage included in aggregate %.

26 of 32 new or added lines in 3 files covered. (81.25%)

1505 existing lines in 138 files now uncovered.

217071 of 281522 relevant lines covered (77.11%)

18800589.91 hits per line

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

78.92
/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,125,359✔
27
  *pInfo = NULL;
5,125,359✔
28

29
  SSttBlockLoadInfo *pLoadInfo = taosMemoryCalloc(1, sizeof(SSttBlockLoadInfo));
5,125,359!
30
  if (pLoadInfo == NULL) {
5,128,515!
31
    return terrno;
×
32
  }
33

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

37
  pLoadInfo->currentLoadBlockIndex = 1;
5,128,515✔
38

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

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

51
  pLoadInfo->aSttBlk = taosArrayInit(4, sizeof(SSttBlk));
5,129,803✔
52
  if (pLoadInfo->aSttBlk == NULL) {
5,129,132✔
53
    taosMemoryFreeClear(pLoadInfo);
204!
54
    return terrno;
204✔
55
  }
56

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

61
  *pInfo = pLoadInfo;
5,128,928✔
62
  return code;
5,128,928✔
63
}
64

65
static void freeItem(void *pValue) {
35,917,785✔
66
  SValue *p = (SValue *)pValue;
35,917,785✔
67
  if (IS_VAR_DATA_TYPE(p->type)) {
35,917,785!
68
    taosMemoryFree(p->pData);
×
69
  }
70
}
35,927,445✔
71

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

77
  pLoadInfo->currentLoadBlockIndex = 1;
5,131,453✔
78

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

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

89
  taosArrayDestroy(pLoadInfo->info.pUid);
5,131,465✔
90
  taosArrayDestroyEx(pLoadInfo->info.pFirstKey, freeItem);
5,131,415✔
91
  taosArrayDestroyEx(pLoadInfo->info.pLastKey, freeItem);
5,131,424✔
92
  taosArrayDestroy(pLoadInfo->info.pCount);
5,131,429✔
93
  taosArrayDestroy(pLoadInfo->info.pFirstTs);
5,131,389✔
94
  taosArrayDestroy(pLoadInfo->info.pLastTs);
5,131,413✔
95

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

103
  taosArrayDestroy(pLoadInfo->aSttBlk);
5,131,475✔
104
  taosMemoryFree(pLoadInfo);
5,131,546!
105
}
106

107
void destroyLDataIter(SLDataIter *pIter) {
5,130,294✔
108
  tLDataIterClose2(pIter);
5,130,294✔
109
  destroySttBlockLoadInfo(pIter->pBlockLoadInfo);
5,131,636✔
110
  taosMemoryFree(pIter);
5,131,531!
111
}
5,131,666✔
112

113
void destroySttBlockReader(SArray *pLDataIterArray, SSttBlockLoadCostInfo *pLoadCost) {
10,477,106✔
114
  if (pLDataIterArray == NULL) {
10,477,106✔
115
    return;
55,966✔
116
  }
117

118
  int32_t numOfLevel = taosArrayGetSize(pLDataIterArray);
10,421,140✔
119
  for (int32_t i = 0; i < numOfLevel; ++i) {
15,548,365✔
120
    SArray *pList = taosArrayGetP(pLDataIterArray, i);
5,125,937✔
121
    for (int32_t j = 0; j < taosArrayGetSize(pList); ++j) {
10,257,391✔
122
      SLDataIter *pIter = taosArrayGetP(pList, j);
5,130,563✔
123
      if (pIter->pBlockLoadInfo != NULL) {
5,130,197!
124
        SSttBlockLoadCostInfo *pCost = &pIter->pBlockLoadInfo->cost;
5,130,251✔
125
        if (pLoadCost != NULL) {
5,130,251✔
126
          pLoadCost->loadBlocks += pCost->loadBlocks;
5,130,212✔
127
          pLoadCost->loadStatisBlocks += pCost->loadStatisBlocks;
5,130,212✔
128
          pLoadCost->blockElapsedTime += pCost->blockElapsedTime;
5,130,212✔
129
          pLoadCost->statisElapsedTime += pCost->statisElapsedTime;
5,130,212✔
130
        }
131
      }
132

133
      destroyLDataIter(pIter);
5,130,197✔
134
    }
135

136
    taosArrayDestroy(pList);
5,125,446✔
137
  }
138

139
  taosArrayDestroy(pLDataIterArray);
10,422,428✔
140
}
141

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

149
  pLoadInfo->currentLoadBlockIndex = nextSlotIndex;
3,624,962✔
150
}
3,624,962✔
151

152
static int32_t loadLastBlock(SLDataIter *pIter, const char *idStr, SBlockData **pResBlock) {
811,467,729✔
153
  if (pResBlock != NULL) {
811,467,729!
154
    *pResBlock = NULL;
811,729,332✔
155
  }
156

157
  int32_t            code = 0;
811,467,729✔
158
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
811,467,729✔
159

160
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
811,467,729✔
161
    if (pInfo->currentLoadBlockIndex != 0) {
583,726,455✔
162
      tsdbDebug("current load index is set to 0, block index:%d, fileVer:%" PRId64 ", due to uid:%" PRIu64
219✔
163
                ", load data, %s",
164
                pIter->iSttBlk, pIter->cid, pIter->uid, idStr);
165
      pInfo->currentLoadBlockIndex = 0;
219✔
166
    }
167

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

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

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

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

188
  updateBlockLoadSlot(pInfo);
3,625,354✔
189
  int64_t st = taosGetTimestampUs();
3,626,084✔
190

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

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

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

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

215
  *pResBlock = &pInfo->blockData[pInfo->currentLoadBlockIndex].data;
3,626,865✔
216
  return code;
3,626,865✔
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,478,348✔
223
  int32_t step = backward ? 1 : -1;
4,478,348✔
224
  while (i >= 0 && i < num && uid >= pBlockList[i].minUid && uid <= pBlockList[i].maxUid) {
8,993,288!
225
    i += step;
4,514,940✔
226
  }
227
  return i - step;
4,478,348✔
228
}
229

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

236
  int32_t firstPos = 0;
8,936,737✔
237
  int32_t lastPos = num - 1;
8,936,737✔
238

239
  // find the first position which is bigger than the key
240
  if ((uid > pBlockList[lastPos].maxUid) || (uid < pBlockList[firstPos].minUid)) {
8,936,737✔
241
    return -1;
4,458,134✔
242
  }
243

244
  while (1) {
392,241✔
245
    if (uid >= pBlockList[firstPos].minUid && uid <= pBlockList[firstPos].maxUid) {
4,870,844✔
246
      return findEarliestIndex(firstPos, uid, pBlockList, num, backward);
4,390,756✔
247
    }
248

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

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

256
    if (uid < pBlockList[midPos].minUid) {
479,833✔
257
      lastPos = midPos - 1;
195,321✔
258
    } else if (uid > pBlockList[midPos].maxUid) {
284,512✔
259
      firstPos = midPos + 1;
196,920✔
260
    } else {
261
      return findEarliestIndex(midPos, uid, pBlockList, num, backward);
87,592✔
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,398,431✔
269
  int32_t step = backward ? 1 : -1;
4,398,431✔
270
  while (i >= 0 && i < num && uid == uidList[i]) {
82,488,326!
271
    i += step;
78,089,895✔
272
  }
273
  return i - step;
4,398,431✔
274
}
275

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

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

285
  while (1) {
1,090,893✔
286
    if (uid == uidList[firstPos]) {
5,539,349✔
287
      return findEarliestRow(firstPos, uid, uidList, num, backward);
3,461,478✔
288
    }
289

290
    if (uid > uidList[lastPos] || uid < uidList[firstPos]) {
2,077,871✔
291
      return -1;
50,025✔
292
    }
293

294
    int32_t numOfRows = lastPos - firstPos + 1;
2,027,846✔
295
    int32_t midPos = (numOfRows >> 1u) + firstPos;
2,027,846✔
296

297
    if (uid < uidList[midPos]) {
2,027,846✔
298
      lastPos = midPos - 1;
439,569✔
299
    } else if (uid > uidList[midPos]) {
1,588,277✔
300
      firstPos = midPos + 1;
651,324✔
301
    } else {
302
      return findEarliestRow(midPos, uid, uidList, num, backward);
936,953✔
303
    }
304
  }
305
}
306

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

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

318
  // all identical
319
  if (pStart->suid == pEnd->suid) {
5,109,897✔
320
    if (pStart->suid != suid) {  // no qualified stt block existed
1,890,522✔
321
      taosArrayClear(pBlockLoadInfo->aSttBlk);
864,285✔
322
      pIter->iSttBlk = -1;
864,151✔
323
      return TSDB_CODE_SUCCESS;
864,151✔
324
    } else {  // all blocks are qualified
325
      taosArrayClear(pBlockLoadInfo->aSttBlk);
1,026,237✔
326
      px = taosArrayAddBatch(pBlockLoadInfo->aSttBlk, pArray->data, pArray->size);
1,026,003✔
327
      if (px == NULL) {
1,025,678!
328
        return terrno;
×
329
      }
330
    }
331
  } else {
332
    SArray *pTmp = taosArrayInit(TARRAY2_SIZE(pArray), sizeof(SSttBlk));
3,219,375✔
333
    if (pTmp == NULL) {
3,222,454!
334
      return terrno;
×
335
    }
336

337
    for (int32_t i = 0; i < TARRAY2_SIZE(pArray); ++i) {
11,164,498✔
338
      SSttBlk *p = &pArray->data[i];
9,142,930✔
339
      if (p->suid < suid) {
9,142,930✔
340
        continue;
5,127,202✔
341
      }
342

343
      if (p->suid == suid) {
4,015,728✔
344
        void *px = taosArrayPush(pTmp, p);
2,815,018✔
345
        if (px == NULL) {
2,815,018!
346
          code = terrno;
×
347
          break;
×
348
        }
349
      } else if (p->suid > suid) {
1,200,709!
350
        break;
1,200,990✔
351
      }
352
    }
353

354
    taosArrayDestroy(pBlockLoadInfo->aSttBlk);
3,222,558✔
355
    pBlockLoadInfo->aSttBlk = pTmp;
3,223,427✔
356
  }
357

358
  return code;
4,249,105✔
359
}
360

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

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

384
  int32_t numOfBlocks = TARRAY2_SIZE(pStatisBlkArray);
5,120,146✔
385
  if (numOfBlocks <= 0) {
5,120,146✔
386
    return code;
10,038✔
387
  }
388

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

393
  if (startIndex >= numOfBlocks || pStatisBlkArray->data[startIndex].minTbid.suid > suid) {
5,110,108✔
394
    return 0;
1,302,953✔
395
  }
396

397
  int32_t endIndex = startIndex;
3,807,155✔
398
  while (endIndex < numOfBlocks && pStatisBlkArray->data[endIndex].minTbid.suid <= suid) {
7,615,356✔
399
    ++endIndex;
3,808,201✔
400
  }
401

402
  int32_t num = endIndex - startIndex;
3,807,155✔
403
  pBlockLoadInfo->cost.loadStatisBlocks += num;
3,807,155✔
404

405
  STbStatisBlock block;
406
  code = tStatisBlockInit(&block);
3,807,155✔
407
  QUERY_CHECK_CODE(code, lino, _end);
3,806,110!
408

409
  int64_t st = taosGetTimestampUs();
3,806,707✔
410

411
  for (int32_t k = startIndex; k < endIndex; ++k) {
7,604,446✔
412
    code = tsdbSttFileReadStatisBlock(pSttFileReader, &pStatisBlkArray->data[k], &block);
3,806,784✔
413
    QUERY_CHECK_CODE(code, lino, _end);
3,808,092!
414

415
    int32_t i = 0;
3,808,092✔
416
    int32_t rows = block.numOfRecords;
3,808,092✔
417
    while (i < rows && ((int64_t *)block.suids.data)[i] != suid) {
8,405,683✔
418
      ++i;
4,597,591✔
419
    }
420

421
    // existed
422
    if (i < rows) {
3,808,092✔
423
      SSttTableRowsInfo *pInfo = &pBlockLoadInfo->info;
3,798,700✔
424

425
      if (pInfo->pUid == NULL) {
3,798,700✔
426
        pInfo->pUid = taosArrayInit(rows, sizeof(int64_t));
3,797,527✔
427
        pInfo->pFirstTs = taosArrayInit(rows, sizeof(int64_t));
3,797,687✔
428
        pInfo->pLastTs = taosArrayInit(rows, sizeof(int64_t));
3,797,872✔
429
        pInfo->pCount = taosArrayInit(rows, sizeof(int64_t));
3,797,913✔
430

431
        pInfo->pFirstKey = taosArrayInit(rows, sizeof(SValue));
3,797,754✔
432
        pInfo->pLastKey = taosArrayInit(rows, sizeof(SValue));
3,797,864✔
433

434
        if (pInfo->pUid == NULL || pInfo->pFirstTs == NULL || pInfo->pLastTs == NULL || pInfo->pCount == NULL ||
3,797,874!
435
            pInfo->pFirstKey == NULL || pInfo->pLastKey == NULL) {
3,797,896!
436
          code = terrno;
43✔
437
          goto _end;
×
438
        }
439
      }
440

441
      if (pStatisBlkArray->data[k].maxTbid.suid == suid) {
3,799,004✔
442
        int32_t size = rows - i;
2,611,658✔
443
        int32_t offset = i * sizeof(int64_t);
2,611,658✔
444

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

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

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

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

457
        if (block.numOfPKs > 0) {
2,610,984✔
458
          SValue vFirst = {0}, vLast = {0};
14,583✔
459
          for (int32_t f = i; f < rows; ++f) {
1,033,588✔
460
            code = tValueColumnGet(&block.firstKeyPKs[0], f, &vFirst);
1,019,002✔
461
            TSDB_CHECK_CODE(code, lino, _end);
1,018,999!
462

463
            code = tValueDupPayload(&vFirst);
1,018,999✔
464
            TSDB_CHECK_CODE(code, lino, _end);
1,019,022!
465

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

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

473
            code = tValueDupPayload(&vLast);
1,019,016✔
474
            TSDB_CHECK_CODE(code, lino, _end);
1,018,986!
475

476
            px = taosArrayPush(pInfo->pLastKey, &vLast);
1,018,986✔
477
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
1,019,005!
478
          }
479
        } else {
480
          SValue vFirst = {0};
2,596,401✔
481
          for (int32_t j = 0; j < size; ++j) {
17,198,520✔
482
            px = taosArrayPush(pInfo->pFirstKey, &vFirst);
14,612,134✔
483
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
14,602,170!
484

485
            px = taosArrayPush(pInfo->pLastKey, &vFirst);
14,602,170✔
486
            TSDB_CHECK_NULL(px, code, lino, _end, terrno);
14,602,119!
487
          }
488
        }
489
      } else {
490
        STbStatisRecord record = {0};
1,187,346✔
491
        while (i < rows) {
3,066,613✔
492
          code = tStatisBlockGet(&block, i, &record);
3,066,586✔
493
          TSDB_CHECK_CODE(code, lino, _end);
3,066,523!
494

495
          if (record.suid != suid) {
3,066,523✔
496
            break;
1,187,348✔
497
          }
498

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

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

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

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

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

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

534
          i += 1;
1,879,267✔
535
        }
536
      }
537
    }
538
  }
539

540
_end:
3,797,662✔
541
  tStatisBlockDestroy(&block);
3,797,662✔
542
  if (code != 0) {
3,807,061!
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;
3,807,103✔
546
    pBlockLoadInfo->cost.statisElapsedTime += el;
3,807,103✔
547

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

553
static int32_t doLoadSttFilesBlk(SSttBlockLoadInfo *pBlockLoadInfo, SLDataIter *pIter, int64_t suid,
5,121,292✔
554
                                 _load_tomb_fn loadTombFn, void *pReader1, const char *idStr) {
555
  int64_t st = taosGetTimestampUs();
5,122,116✔
556

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

560
  // load the stt block info for each stt-block
561
  int32_t code = tsdbSttFileReadSttBlk(pIter->pReader, &pSttBlkArray);
5,122,116✔
562
  if (code != TSDB_CODE_SUCCESS) {
5,121,343!
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,121,343✔
569
  if (code != TSDB_CODE_SUCCESS) {
5,123,035!
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,123,035✔
576
  code = tsdbSttFileReadStatisBlk(pIter->pReader, (const TStatisBlkArray **)&pStatisBlkArray);
5,123,035✔
577
  if (code != TSDB_CODE_SUCCESS) {
5,122,900!
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,122,900✔
584
  if (code != TSDB_CODE_SUCCESS) {
5,124,024!
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,124,024✔
590

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

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

600
  if (*pFirst == *pVal) {
11,904,768✔
601
    return 0;
4,431,852✔
602
  } else {
603
    return *pFirst < *pVal ? -1 : 1;
7,472,916✔
604
  }
605
}
606

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

613
  int32_t index = taosArraySearchIdx(pLoadInfo->info.pUid, &uid, uidComparFn, TD_EQ);
8,939,220✔
614
  if (index >= 0) {
8,939,941✔
615
    pRange->skey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pFirstTs, index);
4,431,953✔
616
    pRange->ekey.ts = *(int64_t *)taosArrayGet(pLoadInfo->info.pLastTs, index);
4,431,039✔
617

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

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

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

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

640
  pIter->pStartRowKey = pConf->pCurRowKey;
11,327,422✔
641
  pIter->pReader = pSttFileReader;
11,327,422✔
642
  pIter->pBlockLoadInfo = pBlockLoadInfo;
11,327,422✔
643

644
  // open stt file failed, ignore and continue
645
  if (pIter->pReader == NULL) {
11,327,422!
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) {
11,327,422✔
653
    code = doLoadSttFilesBlk(pBlockLoadInfo, pIter, pConf->suid, pConf->loadTombFn, pConf->pReader, idStr);
5,123,015✔
654
    if (code != TSDB_CODE_SUCCESS) {
5,123,646!
655
      return code;
×
656
    }
657
  }
658

659
  setSttInfoForCurrentTable(pBlockLoadInfo, pConf->uid, pKeyRange, numOfRows);
11,328,053✔
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);
11,326,338✔
664
  pIter->iSttBlk = binarySearchForStartBlock(pBlockLoadInfo->aSttBlk->pData, size, pConf->uid, backward);
11,325,920✔
665
  if (pIter->iSttBlk != -1) {
11,325,575✔
666
    pIter->pSttBlk = taosArrayGet(pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
4,481,312✔
667
    pIter->iRow = (pIter->backward) ? pIter->pSttBlk->nRow : -1;
4,480,888✔
668

669
    if ((!backward) && ((pConf->strictTimeRange && pIter->pSttBlk->minKey >= pIter->timeWindow.ekey) ||
4,480,888!
670
                        (!pConf->strictTimeRange && pIter->pSttBlk->minKey > pIter->timeWindow.ekey))) {
4,016,689✔
671
      pIter->pSttBlk = NULL;
441✔
672
    }
673

674
    if (backward && ((pConf->strictTimeRange && pIter->pSttBlk->maxKey <= pIter->timeWindow.skey) ||
4,480,888!
675
                     (!pConf->strictTimeRange && pIter->pSttBlk->maxKey < pIter->timeWindow.skey))) {
464,284!
676
      pIter->pSttBlk = NULL;
288✔
677
      pIter->ignoreEarlierTs = true;
288✔
678
    }
679
  }
680

681
  return code;
11,325,151✔
682
}
683

684
void tLDataIterClose2(SLDataIter *pIter) {
5,130,171✔
685
  tsdbSttFileReaderClose(&pIter->pReader);
5,130,171✔
686
  pIter->pReader = NULL;
5,131,640✔
687
}
5,131,640✔
688

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

693
  pIter->iSttBlk += step;
4,525,627✔
694

695
  int32_t index = -1;
4,525,627✔
696
  size_t  size = pIter->pBlockLoadInfo->aSttBlk->size;
4,525,627✔
697
  for (int32_t i = pIter->iSttBlk; i < size && i >= 0; i += step) {
4,540,400!
698
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, i);
231,111✔
699
    if ((!pIter->backward) && p->minUid > pIter->uid) {
231,101✔
700
      break;
139,809✔
701
    }
702

703
    if (pIter->backward && p->maxUid < pIter->uid) {
91,292✔
704
      break;
10,081✔
705
    }
706

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

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

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

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

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

735
  pIter->pSttBlk = NULL;
4,525,617✔
736
  if (index != -1) {
4,525,617✔
737
    SSttBlk *p = taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, index);
65,555✔
738

739
    pIter->iSttBlk = index;
65,555✔
740
    pIter->pSttBlk = (SSttBlk *)taosArrayGet(pIter->pBlockLoadInfo->aSttBlk, pIter->iSttBlk);
65,555✔
741
    tsdbDebug("try next stt-file block:%d from %d, trigger by uid:%" PRIu64 ", stt-fileVer:%" PRId64
65,555✔
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,460,062✔
746
  }
747
}
4,525,620✔
748

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

755
  int32_t code = loadLastBlock(pIter, idStr, &pData);
415,478,041✔
756
  if (code) {
409,888,167!
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) {
409,888,167✔
763
    i = binarySearchForStartRowIndex((uint64_t *)pData->aUid, pData->nRow, pIter->uid, pIter->backward);
4,448,989✔
764
    if (i == -1) {
4,449,186!
765
      tsdbDebug("failed to find the data in pBlockData, uid:%" PRIu64 " , %s", pIter->uid, idStr);
×
766
      pIter->iRow = -1;
50,066✔
767
      return code;
50,066✔
768
    }
769
  }
770

771
  for (; i < pData->nRow && i >= 0; i += step) {
420,121,649!
772
    if (pData->aUid != NULL) {
419,414,535✔
773
      if (!pIter->backward) {
416,134,716✔
774
        if (pData->aUid[i] > pIter->uid) {
389,406,300✔
775
          break;
969,907✔
776
        }
777
      } else {
778
        if (pData->aUid[i] < pIter->uid) {
26,728,416✔
779
          break;
58,872✔
780
        }
781
      }
782
    }
783

784
    int64_t ts = pData->aTSKEY[i];
418,385,756✔
785
    if (!pIter->backward) {               // asc
418,385,756✔
786
      if (ts > pIter->timeWindow.ekey) {  // no more data
391,055,603✔
787
        break;
258,873✔
788
      } else {
789
        if (ts < pIter->timeWindow.skey) {
390,796,730✔
790
          continue;
4,789,783✔
791
        }
792

793
        if (ts == pIter->timeWindow.skey && pIter->pStartRowKey->numOfPKs > 0) {
386,006,947✔
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) {
27,330,153✔
804
        break;
104,557✔
805
      } else {
806
        if (ts > pIter->timeWindow.ekey) {
27,225,596✔
807
          continue;
4,903,554✔
808
        }
809

810
        if (ts == pIter->timeWindow.ekey && pIter->pStartRowKey->numOfPKs > 0) {
22,322,042!
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];
408,328,989✔
822
    if (ver < pIter->verRange.minVer) {
408,328,989!
823
      continue;
×
824
    }
825

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

831
    hasVal = true;
408,328,965✔
832
    break;
408,328,965✔
833
  }
834

835
  pIter->iRow = (hasVal) ? i : -1;
410,428,288✔
836
  return code;
410,428,288✔
837
}
838

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

846
  *hasNext = false;
419,542,827✔
847

848
  // no qualified last file block in current file, no need to fetch row
849
  if (pIter->pSttBlk == NULL) {
419,542,827✔
850
    return code;
6,847,386✔
851
  }
852

853
  code = loadLastBlock(pIter, idStr, &pBlockData);
412,695,441✔
854
  if (pBlockData == NULL || code != TSDB_CODE_SUCCESS) {
416,483,381!
855
    lino = __LINE__;
76,546✔
856
    goto _exit;
76,546✔
857
  }
858

859
  pIter->iRow += step;
416,406,835✔
860

861
  while (1) {
65,177✔
862
    bool skipBlock = false;
416,472,012✔
863
    code = findNextValidRow(pIter, idStr);
416,472,012✔
864
    TSDB_CHECK_CODE(code, lino, _exit);
411,923,790!
865

866
    if (pIter->pBlockLoadInfo->checkRemainingRow) {
411,923,790!
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) {
411,923,790!
890
      tLDataIterNextBlock(pIter, idStr);
4,408,229✔
891
      if (pIter->pSttBlk == NULL) {  // no more data
4,525,376✔
892
        goto _exit;
4,460,206✔
893
      }
894
    } else {
895
      break;
896
    }
897

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

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

910
  pIter->rInfo.suid = pBlockData->suid;
407,515,561✔
911
  pIter->rInfo.uid = pBlockData->uid;
407,515,561✔
912
  pIter->rInfo.row = tsdbRowFromBlockData(pBlockData, pIter->iRow);
407,515,561✔
913

914
_exit:
412,052,307✔
915
  if (code) {
412,052,307!
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);
411,693,677!
920
  return code;
411,693,677✔
921
}
922

923
// SMergeTree =================================================
924
static FORCE_INLINE int32_t tLDataIterCmprFn(const SRBTreeNode *p1, const SRBTreeNode *p2) {
50,686,285✔
925
  SLDataIter *pIter1 = (SLDataIter *)(((uint8_t *)p1) - offsetof(SLDataIter, node));
50,731,085✔
926
  SLDataIter *pIter2 = (SLDataIter *)(((uint8_t *)p2) - offsetof(SLDataIter, node));
50,731,085✔
927

928
  SRowKey rkey1 = {0}, rkey2 = {0};
50,731,085✔
929
  tRowGetKeyEx(&pIter1->rInfo.row, &rkey1);
50,731,085!
930
  tRowGetKeyEx(&pIter2->rInfo.row, &rkey2);
51,127,178!
931

932
  int32_t ret = tRowKeyCompare(&rkey1, &rkey2);
50,880,512✔
933
  if (ret < 0) {
50,894,259✔
934
    return -1;
32,194,305✔
935
  } else if (ret > 0) {
18,699,954✔
936
    return 1;
7,735,153✔
937
  } else {
938
    int64_t ver1 = TSDBROW_VERSION(&pIter1->rInfo.row);
10,964,801!
939
    int64_t ver2 = TSDBROW_VERSION(&pIter2->rInfo.row);
10,964,801!
940

941
    if (ver1 < ver2) {
10,964,801✔
942
      return -1;
4,439,318✔
943
    } else if (ver1 > ver2) {
6,525,483!
944
      return 1;
7,021,525✔
945
    } else {
946
      return 0;
×
947
    }
948
  }
949
}
950

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

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

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

963
  if (!pMTree->backward) {  // asc
11,814,340✔
964
    tRBTreeCreate(&pMTree->rbt, tLDataIterCmprFn);
10,213,043✔
965
  } else {  // desc
966
    tRBTreeCreate(&pMTree->rbt, tLDataIterDescCmprFn);
1,601,297✔
967
  }
968

969
  pMTree->ignoreEarlierTs = false;
11,815,689✔
970

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

977
  code = adjustSttDataIters(pConf->pSttFileBlockIterArray, pConf->pCurrentFileset);
11,132,277✔
978
  if (code) {
11,131,938!
979
    goto _end;
×
980
  }
981

982
  for (int32_t j = 0; j < numOfLevels; ++j) {
22,437,725✔
983
    SSttLvl *pSttLevel = ((STFileSet *)pConf->pCurrentFileset)->lvlArr->data[j];
11,302,231✔
984
    SArray  *pList = taosArrayGetP(pConf->pSttFileBlockIterArray, j);
11,302,231✔
985

986
    for (int32_t i = 0; i < TARRAY2_SIZE(pSttLevel->fobjArr); ++i) {  // open all last file
22,628,167✔
987
      SLDataIter *pIter = taosArrayGetP(pList, i);
11,322,380✔
988

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

998
        code = tsdbSttFileReaderOpen(pSttLevel->fobjArr->data[i]->fname, &conf, &pSttFileReader);
5,119,430✔
999
        if (code != TSDB_CODE_SUCCESS) {
5,120,501!
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) {
11,321,297✔
1006
        code = tCreateSttBlockLoadInfo(pConf->pSchema, pConf->pCols, pConf->numOfCols, &pLoadInfo);
5,122,327✔
1007
        if (code != TSDB_CODE_SUCCESS) {
5,122,217!
1008
          goto _end;
×
1009
        }
1010
      }
1011

1012
      memset(pIter, 0, sizeof(SLDataIter));
11,321,187✔
1013

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

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

1024
      bool hasVal = NULL;
11,325,294✔
1025
      code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
11,325,294✔
1026
      if (code) {
11,327,855!
1027
        goto _end;
×
1028
      }
1029

1030
      if (hasVal) {
11,327,855✔
1031
        tMergeTreeAddIter(pMTree, pIter);
4,428,206✔
1032

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

1038
          pSttDataInfo->numOfRows += numOfRows;
4,427,641✔
1039
        }
1040
      } else {
1041
        if (!pMTree->ignoreEarlierTs) {
6,899,649!
1042
          pMTree->ignoreEarlierTs = pIter->ignoreEarlierTs;
6,899,761✔
1043
        }
1044
      }
1045
    }
1046
  }
1047

1048
  return code;
11,135,494✔
1049

1050
_end:
683,412✔
1051
  tMergeTreeClose(pMTree);
683,412✔
1052
  return code;
683,304✔
1053
}
1054

1055
void tMergeTreeAddIter(SMergeTree *pMTree, SLDataIter *pIter) {
4,427,513✔
1056
  SRBTreeNode *node = tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pIter);
4,427,513✔
1057
}
4,428,081✔
1058

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

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

1064
  if (pInfo->blockData[0].sttBlockIndex == pIter->iSttBlk) {
189,827,542✔
1065
    pInfo->blockData[0].pin = true;
114,807,484✔
1066
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
114,807,484✔
1067
    return;
114,846,309✔
1068
  }
1069

1070
  if (pInfo->blockData[1].sttBlockIndex == pIter->iSttBlk) {
75,020,058!
1071
    pInfo->blockData[1].pin = true;
79,324,424✔
1072
    tsdbTrace("pin stt-block, blockIndex:%d, stt-fileVer:%" PRId64 " %s", pIter->iSttBlk, pIter->cid, id);
79,324,424✔
1073
    return;
79,319,918✔
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) {
184,919,688✔
1080
  SSttBlockLoadInfo *pInfo = pIter->pBlockLoadInfo;
184,919,688✔
1081
  if (pInfo->blockData[0].pin) {
184,919,688✔
1082
    pInfo->blockData[0].pin = false;
113,018,125✔
1083
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[0].sttBlockIndex, pIter->cid, id);
113,018,125✔
1084
    return;
113,027,387✔
1085
  }
1086

1087
  if (pInfo->blockData[1].pin) {
71,901,563!
1088
    pInfo->blockData[1].pin = false;
77,921,280✔
1089
    tsdbTrace("unpin stt-block:%d, stt-fileVer:%" PRId64 " %s", pInfo->blockData[1].sttBlockIndex, pIter->cid, id);
77,921,280✔
1090
    return;
77,925,011✔
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) {
190,366,534✔
1097
  if (pMTree->pIter == NULL) {
190,366,534!
1098
    return;
×
1099
  }
1100

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

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

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

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

1122
  *pHasNext = false;
419,358,745✔
1123
  if (pMTree->pIter) {
419,358,745✔
1124
    SLDataIter *pIter = pMTree->pIter;
408,024,056✔
1125
    bool        hasVal = false;
408,024,056✔
1126
    code = tLDataIterNextRow(pIter, pMTree->idStr, &hasVal);
408,024,056✔
1127
    if (!hasVal || (code != 0)) {
406,768,553✔
1128
      if (code == TSDB_CODE_FILE_CORRUPTED) {
4,406,898!
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,406,898✔
1133
    }
1134

1135
    // compare with min in RB Tree
1136
    pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
406,768,553✔
1137
    if (pMTree->pIter && pIter) {
406,768,553✔
1138
      int32_t c = pMTree->rbt.cmprFn(&pMTree->pIter->node, &pIter->node);
31,780,972✔
1139
      if (c > 0) {
31,786,800✔
1140
        (void)tRBTreePut(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
4,550,000✔
1141
        pMTree->pIter = NULL;
4,440,763✔
1142
      } else if (!c) {
27,236,800!
1143
        return TSDB_CODE_INTERNAL_ERROR;
×
1144
      }
1145
    }
1146
  }
1147

1148
  if (pMTree->pIter == NULL) {
417,999,833✔
1149
    pMTree->pIter = (SLDataIter *)tRBTreeMin(&pMTree->rbt);
20,640,380✔
1150
    if (pMTree->pIter) {
20,640,380✔
1151
      tRBTreeDrop(&pMTree->rbt, (SRBTreeNode *)pMTree->pIter);
8,847,759✔
1152
    }
1153
  }
1154

1155
  *pHasNext = (pMTree->pIter != NULL);
418,417,625✔
1156
  return code;
418,417,625✔
1157
}
1158

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