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

taosdata / TDengine / #4404

30 Jun 2025 02:45AM UTC coverage: 62.241% (-0.4%) from 62.635%
#4404

push

travis-ci

web-flow
Merge pull request #31480 from taosdata/docs/3.0/TD-34215

add stmt2 docs

153837 of 315978 branches covered (48.69%)

Branch coverage included in aggregate %.

238272 of 314005 relevant lines covered (75.88%)

6134648.6 hits per line

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

71.58
/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) {
239,365✔
25
  switch (type) {
239,365!
26
    case OP_TYPE_ADD:
60✔
27
      return "+";
60✔
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:
11,202✔
43
      return ">";
11,202✔
44
    case OP_TYPE_GREATER_EQUAL:
68,665✔
45
      return ">=";
68,665✔
46
    case OP_TYPE_LOWER_THAN:
39,810✔
47
      return "<";
39,810✔
48
    case OP_TYPE_LOWER_EQUAL:
48,991✔
49
      return "<=";
48,991✔
50
    case OP_TYPE_EQUAL:
37,484✔
51
      return "=";
37,484✔
52
    case OP_TYPE_NOT_EQUAL:
35✔
53
      return "<>";
35✔
54
    case OP_TYPE_IN:
73✔
55
      return "IN";
73✔
56
    case OP_TYPE_NOT_IN:
×
57
      return "NOT IN";
×
58
    case OP_TYPE_LIKE:
1,926✔
59
      return "LIKE";
1,926✔
60
    case OP_TYPE_NOT_LIKE:
10✔
61
      return "NOT LIKE";
10✔
62
    case OP_TYPE_MATCH:
1,138✔
63
      return "MATCH";
1,138✔
64
    case OP_TYPE_NMATCH:
230✔
65
      return "NMATCH";
230✔
66
    case OP_TYPE_IS_NULL:
16,284✔
67
      return "IS NULL";
16,284✔
68
    case OP_TYPE_IS_NOT_NULL:
13,338✔
69
      return "IS NOT NULL";
13,338✔
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) {
370✔
95
  switch (type) {
370!
96
    case LOGIC_COND_TYPE_AND:
189✔
97
      return "AND";
189✔
98
    case LOGIC_COND_TYPE_OR:
181✔
99
      return "OR";
181✔
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) {
7,519✔
109
  return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);
7,519✔
110
}
111

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

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

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

132
      return TSDB_CODE_SUCCESS;
2,802✔
133
    }
134
    case QUERY_NODE_VALUE: {
1,970✔
135
      SValueNode *colNode = (SValueNode *)pNode;
1,970✔
136
      char       *t = nodesGetStrValueFromNode(colNode);
1,970✔
137
      if (NULL == t) {
1,970!
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);
1,970✔
143
      if (longFormat) {
1,970!
144
        *len += tsnprintf(buf + *len, bufSize - *len, "%s", t);
×
145
      } else {
146
        if (tlen > 32) {
1,970!
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);
1,970✔
150
        }
151
      }
152

153
      taosMemoryFree(t);
1,970!
154

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

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

166
      if (pOpNode->pRight) {
2,331✔
167
        NODES_ERR_RET(nodesNodeToSQL(pOpNode->pRight, buf, bufSize, len));
2,299!
168
      }
169

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

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

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

181
      FOREACH(node, pLogicNode->pParameterList) {
1,056!
182
        if (!first) {
713✔
183
          *len += tsnprintf(buf + *len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));
370✔
184
        }
185
        NODES_ERR_RET(nodesNodeToSQL(node, buf, bufSize, len));
713!
186
        first = false;
713✔
187
      }
188

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

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

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

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

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

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

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

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

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

236
      return TSDB_CODE_SUCCESS;
37✔
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