planner.c 4.0 KB
Newer Older
H
Hongze Cheng 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 * 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/>.
14 15
 */

X
Xiaoyu Wang 已提交
16
#include "planner.h"
17

X
Xiaoyu Wang 已提交
18
#include "planInt.h"
X
Xiaoyu Wang 已提交
19
#include "scalar.h"
X
Xiaoyu Wang 已提交
20

X
Xiaoyu Wang 已提交
21 22 23 24 25 26 27
static void dumpQueryPlan(SQueryPlan* pPlan) {
  char* pStr = NULL;
  nodesNodeToString(pPlan, false, &pStr, NULL);
  planDebugL("Query Plan: %s", pStr);
  taosMemoryFree(pStr);
}

28
int32_t qCreateQueryPlan(SPlanContext* pCxt, SQueryPlan** pPlan, SArray* pExecNodeList) {
X
Xiaoyu Wang 已提交
29 30
  SLogicNode*      pLogicNode = NULL;
  SLogicSubplan*   pLogicSubplan = NULL;
X
Xiaoyu Wang 已提交
31 32
  SQueryLogicPlan* pLogicPlan = NULL;

X
Xiaoyu Wang 已提交
33 34
  int32_t code = createLogicPlan(pCxt, &pLogicNode);
  if (TSDB_CODE_SUCCESS == code) {
X
Xiaoyu Wang 已提交
35
    code = optimizeLogicPlan(pCxt, pLogicNode);
X
Xiaoyu Wang 已提交
36
  }
X
Xiaoyu Wang 已提交
37 38
  if (TSDB_CODE_SUCCESS == code) {
    code = splitLogicPlan(pCxt, pLogicNode, &pLogicSubplan);
X
Xiaoyu Wang 已提交
39 40
  }
  if (TSDB_CODE_SUCCESS == code) {
X
Xiaoyu Wang 已提交
41
    code = scaleOutLogicPlan(pCxt, pLogicSubplan, &pLogicPlan);
X
Xiaoyu Wang 已提交
42
  }
X
Xiaoyu Wang 已提交
43 44 45
  if (TSDB_CODE_SUCCESS == code) {
    code = createPhysiPlan(pCxt, pLogicPlan, pPlan, pExecNodeList);
  }
X
Xiaoyu Wang 已提交
46 47 48
  if (TSDB_CODE_SUCCESS == code) {
    dumpQueryPlan(*pPlan);
  }
X
Xiaoyu Wang 已提交
49

50
  nodesDestroyNode(pLogicNode);
X
Xiaoyu Wang 已提交
51 52
  nodesDestroyNode(pLogicSubplan);
  nodesDestroyNode(pLogicPlan);
X
Xiaoyu Wang 已提交
53
  terrno = code;
X
Xiaoyu Wang 已提交
54
  return code;
55 56
}

X
Xiaoyu Wang 已提交
57 58 59 60
static int32_t setSubplanExecutionNode(SPhysiNode* pNode, int32_t groupId, SDownstreamSourceNode* pSource) {
  if (QUERY_NODE_PHYSICAL_PLAN_EXCHANGE == nodeType(pNode)) {
    SExchangePhysiNode* pExchange = (SExchangePhysiNode*)pNode;
    if (pExchange->srcGroupId == groupId) {
X
Xiaoyu Wang 已提交
61 62 63 64 65 66 67 68 69 70 71
      return nodesListMakeStrictAppend(&pExchange->pSrcEndPoints, nodesCloneNode(pSource));
    }
  } else if (QUERY_NODE_PHYSICAL_PLAN_MERGE == nodeType(pNode)) {
    SMergePhysiNode* pMerge = (SMergePhysiNode*)pNode;
    if (pMerge->srcGroupId == groupId) {
      SExchangePhysiNode* pExchange =
          (SExchangePhysiNode*)nodesListGetNode(pMerge->node.pChildren, pMerge->numOfChannels - 1);
      if (1 == pMerge->numOfChannels) {
        pMerge->numOfChannels = LIST_LENGTH(pMerge->node.pChildren);
      } else {
        --(pMerge->numOfChannels);
X
Xiaoyu Wang 已提交
72
      }
X
Xiaoyu Wang 已提交
73
      return nodesListMakeStrictAppend(&pExchange->pSrcEndPoints, nodesCloneNode(pSource));
X
Xiaoyu Wang 已提交
74 75 76 77 78 79 80 81 82 83 84
    }
  }

  SNode* pChild = NULL;
  FOREACH(pChild, pNode->pChildren) {
    if (TSDB_CODE_SUCCESS != setSubplanExecutionNode((SPhysiNode*)pChild, groupId, pSource)) {
      return TSDB_CODE_OUT_OF_MEMORY;
    }
  }
  return TSDB_CODE_SUCCESS;
}
H
Haojun Liao 已提交
85

X
Xiaoyu Wang 已提交
86 87
int32_t qSetSubplanExecutionNode(SSubplan* subplan, int32_t groupId, SDownstreamSourceNode* pSource) {
  return setSubplanExecutionNode(subplan->pNode, groupId, pSource);
X
Xiaoyu Wang 已提交
88
}
H
Haojun Liao 已提交
89

X
Xiaoyu Wang 已提交
90 91 92 93 94
int32_t qSubPlanToString(const SSubplan* pSubplan, char** pStr, int32_t* pLen) {
  if (SUBPLAN_TYPE_MODIFY == pSubplan->subplanType) {
    SDataInserterNode* insert = (SDataInserterNode*)pSubplan->pDataSink;
    *pLen = insert->size;
    *pStr = insert->pData;
95 96 97
    insert->pData = NULL;
    return TSDB_CODE_SUCCESS;
  }
X
Xiaoyu Wang 已提交
98
  return nodesNodeToString((const SNode*)pSubplan, false, pStr, pLen);
X
Xiaoyu Wang 已提交
99
}
H
Haojun Liao 已提交
100

X
Xiaoyu Wang 已提交
101
int32_t qStringToSubplan(const char* pStr, SSubplan** pSubplan) { return nodesStringToNode(pStr, (SNode**)pSubplan); }
X
Xiaoyu Wang 已提交
102

X
Xiaoyu Wang 已提交
103
char* qQueryPlanToString(const SQueryPlan* pPlan) {
X
Xiaoyu Wang 已提交
104
  char*   pStr = NULL;
X
Xiaoyu Wang 已提交
105 106 107 108 109
  int32_t len = 0;
  if (TSDB_CODE_SUCCESS != nodesNodeToString(pPlan, false, &pStr, &len)) {
    return NULL;
  }
  return pStr;
110 111
}

X
Xiaoyu Wang 已提交
112
SQueryPlan* qStringToQueryPlan(const char* pStr) {
X
Xiaoyu Wang 已提交
113 114 115 116 117
  SQueryPlan* pPlan = NULL;
  if (TSDB_CODE_SUCCESS != nodesStringToNode(pStr, (SNode**)&pPlan)) {
    return NULL;
  }
  return pPlan;
X
Xiaoyu Wang 已提交
118 119
}

X
Xiaoyu Wang 已提交
120
void qDestroyQueryPlan(SQueryPlan* pPlan) { nodesDestroyNode(pPlan); }