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

taosdata / TDengine / #4687

25 Aug 2025 07:22AM UTC coverage: 57.894% (-2.2%) from 60.092%
#4687

push

travis-ci

web-flow
fix: add taosBenchmark windows support params (#32708)

132643 of 292257 branches covered (45.39%)

Branch coverage included in aggregate %.

201266 of 284501 relevant lines covered (70.74%)

4743408.21 hits per line

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

53.6
/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) {
443,084✔
25
  switch (type) {
443,084!
26
    case OP_TYPE_ADD:
16✔
27
      return "+";
16✔
28
    case OP_TYPE_SUB:
16✔
29
      return "-";
16✔
30
    case OP_TYPE_MULTI:
16✔
31
      return "*";
16✔
32
    case OP_TYPE_DIV:
14✔
33
      return "/";
14✔
34
    case OP_TYPE_REM:
14✔
35
      return "%";
14✔
36
    case OP_TYPE_MINUS:
18✔
37
      return "-";
18✔
38
    case OP_TYPE_BIT_AND:
16✔
39
      return "&";
16✔
40
    case OP_TYPE_BIT_OR:
16✔
41
      return "|";
16✔
42
    case OP_TYPE_GREATER_THAN:
61,172✔
43
      return ">";
61,172✔
44
    case OP_TYPE_GREATER_EQUAL:
57,556✔
45
      return ">=";
57,556✔
46
    case OP_TYPE_LOWER_THAN:
19,687✔
47
      return "<";
19,687✔
48
    case OP_TYPE_LOWER_EQUAL:
77,542✔
49
      return "<=";
77,542✔
50
    case OP_TYPE_EQUAL:
98,303✔
51
      return "=";
98,303✔
52
    case OP_TYPE_NOT_EQUAL:
20✔
53
      return "<>";
20✔
54
    case OP_TYPE_IN:
1,114✔
55
      return "IN";
1,114✔
56
    case OP_TYPE_NOT_IN:
×
57
      return "NOT IN";
×
58
    case OP_TYPE_LIKE:
11,940✔
59
      return "LIKE";
11,940✔
60
    case OP_TYPE_NOT_LIKE:
10✔
61
      return "NOT LIKE";
10✔
62
    case OP_TYPE_MATCH:
58,178✔
63
      return "MATCH";
58,178✔
64
    case OP_TYPE_NMATCH:
3,436✔
65
      return "NMATCH";
3,436✔
66
    case OP_TYPE_IS_NULL:
2,586✔
67
      return "IS NULL";
2,586✔
68
    case OP_TYPE_IS_NOT_NULL:
51,404✔
69
      return "IS NOT NULL";
51,404✔
70
    case OP_TYPE_IS_TRUE:
10✔
71
      return "IS TRUE";
10✔
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_JSON_GET_VALUE:
×
83
      return "=>";
×
84
    case OP_TYPE_JSON_CONTAINS:
×
85
      return "CONTAINS";
×
86
    case OP_TYPE_ASSIGN:
×
87
      return "=";
×
88
    default:
×
89
      break;
×
90
  }
91
  return "UNKNOWN";
×
92
}
93

94
const char *logicConditionTypeStr(ELogicConditionType type) {
7✔
95
  switch (type) {
7!
96
    case LOGIC_COND_TYPE_AND:
6✔
97
      return "AND";
6✔
98
    case LOGIC_COND_TYPE_OR:
1✔
99
      return "OR";
1✔
100
    case LOGIC_COND_TYPE_NOT:
×
101
      return "NOT";
×
102
    default:
×
103
      break;
×
104
  }
105
  return "UNKNOWN";
×
106
}
107

108
int32_t nodesNodeToSQL(SNode *pNode, char *buf, int32_t bufSize, int32_t *len) {
20✔
109
  return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);
20✔
110
}
111

112
int32_t nodesNodeToSQLFormat(SNode *pNode, char *buf, int32_t bufSize, int32_t *len, bool longFormat) {
128✔
113
  switch (pNode->type) {
128!
114
    case QUERY_NODE_COLUMN: {
44✔
115
      SColumnNode *colNode = (SColumnNode *)pNode;
44✔
116
      if (colNode->dbName[0]) {
44✔
117
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->dbName);
30✔
118
      }
119

120
      if (colNode->tableAlias[0]) {
44✔
121
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableAlias);
32✔
122
      } else if (colNode->tableName[0]) {
12!
123
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableName);
×
124
      }
125

