r3/include/r3.h

165 lines
3.4 KiB
C
Raw Normal View History

2014-05-14 22:10:34 -04:00
/*
2014-05-16 08:22:25 -04:00
* r3.h
2014-05-14 22:10:34 -04:00
* Copyright (C) 2014 c9s <c9s@c9smba.local>
*
* Distributed under terms of the MIT license.
*/
#ifndef NODE_H
#define NODE_H
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
2014-05-16 02:05:51 -04:00
#include <pcre.h>
2014-05-14 22:10:34 -04:00
2014-05-16 08:22:25 -04:00
#include "str_array.h"
2014-05-15 01:39:50 -04:00
2014-05-16 07:12:01 -04:00
#define node_edge_pattern(node,i) node->edges[i]->pattern
#define node_edge_pattern_len(node,i) node->edges[i]->pattern_len
2014-05-16 03:29:25 -04:00
struct _edge;
struct _node;
2014-05-18 01:06:36 -04:00
struct _route;
2014-05-16 03:29:25 -04:00
typedef struct _edge edge;
typedef struct _node node;
2014-05-18 01:06:36 -04:00
typedef struct _route route;
2014-05-15 01:39:50 -04:00
2014-05-16 03:29:25 -04:00
struct _node {
2014-05-18 00:24:07 -04:00
edge ** edges;
route ** routes;
int edge_len;
int edge_cap;
2014-05-18 01:06:36 -04:00
int route_len;
int route_cap;
int endpoint;
2014-05-16 08:51:30 -04:00
/** compile-time variables here.... **/
2014-05-16 02:05:51 -04:00
/* the combined regexp pattern string from pattern_tokens */
char * combined_pattern;
int combined_pattern_len;
2014-05-16 08:51:30 -04:00
int ov_cnt;
int * ov;
pcre * pcre_pattern;
pcre_extra * pcre_extra;
2014-05-16 02:05:51 -04:00
2014-05-16 03:29:25 -04:00
/**
2014-05-18 01:06:36 -04:00
* the pointer of route data
2014-05-16 03:29:25 -04:00
*/
2014-05-17 23:06:24 -04:00
void * data;
2014-05-16 03:29:25 -04:00
2014-05-16 02:05:51 -04:00
};
2014-05-16 03:29:25 -04:00
struct _edge {
2014-05-16 02:05:51 -04:00
char * pattern;
int pattern_len;
bool has_slug;
2014-05-16 03:29:25 -04:00
node * child;
2014-05-16 02:05:51 -04:00
};
2014-05-16 06:03:52 -04:00
typedef struct {
2014-05-16 07:12:01 -04:00
str_array * vars;
2014-05-17 06:56:13 -04:00
char * path; // current path to dispatch
int path_len; // the length of the current path
int request_method; // current request method
2014-05-17 23:06:24 -04:00
2014-05-18 01:06:36 -04:00
void * data; // route ptr
2014-05-17 23:06:24 -04:00
2014-05-17 06:56:13 -04:00
char * host; // the request host
int host_len;
char * remote_addr;
int remote_addr_len;
2014-05-16 06:03:52 -04:00
} match_entry;
2014-05-15 01:39:50 -04:00
2014-05-18 01:06:36 -04:00
struct _route {
2014-05-17 06:57:36 -04:00
char * path;
int path_len;
int request_method; // can be (GET || POST)
2014-05-17 06:57:36 -04:00
char * host; // required host name
int host_len;
2014-05-18 00:40:06 -04:00
void * data;
2014-05-17 06:57:36 -04:00
char * remote_addr_pattern;
int remote_addr_pattern_len;
};
2014-05-17 06:57:36 -04:00
2014-05-15 01:39:50 -04:00
2014-05-16 06:57:36 -04:00
node * r3_tree_create(int cap);
2014-05-16 03:29:25 -04:00
2014-05-16 06:57:36 -04:00
node * r3_node_create();
2014-05-15 01:39:50 -04:00
2014-05-16 06:57:36 -04:00
void r3_tree_free(node * tree);
2014-05-15 01:39:50 -04:00
2014-05-16 06:57:36 -04:00
void r3_edge_free(edge * edge);
2014-05-15 01:39:50 -04:00
2014-05-18 00:24:07 -04:00
edge * r3_node_add_child(node * n, char * pat , node *child);
2014-05-15 01:39:50 -04:00
2014-05-16 06:57:36 -04:00
edge * r3_node_find_edge(node * n, char * pat);
2014-05-15 01:39:50 -04:00
2014-05-18 00:24:07 -04:00
void r3_node_append_edge(node *n, edge *child);
2014-05-15 01:39:50 -04:00
2014-05-18 01:06:36 -04:00
node * r3_tree_insert_path(node *tree, char *path, route * route, void * data);
2014-05-15 06:26:41 -04:00
2014-05-18 01:06:36 -04:00
node * r3_tree_insert_pathl(node *tree, char *path, int path_len, route * route, void * data);
2014-05-15 06:26:41 -04:00
2014-05-16 06:57:36 -04:00
void r3_tree_dump(node * n, int level);
2014-05-15 01:39:50 -04:00
2014-05-17 19:36:17 -04:00
int r3_tree_render_file(node * tree, char * format, char * filename);
2014-05-17 20:13:58 -04:00
int r3_tree_render_dot(node * tree);
2014-05-16 06:57:36 -04:00
edge * r3_node_find_edge_str(node * n, char * str, int str_len);
2014-05-16 02:05:51 -04:00
2014-05-16 06:57:36 -04:00
void r3_tree_compile(node *n);
2014-05-16 02:05:51 -04:00
2014-05-16 06:57:36 -04:00
void r3_tree_compile_patterns(node * n);
2014-05-16 02:05:51 -04:00
2014-05-16 06:57:36 -04:00
node * r3_tree_match(node * n, char * path, int path_len, match_entry * entry);
2014-05-15 09:17:30 -04:00
node * r3_tree_match_with_entry(node * n, match_entry * entry);
2014-05-16 06:57:36 -04:00
bool r3_node_has_slug_edges(node *n);
2014-05-16 00:33:59 -04:00
2014-05-16 06:57:36 -04:00
edge * r3_edge_create(char * pattern, int pattern_len, node * child);
2014-05-14 22:10:34 -04:00
2014-05-18 07:09:47 -04:00
node * r3_edge_branch(edge *e, int dl);
2014-05-16 06:57:36 -04:00
void r3_edge_free(edge * edge);
2014-05-14 22:10:34 -04:00
2014-05-16 06:03:52 -04:00
2014-05-18 01:06:36 -04:00
node * r3_tree_insert_route(node *tree, route * route, void * data);
2014-05-16 06:03:52 -04:00
2014-05-17 11:54:18 -04:00
match_entry * match_entry_createl(char * path, int path_len);
#define match_entry_create(path) match_entry_createl(path,strlen(path))
2014-05-16 07:12:01 -04:00
void match_entry_free(match_entry * entry);
2014-05-16 06:03:52 -04:00
2014-05-17 07:25:25 -04:00
2014-05-18 01:06:36 -04:00
route * route_create(char * path);
2014-05-17 07:25:25 -04:00
2014-05-18 01:06:36 -04:00
route * route_createl(char * path, int path_len);
2014-05-17 07:25:25 -04:00
2014-05-18 01:06:36 -04:00
int route_cmp(route *r1, match_entry *r2);
2014-05-18 01:06:36 -04:00
void r3_node_append_route(node * n, route * route);
2014-05-18 00:24:07 -04:00
2014-05-18 01:06:36 -04:00
void route_free(route * route);
2014-05-18 00:24:07 -04:00
2014-05-18 01:06:36 -04:00
route * r3_node_match_route(node *n, match_entry * entry);
2014-05-18 00:56:53 -04:00
#define METHOD_GET 2
#define METHOD_POST 2<<1
2014-05-18 00:24:07 -04:00
#define METHOD_PUT 2<<1
#define METHOD_DELETE 2<<1
2014-05-14 22:10:34 -04:00
#endif /* !NODE_H */