| aarp.c (33181) | aarp.c (41591) |
|---|---|
| 1/* 2 * Copyright (c) 1990,1991 Regents of The University of Michigan. 3 * All Rights Reserved. 4 */ 5 6#include "opt_atalk.h" 7 8#include <sys/param.h> --- 17 unchanged lines hidden (view full) --- 26 27static void aarptfree( struct aarptab *aat); 28static void at_aarpinput( struct arpcom *ac, struct mbuf *m); 29 30#define AARPTAB_BSIZ 9 31#define AARPTAB_NB 19 32#define AARPTAB_SIZE (AARPTAB_BSIZ * AARPTAB_NB) 33static struct aarptab aarptab[AARPTAB_SIZE]; | 1/* 2 * Copyright (c) 1990,1991 Regents of The University of Michigan. 3 * All Rights Reserved. 4 */ 5 6#include "opt_atalk.h" 7 8#include <sys/param.h> --- 17 unchanged lines hidden (view full) --- 26 27static void aarptfree( struct aarptab *aat); 28static void at_aarpinput( struct arpcom *ac, struct mbuf *m); 29 30#define AARPTAB_BSIZ 9 31#define AARPTAB_NB 19 32#define AARPTAB_SIZE (AARPTAB_BSIZ * AARPTAB_NB) 33static struct aarptab aarptab[AARPTAB_SIZE]; |
| 34static int aarptab_size = AARPTAB_SIZE; | |
| 35 36#define AARPTAB_HASH(a) \ 37 ((((a).s_net << 8 ) + (a).s_node ) % AARPTAB_NB ) 38 39#define AARPTAB_LOOK(aat,addr) { \ 40 int n; \ 41 aat = &aarptab[ AARPTAB_HASH(addr) * AARPTAB_BSIZ ]; \ 42 for ( n = 0; n < AARPTAB_BSIZ; n++, aat++ ) \ --- 575 unchanged lines hidden --- | 34 35#define AARPTAB_HASH(a) \ 36 ((((a).s_net << 8 ) + (a).s_node ) % AARPTAB_NB ) 37 38#define AARPTAB_LOOK(aat,addr) { \ 39 int n; \ 40 aat = &aarptab[ AARPTAB_HASH(addr) * AARPTAB_BSIZ ]; \ 41 for ( n = 0; n < AARPTAB_BSIZ; n++, aat++ ) \ --- 575 unchanged lines hidden --- |