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

taosdata / TDengine / #3531

19 Nov 2024 10:42AM UTC coverage: 60.213% (-0.006%) from 60.219%
#3531

push

travis-ci

web-flow
Merge pull request #28777 from taosdata/fix/3.0/TD-32366

fix:TD-32366/stmt add geometry datatype check

118529 of 252344 branches covered (46.97%)

Branch coverage included in aggregate %.

7 of 48 new or added lines in 3 files covered. (14.58%)

2282 existing lines in 115 files now uncovered.

199096 of 275161 relevant lines covered (72.36%)

6067577.83 hits per line

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

87.56
/source/libs/parser/src/parCalcConst.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 "functionMgt.h"
17
#include "parInt.h"
18
#include "scalar.h"
19
#include "ttime.h"
20

21
typedef struct SNodeReplaceContext {
22
  SNode* pTarget;
23
  SNode* pNew;
24
  bool   replaced;
25
} SNodeReplaceContext;
26

27
typedef struct SCalcConstContext {
28
  SParseContext*       pParseCxt;
29
  SNodeReplaceContext  replaceCxt;
30
  SMsgBuf              msgBuf;
31
  int32_t              code;
32
} SCalcConstContext;
33

34
static int32_t calcConstQuery(SCalcConstContext* pCxt, SNode* pStmt, bool subquery);
35

36
static int32_t calcConstSubquery(SCalcConstContext* pCxt, STempTableNode* pTempTable) {
299,792✔
37
  return calcConstQuery(pCxt, pTempTable->pSubquery, true);
299,792✔
38
}
39

40
static int32_t calcConstNode(SNode** pNode) {
2,816,521✔
41
  if (NULL == *pNode) {
2,816,521✔
42
    return TSDB_CODE_SUCCESS;
2,217,020✔
43
  }
44

45
  SNode*  pNew = NULL;
599,501✔
46
  int32_t code = scalarCalculateConstants(*pNode, &pNew);
599,501✔
47
  if (TSDB_CODE_SUCCESS == code) {
599,508✔
48
    *pNode = pNew;
599,506✔
49
  }
50
  return code;
599,508✔
51
}
52

53
static int32_t calcConstList(SNodeList* pList) {
4,598,477✔
54
  SNode* pNode = NULL;
4,598,477✔
55
  FOREACH(pNode, pList) {
5,346,933✔
56
    SNode*  pNew = NULL;
748,455✔
57
    int32_t code = scalarCalculateConstants(pNode, &pNew);
748,455✔
58
    if (TSDB_CODE_SUCCESS == code) {
748,456!
59
      REPLACE_NODE(pNew);
748,456✔
60
    } else {
61
      return code;
×
62
    }
63
  }
64
  return TSDB_CODE_SUCCESS;
4,598,478✔
65
}
66

67
static bool isCondition(const SNode* pNode) {
1,453,635✔
68
  if (QUERY_NODE_OPERATOR == nodeType(pNode)) {
1,453,635✔
69
    return nodesIsComparisonOp((const SOperatorNode*)pNode);
1,116,953✔
70
  }
71
  return (QUERY_NODE_LOGIC_CONDITION == nodeType(pNode));
336,682✔
72
}
73

74
static int32_t rewriteIsTrue(SNode* pSrc, SNode** pIsTrue) {
22✔
75
  SOperatorNode* pOp = NULL;
22✔
76
  int32_t code = nodesMakeNode(QUERY_NODE_OPERATOR, (SNode**)&pOp);
22✔
77
  if (NULL == pOp) {
22!
78
    return code;
×
79
  }
80
  pOp->opType = OP_TYPE_IS_TRUE;
22✔
81
  pOp->pLeft = pSrc;
22✔
82
  pOp->node.resType.type = TSDB_DATA_TYPE_BOOL;
22✔
83
  pOp->node.resType.bytes = tDataTypes[TSDB_DATA_TYPE_BOOL].bytes;
22✔
84
  *pIsTrue = (SNode*)pOp;
22✔
85
  return TSDB_CODE_SUCCESS;
22✔
86
}
87

