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

taosdata / TDengine / #3593

24 Jan 2025 08:57AM UTC coverage: 63.239% (-0.3%) from 63.546%
#3593

push

travis-ci

web-flow
Merge pull request #29638 from taosdata/docs/TS-5846-3.0

enh: TDengine modify taosBenchmark new query rule cases and add doc

140619 of 285630 branches covered (49.23%)

Branch coverage included in aggregate %.

218877 of 282844 relevant lines covered (77.38%)

19647377.39 hits per line

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

74.57
/source/libs/executor/src/mergeoperator.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 "executorInt.h"
17
#include "filter.h"
18
#include "operator.h"
19
#include "querytask.h"
20
#include "tdatablock.h"
21

22
typedef struct SSortMergeInfo {
23
  SArray*        pSortInfo;
24
  SSortHandle*   pSortHandle;
25
  STupleHandle*  prefetchedTuple;
26
  int32_t        bufPageSize;
27
  uint32_t       sortBufSize;  // max buffer size for in-memory sort
28
  SSDataBlock*   pIntermediateBlock;   // to hold the intermediate result
29
  SSDataBlock*   pInputBlock;
30
  SColMatchInfo  matchInfo;
31
} SSortMergeInfo;
32

33
typedef struct SNonSortMergeInfo {
34
  int32_t  lastSourceIdx;
35
  int32_t  sourceWorkIdx;
36
  int32_t  sourceNum;
37
  int32_t* pSourceStatus;
38
} SNonSortMergeInfo;
39

40
typedef struct SColsMergeInfo {
41
  SNodeList* pTargets;
42
  uint64_t   srcBlkIds[2]; 
43
} SColsMergeInfo;
44

45
typedef struct SMultiwayMergeOperatorInfo {
46
  SOptrBasicInfo binfo;
47
  EMergeType     type;
48
  union {
49
    SSortMergeInfo    sortMergeInfo;
50
    SNonSortMergeInfo nsortMergeInfo;
51
    SColsMergeInfo    colsMergeInfo;
52
  };
53
  SLimitInfo     limitInfo;
54
  bool           groupMerge;
55
  bool           ignoreGroupId;
56
  uint64_t       groupId;
57
  bool           inputWithGroupId;
58
} SMultiwayMergeOperatorInfo;
59

60
static int32_t doSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock);
61
static int32_t doMultiwayMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock);
62
static int32_t doNonSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock);
63
static int32_t doColsMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock);
64
static int32_t sortMergeloadNextDataBlock(void* param, SSDataBlock** ppBlock);
65

66
int32_t sortMergeloadNextDataBlock(void* param, SSDataBlock** ppBlock) {
10,330,327✔
67
  SOperatorInfo* pOperator = (SOperatorInfo*)param;
10,330,327✔
68
  int32_t        code = pOperator->fpSet.getNextFn(pOperator, ppBlock);
10,330,327✔
69
  if (code) {
10,329,916!
70
    qError("failed to get next data block from upstream, %s code:%s", __func__, tstrerror(code));
×
71
  }
72
  code = blockDataCheck(*ppBlock);
10,329,916✔
73
  if (code) {
10,329,909!
74
    qError("failed to check data block got from upstream, %s code:%s", __func__, tstrerror(code));
×
75
  }
76
  return code;
10,329,910✔
77
}
78

