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

taosdata / TDengine / #5092

17 May 2026 01:15AM UTC coverage: 73.33% (+0.004%) from 73.326%
#5092

push

travis-ci

web-flow
feat (TDgpt): Dynamic Model Synchronization Enhancements (#35344)

* refactor: do some internal refactor.

* fix: fix multiprocess sync issue.

* feat: add dynamic anomaly detection and forecasting services

* fix: log error message for undeploying model in exception handling

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* fix: handle undeploy when model exists only on disk

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/286aafa0-c3ce-4c27-b803-2707571e9dc1

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: guard dynamic registry concurrent access

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/5e4db858-6458-40f4-ac28-d1b1b7f97c18

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: tighten service list locking scope

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/5e4db858-6458-40f4-ac28-d1b1b7f97c18

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: restore prophet support and update tests per review feedback

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/92298ae1-7da6-4d07-b20e-101c7cd0b26b

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: improve test name and move copy inside lock scope

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/92298ae1-7da6-4d07-b20e-101c7cd0b26b

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* Potential fix for pull request finding

Co-au... (continued)

281438 of 383795 relevant lines covered (73.33%)

132710973.38 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;
74,475,270✔
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)) {
21,321,454✔
99
      iter->noMoreData = true;
3,123,693✔
100
      break;
7,950,464✔
101
    }
102

103
    for (; iter->sttData->sttBlkArrayIdx < TARRAY2_SIZE(iter->sttData->sttBlkArray); iter->sttData->sttBlkArrayIdx++) {
18,500,928✔
104
      const SSttBlk *sttBlk = TARRAY2_GET_PTR(iter->sttData->sttBlkArray, iter->sttData->sttBlkArrayIdx);
18,494,751✔
105

106
      if (iter->filterByVersion && (sttBlk->maxVer < iter->range[0] || sttBlk->minVer > iter->range[1])) {
18,494,028✔
107
        continue;
5,782✔
108
      }
109

110
      if (tbid && tbid->suid == sttBlk->suid && tbid->uid == sttBlk->minUid && tbid->uid == sttBlk->maxUid) {
18,488,966✔
111
        continue;
298,108✔
112
      }
113

114
      int32_t code = tsdbSttFileReadBlockData(iter->sttData->reader, sttBlk, iter->sttData->blockData);
18,190,858✔
115
      if (code) return code;
18,190,136✔
116

117
      iter->sttData->blockDataIdx = 0;
18,190,136✔
118
      iter->sttData->sttBlkArrayIdx++;
18,190,136✔
119
      break;
18,190,139✔
120
    }
121
  }
122

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