88
static EDealRes doRewriteCondition(SNode** pNode, void* pContext) {
7,335,340✔
89
  if (QUERY_NODE_LOGIC_CONDITION == nodeType(*pNode)) {
7,335,340✔
90
    SNode* pParam = NULL;
336,673✔
91
    FOREACH(pParam, ((SLogicConditionNode*)*pNode)->pParameterList) {
1,232,955!
92
      if (!isCondition(pParam)) {
896,283!
93
        SNode* pIsTrue = NULL;
×
94
        if (TSDB_CODE_SUCCESS != rewriteIsTrue(pParam, &pIsTrue)) {
×
95
          ((SCalcConstContext*)pContext)->code = TSDB_CODE_OUT_OF_MEMORY;
×
96
          return DEAL_RES_ERROR;
×
97
        }
98
        REPLACE_NODE(pIsTrue);
×
99
      }
100
    }
101
  }
102
  return DEAL_RES_CONTINUE;
7,335,339✔
103
}
104

105
static int32_t rewriteCondition(SCalcConstContext* pCxt, SNode** pNode) {
557,352✔
106
  if (!isCondition(*pNode)) {
557,352✔
107
    return rewriteIsTrue(*pNode, pNode);
22✔
108
  }
109
  nodesRewriteExprPostOrder(pNode, doRewriteCondition, pCxt);
557,330✔
110
  return pCxt->code;
557,332✔
111
}
112

113
static int32_t calcConstCondition(SCalcConstContext* pCxt, SNode** pNode) {
45,658✔
114
  int32_t code = rewriteCondition(pCxt, pNode);
45,658✔
115
  if (TSDB_CODE_SUCCESS == code) {
45,658!
116
    code = calcConstNode(pNode);
45,658✔
117
  }
118
  return code;
45,658✔
119
}
120

121
static int32_t rewriteConditionForFromTable(SCalcConstContext* pCxt, SNode* pTable) {
1,371,530✔
122
  int32_t code = TSDB_CODE_SUCCESS;
1,371,530✔
123
  switch (nodeType(pTable)) {
1,371,530✔
124
    case QUERY_NODE_TEMP_TABLE: {
299,793✔
125
      code = calcConstSubquery(pCxt, (STempTableNode*)pTable);
299,793✔
126
      break;
299,794✔
127
    }
128
    case QUERY_NODE_JOIN_TABLE: {
115,679✔
129
      SJoinTableNode* pJoin = (SJoinTableNode*)pTable;
115,679✔
130
      code = rewriteConditionForFromTable(pCxt, pJoin->pLeft);
115,679✔
131
      if (TSDB_CODE_SUCCESS == code) {
115,679!
132
        code = rewriteConditionForFromTable(pCxt, pJoin->pRight);
115,679✔
133
      }
134
      if (TSDB_CODE_SUCCESS == code && NULL != pJoin->pOnCond) {
115,679!
135
        code = calcConstCondition(pCxt, &pJoin->pOnCond);
45,658✔
136
      }
137
      // todo empty table
138
      break;
115,679✔
139
    }
140
    default:
956,058✔
141
      break;
956,058✔
142
  }
143
  return code;
1,371,531✔
144
}
145

146
static int32_t calcConstFromTable(SCalcConstContext* pCxt, SNode* pTable) {
1,140,172✔
147
  return rewriteConditionForFromTable(pCxt, pTable);
1,140,172✔
148
}
149

150
static void rewriteConstCondition(SNode** pCond, bool* pAlwaysFalse) {
511,694✔
151
  if (QUERY_NODE_VALUE != nodeType(*pCond)) {
511,694✔
152
    return;
482,124✔
153
  }
154
  if (((SValueNode*)*pCond)->datum.b) {
29,570✔
155
    nodesDestroyNode(*pCond);
29,091✔
156
    *pCond = NULL;
29,091✔
157
  } else {
158
    *pAlwaysFalse = true;
479✔
159
  }
160
}
161

162
static int32_t calcConstStmtCondition(SCalcConstContext* pCxt, SNode** pCond, bool* pAlwaysFalse) {
2,268,390✔
163
  if (NULL == *pCond) {
2,268,390✔
164
    return TSDB_CODE_SUCCESS;
1,756,696✔
165
  }
166

167
  int32_t code = rewriteCondition(pCxt, pCond);
511,694✔
168
  if (TSDB_CODE_SUCCESS == code) {
511,696!
169
    code = calcConstNode(pCond);
511,696✔
170
  }
171
  if (TSDB_CODE_SUCCESS == code) {
511,696✔
172
    rewriteConstCondition(pCond, pAlwaysFalse);
511,694✔
173
  }
174
  return code;
511,696✔
175
}
176

