Lines Matching refs:neighbour
11 * Harald Welte Add neighbour cache statistics like rtstat
29 #include <net/neighbour.h>
55 static void __neigh_notify(struct neighbour *n, int type, int flags,
57 static void neigh_update_notify(struct neighbour *neigh, u32 nlmsg_pid);
71 It will result in deadlocks, if backend/driver wants to use neighbour
90 not make callbacks to neighbour tables.
93 static int neigh_blackhole(struct neighbour *neigh, struct sk_buff *skb)
99 static void neigh_cleanup_and_release(struct neighbour *neigh)
119 static void neigh_mark_dead(struct neighbour *n)
128 static void neigh_update_gc_list(struct neighbour *n)
159 static bool neigh_update_ext_learned(struct neighbour *neigh, u32 flags,
181 static bool neigh_del(struct neighbour *n, struct neighbour __rcu **np,
188 struct neighbour *neigh;
202 bool neigh_remove_one(struct neighbour *ndel, struct neigh_table *tbl)
207 struct neighbour *n;
208 struct neighbour __rcu **np;
231 struct neighbour *n, *tmp;
271 static void neigh_add_timer(struct neighbour *n, unsigned long when)
291 static int neigh_del_timer(struct neighbour *n)
336 struct neighbour *n;
337 struct neighbour __rcu **np = &nht->hash_buckets[i];
357 We must destroy neighbour entry,
414 static struct neighbour *neigh_alloc(struct neigh_table *tbl,
418 struct neighbour *n = NULL;
477 size_t size = (1 << shift) * sizeof(struct neighbour *);
479 struct neighbour __rcu **buckets;
488 buckets = (struct neighbour __rcu **)
509 size_t size = (1 << nht->hash_shift) * sizeof(struct neighbour *);
510 struct neighbour __rcu **buckets = nht->hash_buckets;
536 struct neighbour *n, *next;
562 struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
565 struct neighbour *n;
582 static struct neighbour *
588 struct neighbour *n1, *rc, *n;
677 struct neighbour *__neigh_create(struct neigh_table *tbl, const void *pkey,
833 * neighbour must already be out of the table;
836 void neigh_destroy(struct neighbour *neigh)
843 pr_warn("Destroying alive neighbour %p\n", neigh);
874 static void neigh_suspect(struct neighbour *neigh)
886 static void neigh_connect(struct neighbour *neigh)
896 struct neighbour *n;
897 struct neighbour __rcu **np;
980 static __inline__ int neigh_max_probes(struct neighbour *n)
988 static void neigh_invalidate(struct neighbour *neigh)
999 routine. Particularly, it can hit the same neighbour entry!
1013 static void neigh_probe(struct neighbour *neigh)
1027 /* Called when a timer expires for a neighbour entry. */
1032 struct neighbour *neigh = from_timer(neigh, t, timer);
1118 int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
1200 static void neigh_update_hhs(struct neighbour *neigh)
1234 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
1240 static int __neigh_update(struct neighbour *neigh, const u8 *lladdr,
1316 /* Update confirmed timestamp for neighbour entry after we
1344 * neighbour entry. Otherwise we risk to move the locktime window with
1387 struct neighbour *n2, *n1 = neigh;
1431 int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
1441 void __neigh_set_probe_once(struct neighbour *neigh)
1456 struct neighbour *neigh_event_ns(struct neigh_table *tbl,
1460 struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
1470 static void neigh_hh_init(struct neighbour *n)
1489 int neigh_resolve_output(struct neighbour *neigh, struct sk_buff *skb)
1524 int neigh_connected_output(struct neighbour *neigh, struct sk_buff *skb)
1547 int neigh_direct_output(struct neighbour *neigh, struct sk_buff *skb)
1710 panic("cannot create neighbour cache statistics");
1715 panic("cannot create neighbour proc dir entry");
1724 panic("cannot allocate neighbour cache hashes");
1727 tbl->entry_size = ALIGN(offsetof(struct neighbour, primary_key) +
1756 pr_crit("neighbour leakage\n");
1818 struct neighbour *neigh;
1886 struct neighbour *neigh;
2450 static int neigh_fill_info(struct sk_buff *skb, struct neighbour *neigh,
2540 static void neigh_update_notify(struct neighbour *neigh, u32 nlmsg_pid)
2578 struct neighbour *n;
2842 static int neigh_get_reply(struct net *net, struct neighbour *neigh,
2897 struct neighbour *neigh;
2926 NL_SET_ERR_MSG(extack, "Proxy neighbour entry not found");
2952 void neigh_for_each(struct neigh_table *tbl, void (*cb)(struct neighbour *, void *), void *cookie)
2962 struct neighbour *n;
2976 int (*cb)(struct neighbour *))
2984 struct neighbour *n;
2985 struct neighbour __rcu **np;
3015 struct neighbour *neigh;
3055 static struct neighbour *neigh_get_first(struct seq_file *seq)
3060 struct neighbour *n = NULL;
3094 static struct neighbour *neigh_get_next(struct seq_file *seq,
3095 struct neighbour *n,
3142 static struct neighbour *neigh_get_idx(struct seq_file *seq, loff_t *pos)
3144 struct neighbour *n = neigh_get_first(seq);
3373 static void __neigh_notify(struct neighbour *n, int type, int flags,
3398 void neigh_app_ns(struct neighbour *n)
3688 * applied after the next neighbour update instead of waiting for