79
int32_t openSortMergeOperator(SOperatorInfo* pOperator) {
1,337,491✔
80
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
1,337,491✔
81
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
1,337,491✔
82
  SSortMergeInfo*             pSortMergeInfo = &pInfo->sortMergeInfo;
1,337,491✔
83

84
  int32_t numOfBufPage = pSortMergeInfo->sortBufSize / pSortMergeInfo->bufPageSize;
1,337,491✔
85

86
  pSortMergeInfo->pSortHandle = NULL;
1,337,491✔
87
  int32_t code = tsortCreateSortHandle(pSortMergeInfo->pSortInfo, SORT_MULTISOURCE_MERGE, pSortMergeInfo->bufPageSize,
1,337,491✔
88
                                       numOfBufPage, pSortMergeInfo->pInputBlock, pTaskInfo->id.str, 0, 0, 0, &pSortMergeInfo->pSortHandle);
1,337,491✔
89
  if (code) {
1,337,518!
90
    return code;
×
91
  }
92

93
  tsortSetFetchRawDataFp(pSortMergeInfo->pSortHandle, sortMergeloadNextDataBlock, NULL, NULL);
1,337,518✔
94
  tsortSetCompareGroupId(pSortMergeInfo->pSortHandle, pInfo->groupMerge);
1,337,507✔
95

96
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
4,066,267✔
97
    SOperatorInfo* pDownstream = pOperator->pDownstream[i];
2,728,757✔
98
    if (pDownstream->operatorType == QUERY_NODE_PHYSICAL_PLAN_EXCHANGE) {
2,728,757!
99
      code = pDownstream->fpSet._openFn(pDownstream);
2,728,758✔
100
      if (code) {
2,728,741!
101
        return code;
×
102
      }
103
    }
104

105
    SSortSource* ps = taosMemoryCalloc(1, sizeof(SSortSource));
2,728,740!
106
    if (ps == NULL) {
2,728,830!
107
      return terrno;
×
108
    }
109

110
    ps->param = pDownstream;
2,728,830✔
111
    ps->onlyRef = true;
2,728,830✔
112

113
    code = tsortAddSource(pSortMergeInfo->pSortHandle, ps);
2,728,830✔
114
    if (code) {
2,728,748!
115
      return code;
×
116
    }
117
  }
118

119
  return tsortOpen(pSortMergeInfo->pSortHandle);
1,337,510✔
120
}
121

122
static int32_t doGetSortedBlockData(SMultiwayMergeOperatorInfo* pInfo, SSortHandle* pHandle, int32_t capacity,
7,510,091✔
123
                                 SSDataBlock* p, bool* newgroup) {
124
  SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
7,510,091✔
125
  *newgroup = false;
7,510,091✔
126
  int32_t code = 0;
7,510,091✔
127

128
  while (1) {
2,147,483,647✔
129
    STupleHandle* pTupleHandle = NULL;
2,147,483,647✔
130
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
2,147,483,647✔
131
      if (pSortMergeInfo->prefetchedTuple == NULL) {
2,147,483,647✔
132
        pTupleHandle = NULL;
2,147,483,647✔
133
        code = tsortNextTuple(pHandle, &pTupleHandle);
2,147,483,647✔
134
        if (code) {
135
          // todo handle error
136
        }
137
      } else {
138
        pTupleHandle = pSortMergeInfo->prefetchedTuple;
85,419✔
139
        pSortMergeInfo->prefetchedTuple = NULL;
85,419✔
140
        uint64_t gid = tsortGetGroupId(pTupleHandle);
85,419✔
141
        if (gid != pInfo->groupId) {
85,419!
142
          *newgroup = true;
85,419✔
143
          pInfo->groupId = gid;
85,419✔
144
        }
145
      }
146
    } else {
147
      code = tsortNextTuple(pHandle, &pTupleHandle);
18,502,025✔
148
      pInfo->groupId = 0;
18,288,977✔
149
    }
150

151
    if (pTupleHandle == NULL || (code != 0)) {
2,147,483,647!
152
      break;
153
    }
154

155
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
2,147,483,647✔
156
      uint64_t tupleGroupId = tsortGetGroupId(pTupleHandle);
2,147,483,647✔
157
      if (pInfo->groupId == 0 || pInfo->groupId == tupleGroupId) {
2,147,483,647✔
158
        code = appendOneRowToDataBlock(p, pTupleHandle);
2,147,483,647✔
159
        if (code) {
2,147,483,647!
160
          return code;
×
161
        }
162

163
        p->info.id.groupId = tupleGroupId;
2,147,483,647✔
164
        pInfo->groupId = tupleGroupId;
2,147,483,647✔
165
      } else {
166
        if (p->info.rows == 0) {
85,522✔
167
          code = appendOneRowToDataBlock(p, pTupleHandle);
14✔
168
          if (code) {
14!
169
            return code;
×
170
          }
171

172
          p->info.id.groupId = pInfo->groupId = tupleGroupId;
14✔
173
        } else {
174
          pSortMergeInfo->prefetchedTuple = pTupleHandle;
85,508✔
175
          break;
85,508✔
176
        }
177
      }
178
    } else {
179
      code = appendOneRowToDataBlock(p, pTupleHandle);
18,215,071✔
180
      if (code) {
18,433,255!
181
        return code;
×
182
      }
183
    }
184