177
static EDealRes doFindAndReplaceNode(SNode** pNode, void* pContext) {
6✔
178
  SCalcConstContext* pCxt = pContext;
6✔
179
  if (pCxt->replaceCxt.pTarget == *pNode) {
6!
180
    char aliasName[TSDB_COL_NAME_LEN] = {0};
6✔
181
    strcpy(aliasName, ((SExprNode*)*pNode)->aliasName);
6✔
182
    nodesDestroyNode(*pNode);
6✔
183
    *pNode = NULL;
6✔
184
    pCxt->code = nodesCloneNode(pCxt->replaceCxt.pNew, pNode);
6✔
185
    if (NULL == *pNode) {
6!
186
      return DEAL_RES_ERROR;
×
187
    }
188
    strcpy(((SExprNode*)*pNode)->aliasName, aliasName);
6✔
189

190
    pCxt->replaceCxt.replaced = true;
6✔
191
    return DEAL_RES_END;
6✔
192
  }
193
  return DEAL_RES_CONTINUE;
×
194
}
195

196
static int32_t findAndReplaceNode(SCalcConstContext* pCxt, SNode** pRoot, SNode* pTarget, SNode* pNew, bool strict) {
6✔
197
  pCxt->replaceCxt.pNew = pNew;
6✔
198
  pCxt->replaceCxt.pTarget = pTarget;
6✔
199
  
200
  nodesRewriteExprPostOrder(pRoot, doFindAndReplaceNode, pCxt);
6✔
201
  if (TSDB_CODE_SUCCESS == pCxt->code && strict && !pCxt->replaceCxt.replaced) {
6!
202
    parserError("target replace node not found, %p", pTarget);
×
203
    return TSDB_CODE_PAR_INTERNAL_ERROR;
×
204
  }
205
  return pCxt->code;
6✔
206
}
207

208
static int32_t calcConstProject(SCalcConstContext* pCxt, SNode* pProject, bool dual, SNode** pNew) {
4,276,590✔
209
  SArray* pAssociation = NULL;
4,276,590✔
210
  if (NULL != ((SExprNode*)pProject)->pAssociation) {
4,276,590✔
211
    pAssociation = taosArrayDup(((SExprNode*)pProject)->pAssociation, NULL);
603,265✔
212
    if (NULL == pAssociation) {
603,265!
UNCOV
213
      return terrno;
×
214
    }
215
  }
216

217
  char aliasName[TSDB_COL_NAME_LEN] = {0};
4,276,596✔
218
  int32_t code = TSDB_CODE_SUCCESS;
4,276,596✔
219
  if (dual) {
4,276,596✔
220
    code = scalarCalculateConstantsFromDual(pProject, pNew);
75,545✔
221
  } else {
222
    code = scalarCalculateConstants(pProject, pNew);
4,201,051✔
223
  }
224
  if (TSDB_CODE_SUCCESS == code) {
4,276,599✔
225
    if (QUERY_NODE_VALUE == nodeType(*pNew) && NULL != pAssociation) {
4,276,582✔
226
      int32_t size = taosArrayGetSize(pAssociation);
30,702✔
227
      for (int32_t i = 0; i < size; ++i) {
61,436✔
228
        SAssociationNode* pAssNode = taosArrayGet(pAssociation, i);
30,734✔
229
        SNode** pCol = pAssNode->pPlace;
30,734✔
230
        if (*pCol == pAssNode->pAssociationNode) {
30,734✔
231
          strcpy(aliasName, ((SExprNode*)*pCol)->aliasName);
30,728✔
232
          SArray* pOrigAss = NULL;
30,728✔
233
          TSWAP(((SExprNode*)*pCol)->pAssociation, pOrigAss);
30,728✔
234
          nodesDestroyNode(*pCol);
30,728✔
235
          *pCol = NULL;
30,728✔
236
          code = nodesCloneNode(*pNew, pCol);
30,728✔
237
          if (TSDB_CODE_SUCCESS == code) {
30,728!
238
            strcpy(((SExprNode*)*pCol)->aliasName, aliasName);
30,728✔
239
            TSWAP(pOrigAss, ((SExprNode*)*pCol)->pAssociation);
30,728✔
240
          }
241
          taosArrayDestroy(pOrigAss);
30,728✔
242
          if (TSDB_CODE_SUCCESS != code) {
30,728!
243
            break;
×
244
          }
245
        } else {
246
          code = findAndReplaceNode(pCxt, pCol, pAssNode->pAssociationNode, *pNew, true);
6✔
247
          if (TSDB_CODE_SUCCESS != code) {
6!
248
            break;
×
249
          }
250
        }
251
      }
252
    }
253
  }
254
  taosArrayDestroy(pAssociation);
4,276,599✔
255
  return code;
4,276,597✔
256
}
257