127
static int32_t tsdbDataIterNext(STsdbIter *iter, const TABLEID *tbid) {
1,299,501,672✔
128
  int32_t code;
129

130
  while (!iter->noMoreData) {
1,299,530,787✔
131
    for (;;) {
132
      // SBlockData
133
      for (; iter->dataData->blockDataIdx < iter->dataData->blockData->nRow; iter->dataData->blockDataIdx++) {
1,301,340,844✔
134
        int64_t version = iter->dataData->blockData->aVersion[iter->dataData->blockDataIdx];
1,300,917,953✔
135
        if (iter->filterByVersion && (version < iter->range[0] || version > iter->range[1])) {
1,300,915,342✔
136
          continue;
1,400,000✔
137
        }
138

139
        if (tbid && tbid->suid == iter->dataData->blockData->suid && tbid->uid == iter->dataData->blockData->uid) {
1,299,515,793✔
140
          iter->dataData->blockDataIdx = iter->dataData->blockData->nRow;
40,056✔
141
          break;
40,056✔
142
        }
143

144
        iter->row->row = tsdbRowFromBlockData(iter->dataData->blockData, iter->dataData->blockDataIdx);
1,299,475,737✔
145
        iter->dataData->blockDataIdx++;
1,299,477,698✔
146
        goto _exit;
1,299,477,158✔
147
      }
148

149
      // SBrinBlock
150
      if (iter->dataData->brinBlockIdx >= iter->dataData->brinBlock->numOfRecords) {
461,245✔
151
        break;
58,230✔
152
      }
153

154
      for (; iter->dataData->brinBlockIdx < iter->dataData->brinBlock->numOfRecords; iter->dataData->brinBlockIdx++) {
446,602✔
155
        SBrinRecord record[1];
434,160✔
156
        code = tBrinBlockGet(iter->dataData->brinBlock, iter->dataData->brinBlockIdx, record);
434,160✔
157
        if (code) return code;
434,160✔
158

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

163
        if (tbid && tbid->suid == record->suid && tbid->uid == record->uid) {
434,160✔
164
          continue;
42,516✔
165
        }
166

167
        iter->row->suid = record->suid;
391,644✔
168
        iter->row->uid = record->uid;
391,644✔
169

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

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

179
    if (iter->dataData->brinBlkArrayIdx >= TARRAY2_SIZE(iter->dataData->brinBlkArray)) {
58,230✔
180
      iter->noMoreData = true;
29,115✔
181
      break;
28,285✔
182
    }
183

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

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

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

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

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

205
_exit:
×
206
  return 0;
1,299,504,633✔
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;
48,538,530✔
216
        break;
48,539,262✔
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);
144,107,074✔
234
      if (!node) {
144,125,097✔
235
        iter->noMoreData = true;
20,012,607✔
236
        goto _exit;
32,573,867✔
237
      }
238

239
      iter->memtData->tbData = TCONTAINER_OF(node, STbData, rbtn);
124,112,490✔
240
      if (tbid && tbid->suid == iter->memtData->tbData->suid && tbid->uid == iter->memtData->tbData->uid) {
124,109,817✔
241
        continue;
×
242
      } else {
243
        iter->row->suid = iter->memtData->tbData->suid;
124,110,626✔
244
        iter->row->uid = iter->memtData->tbData->uid;
124,111,935✔
245
        tsdbTbDataIterOpen(iter->memtData->tbData, iter->memtData->from, 0, iter->memtData->tbIter);
124,123,382✔
246
        break;
124,027,472✔
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) {
3,345,773✔
300
  while (!iter->noMoreData) {
5,672,621✔
301
    for (; iter->memtTomb->delData;) {
5,672,621✔
302
      if (tbid && tbid->uid == iter->memtTomb->tbData->uid) {
2,119,106✔
303
        iter->memtTomb->delData = NULL;
×
304
        break;
×
305
      }
306

307
      if (iter->filterByVersion &&
2,119,106✔
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;
2,119,106✔
313
      iter->record->uid = iter->memtTomb->tbData->uid;
2,119,106✔
314
      iter->record->version = iter->memtTomb->delData->version;
2,119,106✔
315
      iter->record->skey = iter->memtTomb->delData->sKey;
2,119,106✔
316
      iter->record->ekey = iter->memtTomb->delData->eKey;
2,119,106✔
317

318
      iter->memtTomb->delData = iter->memtTomb->delData->pNext;
2,119,106✔
319
      goto _exit;
2,119,106✔
320
    }
321

322
    for (;;) {
×
323
      SRBTreeNode *node = tRBTreeIterNext(iter->memtTomb->rbtIter);
3,553,515✔
324
      if (node == NULL) {
3,553,515✔
325
        iter->noMoreData = true;
1,226,667✔
326
        goto _exit;
1,226,667✔
327
      }
328

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

339
_exit:
×
340
  return 0;
3,345,773✔
341
}
342

343
static int32_t tsdbSttIterOpen(STsdbIter *iter) {
3,176,486✔
344
  int32_t code;
345

346
  code = tsdbSttFileReadSttBlk(iter->sttData->reader, &iter->sttData->sttBlkArray);
3,176,486✔
347
  if (code) return code;
3,176,489✔
348

349
  if (TARRAY2_SIZE(iter->sttData->sttBlkArray) == 0) {
3,176,489✔
350
    iter->noMoreData = true;
53,400✔
351
    return 0;
53,400✔
352
  }
353

354
  iter->sttData->sttBlkArrayIdx = 0;
3,122,366✔
355
  code = tBlockDataCreate(iter->sttData->blockData);
3,122,366✔
356
  if (code) return code;
3,123,089✔
357
  iter->sttData->blockDataIdx = 0;
3,123,089✔
358

359
  return tsdbSttIterNext(iter, NULL);
3,123,089✔
360
}
361

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

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

369
  if (TARRAY2_SIZE(iter->dataData->brinBlkArray) == 0) {
136,620✔
370
    iter->noMoreData = true;
107,505✔
371
    return 0;
107,505✔
372
  }
373

374
  iter->dataData->brinBlkArrayIdx = 0;
29,115✔
375

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

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

386
  return tsdbDataIterNext(iter, NULL);
29,115✔
387
}
388

389
static int32_t tsdbMemTableIterOpen(STsdbIter *iter) {
20,080,912✔
390
  if (iter->memtData->memt->nRow == 0) {
20,080,912✔
391
    iter->noMoreData = true;
86,512✔
392
    return 0;
86,512✔
393
  }
394

395
  iter->memtData->iter[0] = tRBTreeIterCreate(iter->memtData->memt->tbDataTree, 1);
20,011,449✔
396
  return tsdbMemTableIterNext(iter, NULL);
20,008,739✔
397
}
398

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

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

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

410
  if (TARRAY2_SIZE(iter->dataTomb->tombBlkArray) == 0) {
136,620✔
411
    iter->noMoreData = true;
136,620✔
412
    return 0;
136,620✔
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) {
20,096,071✔
423
  int32_t code;
424

425
  if (iter->memtTomb->memt->nDel == 0) {
20,096,071✔
426
    iter->noMoreData = true;
18,867,909✔
427
    return 0;
18,869,801✔
428
  }
429

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

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

440
static int32_t tsdbMemTableIterClose(STsdbIter *iter) { return 0; }
20,091,094✔
441

442
static int32_t tsdbSttTombIterNext(STsdbIter *iter, const TABLEID *tbid) {
7,057,112✔
443
  while (!iter->noMoreData) {
8,733,961✔
444
    for (; iter->sttTomb->tombBlockIdx < TOMB_BLOCK_SIZE(iter->sttTomb->tombBlock); iter->sttTomb->tombBlockIdx++) {
9,856,141✔
445
      int32_t code = tTombBlockGet(iter->sttTomb->tombBlock, iter->sttTomb->tombBlockIdx, iter->record);
6,502,443✔
446
      if (code) return code;
6,502,443✔
447

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

452
      if (tbid && iter->record->suid == tbid->suid && iter->record->uid == tbid->uid) {
6,502,443✔
453
        continue;
1,122,180✔
454
      }
455

456
      iter->sttTomb->tombBlockIdx++;
5,380,263✔
457
      goto _exit;
5,380,263✔
458
    }
459

460
    if (iter->sttTomb->tombBlkArrayIdx >= TARRAY2_SIZE(iter->sttTomb->tombBlkArray)) {
3,353,698✔
461
      iter->noMoreData = true;
1,676,849✔
462
      goto _exit;
1,676,849✔
463
    }
464

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

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

473
      if (tbid && tbid->suid == tombBlk->minTbid.suid && tbid->uid == tombBlk->minTbid.uid &&
1,676,849✔
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,676,849✔
479
      if (code) return code;
1,676,849✔
480

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

487
_exit:
×
488
  return 0;
7,057,112✔
489
}
490

491
static int32_t tsdbSttTombIterOpen(STsdbIter *iter) {
3,176,486✔
492
  int32_t code;
493

494
  code = tsdbSttFileReadTombBlk(iter->sttTomb->reader, &iter->sttTomb->tombBlkArray);
3,176,486✔
495
  if (code) return code;
3,173,599✔
496

497
  if (TARRAY2_SIZE(iter->sttTomb->tombBlkArray) == 0) {
3,173,599✔
498
    iter->noMoreData = true;
1,498,268✔
499
    return 0;
1,499,710✔
500
  }
501

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

506
  return tsdbSttTombIterNext(iter, NULL);
1,676,849✔
507
}
508

509
int32_t tsdbIterOpen(const STsdbIterConfig *config, STsdbIter **iter) {
46,794,130✔
510
  int32_t code;
511

512
  iter[0] = taosMemoryCalloc(1, sizeof(*iter[0]));
46,794,130✔
513
  if (iter[0] == NULL) {
46,796,469✔
514
    return terrno;
×
515
  }
516

517
  iter[0]->type = config->type;
46,800,037✔
518
  iter[0]->noMoreData = false;
46,807,906✔
519
  iter[0]->filterByVersion = config->filterByVersion;
46,804,263✔
520
  if (iter[0]->filterByVersion) {
46,814,931✔
521
    iter[0]->range[0] = config->verRange[0];
1,032✔
522
    iter[0]->range[1] = config->verRange[1];
1,032✔
523
  }
524

525
  switch (config->type) {
46,812,794✔
526
    case TSDB_ITER_TYPE_STT:
3,176,486✔
527
      iter[0]->sttData->reader = config->sttReader;
3,176,486✔
528
      code = tsdbSttIterOpen(iter[0]);
3,177,209✔
529
      break;
3,176,489✔
530
    case TSDB_ITER_TYPE_DATA:
136,620✔
531
      iter[0]->dataData->reader = config->dataReader;
136,620✔
532
      code = tsdbDataIterOpen(iter[0]);
136,620✔
533
      break;
136,620✔
534
    case TSDB_ITER_TYPE_MEMT:
20,084,258✔
535
      iter[0]->memtData->memt = config->memt;
20,084,258✔
536
      iter[0]->memtData->from[0] = config->from[0];
20,092,615✔
537
      code = tsdbMemTableIterOpen(iter[0]);
20,091,527✔
538
      break;
20,097,367✔
539
    case TSDB_ITER_TYPE_STT_TOMB:
3,176,486✔
540
      iter[0]->sttTomb->reader = config->sttReader;
3,176,486✔
541
      code = tsdbSttTombIterOpen(iter[0]);
3,176,486✔
542
      break;
3,174,394✔
543
    case TSDB_ITER_TYPE_DATA_TOMB:
136,620✔
544
      iter[0]->dataTomb->reader = config->dataReader;
136,620✔
545
      code = tsdbDataTombIterOpen(iter[0]);
136,620✔
546
      break;
135,897✔
547
    case TSDB_ITER_TYPE_MEMT_TOMB:
20,093,068✔
548
      iter[0]->memtTomb->memt = config->memt;
20,093,068✔
549
      code = tsdbMemTombIterOpen(iter[0]);
20,097,486✔
550
      break;
20,089,408✔
551
    default:
×
552
      return TSDB_CODE_INVALID_PARA;
×
553
  }
554

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

562
static int32_t tsdbSttTombIterClose(STsdbIter *iter) {
3,176,543✔
563
  tTombBlockDestroy(iter->sttTomb->tombBlock);
3,176,543✔
564
  return 0;
3,176,543✔
565
}
566

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

572
int32_t tsdbIterClose(STsdbIter **iter) {
46,806,635✔
573
  switch (iter[0]->type) {
46,806,635✔
574
    case TSDB_ITER_TYPE_STT:
3,176,543✔
575
      tsdbSttIterClose(iter[0]);
3,176,543✔
576
      break;
3,177,209✔
577
    case TSDB_ITER_TYPE_DATA:
136,620✔
578
      tsdbDataIterClose(iter[0]);
136,620✔
579
      break;
136,620✔
580
    case TSDB_ITER_TYPE_MEMT:
20,096,626✔
581
      tsdbMemTableIterClose(iter[0]);
20,096,626✔
582
      break;
20,092,779✔
583
    case TSDB_ITER_TYPE_STT_TOMB:
3,176,543✔
584
      tsdbSttTombIterClose(iter[0]);
3,176,543✔
585
      break;
3,176,543✔
586
    case TSDB_ITER_TYPE_DATA_TOMB:
136,620✔
587
      tsdbDataTombIterClose(iter[0]);
136,620✔
588
      break;
136,620✔
589
    case TSDB_ITER_TYPE_MEMT_TOMB:
20,091,773✔
590
      break;
20,091,773✔
591
    default:
×
592
      return TSDB_CODE_INVALID_PARA;
×
593
  }
594
  taosMemoryFree(iter[0]);
46,811,544✔
595
  iter[0] = NULL;
46,809,289✔
596
  return 0;
46,809,451✔
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:
1,299,435,817✔
604
      return tsdbDataIterNext(iter, NULL);
1,299,435,817✔
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:
5,264,376✔
608
      return tsdbSttTombIterNext(iter, NULL);
5,264,376✔
609
    case TSDB_ITER_TYPE_DATA_TOMB:
×
610
      return tsdbDataTombIterNext(iter, NULL);
×
611
    case TSDB_ITER_TYPE_MEMT_TOMB:
34,563,903✔
612
      return tsdbMemTombIterNext(iter, NULL);
34,563,903✔
613
    default:
×
614
      return TSDB_CODE_INVALID_PARA;
×
615
  }
616
  return 0;
617
}
618

619
static int32_t tsdbIterSkipTableData(STsdbIter *iter, const TABLEID *tbid) {
54,000,172✔
620
  switch (iter->type) {
54,000,172✔
621
    case TSDB_ITER_TYPE_STT:
384,986✔
622
      return tsdbSttIterNext(iter, tbid);
384,986✔
623
    case TSDB_ITER_TYPE_DATA:
40,056✔
624
      return tsdbDataIterNext(iter, tbid);
40,056✔
625
    case TSDB_ITER_TYPE_MEMT:
53,438,560✔
626
      return tsdbMemTableIterNext(iter, tbid);
53,438,560✔
627
    case TSDB_ITER_TYPE_STT_TOMB:
115,887✔
628
      return tsdbSttTombIterNext(iter, tbid);
115,887✔
629
    case TSDB_ITER_TYPE_DATA_TOMB:
×
630
      return tsdbDataTombIterNext(iter, tbid);
×
631
    case TSDB_ITER_TYPE_MEMT_TOMB:
25,304✔
632
      return tsdbMemTombIterNext(iter, tbid);
25,304✔
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) {
11,846,950✔
646
  STsdbIter *iter1 = TCONTAINER_OF(n1, STsdbIter, node);
11,846,950✔
647
  STsdbIter *iter2 = TCONTAINER_OF(n2, STsdbIter, node);
11,846,950✔
648

649
  if (iter1->record->suid < iter2->record->suid) {
11,846,950✔
650
    return -1;
178,230✔
651
  } else if (iter1->record->suid > iter2->record->suid) {
11,668,720✔
652
    return 1;
143,886✔
653
  }
654

655
  if (iter1->record->uid < iter2->record->uid) {
11,524,834✔
656
    return -1;
835,824✔
657
  } else if (iter1->record->uid > iter2->record->uid) {
10,689,010✔
658
    return 1;
1,432,218✔
659
  }
660

661
  if (iter1->record->version < iter2->record->version) {
9,256,792✔
662
    return -1;
5,676,386✔
663
  } else if (iter1->record->version > iter2->record->version) {
3,580,406✔
664
    return 1;
3,580,406✔
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) {
42,634,831✔
678
  STsdbIter   *iter;
679
  SRBTreeNode *node;
680

681
  merger[0] = taosMemoryCalloc(1, sizeof(*merger[0]));
42,634,831✔
682
  if (merger[0] == NULL) {
42,626,412✔
683
    return terrno;
×
684
  }
685

686
  merger[0]->isTomb = isTomb;
42,628,004✔
687
  if (isTomb) {
42,633,928✔
688
    tRBTreeCreate(merger[0]->iterTree, tsdbTombIterCmprFn);
21,314,158✔
689
  } else {
690
    tRBTreeCreate(merger[0]->iterTree, tsdbIterCmprFn);
21,319,770✔
691
  }
692
  TARRAY2_FOREACH(iterArray, iter) {
89,464,319✔
693
    while (!iter->noMoreData) {
46,814,263✔
694
      if (tRBTreePut(merger[0]->iterTree, iter->node) == NULL) {
26,050,548✔
695
        int32_t code = tsdbIterNext(iter);
×
696
        if (code) {
×
697
          tsdbIterMergerClose(merger);
×
698
          return code;
×
699
        }
700
        continue;
×
701
      }
702
      break;
26,056,942✔
703
    }
704
  }
705

706
  return tsdbIterMergerNext(merger[0]);
42,640,552✔
707
}
708

709
void tsdbIterMergerClose(SIterMerger **merger) {
42,637,193✔
710
  if (merger[0]) {
42,637,193✔
711
    taosMemoryFree(merger[0]);
42,643,982✔
712
    merger[0] = NULL;
42,638,607✔
713
  }
714
}
42,633,985✔
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;
9,053,963✔
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; }
28,829,926✔
749

750
int32_t tsdbIterMergerSkipTableData(SIterMerger *merger, const TABLEID *tbid) {
53,924,528✔
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) {
107,936,092✔
756
    int32_t code = tsdbIterSkipTableData(merger->iter, tbid);
54,010,572✔
757
    if (code) return code;
54,008,569✔
758

759
    while (1) {
760
      if (merger->iter->noMoreData) {
54,008,569✔
761
        merger->iter = NULL;
17,005,320✔
762
      } else if ((node = tRBTreeMin(merger->iterTree))) {
37,004,712✔
763
        c = merger->iterTree->cmprFn(merger->iter->node, node);
170,494✔
764
        if (c > 0) {
170,494✔
765
          node = tRBTreePut(merger->iterTree, merger->iter->node);
108,317✔
766
          merger->iter = NULL;
108,317✔
767
        } else if (c == 0) {
62,177✔
768
          code = tsdbIterNext(merger->iter);
×
769
          if (code) return code;
×
770
          continue;
×
771
        }
772
      }
773
      break;
54,006,686✔
774
    }
775

776
    if (!merger->iter && (node = tRBTreeDropMin(merger->iterTree))) {
54,006,686✔
777
      merger->iter = TCONTAINER_OF(node, STsdbIter, node);
236,262✔
778
    }
779
  }
780

781
  return 0;
53,923,692✔
782
}
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE TRIAL · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc