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

taosdata / TDengine / #5003

26 Mar 2026 12:51PM UTC coverage: 72.317% (-0.4%) from 72.671%
#5003

push

travis-ci

web-flow
merge: from main to 3.0 branch #34951

513 of 851 new or added lines in 47 files covered. (60.28%)

561 existing lines in 135 files now uncovered.

253860 of 351039 relevant lines covered (72.32%)

132153090.56 hits per line

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

78.87
/source/libs/nodes/src/nodesToSQLFuncs.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 "cmdnodes.h"
17
#include "nodesUtil.h"
18
#include "plannodes.h"
19
#include "querynodes.h"
20
#include "taos.h"
21
#include "taoserror.h"
22
#include "thash.h"
23

24
const char *operatorTypeStr(EOperatorType type) {
146,431,762✔
25
  switch (type) {
146,431,762✔
26
    case OP_TYPE_ADD:
229,869✔
27
      return "+";
229,869✔
28
    case OP_TYPE_SUB:
3,200✔
29
      return "-";
3,200✔
30
    case OP_TYPE_MULTI:
3,200✔
31
      return "*";
3,200✔
32
    case OP_TYPE_DIV:
2,800✔
33
      return "/";
2,800✔
34
    case OP_TYPE_REM:
2,800✔
35
      return "%";
2,800✔
36
    case OP_TYPE_MINUS:
3,600✔
37
      return "-";
3,600✔
38
    case OP_TYPE_BIT_AND:
3,200✔
39
      return "&";
3,200✔
40
    case OP_TYPE_BIT_OR:
3,200✔
41
      return "|";
3,200✔
42
    case OP_TYPE_GREATER_THAN:
17,436,738✔
43
      return ">";
17,436,738✔
44
    case OP_TYPE_GREATER_EQUAL:
27,883,434✔
45
      return ">=";
27,883,434✔
46
    case OP_TYPE_LOWER_THAN:
13,179,256✔
47
      return "<";
13,179,256✔
48
    case OP_TYPE_LOWER_EQUAL:
26,082,209✔
49
      return "<=";
26,082,209✔
50
    case OP_TYPE_EQUAL:
30,979,217✔
51
      return "=";
30,979,217✔
52
    case OP_TYPE_NOT_EQUAL:
1,322,372✔
53
      return "<>";
1,322,372✔
54
    case OP_TYPE_IN:
1,281,669✔
55
      return "IN";
1,281,669✔
56
    case OP_TYPE_NOT_IN:
953,045✔
57
      return "NOT IN";
953,045✔
58
    case OP_TYPE_LIKE:
2,352,116✔
59
      return "LIKE";
2,352,116✔
60
    case OP_TYPE_NOT_LIKE:
1,600✔
61
      return "NOT LIKE";
1,600✔
62
    case OP_TYPE_MATCH:
11,052,782✔
63
      return "MATCH";
11,052,782✔
64
    case OP_TYPE_NMATCH:
591,260✔
65
      return "NMATCH";
591,260✔
66
    case OP_TYPE_IS_NULL:
3,967,673✔
67
      return "IS NULL";
3,967,673✔
68
    case OP_TYPE_IS_NOT_NULL:
8,785,766✔
69
      return "IS NOT NULL";
8,785,766✔
70
    case OP_TYPE_IS_TRUE:
310,782✔
71
      return "IS TRUE";
310,782✔
72
    case OP_TYPE_IS_FALSE:
×
73
      return "IS FALSE";
×
74
    case OP_TYPE_IS_UNKNOWN:
×
75
      return "IS UNKNOWN";
×
76
    case OP_TYPE_IS_NOT_TRUE:
×
77
      return "IS NOT TRUE";
×
78
    case OP_TYPE_IS_NOT_FALSE:
×
79
      return "IS NOT FALSE";
×
80
    case OP_TYPE_IS_NOT_UNKNOWN:
×
81
      return "IS NOT UNKNOWN";
×
82
    case OP_TYPE_EXISTS:
×
83
      return "EXISTS";
×
84
    case OP_TYPE_NOT_EXISTS:
×
85
      return "NOT EXISTS";
×
86
    case OP_TYPE_JSON_GET_VALUE:
×
87
      return "=>";
×
88
    case OP_TYPE_JSON_CONTAINS:
×
89
      return "CONTAINS";
×
90
    case OP_TYPE_ASSIGN:
×
91
      return "=";
×
92
    default:
178✔
93
      break;
178✔
94
  }
95
  return "UNKNOWN";
178✔
96
}
97

98
const char *operatorTypeStrEx(EOperatorType type, bool isNegative) {
13,226,546✔
99
  if (isNegative) {
13,226,546✔
100
    switch (type) {
99,235✔
101
      case OP_TYPE_IN:
×
102
        return "!= ANY";
×
103
      case OP_TYPE_NOT_IN:
99,235✔
104
        return "= ALL";
99,235✔
105
      default:
×
106
        break;
×
107
    }
108
    return "UNKNOWN";
×
109
  }
110

111
  return operatorTypeStr(type);
13,127,311✔
112
}
113

114
const char *logicConditionTypeStr(ELogicConditionType type) {
755,251✔
115
  switch (type) {
755,251✔
116
    case LOGIC_COND_TYPE_AND:
493,470✔
117
      return "AND";
493,470✔
118
    case LOGIC_COND_TYPE_OR:
261,781✔
119
      return "OR";
261,781✔
120
    case LOGIC_COND_TYPE_NOT:
×
121
      return "NOT";
×
122
    default:
×
123
      break;
×
124
  }
125
  return "UNKNOWN";
×
126
}
127

128
int32_t nodesNodeToSQL(SNode *pNode, char *buf, int32_t bufSize, int32_t *len) {
12,182,640✔
129
  return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);
12,182,640✔
130
}
131

132
int32_t nodesNodeToSQLFormat(SNode *pNode, char *buf, int32_t bufSize, int32_t *len, bool longFormat) {
38,704,730✔
133
  switch (pNode->type) {
38,704,730✔
134
    case QUERY_NODE_COLUMN: {
11,280,549✔
135
      SColumnNode *colNode = (SColumnNode *)pNode;
11,280,549✔
136
      if (colNode->dbName[0]) {
11,280,549✔
137
        *len += snprintf(buf + *len, bufSize - *len, "`%s`.", colNode->dbName);
10,666,391✔
138
      }
139

140
      if (colNode->tableAlias[0]) {
11,280,549✔
141
        *len += snprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableAlias);
10,686,084✔
142
      } else if (colNode->tableName[0]) {
594,465✔
143
        *len += snprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableName);
×
144
      }
145

146
      if (colNode->node.userAlias[0]) {
11,280,549✔
147
        *len += snprintf(buf + *len, bufSize - *len, "`%s`", colNode->node.userAlias);
11,270,015✔
148
      } else {
149
        *len += snprintf(buf + *len, bufSize - *len, "`%s`", colNode->colName);
11,170✔
150
      }
151

152
      return TSDB_CODE_SUCCESS;
11,280,549✔
153
    }
154
    case QUERY_NODE_VALUE: {
5,251,615✔
155
      SValueNode *colNode = (SValueNode *)pNode;
5,251,615✔
156
      char       *t = nodesGetStrValueFromNode(colNode);
5,251,615✔
157
      if (NULL == t) {
5,251,537✔
158
        nodesError("fail to get str value from valueNode");
×
159
        NODES_ERR_RET(TSDB_CODE_APP_ERROR);
×
160
      }
161

162
      int32_t tlen = strlen(t);
5,251,351✔
163
      if (longFormat) {
5,251,351✔
164
        *len += snprintf(buf + *len, bufSize - *len, "%s", t);
5,246,239✔
165
      } else {
166
        if (tlen > 32) {
5,112✔
167
          *len += snprintf(buf + *len, bufSize - *len, "%.*s...%s", 32, t, t + tlen - 1);
×
168
        } else {
169
          *len += snprintf(buf + *len, bufSize - *len, "%s", t);
5,112✔
170
        }
171
      }
172

173
      taosMemoryFree(t);
5,251,351✔
174

175
      return TSDB_CODE_SUCCESS;
5,251,266✔
176
    }
177
    case QUERY_NODE_OPERATOR: {
13,226,453✔
178
      SOperatorNode *pOpNode = (SOperatorNode *)pNode;
13,226,453✔
179
      *len += snprintf(buf + *len, bufSize - *len, "(");
13,226,453✔
180
      if (pOpNode->pLeft) {
13,226,453✔
181
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));
13,226,623✔
182
      }
183

184
      *len += tsnprintf(buf + *len, bufSize - *len, " %s ", operatorTypeStrEx(pOpNode->opType, pOpNode->flag & OPERATOR_FLAG_NEGATIVE_OP));
13,226,562✔
185

186
      if (pOpNode->pRight) {
13,227,554✔
187
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));
11,458,358✔
188
      }
