1247 lines
40 KiB
C
1247 lines
40 KiB
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"
|
|
|
|
static SNode* makeNode(ENodeType type, size_t size) {
|
|
SNode* p = taosMemoryCalloc(1, size);
|
|
if (NULL == p) {
|
|
return NULL;
|
|
}
|
|
setNodeType(p, type);
|
|
return p;
|
|
}
|
|
|
|
SNodeptr nodesMakeNode(ENodeType type) {
|
|
switch (type) {
|
|
case QUERY_NODE_COLUMN:
|
|
return makeNode(type, sizeof(SColumnNode));
|
|
case QUERY_NODE_VALUE:
|
|
return makeNode(type, sizeof(SValueNode));
|
|
case QUERY_NODE_OPERATOR:
|
|
return makeNode(type, sizeof(SOperatorNode));
|
|
case QUERY_NODE_LOGIC_CONDITION:
|
|
return makeNode(type, sizeof(SLogicConditionNode));
|
|
case QUERY_NODE_FUNCTION:
|
|
return makeNode(type, sizeof(SFunctionNode));
|
|
case QUERY_NODE_REAL_TABLE:
|
|
return makeNode(type, sizeof(SRealTableNode));
|
|
case QUERY_NODE_TEMP_TABLE:
|
|
return makeNode(type, sizeof(STempTableNode));
|
|
case QUERY_NODE_JOIN_TABLE:
|
|
return makeNode(type, sizeof(SJoinTableNode));
|
|
case QUERY_NODE_GROUPING_SET:
|
|
return makeNode(type, sizeof(SGroupingSetNode));
|
|
case QUERY_NODE_ORDER_BY_EXPR:
|
|
return makeNode(type, sizeof(SOrderByExprNode));
|
|
case QUERY_NODE_LIMIT:
|
|
return makeNode(type, sizeof(SLimitNode));
|
|
case QUERY_NODE_STATE_WINDOW:
|
|
return makeNode(type, sizeof(SStateWindowNode));
|
|
case QUERY_NODE_SESSION_WINDOW:
|
|
return makeNode(type, sizeof(SSessionWindowNode));
|
|
case QUERY_NODE_INTERVAL_WINDOW:
|
|
return makeNode(type, sizeof(SIntervalWindowNode));
|
|
case QUERY_NODE_NODE_LIST:
|
|
return makeNode(type, sizeof(SNodeListNode));
|
|
case QUERY_NODE_FILL:
|
|
return makeNode(type, sizeof(SFillNode));
|
|
case QUERY_NODE_RAW_EXPR:
|
|
return makeNode(type, sizeof(SRawExprNode));
|
|
case QUERY_NODE_TARGET:
|
|
return makeNode(type, sizeof(STargetNode));
|
|
case QUERY_NODE_DATABLOCK_DESC:
|
|
return makeNode(type, sizeof(SDataBlockDescNode));
|
|
case QUERY_NODE_SLOT_DESC:
|
|
return makeNode(type, sizeof(SSlotDescNode));
|
|
case QUERY_NODE_COLUMN_DEF:
|
|
return makeNode(type, sizeof(SColumnDefNode));
|
|
case QUERY_NODE_DOWNSTREAM_SOURCE:
|
|
return makeNode(type, sizeof(SDownstreamSourceNode));
|
|
case QUERY_NODE_DATABASE_OPTIONS:
|
|
return makeNode(type, sizeof(SDatabaseOptions));
|
|
case QUERY_NODE_TABLE_OPTIONS:
|
|
return makeNode(type, sizeof(STableOptions));
|
|
case QUERY_NODE_INDEX_OPTIONS:
|
|
return makeNode(type, sizeof(SIndexOptions));
|
|
case QUERY_NODE_EXPLAIN_OPTIONS:
|
|
return makeNode(type, sizeof(SExplainOptions));
|
|
case QUERY_NODE_STREAM_OPTIONS:
|
|
return makeNode(type, sizeof(SStreamOptions));
|
|
case QUERY_NODE_TOPIC_OPTIONS:
|
|
return makeNode(type, sizeof(STopicOptions));
|
|
case QUERY_NODE_SET_OPERATOR:
|
|
return makeNode(type, sizeof(SSetOperator));
|
|
case QUERY_NODE_SELECT_STMT:
|
|
return makeNode(type, sizeof(SSelectStmt));
|
|
case QUERY_NODE_VNODE_MODIF_STMT:
|
|
return makeNode(type, sizeof(SVnodeModifOpStmt));
|
|
case QUERY_NODE_CREATE_DATABASE_STMT:
|
|
return makeNode(type, sizeof(SCreateDatabaseStmt));
|
|
case QUERY_NODE_DROP_DATABASE_STMT:
|
|
return makeNode(type, sizeof(SDropDatabaseStmt));
|
|
case QUERY_NODE_ALTER_DATABASE_STMT:
|
|
return makeNode(type, sizeof(SAlterDatabaseStmt));
|
|
case QUERY_NODE_CREATE_TABLE_STMT:
|
|
return makeNode(type, sizeof(SCreateTableStmt));
|
|
case QUERY_NODE_CREATE_SUBTABLE_CLAUSE:
|
|
return makeNode(type, sizeof(SCreateSubTableClause));
|
|
case QUERY_NODE_CREATE_MULTI_TABLE_STMT:
|
|
return makeNode(type, sizeof(SCreateMultiTableStmt));
|
|
case QUERY_NODE_DROP_TABLE_CLAUSE:
|
|
return makeNode(type, sizeof(SDropTableClause));
|
|
case QUERY_NODE_DROP_TABLE_STMT:
|
|
return makeNode(type, sizeof(SDropTableStmt));
|
|
case QUERY_NODE_DROP_SUPER_TABLE_STMT:
|
|
return makeNode(type, sizeof(SDropSuperTableStmt));
|
|
case QUERY_NODE_CREATE_USER_STMT:
|
|
return makeNode(type, sizeof(SCreateUserStmt));
|
|
case QUERY_NODE_ALTER_USER_STMT:
|
|
return makeNode(type, sizeof(SAlterUserStmt));
|
|
case QUERY_NODE_DROP_USER_STMT:
|
|
return makeNode(type, sizeof(SDropUserStmt));
|
|
case QUERY_NODE_USE_DATABASE_STMT:
|
|
return makeNode(type, sizeof(SUseDatabaseStmt));
|
|
case QUERY_NODE_CREATE_DNODE_STMT:
|
|
return makeNode(type, sizeof(SCreateDnodeStmt));
|
|
case QUERY_NODE_DROP_DNODE_STMT:
|
|
return makeNode(type, sizeof(SDropDnodeStmt));
|
|
case QUERY_NODE_ALTER_DNODE_STMT:
|
|
return makeNode(type, sizeof(SAlterDnodeStmt));
|
|
case QUERY_NODE_CREATE_INDEX_STMT:
|
|
return makeNode(type, sizeof(SCreateIndexStmt));
|
|
case QUERY_NODE_DROP_INDEX_STMT:
|
|
return makeNode(type, sizeof(SDropIndexStmt));
|
|
case QUERY_NODE_CREATE_QNODE_STMT:
|
|
case QUERY_NODE_CREATE_BNODE_STMT:
|
|
case QUERY_NODE_CREATE_SNODE_STMT:
|
|
case QUERY_NODE_CREATE_MNODE_STMT:
|
|
return makeNode(type, sizeof(SCreateComponentNodeStmt));
|
|
case QUERY_NODE_DROP_QNODE_STMT:
|
|
case QUERY_NODE_DROP_BNODE_STMT:
|
|
case QUERY_NODE_DROP_SNODE_STMT:
|
|
case QUERY_NODE_DROP_MNODE_STMT:
|
|
return makeNode(type, sizeof(SDropComponentNodeStmt));
|
|
case QUERY_NODE_CREATE_TOPIC_STMT:
|
|
return makeNode(type, sizeof(SCreateTopicStmt));
|
|
case QUERY_NODE_DROP_TOPIC_STMT:
|
|
return makeNode(type, sizeof(SDropTopicStmt));
|
|
case QUERY_NODE_EXPLAIN_STMT:
|
|
return makeNode(type, sizeof(SExplainStmt));
|
|
case QUERY_NODE_DESCRIBE_STMT:
|
|
return makeNode(type, sizeof(SDescribeStmt));
|
|
case QUERY_NODE_RESET_QUERY_CACHE_STMT:
|
|
return makeNode(type, sizeof(SNode));
|
|
case QUERY_NODE_COMPACT_STMT:
|
|
break;
|
|
case QUERY_NODE_CREATE_FUNCTION_STMT:
|
|
return makeNode(type, sizeof(SCreateFunctionStmt));
|
|
case QUERY_NODE_DROP_FUNCTION_STMT:
|
|
break;
|
|
case QUERY_NODE_CREATE_STREAM_STMT:
|
|
return makeNode(type, sizeof(SCreateStreamStmt));
|
|
case QUERY_NODE_DROP_STREAM_STMT:
|
|
return makeNode(type, sizeof(SDropStreamStmt));
|
|
case QUERY_NODE_MERGE_VGROUP_STMT:
|
|
case QUERY_NODE_REDISTRIBUTE_VGROUP_STMT:
|
|
case QUERY_NODE_SPLIT_VGROUP_STMT:
|
|
case QUERY_NODE_SYNCDB_STMT:
|
|
break;
|
|
case QUERY_NODE_SHOW_DNODES_STMT:
|
|
case QUERY_NODE_SHOW_MNODES_STMT:
|
|
case QUERY_NODE_SHOW_MODULES_STMT:
|
|
case QUERY_NODE_SHOW_QNODES_STMT:
|
|
case QUERY_NODE_SHOW_SNODES_STMT:
|
|
case QUERY_NODE_SHOW_BNODES_STMT:
|
|
case QUERY_NODE_SHOW_CLUSTER_STMT:
|
|
case QUERY_NODE_SHOW_DATABASES_STMT:
|
|
case QUERY_NODE_SHOW_FUNCTIONS_STMT:
|
|
case QUERY_NODE_SHOW_INDEXES_STMT:
|
|
case QUERY_NODE_SHOW_STABLES_STMT:
|
|
case QUERY_NODE_SHOW_STREAMS_STMT:
|
|
case QUERY_NODE_SHOW_TABLES_STMT:
|
|
case QUERY_NODE_SHOW_USERS_STMT:
|
|
case QUERY_NODE_SHOW_LICENCE_STMT:
|
|
case QUERY_NODE_SHOW_VGROUPS_STMT:
|
|
case QUERY_NODE_SHOW_TOPICS_STMT:
|
|
case QUERY_NODE_SHOW_CONSUMERS_STMT:
|
|
case QUERY_NODE_SHOW_SUBSCRIBES_STMT:
|
|
case QUERY_NODE_SHOW_TRANS_STMT:
|
|
case QUERY_NODE_SHOW_SMAS_STMT:
|
|
case QUERY_NODE_SHOW_CONFIGS_STMT:
|
|
case QUERY_NODE_SHOW_QUERIES_STMT:
|
|
case QUERY_NODE_SHOW_VNODES_STMT:
|
|
case QUERY_NODE_SHOW_APPS_STMT:
|
|
case QUERY_NODE_SHOW_SCORES_STMT:
|
|
case QUERY_NODE_SHOW_VARIABLE_STMT:
|
|
case QUERY_NODE_SHOW_CREATE_DATABASE_STMT:
|
|
case QUERY_NODE_SHOW_CREATE_TABLE_STMT:
|
|
case QUERY_NODE_SHOW_CREATE_STABLE_STMT:
|
|
return makeNode(type, sizeof(SShowStmt));
|
|
case QUERY_NODE_KILL_CONNECTION_STMT:
|
|
case QUERY_NODE_KILL_QUERY_STMT:
|
|
return makeNode(type, sizeof(SKillStmt));
|
|
case QUERY_NODE_LOGIC_PLAN_SCAN:
|
|
return makeNode(type, sizeof(SScanLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_JOIN:
|
|
return makeNode(type, sizeof(SJoinLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_AGG:
|
|
return makeNode(type, sizeof(SAggLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_PROJECT:
|
|
return makeNode(type, sizeof(SProjectLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_VNODE_MODIF:
|
|
return makeNode(type, sizeof(SVnodeModifLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_EXCHANGE:
|
|
return makeNode(type, sizeof(SExchangeLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_WINDOW:
|
|
return makeNode(type, sizeof(SWindowLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_SORT:
|
|
return makeNode(type, sizeof(SSortLogicNode));
|
|
case QUERY_NODE_LOGIC_PLAN_PARTITION:
|
|
return makeNode(type, sizeof(SPartitionLogicNode));
|
|
case QUERY_NODE_LOGIC_SUBPLAN:
|
|
return makeNode(type, sizeof(SLogicSubplan));
|
|
case QUERY_NODE_LOGIC_PLAN:
|
|
return makeNode(type, sizeof(SQueryLogicPlan));
|
|
case QUERY_NODE_PHYSICAL_PLAN_TAG_SCAN:
|
|
return makeNode(type, sizeof(STagScanPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SCAN:
|
|
return makeNode(type, sizeof(STableScanPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SEQ_SCAN:
|
|
return makeNode(type, sizeof(STableSeqScanPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_STREAM_SCAN:
|
|
return makeNode(type, sizeof(SStreamScanPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_SYSTABLE_SCAN:
|
|
return makeNode(type, sizeof(SSystemTableScanPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_PROJECT:
|
|
return makeNode(type, sizeof(SProjectPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_JOIN:
|
|
return makeNode(type, sizeof(SJoinPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_AGG:
|
|
return makeNode(type, sizeof(SAggPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_EXCHANGE:
|
|
return makeNode(type, sizeof(SExchangePhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_SORT:
|
|
return makeNode(type, sizeof(SSortPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_INTERVAL:
|
|
return makeNode(type, sizeof(SIntervalPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_SESSION_WINDOW:
|
|
return makeNode(type, sizeof(SSessionWinodwPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_STATE_WINDOW:
|
|
return makeNode(type, sizeof(SStateWinodwPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_PARTITION:
|
|
return makeNode(type, sizeof(SPartitionPhysiNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_DISPATCH:
|
|
return makeNode(type, sizeof(SDataDispatcherNode));
|
|
case QUERY_NODE_PHYSICAL_PLAN_INSERT:
|
|
return makeNode(type, sizeof(SDataInserterNode));
|
|
case QUERY_NODE_PHYSICAL_SUBPLAN:
|
|
return makeNode(type, sizeof(SSubplan));
|
|
case QUERY_NODE_PHYSICAL_PLAN:
|
|
return makeNode(type, sizeof(SQueryPlan));
|
|
default:
|
|
break;
|
|
}
|
|
nodesError("nodesMakeNode unknown node = %s", nodesNodeName(type));
|
|
return NULL;
|
|
}
|
|
|
|
static void destroyVgDataBlockArray(SArray* pArray) {
|
|
size_t size = taosArrayGetSize(pArray);
|
|
for (size_t i = 0; i < size; ++i) {
|
|
SVgDataBlocks* pVg = taosArrayGetP(pArray, i);
|
|
taosMemoryFreeClear(pVg->pData);
|
|
taosMemoryFreeClear(pVg);
|
|
}
|
|
taosArrayDestroy(pArray);
|
|
}
|
|
|
|
static void destroyLogicNode(SLogicNode* pNode) {
|
|
nodesDestroyList(pNode->pChildren);
|
|
nodesDestroyNode(pNode->pConditions);
|
|
nodesDestroyList(pNode->pTargets);
|
|
}
|
|
|
|
static void destroyPhysiNode(SPhysiNode* pNode) {
|
|
nodesDestroyList(pNode->pChildren);
|
|
nodesDestroyNode(pNode->pConditions);
|
|
nodesDestroyNode(pNode->pOutputDataBlockDesc);
|
|
}
|
|
|
|
static void destroyWinodwPhysiNode(SWinodwPhysiNode* pNode) {
|
|
destroyPhysiNode((SPhysiNode*)pNode);
|
|
nodesDestroyList(pNode->pExprs);
|
|
nodesDestroyList(pNode->pFuncs);
|
|
nodesDestroyNode(pNode->pTspk);
|
|
}
|
|
|
|
static void destroyScanPhysiNode(SScanPhysiNode* pNode) {
|
|
destroyPhysiNode((SPhysiNode*)pNode);
|
|
nodesDestroyList(pNode->pScanCols);
|
|
}
|
|
|
|
static void destroyDataSinkNode(SDataSinkNode* pNode) { nodesDestroyNode(pNode->pInputDataBlockDesc); }
|
|
|
|
void nodesDestroyNode(SNodeptr pNode) {
|
|
if (NULL == pNode) {
|
|
return;
|
|
}
|
|
|
|
switch (nodeType(pNode)) {
|
|
case QUERY_NODE_COLUMN: // pProjectRef is weak reference, no need to release
|
|
break;
|
|
case QUERY_NODE_VALUE: {
|
|
SValueNode* pValue = (SValueNode*)pNode;
|
|
taosMemoryFreeClear(pValue->literal);
|
|
if (IS_VAR_DATA_TYPE(pValue->node.resType.type)) {
|
|
taosMemoryFreeClear(pValue->datum.p);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_OPERATOR: {
|
|
SOperatorNode* pOp = (SOperatorNode*)pNode;
|
|
nodesDestroyNode(pOp->pLeft);
|
|
nodesDestroyNode(pOp->pRight);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_CONDITION:
|
|
nodesDestroyList(((SLogicConditionNode*)pNode)->pParameterList);
|
|
break;
|
|
case QUERY_NODE_FUNCTION:
|
|
nodesDestroyList(((SFunctionNode*)pNode)->pParameterList);
|
|
break;
|
|
case QUERY_NODE_REAL_TABLE: {
|
|
SRealTableNode* pReal = (SRealTableNode*)pNode;
|
|
taosMemoryFreeClear(pReal->pMeta);
|
|
taosMemoryFreeClear(pReal->pVgroupList);
|
|
break;
|
|
}
|
|
case QUERY_NODE_TEMP_TABLE:
|
|
nodesDestroyNode(((STempTableNode*)pNode)->pSubquery);
|
|
break;
|
|
case QUERY_NODE_JOIN_TABLE: {
|
|
SJoinTableNode* pJoin = (SJoinTableNode*)pNode;
|
|
nodesDestroyNode(pJoin->pLeft);
|
|
nodesDestroyNode(pJoin->pRight);
|
|
nodesDestroyNode(pJoin->pOnCond);
|
|
break;
|
|
}
|
|
case QUERY_NODE_GROUPING_SET:
|
|
nodesDestroyList(((SGroupingSetNode*)pNode)->pParameterList);
|
|
break;
|
|
case QUERY_NODE_ORDER_BY_EXPR:
|
|
nodesDestroyNode(((SOrderByExprNode*)pNode)->pExpr);
|
|
break;
|
|
case QUERY_NODE_LIMIT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_STATE_WINDOW:
|
|
nodesDestroyNode(((SStateWindowNode*)pNode)->pExpr);
|
|
break;
|
|
case QUERY_NODE_SESSION_WINDOW: {
|
|
SSessionWindowNode* pSession = (SSessionWindowNode*)pNode;
|
|
nodesDestroyNode(pSession->pCol);
|
|
nodesDestroyNode(pSession->pGap);
|
|
break;
|
|
}
|
|
case QUERY_NODE_INTERVAL_WINDOW: {
|
|
SIntervalWindowNode* pJoin = (SIntervalWindowNode*)pNode;
|
|
nodesDestroyNode(pJoin->pCol);
|
|
nodesDestroyNode(pJoin->pInterval);
|
|
nodesDestroyNode(pJoin->pOffset);
|
|
nodesDestroyNode(pJoin->pSliding);
|
|
nodesDestroyNode(pJoin->pFill);
|
|
break;
|
|
}
|
|
case QUERY_NODE_NODE_LIST:
|
|
nodesDestroyList(((SNodeListNode*)pNode)->pNodeList);
|
|
break;
|
|
case QUERY_NODE_FILL:
|
|
nodesDestroyNode(((SFillNode*)pNode)->pValues);
|
|
break;
|
|
case QUERY_NODE_RAW_EXPR:
|
|
nodesDestroyNode(((SRawExprNode*)pNode)->pNode);
|
|
break;
|
|
case QUERY_NODE_TARGET:
|
|
nodesDestroyNode(((STargetNode*)pNode)->pExpr);
|
|
break;
|
|
case QUERY_NODE_DATABLOCK_DESC:
|
|
nodesDestroyList(((SDataBlockDescNode*)pNode)->pSlots);
|
|
break;
|
|
case QUERY_NODE_SLOT_DESC: // no pointer field
|
|
case QUERY_NODE_COLUMN_DEF: // no pointer field
|
|
case QUERY_NODE_DOWNSTREAM_SOURCE: // no pointer field
|
|
break;
|
|
case QUERY_NODE_DATABASE_OPTIONS: {
|
|
SDatabaseOptions* pOptions = (SDatabaseOptions*)pNode;
|
|
nodesDestroyNode(pOptions->pDaysPerFile);
|
|
nodesDestroyList(pOptions->pKeep);
|
|
nodesDestroyList(pOptions->pRetentions);
|
|
break;
|
|
}
|
|
case QUERY_NODE_TABLE_OPTIONS: {
|
|
STableOptions* pOptions = (STableOptions*)pNode;
|
|
nodesDestroyList(pOptions->pSma);
|
|
nodesDestroyList(pOptions->pRollupFuncs);
|
|
break;
|
|
}
|
|
case QUERY_NODE_INDEX_OPTIONS: {
|
|
SIndexOptions* pOptions = (SIndexOptions*)pNode;
|
|
nodesDestroyList(pOptions->pFuncs);
|
|
nodesDestroyNode(pOptions->pInterval);
|
|
nodesDestroyNode(pOptions->pOffset);
|
|
nodesDestroyNode(pOptions->pSliding);
|
|
break;
|
|
}
|
|
case QUERY_NODE_SET_OPERATOR: {
|
|
SSetOperator* pStmt = (SSetOperator*)pNode;
|
|
nodesDestroyNode(pStmt->pLeft);
|
|
nodesDestroyNode(pStmt->pRight);
|
|
nodesDestroyList(pStmt->pOrderByList);
|
|
nodesDestroyNode(pStmt->pLimit);
|
|
break;
|
|
}
|
|
case QUERY_NODE_SELECT_STMT: {
|
|
SSelectStmt* pStmt = (SSelectStmt*)pNode;
|
|
nodesDestroyList(pStmt->pProjectionList);
|
|
nodesDestroyNode(pStmt->pFromTable);
|
|
nodesDestroyNode(pStmt->pWhere);
|
|
nodesDestroyList(pStmt->pPartitionByList);
|
|
nodesDestroyNode(pStmt->pWindow);
|
|
nodesDestroyList(pStmt->pGroupByList);
|
|
nodesDestroyNode(pStmt->pHaving);
|
|
nodesDestroyList(pStmt->pOrderByList);
|
|
nodesDestroyNode(pStmt->pLimit);
|
|
nodesDestroyNode(pStmt->pSlimit);
|
|
break;
|
|
}
|
|
case QUERY_NODE_VNODE_MODIF_STMT:
|
|
destroyVgDataBlockArray(((SVnodeModifOpStmt*)pNode)->pDataBlocks);
|
|
break;
|
|
case QUERY_NODE_CREATE_DATABASE_STMT:
|
|
nodesDestroyNode(((SCreateDatabaseStmt*)pNode)->pOptions);
|
|
break;
|
|
case QUERY_NODE_DROP_DATABASE_STMT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_ALTER_DATABASE_STMT:
|
|
nodesDestroyNode(((SAlterDatabaseStmt*)pNode)->pOptions);
|
|
break;
|
|
case QUERY_NODE_CREATE_TABLE_STMT: {
|
|
SCreateTableStmt* pStmt = (SCreateTableStmt*)pNode;
|
|
nodesDestroyList(pStmt->pCols);
|
|
nodesDestroyList(pStmt->pTags);
|
|
nodesDestroyNode(pStmt->pOptions);
|
|
break;
|
|
}
|
|
case QUERY_NODE_CREATE_SUBTABLE_CLAUSE: {
|
|
SCreateSubTableClause* pStmt = (SCreateSubTableClause*)pNode;
|
|
nodesDestroyList(pStmt->pSpecificTags);
|
|
nodesDestroyList(pStmt->pValsOfTags);
|
|
break;
|
|
}
|
|
case QUERY_NODE_CREATE_MULTI_TABLE_STMT:
|
|
nodesDestroyList(((SCreateMultiTableStmt*)pNode)->pSubTables);
|
|
break;
|
|
case QUERY_NODE_DROP_TABLE_CLAUSE: // no pointer field
|
|
break;
|
|
case QUERY_NODE_DROP_TABLE_STMT:
|
|
nodesDestroyNode(((SDropTableStmt*)pNode)->pTables);
|
|
break;
|
|
case QUERY_NODE_DROP_SUPER_TABLE_STMT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_ALTER_TABLE_STMT: {
|
|
SAlterTableStmt* pStmt = (SAlterTableStmt*)pNode;
|
|
nodesDestroyNode(pStmt->pOptions);
|
|
nodesDestroyNode(pStmt->pVal);
|
|
break;
|
|
}
|
|
case QUERY_NODE_CREATE_USER_STMT: // no pointer field
|
|
case QUERY_NODE_ALTER_USER_STMT: // no pointer field
|
|
case QUERY_NODE_DROP_USER_STMT: // no pointer field
|
|
case QUERY_NODE_USE_DATABASE_STMT: // no pointer field
|
|
case QUERY_NODE_CREATE_DNODE_STMT: // no pointer field
|
|
case QUERY_NODE_DROP_DNODE_STMT: // no pointer field
|
|
case QUERY_NODE_ALTER_DNODE_STMT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_CREATE_INDEX_STMT: {
|
|
SCreateIndexStmt* pStmt = (SCreateIndexStmt*)pNode;
|
|
nodesDestroyNode(pStmt->pOptions);
|
|
nodesDestroyList(pStmt->pCols);
|
|
break;
|
|
}
|
|
case QUERY_NODE_DROP_INDEX_STMT: // no pointer field
|
|
case QUERY_NODE_CREATE_QNODE_STMT: // no pointer field
|
|
case QUERY_NODE_DROP_QNODE_STMT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_CREATE_TOPIC_STMT:
|
|
nodesDestroyNode(((SCreateTopicStmt*)pNode)->pQuery);
|
|
break;
|
|
case QUERY_NODE_DROP_TOPIC_STMT: // no pointer field
|
|
case QUERY_NODE_ALTER_LOCAL_STMT: // no pointer field
|
|
break;
|
|
case QUERY_NODE_SHOW_DATABASES_STMT:
|
|
case QUERY_NODE_SHOW_TABLES_STMT:
|
|
case QUERY_NODE_SHOW_STABLES_STMT:
|
|
case QUERY_NODE_SHOW_USERS_STMT:
|
|
case QUERY_NODE_SHOW_DNODES_STMT:
|
|
case QUERY_NODE_SHOW_VGROUPS_STMT:
|
|
case QUERY_NODE_SHOW_MNODES_STMT:
|
|
case QUERY_NODE_SHOW_MODULES_STMT:
|
|
case QUERY_NODE_SHOW_QNODES_STMT:
|
|
case QUERY_NODE_SHOW_FUNCTIONS_STMT:
|
|
case QUERY_NODE_SHOW_INDEXES_STMT:
|
|
case QUERY_NODE_SHOW_STREAMS_STMT: {
|
|
SShowStmt* pStmt = (SShowStmt*)pNode;
|
|
nodesDestroyNode(pStmt->pDbName);
|
|
nodesDestroyNode(pStmt->pTbNamePattern);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_SCAN: {
|
|
SScanLogicNode* pLogicNode = (SScanLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pScanCols);
|
|
taosMemoryFreeClear(pLogicNode->pMeta);
|
|
taosMemoryFreeClear(pLogicNode->pVgroupList);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_JOIN: {
|
|
SJoinLogicNode* pLogicNode = (SJoinLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyNode(pLogicNode->pOnConditions);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_AGG: {
|
|
SAggLogicNode* pLogicNode = (SAggLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pAggFuncs);
|
|
nodesDestroyList(pLogicNode->pGroupKeys);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_PROJECT: {
|
|
SProjectLogicNode* pLogicNode = (SProjectLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pProjections);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_VNODE_MODIF: {
|
|
SVnodeModifLogicNode* pLogicNode = (SVnodeModifLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
destroyVgDataBlockArray(pLogicNode->pDataBlocks);
|
|
// pVgDataBlocks is weak reference
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_EXCHANGE:
|
|
destroyLogicNode((SLogicNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_LOGIC_PLAN_WINDOW: {
|
|
SWindowLogicNode* pLogicNode = (SWindowLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pFuncs);
|
|
nodesDestroyNode(pLogicNode->pFill);
|
|
nodesDestroyNode(pLogicNode->pTspk);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_SORT: {
|
|
SSortLogicNode* pLogicNode = (SSortLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pSortKeys);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN_PARTITION: {
|
|
SPartitionLogicNode* pLogicNode = (SPartitionLogicNode*)pNode;
|
|
destroyLogicNode((SLogicNode*)pLogicNode);
|
|
nodesDestroyList(pLogicNode->pPartitionKeys);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_SUBPLAN: {
|
|
SLogicSubplan* pSubplan = (SLogicSubplan*)pNode;
|
|
nodesDestroyList(pSubplan->pChildren);
|
|
nodesDestroyNode(pSubplan->pNode);
|
|
nodesClearList(pSubplan->pParents);
|
|
taosMemoryFreeClear(pSubplan->pVgroupList);
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_PLAN:
|
|
nodesDestroyList(((SQueryLogicPlan*)pNode)->pTopSubplans);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TAG_SCAN:
|
|
destroyScanPhysiNode((SScanPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SCAN:
|
|
destroyScanPhysiNode((SScanPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SEQ_SCAN:
|
|
destroyScanPhysiNode((SScanPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_STREAM_SCAN:
|
|
destroyScanPhysiNode((SScanPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_SYSTABLE_SCAN:
|
|
destroyScanPhysiNode((SScanPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_PROJECT: {
|
|
SProjectPhysiNode* pPhyNode = (SProjectPhysiNode*)pNode;
|
|
destroyPhysiNode((SPhysiNode*)pPhyNode);
|
|
nodesDestroyList(pPhyNode->pProjections);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_JOIN: {
|
|
SJoinPhysiNode* pPhyNode = (SJoinPhysiNode*)pNode;
|
|
destroyPhysiNode((SPhysiNode*)pPhyNode);
|
|
nodesDestroyNode(pPhyNode->pOnConditions);
|
|
nodesDestroyList(pPhyNode->pTargets);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_AGG: {
|
|
SAggPhysiNode* pPhyNode = (SAggPhysiNode*)pNode;
|
|
destroyPhysiNode((SPhysiNode*)pPhyNode);
|
|
nodesDestroyList(pPhyNode->pExprs);
|
|
nodesDestroyList(pPhyNode->pAggFuncs);
|
|
nodesDestroyList(pPhyNode->pGroupKeys);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_EXCHANGE: {
|
|
SExchangePhysiNode* pPhyNode = (SExchangePhysiNode*)pNode;
|
|
destroyPhysiNode((SPhysiNode*)pPhyNode);
|
|
nodesDestroyList(pPhyNode->pSrcEndPoints);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_SORT: {
|
|
SSortPhysiNode* pPhyNode = (SSortPhysiNode*)pNode;
|
|
destroyPhysiNode((SPhysiNode*)pPhyNode);
|
|
nodesDestroyNode(pPhyNode->pExprs);
|
|
nodesDestroyNode(pPhyNode->pSortKeys);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_INTERVAL: {
|
|
SIntervalPhysiNode* pPhyNode = (SIntervalPhysiNode*)pNode;
|
|
destroyWinodwPhysiNode((SWinodwPhysiNode*)pPhyNode);
|
|
nodesDestroyNode(pPhyNode->pFill);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_SESSION_WINDOW:
|
|
destroyWinodwPhysiNode((SWinodwPhysiNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_DISPATCH:
|
|
destroyDataSinkNode((SDataSinkNode*)pNode);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_INSERT: {
|
|
SDataInserterNode* pSink = (SDataInserterNode*)pNode;
|
|
destroyDataSinkNode((SDataSinkNode*)pSink);
|
|
taosMemoryFreeClear(pSink->pData);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_SUBPLAN: {
|
|
SSubplan* pSubplan = (SSubplan*)pNode;
|
|
nodesDestroyList(pSubplan->pChildren);
|
|
nodesDestroyNode(pSubplan->pNode);
|
|
nodesDestroyNode(pSubplan->pDataSink);
|
|
nodesClearList(pSubplan->pParents);
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN: {
|
|
SQueryPlan* pPlan = (SQueryPlan*)pNode;
|
|
if (NULL != pPlan->pSubplans) {
|
|
// only need to destroy the top-level subplans, because they will recurse to all the subplans below
|
|
bool first = true;
|
|
SNode* pElement = NULL;
|
|
FOREACH(pElement, pPlan->pSubplans) {
|
|
if (first) {
|
|
first = false;
|
|
nodesDestroyNode(pElement);
|
|
} else {
|
|
nodesClearList(((SNodeListNode*)pElement)->pNodeList);
|
|
taosMemoryFreeClear(pElement);
|
|
}
|
|
}
|
|
nodesClearList(pPlan->pSubplans);
|
|
}
|
|
break;
|
|
}
|
|
default:
|
|
break;
|
|
}
|
|
taosMemoryFreeClear(pNode);
|
|
return;
|
|
}
|
|
|
|
SNodeList* nodesMakeList() {
|
|
SNodeList* p = taosMemoryCalloc(1, sizeof(SNodeList));
|
|
if (NULL == p) {
|
|
return NULL;
|
|
}
|
|
return p;
|
|
}
|
|
|
|
int32_t nodesListAppend(SNodeList* pList, SNodeptr pNode) {
|
|
if (NULL == pList || NULL == pNode) {
|
|
return TSDB_CODE_FAILED;
|
|
}
|
|
SListCell* p = taosMemoryCalloc(1, sizeof(SListCell));
|
|
if (NULL == p) {
|
|
terrno = TSDB_CODE_OUT_OF_MEMORY;
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
p->pNode = pNode;
|
|
if (NULL == pList->pHead) {
|
|
pList->pHead = p;
|
|
}
|
|
if (NULL != pList->pTail) {
|
|
pList->pTail->pNext = p;
|
|
}
|
|
p->pPrev = pList->pTail;
|
|
pList->pTail = p;
|
|
++(pList->length);
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
int32_t nodesListStrictAppend(SNodeList* pList, SNodeptr pNode) {
|
|
if (NULL == pNode) {
|
|
terrno = TSDB_CODE_OUT_OF_MEMORY;
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
int32_t code = nodesListAppend(pList, pNode);
|
|
if (TSDB_CODE_SUCCESS != code) {
|
|
nodesDestroyNode(pNode);
|
|
}
|
|
return code;
|
|
}
|
|
|
|
int32_t nodesListMakeAppend(SNodeList** pList, SNodeptr pNode) {
|
|
if (NULL == *pList) {
|
|
*pList = nodesMakeList();
|
|
if (NULL == *pList) {
|
|
terrno = TSDB_CODE_OUT_OF_MEMORY;
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
}
|
|
return nodesListAppend(*pList, pNode);
|
|
}
|
|
|
|
int32_t nodesListMakeStrictAppend(SNodeList** pList, SNodeptr pNode) {
|
|
if (NULL == *pList) {
|
|
*pList = nodesMakeList();
|
|
if (NULL == *pList) {
|
|
terrno = TSDB_CODE_OUT_OF_MEMORY;
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
}
|
|
return nodesListStrictAppend(*pList, pNode);
|
|
}
|
|
|
|
int32_t nodesListAppendList(SNodeList* pTarget, SNodeList* pSrc) {
|
|
if (NULL == pTarget || NULL == pSrc) {
|
|
return TSDB_CODE_FAILED;
|
|
}
|
|
|
|
if (NULL == pTarget->pHead) {
|
|
pTarget->pHead = pSrc->pHead;
|
|
} else {
|
|
pTarget->pTail->pNext = pSrc->pHead;
|
|
if (NULL != pSrc->pHead) {
|
|
pSrc->pHead->pPrev = pTarget->pTail;
|
|
}
|
|
}
|
|
pTarget->pTail = pSrc->pTail;
|
|
pTarget->length += pSrc->length;
|
|
taosMemoryFreeClear(pSrc);
|
|
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
int32_t nodesListStrictAppendList(SNodeList* pTarget, SNodeList* pSrc) {
|
|
if (NULL == pSrc) {
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
int32_t code = nodesListAppendList(pTarget, pSrc);
|
|
if (TSDB_CODE_SUCCESS != code) {
|
|
nodesDestroyList(pSrc);
|
|
}
|
|
return code;
|
|
}
|
|
|
|
int32_t nodesListPushFront(SNodeList* pList, SNodeptr pNode) {
|
|
if (NULL == pList || NULL == pNode) {
|
|
return TSDB_CODE_FAILED;
|
|
}
|
|
SListCell* p = taosMemoryCalloc(1, sizeof(SListCell));
|
|
if (NULL == p) {
|
|
terrno = TSDB_CODE_OUT_OF_MEMORY;
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
p->pNode = pNode;
|
|
if (NULL != pList->pHead) {
|
|
pList->pHead->pPrev = p;
|
|
p->pNext = pList->pHead;
|
|
}
|
|
pList->pHead = p;
|
|
++(pList->length);
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
SListCell* nodesListErase(SNodeList* pList, SListCell* pCell) {
|
|
if (NULL == pCell->pPrev) {
|
|
pList->pHead = pCell->pNext;
|
|
} else {
|
|
pCell->pPrev->pNext = pCell->pNext;
|
|
}
|
|
if (NULL == pCell->pNext) {
|
|
pList->pTail = pCell->pPrev;
|
|
} else {
|
|
pCell->pNext->pPrev = pCell->pPrev;
|
|
}
|
|
SListCell* pNext = pCell->pNext;
|
|
nodesDestroyNode(pCell->pNode);
|
|
taosMemoryFreeClear(pCell);
|
|
--(pList->length);
|
|
return pNext;
|
|
}
|
|
|
|
void nodesListInsertList(SNodeList* pTarget, SListCell* pPos, SNodeList* pSrc) {
|
|
if (NULL == pTarget || NULL == pPos || NULL == pSrc) {
|
|
return;
|
|
}
|
|
|
|
if (NULL == pPos->pPrev) {
|
|
pTarget->pHead = pSrc->pHead;
|
|
} else {
|
|
pPos->pPrev->pNext = pSrc->pHead;
|
|
}
|
|
pSrc->pHead->pPrev = pPos->pPrev;
|
|
pSrc->pTail->pNext = pPos;
|
|
pPos->pPrev = pSrc->pTail;
|
|
|
|
pTarget->length += pSrc->length;
|
|
taosMemoryFreeClear(pSrc);
|
|
}
|
|
|
|
SNodeptr nodesListGetNode(SNodeList* pList, int32_t index) {
|
|
SNode* node;
|
|
FOREACH(node, pList) {
|
|
if (0 == index--) {
|
|
return node;
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
void nodesDestroyList(SNodeList* pList) {
|
|
if (NULL == pList) {
|
|
return;
|
|
}
|
|
|
|
SListCell* pNext = pList->pHead;
|
|
while (NULL != pNext) {
|
|
pNext = nodesListErase(pList, pNext);
|
|
}
|
|
taosMemoryFreeClear(pList);
|
|
}
|
|
|
|
void nodesClearList(SNodeList* pList) {
|
|
if (NULL == pList) {
|
|
return;
|
|
}
|
|
|
|
SListCell* pNext = pList->pHead;
|
|
while (NULL != pNext) {
|
|
SListCell* tmp = pNext;
|
|
pNext = pNext->pNext;
|
|
taosMemoryFreeClear(tmp);
|
|
}
|
|
taosMemoryFreeClear(pList);
|
|
}
|
|
|
|
void* nodesGetValueFromNode(SValueNode* pNode) {
|
|
switch (pNode->node.resType.type) {
|
|
case TSDB_DATA_TYPE_BOOL:
|
|
return (void*)&pNode->datum.b;
|
|
case TSDB_DATA_TYPE_TINYINT:
|
|
case TSDB_DATA_TYPE_SMALLINT:
|
|
case TSDB_DATA_TYPE_INT:
|
|
case TSDB_DATA_TYPE_BIGINT:
|
|
case TSDB_DATA_TYPE_TIMESTAMP:
|
|
return (void*)&pNode->datum.i;
|
|
case TSDB_DATA_TYPE_UTINYINT:
|
|
case TSDB_DATA_TYPE_USMALLINT:
|
|
case TSDB_DATA_TYPE_UINT:
|
|
case TSDB_DATA_TYPE_UBIGINT:
|
|
return (void*)&pNode->datum.u;
|
|
case TSDB_DATA_TYPE_FLOAT:
|
|
case TSDB_DATA_TYPE_DOUBLE:
|
|
return (void*)&pNode->datum.d;
|
|
case TSDB_DATA_TYPE_NCHAR:
|
|
case TSDB_DATA_TYPE_VARCHAR:
|
|
case TSDB_DATA_TYPE_VARBINARY:
|
|
return (void*)pNode->datum.p;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
char* nodesGetStrValueFromNode(SValueNode* pNode) {
|
|
switch (pNode->node.resType.type) {
|
|
case TSDB_DATA_TYPE_BOOL: {
|
|
void* buf = taosMemoryMalloc(MAX_NUM_STR_SIZE);
|
|
if (NULL == buf) {
|
|
return NULL;
|
|
}
|
|
|
|
sprintf(buf, "%s", pNode->datum.b ? "true" : "false");
|
|
return buf;
|
|
}
|
|
case TSDB_DATA_TYPE_TINYINT:
|
|
case TSDB_DATA_TYPE_SMALLINT:
|
|
case TSDB_DATA_TYPE_INT:
|
|
case TSDB_DATA_TYPE_BIGINT:
|
|
case TSDB_DATA_TYPE_TIMESTAMP: {
|
|
void* buf = taosMemoryMalloc(MAX_NUM_STR_SIZE);
|
|
if (NULL == buf) {
|
|
return NULL;
|
|
}
|
|
|
|
sprintf(buf, "%" PRId64, pNode->datum.i);
|
|
return buf;
|
|
}
|
|
case TSDB_DATA_TYPE_UTINYINT:
|
|
case TSDB_DATA_TYPE_USMALLINT:
|
|
case TSDB_DATA_TYPE_UINT:
|
|
case TSDB_DATA_TYPE_UBIGINT: {
|
|
void* buf = taosMemoryMalloc(MAX_NUM_STR_SIZE);
|
|
if (NULL == buf) {
|
|
return NULL;
|
|
}
|
|
|
|
sprintf(buf, "%" PRIu64, pNode->datum.u);
|
|
return buf;
|
|
}
|
|
case TSDB_DATA_TYPE_FLOAT:
|
|
case TSDB_DATA_TYPE_DOUBLE: {
|
|
void* buf = taosMemoryMalloc(MAX_NUM_STR_SIZE);
|
|
if (NULL == buf) {
|
|
return NULL;
|
|
}
|
|
|
|
sprintf(buf, "%e", pNode->datum.d);
|
|
return buf;
|
|
}
|
|
case TSDB_DATA_TYPE_NCHAR:
|
|
case TSDB_DATA_TYPE_VARCHAR:
|
|
case TSDB_DATA_TYPE_VARBINARY: {
|
|
int32_t bufSize = varDataLen(pNode->datum.p) + 2 + 1;
|
|
void* buf = taosMemoryMalloc(bufSize);
|
|
if (NULL == buf) {
|
|
return NULL;
|
|
}
|
|
|
|
snprintf(buf, bufSize, "'%s'", varDataVal(pNode->datum.p));
|
|
return buf;
|
|
}
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
bool nodesIsExprNode(const SNode* pNode) {
|
|
ENodeType type = nodeType(pNode);
|
|
return (QUERY_NODE_COLUMN == type || QUERY_NODE_VALUE == type || QUERY_NODE_OPERATOR == type ||
|
|
QUERY_NODE_FUNCTION == type);
|
|
}
|
|
|
|
bool nodesIsUnaryOp(const SOperatorNode* pOp) {
|
|
switch (pOp->opType) {
|
|
case OP_TYPE_MINUS:
|
|
case OP_TYPE_IS_NULL:
|
|
case OP_TYPE_IS_NOT_NULL:
|
|
case OP_TYPE_IS_TRUE:
|
|
case OP_TYPE_IS_FALSE:
|
|
case OP_TYPE_IS_UNKNOWN:
|
|
case OP_TYPE_IS_NOT_TRUE:
|
|
case OP_TYPE_IS_NOT_FALSE:
|
|
case OP_TYPE_IS_NOT_UNKNOWN:
|
|
return true;
|
|
default:
|
|
break;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool nodesIsArithmeticOp(const SOperatorNode* pOp) {
|
|
switch (pOp->opType) {
|
|
case OP_TYPE_ADD:
|
|
case OP_TYPE_SUB:
|
|
case OP_TYPE_MULTI:
|
|
case OP_TYPE_DIV:
|
|
case OP_TYPE_MOD:
|
|
return true;
|
|
default:
|
|
break;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool nodesIsComparisonOp(const SOperatorNode* pOp) {
|
|
switch (pOp->opType) {
|
|
case OP_TYPE_GREATER_THAN:
|
|
case OP_TYPE_GREATER_EQUAL:
|
|
case OP_TYPE_LOWER_THAN:
|
|
case OP_TYPE_LOWER_EQUAL:
|
|
case OP_TYPE_EQUAL:
|
|
case OP_TYPE_NOT_EQUAL:
|
|
case OP_TYPE_IN:
|
|
case OP_TYPE_NOT_IN:
|
|
case OP_TYPE_LIKE:
|
|
case OP_TYPE_NOT_LIKE:
|
|
case OP_TYPE_MATCH:
|
|
case OP_TYPE_NMATCH:
|
|
case OP_TYPE_JSON_CONTAINS:
|
|
case OP_TYPE_IS_NULL:
|
|
case OP_TYPE_IS_NOT_NULL:
|
|
case OP_TYPE_IS_TRUE:
|
|
case OP_TYPE_IS_FALSE:
|
|
case OP_TYPE_IS_UNKNOWN:
|
|
case OP_TYPE_IS_NOT_TRUE:
|
|
case OP_TYPE_IS_NOT_FALSE:
|
|
case OP_TYPE_IS_NOT_UNKNOWN:
|
|
return true;
|
|
default:
|
|
break;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool nodesIsJsonOp(const SOperatorNode* pOp) {
|
|
switch (pOp->opType) {
|
|
case OP_TYPE_JSON_GET_VALUE:
|
|
return true;
|
|
default:
|
|
break;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool nodesIsTimeorderQuery(const SNode* pQuery) { return false; }
|
|
|
|
bool nodesIsTimelineQuery(const SNode* pQuery) { return false; }
|
|
|
|
typedef struct SCollectColumnsCxt {
|
|
int32_t errCode;
|
|
const char* pTableAlias;
|
|
ECollectColType collectType;
|
|
SNodeList* pCols;
|
|
SHashObj* pColHash;
|
|
} SCollectColumnsCxt;
|
|
|
|
static EDealRes doCollect(SCollectColumnsCxt* pCxt, SColumnNode* pCol, SNode* pNode) {
|
|
char name[TSDB_TABLE_NAME_LEN + TSDB_COL_NAME_LEN];
|
|
int32_t len = 0;
|
|
if ('\0' == pCol->tableAlias[0]) {
|
|
len = sprintf(name, "%s", pCol->colName);
|
|
}
|
|
len = sprintf(name, "%s.%s", pCol->tableAlias, pCol->colName);
|
|
if (NULL == taosHashGet(pCxt->pColHash, name, len)) {
|
|
pCxt->errCode = taosHashPut(pCxt->pColHash, name, len, NULL, 0);
|
|
if (TSDB_CODE_SUCCESS == pCxt->errCode) {
|
|
pCxt->errCode = nodesListStrictAppend(pCxt->pCols, nodesCloneNode(pNode));
|
|
}
|
|
return (TSDB_CODE_SUCCESS == pCxt->errCode ? DEAL_RES_IGNORE_CHILD : DEAL_RES_ERROR);
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
static bool isCollectType(ECollectColType collectType, EColumnType colType) {
|
|
return COLLECT_COL_TYPE_ALL == collectType
|
|
? true
|
|
: (COLLECT_COL_TYPE_TAG == collectType ? COLUMN_TYPE_TAG == colType : COLUMN_TYPE_TAG != colType);
|
|
}
|
|
|
|
static EDealRes collectColumns(SNode* pNode, void* pContext) {
|
|
SCollectColumnsCxt* pCxt = (SCollectColumnsCxt*)pContext;
|
|
if (QUERY_NODE_COLUMN == nodeType(pNode)) {
|
|
SColumnNode* pCol = (SColumnNode*)pNode;
|
|
if (isCollectType(pCxt->collectType, pCol->colType) &&
|
|
(NULL == pCxt->pTableAlias || 0 == strcmp(pCxt->pTableAlias, pCol->tableAlias))) {
|
|
return doCollect(pCxt, pCol, pNode);
|
|
}
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
int32_t nodesCollectColumns(SSelectStmt* pSelect, ESqlClause clause, const char* pTableAlias, ECollectColType type,
|
|
SNodeList** pCols) {
|
|
if (NULL == pSelect || NULL == pCols) {
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
SCollectColumnsCxt cxt = {
|
|
.errCode = TSDB_CODE_SUCCESS,
|
|
.pTableAlias = pTableAlias,
|
|
.collectType = type,
|
|
.pCols = nodesMakeList(),
|
|
.pColHash = taosHashInit(128, taosGetDefaultHashFunction(TSDB_DATA_TYPE_BINARY), true, HASH_NO_LOCK)};
|
|
if (NULL == cxt.pCols || NULL == cxt.pColHash) {
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
|
|
nodesWalkSelectStmt(pSelect, clause, collectColumns, &cxt);
|
|
taosHashCleanup(cxt.pColHash);
|
|
if (TSDB_CODE_SUCCESS != cxt.errCode) {
|
|
nodesDestroyList(cxt.pCols);
|
|
return cxt.errCode;
|
|
}
|
|
if (0 == LIST_LENGTH(cxt.pCols)) {
|
|
nodesDestroyList(cxt.pCols);
|
|
cxt.pCols = NULL;
|
|
}
|
|
*pCols = cxt.pCols;
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
typedef struct SCollectFuncsCxt {
|
|
int32_t errCode;
|
|
FFuncClassifier classifier;
|
|
SNodeList* pFuncs;
|
|
} SCollectFuncsCxt;
|
|
|
|
static EDealRes collectFuncs(SNode* pNode, void* pContext) {
|
|
SCollectFuncsCxt* pCxt = (SCollectFuncsCxt*)pContext;
|
|
if (QUERY_NODE_FUNCTION == nodeType(pNode) && pCxt->classifier(((SFunctionNode*)pNode)->funcId)) {
|
|
pCxt->errCode = nodesListStrictAppend(pCxt->pFuncs, nodesCloneNode(pNode));
|
|
return (TSDB_CODE_SUCCESS == pCxt->errCode ? DEAL_RES_IGNORE_CHILD : DEAL_RES_ERROR);
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
int32_t nodesCollectFuncs(SSelectStmt* pSelect, FFuncClassifier classifier, SNodeList** pFuncs) {
|
|
if (NULL == pSelect || NULL == pFuncs) {
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
SCollectFuncsCxt cxt = {
|
|
.errCode = TSDB_CODE_SUCCESS, .classifier = classifier, .pFuncs = (NULL == *pFuncs ? nodesMakeList() : *pFuncs)};
|
|
if (NULL == cxt.pFuncs) {
|
|
return TSDB_CODE_OUT_OF_MEMORY;
|
|
}
|
|
*pFuncs = NULL;
|
|
nodesWalkSelectStmt(pSelect, SQL_CLAUSE_GROUP_BY, collectFuncs, &cxt);
|
|
if (TSDB_CODE_SUCCESS != cxt.errCode) {
|
|
nodesDestroyList(cxt.pFuncs);
|
|
return cxt.errCode;
|
|
}
|
|
if (LIST_LENGTH(cxt.pFuncs) > 0) {
|
|
*pFuncs = cxt.pFuncs;
|
|
} else {
|
|
nodesDestroyList(cxt.pFuncs);
|
|
}
|
|
|
|
return TSDB_CODE_SUCCESS;
|
|
}
|
|
|
|
char* getFillModeString(EFillMode mode) {
|
|
switch (mode) {
|
|
case FILL_MODE_NONE:
|
|
return "none";
|
|
case FILL_MODE_VALUE:
|
|
return "value";
|
|
case FILL_MODE_PREV:
|
|
return "prev";
|
|
case FILL_MODE_NULL:
|
|
return "null";
|
|
case FILL_MODE_LINEAR:
|
|
return "linear";
|
|
case FILL_MODE_NEXT:
|
|
return "next";
|
|
default:
|
|
return "unknown";
|
|
}
|
|
}
|
|
|
|
char* nodesGetNameFromColumnNode(SNode* pNode) {
|
|
if (NULL == pNode || QUERY_NODE_COLUMN != pNode->type) {
|
|
return "NULL";
|
|
}
|
|
|
|
return ((SColumnNode*)pNode)->colName;
|
|
}
|
|
|
|
int32_t nodesGetOutputNumFromSlotList(SNodeList* pSlots) {
|
|
if (NULL == pSlots || pSlots->length <= 0) {
|
|
return 0;
|
|
}
|
|
|
|
SNode* pNode = NULL;
|
|
int32_t num = 0;
|
|
FOREACH(pNode, pSlots) {
|
|
if (QUERY_NODE_SLOT_DESC != pNode->type) {
|
|
continue;
|
|
}
|
|
|
|
SSlotDescNode* descNode = (SSlotDescNode*)pNode;
|
|
if (descNode->output) {
|
|
++num;
|
|
}
|
|
}
|
|
|
|
return num;
|
|
}
|
|
|
|
void valueNodeToVariant(const SValueNode* pNode, SVariant* pVal) {
|
|
pVal->nType = pNode->node.resType.type;
|
|
pVal->nLen = pNode->node.resType.bytes;
|
|
switch (pNode->node.resType.type) {
|
|
case TSDB_DATA_TYPE_NULL:
|
|
break;
|
|
case TSDB_DATA_TYPE_BOOL:
|
|
pVal->i = pNode->datum.b;
|
|
break;
|
|
case TSDB_DATA_TYPE_TINYINT:
|
|
case TSDB_DATA_TYPE_SMALLINT:
|
|
case TSDB_DATA_TYPE_INT:
|
|
case TSDB_DATA_TYPE_BIGINT:
|
|
case TSDB_DATA_TYPE_TIMESTAMP:
|
|
pVal->i = pNode->datum.i;
|
|
break;
|
|
case TSDB_DATA_TYPE_UTINYINT:
|
|
case TSDB_DATA_TYPE_USMALLINT:
|
|
case TSDB_DATA_TYPE_UINT:
|
|
case TSDB_DATA_TYPE_UBIGINT:
|
|
pVal->u = pNode->datum.u;
|
|
break;
|
|
case TSDB_DATA_TYPE_FLOAT:
|
|
case TSDB_DATA_TYPE_DOUBLE:
|
|
pVal->d = pNode->datum.d;
|
|
break;
|
|
case TSDB_DATA_TYPE_NCHAR:
|
|
case TSDB_DATA_TYPE_VARCHAR:
|
|
case TSDB_DATA_TYPE_VARBINARY:
|
|
pVal->pz = pNode->datum.p;
|
|
break;
|
|
case TSDB_DATA_TYPE_JSON:
|
|
case TSDB_DATA_TYPE_DECIMAL:
|
|
case TSDB_DATA_TYPE_BLOB:
|
|
// todo
|
|
default:
|
|
break;
|
|
}
|
|
}
|