wanderer/fastnetmon-rewritten
1
0
Fork 0
mirror of https://github.com/pavel-odintsov/fastnetmon synced 2024-11-23 13:22:36 +01:00
Code Issues Releases Activity

Remove debug printf's from patricia code

Browse Source
This commit is contained in:
Pavel Odintsov 2014-10-24 13:35:49 +04:00
parent 4cb767c477
commit 7f72b37d1e
1 changed files with 12 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
libpatricia/patricia.c
View File

@ -950,7 +950,7 @@ make_and_lookup (patricia_tree_t *tree, char *string)
patricia_node_t *node;
prefix = ascii2prefix (AF_INET, string);
printf ("make_and_lookup: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
// printf ("make_and_lookup: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
node = patricia_lookup (tree, prefix);
Deref_Prefix (prefix);
return (node);
@ -963,13 +963,13 @@ try_search_exact (patricia_tree_t *tree, char *string)
patricia_node_t *node;
prefix = ascii2prefix (AF_INET, string);
printf ("try_search_exact: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
//printf ("try_search_exact: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
if ((node = patricia_search_exact (tree, prefix)) == NULL) {
printf ("try_search_exact: not found\n");
//printf ("try_search_exact: not found\n");
}
else {
printf ("try_search_exact: %s/%d found\n",
prefix_toa (node->prefix), node->prefix->bitlen);
//printf ("try_search_exact: %s/%d found\n",
//prefix_toa (node->prefix), node->prefix->bitlen);
}
Deref_Prefix (prefix);
return (node);
@ -991,12 +991,13 @@ try_search_best (patricia_tree_t *tree, char *string)
patricia_node_t *node;
prefix = ascii2prefix (AF_INET, string);
printf ("try_search_best: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
if ((node = patricia_search_best (tree, prefix)) == NULL)
printf ("try_search_best: not found\n");
else
printf ("try_search_best: %s/%d found\n",
prefix_toa (node->prefix), node->prefix->bitlen);
//printf ("try_search_best: %s/%d\n", prefix_toa (prefix), prefix->bitlen);
if ((node = patricia_search_best (tree, prefix)) == NULL) {
//printf ("try_search_best: not found\n");
} else {
//printf ("try_search_best: %s/%d found\n",
//prefix_toa (node->prefix), node->prefix->bitlen);
}
Deref_Prefix (prefix);
return (node);
}