Build has been canceled!

#4788

Committed 14 Oct 2025 11:21AM UTC coverage: 60.992% (-2.3%) from 63.264%

Build # #4788

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Merge 7ca9b50f9 into 19574fe21

Run Details

154868 of 324306 branches covered (47.75%)

Branch coverage included in aggregate %.

207304 of 269498 relevant lines covered (76.92%)

125773493.22 hits per line

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

69.58

/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) {	84,547,583✔
25	switch (type) {	84,547,583!
26	case OP_TYPE_ADD:	25,856✔
27	return "+";	25,856✔
28	case OP_TYPE_SUB:	160✔
29	return "-";	160✔
30	case OP_TYPE_MULTI:	160✔
31	return "*";	160✔
32	case OP_TYPE_DIV:	140✔
33	return "/";	140✔
34	case OP_TYPE_REM:	140✔
35	return "%";	140✔
36	case OP_TYPE_MINUS:	180✔
37	return "-";	180✔
38	case OP_TYPE_BIT_AND:	160✔
39	return "&";	160✔
40	case OP_TYPE_BIT_OR:	160✔
41	return "\|";	160✔
42	case OP_TYPE_GREATER_THAN:	10,182,437✔
43	return ">";	10,182,437✔
44	case OP_TYPE_GREATER_EQUAL:	15,506,703✔
45	return ">=";	15,506,703✔
46	case OP_TYPE_LOWER_THAN:	8,132,436✔
47	return "<";	8,132,436✔
48	case OP_TYPE_LOWER_EQUAL:	15,094,040✔
49	return "<=";	15,094,040✔
50	case OP_TYPE_EQUAL:	23,539,993✔
51	return "=";	23,539,993✔
52	case OP_TYPE_NOT_EQUAL:	200✔
53	return "<>";	200✔
54	case OP_TYPE_IN:	220,338✔
55	return "IN";	220,338✔
56	case OP_TYPE_NOT_IN:	×
57	return "NOT IN";	×
58	case OP_TYPE_LIKE:	1,445,460✔
59	return "LIKE";	1,445,460✔
60	case OP_TYPE_NOT_LIKE:	100✔
61	return "NOT LIKE";	100✔
62	case OP_TYPE_MATCH:	4,310,854✔
63	return "MATCH";	4,310,854✔
64	case OP_TYPE_NMATCH:	299,306✔
65	return "NMATCH";	299,306✔
66	case OP_TYPE_IS_NULL:	1,532,016✔
67	return "IS NULL";	1,532,016✔
68	case OP_TYPE_IS_NOT_NULL:	4,257,383✔
69	return "IS NOT NULL";	4,257,383✔
70	case OP_TYPE_IS_TRUE:	100✔
71	return "IS TRUE";	100✔
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) {	20,085✔
95	switch (type) {	20,085!
96	case LOGIC_COND_TYPE_AND:	13,166✔
97	return "AND";	13,166✔
98	case LOGIC_COND_TYPE_OR:	6,919✔
99	return "OR";	6,919✔
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) {	350,860✔
109	return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);	350,860✔
110	}
111
112	int32_t nodesNodeToSQLFormat(SNode pNode, char buf, int32_t bufSize, int32_t *len, bool longFormat) {	1,296,824✔
113	switch (pNode->type) {	1,296,824!
114	case QUERY_NODE_COLUMN: {	657,123✔
115	SColumnNode colNode = (SColumnNode )pNode;	657,123✔
116	if (colNode->dbName[0]) {	657,123✔
117	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->dbName);	617,409✔
118	}
119
120	if (colNode->tableAlias[0]) {	657,123✔
121	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableAlias);	643,371✔
122	} else if (colNode->tableName[0]) {	13,752!
123	len += tsnprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableName);	×
124	}
125
126	if (colNode->tableAlias[0]) {	657,123✔
127	len += tsnprintf(buf + len, bufSize - *len, "`%s`", colNode->node.userAlias);	643,371✔
128	} else {
129	len += tsnprintf(buf + len, bufSize - *len, "%s", colNode->node.userAlias);	13,752✔
130	}
131
132	return TSDB_CODE_SUCCESS;	657,123✔
133	}
134	case QUERY_NODE_VALUE: {	192,877✔
135	SValueNode colNode = (SValueNode )pNode;	192,877✔
136	char *t = nodesGetStrValueFromNode(colNode);	192,877✔
137	if (NULL == t) {	192,877!
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);	192,877!
143	if (longFormat) {	192,877!
144	len += tsnprintf(buf + len, bufSize - *len, "%s", t);	192,877✔
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);	192,877!
154
155	return TSDB_CODE_SUCCESS;	192,877✔
156	}
157	case QUERY_NODE_OPERATOR: {	400,059✔
158	SOperatorNode pOpNode = (SOperatorNode )pNode;	400,059✔
159	len += tsnprintf(buf + len, bufSize - *len, "(");	400,059✔
160	if (pOpNode->pLeft) {	400,059!
161	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));	400,059!
162	}
163
164	len += tsnprintf(buf + len, bufSize - *len, " %s ", operatorTypeStr(pOpNode->opType));	400,059✔
165
166	if (pOpNode->pRight) {	400,059✔
167	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));	397,963!
168	}
169
170	len += tsnprintf(buf + len, bufSize - *len, ")");	400,059✔
171
172	return TSDB_CODE_SUCCESS;	400,059✔
173	}
174	case QUERY_NODE_LOGIC_CONDITION: {	20,085✔
175	SLogicConditionNode pLogicNode = (SLogicConditionNode )pNode;	20,085✔
176	SNode *node = NULL;	20,085✔
177	bool first = true;	20,085✔
178
179	len += tsnprintf(buf + len, bufSize - *len, "(");	20,085✔
180
181	FOREACH(node, pLogicNode->pParameterList) {	60,255!
182	if (!first) {	40,170✔
183	len += tsnprintf(buf + len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));	20,085✔
184	}
185	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	40,170!
186	first = false;	40,170✔
187	}
188
189	len += tsnprintf(buf + len, bufSize - *len, ")");	20,085✔
190
191	return TSDB_CODE_SUCCESS;	20,085✔
192	}
193	case QUERY_NODE_FUNCTION: {	21,024✔
194	SFunctionNode pFuncNode = (SFunctionNode )pNode;	21,024✔
195	SNode *node = NULL;	21,024✔
196	bool first = true;	21,024✔
197
198	len += tsnprintf(buf + len, bufSize - *len, "%s(", pFuncNode->functionName);	21,024✔
199
200	FOREACH(node, pFuncNode->pParameterList) {	105,120!
201	if (!first) {	84,096✔
202	len += tsnprintf(buf + len, bufSize - *len, ", ");	63,072✔
203	}
204	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	84,096!
205	first = false;	84,096✔
206	}
207
208	len += tsnprintf(buf + len, bufSize - *len, ")");	21,024✔
209
210	return TSDB_CODE_SUCCESS;	21,024✔
211	}
212	case QUERY_NODE_NODE_LIST: {	5,656✔
213	SNodeListNode pListNode = (SNodeListNode )pNode;	5,656✔
214	SNode *node = NULL;	5,656✔
215	bool first = true;	5,656✔
216	int32_t num = 0;	5,656✔
217
218	len += tsnprintf(buf + len, bufSize - *len, "(");	5,656✔
219
220	FOREACH(node, pListNode->pNodeList) {	25,472!
221	if (!first) {	19,816✔
222	len += tsnprintf(buf + len, bufSize - *len, ", ");	14,160✔
223	if (!longFormat) {	14,160!
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));	19,816!
231	first = false;	19,816✔
232	}
233
234	len += tsnprintf(buf + len, bufSize - *len, ")");	5,656✔
235
236	return TSDB_CODE_SUCCESS;	5,656✔
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 / #4788

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