189

190
      *len += snprintf(buf + *len, bufSize - *len, ")");
13,226,739✔
191

192
      return TSDB_CODE_SUCCESS;
13,226,739✔
193
    }
194
    case QUERY_NODE_LOGIC_CONDITION: {
746,809✔
195
      SLogicConditionNode *pLogicNode = (SLogicConditionNode *)pNode;
746,809✔
196
      SNode               *node = NULL;
746,809✔
197
      bool                 first = true;
746,809✔
198

199
      *len += snprintf(buf + *len, bufSize - *len, "(");
746,809✔
200

201
      FOREACH(node, pLogicNode->pParameterList) {
2,248,962✔
202
        if (!first) {
1,502,153✔
203
          *len += snprintf(buf + *len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));
755,344✔
204
        }
205
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
1,501,967✔
206
        first = false;
1,502,153✔
207
      }
208

209
      *len += snprintf(buf + *len, bufSize - *len, ")");
746,809✔
210

211
      return TSDB_CODE_SUCCESS;
746,809✔
212
    }
213
    case QUERY_NODE_FUNCTION: {
200,421✔
214
      SFunctionNode *pFuncNode = (SFunctionNode *)pNode;
200,421✔
215
      SNode         *node = NULL;
200,421✔
216
      bool           first = true;
200,421✔
217

218
      *len += snprintf(buf + *len, bufSize - *len, "%s(", pFuncNode->functionName);
200,421✔
219

220
      FOREACH(node, pFuncNode->pParameterList) {
443,826✔
221
        if (!first) {
243,405✔
222
          *len += snprintf(buf + *len, bufSize - *len, ", ");
42,984✔
223
        }
224
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
243,405✔
225
        first = false;
243,405✔
226
      }
227

228
      *len += snprintf(buf + *len, bufSize - *len, ")");
200,421✔
229

230
      return TSDB_CODE_SUCCESS;
200,421✔
231
    }
232
    case QUERY_NODE_NODE_LIST: {
8,474✔
233
      SNodeListNode *pListNode = (SNodeListNode *)pNode;
8,474✔
234
      SNode         *node = NULL;
8,474✔
235
      bool           first = true;
8,474✔
236
      int32_t        num = 0;
8,474✔
237

238
      *len += snprintf(buf + *len, bufSize - *len, "(");
8,474✔
239

240
      FOREACH(node, pListNode->pNodeList) {
33,860✔
241
        if (!first) {
25,386✔
242
          *len += snprintf(buf + *len, bufSize - *len, ", ");
16,912✔
243
          if (!longFormat) {
16,912✔
244
            if (++num >= 10) {
×
245
              *len += snprintf(buf + *len, bufSize - *len, "...");
×
246
              break;
×
247
            }
248
          }
249
        }
250
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
25,386✔
251
        first = false;
25,386✔
252
      }
253

254
      *len += snprintf(buf + *len, bufSize - *len, ")");
8,474✔
255

256
      return TSDB_CODE_SUCCESS;
8,474✔
257
    }
258
    case QUERY_NODE_REMOTE_VALUE: {
6,248,098✔
259
      SRemoteValueNode* pRemote = (SRemoteValueNode*)pNode;
6,248,098✔
260
      *len += snprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
6,248,098✔
261
      return TSDB_CODE_SUCCESS;
6,248,098✔
262
    }
263
    case QUERY_NODE_REMOTE_VALUE_LIST: {
1,407,209✔
264
      SRemoteValueListNode* pRemote = (SRemoteValueListNode*)pNode;
1,407,209✔
265
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
1,407,209✔
266
      return TSDB_CODE_SUCCESS;
1,407,116✔
267
    }
268
    case QUERY_NODE_REMOTE_ROW: {
202,830✔
269
      SRemoteRowNode* pRemote = (SRemoteRowNode*)pNode;
202,830✔
270
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
202,830✔
271
      return TSDB_CODE_SUCCESS;
202,830✔
272
    }
273
    case QUERY_NODE_REMOTE_ZERO_ROWS: {
133,095✔
274
      SRemoteZeroRowsNode* pRemote = (SRemoteZeroRowsNode*)pNode;
133,095✔
275
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
133,095✔
276
      return TSDB_CODE_SUCCESS;
133,095✔
277
    }
UNCOV
278
    default:
×
UNCOV
279
      break;
×
280
  }
281

UNCOV
282
  nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));
×
283
  NODES_RET(TSDB_CODE_APP_ERROR);
×
284
}
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