185
    if (p->info.rows >= capacity) {
2,147,483,647✔
186
      break;
5,142,058✔
187
    }
188
  }
189

190
  return code;
7,493,658✔
191
}
192

193
int32_t doSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
7,510,099✔
194
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
7,510,099✔
195
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
7,510,099✔
196
  SSortMergeInfo*             pSortMergeInfo = &pInfo->sortMergeInfo;
7,510,099✔
197
  SSortHandle*                pHandle = pSortMergeInfo->pSortHandle;
7,510,099✔
198
  SSDataBlock*                pDataBlock = pInfo->binfo.pRes;
7,510,099✔
199
  SArray*                     pColMatchInfo = pSortMergeInfo->matchInfo.pList;
7,510,099✔
200
  int32_t                     capacity = pOperator->resultInfo.capacity;
7,510,099✔
201
  int32_t                     code = 0;
7,510,099✔
202
  bool                        newgroup = false;
7,510,099✔
203

204
  qDebug("start to merge final sorted rows, %s", GET_TASKID(pTaskInfo));
7,510,099✔
205
  blockDataCleanup(pDataBlock);
7,510,099✔
206

207
  if (pSortMergeInfo->pIntermediateBlock == NULL) {
7,509,997✔
208
    pSortMergeInfo->pIntermediateBlock = NULL;
1,337,514✔
209
    code = tsortGetSortedDataBlock(pHandle, &pSortMergeInfo->pIntermediateBlock);
1,337,514✔
210
    if (pSortMergeInfo->pIntermediateBlock == NULL || code != 0) {
1,337,517!
211
      return code;
×
212
    }
213

214
    code = blockDataEnsureCapacity(pSortMergeInfo->pIntermediateBlock, capacity);
1,337,518✔
215
    if (code) {
1,337,517!
216
      return code;
×
217
    }
218

219
  } else {
220
    blockDataCleanup(pSortMergeInfo->pIntermediateBlock);
6,172,483✔
221
  }
222

223
  SSDataBlock* p = pSortMergeInfo->pIntermediateBlock;
7,510,018✔
224
  while (1) {
71✔
225
    code = doGetSortedBlockData(pInfo, pHandle, capacity, p, &newgroup);
7,510,089✔
226
    if (code) {
7,510,152!
227
      return code;
×
228
    }
229

230
    if (p->info.rows == 0) {
7,510,152✔
231
      break;
1,302,381✔
232
    }
233

234
    if (newgroup) {
6,207,771✔
235
      resetLimitInfoForNextGroup(&pInfo->limitInfo);
85,419✔
236
    }
237

238
    bool limitReached = applyLimitOffset(&pInfo->limitInfo, p, pTaskInfo);
6,207,771✔
239

240
    if (p->info.rows > 0) {
6,207,844✔
241
      break;
6,207,773✔
242
    }
243
  }
244

245
  if (p->info.rows > 0) {
7,510,154✔
246
    int32_t numOfCols = taosArrayGetSize(pColMatchInfo);
6,207,773✔
247
    for (int32_t i = 0; i < numOfCols; ++i) {
19,140,192✔
248
      SColMatchItem* pmInfo = taosArrayGet(pColMatchInfo, i);
12,932,490✔
249
      if (pmInfo == NULL) {
12,932,278!
250
        code = terrno;
×
251
        return code;
×
252
      }
253

254
      SColumnInfoData* pSrc = taosArrayGet(p->pDataBlock, pmInfo->srcSlotId);
12,932,278✔
255
      if (pSrc == NULL) {
12,932,068!
256
        code = terrno;
×
257
        return code;
×
258
      }
259

260
      SColumnInfoData* pDst = taosArrayGet(pDataBlock->pDataBlock, pmInfo->dstSlotId);
12,932,068✔
261
      if (pDst == NULL) {
12,931,901!
262
        code = terrno;
×
263
        return code;
×
264
      }
265

266
      code = colDataAssign(pDst, pSrc, p->info.rows, &pDataBlock->info);
12,931,901✔
267
      if (code) {
12,932,434!
268
        return code;
×
269
      }
270
    }
271

272
    pDataBlock->info.rows = p->info.rows;
6,207,702✔
273
    pDataBlock->info.scanFlag = p->info.scanFlag;
6,207,702✔
274
    if (pInfo->ignoreGroupId) {
6,207,702✔
275
      pDataBlock->info.id.groupId = 0;
8✔
276
    } else {
277
      pDataBlock->info.id.groupId = pInfo->groupId;
6,207,694✔
278
    }
279
    pDataBlock->info.dataLoad = 1;
6,207,702✔
280
  }
