98 lines
2.8 KiB
C
98 lines
2.8 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/>.
|
|
*/
|
|
|
|
#ifndef TDENGINE_TAST_H
|
|
#define TDENGINE_TAST_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include "os.h"
|
|
|
|
#include "taosmsg.h"
|
|
#include "taosdef.h"
|
|
#include "tskiplist.h"
|
|
#include "tbuffer.h"
|
|
#include "tvariant.h"
|
|
|
|
struct tExprNode;
|
|
struct SSchema;
|
|
|
|
enum {
|
|
TSQL_NODE_EXPR = 0x1,
|
|
TSQL_NODE_COL = 0x2,
|
|
TSQL_NODE_VALUE = 0x4,
|
|
};
|
|
|
|
typedef bool (*__result_filter_fn_t)(const void *, void *);
|
|
typedef void (*__do_filter_suppl_fn_t)(void *, void *);
|
|
|
|
/**
|
|
* this structure is used to filter data in tags, so the offset of filtered tag column in tagdata string is required
|
|
*
|
|
*/
|
|
typedef struct tQueryInfo {
|
|
int32_t colIndex; // index of column in schema
|
|
uint8_t optr; // expression operator
|
|
SSchema sch; // schema of tags
|
|
char* q;
|
|
__compar_fn_t compare; // filter function
|
|
void* param; // STSchema
|
|
} tQueryInfo;
|
|
|
|
typedef struct SExprTraverseSupp {
|
|
__result_filter_fn_t nodeFilterFn;
|
|
__do_filter_suppl_fn_t setupInfoFn;
|
|
void * pExtInfo;
|
|
} SExprTraverseSupp;
|
|
|
|
typedef struct tExprNode {
|
|
uint8_t nodeType;
|
|
union {
|
|
struct {
|
|
uint8_t optr; // filter operator
|
|
uint8_t hasPK; // 0: do not contain primary filter, 1: contain
|
|
void * info; // support filter operation on this expression only available for leaf node
|
|
|
|
struct tExprNode *pLeft; // left child pointer
|
|
struct tExprNode *pRight; // right child pointer
|
|
} _node;
|
|
struct SSchema *pSchema;
|
|
tVariant * pVal;
|
|
};
|
|
} tExprNode;
|
|
|
|
void tExprTreeDestroy(tExprNode **pExprs, void (*fp)(void*));
|
|
|
|
void tExprTreeTraverse(tExprNode *pExpr, SSkipList *pSkipList, SArray *result, SExprTraverseSupp *param);
|
|
|
|
void tExprTreeCalcTraverse(tExprNode *pExprs, int32_t numOfRows, char *pOutput, void *param, int32_t order,
|
|
char *(*cb)(void *, const char*, int32_t));
|
|
|
|
uint8_t getBinaryExprOptr(SSQLToken *pToken);
|
|
|
|
void tExprNodeDestroy(tExprNode *pNode, void (*fp)(void *));
|
|
void exprTreeToBinary(SBufferWriter* bw, tExprNode* pExprTree);
|
|
|
|
tExprNode* exprTreeFromBinary(const void* data, size_t size);
|
|
tExprNode* exprTreeFromTableName(const char* tbnameCond);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif // TDENGINE_TAST_H
|