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

taosdata / TDengine / #4032

09 May 2025 11:08PM UTC coverage: 62.788% (+0.4%) from 62.432%
#4032

push

travis-ci

GitHub
Merge pull request #31013 from taosdata/opt/workflow-3.0-cyjia

156483 of 317611 branches covered (49.27%)

Branch coverage included in aggregate %.

241665 of 316507 relevant lines covered (76.35%)

6706251.92 hits per line

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

74.74
/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
  size_t     sourceNum;
43
  uint64_t*  srcBlkIds;
44
} SColsMergeInfo;
45

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

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

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

80
int32_t openSortMergeOperator(SOperatorInfo* pOperator) {
94,123✔
81
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
94,123✔
82
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
94,123✔
83
  SSortMergeInfo*             pSortMergeInfo = &pInfo->sortMergeInfo;
94,123✔
84

85
  int32_t numOfBufPage = pSortMergeInfo->sortBufSize / pSortMergeInfo->bufPageSize;
94,123✔
86

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

94
  tsortSetFetchRawDataFp(pSortMergeInfo->pSortHandle, sortMergeloadNextDataBlock, NULL, NULL);
94,144✔
95
  tsortSetCompareGroupId(pSortMergeInfo->pSortHandle, pInfo->groupMerge);
94,138✔
96

97
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
349,367✔
98
    SOperatorInfo* pDownstream = pOperator->pDownstream[i];
255,221✔
99
    if (pDownstream->operatorType == QUERY_NODE_PHYSICAL_PLAN_EXCHANGE) {
255,221!
100
      code = pDownstream->fpSet._openFn(pDownstream);
255,228✔
101
      if (code) {
255,230!
102
        return code;
×
103
      }
104
    }
105

106
    SSortSource* ps = taosMemoryCalloc(1, sizeof(SSortSource));
255,223!
107
    if (ps == NULL) {
255,238!
108
      return terrno;
×
109
    }
110

111
    ps->param = pDownstream;
255,238✔
112
    ps->onlyRef = true;
255,238✔
113

114
    code = tsortAddSource(pSortMergeInfo->pSortHandle, ps);
255,238✔
115
    if (code) {
255,231!
116
      return code;
×
117
    }
118
  }
119

120
  return tsortOpen(pSortMergeInfo->pSortHandle);
94,146✔
121
}
122

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

129
  while (1) {
92,365,317✔
130
    STupleHandle* pTupleHandle = NULL;
92,706,124✔
131
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
92,706,124✔
132
      if (pSortMergeInfo->prefetchedTuple == NULL) {
74,914,420✔
133
        pTupleHandle = NULL;
74,793,014✔
134
        code = tsortNextTuple(pHandle, &pTupleHandle);
74,793,014✔
135
        if (code) {
136
          // todo handle error
137
        }
138
      } else {
139
        pTupleHandle = pSortMergeInfo->prefetchedTuple;
121,406✔
140
        pSortMergeInfo->prefetchedTuple = NULL;
121,406✔
141
        uint64_t gid = tsortGetGroupId(pTupleHandle);
121,406✔
142
        if (gid != pInfo->groupId) {
121,406!
143
          *newgroup = true;
121,406✔
144
          pInfo->groupId = gid;
121,406✔
145
        }
146
      }
147
    } else {
148
      code = tsortNextTuple(pHandle, &pTupleHandle);
17,791,704✔
149
      pInfo->groupId = 0;
17,597,405✔
150
    }
151

152
    if (pTupleHandle == NULL || (code != 0)) {
92,505,265!
153
      break;
154
    }
155

156
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
167,045,497✔
157
      uint64_t tupleGroupId = tsortGetGroupId(pTupleHandle);
74,810,632✔
158
      if (pInfo->groupId == 0 || pInfo->groupId == tupleGroupId) {
74,776,255✔
159
        code = appendOneRowToDataBlock(p, pTupleHandle);
74,654,734✔
160
        if (code) {
74,698,868!
161
          return code;
×
162
        }
163

164
        p->info.id.groupId = tupleGroupId;
74,698,868✔
165
        pInfo->groupId = tupleGroupId;
74,698,868✔
166
      } else {
167
        if (p->info.rows == 0) {
121,521✔
168
          code = appendOneRowToDataBlock(p, pTupleHandle);
14✔
169
          if (code) {
14!
170
            return code;
×
171
          }
172

173
          p->info.id.groupId = pInfo->groupId = tupleGroupId;
14✔
174
        } else {
175
          pSortMergeInfo->prefetchedTuple = pTupleHandle;
121,507✔
176
          break;
121,507✔
177
        }
178
      }
