1iaan
0dc86f5aa5
/** * Header: | magic(4) | payloadLen(4) | * * Request * Payload: | opcount(4) | repeat Cmd | * Cmd: | OP(1) | argc(4) | repeat Arg | * Arg: | arglen(4) | arg | * * Response * Payload: | opcount(4) | repeat Rsp | * Rsp: | OP(1) | status(1) | datalen(4) | data | */ kvstore层，先解析，再执行，最后构建返回体。 一个是半包问题，没有处理。 另一个是感觉协议结构有点麻烦，
173 lines
3.2 KiB
C
173 lines
3.2 KiB
C
|
|
|
|
|
|
#ifndef __KV_STORE_H__
|
|
#define __KV_STORE_H__
|
|
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
|
|
|
|
#define NETWORK_REACTOR 0
|
|
#define NETWORK_PROACTOR 1
|
|
#define NETWORK_NTYCO 2
|
|
|
|
#define NETWORK_SELECT NETWORK_REACTOR
|
|
|
|
// 8MB
|
|
#define MAX_PAYLOAD_LEN 8388608
|
|
#define MAX_OPCOUNT 1024
|
|
// 4MB
|
|
#define MAX_ARG_LEN 4194304
|
|
|
|
#define KVS_MAX_TOKENS 128
|
|
|
|
#define ENABLE_ARRAY 1
|
|
#define ENABLE_RBTREE 1
|
|
#define ENABLE_HASH 1
|
|
|
|
#define NEW_KVSTORE 1
|
|
|
|
|
|
typedef int (*msg_handler)(char *msg, int length, char *response);
|
|
|
|
|
|
extern int reactor_start(unsigned short port, msg_handler handler);
|
|
extern int proactor_start(unsigned short port, msg_handler handler);
|
|
extern int ntyco_start(unsigned short port, msg_handler handler);
|
|
|
|
|
|
|
|
#if ENABLE_ARRAY
|
|
|
|
typedef struct kvs_array_item_s {
|
|
char *key;
|
|
char *value;
|
|
} kvs_array_item_t;
|
|
|
|
#define KVS_ARRAY_SIZE 1024
|
|
|
|
typedef struct kvs_array_s {
|
|
kvs_array_item_t *table;
|
|
int idx;
|
|
int total;
|
|
} kvs_array_t;
|
|
|
|
int kvs_array_create(kvs_array_t *inst);
|
|
void kvs_array_destory(kvs_array_t *inst);
|
|
|
|
int kvs_array_set(kvs_array_t *inst, char *key, char *value);
|
|
char* kvs_array_get(kvs_array_t *inst, char *key);
|
|
int kvs_array_del(kvs_array_t *inst, char *key);
|
|
int kvs_array_mod(kvs_array_t *inst, char *key, char *value);
|
|
int kvs_array_exist(kvs_array_t *inst, char *key);
|
|
|
|
|
|
#endif
|
|
|
|
|
|
#if ENABLE_RBTREE
|
|
|
|
#define RED 1
|
|
#define BLACK 2
|
|
|
|
#define ENABLE_KEY_CHAR 1
|
|
|
|
#if ENABLE_KEY_CHAR
|
|
typedef char* KEY_TYPE;
|
|
#else
|
|
typedef int KEY_TYPE; // key
|
|
#endif
|
|
|
|
typedef struct _rbtree_node {
|
|
unsigned char color;
|
|
struct _rbtree_node *right;
|
|
struct _rbtree_node *left;
|
|
struct _rbtree_node *parent;
|
|
KEY_TYPE key;
|
|
void *value;
|
|
} rbtree_node;
|
|
|
|
typedef struct _rbtree {
|
|
rbtree_node *root;
|
|
rbtree_node *nil;
|
|
} rbtree;
|
|
|
|
|
|
typedef struct _rbtree kvs_rbtree_t;
|
|
|
|
int kvs_rbtree_create(kvs_rbtree_t *inst);
|
|
void kvs_rbtree_destory(kvs_rbtree_t *inst);
|
|
int kvs_rbtree_set(kvs_rbtree_t *inst, char *key, char *value);
|
|
char* kvs_rbtree_get(kvs_rbtree_t *inst, char *key);
|
|
int kvs_rbtree_del(kvs_rbtree_t *inst, char *key);
|
|
int kvs_rbtree_mod(kvs_rbtree_t *inst, char *key, char *value);
|
|
int kvs_rbtree_exist(kvs_rbtree_t *inst, char *key);
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
#if ENABLE_HASH
|
|
|
|
#define MAX_KEY_LEN 128
|
|
#define MAX_VALUE_LEN 512
|
|
#define MAX_TABLE_SIZE 1024
|
|
|
|
#define ENABLE_KEY_POINTER 1
|
|
|
|
|
|
typedef struct hashnode_s {
|
|
#if ENABLE_KEY_POINTER
|
|
char *key;
|
|
char *value;
|
|
#else
|
|
char key[MAX_KEY_LEN];
|
|
char value[MAX_VALUE_LEN];
|
|
#endif
|
|
struct hashnode_s *next;
|
|
|
|
} hashnode_t;
|
|
|
|
|
|
typedef struct hashtable_s {
|
|
|
|
hashnode_t **nodes; //* change **,
|
|
|
|
int max_slots;
|
|
int count;
|
|
|
|
} hashtable_t;
|
|
|
|
typedef struct hashtable_s kvs_hash_t;
|
|
|
|
|
|
int kvs_hash_create(kvs_hash_t *hash);
|
|
void kvs_hash_destory(kvs_hash_t *hash);
|
|
int kvs_hash_set(hashtable_t *hash, char *key, char *value);
|
|
char * kvs_hash_get(kvs_hash_t *hash, char *key);
|
|
int kvs_hash_mod(kvs_hash_t *hash, char *key, char *value);
|
|
int kvs_hash_del(kvs_hash_t *hash, char *key);
|
|
int kvs_hash_exist(kvs_hash_t *hash, char *key);
|
|
|
|
|
|
#endif
|
|
|
|
|
|
void *kvs_malloc(size_t size);
|
|
void kvs_free(void *ptr);
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|