126
      if (colNode->tableAlias[0]) {
44✔
127
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`", colNode->node.userAlias);
32✔
128
      } else {
129
        *len += tsnprintf(buf + *len, bufSize - *len, "%s", colNode->node.userAlias);
12✔
130
      }
131

132
      return TSDB_CODE_SUCCESS;
44✔
133
    }
134
    case QUERY_NODE_VALUE: {
37✔
135
      SValueNode *colNode = (SValueNode *)pNode;
37✔
136
      char       *t = nodesGetStrValueFromNode(colNode);
37✔
137
      if (NULL == t) {
37!
138
        nodesError("fail to get str value from valueNode");
×
139
        NODES_ERR_RET(TSDB_CODE_APP_ERROR);
×
140
      }
141

142
      int32_t tlen = strlen(t);
37✔
143
      if (longFormat) {
37!
144
        *len += tsnprintf(buf + *len, bufSize - *len, "%s", t);
37✔
145
      } else {
146
        if (tlen > 32) {
×
147
          *len += tsnprintf(buf + *len, bufSize - *len, "%.*s...%s", 32, t, t + tlen - 1);
×
148
        } else {
149
          *len += tsnprintf(buf + *len, bufSize - *len, "%s", t);
×
150
        }
151
      }
152

153
      taosMemoryFree(t);
37!
154

155
      return TSDB_CODE_SUCCESS;
37✔
156
    }
157
    case QUERY_NODE_OPERATOR: {
40✔
158
      SOperatorNode *pOpNode = (SOperatorNode *)pNode;
40✔
159
      *len += tsnprintf(buf + *len, bufSize - *len, "(");
40✔
160
      if (pOpNode->pLeft) {
40!
161
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));
40!
162
      }
163

164
      *len += tsnprintf(buf + *len, bufSize - *len, " %s ", operatorTypeStr(pOpNode->opType));
40✔
165

166
      if (pOpNode->pRight) {
40!
167
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));
40!
168
      }
169

170
      *len += tsnprintf(buf + *len, bufSize - *len, ")");
40✔
171

172
      return TSDB_CODE_SUCCESS;
40✔
173
    }
174
    case QUERY_NODE_LOGIC_CONDITION: {
7✔
175
      SLogicConditionNode *pLogicNode = (SLogicConditionNode *)pNode;
7✔
176
      SNode               *node = NULL;
7✔
177
      bool                 first = true;
7✔
178

179
      *len += tsnprintf(buf + *len, bufSize - *len, "(");
7✔
180

181
      FOREACH(node, pLogicNode->pParameterList) {
21!
182
        if (!first) {
14✔
183
          *len += tsnprintf(buf + *len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));
7✔
184
        }
185
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
14!
186
        first = false;
14✔
187
      }
188

189
      *len += tsnprintf(buf + *len, bufSize - *len, ")");
7✔
190

191
      return TSDB_CODE_SUCCESS;
7✔
192
    }
193
    case QUERY_NODE_FUNCTION: {
×
194
      SFunctionNode *pFuncNode = (SFunctionNode *)pNode;
×
195
      SNode         *node = NULL;
×
196
      bool           first = true;
×
197

198
      *len += tsnprintf(buf + *len, bufSize - *len, "%s(", pFuncNode->functionName);
×
199

200
      FOREACH(node, pFuncNode->pParameterList) {
×
201
        if (!first) {
×
202
          *len += tsnprintf(buf + *len, bufSize - *len, ", ");
×
203
        }
204
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
×
205
        first = false;
×
206
      }
207

208
      *len += tsnprintf(buf + *len, bufSize - *len, ")");
×
209

210
      return TSDB_CODE_SUCCESS;
×
211
    }
212
    case QUERY_NODE_NODE_LIST: {
×
213
      SNodeListNode *pListNode = (SNodeListNode *)pNode;
×
214
      SNode         *node = NULL;
×
215
      bool           first = true;
×
216
      int32_t        num = 0;
×
217

218
      *len += tsnprintf(buf + *len, bufSize - *len, "(");
×
219

220
      FOREACH(node, pListNode->pNodeList) {
×
221
        if (!first) {
×
222
          *len += tsnprintf(buf + *len, bufSize - *len, ", ");
×
223
          if (!longFormat) {
×
224
            if (++num >= 10) {
×
225
              *len += tsnprintf(buf + *len, bufSize - *len, "...");
×
226
              break;
×
227
            }
228
          }
229
        }
230
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
×
231
        first = false;
×
232
      }
233

234
      *len += tsnprintf(buf + *len, bufSize - *len, ")");
×
235

236
      return TSDB_CODE_SUCCESS;
×
237
    }
238
    default:
×
239
      break;
×
240
  }
241

242
  nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));
×
243
  NODES_RET(TSDB_CODE_APP_ERROR);
×
244
}
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