179
    } else {
180
      code = appendOneRowToDataBlock(p, pTupleHandle);
17,535,983✔
181
      if (code) {
17,742,433!
182
        return code;
×
183
      }
184
    }
185

186
    if (p->info.rows >= capacity) {
92,441,315✔
187
      break;
75,998✔
188
    }
189
  }
190

191
  return code;
356,155✔
192
}
193

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

205
  qDebug("start to merge final sorted rows, %s", GET_TASKID(pTaskInfo));
340,735✔
206
  blockDataCleanup(pDataBlock);
340,735✔
207

208
  if (pSortMergeInfo->pIntermediateBlock == NULL) {
340,732✔
209
    pSortMergeInfo->pIntermediateBlock = NULL;
94,145✔
210
    code = tsortGetSortedDataBlock(pHandle, &pSortMergeInfo->pIntermediateBlock);
94,145✔
211
    if (pSortMergeInfo->pIntermediateBlock == NULL || code != 0) {
94,147!
212
      return code;
×
213
    }
214

215
    code = blockDataEnsureCapacity(pSortMergeInfo->pIntermediateBlock, capacity);
94,147✔
216
    if (code) {
94,146!
217
      return code;
×
218
    }
219

220
  } else {
221
    blockDataCleanup(pSortMergeInfo->pIntermediateBlock);
246,587✔
222
  }
223

224
  SSDataBlock* p = pSortMergeInfo->pIntermediateBlock;
340,735✔
225
  while (1) {
71✔
226
    code = doGetSortedBlockData(pInfo, pHandle, capacity, p, &newgroup);
340,806✔
227
    if (code) {
340,809!
228
      return code;
×
229
    }
230

231
    if (p->info.rows == 0) {
340,809✔
232
      break;
75,112✔
233
    }
234

235
    if (newgroup) {
265,697✔
236
      resetLimitInfoForNextGroup(&pInfo->limitInfo);
121,406✔
237
    }
238

239
    bool limitReached = applyLimitOffset(&pInfo->limitInfo, p, pTaskInfo);
265,697✔
240

241
    if (p->info.rows > 0) {
265,696✔
242
      break;
265,625✔
243
    }
244
  }
245

246
  if (p->info.rows > 0) {
340,737✔
247
    int32_t numOfCols = taosArrayGetSize(pColMatchInfo);
265,625✔
248
    for (int32_t i = 0; i < numOfCols; ++i) {
1,258,387✔
249
      SColMatchItem* pmInfo = taosArrayGet(pColMatchInfo, i);
992,762✔
250
      if (pmInfo == NULL) {
992,751!
251
        code = terrno;
×
252
        return code;
×
253
      }
254

255
      SColumnInfoData* pSrc = taosArrayGet(p->pDataBlock, pmInfo->srcSlotId);
992,751✔
256
      if (pSrc == NULL) {
992,748!
257
        code = terrno;
×
258
        return code;
×
259
      }
260

261
      SColumnInfoData* pDst = taosArrayGet(pDataBlock->pDataBlock, pmInfo->dstSlotId);
992,748✔
262
      if (pDst == NULL) {
992,747!
263
        code = terrno;
×
264
        return code;
×
265
      }
266

267
      code = colDataAssign(pDst, pSrc, p->info.rows, &pDataBlock->info);
992,747✔
268
      if (code) {
992,761!
269
        return code;
×
270
      }
271
    }
272

273
    pDataBlock->info.rows = p->info.rows;
265,625✔
274
    pDataBlock->info.scanFlag = p->info.scanFlag;
265,625✔
275
    if (pInfo->ignoreGroupId) {
265,625✔
276
      pDataBlock->info.id.groupId = 0;
8✔
277
    } else {
278
      pDataBlock->info.id.groupId = pInfo->groupId;
265,617✔
279
    }
280
    pDataBlock->info.dataLoad = 1;
265,625✔
281
  }
282

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

286
  *pResBlock = (pDataBlock->info.rows > 0) ? pDataBlock : NULL;
340,737✔
287
  return code;
340,737✔
288
}
289

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

297
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)pOptr->info;
1,103✔
298
  SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
1,103✔
299

300
  *pSortExecInfo = tsortGetSortExecInfo(pSortMergeInfo->pSortHandle);
1,103✔
301
  *pOptrExplain = pSortExecInfo;
1,103✔
302

