121 lines
4.3 KiB
C
121 lines
4.3 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/>.
|
|
*/
|
|
#ifdef USE_UV
|
|
|
|
#include <uv.h>
|
|
#include "lz4.h"
|
|
#include "os.h"
|
|
#include "rpcCache.h"
|
|
#include "rpcHead.h"
|
|
#include "rpcLog.h"
|
|
#include "rpcTcp.h"
|
|
#include "rpcUdp.h"
|
|
#include "taoserror.h"
|
|
#include "tglobal.h"
|
|
#include "thash.h"
|
|
#include "tidpool.h"
|
|
#include "tmd5.h"
|
|
#include "tmempool.h"
|
|
#include "tmsg.h"
|
|
#include "transportInt.h"
|
|
#include "tref.h"
|
|
#include "trpc.h"
|
|
#include "ttimer.h"
|
|
#include "tutil.h"
|
|
|
|
typedef void* queue[2];
|
|
/* Private macros. */
|
|
#define QUEUE_NEXT(q) (*(queue**)&((*(q))[0]))
|
|
#define QUEUE_PREV(q) (*(queue**)&((*(q))[1]))
|
|
|
|
#define QUEUE_PREV_NEXT(q) (QUEUE_NEXT(QUEUE_PREV(q)))
|
|
#define QUEUE_NEXT_PREV(q) (QUEUE_PREV(QUEUE_NEXT(q)))
|
|
/* Initialize an empty queue. */
|
|
#define QUEUE_INIT(q) \
|
|
{ \
|
|
QUEUE_NEXT(q) = (q); \
|
|
QUEUE_PREV(q) = (q); \
|
|
}
|
|
|
|
/* Return true if the queue has no element. */
|
|
#define QUEUE_IS_EMPTY(q) ((const queue*)(q) == (const queue*)QUEUE_NEXT(q))
|
|
|
|
/* Insert an element at the back of a queue. */
|
|
#define QUEUE_PUSH(q, e) \
|
|
{ \
|
|
QUEUE_NEXT(e) = (q); \
|
|
QUEUE_PREV(e) = QUEUE_PREV(q); \
|
|
QUEUE_PREV_NEXT(e) = (e); \
|
|
QUEUE_PREV(q) = (e); \
|
|
}
|
|
|
|
/* Remove the given element from the queue. Any element can be removed at any *
|
|
* time. */
|
|
#define QUEUE_REMOVE(e) \
|
|
{ \
|
|
QUEUE_PREV_NEXT(e) = QUEUE_NEXT(e); \
|
|
QUEUE_NEXT_PREV(e) = QUEUE_PREV(e); \
|
|
}
|
|
|
|
/* Return the element at the front of the queue. */
|
|
#define QUEUE_HEAD(q) (QUEUE_NEXT(q))
|
|
|
|
/* Return the element at the back of the queue. */
|
|
#define QUEUE_TAIL(q) (QUEUE_PREV(q))
|
|
|
|
/* Iterate over the element of a queue. * Mutating the queue while iterating
|
|
* results in undefined behavior. */
|
|
#define QUEUE_FOREACH(q, e) for ((q) = QUEUE_NEXT(e); (q) != (e); (q) = QUEUE_NEXT(q))
|
|
|
|
/* Return the structure holding the given element. */
|
|
#define QUEUE_DATA(e, type, field) ((type*)((void*)((char*)(e)-offsetof(type, field))))
|
|
|
|
typedef struct {
|
|
SRpcInfo* pRpc; // associated SRpcInfo
|
|
SEpSet epSet; // ip list provided by app
|
|
void* ahandle; // handle provided by app
|
|
struct SRpcConn* pConn; // pConn allocated
|
|
tmsg_t msgType; // message type
|
|
uint8_t* pCont; // content provided by app
|
|
int32_t contLen; // content length
|
|
int32_t code; // error code
|
|
int16_t numOfTry; // number of try for different servers
|
|
int8_t oldInUse; // server EP inUse passed by app
|
|
int8_t redirect; // flag to indicate redirect
|
|
int8_t connType; // connection type
|
|
int64_t rid; // refId returned by taosAddRef
|
|
SRpcMsg* pRsp; // for synchronous API
|
|
tsem_t* pSem; // for synchronous API
|
|
SEpSet* pSet; // for synchronous API
|
|
char msg[0]; // RpcHead starts from here
|
|
} SRpcReqContext;
|
|
|
|
#define container_of(ptr, type, member) ((type*)((char*)(ptr)-offsetof(type, member)))
|
|
#define RPC_RESERVE_SIZE (sizeof(SRpcReqContext))
|
|
|
|
#define RPC_MSG_OVERHEAD (sizeof(SRpcReqContext) + sizeof(SRpcHead) + sizeof(SRpcDigest))
|
|
#define rpcHeadFromCont(cont) ((SRpcHead*)((char*)cont - sizeof(SRpcHead)))
|
|
#define rpcContFromHead(msg) (msg + sizeof(SRpcHead))
|
|
#define rpcMsgLenFromCont(contLen) (contLen + sizeof(SRpcHead))
|
|
#define rpcContLenFromMsg(msgLen) (msgLen - sizeof(SRpcHead))
|
|
#define rpcIsReq(type) (type & 1U)
|
|
|
|
int rpcAuthenticateMsg(void* pMsg, int msgLen, void* pAuth, void* pKey);
|
|
void rpcBuildAuthHead(void* pMsg, int msgLen, void* pAuth, void* pKey);
|
|
int32_t rpcCompressRpcMsg(char* pCont, int32_t contLen);
|
|
SRpcHead* rpcDecompressRpcMsg(SRpcHead* pHead);
|
|
|
|
#endif
|