Lines Matching defs:l2tab
58 unsigned int l2t_size; /* number of entries in l2tab */
62 struct l2t_entry l2tab[]; /* MUST BE LAST */
200 struct l2t_entry *e = &d->l2tab[l2t_idx - d->l2t_start];
272 for (e = d->rover, end = &d->l2tab[d->l2t_size]; e != end; ++e)
276 for (e = d->l2tab; atomic_read(&e->refcnt); ++e)
287 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
304 for (e = &d->l2tab[0], end = &d->l2tab[d->l2t_size]; e != end; ++e) {
329 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
363 d = container_of(e, struct l2t_data, l2tab[e->idx]);
382 d = container_of(e, struct l2t_data, l2tab[e->idx]);
440 for (e = d->l2tab[hash].first; e; e = e->next)
464 e->next = d->l2tab[hash].first;
465 d->l2tab[hash].first = e;
520 for (e = d->l2tab[hash].first; e; e = e->next)
642 d = kvzalloc(struct_size(d, l2tab, l2t_size), GFP_KERNEL);
649 d->rover = d->l2tab;
654 d->l2tab[i].idx = i;
655 d->l2tab[i].state = L2T_STATE_UNUSED;
656 spin_lock_init(&d->l2tab[i].lock);
657 atomic_set(&d->l2tab[i].refcnt, 0);
658 skb_queue_head_init(&d->l2tab[i].arpq);
667 return pos >= d->l2t_size ? NULL : &d->l2tab[pos];