303
  *len = sizeof(SSortExecInfo);
1,103✔
304
  return TSDB_CODE_SUCCESS;
1,103✔
305
}
306

307

308
void destroySortMergeOperatorInfo(void* param) {
94,311✔
309
  SSortMergeInfo* pSortMergeInfo = param;
94,311✔
310
  blockDataDestroy(pSortMergeInfo->pInputBlock);
94,311✔
311
  pSortMergeInfo->pInputBlock = NULL;
94,311✔
312

313
  blockDataDestroy(pSortMergeInfo->pIntermediateBlock);
94,311✔
314
  pSortMergeInfo->pIntermediateBlock = NULL;
94,312✔
315

316
  taosArrayDestroy(pSortMergeInfo->matchInfo.pList);
94,312✔
317

318
  tsortDestroySortHandle(pSortMergeInfo->pSortHandle);
94,312✔
319
  taosArrayDestroy(pSortMergeInfo->pSortInfo);
94,311✔
320
}
94,312✔
321

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

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

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

339
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
578✔
340
    pNonSortMergeInfo->pSourceStatus[i] = i;
482✔
341
  }
342

343
  return 0;
96✔
344
}
345

346
int32_t doNonSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
1,028✔
347
  QRY_PARAM_CHECK(pResBlock);
1,028!
348

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

356
  qDebug("start to merge no sorted rows, %s", GET_TASKID(pTaskInfo));
1,028✔
357

358
  int32_t idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
1,028!
359
  while (idx < pNonSortMerge->sourceNum) {
1,510✔
360
    pBlock = getNextBlockFromDownstream(pOperator, pNonSortMerge->pSourceStatus[idx]);
1,414✔
361
    if (NULL == pBlock) {
1,414✔
362
      TSWAP(pNonSortMerge->pSourceStatus[pNonSortMerge->sourceWorkIdx], pNonSortMerge->pSourceStatus[idx]);
482✔
363
      pNonSortMerge->sourceWorkIdx++;
482✔
364
      idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
482✔
365
      continue;
482✔
366
    }
367

368
    pNonSortMerge->lastSourceIdx = idx - 1;
932✔
369
    break;
932✔
370
  }
371

372
  if (!pBlock) {  // null data
1,028✔
373
    return code;
96✔
374
  }
375

376
  code = copyDataBlock(pRes, pBlock);
932✔
377
  *pResBlock = pRes;
932✔
378
  return code;
932✔
379
}
380

381
void destroyNonSortMergeOperatorInfo(void* param) {
96✔
382
  SNonSortMergeInfo* pNonSortMerge = param;
96✔
383
  taosMemoryFree(pNonSortMerge->pSourceStatus);
96!
384
}
96✔
385

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

390

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

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

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

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

417
        code = colDataAssign(pDstCol, pSrcCol, 1, &pDst->info);
2,319✔
418
      }
419

420
      if (code) {
2,319!
421
        break;
×
422
      }
423
    }
424
  }
425

426
  return code;
508✔
427
}
428

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

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

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

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

456
  setOperatorCompleted(pOperator);
254✔
457
  if (pColsMerge->sourceNum == nullBlkNum) {
254!
458
    return code;
×
459
  }
460

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

464
  return code;
254✔
465
}
466

467
void destroyColsMergeOperatorInfo(void* param) {
254✔
468
  SColsMergeInfo* pColsMergeInfo = param;
254✔
469
  taosMemoryFreeClear(pColsMergeInfo->srcBlkIds);
254!
470
}
254✔
471

472
int32_t getColsMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
×
473
  return TSDB_CODE_SUCCESS;
×
474
}
475

476

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

484

485
int32_t openMultiwayMergeOperator(SOperatorInfo* pOperator) {
341,997✔
486
  int32_t code = 0;
341,997✔
487
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
341,997✔
488
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
341,997✔
489

490
  if (OPTR_IS_OPENED(pOperator)) {
341,997✔
491
    return TSDB_CODE_SUCCESS;
247,524✔
492
  }
493

494
  int64_t startTs = taosGetTimestampUs();
94,491✔
495
  
496
  if (NULL != gMultiwayMergeFps[pInfo->type]._openFn) {
94,491✔
497
    code = (*gMultiwayMergeFps[pInfo->type]._openFn)(pOperator);
94,476✔
498
  }
499

500
  pOperator->cost.openCost = (taosGetTimestampUs() - startTs) / 1000.0;
94,494✔
501
  pOperator->status = OP_RES_TO_RETURN;
94,494✔
502

503
  if (code != TSDB_CODE_SUCCESS) {
94,494!
504
    qError("%s failed at line %d since %s", __func__, __LINE__, tstrerror(code));
×
505
    pOperator->pTaskInfo->code = code;
×
506
    T_LONG_JMP(pTaskInfo->env, terrno);
×
507
  }
508

509
  OPTR_SET_OPENED(pOperator);
94,494✔
510
  return code;
94,494✔
511
}
512