281

282
  qDebug("%s get sorted block, groupId:0x%" PRIx64 " rows:%" PRId64 , GET_TASKID(pTaskInfo), pDataBlock->info.id.groupId,
7,510,083✔
283
         pDataBlock->info.rows);
284

285
  *pResBlock = (pDataBlock->info.rows > 0) ? pDataBlock : NULL;
7,510,140✔
286
  return code;
7,510,140✔
287
}
288

289
int32_t getSortMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
124,553✔
290
  SSortExecInfo* pSortExecInfo = taosMemoryCalloc(1, sizeof(SSortExecInfo));
124,553!
291
  if (pSortExecInfo == NULL) {
124,553!
292
    pOptr->pTaskInfo->code = terrno;
×
293
    return terrno;
×
294
  }
295

296
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)pOptr->info;
124,553✔
297
  SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
124,553✔
298

299
  *pSortExecInfo = tsortGetSortExecInfo(pSortMergeInfo->pSortHandle);
124,553✔
300
  *pOptrExplain = pSortExecInfo;
124,553✔
301

302
  *len = sizeof(SSortExecInfo);
124,553✔
303
  return TSDB_CODE_SUCCESS;
124,553✔
304
}
305

306

307
void destroySortMergeOperatorInfo(void* param) {
1,337,679✔
308
  SSortMergeInfo* pSortMergeInfo = param;
1,337,679✔
309
  blockDataDestroy(pSortMergeInfo->pInputBlock);
1,337,679✔
310
  pSortMergeInfo->pInputBlock = NULL;
1,337,681✔
311

312
  blockDataDestroy(pSortMergeInfo->pIntermediateBlock);
1,337,681✔
313
  pSortMergeInfo->pIntermediateBlock = NULL;
1,337,686✔
314

315
  taosArrayDestroy(pSortMergeInfo->matchInfo.pList);
1,337,686✔
316

317
  tsortDestroySortHandle(pSortMergeInfo->pSortHandle);
1,337,685✔
318
  taosArrayDestroy(pSortMergeInfo->pSortInfo);
1,337,682✔
319
}
1,337,684✔
320

321
#define NON_SORT_NEXT_SRC(_info, _idx) ((++(_idx) >= (_info)->sourceNum) ? ((_info)->sourceWorkIdx) : (_idx))
322

323
int32_t openNonSortMergeOperator(SOperatorInfo* pOperator) {
1,797✔
324
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
1,797✔
325
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
1,797✔
326
  SNonSortMergeInfo*          pNonSortMergeInfo = &pInfo->nsortMergeInfo;
1,797✔
327

328
  pNonSortMergeInfo->sourceWorkIdx = 0;
1,797✔
329
  pNonSortMergeInfo->sourceNum = pOperator->numOfDownstream;
1,797✔
330
  pNonSortMergeInfo->lastSourceIdx = -1;
1,797✔
331
  pNonSortMergeInfo->pSourceStatus =
3,594✔
332
      taosMemoryCalloc(pOperator->numOfDownstream, sizeof(*pNonSortMergeInfo->pSourceStatus));
1,797!
333
  if (NULL == pNonSortMergeInfo->pSourceStatus) {
1,797!
334
    pTaskInfo->code = terrno;
×
335
    return pTaskInfo->code;
×
336
  }
337

338
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
8,831✔
339
    pNonSortMergeInfo->pSourceStatus[i] = i;
7,034✔
340
  }
341

342
  return 0;
1,797✔
343
}
344

345
int32_t doNonSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
7,125✔
346
  QRY_PARAM_CHECK(pResBlock);
7,125!
347

348
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
7,125✔
349
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
7,125✔
350
  SNonSortMergeInfo*          pNonSortMerge = &pInfo->nsortMergeInfo;
7,125✔
351
  SSDataBlock*                pBlock = NULL;
7,125✔
352
  SSDataBlock*                pRes = pInfo->binfo.pRes;
7,125✔
353
  int32_t                     code = 0;
7,125✔
354

355
  qDebug("start to merge no sorted rows, %s", GET_TASKID(pTaskInfo));
