595 lines
22 KiB
C
595 lines
22 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 "plannodes.h"
|
|
#include "querynodes.h"
|
|
|
|
typedef enum ETraversalOrder {
|
|
TRAVERSAL_PREORDER = 1,
|
|
TRAVERSAL_INORDER,
|
|
TRAVERSAL_POSTORDER,
|
|
} ETraversalOrder;
|
|
|
|
typedef EDealRes (*FNodeDispatcher)(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext);
|
|
|
|
static EDealRes walkExpr(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext);
|
|
static EDealRes walkExprs(SNodeList* pNodeList, ETraversalOrder order, FNodeWalker walker, void* pContext);
|
|
static EDealRes walkPhysiPlan(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext);
|
|
static EDealRes walkPhysiPlans(SNodeList* pNodeList, ETraversalOrder order, FNodeWalker walker, void* pContext);
|
|
|
|
static EDealRes walkNode(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext,
|
|
FNodeDispatcher dispatcher) {
|
|
if (NULL == pNode) {
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
EDealRes res = DEAL_RES_CONTINUE;
|
|
|
|
if (TRAVERSAL_PREORDER == order) {
|
|
res = walker(pNode, pContext);
|
|
if (DEAL_RES_CONTINUE != res) {
|
|
return res;
|
|
}
|
|
}
|
|
|
|
res = dispatcher(pNode, order, walker, pContext);
|
|
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res && TRAVERSAL_POSTORDER == order) {
|
|
res = walker(pNode, pContext);
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
static EDealRes dispatchExpr(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
EDealRes res = DEAL_RES_CONTINUE;
|
|
|
|
switch (nodeType(pNode)) {
|
|
case QUERY_NODE_COLUMN:
|
|
case QUERY_NODE_VALUE:
|
|
case QUERY_NODE_LIMIT:
|
|
// these node types with no subnodes
|
|
break;
|
|
case QUERY_NODE_OPERATOR: {
|
|
SOperatorNode* pOpNode = (SOperatorNode*)pNode;
|
|
res = walkExpr(pOpNode->pLeft, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pOpNode->pRight, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_CONDITION:
|
|
res = walkExprs(((SLogicConditionNode*)pNode)->pParameterList, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_FUNCTION:
|
|
res = walkExprs(((SFunctionNode*)pNode)->pParameterList, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_REAL_TABLE:
|
|
case QUERY_NODE_TEMP_TABLE:
|
|
break; // todo
|
|
case QUERY_NODE_JOIN_TABLE: {
|
|
SJoinTableNode* pJoinTableNode = (SJoinTableNode*)pNode;
|
|
res = walkExpr(pJoinTableNode->pLeft, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pJoinTableNode->pRight, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pJoinTableNode->pOnCond, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_GROUPING_SET:
|
|
res = walkExprs(((SGroupingSetNode*)pNode)->pParameterList, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_ORDER_BY_EXPR:
|
|
res = walkExpr(((SOrderByExprNode*)pNode)->pExpr, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_STATE_WINDOW: {
|
|
SStateWindowNode* pState = (SStateWindowNode*)pNode;
|
|
res = walkExpr(pState->pExpr, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pState->pCol, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_SESSION_WINDOW: {
|
|
SSessionWindowNode* pSession = (SSessionWindowNode*)pNode;
|
|
res = walkExpr((SNode*)pSession->pCol, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr((SNode*)pSession->pGap, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_INTERVAL_WINDOW: {
|
|
SIntervalWindowNode* pInterval = (SIntervalWindowNode*)pNode;
|
|
res = walkExpr(pInterval->pInterval, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pInterval->pOffset, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pInterval->pSliding, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pInterval->pFill, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pInterval->pCol, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_NODE_LIST:
|
|
res = walkExprs(((SNodeListNode*)pNode)->pNodeList, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_FILL: {
|
|
SFillNode* pFill = (SFillNode*)pNode;
|
|
res = walkExpr(pFill->pValues, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkExpr(pFill->pWStartTs, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_RAW_EXPR:
|
|
res = walkExpr(((SRawExprNode*)pNode)->pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_TARGET:
|
|
res = walkExpr(((STargetNode*)pNode)->pExpr, order, walker, pContext);
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
static EDealRes walkExpr(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
return walkNode(pNode, order, walker, pContext, dispatchExpr);
|
|
}
|
|
|
|
static EDealRes walkExprs(SNodeList* pNodeList, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
SNode* node;
|
|
FOREACH(node, pNodeList) {
|
|
EDealRes res = walkExpr(node, order, walker, pContext);
|
|
if (DEAL_RES_ERROR == res || DEAL_RES_END == res) {
|
|
return res;
|
|
}
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
void nodesWalkExpr(SNodeptr pNode, FNodeWalker walker, void* pContext) {
|
|
(void)walkExpr(pNode, TRAVERSAL_PREORDER, walker, pContext);
|
|
}
|
|
|
|
void nodesWalkExprs(SNodeList* pNodeList, FNodeWalker walker, void* pContext) {
|
|
(void)walkExprs(pNodeList, TRAVERSAL_PREORDER, walker, pContext);
|
|
}
|
|
|
|
void nodesWalkExprPostOrder(SNodeptr pNode, FNodeWalker walker, void* pContext) {
|
|
(void)walkExpr(pNode, TRAVERSAL_POSTORDER, walker, pContext);
|
|
}
|
|
|
|
void nodesWalkExprsPostOrder(SNodeList* pList, FNodeWalker walker, void* pContext) {
|
|
(void)walkExprs(pList, TRAVERSAL_POSTORDER, walker, pContext);
|
|
}
|
|
|
|
static EDealRes rewriteExprs(SNodeList* pNodeList, ETraversalOrder order, FNodeRewriter rewriter, void* pContext);
|
|
|
|
static EDealRes rewriteExpr(SNode** pRawNode, ETraversalOrder order, FNodeRewriter rewriter, void* pContext) {
|
|
if (NULL == pRawNode || NULL == *pRawNode) {
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
EDealRes res = DEAL_RES_CONTINUE;
|
|
|
|
if (TRAVERSAL_PREORDER == order) {
|
|
res = rewriter(pRawNode, pContext);
|
|
if (DEAL_RES_CONTINUE != res) {
|
|
return res;
|
|
}
|
|
}
|
|
|
|
SNode* pNode = *pRawNode;
|
|
switch (nodeType(pNode)) {
|
|
case QUERY_NODE_COLUMN:
|
|
case QUERY_NODE_VALUE:
|
|
case QUERY_NODE_LIMIT:
|
|
// these node types with no subnodes
|
|
break;
|
|
case QUERY_NODE_OPERATOR: {
|
|
SOperatorNode* pOpNode = (SOperatorNode*)pNode;
|
|
res = rewriteExpr(&(pOpNode->pLeft), order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pOpNode->pRight), order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_LOGIC_CONDITION:
|
|
res = rewriteExprs(((SLogicConditionNode*)pNode)->pParameterList, order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_FUNCTION:
|
|
res = rewriteExprs(((SFunctionNode*)pNode)->pParameterList, order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_REAL_TABLE:
|
|
case QUERY_NODE_TEMP_TABLE:
|
|
break; // todo
|
|
case QUERY_NODE_JOIN_TABLE: {
|
|
SJoinTableNode* pJoinTableNode = (SJoinTableNode*)pNode;
|
|
res = rewriteExpr(&(pJoinTableNode->pLeft), order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pJoinTableNode->pRight), order, rewriter, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pJoinTableNode->pOnCond), order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_GROUPING_SET:
|
|
res = rewriteExprs(((SGroupingSetNode*)pNode)->pParameterList, order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_ORDER_BY_EXPR:
|
|
res = rewriteExpr(&(((SOrderByExprNode*)pNode)->pExpr), order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_STATE_WINDOW: {
|
|
SStateWindowNode* pState = (SStateWindowNode*)pNode;
|
|
res = rewriteExpr(&pState->pExpr, order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&pState->pCol, order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_SESSION_WINDOW: {
|
|
SSessionWindowNode* pSession = (SSessionWindowNode*)pNode;
|
|
res = rewriteExpr((SNode**)&pSession->pCol, order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr((SNode**)&pSession->pGap, order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_INTERVAL_WINDOW: {
|
|
SIntervalWindowNode* pInterval = (SIntervalWindowNode*)pNode;
|
|
res = rewriteExpr(&(pInterval->pInterval), order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pInterval->pOffset), order, rewriter, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pInterval->pSliding), order, rewriter, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pInterval->pFill), order, rewriter, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pInterval->pCol), order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_NODE_LIST:
|
|
res = rewriteExprs(((SNodeListNode*)pNode)->pNodeList, order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_FILL: {
|
|
SFillNode* pFill = (SFillNode*)pNode;
|
|
res = rewriteExpr(&pFill->pValues, order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = rewriteExpr(&(pFill->pWStartTs), order, rewriter, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_RAW_EXPR:
|
|
res = rewriteExpr(&(((SRawExprNode*)pNode)->pNode), order, rewriter, pContext);
|
|
break;
|
|
case QUERY_NODE_TARGET:
|
|
res = rewriteExpr(&(((STargetNode*)pNode)->pExpr), order, rewriter, pContext);
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res && TRAVERSAL_POSTORDER == order) {
|
|
res = rewriter(pRawNode, pContext);
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
static EDealRes rewriteExprs(SNodeList* pNodeList, ETraversalOrder order, FNodeRewriter rewriter, void* pContext) {
|
|
SNode** pNode;
|
|
FOREACH_FOR_REWRITE(pNode, pNodeList) {
|
|
EDealRes res = rewriteExpr(pNode, order, rewriter, pContext);
|
|
if (DEAL_RES_ERROR == res || DEAL_RES_END == res) {
|
|
return res;
|
|
}
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
void nodesRewriteExpr(SNode** pNode, FNodeRewriter rewriter, void* pContext) {
|
|
(void)rewriteExpr(pNode, TRAVERSAL_PREORDER, rewriter, pContext);
|
|
}
|
|
|
|
void nodesRewriteExprs(SNodeList* pList, FNodeRewriter rewriter, void* pContext) {
|
|
(void)rewriteExprs(pList, TRAVERSAL_PREORDER, rewriter, pContext);
|
|
}
|
|
|
|
void nodesRewriteExprPostOrder(SNode** pNode, FNodeRewriter rewriter, void* pContext) {
|
|
(void)rewriteExpr(pNode, TRAVERSAL_POSTORDER, rewriter, pContext);
|
|
}
|
|
|
|
void nodesRewriteExprsPostOrder(SNodeList* pList, FNodeRewriter rewriter, void* pContext) {
|
|
(void)rewriteExprs(pList, TRAVERSAL_POSTORDER, rewriter, pContext);
|
|
}
|
|
|
|
void nodesWalkSelectStmt(SSelectStmt* pSelect, ESqlClause clause, FNodeWalker walker, void* pContext) {
|
|
if (NULL == pSelect) {
|
|
return;
|
|
}
|
|
|
|
switch (clause) {
|
|
case SQL_CLAUSE_FROM:
|
|
nodesWalkExpr(pSelect->pFromTable, walker, pContext);
|
|
nodesWalkExpr(pSelect->pWhere, walker, pContext);
|
|
case SQL_CLAUSE_WHERE:
|
|
nodesWalkExprs(pSelect->pPartitionByList, walker, pContext);
|
|
case SQL_CLAUSE_PARTITION_BY:
|
|
nodesWalkExpr(pSelect->pWindow, walker, pContext);
|
|
case SQL_CLAUSE_WINDOW:
|
|
if (NULL != pSelect->pWindow && QUERY_NODE_INTERVAL_WINDOW == nodeType(pSelect->pWindow)) {
|
|
nodesWalkExpr(((SIntervalWindowNode*)pSelect->pWindow)->pFill, walker, pContext);
|
|
}
|
|
nodesWalkExprs(pSelect->pGroupByList, walker, pContext);
|
|
case SQL_CLAUSE_GROUP_BY:
|
|
nodesWalkExpr(pSelect->pHaving, walker, pContext);
|
|
case SQL_CLAUSE_HAVING:
|
|
case SQL_CLAUSE_DISTINCT:
|
|
nodesWalkExprs(pSelect->pOrderByList, walker, pContext);
|
|
case SQL_CLAUSE_ORDER_BY:
|
|
nodesWalkExprs(pSelect->pProjectionList, walker, pContext);
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
void nodesRewriteSelectStmt(SSelectStmt* pSelect, ESqlClause clause, FNodeRewriter rewriter, void* pContext) {
|
|
if (NULL == pSelect) {
|
|
return;
|
|
}
|
|
|
|
switch (clause) {
|
|
case SQL_CLAUSE_FROM:
|
|
nodesRewriteExpr(&(pSelect->pFromTable), rewriter, pContext);
|
|
nodesRewriteExpr(&(pSelect->pWhere), rewriter, pContext);
|
|
case SQL_CLAUSE_WHERE:
|
|
nodesRewriteExprs(pSelect->pPartitionByList, rewriter, pContext);
|
|
case SQL_CLAUSE_PARTITION_BY:
|
|
nodesRewriteExpr(&(pSelect->pWindow), rewriter, pContext);
|
|
case SQL_CLAUSE_WINDOW:
|
|
if (NULL != pSelect->pWindow && QUERY_NODE_INTERVAL_WINDOW == nodeType(pSelect->pWindow)) {
|
|
nodesRewriteExpr(&(((SIntervalWindowNode*)pSelect->pWindow)->pFill), rewriter, pContext);
|
|
}
|
|
nodesRewriteExprs(pSelect->pGroupByList, rewriter, pContext);
|
|
case SQL_CLAUSE_GROUP_BY:
|
|
nodesRewriteExpr(&(pSelect->pHaving), rewriter, pContext);
|
|
case SQL_CLAUSE_HAVING:
|
|
case SQL_CLAUSE_DISTINCT:
|
|
nodesRewriteExprs(pSelect->pOrderByList, rewriter, pContext);
|
|
case SQL_CLAUSE_ORDER_BY:
|
|
nodesRewriteExprs(pSelect->pProjectionList, rewriter, pContext);
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
static EDealRes walkPhysiNode(SPhysiNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
EDealRes res = walkPhysiPlan((SNode*)pNode->pOutputDataBlockDesc, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan(pNode->pConditions, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pNode->pChildren, order, walker, pContext);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
static EDealRes walkScanPhysi(SScanPhysiNode* pScan, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
EDealRes res = walkPhysiNode((SPhysiNode*)pScan, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pScan->pScanCols, order, walker, pContext);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
static EDealRes walkTableScanPhysi(STableScanPhysiNode* pScan, ETraversalOrder order, FNodeWalker walker,
|
|
void* pContext) {
|
|
EDealRes res = walkScanPhysi((SScanPhysiNode*)pScan, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pScan->pDynamicScanFuncs, order, walker, pContext);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
static EDealRes walkWindowPhysi(SWinodwPhysiNode* pWindow, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
EDealRes res = walkPhysiNode((SPhysiNode*)pWindow, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pWindow->pExprs, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pWindow->pFuncs, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan(pWindow->pTspk, order, walker, pContext);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
static EDealRes dispatchPhysiPlan(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
EDealRes res = DEAL_RES_CONTINUE;
|
|
|
|
switch (nodeType(pNode)) {
|
|
case QUERY_NODE_NODE_LIST:
|
|
res = walkPhysiPlans(((SNodeListNode*)pNode)->pNodeList, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TAG_SCAN:
|
|
res = walkScanPhysi((SScanPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SCAN:
|
|
res = walkTableScanPhysi((STableScanPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_TABLE_SEQ_SCAN:
|
|
res = walkTableScanPhysi((STableScanPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_STREAM_SCAN:
|
|
res = walkScanPhysi((SScanPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_SYSTABLE_SCAN:
|
|
res = walkScanPhysi((SScanPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_PROJECT: {
|
|
SProjectPhysiNode* pProject = (SProjectPhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pProject->pProjections, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_JOIN: {
|
|
SJoinPhysiNode* pJoin = (SJoinPhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan(pJoin->pOnConditions, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pJoin->pTargets, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_AGG: {
|
|
SAggPhysiNode* pAgg = (SAggPhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pAgg->pExprs, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pAgg->pGroupKeys, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pAgg->pAggFuncs, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_EXCHANGE: {
|
|
SExchangePhysiNode* pExchange = (SExchangePhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pExchange->pSrcEndPoints, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_SORT: {
|
|
SSortPhysiNode* pSort = (SSortPhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pSort->pExprs, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pSort->pSortKeys, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pSort->pTargets, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_INTERVAL:
|
|
case QUERY_NODE_PHYSICAL_PLAN_STREAM_INTERVAL:
|
|
res = walkWindowPhysi((SWinodwPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_SESSION_WINDOW:
|
|
res = walkWindowPhysi((SWinodwPhysiNode*)pNode, order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_STATE_WINDOW: {
|
|
SStateWinodwPhysiNode* pState = (SStateWinodwPhysiNode*)pNode;
|
|
res = walkWindowPhysi((SWinodwPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan(pState->pStateKey, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_PARTITION: {
|
|
SPartitionPhysiNode* pPart = (SPartitionPhysiNode*)pNode;
|
|
res = walkPhysiNode((SPhysiNode*)pNode, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pPart->pExprs, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pPart->pPartitionKeys, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlans(pPart->pTargets, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN_DISPATCH:
|
|
res = walkPhysiPlan((SNode*)(((SDataSinkNode*)pNode)->pInputDataBlockDesc), order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_PLAN_INSERT:
|
|
res = walkPhysiPlan((SNode*)(((SDataSinkNode*)pNode)->pInputDataBlockDesc), order, walker, pContext);
|
|
break;
|
|
case QUERY_NODE_PHYSICAL_SUBPLAN: {
|
|
SSubplan* pSubplan = (SSubplan*)pNode;
|
|
res = walkPhysiPlans(pSubplan->pChildren, order, walker, pContext);
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan((SNode*)pSubplan->pNode, order, walker, pContext);
|
|
}
|
|
if (DEAL_RES_ERROR != res && DEAL_RES_END != res) {
|
|
res = walkPhysiPlan((SNode*)pSubplan->pDataSink, order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
case QUERY_NODE_PHYSICAL_PLAN: {
|
|
SQueryPlan* pPlan = (SQueryPlan*)pNode;
|
|
if (NULL != pPlan->pSubplans) {
|
|
// only need to walk the top-level subplans, because they will recurse to all the subplans below
|
|
walkPhysiPlan(nodesListGetNode(pPlan->pSubplans, 0), order, walker, pContext);
|
|
}
|
|
break;
|
|
}
|
|
default:
|
|
res = dispatchExpr(pNode, order, walker, pContext);
|
|
break;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
static EDealRes walkPhysiPlan(SNode* pNode, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
return walkNode(pNode, order, walker, pContext, dispatchPhysiPlan);
|
|
}
|
|
|
|
static EDealRes walkPhysiPlans(SNodeList* pNodeList, ETraversalOrder order, FNodeWalker walker, void* pContext) {
|
|
SNode* node;
|
|
FOREACH(node, pNodeList) {
|
|
EDealRes res = walkPhysiPlan(node, order, walker, pContext);
|
|
if (DEAL_RES_ERROR == res || DEAL_RES_END == res) {
|
|
return res;
|
|
}
|
|
}
|
|
return DEAL_RES_CONTINUE;
|
|
}
|
|
|
|
void nodesWalkPhysiPlan(SNode* pNode, FNodeWalker walker, void* pContext) {
|
|
(void)walkPhysiPlan(pNode, TRAVERSAL_PREORDER, walker, pContext);
|
|
}
|