TDengine/source/libs/executor/inc/executil.h

227 lines
10 KiB
C
Raw Normal View History

/*
* 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/>.
*/
#ifndef TDENGINE_EXECUTIL_H
#define TDENGINE_EXECUTIL_H
2023-03-25 06:43:17 +00:00
#include "executor.h"
#include "function.h"
#include "nodes.h"
#include "plannodes.h"
#include "storageapi.h"
2022-05-08 08:06:47 +00:00
#include "tcommon.h"
2022-02-10 05:55:53 +00:00
#include "tpagedbuf.h"
#include "tsimplehash.h"
2024-08-21 12:00:34 +00:00
#define T_LONG_JMP(_obj, _c) \
do { \
qError("error happens at %s, line:%d, code:%s", __func__, __LINE__, tstrerror((_c))); \
longjmp((_obj), (_c)); \
} while (0)
2024-07-25 00:51:19 +00:00
#define SET_RES_WINDOW_KEY(_k, _ori, _len, _uid) \
do { \
*(uint64_t*)(_k) = (_uid); \
(void)memcpy((_k) + sizeof(uint64_t), (_ori), (_len)); \
2020-10-31 15:14:43 +00:00
} while (0)
2023-03-25 06:43:17 +00:00
#define GET_RES_WINDOW_KEY_LEN(_l) ((_l) + sizeof(uint64_t))
2021-07-14 06:28:30 +00:00
typedef struct SGroupResInfo {
int32_t index; // rows consumed in func:doCopyToSDataBlockXX
int32_t iter; // relate to index-1, last consumed data's slot id in hash table
void* dataPos; // relate to index-1, last consumed data's position, in the nodelist of cur slot
SArray* pRows; // SArray<SResKeyPos>
2023-01-11 10:47:45 +00:00
char* pBuf;
2023-02-14 17:28:50 +00:00
bool freeItem;
} SGroupResInfo;
typedef struct SResultRow {
int32_t version;
int32_t pageId; // pageId & rowId is the position of current result in disk-based output buffer
int32_t offset : 29; // row index in buffer page
bool startInterp; // the time window start timestamp has done the interpolation already.
bool endInterp; // the time window end timestamp has done the interpolation already.
bool closed; // this result status: closed or opened
uint32_t numOfRows; // number of rows of current time window
STimeWindow win;
2022-05-08 08:06:47 +00:00
struct SResultRowEntryInfo pEntryInfo[]; // For each result column, there is a resultInfo
} SResultRow;
typedef struct SResultRowPosition {
int32_t pageId;
int32_t offset;
} SResultRowPosition;
typedef struct SResKeyPos {
SResultRowPosition pos;
uint64_t groupId;
2023-03-25 06:43:17 +00:00
char key[];
} SResKeyPos;
typedef struct SResultRowInfo {
int32_t size; // number of result set
SResultRowPosition cur;
SList* openWindow;
} SResultRowInfo;
2022-10-24 08:44:44 +00:00
typedef struct SColMatchItem {
int32_t colId;
int32_t srcSlotId;
int32_t dstSlotId;
bool needOutput;
SDataType dataType;
int32_t funcType;
2024-03-20 05:09:59 +00:00
bool isPk;
2022-10-24 08:44:44 +00:00
} SColMatchItem;
typedef struct SColMatchInfo {
SArray* pList; // SArray<SColMatchItem>
int32_t matchType; // determinate the source according to col id or slot id
} SColMatchInfo;
2022-11-01 07:00:02 +00:00
typedef struct SExecTaskInfo SExecTaskInfo;
typedef struct STableListIdInfo {
uint64_t suid;
uint64_t uid;
int32_t tableType;
} STableListIdInfo;
// If the numOfOutputGroups is 1, the data blocks that belongs to different groups will be provided randomly
// The numOfOutputGroups is specified by physical plan. and will not be affect by numOfGroups
typedef struct STableListInfo {
bool oneTableForEachGroup;
int32_t numOfOuputGroups; // the data block will be generated one by one
int32_t* groupOffset; // keep the offset value for each group in the tableList
SArray* pTableList;
2024-07-23 02:50:16 +00:00
SHashObj* map; // speedup acquire the tableQueryInfo by table uid
SHashObj* remainGroups; // remaining group has not yet processed the empty group
STableListIdInfo idInfo; // this maybe the super table or ordinary table
} STableListInfo;
struct SqlFunctionCtx;
2022-10-30 14:23:27 +00:00
int32_t createScanTableListInfo(SScanPhysiNode* pScanNode, SNodeList* pGroupTags, bool groupSort, SReadHandle* pHandle,
2023-03-25 06:43:17 +00:00
STableListInfo* pTableListInfo, SNode* pTagCond, SNode* pTagIndexCond,
SExecTaskInfo* pTaskInfo);
2022-10-30 14:23:27 +00:00
STableListInfo* tableListCreate();
2024-07-23 02:50:16 +00:00
void tableListDestroy(STableListInfo* pTableListInfo);
2022-11-27 16:51:18 +00:00
void tableListClear(STableListInfo* pTableListInfo);
int32_t tableListGetOutputGroups(const STableListInfo* pTableList);
bool oneTableForEachGroup(const STableListInfo* pTableList);
uint64_t tableListGetTableGroupId(const STableListInfo* pTableList, uint64_t tableUid);
2022-11-27 16:51:18 +00:00
int32_t tableListAddTableInfo(STableListInfo* pTableList, uint64_t uid, uint64_t gid);
int32_t tableListGetGroupList(const STableListInfo* pTableList, int32_t ordinalIndex, STableKeyInfo** pKeyInfo,
int32_t* num);
int32_t tableListGetSize(const STableListInfo* pTableList, int32_t* pRes);
2022-11-27 16:51:18 +00:00
uint64_t tableListGetSuid(const STableListInfo* pTableList);
STableKeyInfo* tableListGetInfo(const STableListInfo* pTableList, int32_t index);
int32_t tableListFind(const STableListInfo* pTableList, uint64_t uid, int32_t startIndex);
2024-07-23 02:50:16 +00:00
void tableListGetSourceTableInfo(const STableListInfo* pTableList, uint64_t* psuid, uint64_t* uid, int32_t* type);
2022-10-30 14:13:49 +00:00
size_t getResultRowSize(struct SqlFunctionCtx* pCtx, int32_t numOfOutput);
void initResultRowInfo(SResultRowInfo* pResultRowInfo);
2022-09-02 06:34:30 +00:00
void closeResultRow(SResultRow* pResultRow);
void resetResultRow(SResultRow* pResultRow, size_t entrySize);
struct SResultRowEntryInfo* getResultEntryInfo(const SResultRow* pRow, int32_t index, const int32_t* offset);
2021-05-06 02:09:10 +00:00
static FORCE_INLINE SResultRow* getResultRowByPos(SDiskbasedBuf* pBuf, SResultRowPosition* pos, bool forUpdate) {
SFilePage* bufPage = (SFilePage*)getBufPage(pBuf, pos->pageId);
2023-05-29 06:36:29 +00:00
if (!bufPage) {
2023-05-29 08:04:35 +00:00
uFatal("failed to get the buffer page:%d since %s", pos->pageId, terrstr());
2023-05-29 06:36:29 +00:00
return NULL;
}
if (forUpdate) {
setBufPageDirty(bufPage, true);
}
2022-10-30 14:13:49 +00:00
2022-03-31 08:10:32 +00:00
SResultRow* pRow = (SResultRow*)((char*)bufPage + pos->offset);
return pRow;
2020-07-14 11:24:38 +00:00
}
2020-06-05 08:13:14 +00:00
int32_t getResultRowFromBuf(struct SExprSupp *pSup, const char* inBuf, size_t inBufSize, char **outBuf, size_t *outBufSize);
int32_t putResultRowToBuf(struct SExprSupp *pSup, const char* inBuf, size_t inBufSize, char **outBuf, size_t *outBufSize);
2024-07-26 12:48:06 +00:00
int32_t initGroupedResultInfo(SGroupResInfo* pGroupResInfo, SSHashObj* pHashmap, int32_t order);
void cleanupGroupResInfo(SGroupResInfo* pGroupResInfo);
2022-07-18 05:52:33 +00:00
2023-02-14 17:28:50 +00:00
void initMultiResInfoFromArrayList(SGroupResInfo* pGroupResInfo, SArray* pArrayList);
bool hasRemainResults(SGroupResInfo* pGroupResInfo);
2021-02-26 07:45:13 +00:00
2021-02-03 10:29:40 +00:00
int32_t getNumOfTotalRes(SGroupResInfo* pGroupResInfo);
2022-11-27 16:27:49 +00:00
SSDataBlock* createDataBlockFromDescNode(SDataBlockDescNode* pNode);
2024-04-08 10:04:06 +00:00
int32_t prepareDataBlockBuf(SSDataBlock* pDataBlock, SColMatchInfo* pMatchInfo);
2022-06-21 12:53:19 +00:00
EDealRes doTranslateTagExpr(SNode** pNode, void* pContext);
2024-07-23 02:50:16 +00:00
int32_t getGroupIdFromTagsVal(void* pVnode, uint64_t uid, SNodeList* pGroupNode, char* keyBuf, uint64_t* pGroupId,
SStorageAPI* pAPI);
size_t getTableTagsBufLen(const SNodeList* pGroups);
SArray* createSortInfo(SNodeList* pNodeList);
2023-06-15 11:34:15 +00:00
SArray* makeColumnArrayFromList(SNodeList* pNodeList);
2022-10-24 08:44:44 +00:00
int32_t extractColMatchInfo(SNodeList* pNodeList, SDataBlockDescNode* pOutputNodeList, int32_t* numOfOutputCols,
int32_t type, SColMatchInfo* pMatchInfo);
2024-08-05 03:57:18 +00:00
int32_t createExprFromOneNode(SExprInfo* pExp, SNode* pNode, int16_t slotId);
int32_t createExprFromTargetNode(SExprInfo* pExp, STargetNode* pTargetNode);
int32_t createExprInfo(SNodeList* pNodeList, SNodeList* pGroupKeys, SExprInfo** pExprInfo, int32_t* numOfExprs);
2024-07-23 02:50:16 +00:00
SqlFunctionCtx* createSqlFunctionCtx(SExprInfo* pExprInfo, int32_t numOfOutput, int32_t** rowEntryInfoOffset,
SFunctionStateStore* pStore);
int32_t relocateColumnData(SSDataBlock* pBlock, const SArray* pColMatchInfo, SArray* pCols, bool outputEveryColumn);
2024-07-22 04:51:25 +00:00
int32_t initExecTimeWindowInfo(SColumnInfoData* pColData, STimeWindow* pQueryWindow);
SInterval extractIntervalInfo(const STableScanPhysiNode* pTableScanNode);
SColumn extractColumnFromColumnNode(SColumnNode* pColNode);
2024-07-23 02:50:16 +00:00
int32_t initQueryTableDataCond(SQueryTableDataCond* pCond, const STableScanPhysiNode* pTableScanNode,
const SReadHandle* readHandle);
2022-06-17 15:23:37 +00:00
void cleanupQueryTableDataCond(SQueryTableDataCond* pCond);
int32_t convertFillType(int32_t mode);
2022-07-08 11:55:06 +00:00
int32_t resultrowComparAsc(const void* p1, const void* p2);
2023-08-14 09:51:20 +00:00
int32_t isQualifiedTable(STableKeyInfo* info, SNode* pTagCond, void* metaHandle, bool* pQualified, SStorageAPI* pAPI);
char* getStreamOpName(uint16_t opType);
void printDataBlock(SSDataBlock* pBlock, const char* flag, const char* taskIdStr);
void printSpecDataBlock(SSDataBlock* pBlock, const char* flag, const char* opStr, const char* taskIdStr);
2022-11-30 13:04:58 +00:00
2023-08-14 06:24:21 +00:00
TSKEY getStartTsKey(STimeWindow* win, const TSKEY* tsCols);
2024-07-23 02:50:16 +00:00
void updateTimeWindowInfo(SColumnInfoData* pColData, STimeWindow* pWin, int64_t delta);
2023-08-14 06:24:21 +00:00
2023-08-10 09:30:01 +00:00
SSDataBlock* createTagValBlockForFilter(SArray* pColList, int32_t numOfTables, SArray* pUidTagList, void* pVnode,
SStorageAPI* pStorageAPI);
/**
* @brief build a tuple into keyBuf
* @param [out] keyBuf the output buf
* @param [in] pSortGroupCols the cols to build
* @param [in] pBlock block the tuple in
*/
int32_t buildKeys(char* keyBuf, const SArray* pSortGroupCols, const SSDataBlock* pBlock, int32_t rowIndex);
int32_t compKeys(const SArray* pSortGroupCols, const char* oldkeyBuf, int32_t oldKeysLen, const SSDataBlock* pDataBlock,
2024-07-23 02:50:16 +00:00
int32_t rowIndex);
2024-07-23 02:50:16 +00:00
uint64_t calcGroupId(char* pData, int32_t len);
SNodeList* makeColsNodeArrFromSortKeys(SNodeList* pSortKeys);
2024-08-05 08:09:01 +00:00
int32_t extractKeysLen(const SArray* keys, int32_t* pLen);
#endif // TDENGINE_EXECUTIL_H