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

taosdata / TDengine / #3533

20 Nov 2024 07:11AM UTC coverage: 58.848% (-1.9%) from 60.78%
#3533

push

travis-ci

web-flow
Merge pull request #28823 from taosdata/fix/3.0/TD-32587

fix:[TD-32587]fix stmt segmentation fault

115578 of 252434 branches covered (45.79%)

Branch coverage included in aggregate %.

1 of 4 new or added lines in 1 file covered. (25.0%)

8038 existing lines in 233 files now uncovered.

194926 of 275199 relevant lines covered (70.83%)

1494459.59 hits per line

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

71.64
/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) {
51,564✔
67
  SOperatorInfo* pOperator = (SOperatorInfo*)param;
51,564✔
68
  int32_t        code = pOperator->fpSet.getNextFn(pOperator, ppBlock);
51,564✔
69
  if (code) {
51,526!
70
    qError("failed to get next data block from upstream, %s code:%s", __func__, tstrerror(code));
×
71
  }
72
  code = blockDataCheck(*ppBlock);
51,526✔
73
  if (code) {
51,526!
74
    qError("failed to check data block got from upstream, %s code:%s", __func__, tstrerror(code));
×
75
  }
76
  return code;
51,526✔
77
}
78

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

84
  int32_t numOfBufPage = pSortMergeInfo->sortBufSize / pSortMergeInfo->bufPageSize;
11,781✔
85

86
  pSortMergeInfo->pSortHandle = NULL;
11,781✔
87
  int32_t code = tsortCreateSortHandle(pSortMergeInfo->pSortInfo, SORT_MULTISOURCE_MERGE, pSortMergeInfo->bufPageSize,
11,781✔
88
                                       numOfBufPage, pSortMergeInfo->pInputBlock, pTaskInfo->id.str, 0, 0, 0, &pSortMergeInfo->pSortHandle);
11,781✔
89
  if (code) {
11,784✔
90
    return code;
21✔
91
  }
92

93
  tsortSetFetchRawDataFp(pSortMergeInfo->pSortHandle, sortMergeloadNextDataBlock, NULL, NULL);
11,763✔
94
  tsortSetCompareGroupId(pSortMergeInfo->pSortHandle, pInfo->groupMerge);
11,763✔
95

96
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
39,285✔
97
    SOperatorInfo* pDownstream = pOperator->pDownstream[i];
27,556✔
98
    if (pDownstream->operatorType == QUERY_NODE_PHYSICAL_PLAN_EXCHANGE) {
27,556!
99
      code = pDownstream->fpSet._openFn(pDownstream);
27,556✔
100
      if (code) {
27,525!
101
        return code;
×
102
      }
103
    }
104

105
    SSortSource* ps = taosMemoryCalloc(1, sizeof(SSortSource));
27,525✔
106
    if (ps == NULL) {
27,525✔
107
      return terrno;
3✔
108
    }
109

110
    ps->param = pDownstream;
27,522✔
111
    ps->onlyRef = true;
27,522✔
112

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

119
  return tsortOpen(pSortMergeInfo->pSortHandle);
11,729✔
120
}
121

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

128
  while (1) {
1,454,900✔
129
    STupleHandle* pTupleHandle = NULL;
1,480,819✔
130
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
1,480,819✔
131
      if (pSortMergeInfo->prefetchedTuple == NULL) {
1,009,349✔
132
        pTupleHandle = NULL;
1,005,187✔
133
        code = tsortNextTuple(pHandle, &pTupleHandle);
1,005,187✔
134
        if (code) {
135
          // todo handle error
136
        }
137
      } else {
138
        pTupleHandle = pSortMergeInfo->prefetchedTuple;
4,162✔
139
        pSortMergeInfo->prefetchedTuple = NULL;
4,162✔
140
        uint64_t gid = tsortGetGroupId(pTupleHandle);
4,162✔
141
        if (gid != pInfo->groupId) {
4,162!
142
          *newgroup = true;
4,162✔
143
          pInfo->groupId = gid;
4,162✔
144
        }
145
      }
146
    } else {
147
      code = tsortNextTuple(pHandle, &pTupleHandle);
471,470✔
148
      pInfo->groupId = 0;
471,469✔
149
    }
