Searched refs:l2tab (Results 1 – 3 of 3) sorted by relevance
62 struct l2t_entry l2tab[]; /* MUST BE LAST */ member304 for (e = &d->l2tab[0], end = &d->l2tab[d->l2t_size]; e != end; ++e) { in find_or_alloc_l2e()440 for (e = d->l2tab[hash].first; e; e = e->next) in cxgb4_l2t_get()464 e->next = d->l2tab[hash].first; in cxgb4_l2t_get()465 d->l2tab[hash].first = e; in cxgb4_l2t_get()649 d->rover = d->l2tab; in t4_init_l2t()654 d->l2tab[i].idx = i; in t4_init_l2t()655 d->l2tab[i].state = L2T_STATE_UNUSED; in t4_init_l2t()656 spin_lock_init(&d->l2tab[i].lock); in t4_init_l2t()657 atomic_set(&d->l2tab[i].refcnt, 0); in t4_init_l2t()[all …]
243 for (p = &d->l2tab[hash].first; *p; p = &(*p)->next) in alloc_l2e()334 for (e = d->l2tab[hash].first; e; e = e->next) in t3_l2t_get()347 e->next = d->l2tab[hash].first; in t3_l2t_get()348 d->l2tab[hash].first = e; in t3_l2t_get()409 for (e = d->l2tab[hash].first; e; e = e->next) in t3_l2t_update()453 d->rover = &d->l2tab[1]; /* entry 0 is not used */ in t3_init_l2t()458 d->l2tab[i].idx = i; in t3_init_l2t()459 d->l2tab[i].state = L2T_STATE_UNUSED; in t3_init_l2t()460 __skb_queue_head_init(&d->l2tab[i].arpq); in t3_init_l2t()461 spin_lock_init(&d->l2tab[i].lock); in t3_init_l2t()[all …]
79 struct l2t_entry l2tab[]; member
Completed in 9 milliseconds