From 2c5f135600a99970aa78be31315ea579e7c7b4b8 Mon Sep 17 00:00:00 2001 From: c9s Date: Tue, 10 Jun 2014 20:18:59 +0800 Subject: [PATCH] macro rename --- include/r3.h | 4 ++-- src/node.c | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/include/r3.h b/include/r3.h index 6475ae8..e5daead 100644 --- a/include/r3.h +++ b/include/r3.h @@ -59,8 +59,8 @@ struct _node { void * data; }; -#define node_edge_pattern(node,i) node->edges[i]->pattern -#define node_edge_pattern_len(node,i) node->edges[i]->pattern_len +#define r3_node_edge_pattern(node,i) node->edges[i]->pattern +#define r3_node_edge_pattern_len(node,i) node->edges[i]->pattern_len struct _edge { char * pattern; // 8 bytes diff --git a/src/node.c b/src/node.c index ecf6062..a5cfc69 100644 --- a/src/node.c +++ b/src/node.c @@ -443,8 +443,8 @@ inline edge * r3_node_find_edge_str(const node * n, const char * str, int str_le unsigned int i; for (i = n->edge_len; i--; ) { if ( firstbyte == *(n->edges[i]->pattern) ) { - info("matching '%s' with '%s'\n", str, node_edge_pattern(n,i) ); - if ( strncmp( node_edge_pattern(n,i), str, node_edge_pattern_len(n,i) ) == 0 ) { + info("matching '%s' with '%s'\n", str, r3_node_edge_pattern(n,i) ); + if ( strncmp( r3_node_edge_pattern(n,i), str, r3_node_edge_pattern_len(n,i) ) == 0 ) { return n->edges[i]; } return NULL;