150

151
    if (pTupleHandle == NULL || (code != 0)) {
1,480,459!
152
      break;
153
    }
154

155
    if (pInfo->groupMerge || pInfo->inputWithGroupId) {
2,450,394✔
156
      uint64_t tupleGroupId = tsortGetGroupId(pTupleHandle);
995,165✔
157
      if (pInfo->groupId == 0 || pInfo->groupId == tupleGroupId) {
995,019✔
158
        code = appendOneRowToDataBlock(p, pTupleHandle);
990,826✔
159
        if (code) {
991,376✔
160
          return code;
8✔
161
        }
162

163
        p->info.id.groupId = tupleGroupId;
991,369✔
164
        pInfo->groupId = tupleGroupId;
991,369✔
165
      } else {
166
        if (p->info.rows == 0) {
4,193!
UNCOV
167
          code = appendOneRowToDataBlock(p, pTupleHandle);
×
UNCOV
168
          if (code) {
×
169
            return code;
×
170
          }
171

UNCOV
172
          p->info.id.groupId = pInfo->groupId = tupleGroupId;
×
173
        } else {
174
          pSortMergeInfo->prefetchedTuple = pTupleHandle;
4,193✔
175
          break;
4,193✔
176
        }
177
      }
178
    } else {
179
      code = appendOneRowToDataBlock(p, pTupleHandle);
463,860✔
180
      if (code) {
463,861✔
181
        return code;
1✔
182
      }
183
    }
184

185
    if (p->info.rows >= capacity) {
1,455,229✔
186
      break;
329✔
187
    }
188
  }
189

190
  return code;
25,956✔
191
}
192

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

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

207
  if (pSortMergeInfo->pIntermediateBlock == NULL) {
25,900✔
208
    pSortMergeInfo->pIntermediateBlock = NULL;
11,655✔
209
    code = tsortGetSortedDataBlock(pHandle, &pSortMergeInfo->pIntermediateBlock);
11,655✔
210
    if (pSortMergeInfo->pIntermediateBlock == NULL || code != 0) {
11,655!
211
      return code;
2✔
212
    }
213

214
    code = blockDataEnsureCapacity(pSortMergeInfo->pIntermediateBlock, capacity);
11,653✔
215
    if (code) {
11,653✔
216
      return code;
10✔
217
    }
218

219
  } else {
220
    blockDataCleanup(pSortMergeInfo->pIntermediateBlock);
14,245✔
221
  }
222

223
  SSDataBlock* p = pSortMergeInfo->pIntermediateBlock;
25,889✔
224
  while (1) {
30✔
225
    code = doGetSortedBlockData(pInfo, pHandle, capacity, p, &newgroup);
25,919✔
226
    if (code) {
25,918✔
227
      return code;
8✔
228
    }
229

230
    if (p->info.rows == 0) {
25,910✔
231
      break;
10,302✔
232
    }
233

234
    if (newgroup) {
15,608✔
235
      resetLimitInfoForNextGroup(&pInfo->limitInfo);
4,162✔
236
    }
237

238
    bool limitReached = applyLimitOffset(&pInfo->limitInfo, p, pTaskInfo);
15,608✔
239

240
    if (p->info.rows > 0) {
15,608✔
241
      break;
15,578✔
242
    }
243
  }
244