258
typedef struct SIsUselessColCtx  {
259
  bool      isUseless;
260
} SIsUselessColCtx ;
261

262
EDealRes checkUselessCol(SNode *pNode, void *pContext) {
2,344,903✔
263
  SIsUselessColCtx  *ctx = (SIsUselessColCtx *)pContext;
2,344,903✔
264
  if (QUERY_NODE_FUNCTION == nodeType(pNode) && !fmIsScalarFunc(((SFunctionNode*)pNode)->funcId) &&
2,344,903✔
265
      !fmIsPseudoColumnFunc(((SFunctionNode*)pNode)->funcId)) {
196,132✔
266
    ctx->isUseless = false;  
161,615✔
267
    return DEAL_RES_END;
161,615✔
268
  }
269

270
  return DEAL_RES_CONTINUE;
2,183,289✔
271
}
272

273
static bool isUselessCol(SExprNode* pProj) {
1,954,106✔
274
  SIsUselessColCtx ctx = {.isUseless = true};
1,954,106✔
275
  nodesWalkExpr((SNode*)pProj, checkUselessCol, (void *)&ctx);
1,954,106✔
276
  if (!ctx.isUseless) {
1,954,107✔
277
    return false;
161,615✔
278
  }
279
  return NULL == ((SExprNode*)pProj)->pAssociation;
1,792,492✔
280
}
281

282
static int32_t createConstantValue(SValueNode** ppNode) {
1,959✔
283
  SValueNode* pVal = NULL;
1,959✔
284
  int32_t code = nodesMakeNode(QUERY_NODE_VALUE, (SNode**)&pVal);
1,959✔
285
  if (NULL == pVal) {
1,959!
286
    return code;
×
287
  }
288
  pVal->node.resType.type = TSDB_DATA_TYPE_INT;
1,959✔
289
  pVal->node.resType.bytes = tDataTypes[TSDB_DATA_TYPE_INT].bytes;
1,959✔
290
  const int32_t val = 1;
1,959✔
291
  code = nodesSetValueNodeValue(pVal, (void*)&val);
1,959✔
292
  if (TSDB_CODE_SUCCESS == code) {
1,959!
293
    pVal->translate = true;
1,959✔
294
    *ppNode = pVal;
1,959✔
295
  } else {
296
    nodesDestroyNode((SNode*)pVal);
×
297
  }
298
  return code;
1,959✔
299
}
300

301
static int32_t calcConstProjections(SCalcConstContext* pCxt, SSelectStmt* pSelect, bool subquery) {
1,205,088✔
302
  SNode* pProj = NULL;
1,205,088✔
303
  WHERE_EACH(pProj, pSelect->pProjectionList) {
6,753,612!
304
    if (subquery && !pSelect->isDistinct && !pSelect->tagScan && isUselessCol((SExprNode*)pProj)) {
5,548,538✔
305
      ERASE_NODE(pSelect->pProjectionList);
1,271,944✔
306
      continue;
1,271,944✔
307
    }
308
    SNode*  pNew = NULL;
4,276,593✔
309
    int32_t code = calcConstProject(pCxt, pProj, (NULL == pSelect->pFromTable), &pNew);
4,276,593✔
310
    if (TSDB_CODE_SUCCESS == code) {
4,276,598✔
311
      REPLACE_NODE(pNew);
4,276,580✔
312
    } else {
313
      return code;
18✔
314
    }
315
    WHERE_NEXT;
4,276,580✔
316
  }
317
  if (0 == LIST_LENGTH(pSelect->pProjectionList)) {
1,205,074!
318
    SValueNode* pVal = NULL;
1,947✔
319
    int32_t code = createConstantValue(&pVal);
1,947✔
320
    if (TSDB_CODE_SUCCESS == code) {
1,949!
321
      return nodesListStrictAppend(pSelect->pProjectionList, (SNode*)pVal);
1,949✔
322
    }
323
  }
324
  return TSDB_CODE_SUCCESS;
1,203,127✔
325
}
326

