collabvm/r3
8
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

remove const from match_entry pointer

Browse source
This commit is contained in:
c9s 2014-06-01 02:38:12 +08:00
parent 89fb801cfd
commit 8f8dbd520b
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
include/r3.h
View file

@ -126,7 +126,7 @@ int r3_tree_compile(node *n, char** errstr);
int r3_tree_compile_patterns(node * n, char** errstr); int r3_tree_compile_patterns(node * n, char** errstr);
node * r3_tree_matchl(const node * n, const char * path, int path_len, const match_entry * entry); node * r3_tree_matchl(const node * n, const char * path, int path_len, match_entry * entry);
#define r3_tree_match(n,p,e) r3_tree_matchl(n,p, strlen(p), e) #define r3_tree_match(n,p,e) r3_tree_matchl(n,p, strlen(p), e)
@ -155,7 +155,7 @@ void r3_node_append_route(node * n, route * route);
void r3_route_free(route * route); void r3_route_free(route * route);
route * r3_tree_match_route(const node *n, const match_entry * entry); route * r3_tree_match_route(const node *n, match_entry * entry);
#define METHOD_GET 2 #define METHOD_GET 2
#define METHOD_POST 2<<1 #define METHOD_POST 2<<1

4
src/node.c
View file

@ -253,7 +253,7 @@ int r3_tree_compile_patterns(node * n, char **errstr) {
* @param int path_len the length of the URL path. * @param int path_len the length of the URL path.
* @param match_entry* entry match_entry is used for saving the captured dynamic strings from pcre result. * @param match_entry* entry match_entry is used for saving the captured dynamic strings from pcre result.
*/ */
node * r3_tree_matchl(const node * n, const char * path, int path_len, const match_entry * entry) { node * r3_tree_matchl(const node * n, const char * path, int path_len, match_entry * entry) {
info("try matching: %s\n", path); info("try matching: %s\n", path);
edge *e; edge *e;
@ -376,7 +376,7 @@ node * r3_tree_matchl(const node * n, const char * path, int path_len, const mat
route * r3_tree_match_route(const node *tree, const match_entry * entry) { route * r3_tree_match_route(const node *tree, match_entry * entry) {
node *n; node *n;
n = r3_tree_match_entry(tree, entry); n = r3_tree_match_entry(tree, entry);
if (n && n->routes && n->route_len > 0) { if (n && n->routes && n->route_len > 0) {