/*
- * $Id: radix.h,v 1.8 2001/01/07 09:55:21 hno Exp $
+ * $Id: radix.h,v 1.9 2001/02/07 19:04:04 hno Exp $
*/
/*
struct radix_node[2])), *rn_match __P((void *, struct radix_node_head *)),
*rn_newpair __P((void *, int, struct radix_node[2])), *rn_search __P((void *, struct radix_node *)),
*rn_search_m __P((void *, struct radix_node *, void *));
-
+extern struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
#define min(x,y) ((x)<(y)? (x) : (y))
#endif /* _RADIX_H_ */
/*
- * $Id: radix.c,v 1.12 2001/02/07 18:56:50 hno Exp $
+ * $Id: radix.c,v 1.13 2001/02/07 19:04:08 hno Exp $
*
* DEBUG: section 53 Radix tree data structure implementation
* AUTHOR: NetBSD Derived
return (!masks_are_equal);
}
-static struct radix_node *
+struct radix_node *
rn_lookup(v_arg, m_arg, head)
void *v_arg, *m_arg;
struct radix_node_head *head;
/*
- * $Id: asn.cc,v 1.69 2001/02/07 18:56:51 hno Exp $
+ * $Id: asn.cc,v 1.70 2001/02/07 19:04:08 hno Exp $
*
* DEBUG: section 53 AS Number handling
* AUTHOR: Duane Wessels, Kostas Anagnostakis
static void destroyRadixNodeInfo(as_info *);
static OBJH asnStats;
-extern struct radix_node *rn_lookup(void *, void *, void *);
-
-
/* PUBLIC */
int
/*
- * $Id: urn.cc,v 1.64 2001/01/12 00:37:23 wessels Exp $
+ * $Id: urn.cc,v 1.65 2001/02/07 19:04:09 hno Exp $
*
* DEBUG: section 52 URN Parsing
* AUTHOR: Kostas Anagnostakis
static const char *const crlf = "\r\n";
static QS url_entry_sort;
-url_entry *
+static url_entry *
urnFindMinRtt(url_entry * urls, method_t m, int *rtt_ret)
{
int min_rtt = 0;