327
static int32_t calcConstGroupBy(SCalcConstContext* pCxt, SSelectStmt* pSelect) {
1,129,589✔
328
  int32_t code = calcConstList(pSelect->pGroupByList);
1,129,589✔
329
  if (TSDB_CODE_SUCCESS == code) {
1,129,589!
330
    SNode* pNode = NULL;
1,129,589✔
331
    FOREACH(pNode, pSelect->pGroupByList) {
1,144,633✔
332
      SNode* pGroupPara = NULL;
185,468✔
333
      FOREACH(pGroupPara, ((SGroupingSetNode*)pNode)->pParameterList) {
200,512!
334
        if (QUERY_NODE_VALUE != nodeType(pGroupPara)) {
185,468✔
335
          return code;
170,424✔
336
        }
337
      }
338
    }
339
    NODES_DESTORY_LIST(pSelect->pGroupByList);
959,165✔
340
  }
341
  return code;
959,162✔
342
}
343

344
static int32_t calcConstSelectWithoutFrom(SCalcConstContext* pCxt, SSelectStmt* pSelect, bool subquery) {
75,503✔
345
  return calcConstProjections(pCxt, pSelect, subquery);
75,503✔
346
}
347

348
static int32_t calcConstSelectFrom(SCalcConstContext* pCxt, SSelectStmt* pSelect, bool subquery) {
1,130,785✔
349
  int32_t code = calcConstFromTable(pCxt, pSelect->pFromTable);
1,130,785✔
350
  if (TSDB_CODE_SUCCESS == code && QUERY_NODE_TEMP_TABLE == nodeType(pSelect->pFromTable) &&
1,130,788!
351
      ((STempTableNode*)pSelect->pFromTable)->pSubquery != NULL &&
299,204!
352
      QUERY_NODE_SELECT_STMT == nodeType(((STempTableNode*)pSelect->pFromTable)->pSubquery) &&
299,204✔
353
      ((SSelectStmt*)((STempTableNode*)pSelect->pFromTable)->pSubquery)->isEmptyResult){
264,318✔
354
    pSelect->isEmptyResult = true;
1,201✔
355
    return code;
1,201✔
356
  }      
357
  if (TSDB_CODE_SUCCESS == code) {
1,129,587!
358
    code = calcConstProjections(pCxt, pSelect, subquery);
1,129,587✔
359
  }
360
  if (TSDB_CODE_SUCCESS == code) {
1,129,589!
361
    code = calcConstStmtCondition(pCxt, &pSelect->pWhere, &pSelect->isEmptyResult);
1,129,589✔
362
  }
363
  if (TSDB_CODE_SUCCESS == code) {
1,129,590✔
364
    code = calcConstList(pSelect->pPartitionByList);
1,129,589✔
365
  }
366
  if (TSDB_CODE_SUCCESS == code) {
1,129,589✔
367
    code = calcConstList(pSelect->pTags);
1,129,588✔
368
  }
369
  if (TSDB_CODE_SUCCESS == code) {
1,129,587✔
370
    code = calcConstNode(&pSelect->pSubtable);
1,129,586✔
371
  }
372
  if (TSDB_CODE_SUCCESS == code) {
1,129,587!
373
    code = calcConstNode(&pSelect->pWindow);
1,129,587✔
374
  }
375
  if (TSDB_CODE_SUCCESS == code) {
1,129,588!
376
    code = calcConstGroupBy(pCxt, pSelect);
1,129,588✔
377
  }
378
  if (TSDB_CODE_SUCCESS == code) {
1,129,586!
379
    code = calcConstStmtCondition(pCxt, &pSelect->pHaving, &pSelect->isEmptyResult);
1,129,586✔
380
  }
381
  if (TSDB_CODE_SUCCESS == code) {
1,129,587!
382
    code = calcConstList(pSelect->pOrderByList);
1,129,587✔
383
  }
384
  return code;
1,129,590✔
385
}
386

387
static int32_t calcConstSelect(SCalcConstContext* pCxt, SSelectStmt* pSelect, bool subquery) {
1,206,289✔
388
  if (NULL == pSelect->pFromTable) {
1,206,289✔
389
    return calcConstSelectWithoutFrom(pCxt, pSelect, subquery);
75,503✔
390
  } else {
391
    return calcConstSelectFrom(pCxt, pSelect, subquery);
1,130,786✔
392
  }
393
}
394