513
int32_t doMultiwayMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
342,293✔
514
  QRY_PARAM_CHECK(pResBlock);
342,293!
515
  int32_t code = TSDB_CODE_SUCCESS;
342,293✔
516
  int32_t lino = 0;
342,293✔
517

518
  if (pOperator->status == OP_EXEC_DONE) {
342,293✔
519
    return 0;
293✔
520
  }
521

522
  SExecTaskInfo* pTaskInfo = pOperator->pTaskInfo;
342,000✔
523
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
342,000✔
524

525
  code = pOperator->fpSet._openFn(pOperator);
342,000✔
526
  QUERY_CHECK_CODE(code, lino, _end);
342,017!
527

528
  if (NULL != gMultiwayMergeFps[pInfo->type].getNextFn) {
342,017!
529
    code = (*gMultiwayMergeFps[pInfo->type].getNextFn)(pOperator, pResBlock);
342,018✔
530
    QUERY_CHECK_CODE(code, lino, _end);
342,019!
531
  }
532

533
  if ((*pResBlock) != NULL) {
342,018✔
534
    pOperator->resultInfo.totalRows += (*pResBlock)->info.rows;
266,812✔
535
    code = blockDataCheck(*pResBlock);
266,812✔
536
    QUERY_CHECK_CODE(code, lino, _end);
266,806!
537
  } else {
538
    setOperatorCompleted(pOperator);
75,206✔
539
  }
540

541
_end:
342,011✔
542
  if (code != TSDB_CODE_SUCCESS) {
342,011!
543
    qError("%s failed at line %d since %s", __func__, lino, tstrerror(code));
×
544
    pTaskInfo->code = code;
×
545
    T_LONG_JMP(pTaskInfo->env, code);
×
546
  }
547
  return code;
342,011✔
548
}
549

550
void destroyMultiwayMergeOperatorInfo(void* param) {
94,661✔
551
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)param;
94,661✔
552
  blockDataDestroy(pInfo->binfo.pRes);
94,661✔
553
  pInfo->binfo.pRes = NULL;
94,662✔
554

555
  if (NULL != gMultiwayMergeFps[pInfo->type].closeFn) {
94,662!
556
    (*gMultiwayMergeFps[pInfo->type].closeFn)(&pInfo->sortMergeInfo);
94,662✔
557
  }
558

559
  taosMemoryFreeClear(param);
94,662!
560
}
94,662✔
561

562
int32_t getMultiwayMergeExplainExecInfo(SOperatorInfo* pOptr, void** pOptrExplain, uint32_t* len) {
1,103✔
563
  int32_t code = 0;
1,103✔
564
  SMultiwayMergeOperatorInfo* pInfo = (SMultiwayMergeOperatorInfo*)pOptr->info;
1,103✔
565

566
  if (NULL != gMultiwayMergeFps[pInfo->type].getExplainFn) {
1,103!
567
    code = (*gMultiwayMergeFps[pInfo->type].getExplainFn)(pOptr, pOptrExplain, len);
1,103✔
568
  }
569

570
  return code;
1,103✔
571
}
572

