Completed function declarations and/or added prototypes.

3 files changed, 25 insertions, 5 deletions

diff --git a/sys/net/bpf.c b/sys/net/bpf.c
index 57a6e7d..c1f99b2 100644
--- a/sys/net/bpf.c
+++ b/sys/net/bpf.c
@@ -37,7 +37,7 @@
  *
  *      @(#)bpf.c	8.2 (Berkeley) 3/28/94
  *
- * $Id: bpf.c,v 1.15 1995/11/29 10:48:44 julian Exp $
+ * $Id: bpf.c,v 1.16 1995/11/29 14:40:45 julian Exp $
  */
 
 #include "bpfilter.h"
@@ -52,6 +52,7 @@
 
 #include <sys/param.h>
 #include <sys/systm.h>
+#include <sys/conf.h>
 #include <machine/cpu.h>	/* for bootverbose */
 #include <sys/mbuf.h>
 #include <sys/buf.h>
@@ -130,6 +131,8 @@ bpfilterattach(n)
 #endif
 
 static int	bpf_allocbufs __P((struct bpf_d *));
+static void	bpf_attachd __P((struct bpf_d *d, struct bpf_if *bp));
+static void	bpf_detachd __P((struct bpf_d *d));
 static void	bpf_freed __P((struct bpf_d *));
 static void	bpf_ifname __P((struct ifnet *, struct ifreq *));
 static void	bpf_mcopy __P((const void *, void *, u_int));
diff --git a/sys/net/bpf_filter.c b/sys/net/bpf_filter.c
index 076f255..48a7b9d 100644
--- a/sys/net/bpf_filter.c
+++ b/sys/net/bpf_filter.c
@@ -37,7 +37,7 @@
  *
  *      @(#)bpf_filter.c	8.1 (Berkeley) 6/10/93
  *
- * $Id: bpf_filter.c,v 1.4 1995/04/01 01:46:27 davidg Exp $
+ * $Id: bpf_filter.c,v 1.5 1995/05/30 08:07:56 rgrimes Exp $
  */
 
 #include <sys/param.h>
@@ -82,6 +82,9 @@
 	} \
 }
 
+static int	m_xhalf __P((struct mbuf *m, int k, int *err));
+static int	m_xword __P((struct mbuf *m, int k, int *err));
+
 static int
 m_xword(m, k, err)
 	register struct mbuf *m;
diff --git a/sys/net/radix.c b/sys/net/radix.c
index 7073d60..dc307b2 100644
--- a/sys/net/radix.c
+++ b/sys/net/radix.c
@@ -31,7 +31,7 @@
  * SUCH DAMAGE.
  *
  *	@(#)radix.c	8.4 (Berkeley) 11/2/94
- *	$Id: radix.c,v 1.8 1995/04/28 23:01:34 pst Exp $
+ *	$Id: radix.c,v 1.9 1995/05/30 08:08:20 rgrimes Exp $
  */
 
 /*
@@ -51,6 +51,12 @@
 #include <net/radix.h>
 #endif
 
+extern struct radix_node *
+		rn_lookup __P((void *v_arg, void *m_arg,
+			       struct radix_node_head *head));
+extern int	rn_walktree_from __P((struct radix_node_head *h, void *a,
+				      void *m, walktree_f_t *f, void *w));
+
 int	max_keylen;
 struct radix_mask *rn_mkfreelist;
 struct radix_node_head *mask_rnhead;
@@ -61,6 +67,14 @@ static char *rn_zeros, *rn_ones;
 #define rn_masktop (mask_rnhead->rnh_treetop)
 #undef Bcmp
 #define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
+
+static int	rn_lexobetter __P((void *m_arg, void *n_arg));
+static struct radix_mask *
+		rn_new_radix_mask __P((struct radix_node *tt,
+				       struct radix_mask *next));
+static int	rn_satsifies_leaf __P((char *trial, struct radix_node *leaf,
+				       int skip));
+
 /*
  * The data structure for the keys is a radix tree with one way
  * branching removed.  The index rn_b at an internal node n represents a bit
@@ -819,7 +833,7 @@ int
 rn_walktree_from(h, a, m, f, w)
 	struct radix_node_head *h;
 	void *a, *m;
-	register int (*f)();
+	walktree_f_t *f;
 	void *w;
 {
 	int error;
@@ -908,7 +922,7 @@ rn_walktree_from(h, a, m, f, w)
 int
 rn_walktree(h, f, w)
 	struct radix_node_head *h;
-	register int (*f)();
+	walktree_f_t *f;
 	void *w;
 {
 	int error;