7,125✔
356

357
  int32_t idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
7,125!
358
  while (idx < pNonSortMerge->sourceNum) {
14,159✔
359
    pBlock = getNextBlockFromDownstream(pOperator, pNonSortMerge->pSourceStatus[idx]);
12,362✔
360
    if (NULL == pBlock) {
12,362✔
361
      TSWAP(pNonSortMerge->pSourceStatus[pNonSortMerge->sourceWorkIdx], pNonSortMerge->pSourceStatus[idx]);
7,034✔
362
      pNonSortMerge->sourceWorkIdx++;
7,034✔
363
      idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
7,034✔
364
      continue;
7,034✔
365
    }
366

367
    pNonSortMerge->lastSourceIdx = idx - 1;
5,328✔
368
    break;
5,328✔
369
  }
370

371
  if (!pBlock) {  // null data
7,125✔
372
    return code;
1,797✔
373
  }
374

375
  code = copyDataBlock(pRes, pBlock);
5,328✔
376
  *pResBlock = pRes;
5,328✔
377
  return code;
5,328✔
378
}
379

380
void destroyNonSortMergeOperatorInfo(void* param) {
1,797✔
381
  SNonSortMergeInfo* pNonSortMerge = param;
1,797✔
382
  taosMemoryFree(pNonSortMerge->pSourceStatus);
1,797!
383
}
1,797✔
384

385
int32_t getNonSortMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
×
386
  return TSDB_CODE_SUCCESS;
×
387
}
388

389

390
int32_t openColsMergeOperator(SOperatorInfo* pOperator) {
79✔
391
  return TSDB_CODE_SUCCESS;
79✔
392
}
393

394
int32_t copyColumnsValue(SNodeList* pNodeList, uint64_t targetBlkId, SSDataBlock* pDst, SSDataBlock* pSrc) {
158✔
395
  bool    isNull = (NULL == pSrc || pSrc->info.rows <= 0);
158!
396
  size_t  numOfCols = LIST_LENGTH(pNodeList);
158!
397
  int32_t code = 0;
158✔
398

399
  for (int32_t i = 0; i < numOfCols; ++i) {
2,328✔
400
    STargetNode* pNode = (STargetNode*)nodesListGetNode(pNodeList, i);
2,170✔
401
    if (nodeType(pNode->pExpr) == QUERY_NODE_COLUMN && ((SColumnNode*)pNode->pExpr)->dataBlockId == targetBlkId) {
2,170!
402
      SColumnInfoData* pDstCol = taosArrayGet(pDst->pDataBlock, pNode->slotId);
1,085✔
403
      if (pDstCol == NULL) {
1,085!
404
        return terrno;
×
405
      }
406

407
      if (isNull) {
1,085!
408
        code = colDataSetVal(pDstCol, 0, NULL, true);
×
409
      } else {
410
        SColumnInfoData* pSrcCol = taosArrayGet(pSrc->pDataBlock, ((SColumnNode*)pNode->pExpr)->slotId);
1,085✔
411
        if (pSrcCol == NULL) {
1,085!
412
          code = terrno;
×
413
          return code;
×
414
        }
415

416
        code = colDataAssign(pDstCol, pSrcCol, 1, &pDst->info);
1,085✔
417
      }
418

419
      if (code) {
1,085!
420
        break;
×
421
      }
422
    }
423
  }
424

425
  return code;
158✔
426
}
427

428
int32_t doColsMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
79✔
429
  QRY_PARAM_CHECK(pResBlock);
79!
430

431
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
79✔
432
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
79✔
433
  SSDataBlock*                pBlock = NULL;
79✔
434
  SColsMergeInfo*             pColsMerge = &pInfo->colsMergeInfo;
79✔
435
  int32_t                     nullBlkNum = 0;
79✔
436
  int32_t                     code = 0;
79✔
437

438
  qDebug("start to merge columns, %s", GET_TASKID(pTaskInfo));
79✔
439

440
  for (int32_t i = 0; i < 2; ++i) {
237✔
441
    pBlock = getNextBlockFromDownstream(pOperator, i);
158✔
442
    if (pBlock && pBlock->info.rows > 1) {
158!
443
      qError("more than 1 row returned from downstream, rows:%" PRId64, pBlock->info.rows);
×
444
      T_LONG_JMP(pTaskInfo->env, TSDB_CODE_QRY_EXECUTOR_INTERNAL_ERROR);
×
445
    } else if (NULL == pBlock) {
158!
446
      nullBlkNum++;
×
447
    }
448
    
449
    code = copyColumnsValue(pColsMerge->pTargets, pColsMerge->srcBlkIds[i], pInfo->binfo.pRes, pBlock);
158✔
450
    if (code) {
158!
451
      return code;
×
452
    }
453
  }