395
static int32_t calcConstDelete(SCalcConstContext* pCxt, SDeleteStmt* pDelete) {
9,215✔
396
  int32_t code = calcConstFromTable(pCxt, pDelete->pFromTable);
9,215✔
397
  if (TSDB_CODE_SUCCESS == code) {
9,215!
398
    code = calcConstStmtCondition(pCxt, &pDelete->pWhere, &pDelete->deleteZeroRows);
9,215✔
399
  }
400
  if (code == TSDB_CODE_SUCCESS && pDelete->timeRange.skey > pDelete->timeRange.ekey) {
9,215!
401
    pDelete->deleteZeroRows = true;
598✔
402
  }
403
  return code;
9,215✔
404
}
405

406
static int32_t calcConstInsert(SCalcConstContext* pCxt, SInsertStmt* pInsert) {
172✔
407
  int32_t code = calcConstFromTable(pCxt, pInsert->pTable);
172✔
408
  if (TSDB_CODE_SUCCESS == code) {
172!
409
    code = calcConstQuery(pCxt, pInsert->pQuery, false);
172✔
410
  }
411
  return code;
172✔
412
}
413

414
static SNodeList* getChildProjection(SNode* pStmt) {
64,466✔
415
  switch (nodeType(pStmt)) {
64,466!
416
    case QUERY_NODE_SELECT_STMT:
64,376✔
417
      return ((SSelectStmt*)pStmt)->pProjectionList;
64,376✔
418
    case QUERY_NODE_SET_OPERATOR:
90✔
419
      return ((SSetOperator*)pStmt)->pProjectionList;
90✔
420
    default:
×
421
      break;
×
422
  }
423
  return NULL;
×
424
}
425

426
static void eraseSetOpChildProjection(SSetOperator* pSetOp, int32_t index) {
16,048✔
427
  SNodeList* pLeftProjs = getChildProjection(pSetOp->pLeft);
16,048✔
428
  (void)nodesListErase(pLeftProjs, nodesListGetCell(pLeftProjs, index));
16,048✔
429
  if (QUERY_NODE_SET_OPERATOR == nodeType(pSetOp->pLeft)) {
16,048✔
430
    eraseSetOpChildProjection((SSetOperator*)pSetOp->pLeft, index);
43✔
431
  }
432
  SNodeList* pRightProjs = getChildProjection(pSetOp->pRight);
16,048✔
433
  (void)nodesListErase(pRightProjs, nodesListGetCell(pRightProjs, index));
16,048✔
434
  if (QUERY_NODE_SET_OPERATOR == nodeType(pSetOp->pRight)) {
16,048!
435
    eraseSetOpChildProjection((SSetOperator*)pSetOp->pRight, index);
×
436
  }
437
}
16,048✔
438

439
typedef struct SNotRefByOrderByCxt {
440
  SColumnNode* pCol;
441
  bool         hasThisCol;
442
} SNotRefByOrderByCxt;
443

444
static EDealRes notRefByOrderByImpl(SNode* pNode, void* pContext) {
100,228✔
445
  if (QUERY_NODE_COLUMN == nodeType(pNode)) {
100,228✔
446
    SNotRefByOrderByCxt* pCxt = (SNotRefByOrderByCxt*)pContext;
50,114✔
447
    if (nodesEqualNode((SNode*)pCxt->pCol, pNode)) {
50,114✔
448
      pCxt->hasThisCol = true;
15,830✔
449
      return DEAL_RES_END;
15,830✔
450
    }
451
  }
452
  return DEAL_RES_CONTINUE;
84,398✔
453
}
454

455
static bool notRefByOrderBy(SColumnNode* pCol, SNodeList* pOrderByList) {
52,524✔
456
  SNotRefByOrderByCxt cxt = {.pCol = pCol, .hasThisCol = false};
52,524✔
457
  nodesWalkExprs(pOrderByList, notRefByOrderByImpl, &cxt);
52,524✔
458
  return !cxt.hasThisCol;
52,524✔
459
}
460

461
static bool isDistinctSubQuery(SNode* pNode) {
32,717✔
462
  if (NULL == pNode) {
32,717!
463
    return false;
×
464
  }
465
  switch (nodeType(pNode)) {
32,717!
466
    case QUERY_NODE_SELECT_STMT:
32,370✔
467
      return ((SSelectStmt*)pNode)->isDistinct;
32,370✔
468
    case QUERY_NODE_SET_OPERATOR:
347✔
469
      return isDistinctSubQuery((((SSetOperator*)pNode)->pLeft)) || isDistinctSubQuery((((SSetOperator*)pNode)->pLeft));
347!
470
    default:
×
471
      break;
×
472
  }
473
  return false;
×
474
}
475

