l2t_entry
struct l2t_entry *e)
arpq_enqueue(struct l2t_entry *e, struct mbuf *m)
struct l2t_entry *e)
t3_l2t_send_event(struct toedev *dev, struct l2t_entry *e)
static struct l2t_entry *
struct l2t_entry *end, *e, **p;
t3_l2e_free(struct l2t_data *d, struct l2t_entry *e)
reuse_entry(struct l2t_entry *e, struct rtentry *neigh)
struct l2t_entry *
struct l2t_entry *e;
struct l2t_entry *e;
struct l2t_entry *e;
struct l2t_entry *e = (struct l2t_entry *)data;
int i, size = sizeof(*d) + l2t_capacity * sizeof(struct l2t_entry);
l2e_state(const struct l2t_entry *e)
struct l2t_entry *e = v;
vlan_prio(const struct l2t_entry *e)
neigh_replace(struct l2t_entry *e, struct rtentry *rt)
void t3_l2e_free(struct l2t_data *d, struct l2t_entry *e);
struct l2t_entry *t3_l2t_get(struct toedev *dev, struct rtentry *neigh,
struct l2t_entry *e);
void t3_l2t_send_event(struct toedev *dev, struct l2t_entry *e);
struct l2t_entry *e)
static __inline void l2t_release(struct l2t_data *d, struct l2t_entry *e)
static __inline void l2t_hold(struct l2t_data *d, struct l2t_entry *e)
struct l2t_entry *first; /* start of hash chain */
struct l2t_entry *next; /* next l2t_entry on chain */
struct l2t_entry *rover; /* starting point for next allocation */
struct l2t_entry l2tab[0];
set_l2t_ix(struct toedev *tdev, u32 tid, struct l2t_entry *e)
struct l2t_entry *e;
struct l2t_entry *l2t);