454

455
  setOperatorCompleted(pOperator);
79✔
456
  if (2 == nullBlkNum) {
79!
457
    return code;
×
458
  }
459

460
  pInfo->binfo.pRes->info.rows = 1;
79✔
461
  *pResBlock = pInfo->binfo.pRes;
79✔
462

463
  return code;
79✔
464
}
465

466
void destroyColsMergeOperatorInfo(void* param) {
79✔
467
}
79✔
468

469
int32_t getColsMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
×
470
  return TSDB_CODE_SUCCESS;
×
471
}
472

473

474
SOperatorFpSet gMultiwayMergeFps[MERGE_TYPE_MAX_VALUE] = {
475
  {0},
476
  {._openFn = openSortMergeOperator, .getNextFn = doSortMerge, .closeFn = destroySortMergeOperatorInfo, .getExplainFn = getSortMergeExplainExecInfo},
477
  {._openFn = openNonSortMergeOperator, .getNextFn = doNonSortMerge, .closeFn = destroyNonSortMergeOperatorInfo, .getExplainFn = getNonSortMergeExplainExecInfo},
478
  {._openFn = openColsMergeOperator, .getNextFn = doColsMerge, .closeFn = destroyColsMergeOperatorInfo, .getExplainFn = getColsMergeExplainExecInfo},
479
};
480

481

482
int32_t openMultiwayMergeOperator(SOperatorInfo* pOperator) {
7,517,277✔
483
  int32_t code = 0;
7,517,277✔
484
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
7,517,277✔
485
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
7,517,277✔
486

487
  if (OPTR_IS_OPENED(pOperator)) {
7,517,277✔
488
    return TSDB_CODE_SUCCESS;
6,177,960✔
489
  }
490

491
  int64_t startTs = taosGetTimestampUs();
1,339,390✔
492
  
493
  if (NULL != gMultiwayMergeFps[pInfo->type]._openFn) {
1,339,390✔
494
    code = (*gMultiwayMergeFps[pInfo->type]._openFn)(pOperator);
1,339,386✔
495
  }
496

497
  pOperator->cost.openCost = (taosGetTimestampUs() - startTs) / 1000.0;
1,339,380✔
498
  pOperator->status = OP_RES_TO_RETURN;
1,339,380✔
499

500
  if (code != TSDB_CODE_SUCCESS) {
1,339,380!
501
    qError("%s failed at line %d since %s", __func__, __LINE__, tstrerror(code));
×
502
    pOperator->pTaskInfo->code = code;
×
503
    T_LONG_JMP(pTaskInfo->env, terrno);
×
504
  }
505

506
  OPTR_SET_OPENED(pOperator);
1,339,380✔
507
  return code;
1,339,380✔
508
}
509

510
int32_t doMultiwayMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
7,637,742✔
511
  QRY_PARAM_CHECK(pResBlock);
7,637,742!
512
  int32_t code = TSDB_CODE_SUCCESS;
7,637,742✔
513
  int32_t lino = 0;
7,637,742✔
514

515
  if (pOperator->status == OP_EXEC_DONE) {
7,637,742✔
516
    return 0;
120,461✔
517
  }
518

519
  SExecTaskInfo* pTaskInfo = pOperator->pTaskInfo;
7,517,281✔
520
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
7,517,281✔
521

522
  code = pOperator->fpSet._openFn(pOperator);
7,517,281✔
523
  QUERY_CHECK_CODE(code, lino, _end);
7,517,284!
524

525
  if (NULL != gMultiwayMergeFps[pInfo->type].getNextFn) {
7,517,284!
526
    code = (*gMultiwayMergeFps[pInfo->type].getNextFn)(pOperator, pResBlock);
7,517,311✔
527
    QUERY_CHECK_CODE(code, lino, _end);
7,517,303!
528
  }
529