245
  if (p->info.rows > 0) {
25,880✔
246
    int32_t numOfCols = taosArrayGetSize(pColMatchInfo);
15,578✔
247
    for (int32_t i = 0; i < numOfCols; ++i) {
95,453✔
248
      SColMatchItem* pmInfo = taosArrayGet(pColMatchInfo, i);
79,875✔
249
      if (pmInfo == NULL) {
79,875!
250
        code = terrno;
×
251
        return code;
×
252
      }
253

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

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

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

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

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

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

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

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

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

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

306

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

312
  blockDataDestroy(pSortMergeInfo->pIntermediateBlock);
12,029✔
313
  pSortMergeInfo->pIntermediateBlock = NULL;
12,029✔
314

315
  taosArrayDestroy(pSortMergeInfo->matchInfo.pList);
12,029✔
316

317
  tsortDestroySortHandle(pSortMergeInfo->pSortHandle);
12,029✔
318
  taosArrayDestroy(pSortMergeInfo->pSortInfo);
12,029✔
319
}
12,029✔
320

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

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

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

UNCOV
338
  for (int32_t i = 0; i < pOperator->numOfDownstream; ++i) {
×
UNCOV
339
    pNonSortMergeInfo->pSourceStatus[i] = i;
×
340
  }
341

UNCOV
342
  return 0;
×
343
}
344

UNCOV
345
int32_t doNonSortMerge(SOperatorInfo* pOperator, SSDataBlock** pResBlock) {
×
UNCOV
346
  QRY_PARAM_CHECK(pResBlock);
×
347

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

UNCOV
355
  qDebug("start to merge no sorted rows, %s", GET_TASKID(pTaskInfo));
×
356

UNCOV
357
  int32_t idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
×
UNCOV
358
  while (idx < pNonSortMerge->sourceNum) {
×
UNCOV
359
    pBlock = getNextBlockFromDownstream(pOperator, pNonSortMerge->pSourceStatus[idx]);
×
UNCOV
360
    if (NULL == pBlock) {
×
UNCOV
361
      TSWAP(pNonSortMerge->pSourceStatus[pNonSortMerge->sourceWorkIdx], pNonSortMerge->pSourceStatus[idx]);
×
UNCOV
362
      pNonSortMerge->sourceWorkIdx++;
×
UNCOV
363
      idx = NON_SORT_NEXT_SRC(pNonSortMerge, pNonSortMerge->lastSourceIdx);
×
UNCOV
364
      continue;
×
365
    }
366

UNCOV
367
    pNonSortMerge->lastSourceIdx = idx - 1;
×
UNCOV
368
    break;
×
369
  }
370

UNCOV
371
  if (!pBlock) {  // null data
×
UNCOV
372
    return code;
×
373
  }
374

UNCOV
375
  code = copyDataBlock(pRes, pBlock);
×
UNCOV
376
  *pResBlock = pRes;
×
UNCOV
377
  return code;
×
378
}
379

UNCOV
380
void destroyNonSortMergeOperatorInfo(void* param) {
×
UNCOV
381
  SNonSortMergeInfo* pNonSortMerge = param;
×
UNCOV
382
  taosMemoryFree(pNonSortMerge->pSourceStatus);
×
UNCOV
383
}
×
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) {
75✔
391
  return TSDB_CODE_SUCCESS;
75✔
392
}
393

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

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

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

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

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

425
  return code;
148✔
426
}
427

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

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

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

440
  for (int32_t i = 0; i < 2; ++i) {
223✔
441
    pBlock = getNextBlockFromDownstream(pOperator, i);
149✔
442
    if (pBlock && pBlock->info.rows > 1) {
148!
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) {
148!
446
      nullBlkNum++;
×
447
    }
448
    
449
    code = copyColumnsValue(pColsMerge->pTargets, pColsMerge->srcBlkIds[i], pInfo->binfo.pRes, pBlock);
148✔
450
    if (code) {
148!
451
      return code;
×
452
    }
453
  }
454

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

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

463
  return code;
74✔
464
}
465

