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

taosdata / TDengine / #4908

30 Dec 2025 10:52AM UTC coverage: 65.386% (-0.2%) from 65.541%
#4908

push

travis-ci

web-flow
enh: drop multi-stream (#33962)

60 of 106 new or added lines in 4 files covered. (56.6%)

1330 existing lines in 113 files now uncovered.

193461 of 295877 relevant lines covered (65.39%)

115765274.47 hits per line

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

81.19
/source/dnode/vnode/src/tsdb/tsdbIter.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 "tsdbIter.h"
17

18
// STsdbIter ================
19
struct STsdbIter {
20
  EIterType type;
21
  bool      noMoreData;
22
  bool      filterByVersion;
23
  int64_t   range[2];
24
  union {
25
    SRowInfo    row[1];
26
    STombRecord record[1];
27
  };
28
  SRBTreeNode node[1];
29
  union {
30
    struct {
31
      SSttFileReader     *reader;
32
      const TSttBlkArray *sttBlkArray;
33
      int32_t             sttBlkArrayIdx;
34
      SBlockData          blockData[1];
35
      int32_t             blockDataIdx;
36
    } sttData[1];
37
    struct {
38
      SDataFileReader     *reader;
39
      const TBrinBlkArray *brinBlkArray;
40
      int32_t              brinBlkArrayIdx;
41
      SBrinBlock           brinBlock[1];
42
      int32_t              brinBlockIdx;
43
      SBlockData           blockData[1];
44
      int32_t              blockDataIdx;
45
    } dataData[1];
46
    struct {
47
      SMemTable  *memt;
48
      STsdbRowKey from[1];
49
      SRBTreeIter iter[1];
50
      STbData    *tbData;
51
      STbDataIter tbIter[1];
52
    } memtData[1];
53
    struct {
54
      SSttFileReader      *reader;
55
      const TTombBlkArray *tombBlkArray;
56
      int32_t              tombBlkArrayIdx;
57
      STombBlock           tombBlock[1];
58
      int32_t              tombBlockIdx;
59
    } sttTomb[1];
60
    struct {
61
      SDataFileReader     *reader;
62
      const TTombBlkArray *tombBlkArray;
63
      int32_t              tombBlkArrayIdx;
64
      STombBlock           tombBlock[1];
65
      int32_t              tombBlockIdx;
66
    } dataTomb[1];
67
    struct {
68
      SMemTable  *memt;
69
      SRBTreeIter rbtIter[1];
70
      STbData    *tbData;
71
      SDelData   *delData;
72
    } memtTomb[1];
73
  };
74
};
75

76
static int32_t tsdbSttIterNext(STsdbIter *iter, const TABLEID *tbid) {
2,147,483,647✔
77
  while (!iter->noMoreData) {
2,147,483,647✔
78
    for (; iter->sttData->blockDataIdx < iter->sttData->blockData->nRow; iter->sttData->blockDataIdx++) {
2,147,483,647✔
79
      int64_t version = iter->sttData->blockData->aVersion[iter->sttData->blockDataIdx];
2,147,483,647✔
80

81
      if (iter->filterByVersion && (version < iter->range[0] || version > iter->range[1])) {
2,147,483,647✔
82
        continue;
×
83
      }
84

85
      iter->row->suid = iter->sttData->blockData->suid;
2,147,483,647✔
86
      iter->row->uid = iter->sttData->blockData->uid ? iter->sttData->blockData->uid
2,147,483,647✔
87
                                                     : iter->sttData->blockData->aUid[iter->sttData->blockDataIdx];
2,147,483,647✔
88

89
      if (tbid && iter->row->suid == tbid->suid && iter->row->uid == tbid->uid) {
2,147,483,647✔
90
        continue;
71,301,831✔
91
      }
92

93
      iter->row->row = tsdbRowFromBlockData(iter->sttData->blockData, iter->sttData->blockDataIdx);
2,147,483,647✔
94
      iter->sttData->blockDataIdx++;
2,147,483,647✔
95
      goto _exit;
2,147,483,647✔
96
    }
97

98
    if (iter->sttData->sttBlkArrayIdx >= TARRAY2_SIZE(iter->sttData->sttBlkArray)) {
17,706,100✔
99
      iter->noMoreData = true;
2,718,257✔
100
      break;
3,082,643✔
101
    }
102

103
    for (; iter->sttData->sttBlkArrayIdx < TARRAY2_SIZE(iter->sttData->sttBlkArray); iter->sttData->sttBlkArrayIdx++) {
15,233,821✔
104
      const SSttBlk *sttBlk = TARRAY2_GET_PTR(iter->sttData->sttBlkArray, iter->sttData->sttBlkArrayIdx);
15,230,427✔
105

106
      if (iter->filterByVersion && (sttBlk->maxVer < iter->range[0] || sttBlk->minVer > iter->range[1])) {
15,229,824✔
107
        continue;
×
108
      }
109

110
      if (tbid && tbid->suid == sttBlk->suid && tbid->uid == sttBlk->minUid && tbid->uid == sttBlk->maxUid) {
15,229,824✔
111
        continue;
245,978✔
112
      }
113

114
      int32_t code = tsdbSttFileReadBlockData(iter->sttData->reader, sttBlk, iter->sttData->blockData);
14,983,846✔
115
      if (code) return code;
14,983,848✔
116

117
      iter->sttData->blockDataIdx = 0;
14,983,848✔
118
      iter->sttData->sttBlkArrayIdx++;
14,983,848✔
119
      break;
14,983,245✔
120
    }
121
  }
122

123
_exit:
37,476✔
124
  return 0;
2,147,483,647✔
125
}
126

127
static int32_t tsdbDataIterNext(STsdbIter *iter, const TABLEID *tbid) {
795,774,202✔
128
  int32_t code;
129

130
  while (!iter->noMoreData) {
795,794,513✔
131
    for (;;) {
132
      // SBlockData
133
      for (; iter->dataData->blockDataIdx < iter->dataData->blockData->nRow; iter->dataData->blockDataIdx++) {
800,958,540✔
134
        int64_t version = iter->dataData->blockData->aVersion[iter->dataData->blockDataIdx];
800,688,121✔
135
        if (iter->filterByVersion && (version < iter->range[0] || version > iter->range[1])) {
800,688,360✔
136
          continue;
4,902,160✔
137
        }
138

139
        if (tbid && tbid->suid == iter->dataData->blockData->suid && tbid->uid == iter->dataData->blockData->uid) {
795,776,878✔
140
          iter->dataData->blockDataIdx = iter->dataData->blockData->nRow;
30,096✔
141
          break;
30,096✔
142
        }
143

144
        iter->row->row = tsdbRowFromBlockData(iter->dataData->blockData, iter->dataData->blockDataIdx);
795,746,782✔
145
        iter->dataData->blockDataIdx++;
795,754,643✔
146
        goto _exit;
795,753,609✔
147
      }
148

149
      // SBrinBlock
150
      if (iter->dataData->brinBlockIdx >= iter->dataData->brinBlock->numOfRecords) {
300,327✔
151
        break;
40,622✔
152
      }
153

154
      for (; iter->dataData->brinBlockIdx < iter->dataData->brinBlock->numOfRecords; iter->dataData->brinBlockIdx++) {
295,020✔
155
        SBrinRecord record[1];
284,988✔
156
        code = tBrinBlockGet(iter->dataData->brinBlock, iter->dataData->brinBlockIdx, record);
284,988✔
157
        if (code) return code;
284,988✔
158

159
        if (iter->filterByVersion && (record->maxVer < iter->range[0] || record->minVer > iter->range[1])) {
284,988✔
160
          continue;
4,040✔
161
        }
162

163
        if (tbid && tbid->suid == record->suid && tbid->uid == record->uid) {
280,948✔
164
          continue;
30,096✔
165
        }
166

167
        iter->row->suid = record->suid;
250,852✔
168
        iter->row->uid = record->uid;
250,852✔
169

170
        code = tsdbDataFileReadBlockData(iter->dataData->reader, record, iter->dataData->blockData);
250,852✔
171
        if (code) return code;
250,852✔
172

173
        iter->dataData->blockDataIdx = 0;
250,852✔
174
        iter->dataData->brinBlockIdx++;
250,852✔
175
        break;
250,852✔
176
      }
177
    }
178

179
    if (iter->dataData->brinBlkArrayIdx >= TARRAY2_SIZE(iter->dataData->brinBlkArray)) {
40,622✔
180
      iter->noMoreData = true;
20,311✔
181
      break;
87,164✔
182
    }
183

184
    for (; iter->dataData->brinBlkArrayIdx < TARRAY2_SIZE(iter->dataData->brinBlkArray);
20,311✔
185
         iter->dataData->brinBlkArrayIdx++) {
×
186
      const SBrinBlk *brinBlk = TARRAY2_GET_PTR(iter->dataData->brinBlkArray, iter->dataData->brinBlkArrayIdx);
20,311✔
187

188
      if (iter->filterByVersion && (brinBlk->maxVer < iter->range[0] || brinBlk->minVer > iter->range[1])) {
20,311✔
189
        continue;
×
190
      }
191

192
      if (tbid && tbid->uid == brinBlk->minTbid.uid && tbid->uid == brinBlk->maxTbid.uid) {
20,311✔
193
        continue;
×
194
      }
195

196
      code = tsdbDataFileReadBrinBlock(iter->dataData->reader, brinBlk, iter->dataData->brinBlock);
20,311✔
197
      if (code) return code;
20,311✔
198

199
      iter->dataData->brinBlockIdx = 0;
20,311✔
200
      iter->dataData->brinBlkArrayIdx++;
20,311✔
201
      break;
20,311✔
202
    }
203
  }
204

205
_exit:
521✔
206
  return 0;
795,767,316✔
207
}
208

209
static int32_t tsdbMemTableIterNext(STsdbIter *iter, const TABLEID *tbid) {
2,147,483,647✔
210
  SRBTreeNode *node;
211

212
  while (!iter->noMoreData) {
2,147,483,647✔
213
    for (TSDBROW *row; iter->memtData->tbData && (row = tsdbTbDataIterGet(iter->memtData->tbIter));) {
2,147,483,647✔
214
      if (tbid && tbid->suid == iter->memtData->tbData->suid && tbid->uid == iter->memtData->tbData->uid) {
2,147,483,647✔
215
        iter->memtData->tbData = NULL;
39,271,216✔
216
        break;
39,271,252✔
217
      }
218

219
      if (iter->filterByVersion) {
2,147,483,647✔
220
        int64_t version = TSDBROW_VERSION(row);
×
221
        if (version < iter->range[0] || version > iter->range[1]) {
×
222
          continue;
×
223
        }
224
      }
225

226
      iter->row->row = row[0];
2,147,483,647✔
227

228
      bool r = tsdbTbDataIterNext(iter->memtData->tbIter);
2,147,483,647✔
229
      goto _exit;
2,147,483,647✔
230
    }
231

232
    for (;;) {
233
      node = tRBTreeIterNext(iter->memtData->iter);
126,016,435✔
234
      if (!node) {
126,034,764✔
235
        iter->noMoreData = true;
15,971,966✔
236
        goto _exit;
197,353✔
237
      }
238

239
      iter->memtData->tbData = TCONTAINER_OF(node, STbData, rbtn);
110,062,798✔
240
      if (tbid && tbid->suid == iter->memtData->tbData->suid && tbid->uid == iter->memtData->tbData->uid) {
110,063,167✔
241
        continue;
×
242
      } else {
243
        iter->row->suid = iter->memtData->tbData->suid;
110,062,861✔
244
        iter->row->uid = iter->memtData->tbData->uid;
110,069,240✔
245
        tsdbTbDataIterOpen(iter->memtData->tbData, iter->memtData->from, 0, iter->memtData->tbIter);
110,075,566✔
246
        break;
110,020,660✔
247
      }
248
    }
249
  }
250

251
_exit:
×
252
  return 0;
2,147,483,647✔
253
}
254

255
static int32_t tsdbDataTombIterNext(STsdbIter *iter, const TABLEID *tbid) {
×
256
  while (!iter->noMoreData) {
×
257
    for (; iter->dataTomb->tombBlockIdx < TOMB_BLOCK_SIZE(iter->dataTomb->tombBlock); iter->dataTomb->tombBlockIdx++) {
×
258
      int32_t code = tTombBlockGet(iter->dataTomb->tombBlock, iter->dataTomb->tombBlockIdx, iter->record);
×
259
      if (code) return code;
×
260

261
      if (iter->filterByVersion && (iter->record->version < iter->range[0] || iter->record->version > iter->range[1])) {
×
262
        continue;
×
263
      }
264

265
      if (tbid && iter->record->suid == tbid->suid && iter->record->uid == tbid->uid) {
×
266
        continue;
×
267
      }
268
      iter->dataTomb->tombBlockIdx++;
×
269
      goto _exit;
×
270
    }
271

272
    if (iter->dataTomb->tombBlkArrayIdx >= TARRAY2_SIZE(iter->dataTomb->tombBlkArray)) {
×
273
      iter->noMoreData = true;
×
274
      goto _exit;
×
275
    }
276

277
    for (; iter->dataTomb->tombBlkArrayIdx < TARRAY2_SIZE(iter->dataTomb->tombBlkArray);
×
278
         iter->dataTomb->tombBlkArrayIdx++) {
×
279
      const STombBlk *tombBlk = TARRAY2_GET_PTR(iter->dataTomb->tombBlkArray, iter->dataTomb->tombBlkArrayIdx);
×
280

281
      if (tbid && tbid->suid == tombBlk->minTbid.suid && tbid->uid == tombBlk->minTbid.uid &&
×
282
          tbid->suid == tombBlk->maxTbid.suid && tbid->uid == tombBlk->maxTbid.uid) {
×
283
        continue;
×
284
      }
285

286
      int32_t code = tsdbDataFileReadTombBlock(iter->dataTomb->reader, tombBlk, iter->dataTomb->tombBlock);
×
287
      if (code) return code;
×
288

289
      iter->dataTomb->tombBlockIdx = 0;
×
290
      iter->dataTomb->tombBlkArrayIdx++;
×
291
      break;
×
292
    }
293
  }
294

295
_exit:
×
296
  return 0;
×
297
}
298

299
static int32_t tsdbMemTombIterNext(STsdbIter *iter, const TABLEID *tbid) {
2,786,264✔
300
  while (!iter->noMoreData) {
4,705,326✔
301
    for (; iter->memtTomb->delData;) {
4,705,326✔
302
      if (tbid && tbid->uid == iter->memtTomb->tbData->uid) {
1,763,371✔
303
        iter->memtTomb->delData = NULL;
×
304
        break;
×
305
      }
306

307
      if (iter->filterByVersion &&
1,763,371✔
308
          (iter->memtTomb->delData->version < iter->range[0] || iter->memtTomb->delData->version > iter->range[1])) {
×
309
        continue;
×
310
      }
311

312
      iter->record->suid = iter->memtTomb->tbData->suid;
1,763,371✔
313
      iter->record->uid = iter->memtTomb->tbData->uid;
1,763,371✔
314
      iter->record->version = iter->memtTomb->delData->version;
1,763,371✔
315
      iter->record->skey = iter->memtTomb->delData->sKey;
1,763,371✔
316
      iter->record->ekey = iter->memtTomb->delData->eKey;
1,763,371✔
317

318
      iter->memtTomb->delData = iter->memtTomb->delData->pNext;
1,763,371✔
319
      goto _exit;
1,763,371✔
320
    }
321

322
    for (;;) {
×
323
      SRBTreeNode *node = tRBTreeIterNext(iter->memtTomb->rbtIter);
2,941,955✔
324
      if (node == NULL) {
2,941,955✔
325
        iter->noMoreData = true;
1,022,893✔
326
        goto _exit;
1,022,893✔
327
      }
328

329
      iter->memtTomb->tbData = TCONTAINER_OF(node, STbData, rbtn);
1,919,062✔
330
      if (tbid && tbid->uid == iter->memtTomb->tbData->uid) {
1,919,062✔
331
        continue;
×
332
      } else {
333
        iter->memtTomb->delData = iter->memtTomb->tbData->pHead;
1,919,062✔
334
        break;
1,919,062✔
335
      }
336
    }
337
  }
338

UNCOV
339
_exit:
×
340
  return 0;
2,786,264✔
341
}
342

343
static int32_t tsdbSttIterOpen(STsdbIter *iter) {
2,763,084✔
344
  int32_t code;
345

346
  code = tsdbSttFileReadSttBlk(iter->sttData->reader, &iter->sttData->sttBlkArray);
2,763,084✔
347
  if (code) return code;
2,761,880✔
348

349
  if (TARRAY2_SIZE(iter->sttData->sttBlkArray) == 0) {
2,761,880✔
350
    iter->noMoreData = true;
44,727✔
351
    return 0;
44,727✔
352
  }
353

354
  iter->sttData->sttBlkArrayIdx = 0;
2,717,153✔
355
  code = tBlockDataCreate(iter->sttData->blockData);
2,717,153✔
356
  if (code) return code;
2,717,754✔
357
  iter->sttData->blockDataIdx = 0;
2,717,754✔
358

359
  return tsdbSttIterNext(iter, NULL);
2,717,754✔
360
}
361

362
static int32_t tsdbDataIterOpen(STsdbIter *iter) {
112,409✔
363
  int32_t code;
364

365
  // SBrinBlk
366
  code = tsdbDataFileReadBrinBlk(iter->dataData->reader, &iter->dataData->brinBlkArray);
112,409✔
367
  if (code) return code;
112,409✔
368

369
  if (TARRAY2_SIZE(iter->dataData->brinBlkArray) == 0) {
112,409✔
370
    iter->noMoreData = true;
92,098✔
371
    return 0;
92,098✔
372
  }
373

374
  iter->dataData->brinBlkArrayIdx = 0;
20,311✔
375

376
  // SBrinBlock
377
  code = tBrinBlockInit(iter->dataData->brinBlock);
20,311✔
378
  if (code) return code;
20,311✔
379
  iter->dataData->brinBlockIdx = 0;
20,311✔
380

381
  // SBlockData
382
  code = tBlockDataCreate(iter->dataData->blockData);
20,311✔
383
  if (code) return code;
20,311✔
384
  iter->dataData->blockDataIdx = 0;
20,311✔
385

386
  return tsdbDataIterNext(iter, NULL);
20,311✔
387
}
388

389
static int32_t tsdbMemTableIterOpen(STsdbIter *iter) {
16,020,105✔
390
  if (iter->memtData->memt->nRow == 0) {
16,020,105✔
391
    iter->noMoreData = true;
71,237✔
392
    return 0;
71,237✔
393
  }
394

395
  iter->memtData->iter[0] = tRBTreeIterCreate(iter->memtData->memt->tbDataTree, 1);
15,967,769✔
396
  return tsdbMemTableIterNext(iter, NULL);
15,964,245✔
397
}
398

399
static int32_t tsdbSttIterClose(STsdbIter *iter) {
2,763,084✔
400
  tBlockDataDestroy(iter->sttData->blockData);
2,763,084✔
401
  return 0;
2,763,084✔
402
}
403

404
static int32_t tsdbDataTombIterOpen(STsdbIter *iter) {
112,409✔
405
  int32_t code;
406

407
  code = tsdbDataFileReadTombBlk(iter->dataTomb->reader, &iter->dataTomb->tombBlkArray);
112,409✔
408
  if (code) return code;
112,409✔
409

410
  if (TARRAY2_SIZE(iter->dataTomb->tombBlkArray) == 0) {
112,409✔
411
    iter->noMoreData = true;
112,409✔
412
    return 0;
112,409✔
413
  }
414
  iter->dataTomb->tombBlkArrayIdx = 0;
×
415

416
  tTombBlockInit(iter->dataTomb->tombBlock);
×
417
  iter->dataTomb->tombBlockIdx = 0;
×
418

419
  return tsdbDataTombIterNext(iter, NULL);
×
420
}
421

422
static int32_t tsdbMemTombIterOpen(STsdbIter *iter) {
16,037,382✔
423
  int32_t code;
424

425
  if (iter->memtTomb->memt->nDel == 0) {
16,037,382✔
426
    iter->noMoreData = true;
15,015,586✔
427
    return 0;
15,014,535✔
428
  }
429

430
  iter->memtTomb->rbtIter[0] = tRBTreeIterCreate(iter->memtTomb->memt->tbDataTree, 1);
1,024,253✔
431
  return tsdbMemTombIterNext(iter, NULL);
1,024,253✔
432
}
433

434
static int32_t tsdbDataIterClose(STsdbIter *iter) {
112,409✔
435
  tBrinBlockDestroy(iter->dataData->brinBlock);
112,409✔
436
  tBlockDataDestroy(iter->dataData->blockData);
112,409✔
437
  return 0;
112,409✔
438
}
439

440
static int32_t tsdbMemTableIterClose(STsdbIter *iter) { return 0; }
16,027,204✔
441

442
static int32_t tsdbSttTombIterNext(STsdbIter *iter, const TABLEID *tbid) {
5,916,473✔
443
  while (!iter->noMoreData) {
7,319,060✔
444
    for (; iter->sttTomb->tombBlockIdx < TOMB_BLOCK_SIZE(iter->sttTomb->tombBlock); iter->sttTomb->tombBlockIdx++) {
8,262,004✔
445
      int32_t code = tTombBlockGet(iter->sttTomb->tombBlock, iter->sttTomb->tombBlockIdx, iter->record);
5,456,830✔
446
      if (code) return code;
5,456,830✔
447

448
      if (iter->filterByVersion && (iter->record->version < iter->range[0] || iter->record->version > iter->range[1])) {
5,456,830✔
449
        continue;
×
450
      }
451

452
      if (tbid && iter->record->suid == tbid->suid && iter->record->uid == tbid->uid) {
5,456,830✔
453
        continue;
942,944✔
454
      }
455

456
      iter->sttTomb->tombBlockIdx++;
4,513,886✔
457
      goto _exit;
4,513,886✔
458
    }
459

460
    if (iter->sttTomb->tombBlkArrayIdx >= TARRAY2_SIZE(iter->sttTomb->tombBlkArray)) {
2,805,174✔
461
      iter->noMoreData = true;
1,402,587✔
462
      goto _exit;
1,402,587✔
463
    }
464

465
    for (; iter->sttTomb->tombBlkArrayIdx < TARRAY2_SIZE(iter->sttTomb->tombBlkArray);
1,402,587✔
466
         iter->sttTomb->tombBlkArrayIdx++) {
×
467
      const STombBlk *tombBlk = TARRAY2_GET_PTR(iter->sttTomb->tombBlkArray, iter->sttTomb->tombBlkArrayIdx);
1,402,587✔
468

469
      if (iter->filterByVersion && (tombBlk->maxVer < iter->range[0] || tombBlk->minVer > iter->range[1])) {
1,402,587✔
470
        continue;
×
471
      }
472

473
      if (tbid && tbid->suid == tombBlk->minTbid.suid && tbid->uid == tombBlk->minTbid.uid &&
1,402,587✔
474
          tbid->suid == tombBlk->maxTbid.suid && tbid->uid == tombBlk->maxTbid.uid) {
×
475
        continue;
×
476
      }
477

478
      int32_t code = tsdbSttFileReadTombBlock(iter->sttTomb->reader, tombBlk, iter->sttTomb->tombBlock);
1,402,587✔
479
      if (code) return code;
1,402,587✔
480

481
      iter->sttTomb->tombBlockIdx = 0;
1,402,587✔
482
      iter->sttTomb->tombBlkArrayIdx++;
1,402,587✔
483
      break;
1,402,587✔
484
    }
485
  }
486

487
_exit:
×
488
  return 0;
5,916,473✔
489
}
490

491
static int32_t tsdbSttTombIterOpen(STsdbIter *iter) {
2,760,729✔
492
  int32_t code;
493

494
  code = tsdbSttFileReadTombBlk(iter->sttTomb->reader, &iter->sttTomb->tombBlkArray);
2,760,729✔
495
  if (code) return code;
2,760,128✔
496

497
  if (TARRAY2_SIZE(iter->sttTomb->tombBlkArray) == 0) {
2,760,128✔
498
    iter->noMoreData = true;
1,358,142✔
499
    return 0;
1,358,142✔
500
  }
501

502
  iter->sttTomb->tombBlkArrayIdx = 0;
1,402,587✔
503
  tTombBlockInit(iter->sttTomb->tombBlock);
1,402,587✔
504
  iter->sttTomb->tombBlockIdx = 0;
1,402,587✔
505

506
  return tsdbSttTombIterNext(iter, NULL);
1,402,587✔
507
}
508

509
int32_t tsdbIterOpen(const STsdbIterConfig *config, STsdbIter **iter) {
37,790,288✔
510
  int32_t code;
511

512
  iter[0] = taosMemoryCalloc(1, sizeof(*iter[0]));
37,790,288✔
513
  if (iter[0] == NULL) {
37,789,578✔
514
    return terrno;
×
515
  }
516

517
  iter[0]->type = config->type;
37,794,872✔
518
  iter[0]->noMoreData = false;
37,803,573✔
519
  iter[0]->filterByVersion = config->filterByVersion;
37,804,811✔
520
  if (iter[0]->filterByVersion) {
37,811,034✔
521
    iter[0]->range[0] = config->verRange[0];
702✔
522
    iter[0]->range[1] = config->verRange[1];
702✔
523
  }
524

525
  switch (config->type) {
37,817,406✔
526
    case TSDB_ITER_TYPE_STT:
2,763,084✔
527
      iter[0]->sttData->reader = config->sttReader;
2,763,084✔
528
      code = tsdbSttIterOpen(iter[0]);
2,763,084✔
529
      break;
2,761,880✔
530
    case TSDB_ITER_TYPE_DATA:
112,409✔
531
      iter[0]->dataData->reader = config->dataReader;
112,409✔
532
      code = tsdbDataIterOpen(iter[0]);
112,409✔
533
      break;
112,409✔
534
    case TSDB_ITER_TYPE_MEMT:
16,022,931✔
535
      iter[0]->memtData->memt = config->memt;
16,022,931✔
536
      iter[0]->memtData->from[0] = config->from[0];
16,031,898✔
537
      code = tsdbMemTableIterOpen(iter[0]);
16,038,274✔
538
      break;
16,033,750✔
539
    case TSDB_ITER_TYPE_STT_TOMB:
2,761,880✔
540
      iter[0]->sttTomb->reader = config->sttReader;
2,761,880✔
541
      code = tsdbSttTombIterOpen(iter[0]);
2,760,729✔
542
      break;
2,760,126✔
543
    case TSDB_ITER_TYPE_DATA_TOMB:
112,409✔
544
      iter[0]->dataTomb->reader = config->dataReader;
112,409✔
545
      code = tsdbDataTombIterOpen(iter[0]);
112,409✔
546
      break;
112,409✔
547
    case TSDB_ITER_TYPE_MEMT_TOMB:
16,032,609✔
548
      iter[0]->memtTomb->memt = config->memt;
16,032,609✔
549
      code = tsdbMemTombIterOpen(iter[0]);
16,040,614✔
550
      break;
16,030,162✔
551
    default:
×
552
      return TSDB_CODE_INVALID_PARA;
×
553
  }
554

555
  if (code) {
37,810,736✔
556
    taosMemoryFree(iter[0]);
×
557
    iter[0] = NULL;
×
558
  }
559
  return code;
37,810,736✔
560
}
561

562
static int32_t tsdbSttTombIterClose(STsdbIter *iter) {
2,763,084✔
563
  tTombBlockDestroy(iter->sttTomb->tombBlock);
2,763,084✔
564
  return 0;
2,761,864✔
565
}
566

567
static int32_t tsdbDataTombIterClose(STsdbIter *iter) {
112,409✔
568
  tTombBlockDestroy(iter->dataTomb->tombBlock);
112,409✔
569
  return 0;
112,409✔
570
}
571

572
int32_t tsdbIterClose(STsdbIter **iter) {
37,804,414✔
573
  switch (iter[0]->type) {
37,804,414✔
574
    case TSDB_ITER_TYPE_STT:
2,763,084✔
575
      tsdbSttIterClose(iter[0]);
2,763,084✔
576
      break;
2,763,084✔
577
    case TSDB_ITER_TYPE_DATA:
112,409✔
578
      tsdbDataIterClose(iter[0]);
112,409✔
579
      break;
112,409✔
580
    case TSDB_ITER_TYPE_MEMT:
16,036,227✔
581
      tsdbMemTableIterClose(iter[0]);
16,036,227✔
582
      break;
16,030,589✔
583
    case TSDB_ITER_TYPE_STT_TOMB:
2,763,084✔
584
      tsdbSttTombIterClose(iter[0]);
2,763,084✔
585
      break;
2,761,864✔
586
    case TSDB_ITER_TYPE_DATA_TOMB:
112,409✔
587
      tsdbDataTombIterClose(iter[0]);
112,409✔
588
      break;
112,409✔
589
    case TSDB_ITER_TYPE_MEMT_TOMB:
16,030,346✔
590
      break;
16,030,346✔
591
    default:
×
592
      return TSDB_CODE_INVALID_PARA;
×
593
  }
594
  taosMemoryFree(iter[0]);
37,810,701✔
595
  iter[0] = NULL;
37,809,712✔
596
  return 0;
37,810,971✔
597
}
598

599
int32_t tsdbIterNext(STsdbIter *iter) {
2,147,483,647✔
600
  switch (iter->type) {
2,147,483,647✔
601
    case TSDB_ITER_TYPE_STT:
2,147,483,647✔
602
      return tsdbSttIterNext(iter, NULL);
2,147,483,647✔
603
    case TSDB_ITER_TYPE_DATA:
795,703,658✔
604
      return tsdbDataIterNext(iter, NULL);
795,703,658✔
605
    case TSDB_ITER_TYPE_MEMT:
2,147,483,647✔
606
      return tsdbMemTableIterNext(iter, NULL);
2,147,483,647✔
607
    case TSDB_ITER_TYPE_STT_TOMB:
4,416,281✔
608
      return tsdbSttTombIterNext(iter, NULL);
4,416,281✔
609
    case TSDB_ITER_TYPE_DATA_TOMB:
×
610
      return tsdbDataTombIterNext(iter, NULL);
×
UNCOV
611
    case TSDB_ITER_TYPE_MEMT_TOMB:
×
UNCOV
612
      return tsdbMemTombIterNext(iter, NULL);
×
613
    default:
×
614
      return TSDB_CODE_INVALID_PARA;
×
615
  }
616
  return 0;
617
}
618

619
static int32_t tsdbIterSkipTableData(STsdbIter *iter, const TABLEID *tbid) {
43,858,056✔
620
  switch (iter->type) {
43,858,056✔
621
    case TSDB_ITER_TYPE_STT:
347,077✔
622
      return tsdbSttIterNext(iter, tbid);
347,077✔
623
    case TSDB_ITER_TYPE_DATA:
30,096✔
624
      return tsdbDataIterNext(iter, tbid);
30,096✔
625
    case TSDB_ITER_TYPE_MEMT:
43,367,725✔
626
      return tsdbMemTableIterNext(iter, tbid);
43,367,725✔
627
    case TSDB_ITER_TYPE_STT_TOMB:
97,605✔
628
      return tsdbSttTombIterNext(iter, tbid);
97,605✔
629
    case TSDB_ITER_TYPE_DATA_TOMB:
×
630
      return tsdbDataTombIterNext(iter, tbid);
×
631
    case TSDB_ITER_TYPE_MEMT_TOMB:
19,318✔
632
      return tsdbMemTombIterNext(iter, tbid);
19,318✔
633
    default:
×
634
      return TSDB_CODE_INVALID_PARA;
×
635
  }
636
  return 0;
637
}
638

639
static int32_t tsdbIterCmprFn(const SRBTreeNode *n1, const SRBTreeNode *n2) {
2,147,483,647✔
640
  STsdbIter *iter1 = TCONTAINER_OF(n1, STsdbIter, node);
2,147,483,647✔
641
  STsdbIter *iter2 = TCONTAINER_OF(n2, STsdbIter, node);
2,147,483,647✔
642
  return tRowInfoCmprFn(&iter1->row, &iter2->row);
2,147,483,647✔
643
}
644

645
static int32_t tsdbTombIterCmprFn(const SRBTreeNode *n1, const SRBTreeNode *n2) {
9,944,850✔
646
  STsdbIter *iter1 = TCONTAINER_OF(n1, STsdbIter, node);
9,944,850✔
647
  STsdbIter *iter2 = TCONTAINER_OF(n2, STsdbIter, node);
9,944,850✔
648

649
  if (iter1->record->suid < iter2->record->suid) {
9,944,850✔
650
    return -1;
156,632✔
651
  } else if (iter1->record->suid > iter2->record->suid) {
9,788,218✔
652
    return 1;
104,975✔
653
  }
654

655
  if (iter1->record->uid < iter2->record->uid) {
9,683,243✔
656
    return -1;
711,502✔
657
  } else if (iter1->record->uid > iter2->record->uid) {
8,971,741✔
658
    return 1;
1,201,716✔
659
  }
660

661
  if (iter1->record->version < iter2->record->version) {
7,770,025✔
662
    return -1;
4,770,312✔
663
  } else if (iter1->record->version > iter2->record->version) {
2,999,713✔
664
    return 1;
2,999,713✔
665
  }
666

667
  return 0;
×
668
}
669

670
// SIterMerger ================
671
struct SIterMerger {
672
  bool       isTomb;
673
  STsdbIter *iter;
674
  SRBTree    iterTree[1];
675
};
676

677
int32_t tsdbIterMergerOpen(const TTsdbIterArray *iterArray, SIterMerger **merger, bool isTomb) {
34,205,172✔
678
  STsdbIter   *iter;
679
  SRBTreeNode *node;
680

681
  merger[0] = taosMemoryCalloc(1, sizeof(*merger[0]));
34,205,172✔
682
  if (merger[0] == NULL) {
34,191,436✔
683
    return terrno;
×
684
  }
685

686
  merger[0]->isTomb = isTomb;
34,192,006✔
687
  if (isTomb) {
34,204,741✔
688
    tRBTreeCreate(merger[0]->iterTree, tsdbTombIterCmprFn);
17,097,857✔
689
  } else {
690
    tRBTreeCreate(merger[0]->iterTree, tsdbIterCmprFn);
17,106,884✔
691
  }
692
  TARRAY2_FOREACH(iterArray, iter) {
72,043,886✔
693
    while (!iter->noMoreData) {
37,814,050✔
694
      if (tRBTreePut(merger[0]->iterTree, iter->node) == NULL) {
21,102,992✔
695
        int32_t code = tsdbIterNext(iter);
×
696
        if (code) {
×
697
          tsdbIterMergerClose(merger);
×
698
          return code;
×
699
        }
700
        continue;
×
701
      }
702
      break;
21,111,533✔
703
    }
704
  }
705

706
  return tsdbIterMergerNext(merger[0]);
34,197,211✔
707
}
708

709
void tsdbIterMergerClose(SIterMerger **merger) {
34,212,960✔
710
  if (merger[0]) {
34,212,960✔
711
    taosMemoryFree(merger[0]);
34,226,518✔
712
    merger[0] = NULL;
34,211,634✔
713
  }
714
}
34,210,454✔
715

716
int32_t tsdbIterMergerNext(SIterMerger *merger) {
2,147,483,647✔
717
  int32_t      code;
718
  int32_t      c;
719
  SRBTreeNode *node;
720

721
  while (merger->iter) {
2,147,483,647✔
722
    code = tsdbIterNext(merger->iter);
2,147,483,647✔
723
    if (code) return code;
2,147,483,647✔
724

725
    if (merger->iter->noMoreData) {
2,147,483,647✔
726
      merger->iter = NULL;
7,586,529✔
727
    } else if ((node = tRBTreeMin(merger->iterTree))) {
2,147,483,647✔
728
      c = merger->iterTree->cmprFn(merger->iter->node, node);
2,147,483,647✔
729
      if (c > 0) {
2,147,483,647✔
730
        node = tRBTreePut(merger->iterTree, merger->iter->node);
2,147,483,647✔
731
        merger->iter = NULL;
2,147,483,647✔
732
      } else if (c == 0) {
2,147,483,647✔
733
        continue;
×
734
      }
735
    }
736
    break;
2,147,483,647✔
737
  }
738

739
  if (merger->iter == NULL && (node = tRBTreeDropMin(merger->iterTree))) {
2,147,483,647✔
740
    merger->iter = TCONTAINER_OF(node, STsdbIter, node);
2,147,483,647✔
741
  }
742

743
  return 0;
2,147,483,647✔
744
}
745

746
SRowInfo *tsdbIterMergerGetData(SIterMerger *merger) { return merger->iter ? merger->iter->row : NULL; }
2,147,483,647✔
747

748
STombRecord *tsdbIterMergerGetTombRecord(SIterMerger *merger) { return merger->iter ? merger->iter->record : NULL; }
23,396,600✔
749

750
int32_t tsdbIterMergerSkipTableData(SIterMerger *merger, const TABLEID *tbid) {
43,796,558✔
751
  int32_t      code;
752
  int32_t      c;
753
  SRBTreeNode *node;
754

755
  while (merger->iter && tbid->suid == merger->iter->row->suid && tbid->uid == merger->iter->row->uid) {
87,666,870✔
756
    int32_t code = tsdbIterSkipTableData(merger->iter, tbid);
43,871,356✔
757
    if (code) return code;
43,872,439✔
758

759
    while (1) {
760
      if (merger->iter->noMoreData) {
43,872,439✔
761
        merger->iter = NULL;
13,540,059✔
762
      } else if ((node = tRBTreeMin(merger->iterTree))) {
30,332,818✔
763
        c = merger->iterTree->cmprFn(merger->iter->node, node);
234,446✔
764
        if (c > 0) {
234,446✔
765
          node = tRBTreePut(merger->iterTree, merger->iter->node);
91,691✔
766
          merger->iter = NULL;
91,691✔
767
        } else if (c == 0) {
142,755✔
768
          code = tsdbIterNext(merger->iter);
×
769
          if (code) return code;
×
770
          continue;
×
771
        }
772
      }
773
      break;
43,868,700✔
774
    }
775

776
    if (!merger->iter && (node = tRBTreeDropMin(merger->iterTree))) {
43,868,700✔
777
      merger->iter = TCONTAINER_OF(node, STsdbIter, node);
284,651✔
778
    }
779
  }
780

781
  return 0;
43,803,763✔
782
}
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