476
static bool isSetUselessCol(SSetOperator* pSetOp, int32_t index, SExprNode* pProj) {
36,694✔
477
  if (!isUselessCol(pProj)) {
36,694✔
478
    return false;
20,342✔
479
  }
480

481
  SNodeList* pLeftProjs = getChildProjection(pSetOp->pLeft);
16,352✔
482
  if (!isUselessCol((SExprNode*)nodesListGetNode(pLeftProjs, index)) || isDistinctSubQuery(pSetOp->pLeft)) {
16,352!
483
    return false;
334✔
484
  }
485

486
  SNodeList* pRightProjs = getChildProjection(pSetOp->pRight);
16,018✔
487
  if (!isUselessCol((SExprNode*)nodesListGetNode(pRightProjs, index)) || isDistinctSubQuery(pSetOp->pLeft)) {
16,018!
488
    return false;
13✔
489
  }
490

491
  return true;
16,005✔
492
}
493

494
static int32_t calcConstSetOpProjections(SCalcConstContext* pCxt, SSetOperator* pSetOp, bool subquery) {
80,133✔
495
  if (subquery && pSetOp->opType == SET_OP_TYPE_UNION) {
80,133✔
496
    return TSDB_CODE_SUCCESS;
17,102✔
497
  }
498
  int32_t index = 0;
63,031✔
499
  SNode*  pProj = NULL;
63,031✔
500
  WHERE_EACH(pProj, pSetOp->pProjectionList) {
207,000!
501
    if (subquery && notRefByOrderBy((SColumnNode*)pProj, pSetOp->pOrderByList) &&
180,663✔
502
        isSetUselessCol(pSetOp, index, (SExprNode*)pProj)) {
36,694✔
503
      ERASE_NODE(pSetOp->pProjectionList);
16,005✔
504
      eraseSetOpChildProjection(pSetOp, index);
16,005✔
505
      continue;
16,005✔
506
    }
507
    ++index;
127,964✔
508
    WHERE_NEXT;
127,964✔
509
  }
510
  if (0 == LIST_LENGTH(pSetOp->pProjectionList)) {
63,031!
511
    SValueNode* pVal = NULL;
10✔
512
    int32_t code = createConstantValue(&pVal);
10✔
513
    if (TSDB_CODE_SUCCESS == code) {
10!
514
      return nodesListStrictAppend(pSetOp->pProjectionList, (SNode*)pVal);
10✔
515
    }
516
  }
517
  return TSDB_CODE_SUCCESS;
63,021✔
518
}
519

520
static int32_t calcConstSetOperator(SCalcConstContext* pCxt, SSetOperator* pSetOp, bool subquery) {
80,133✔
521
  int32_t code = calcConstSetOpProjections(pCxt, pSetOp, subquery);
80,133✔
522
  if (TSDB_CODE_SUCCESS == code) {
80,133!
523
    code = calcConstQuery(pCxt, pSetOp->pLeft, false);
80,133✔
524
  }
525
  if (TSDB_CODE_SUCCESS == code) {
80,133!
526
    code = calcConstQuery(pCxt, pSetOp->pRight, false);
80,133✔
527
  }
528
  if (TSDB_CODE_SUCCESS == code) {
80,133!
529
    code = calcConstList(pSetOp->pOrderByList);
80,133✔
530
  }
531
  return code;
80,133✔
532
}
533

534
static int32_t calcConstQuery(SCalcConstContext* pCxt, SNode* pStmt, bool subquery) {
1,578,571✔
535
  int32_t code = TSDB_CODE_SUCCESS;
1,578,571✔
536
  switch (nodeType(pStmt)) {
1,578,571✔
537
    case QUERY_NODE_SELECT_STMT:
1,206,290✔
538
      code = calcConstSelect(pCxt, (SSelectStmt*)pStmt, subquery);
1,206,290✔
539
      break;
1,206,294✔
540
    case QUERY_NODE_EXPLAIN_STMT:
132,426✔
541
      code = calcConstQuery(pCxt, ((SExplainStmt*)pStmt)->pQuery, subquery);
132,426✔
542
      break;
132,426✔
543
    case QUERY_NODE_SET_OPERATOR: {
80,133✔
544
      code = calcConstSetOperator(pCxt, (SSetOperator*)pStmt, subquery);
80,133✔
545
      break;
80,133✔
546
    }
547
    case QUERY_NODE_DELETE_STMT:
9,215✔
548
      code = calcConstDelete(pCxt, (SDeleteStmt*)pStmt);
9,215✔
549
      break;
9,215✔
550
    case QUERY_NODE_INSERT_STMT:
172✔
551
      code = calcConstInsert(pCxt, (SInsertStmt*)pStmt);
172✔
552
      break;
172✔
553
    default:
150,335✔
554
      break;
150,335✔
555
  }
556
  return code;
1,578,575✔
557
}
558

