route * r3_tree_match_route(const node *tree, const match_entry * entry) { node *n; n = r3_tree_match_entry(tree, entry); if (n->routes && n->route_len > 0) { int i; for (i = 0; i < n->route_len ; i++ ) { if ( r3_route_cmp(n->routes[i], entry) == 0 ) { return n->routes[i]; } } } return NULL; }
route * r3_tree_match_route(const node *tree, match_entry * entry) { node *n; int i; n = r3_tree_match_entry(tree, entry); if (n && n->routes && n->route_len > 0) { for (i = n->route_len; i--; ) { if ( r3_route_cmp(n->routes[i], entry) == 0 ) { return n->routes[i]; } } } return NULL; }