573
int32_t createMultiwayMergeOperatorInfo(SOperatorInfo** downStreams, size_t numStreams, SMergePhysiNode* pMergePhyNode,
94,659✔
574
                                        SExecTaskInfo* pTaskInfo, SOperatorInfo** pOptrInfo) {
575
  QRY_PARAM_CHECK(pOptrInfo);
94,659!
576

577
  SPhysiNode*                 pPhyNode = (SPhysiNode*)pMergePhyNode;
94,659✔
578
  int32_t                     lino = 0;
94,659✔
579
  int32_t                     code = TSDB_CODE_SUCCESS;
94,659✔
580
  SMultiwayMergeOperatorInfo* pInfo = taosMemoryCalloc(1, sizeof(SMultiwayMergeOperatorInfo));
94,659!
581
  SOperatorInfo*              pOperator = taosMemoryCalloc(1, sizeof(SOperatorInfo));
94,657!
582
  SDataBlockDescNode*         pDescNode = pPhyNode->pOutputDataBlockDesc;
94,654✔
583
  if (pInfo == NULL || pOperator == NULL) {
94,654!
584
    code = terrno;
×
585
    goto _error;
×
586
  }
587

588
  pInfo->groupMerge = pMergePhyNode->groupSort;
94,655✔
589
  pInfo->ignoreGroupId = pMergePhyNode->ignoreGroupId;
94,655✔
590
  pInfo->binfo.inputTsOrder = pMergePhyNode->node.inputTsOrder;
94,655✔
591
  pInfo->binfo.outputTsOrder = pMergePhyNode->node.outputTsOrder;
94,655✔
592
  pInfo->inputWithGroupId = pMergePhyNode->inputWithGroupId;
94,655✔
593

594
  pInfo->type = pMergePhyNode->type;
94,655✔
595
  switch (pInfo->type) {
94,655!
596
    case MERGE_TYPE_SORT: {
94,307✔
597
      SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
94,307✔
598
      initLimitInfo(pMergePhyNode->node.pLimit, pMergePhyNode->node.pSlimit, &pInfo->limitInfo);
94,307✔
599
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
94,308✔
600
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
94,311!
601

602
      SPhysiNode*  pChildNode = (SPhysiNode*)nodesListGetNode(pPhyNode->pChildren, 0);
94,311✔
603
      SSDataBlock* pInputBlock = createDataBlockFromDescNode(pChildNode->pOutputDataBlockDesc);
94,311✔
604
      TSDB_CHECK_NULL(pInputBlock, code, lino, _error, terrno);
94,311!
605
      pSortMergeInfo->pInputBlock = pInputBlock;
94,311✔
606

607
      initResultSizeInfo(&pOperator->resultInfo, 1024);
94,311✔
608
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
94,311✔
609
      TSDB_CHECK_CODE(code, lino, _error);
94,310!
610

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

630
      initResultSizeInfo(&pOperator->resultInfo, 1024);
96✔
631
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
96✔
632
      TSDB_CHECK_CODE(code, lino, _error);
96!
633

634
      break;
96✔
635
    }
636
    case MERGE_TYPE_COLUMNS: {
254✔
637
      SColsMergeInfo* pColsMerge = &pInfo->colsMergeInfo;
254✔
638
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
254✔
639
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
254!
640

641
      initResultSizeInfo(&pOperator->resultInfo, 1);
254✔
642
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
254✔
643
      TSDB_CHECK_CODE(code, lino, _error);
254!
644

645
      pColsMerge->pTargets = pMergePhyNode->pTargets;
254✔
646
      pColsMerge->sourceNum = numStreams;
254✔
647
      pColsMerge->srcBlkIds = taosMemoryCalloc(numStreams, sizeof(uint64_t));
254!
648
      for (size_t i = 0; i < numStreams; ++i) {
762✔
649
        pColsMerge->srcBlkIds[i] = getOperatorResultBlockId(downStreams[i], 0);
508✔
650
      }
651
      break;
254✔
652
    }
653
    default:
×
654
      qError("Invalid merge type: %d", pInfo->type);
×
655
      code = TSDB_CODE_INVALID_PARA;
×
656
      goto _error;
×
657
  }
658

659
  setOperatorInfo(pOperator, "MultiwayMergeOperator", QUERY_NODE_PHYSICAL_PLAN_MERGE, false, OP_NOT_OPENED, pInfo,
94,659✔
660
                  pTaskInfo);
661
  pOperator->fpSet =
662
      createOperatorFpSet(openMultiwayMergeOperator, doMultiwayMerge, NULL, destroyMultiwayMergeOperatorInfo,
94,656✔
663
                          optrDefaultBufFn, getMultiwayMergeExplainExecInfo, optrDefaultGetNextExtFn, NULL);
664

665
  code = appendDownstream(pOperator, downStreams, numStreams);
94,654✔
666
  if (code != TSDB_CODE_SUCCESS) {
94,657!
667
    goto _error;
×
668
  }
669

670
  *pOptrInfo = pOperator;
94,657✔
671
  return TSDB_CODE_SUCCESS;
94,657✔
672

673
_error:
×
674
  if (pInfo != NULL) {
×
675
    destroyMultiwayMergeOperatorInfo(pInfo);
×
676
  }
677
  pTaskInfo->code = code;
×
678
  destroyOperatorAndDownstreams(pOperator, downStreams, numStreams);
×
679
  return code;
×
680
}
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