559
static bool isEmptyResultQuery(SNode* pStmt) {
1,163,210✔
560
  bool isEmptyResult = false;
1,163,210✔
561
  switch (nodeType(pStmt)) {
1,163,210✔
562
    case QUERY_NODE_SELECT_STMT:
826,176✔
563
      isEmptyResult = ((SSelectStmt*)pStmt)->isEmptyResult;
826,176✔
564
      break;
826,176✔
565
    case QUERY_NODE_EXPLAIN_STMT:
132,425✔
566
      isEmptyResult = isEmptyResultQuery(((SExplainStmt*)pStmt)->pQuery);
132,425✔
567
      break;
132,425✔
568
    case QUERY_NODE_SET_OPERATOR: {
44,887✔
569
      SSetOperator* pSetOp = (SSetOperator*)pStmt;
44,887✔
570
      isEmptyResult = isEmptyResultQuery(pSetOp->pLeft);
44,887✔
571
      if (isEmptyResult) {
44,887!
572
        isEmptyResult = isEmptyResultQuery(pSetOp->pRight);
×
573
      }
574
      break;
44,887✔
575
    }
576
    case QUERY_NODE_DELETE_STMT:
9,215✔
577
      isEmptyResult = ((SDeleteStmt*)pStmt)->deleteZeroRows;
9,215✔
578
      break;
9,215✔
579
    default:
150,507✔
580
      break;
150,507✔
581
  }
582
  return isEmptyResult;
1,163,210✔
583
}
584

585
static void resetProjectNullTypeImpl(SNodeList* pProjects) {
693,768✔
586
  SNode* pProj = NULL;
693,768✔
587
  FOREACH(pProj, pProjects) {
3,538,831!
588
    SExprNode* pExpr = (SExprNode*)pProj;
2,845,063✔
589
    if (TSDB_DATA_TYPE_NULL == pExpr->resType.type) {
2,845,063✔
590
      pExpr->resType.type = TSDB_DATA_TYPE_VARCHAR;
18✔
591
      pExpr->resType.bytes = VARSTR_HEADER_SIZE;
18✔
592
    }
593
  }
594
}
693,768✔
595

596
static void resetProjectNullType(SNode* pStmt) {
985,897✔
597
  switch (nodeType(pStmt)) {
985,897✔
598
    case QUERY_NODE_SELECT_STMT:
659,360✔
599
      resetProjectNullTypeImpl(((SSelectStmt*)pStmt)->pProjectionList);
659,360✔
600
      break;
659,362✔
601
    case QUERY_NODE_SET_OPERATOR: {
34,409✔
602
      resetProjectNullTypeImpl(((SSetOperator*)pStmt)->pProjectionList);
34,409✔
603
      break;
34,409✔
604
    }
605
    default:
292,128✔
606
      break;
292,128✔
607
  }
608
}
985,899✔
609

610
int32_t calculateConstant(SParseContext* pParseCxt, SQuery* pQuery) {
985,915✔
611
  SCalcConstContext cxt = {.pParseCxt = pParseCxt,
985,915✔
612
                           .msgBuf.buf = pParseCxt->pMsg,
985,915✔
613
                           .msgBuf.len = pParseCxt->msgLen,
985,915✔
614
                           .code = TSDB_CODE_SUCCESS};
615
  int32_t           code = calcConstQuery(&cxt, pQuery->pRoot, false);
985,915✔
616
  if (TSDB_CODE_SUCCESS == code) {
985,918✔
617
    resetProjectNullType(pQuery->pRoot);
985,899✔
618
    if (isEmptyResultQuery(pQuery->pRoot)) {
985,898✔
619
      pQuery->execMode = QUERY_EXEC_MODE_EMPTY_RESULT;
3,222✔
620
    }
621
  }
622
  return code;
985,917✔
623
}
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