530
  if ((*pResBlock) != NULL) {
7,517,276✔
531
    pOperator->resultInfo.totalRows += (*pResBlock)->info.rows;
6,213,168✔
532
    code = blockDataCheck(*pResBlock);
6,213,168✔
533
    QUERY_CHECK_CODE(code, lino, _end);
6,213,122!
534
  } else {
535
    setOperatorCompleted(pOperator);
1,304,108✔
536
  }
537

538
_end:
7,517,188✔
539
  if (code != TSDB_CODE_SUCCESS) {
7,517,188!
540
    qError("%s failed at line %d since %s", __func__, lino, tstrerror(code));
×
541
    pTaskInfo->code = code;
×
542
    T_LONG_JMP(pTaskInfo->env, code);
×
543
  }
544
  return code;
7,517,188✔
545
}
546

547
void destroyMultiwayMergeOperatorInfo(void* param) {
1,339,561✔
548
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)param;
1,339,561✔
549
  blockDataDestroy(pInfo->binfo.pRes);
1,339,561✔
550
  pInfo->binfo.pRes = NULL;
1,339,558✔
551

552
  if (NULL != gMultiwayMergeFps[pInfo->type].closeFn) {
1,339,558!
553
    (*gMultiwayMergeFps[pInfo->type].closeFn)(&pInfo->sortMergeInfo);
1,339,558✔
554
  }
555

556
  taosMemoryFreeClear(param);
1,339,558!
557
}
1,339,558✔
558

559
int32_t getMultiwayMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
124,553✔
560
  int32_t code = 0;
124,553✔
561
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)pOptr->info;
124,553✔
562

563
  if (NULL != gMultiwayMergeFps[pInfo->type].getExplainFn) {
124,553!
564
    code = (*gMultiwayMergeFps[pInfo->type].getExplainFn)(pOptr, pOptrExplain, len);
124,553✔
565
  }
566

567
  return code;
124,553✔
568
}
569

