#5015

Committed 03 Apr 2026 03:59PM UTC coverage: 72.289% (+0.03%) from 72.256%

Build # #5015

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

merge: from main to 3.0 branch #35067

Coverage Stats

4055 of 5985 new or added lines in 68 files covered. (67.75%)

13044 existing lines in 149 files now uncovered.

257390 of 356056 relevant lines covered (72.29%)

130247228.09 hits per line

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

77.78

/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_EXISTS:
      return "EXISTS";
    case OP_TYPE_NOT_EXISTS:
      return "NOT EXISTS";
    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 *operatorTypeStrEx(EOperatorType type, bool isNegative) {
  if (isNegative) {
    switch (type) {
      case OP_TYPE_IN:
        return "!= ANY";
      case OP_TYPE_NOT_IN:
        return "= ALL";
      default:
        break;
    }
    return "UNKNOWN";
  }

  return operatorTypeStr(type);
}

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 += snprintf(buf + *len, bufSize - *len, "`%s`.", colNode->dbName);
      }

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

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

      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 += snprintf(buf + *len, bufSize - *len, "%s", t);
      } else {
        if (tlen > 32) {
          *len += snprintf(buf + *len, bufSize - *len, "%.*s...%s", 32, t, t + tlen - 1);
        } else {
          *len += snprintf(buf + *len, bufSize - *len, "%s", t);
        }
      }

      taosMemoryFree(t);

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

      *len += tsnprintf(buf + *len, bufSize - *len, " %s ", operatorTypeStrEx(pOpNode->opType, pOpNode->flag & OPERATOR_FLAG_NEGATIVE_OP));

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

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

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

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

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

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

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

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

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

      *len += snprintf(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 += snprintf(buf + *len, bufSize - *len, "(");

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

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

      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_REMOTE_VALUE: {
      SRemoteValueNode* pRemote = (SRemoteValueNode*)pNode;
      *len += snprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_REMOTE_VALUE_LIST: {
      SRemoteValueListNode* pRemote = (SRemoteValueListNode*)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_REMOTE_ROW: {
      SRemoteRowNode* pRemote = (SRemoteRowNode*)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_REMOTE_ZERO_ROWS: {
      SRemoteZeroRowsNode* pRemote = (SRemoteZeroRowsNode*)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_REMOTE_TABLE: {
      SRemoteTableNode* pRemote = (SRemoteTableNode*)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);
      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) {	147,061,408✔
25	switch (type) {	147,061,408✔
26	case OP_TYPE_ADD:	231,193✔
27	return "+";	231,193✔
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,648,161✔
43	return ">";	17,648,161✔
44	case OP_TYPE_GREATER_EQUAL:	27,974,956✔
45	return ">=";	27,974,956✔
46	case OP_TYPE_LOWER_THAN:	13,088,970✔
47	return "<";	13,088,970✔
48	case OP_TYPE_LOWER_EQUAL:	26,252,091✔
49	return "<=";	26,252,091✔
50	case OP_TYPE_EQUAL:	31,213,915✔
51	return "=";	31,213,915✔
52	case OP_TYPE_NOT_EQUAL:	1,335,422✔
53	return "<>";	1,335,422✔
54	case OP_TYPE_IN:	1,296,489✔
55	return "IN";	1,296,489✔
56	case OP_TYPE_NOT_IN:	958,337✔
57	return "NOT IN";	958,337✔
58	case OP_TYPE_LIKE:	2,269,988✔
59	return "LIKE";	2,269,988✔
60	case OP_TYPE_NOT_LIKE:	1,600✔
61	return "NOT LIKE";	1,600✔
62	case OP_TYPE_MATCH:	11,115,985✔
63	return "MATCH";	11,115,985✔
64	case OP_TYPE_NMATCH:	576,090✔
65	return "NMATCH";	576,090✔
66	case OP_TYPE_IS_NULL:	3,996,738✔
67	return "IS NULL";	3,996,738✔
68	case OP_TYPE_IS_NOT_NULL:	8,773,054✔
69	return "IS NOT NULL";	8,773,054✔
70	case OP_TYPE_IS_TRUE:	306,424✔
71	return "IS TRUE";	306,424✔
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:	182✔
93	break;	182✔
94	}
95	return "UNKNOWN";	182✔
96	}
97
98	const char *operatorTypeStrEx(EOperatorType type, bool isNegative) {	13,273,603✔
99	if (isNegative) {	13,273,603✔
100	switch (type) {	97,897✔
101	case OP_TYPE_IN:	×
102	return "!= ANY";	×
103	case OP_TYPE_NOT_IN:	97,897✔
104	return "= ALL";	97,897✔
105	default:	×
106	break;	×
107	}
108	return "UNKNOWN";	×
109	}
110
111	return operatorTypeStr(type);	13,175,706✔
112	}
113
114	const char *logicConditionTypeStr(ELogicConditionType type) {	748,513✔
115	switch (type) {	748,513✔
116	case LOGIC_COND_TYPE_AND:	490,204✔
117	return "AND";	490,204✔
118	case LOGIC_COND_TYPE_OR:	258,309✔
119	return "OR";	258,309✔
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,237,748✔
129	return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);	12,237,748✔
130	}
131
132	int32_t nodesNodeToSQLFormat(SNode pNode, char buf, int32_t bufSize, int32_t *len, bool longFormat) {	38,836,497✔
133	switch (pNode->type) {	38,836,497✔
134	case QUERY_NODE_COLUMN: {	11,319,821✔
135	SColumnNode colNode = (SColumnNode )pNode;	11,319,821✔
136	if (colNode->dbName[0]) {	11,319,821✔
137	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->dbName);	10,708,474✔
138	}
139
140	if (colNode->tableAlias[0]) {	11,319,821✔
141	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableAlias);	10,727,606✔
142	} else if (colNode->tableName[0]) {	592,215✔
143	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableName);	×
144	}
145
146	if (colNode->node.userAlias[0]) {	11,319,821✔
147	len += snprintf(buf + len, bufSize - *len, "`%s`", colNode->node.userAlias);	11,308,896✔
148	} else {
149	len += snprintf(buf + len, bufSize - *len, "`%s`", colNode->colName);	11,204✔
150	}
151
152	return TSDB_CODE_SUCCESS;	11,319,821✔
153	}
154	case QUERY_NODE_VALUE: {	5,265,815✔
155	SValueNode colNode = (SValueNode )pNode;	5,265,815✔
156	char *t = nodesGetStrValueFromNode(colNode);	5,265,815✔
157	if (NULL == t) {	5,265,446✔
158	nodesError("fail to get str value from valueNode");	×
159	NODES_ERR_RET(TSDB_CODE_APP_ERROR);	186✔
160	}
161
162	int32_t tlen = strlen(t);	5,265,632✔
163	if (longFormat) {	5,265,632✔
164	len += snprintf(buf + len, bufSize - *len, "%s", t);	5,260,488✔
165	} else {
166	if (tlen > 32) {	5,144✔
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,144✔
170	}
171	}
172
173	taosMemoryFree(t);	5,265,632✔
174
175	return TSDB_CODE_SUCCESS;	5,265,546✔
176	}
177	case QUERY_NODE_OPERATOR: {	13,273,241✔
178	SOperatorNode pOpNode = (SOperatorNode )pNode;	13,273,241✔
179	len += snprintf(buf + len, bufSize - *len, "(");	13,273,241✔
180	if (pOpNode->pLeft) {	13,273,241✔
181	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));	13,273,879✔
182	}
183
184	len += tsnprintf(buf + len, bufSize - *len, " %s ", operatorTypeStrEx(pOpNode->opType, pOpNode->flag & OPERATOR_FLAG_NEGATIVE_OP));	13,273,340✔
185
186	if (pOpNode->pRight) {	13,273,787✔
187	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));	11,499,613✔
188	}
189
190	len += snprintf(buf + len, bufSize - *len, ")");	13,274,160✔
191
192	return TSDB_CODE_SUCCESS;	13,274,160✔
193	}
194	case QUERY_NODE_LOGIC_CONDITION: {	742,779✔
195	SLogicConditionNode pLogicNode = (SLogicConditionNode )pNode;	742,779✔
196	SNode *node = NULL;	742,779✔
197	bool first = true;	742,779✔
198
199	len += snprintf(buf + len, bufSize - *len, "(");	742,779✔
200
201	FOREACH(node, pLogicNode->pParameterList) {	2,234,071✔
202	if (!first) {	1,491,292✔
203	len += snprintf(buf + len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));	748,513✔
204	}
205	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	1,491,292✔
206	first = false;	1,491,292✔
207	}
208
209	len += snprintf(buf + len, bufSize - *len, ")");	742,779✔
210
211	return TSDB_CODE_SUCCESS;	742,779✔
212	}
213	case QUERY_NODE_FUNCTION: {	201,657✔
214	SFunctionNode pFuncNode = (SFunctionNode )pNode;	201,657✔
215	SNode *node = NULL;	201,657✔
216	bool first = true;	201,657✔
217
218	len += snprintf(buf + len, bufSize - *len, "%s(", pFuncNode->functionName);	201,657✔
219
220	FOREACH(node, pFuncNode->pParameterList) {	446,298✔
221	if (!first) {	244,641✔
222	len += snprintf(buf + len, bufSize - *len, ", ");	42,984✔
223	}
224	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	244,641✔
225	first = false;	244,641✔
226	}
227
228	len += snprintf(buf + len, bufSize - *len, ")");	201,657✔
229
230	return TSDB_CODE_SUCCESS;	201,657✔
231	}
232	case QUERY_NODE_NODE_LIST: {	8,524✔
233	SNodeListNode pListNode = (SNodeListNode )pNode;	8,524✔
234	SNode *node = NULL;	8,524✔
235	bool first = true;	8,524✔
236	int32_t num = 0;	8,524✔
237
238	len += snprintf(buf + len, bufSize - *len, "(");	8,524✔
239
240	FOREACH(node, pListNode->pNodeList) {	34,088✔
241	if (!first) {	25,564✔
242	len += snprintf(buf + len, bufSize - *len, ", ");	17,040✔
243	if (!longFormat) {	17,040✔
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,564✔
251	first = false;	25,564✔
252	}
253
254	len += snprintf(buf + len, bufSize - *len, ")");	8,524✔
255
256	return TSDB_CODE_SUCCESS;	8,524✔
257	}
258	case QUERY_NODE_REMOTE_VALUE: {	6,282,295✔
259	SRemoteValueNode* pRemote = (SRemoteValueNode*)pNode;	6,282,295✔
260	len += snprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	6,282,295✔
261	return TSDB_CODE_SUCCESS;	6,282,295✔
262	}
263	case QUERY_NODE_REMOTE_VALUE_LIST: {	1,411,423✔
264	SRemoteValueListNode* pRemote = (SRemoteValueListNode*)pNode;	1,411,423✔
265	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	1,411,423✔
266	return TSDB_CODE_SUCCESS;	1,411,516✔
267	}
268	case QUERY_NODE_REMOTE_ROW: {	200,162✔
269	SRemoteRowNode* pRemote = (SRemoteRowNode*)pNode;	200,162✔
270	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	200,162✔
271	return TSDB_CODE_SUCCESS;	200,162✔
272	}
273	case QUERY_NODE_REMOTE_ZERO_ROWS: {	131,233✔
274	SRemoteZeroRowsNode* pRemote = (SRemoteZeroRowsNode*)pNode;	131,233✔
275	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	131,233✔
276	return TSDB_CODE_SUCCESS;	131,233✔
277	}
NEW 278	case QUERY_NODE_REMOTE_TABLE: {	×
NEW 279	SRemoteTableNode* pRemote = (SRemoteTableNode*)pNode;	×
NEW 280	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	×
NEW 281	return TSDB_CODE_SUCCESS;	×
282	}
283	default:	×
284	break;	×
285	}
286
UNCOV 287	nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));	×
288	NODES_RET(TSDB_CODE_APP_ERROR);	×
289	}

taosdata / TDengine / #5015

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