Lines Matching defs:hash
78 * neighbors to be on the same hash chain. We keep v4 entries in the first
79 * half of available hash buckets and v6 in the second. We need at least two
115 * family, something made trivial by the separation of IP and IPv6 hash chains
284 * presently in the hash table. We need to remove it.
287 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
326 * presently in the hash table. We need to remove it.
329 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
341 /* Called when an L2T entry has no more users. The entry is left in the hash
425 int hash = addr_hash(d, addr, addr_len, ifidx);
440 for (e = d->l2tab[hash].first; e; e = e->next)
458 e->hash = hash;
464 e->next = d->l2tab[hash].first;
465 d->l2tab[hash].first = e;
513 int hash, ifidx = neigh->dev->ifindex;
518 hash = addr_hash(d, addr, addr_len, ifidx);
520 for (e = d->l2tab[hash].first; e; e = e->next)
574 * explicitly freed and while busy they are not on any hash chain, so normal