#5097

Committed 17 May 2026 01:15AM UTC coverage: 73.316% (+0.04%) from 73.276%

Build # #5097

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

feat (TDgpt): Dynamic Model Synchronization Enhancements (#35344)

* refactor: do some internal refactor.

* fix: fix multiprocess sync issue.

* feat: add dynamic anomaly detection and forecasting services

* fix: log error message for undeploying model in exception handling

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* fix: handle undeploy when model exists only on disk

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/286aafa0-c3ce-4c27-b803-2707571e9dc1

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: guard dynamic registry concurrent access

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/5e4db858-6458-40f4-ac28-d1b1b7f97c18

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: tighten service list locking scope

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/5e4db858-6458-40f4-ac28-d1b1b7f97c18

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: restore prophet support and update tests per review feedback

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/92298ae1-7da6-4d07-b20e-101c7cd0b26b

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* fix: improve test name and move copy inside lock scope

Agent-Logs-Url: https://github.com/taosdata/TDengine/sessions/92298ae1-7da6-4d07-b20e-101c7cd0b26b

Co-authored-by: hjxilinx <8252296+hjxilinx@users.noreply.github.com>

* Potential fix for pull request finding

Co-au... (continued)

Coverage Stats

281382 of 383795 relevant lines covered (73.32%)

132379014.15 hits per line

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

78.18

/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) {
        // NULL type value (e.g. ELSE NULL in CASE WHEN)
        *len += tsnprintf(buf + *len, bufSize - *len, "NULL");
        return TSDB_CODE_SUCCESS;
      }

      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;
    }
    case QUERY_NODE_WHEN_THEN: {
      SWhenThenNode *pWhenThen = (SWhenThenNode *)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "WHEN ");
      NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen->pWhen, buf, bufSize, len, true));
      *len += tsnprintf(buf + *len, bufSize - *len, " THEN ");
      NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen->pThen, buf, bufSize, len, true));
      return TSDB_CODE_SUCCESS;
    }
    case QUERY_NODE_CASE_WHEN: {
      SCaseWhenNode *pCaseWhen = (SCaseWhenNode *)pNode;
      *len += tsnprintf(buf + *len, bufSize - *len, "CASE");
      if (pCaseWhen->pCase) {
        *len += tsnprintf(buf + *len, bufSize - *len, " ");
        NODES_ERR_RET(nodesNodeToSQLFormat(pCaseWhen->pCase, buf, bufSize, len, true));
      }
      SNode *pWhenThen = NULL;
      FOREACH(pWhenThen, pCaseWhen->pWhenThenList) {
        *len += tsnprintf(buf + *len, bufSize - *len, " ");
        NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen, buf, bufSize, len, true));
      }
      if (pCaseWhen->pElse) {
        *len += tsnprintf(buf + *len, bufSize - *len, " ELSE ");
        NODES_ERR_RET(nodesNodeToSQLFormat(pCaseWhen->pElse, buf, bufSize, len, true));
      }
      *len += tsnprintf(buf + *len, bufSize - *len, " END");
      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) {	162,647,072✔
25	switch (type) {	162,647,072✔
26	case OP_TYPE_ADD:	231,932✔
27	return "+";	231,932✔
28	case OP_TYPE_SUB:	3,264✔
29	return "-";	3,264✔
30	case OP_TYPE_MULTI:	3,264✔
31	return "*";	3,264✔
32	case OP_TYPE_DIV:	2,856✔
33	return "/";	2,856✔
34	case OP_TYPE_REM:	2,856✔
35	return "%";	2,856✔
36	case OP_TYPE_MINUS:	3,672✔
37	return "-";	3,672✔
38	case OP_TYPE_BIT_AND:	3,264✔
39	return "&";	3,264✔
40	case OP_TYPE_BIT_OR:	3,264✔
41	return "\|";	3,264✔
42	case OP_TYPE_GREATER_THAN:	19,118,729✔
43	return ">";	19,118,729✔
44	case OP_TYPE_GREATER_EQUAL:	30,121,502✔
45	return ">=";	30,121,502✔
46	case OP_TYPE_LOWER_THAN:	13,797,500✔
47	return "<";	13,797,500✔
48	case OP_TYPE_LOWER_EQUAL:	29,061,123✔
49	return "<=";	29,061,123✔
50	case OP_TYPE_EQUAL:	36,399,831✔
51	return "=";	36,399,831✔
52	case OP_TYPE_NOT_EQUAL:	1,415,904✔
53	return "<>";	1,415,904✔
54	case OP_TYPE_IN:	1,396,416✔
55	return "IN";	1,396,416✔
56	case OP_TYPE_NOT_IN:	985,490✔
57	return "NOT IN";	985,490✔
58	case OP_TYPE_LIKE:	2,814,826✔
59	return "LIKE";	2,814,826✔
60	case OP_TYPE_NOT_LIKE:	1,632✔
61	return "NOT LIKE";	1,632✔
62	case OP_TYPE_MATCH:	12,206,638✔
63	return "MATCH";	12,206,638✔
64	case OP_TYPE_NMATCH:	584,606✔
65	return "NMATCH";	584,606✔
66	case OP_TYPE_IS_NULL:	4,351,205✔
67	return "IS NULL";	4,351,205✔
68	case OP_TYPE_IS_NOT_NULL:	9,837,114✔
69	return "IS NOT NULL";	9,837,114✔
70	case OP_TYPE_IS_TRUE:	300,761✔
71	return "IS TRUE";	300,761✔
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:	×
93	break;	×
94	}
95	return "UNKNOWN";	×
96	}
97
98	const char *operatorTypeStrEx(EOperatorType type, bool isNegative) {	13,290,591✔
99	if (isNegative) {	13,290,591✔
100	switch (type) {	95,890✔
101	case OP_TYPE_IN:	×
102	return "!= ANY";	×
103	case OP_TYPE_NOT_IN:	95,890✔
104	return "= ALL";	95,890✔
105	default:	×
106	break;	×
107	}
108	return "UNKNOWN";	×
109	}
110
111	return operatorTypeStr(type);	13,194,701✔
112	}
113
114	const char *logicConditionTypeStr(ELogicConditionType type) {	785,855✔
115	switch (type) {	785,855✔
116	case LOGIC_COND_TYPE_AND:	513,351✔
117	return "AND";	513,351✔
118	case LOGIC_COND_TYPE_OR:	272,504✔
119	return "OR";	272,504✔
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,195,870✔
129	return nodesNodeToSQLFormat(pNode, buf, bufSize, len, false);	12,195,870✔
130	}
131
132	int32_t nodesNodeToSQLFormat(SNode pNode, char buf, int32_t bufSize, int32_t *len, bool longFormat) {	38,950,224✔
133	switch (pNode->type) {	38,950,224✔
134	case QUERY_NODE_COLUMN: {	11,372,839✔
135	SColumnNode colNode = (SColumnNode )pNode;	11,372,839✔
136	if (colNode->dbName[0]) {	11,372,839✔
137	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->dbName);	10,737,003✔
138	}
139
140	if (colNode->tableAlias[0]) {	11,372,839✔
141	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableAlias);	10,776,432✔
142	} else if (colNode->tableName[0]) {	596,407✔
143	len += snprintf(buf + len, bufSize - *len, "`%s`.", colNode->tableName);	×
144	}
145
146	if (colNode->node.userAlias[0]) {	11,372,839✔
147	len += snprintf(buf + len, bufSize - *len, "`%s`", colNode->node.userAlias);	11,359,800✔
148	} else {
149	len += snprintf(buf + len, bufSize - *len, "`%s`", colNode->colName);	13,212✔
150	}
151
152	return TSDB_CODE_SUCCESS;	11,372,839✔
153	}
154	case QUERY_NODE_VALUE: {	5,342,084✔
155	SValueNode colNode = (SValueNode )pNode;	5,342,084✔
156	char *t = nodesGetStrValueFromNode(colNode);	5,342,084✔
157	if (NULL == t) {	5,342,196✔
158	// NULL type value (e.g. ELSE NULL in CASE WHEN)
159	len += tsnprintf(buf + len, bufSize - *len, "NULL");	1,300✔
160	return TSDB_CODE_SUCCESS;	1,188✔
161	}
162
163	int32_t tlen = strlen(t);	5,340,896✔
164	if (longFormat) {	5,340,896✔
165	len += snprintf(buf + len, bufSize - *len, "%s", t);	5,335,272✔
166	} else {
167	if (tlen > 32) {	5,624✔
168	len += snprintf(buf + len, bufSize - len, "%.s...%s", 32, t, t + tlen - 1);	×
169	} else {
170	len += snprintf(buf + len, bufSize - *len, "%s", t);	5,624✔
171	}
172	}
173
174	taosMemoryFree(t);	5,340,896✔
175
176	return TSDB_CODE_SUCCESS;	5,340,645✔
177	}
178	case QUERY_NODE_OPERATOR: {	13,290,496✔
179	SOperatorNode pOpNode = (SOperatorNode )pNode;	13,290,496✔
180	len += snprintf(buf + len, bufSize - *len, "(");	13,290,496✔
181	if (pOpNode->pLeft) {	13,290,496✔
182	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pLeft, buf, bufSize, len, true));	13,290,574✔
183	}
184
185	len += tsnprintf(buf + len, bufSize - *len, " %s ", operatorTypeStrEx(pOpNode->opType, pOpNode->flag & OPERATOR_FLAG_NEGATIVE_OP));	13,290,781✔
186
187	if (pOpNode->pRight) {	13,291,015✔
188	NODES_ERR_RET(nodesNodeToSQLFormat(pOpNode->pRight, buf, bufSize, len, true));	11,529,718✔
189	}
190
191	len += snprintf(buf + len, bufSize - *len, ")");	13,290,409✔
192
193	return TSDB_CODE_SUCCESS;	13,290,409✔
194	}
195	case QUERY_NODE_LOGIC_CONDITION: {	774,121✔
196	SLogicConditionNode pLogicNode = (SLogicConditionNode )pNode;	774,121✔
197	SNode *node = NULL;	774,121✔
198	bool first = true;	774,121✔
199
200	len += snprintf(buf + len, bufSize - *len, "(");	774,121✔
201
202	FOREACH(node, pLogicNode->pParameterList) {	2,334,253✔
203	if (!first) {	1,560,054✔
204	len += snprintf(buf + len, bufSize - *len, " %s ", logicConditionTypeStr(pLogicNode->condType));	785,933✔
205	}
206	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	1,559,976✔
207	first = false;	1,560,132✔
208	}
209
210	len += snprintf(buf + len, bufSize - *len, ")");	774,199✔
211
212	return TSDB_CODE_SUCCESS;	774,199✔
213	}
214	case QUERY_NODE_FUNCTION: {	201,882✔
215	SFunctionNode pFuncNode = (SFunctionNode )pNode;	201,882✔
216	SNode *node = NULL;	201,882✔
217	bool first = true;	201,882✔
218
219	len += snprintf(buf + len, bufSize - *len, "%s(", pFuncNode->functionName);	201,882✔
220
221	FOREACH(node, pFuncNode->pParameterList) {	451,176✔
222	if (!first) {	249,294✔
223	len += snprintf(buf + len, bufSize - *len, ", ");	47,412✔
224	}
225	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	249,294✔
226	first = false;	249,294✔
227	}
228
229	len += snprintf(buf + len, bufSize - *len, ")");	201,882✔
230
231	return TSDB_CODE_SUCCESS;	201,882✔
232	}
233	case QUERY_NODE_NODE_LIST: {	9,405✔
234	SNodeListNode pListNode = (SNodeListNode )pNode;	9,405✔
235	SNode *node = NULL;	9,405✔
236	bool first = true;	9,405✔
237	int32_t num = 0;	9,405✔
238
239	len += snprintf(buf + len, bufSize - *len, "(");	9,405✔
240
241	FOREACH(node, pListNode->pNodeList) {	37,594✔
242	if (!first) {	28,189✔
243	len += snprintf(buf + len, bufSize - *len, ", ");	18,784✔
244	if (!longFormat) {	18,784✔
245	if (++num >= 10) {	×
246	len += snprintf(buf + len, bufSize - *len, "...");	×
247	break;	×
248	}
249	}
250	}
251	NODES_ERR_RET(nodesNodeToSQLFormat(node, buf, bufSize, len, true));	28,189✔
252	first = false;	28,189✔
253	}
254
255	len += snprintf(buf + len, bufSize - *len, ")");	9,405✔
256
257	return TSDB_CODE_SUCCESS;	9,405✔
258	}
259	case QUERY_NODE_REMOTE_VALUE: {	6,234,752✔
260	SRemoteValueNode* pRemote = (SRemoteValueNode*)pNode;	6,234,752✔
261	len += snprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	6,234,752✔
262	return TSDB_CODE_SUCCESS;	6,234,752✔
263	}
264	case QUERY_NODE_REMOTE_VALUE_LIST: {	1,391,759✔
265	SRemoteValueListNode* pRemote = (SRemoteValueListNode*)pNode;	1,391,759✔
266	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	1,391,759✔
267	return TSDB_CODE_SUCCESS;	1,391,759✔
268	}
269	case QUERY_NODE_REMOTE_ROW: {	196,604✔
270	SRemoteRowNode* pRemote = (SRemoteRowNode*)pNode;	196,604✔
271	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	196,604✔
272	return TSDB_CODE_SUCCESS;	196,604✔
273	}
274	case QUERY_NODE_REMOTE_ZERO_ROWS: {	129,190✔
275	SRemoteZeroRowsNode* pRemote = (SRemoteZeroRowsNode*)pNode;	129,190✔
276	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	129,190✔
277	return TSDB_CODE_SUCCESS;	129,190✔
278	}
279	case QUERY_NODE_REMOTE_TABLE: {	×
280	SRemoteTableNode* pRemote = (SRemoteTableNode*)pNode;	×
281	len += tsnprintf(buf + len, bufSize - *len, "$(InitPlan %d)", pRemote->subQIdx + 1);	×
282	return TSDB_CODE_SUCCESS;	×
283	}
284	case QUERY_NODE_WHEN_THEN: {	3,562✔
285	SWhenThenNode pWhenThen = (SWhenThenNode )pNode;	3,562✔
286	len += tsnprintf(buf + len, bufSize - *len, "WHEN ");	3,562✔
287	NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen->pWhen, buf, bufSize, len, true));	3,562✔
288	len += tsnprintf(buf + len, bufSize - *len, " THEN ");	3,562✔
289	NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen->pThen, buf, bufSize, len, true));	3,562✔
290	return TSDB_CODE_SUCCESS;	3,562✔
291	}
292	case QUERY_NODE_CASE_WHEN: {	3,562✔
293	SCaseWhenNode pCaseWhen = (SCaseWhenNode )pNode;	3,562✔
294	len += tsnprintf(buf + len, bufSize - *len, "CASE");	3,562✔
295	if (pCaseWhen->pCase) {	3,562✔
296	len += tsnprintf(buf + len, bufSize - *len, " ");	×
297	NODES_ERR_RET(nodesNodeToSQLFormat(pCaseWhen->pCase, buf, bufSize, len, true));	×
298	}
299	SNode *pWhenThen = NULL;	3,562✔
300	FOREACH(pWhenThen, pCaseWhen->pWhenThenList) {	7,124✔
301	len += tsnprintf(buf + len, bufSize - *len, " ");	3,562✔
302	NODES_ERR_RET(nodesNodeToSQLFormat(pWhenThen, buf, bufSize, len, true));	3,562✔
303	}
304	if (pCaseWhen->pElse) {	3,562✔
305	len += tsnprintf(buf + len, bufSize - *len, " ELSE ");	3,562✔
306	NODES_ERR_RET(nodesNodeToSQLFormat(pCaseWhen->pElse, buf, bufSize, len, true));	3,562✔
307	}
308	len += tsnprintf(buf + len, bufSize - *len, " END");	3,562✔
309	return TSDB_CODE_SUCCESS;	3,562✔
310	}
311	default:	×
312	break;	×
313	}
314
315	nodesError("nodesNodeToSQL unknown node = %s", nodesNodeName(pNode->type));	×
316	NODES_RET(TSDB_CODE_APP_ERROR);	×
317	}

taosdata / TDengine / #5097

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