#4838

Committed 08 Nov 2025 04:37AM UTC coverage: 71.256% (+12.3%) from 58.963%

Build # #4838

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

test: adjust source list (#33506)

Run Details

243241 of 341361 relevant lines covered (71.26%)

281946921.97 hits per line

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

63.8

/source/libs/nodes/src/nodesToSQLFuncs.c

/*
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

#include "cmdnodes.h"
#include "nodesUtil.h"
#include "plannodes.h"
#include "querynodes.h"
#include "taos.h"
#include "taoserror.h"
#include "thash.h"

const char *operatorTypeStr(EOperatorType type) {
  switch (type) {
    case OP_TYPE_ADD:
      return "+";
    case OP_TYPE_SUB:
      return "-";
    case OP_TYPE_MULTI:
      return "*";
    case OP_TYPE_DIV:
      return "/";
    case OP_TYPE_REM:
      return "%";
    case OP_TYPE_MINUS:
      return "-";
    case OP_TYPE_BIT_AND:
      return "&";
    case OP_TYPE_BIT_OR:
      return "|";
    case OP_TYPE_GREATER_THAN:
      return ">";
    case OP_TYPE_GREATER_EQUAL:
      return ">=";
    case OP_TYPE_LOWER_THAN:
      return "<";
    case OP_TYPE_LOWER_EQUAL:
      return "<=";
    case OP_TYPE_EQUAL:
      return "=";
    case OP_TYPE_NOT_EQUAL:
      return "<>";
    case OP_TYPE_IN:
      return "IN";
    case OP_TYPE_NOT_IN:
      return "NOT IN";
    case OP_TYPE_LIKE:
      return "LIKE";
    case OP_TYPE_NOT_LIKE:
      return "NOT LIKE";
    case OP_TYPE_MATCH:
      return "MATCH";
    case OP_TYPE_NMATCH:
      return "NMATCH";
    case OP_TYPE_IS_NULL:
      return "IS NULL";
    case OP_TYPE_IS_NOT_NULL:
      return "IS NOT NULL";
    case OP_TYPE_IS_TRUE:
      return "IS TRUE";
    case OP_TYPE_IS_FALSE:
      return "IS FALSE";
    case OP_TYPE_IS_UNKNOWN:
      return "IS UNKNOWN";
    case OP_TYPE_IS_NOT_TRUE:
      return "IS NOT TRUE";
    case OP_TYPE_IS_NOT_FALSE:
      return "IS NOT FALSE";
    case OP_TYPE_IS_NOT_UNKNOWN:
      return "IS NOT UNKNOWN";
    case OP_TYPE_JSON_GET_VALUE:
      return "=>";
    case OP_TYPE_JSON_CONTAINS:
      return "CONTAINS";
    case OP_TYPE_ASSIGN:
      return "=";
    default:
      break;
  }
  return "UNKNOWN";
}

const char *logicConditionTypeStr(ELogicConditionType type) {
  switch (type) {
    case LOGIC_COND_TYPE_AND:
      return "AND";
    case LOGIC_COND_TYPE_OR:
      return "OR";
    case LOGIC_COND_TYPE_NOT:
      return "NOT";
    default:
      break;
  }
  return "UNKNOWN";
}

int32_t nodesNodeToSQL(SNode *pNode, char *buf, int32_t bufSize, int32_t *len) {
  return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);
}

int32_t nodesNodeToSQLFormat(SNode *pNode, char *buf, int32_t bufSize, int32_t *len, bool longFormat) {
  switch (pNode->type) {
    case QUERY_NODE_COLUMN: {
      SColumnNode *colNode = (SColumnNode *)pNode;
      if (colNode->dbName[0]) {
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->dbName);
      }

      if (colNode->tableAlias[0]) {
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableAlias);
      } else if (colNode->tableName[0]) {
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`.", colNode->tableName);
      }

      if (colNode->tableAlias[0]) {
        *len += tsnprintf(buf + *len, bufSize - *len, "`%s`", colNode->node.userAlias);
      } else {
        *len += tsnprintf(buf + *len, bufSize - *len, "%s", colNode->node.userAlias);
      }

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_VALUE: {
      SValueNode *colNode = (SValueNode *)pNode;
      char       *t = nodesGetStrValueFromNode(colNode);
      if (NULL == t) {
        nodesError("fail to get str value from valueNode");
        NODES_ERR_RET(TSDB_CODE_APP_ERROR);
      }

      int32_t tlen = strlen(t);
      if (longFormat) {
        *len += tsnprintf(buf + *len, bufSize - *len, "%s", t);
      } else {
        if (tlen > 32) {
          *len += tsnprintf(buf + *len, bufSize - *len, "%.*s...%s", 32, t, t + tlen - 1);
        } else {
          *len += tsnprintf(buf + *len, bufSize - *len, "%s", t);
        }
      }

      taosMemoryFree(t);

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_OPERATOR: {
      SOperatorNode *pOpNode = (SOperatorNode *)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "(");
      if (pOpNode->pLeft) {
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));
      }

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

      if (pOpNode->pRight) {
        NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));
      }

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

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_LOGIC_CONDITION: {
      SLogicConditionNode *pLogicNode = (SLogicConditionNode *)pNode;
      SNode               *node = NULL;
      bool                 first = true;

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

      FOREACH(node, pLogicNode->pParameterList) {
        if (!first) {
          *len += tsnprintf(buf + *len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));
        }
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
        first = false;
      }

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

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_FUNCTION: {
      SFunctionNode *pFuncNode = (SFunctionNode *)pNode;
      SNode         *node = NULL;
      bool           first = true;

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

      FOREACH(node, pFuncNode->pParameterList) {
        if (!first) {
          *len += tsnprintf(buf + *len, bufSize - *len, ", ");
        }
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
        first = false;
      }

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

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_NODE_LIST: {
      SNodeListNode *pListNode = (SNodeListNode *)pNode;
      SNode         *node = NULL;
      bool           first = true;
      int32_t        num = 0;

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

      FOREACH(node, pListNode->pNodeList) {
        if (!first) {
          *len += tsnprintf(buf + *len, bufSize - *len, ", ");
          if (!longFormat) {
            if (++num >= 10) {
              *len += tsnprintf(buf + *len, bufSize - *len, "...");
              break;
            }
          }
        }
        NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));
        first = false;
      }

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

      return TSDB_CODE_SUCCESS;
    }
    default:
      break;
  }

  nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));
  NODES_RET(TSDB_CODE_APP_ERROR);
}

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) {	999,749,056✔
25	switch (type) {	999,749,056✔
26	case OP_TYPE_ADD:	207,724✔
27	return "+";	207,724✔
28	case OP_TYPE_SUB:	×
29	return "-";	×
30	case OP_TYPE_MULTI:	×
31	return "*";	×
32	case OP_TYPE_DIV:	×
33	return "/";	×
34	case OP_TYPE_REM:	×
35	return "%";	×
36	case OP_TYPE_MINUS:	×
37	return "-";	×
38	case OP_TYPE_BIT_AND:	×
39	return "&";	×
40	case OP_TYPE_BIT_OR:	×
41	return "\|";	×
42	case OP_TYPE_GREATER_THAN:	109,852,014✔
43	return ">";	109,852,014✔
44	case OP_TYPE_GREATER_EQUAL:	191,169,578✔
45	return ">=";	191,169,578✔
46	case OP_TYPE_LOWER_THAN:	91,766,539✔
47	return "<";	91,766,539✔
48	case OP_TYPE_LOWER_EQUAL:	181,881,032✔
49	return "<=";	181,881,032✔
50	case OP_TYPE_EQUAL:	233,546,457✔
51	return "=";	233,546,457✔
52	case OP_TYPE_NOT_EQUAL:	×
53	return "<>";	×
54	case OP_TYPE_IN:	1,998,422✔
55	return "IN";	1,998,422✔
56	case OP_TYPE_NOT_IN:	×
57	return "NOT IN";	×
58	case OP_TYPE_LIKE:	18,569,374✔
59	return "LIKE";	18,569,374✔
60	case OP_TYPE_NOT_LIKE:	×
61	return "NOT LIKE";	×
62	case OP_TYPE_MATCH:	75,857,062✔
63	return "MATCH";	75,857,062✔
64	case OP_TYPE_NMATCH:	4,578,948✔
65	return "NMATCH";	4,578,948✔
66	case OP_TYPE_IS_NULL:	22,045,424✔
67	return "IS NULL";	22,045,424✔
68	case OP_TYPE_IS_NOT_NULL:	68,286,212✔
69	return "IS NOT NULL";	68,286,212✔
70	case OP_TYPE_IS_TRUE:	×
71	return "IS TRUE";	×
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) {	215,823✔
95	switch (type) {	215,823✔
96	case LOGIC_COND_TYPE_AND:	141,002✔
97	return "AND";	141,002✔
98	case LOGIC_COND_TYPE_OR:	74,821✔
99	return "OR";	74,821✔
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) {	3,067,062✔
109	return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);	3,067,062✔
110	}
111
112	int32_t nodesNodeToSQLFormat(SNode pNode, char buf, int32_t bufSize, int32_t *len, bool longFormat) {	13,567,140✔
113	switch (pNode->type) {	13,567,140✔
114	case QUERY_NODE_COLUMN: {	6,330,871✔
115	SColumnNode colNode = (SColumnNode )pNode;	6,330,871✔
116	if (colNode->dbName[0]) {	6,330,871✔
117	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->dbName);	5,989,774✔
118	}
119
120	if (colNode->tableAlias[0]) {	6,330,871✔
121	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableAlias);	6,200,110✔
122	} else if (colNode->tableName[0]) {	130,761✔
123	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableName);	×
124	}
125
126	if (colNode->tableAlias[0]) {	6,330,871✔
127	len += tsnprintf(buf + len, bufSize - *len, "`%s`", colNode->node.userAlias);	6,200,110✔
128	} else {
129	len += tsnprintf(buf + len, bufSize - *len, "%s", colNode->node.userAlias);	130,761✔
130	}
131
132	return TSDB_CODE_SUCCESS;	6,330,871✔
133	}
134	case QUERY_NODE_VALUE: {	2,554,776✔
135	SValueNode colNode = (SValueNode )pNode;	2,554,776✔
136	char *t = nodesGetStrValueFromNode(colNode);	2,554,776✔
137	if (NULL == t) {	2,554,776✔
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);	2,554,776✔
143	if (longFormat) {	2,554,776✔
144	len += tsnprintf(buf + len, bufSize - *len, "%s", t);	2,554,776✔
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);	2,554,776✔
154
155	return TSDB_CODE_SUCCESS;	2,554,776✔
156	}
157	case QUERY_NODE_OPERATOR: {	4,234,588✔
158	SOperatorNode pOpNode = (SOperatorNode )pNode;	4,234,588✔
159	len += tsnprintf(buf + len, bufSize - *len, "(");	4,234,588✔
160	if (pOpNode->pLeft) {	4,234,588✔
161	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));	4,234,588✔
162	}
163
164	len += tsnprintf(buf + len, bufSize - *len, " %s ", operatorTypeStr(pOpNode->opType));	4,234,588✔
165
166	if (pOpNode->pRight) {	4,234,588✔
167	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));	4,201,052✔
168	}
169
170	len += tsnprintf(buf + len, bufSize - *len, ")");	4,234,588✔
171
172	return TSDB_CODE_SUCCESS;	4,234,588✔
173	}
174	case QUERY_NODE_LOGIC_CONDITION: {	215,823✔
175	SLogicConditionNode pLogicNode = (SLogicConditionNode )pNode;	215,823✔
176	SNode *node = NULL;	215,823✔
177	bool first = true;	215,823✔
178
179	len += tsnprintf(buf + len, bufSize - *len, "(");	215,823✔
180
181	FOREACH(node, pLogicNode->pParameterList) {	647,469✔
182	if (!first) {	431,646✔
183	len += tsnprintf(buf + len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));	215,823✔
184	}
185	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	431,646✔
186	first = false;	431,646✔
187	}
188
189	len += tsnprintf(buf + len, bufSize - *len, ")");	215,823✔
190
191	return TSDB_CODE_SUCCESS;	215,823✔
192	}
193	case QUERY_NODE_FUNCTION: {	169,956✔
194	SFunctionNode pFuncNode = (SFunctionNode )pNode;	169,956✔
195	SNode *node = NULL;	169,956✔
196	bool first = true;	169,956✔
197
198	len += tsnprintf(buf + len, bufSize - *len, "%s(", pFuncNode->functionName);	169,956✔
199
200	FOREACH(node, pFuncNode->pParameterList) {	849,780✔
201	if (!first) {	679,824✔
202	len += tsnprintf(buf + len, bufSize - *len, ", ");	509,868✔
203	}
204	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	679,824✔
205	first = false;	679,824✔
206	}
207
208	len += tsnprintf(buf + len, bufSize - *len, ")");	169,956✔
209
210	return TSDB_CODE_SUCCESS;	169,956✔
211	}
212	case QUERY_NODE_NODE_LIST: {	61,126✔
213	SNodeListNode pListNode = (SNodeListNode )pNode;	61,126✔
214	SNode *node = NULL;	61,126✔
215	bool first = true;	61,126✔
216	int32_t num = 0;	61,126✔
217
218	len += tsnprintf(buf + len, bufSize - *len, "(");	61,126✔
219
220	FOREACH(node, pListNode->pNodeList) {	266,576✔
221	if (!first) {	205,450✔
222	len += tsnprintf(buf + len, bufSize - *len, ", ");	144,324✔
223	if (!longFormat) {	144,324✔
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));	205,450✔
231	first = false;	205,450✔
232	}
233
234	len += tsnprintf(buf + len, bufSize - *len, ")");	61,126✔
235
236	return TSDB_CODE_SUCCESS;	61,126✔
237	}
238	default:	×
239	break;	×
240	}
241
242	nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));	×
243	NODES_RET(TSDB_CODE_APP_ERROR);	×
244	}

taosdata / TDengine / #4838

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

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