466
void destroyColsMergeOperatorInfo(void* param) {
75✔
467
}
75✔
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) {
26,102✔
483
  int32_t code = 0;
26,102✔
484
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
26,102✔
485
  SExecTaskInfo*              pTaskInfo = pOperator->pTaskInfo;
26,102✔
486

487
  if (OPTR_IS_OPENED(pOperator)) {
26,102✔
488
    return TSDB_CODE_SUCCESS;
14,246✔
489
  }
490

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

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

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

506
  OPTR_SET_OPENED(pOperator);
11,730✔
507
  return code;
11,730✔
508
}
509

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

515
  if (pOperator->status == OP_EXEC_DONE) {
26,190✔
516
    return 0;
88✔
517
  }
518

519
  SExecTaskInfo* pTaskInfo = pOperator->pTaskInfo;
26,102✔
520
  SMultiwayMergeOperatorInfo* pInfo = pOperator->info;
26,102✔
521

522
  code = pOperator->fpSet._openFn(pOperator);
26,102✔
523
  QUERY_CHECK_CODE(code, lino, _end);
25,975!
524

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

530
  if ((*pResBlock) != NULL) {
25,954✔
531
    pOperator->resultInfo.totalRows += (*pResBlock)->info.rows;
15,652✔
532
    code = blockDataCheck(*pResBlock);
15,652✔
533
    QUERY_CHECK_CODE(code, lino, _end);
15,651!
534
  } else {
535
    setOperatorCompleted(pOperator);
10,302✔
536
  }
537

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

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

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

556
  taosMemoryFreeClear(param);
12,108!
557
}
12,108✔
558

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

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

567
  return code;
577✔
568
}
569

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

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

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

591
  pInfo->type = pMergePhyNode->type;
12,103✔
592
  switch (pInfo->type) {
12,103!
593
    case MERGE_TYPE_SORT: {
12,028✔
594
      SSortMergeInfo* pSortMergeInfo = &pInfo->sortMergeInfo;
12,028✔
595
      initLimitInfo(pMergePhyNode->node.pLimit, pMergePhyNode->node.pSlimit, &pInfo->limitInfo);
12,028✔
596
      pInfo->binfo.pRes = createDataBlockFromDescNode(pDescNode);
12,029✔
597
      TSDB_CHECK_NULL(pInfo->binfo.pRes, code, lino, _error, terrno);
12,045✔
598

599
      SPhysiNode*  pChildNode = (SPhysiNode*)nodesListGetNode(pPhyNode->pChildren, 0);
12,025✔
600
      SSDataBlock* pInputBlock = createDataBlockFromDescNode(pChildNode->pOutputDataBlockDesc);
12,025✔
601
      TSDB_CHECK_NULL(pInputBlock, code, lino, _error, terrno);
12,025✔
602
      pSortMergeInfo->pInputBlock = pInputBlock;
12,021✔
603

604
      initResultSizeInfo(&pOperator->resultInfo, 1024);
12,021✔
605
      code = blockDataEnsureCapacity(pInfo->binfo.pRes, pOperator->resultInfo.capacity);
12,021✔
606
      TSDB_CHECK_CODE(code, lino, _error);
12,021✔
607

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

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

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

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

642
      pColsMerge->pTargets = pMergePhyNode->pTargets;
75✔
643
      pColsMerge->srcBlkIds[0] = getOperatorResultBlockId(downStreams[0], 0);
75✔
644
      pColsMerge->srcBlkIds[1] = getOperatorResultBlockId(downStreams[1], 0);
75✔
645
      break;
75✔
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,
12,083✔
654
                  pTaskInfo);
655
  pOperator->fpSet =
656
      createOperatorFpSet(openMultiwayMergeOperator, doMultiwayMerge, NULL, destroyMultiwayMergeOperatorInfo,
12,083✔
657
                          optrDefaultBufFn, getMultiwayMergeExplainExecInfo, optrDefaultGetNextExtFn, NULL);
658

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

664
  *pOptrInfo = pOperator;
12,084✔
665
  return TSDB_CODE_SUCCESS;
12,084✔
666

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