570
int32_t createMultiwayMergeOperatorInfo(SOperatorInfo** downStreams, size_t numStreams, SMergePhysiNode* pMergePhyNode,
1,339,540✔
571
                                        SExecTaskInfo* pTaskInfo, SOperatorInfo** pOptrInfo) {
572
  QRY_PARAM_CHECK(pOptrInfo);
1,339,540!
573

574
  SPhysiNode*                 pPhyNode = (SPhysiNode*)pMergePhyNode;
1,339,540✔
575
  int32_t                     lino = 0;
1,339,540✔
576
  int32_t                     code = TSDB_CODE_SUCCESS;
1,339,540✔
577
  SMultiwayMergeOperatorInfo* pInfo = taosMemoryCalloc(1, sizeof(SMultiwayMergeOperatorInfo));
1,339,540!
578
  SOperatorInfo*              pOperator = taosMemoryCalloc(1, sizeof(SOperatorInfo));
1,339,531!
579
  SDataBlockDescNode*         pDescNode = pPhyNode->pOutputDataBlockDesc;
1,339,536✔
580
  if (pInfo == NULL || pOperator == NULL) {
1,339,536!
581
    code = terrno;
×
582
    goto _error;
×
583
  }
584

585
  pInfo->groupMerge = pMergePhyNode->groupSort;
1,339,541✔
586
  pInfo->ignoreGroupId = pMergePhyNode->ignoreGroupId;
1,339,541✔
587
  pInfo->binfo.inputTsOrder = pMergePhyNode->node.inputTsOrder;
1,339,541✔
588
  pInfo->binfo.outputTsOrder = pMergePhyNode->node.outputTsOrder;
1,339,541✔
589
  pInfo->inputWithGroupId = pMergePhyNode->inputWithGroupId;
1,339,541✔
590

591
  pInfo->type = pMergePhyNode->type;
1,339,541✔
592
  switch (pInfo->type) {
1,339,541!
593
    case MERGE_TYPE_SORT: {
1,337,668✔
594
      SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
1,337,668✔
595
      initLimitInfo(pMergePhyNode->node.pLimit, pMergePhyNode->node.pSlimit, &pInfo->limitInfo);
1,337,668✔
596
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
1,337,667✔
597
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
1,337,672!
598

599
      SPhysiNode*  pChildNode = (SPhysiNode*)nodesListGetNode(pPhyNode->pChildren, 0);
1,337,672✔
600
      SSDataBlock* pInputBlock = createDataBlockFromDescNode(pChildNode->pOutputDataBlockDesc);
1,337,673✔
601
      TSDB_CHECK_NULL(pInputBlock, code, lino, _error, terrno);
1,337,661!
602
      pSortMergeInfo->pInputBlock = pInputBlock;
1,337,661✔
603

604
      initResultSizeInfo(&pOperator->resultInfo, 1024);
1,337,661✔
605
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
1,337,657✔
606
      TSDB_CHECK_CODE(code, lino, _error);
1,337,665!
607

608
      size_t  numOfCols = taosArrayGetSize(pInfo->binfo.pRes->pDataBlock);
1,337,665✔
609
      int32_t rowSize = pInfo->binfo.pRes->info.rowSize;
1,337,664✔
610
      int32_t numOfOutputCols = 0;
1,337,664✔
611
      pSortMergeInfo->pSortInfo = createSortInfo(pMergePhyNode->pMergeKeys);
1,337,664✔
612
      pSortMergeInfo->bufPageSize = getProperSortPageSize(rowSize, numOfCols);
1,337,659✔
613
      pSortMergeInfo->sortBufSize =
1,337,656✔
614
          pSortMergeInfo->bufPageSize * (numStreams + 1);  // one additional is reserved for merged result.
1,337,656✔
615
      code = extractColMatchInfo(pMergePhyNode->pTargets, pDescNode, &numOfOutputCols, COL_MATCH_FROM_SLOT_ID,
1,337,656✔
616
                                 &pSortMergeInfo->matchInfo);
617
      if (code != TSDB_CODE_SUCCESS) {
1,337,621!
618
        goto _error;
×
619
      }
620
      break;
1,337,621✔
621
    }
622
    case MERGE_TYPE_NON_SORT: {
1,797✔
623
      SNonSortMergeInfo* pNonSortMerge = &pInfo->nsortMergeInfo;
1,797✔
624
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
1,797✔
625
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
1,797!
626

627
      initResultSizeInfo(&pOperator->resultInfo, 1024);
1,797✔
628
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
1,797✔
629
      TSDB_CHECK_CODE(code, lino, _error);
1,797!
630

631
      break;
1,797✔
632
    }
633
    case MERGE_TYPE_COLUMNS: {
79✔
634
      SColsMergeInfo* pColsMerge = &pInfo->colsMergeInfo;
79✔
635
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
79✔
636
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
79!
637

638
      initResultSizeInfo(&pOperator->resultInfo, 1);
79✔
639
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
79✔
640
      TSDB_CHECK_CODE(code, lino, _error);
79!
641

642
      pColsMerge->pTargets = pMergePhyNode->pTargets;
79✔
643
      pColsMerge->srcBlkIds[0] = getOperatorResultBlockId(downStreams[0], 0);
79✔
644
      pColsMerge->srcBlkIds[1] = getOperatorResultBlockId(downStreams[1], 0);
79✔
645
      break;
79✔
646
    }
647
    default:
×
648
      qError("Invalid merge type: %d", pInfo->type);
×
649
      code = TSDB_CODE_INVALID_PARA;
×
650
      goto _error;
×
651
  }
652

653
  setOperatorInfo(pOperator, "MultiwayMergeOperator", QUERY_NODE_PHYSICAL_PLAN_MERGE, false, OP_NOT_OPENED, pInfo,
1,339,497✔
654
                  pTaskInfo);
655
  pOperator->fpSet =
656
      createOperatorFpSet(openMultiwayMergeOperator, doMultiwayMerge, NULL, destroyMultiwayMergeOperatorInfo,
1,339,517✔
657
                          optrDefaultBufFn, getMultiwayMergeExplainExecInfo, optrDefaultGetNextExtFn, NULL);
658

659
  code = appendDownstream(pOperator, downStreams, numStreams);
1,339,544✔
660
  if (code != TSDB_CODE_SUCCESS) {
1,339,552!
661
    goto _error;
×
662
  }
663

664
  *pOptrInfo = pOperator;
1,339,552✔
665
  return TSDB_CODE_SUCCESS;
1,339,552✔
666

667
_error:
×
668
  if (pInfo != NULL) {
×
669
    destroyMultiwayMergeOperatorInfo(pInfo);
×
670
  }
671
  pTaskInfo->code = code;
×
672
  destroyOperatorAndDownstreams(pOperator, downStreams, numStreams);
×
673
  return code;
×
674
}
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