| /linux-6.14.4/include/net/ |
| D | neighbour.h | 5 #include <linux/neighbour.h>
8 * Generic neighbour manipulation
17 * - Add neighbour cache statistics like rtstat
42 struct neighbour;
77 int (*neigh_setup)(struct neighbour *);
138 struct neighbour { struct
160 int (*output)(struct neighbour *, struct sk_buff *); argument
172 void (*solicit)(struct neighbour *, struct sk_buff *); argument
173 void (*error_report)(struct neighbour *, struct sk_buff *);
174 int (*output)(struct neighbour *, struct sk_buff *);
[all …]
|
| D | ndisc.h | 8 * ICMP codes for neighbour discovery messages
61 #include <net/neighbour.h>
146 * This structure defines the hooks for IPv6 neighbour discovery.
158 * void (*update)(const struct net_device *dev, struct neighbour *n,
161 * This function is called when IPv6 ndisc updates the neighbour cache
166 * struct neighbour *neigh, u8 *ha_buf,
201 void (*update)(const struct net_device *dev, struct neighbour *n,
205 struct neighbour *neigh, u8 *ha_buf,
232 struct neighbour *n, u32 flags, in ndisc_ops_update()
252 struct neighbour *neigh, in ndisc_ops_redirect_opt_addr_space()
[all …]
|
| D | arp.h | 8 #include <net/neighbour.h>
22 static inline struct neighbour *__ipv4_neigh_lookup_noref(struct net_device *dev, u32 key) in __ipv4_neigh_lookup_noref()
31 struct neighbour *__ipv4_neigh_lookup_noref(struct net_device *dev, u32 key) in __ipv4_neigh_lookup_noref()
37 static inline struct neighbour *__ipv4_neigh_lookup(struct net_device *dev, u32 key) in __ipv4_neigh_lookup()
39 struct neighbour *n; in __ipv4_neigh_lookup()
52 struct neighbour *n; in __ipv4_confirm_neigh()
|
| D | netevent.h | 16 struct neighbour;
22 struct neighbour *neigh;
27 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
|
| D | atmclip.h | 15 #include <net/neighbour.h>
42 struct neighbour *neigh; /* neighbour back-pointer */
|
| /linux-6.14.4/Documentation/netlink/specs/ |
| D | rt_neigh.yaml | 8 IP neighbour management over rtnetlink.
181 name: neighbour-attrs
341 doc: Add new neighbour entry
343 attribute-set: neighbour-attrs
347 attributes: &neighbour-all
362 doc: Remove an existing neighbour entry
364 attribute-set: neighbour-attrs
373 doc: Notify a neighbour deletion
379 doc: Get or dump neighbour entries
381 attribute-set: neighbour-attrs
[all …]
|
| /linux-6.14.4/net/netrom/ |
| D | nr_route.c | 95 * neighbour if it is new.
116 * The L2 link to a neighbour has failed in the past in nr_add_node()
117 * and now a frame comes from this neighbour. We assume in nr_add_node()
128 if (nr_nodet->routes[i].neighbour == nr_neigh) in nr_add_node()
201 nr_node->routes[0].neighbour = nr_neigh; in nr_add_node()
220 if (nr_node->routes[i].neighbour == nr_neigh) { in nr_add_node()
236 nr_node->routes[0].neighbour = nr_neigh; in nr_add_node()
245 nr_node->routes[2].neighbour->count--; in nr_add_node()
246 nr_neigh_put(nr_node->routes[2].neighbour); in nr_add_node()
248 if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked) in nr_add_node()
[all …]
|
| /linux-6.14.4/drivers/net/ethernet/sfc/ |
| D | tc_encap_actions.h | 20 * struct efx_neigh_binder - driver state for a neighbour entry
24 * @ha: the hardware (Ethernet) address of the neighbour
25 * @n_valid: true if the neighbour is in NUD_VALID state
34 * When counter reads update this, a new neighbour event is sent to
35 * indicate that the neighbour entry is still in use.
38 * @work: processes neighbour state changes, updates the encap actions
41 * Associates a neighbour entry with the encap actions that are
43 * neighbour details change.
|
| /linux-6.14.4/net/core/ |
| D | neighbour.c | 11 * Harald Welte Add neighbour cache statistics like rtstat
28 #include <net/neighbour.h>
53 static void __neigh_notify(struct neighbour *n, int type, int flags,
55 static void neigh_update_notify(struct neighbour *neigh, u32 nlmsg_pid);
83 Neighbour hash table buckets are protected with rwlock tbl->lock.
88 It will result in deadlocks, if backend/driver wants to use neighbour
93 Neighbour entries are protected:
107 not make callbacks to neighbour tables.
110 static int neigh_blackhole(struct neighbour *neigh, struct sk_buff *skb) in neigh_blackhole()
116 static void neigh_cleanup_and_release(struct neighbour *neigh) in neigh_cleanup_and_release()
[all …]
|
| /linux-6.14.4/net/rose/ |
| D | rose_route.c | 49 * neighbour if it is new.
77 if (ax25cmp(&rose_route->neighbour, in rose_add_node()
91 rose_neigh->callsign = rose_route->neighbour; in rose_add_node()
161 rose_node->neighbour[0] = rose_neigh; in rose_add_node()
187 rose_node->neighbour[rose_node->count] = rose_neigh; in rose_add_node()
318 if (ax25cmp(&rose_route->neighbour, in rose_del_node()
331 if (rose_node->neighbour[i] == rose_neigh) { in rose_del_node()
344 rose_node->neighbour[0] = in rose_del_node()
345 rose_node->neighbour[1]; in rose_del_node()
348 rose_node->neighbour[1] = in rose_del_node()
[all …]
|
| D | rose_in.c | 59 rose->neighbour->use--; in rose_state1_machine()
82 rose->neighbour->use--; in rose_state2_machine()
87 rose->neighbour->use--; in rose_state2_machine()
123 rose->neighbour->use--; in rose_state3_machine()
236 rose->neighbour->use--; in rose_state4_machine()
256 rose_sk(sk)->neighbour->use--; in rose_state5_machine()
|
| /linux-6.14.4/include/trace/events/ |
| D | neigh.h | 10 #include <net/neighbour.h>
26 const void *pkey, const struct neighbour *n,
74 TP_PROTO(struct neighbour *n, const u8 *lladdr, u8 new,
157 TP_PROTO(struct neighbour *n, int err),
228 TP_PROTO(struct neighbour *neigh, int err),
233 TP_PROTO(struct neighbour *neigh, int err),
238 TP_PROTO(struct neighbour *neigh, int err),
243 TP_PROTO(struct neighbour *neigh, int err),
248 TP_PROTO(struct neighbour *neigh, int rc),
|
| /linux-6.14.4/net/x25/ |
| D | x25_subr.c | 55 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; in x25_frames_acked()
94 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; in x25_validate_nr()
168 if (x25->neighbour->extended) { in x25_write_internal()
190 x25->neighbour->global_facil_mask); in x25_write_internal()
235 if (x25->neighbour->extended) { in x25_write_internal()
254 x25_transmit_link(skb, x25->neighbour); in x25_write_internal()
289 if (x25->neighbour->extended) { in x25_decode()
309 if (x25->neighbour->extended) { in x25_decode()
360 if (x25->neighbour) { in x25_disconnect()
362 x25_neigh_put(x25->neighbour); in x25_disconnect()
[all …]
|
| D | x25_out.c | 54 int header_len = x25->neighbour->extended ? X25_EXT_MIN_LEN : in x25_output()
94 if (x25->neighbour->extended) in x25_output()
123 if (x25->neighbour->extended) { in x25_send_iframe()
133 x25_transmit_link(skb, x25->neighbour); in x25_send_iframe()
153 x25_transmit_link(skb, x25->neighbour); in x25_kick()
162 modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; in x25_kick()
|
| /linux-6.14.4/net/batman-adv/ |
| D | originator.c | 521 * batadv_neigh_node_get() - retrieve a neighbour from the list
522 * @orig_node: originator which the neighbour belongs to
523 * @hard_iface: the interface where this neighbour is connected to
524 * @addr: the address of the neighbour
526 * Looks for and possibly returns a neighbour belonging to this originator list
558 * batadv_hardif_neigh_create() - create a hardif neighbour node
559 * @hard_iface: the interface this neighbour is connected to
560 * @neigh_addr: the interface address of the neighbour to retrieve
561 * @orig_node: originator object representing the neighbour
563 * Return: the hardif neighbour node if found or created or NULL otherwise.
[all …]
|
| D | bat_v_elp.c | 74 * batadv_v_elp_get_throughput() - get the throughput towards a neighbour
75 * @neigh: the neighbour for which the throughput has to be obtained
76 * @pthroughput: calculated throughput towards the given neighbour in multiples
198 * metric of a single hop neighbour
199 * @neigh: the neighbour to probe
215 * batadv_v_elp_wifi_neigh_probe() - send link probing packets to a neighbour
216 * @neigh: the neighbour to probe
218 * Sends a predefined number of unicast wifi packets to a given neighbour in
221 * this neighbour..
488 * batadv_v_elp_neigh_update() - update an ELP neighbour node
[all …]
|
| /linux-6.14.4/drivers/net/ethernet/chelsio/cxgb4/ |
| D | l2t.h | 60 struct neighbour;
78 struct neighbour *neigh; /* associated neighbour */
88 u8 dmac[ETH_ALEN]; /* neighbour's MAC address */
113 struct l2t_entry *cxgb4_l2t_get(struct l2t_data *d, struct neighbour *neigh,
118 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh);
|
| /linux-6.14.4/drivers/net/ethernet/chelsio/cxgb3/ |
| D | l2t.h | 46 struct neighbour;
64 struct neighbour *neigh; /* associated neighbour */
70 u8 dmac[6]; /* neighbour's MAC address */
111 void t3_l2t_update(struct t3cdev *dev, struct neighbour *neigh);
|
| /linux-6.14.4/drivers/net/ethernet/netronome/nfp/flower/ |
| D | tunnel_conf.c | 80 * struct nfp_tun_req_route_ipv4 - NFP requests a route/neighbour lookup
92 * struct nfp_tun_req_route_ipv6 - NFP requests an IPv6 route/neighbour lookup
164 * struct nfp_neigh_update_work - update neighbour information to nfp
166 * @n: neighbour entry
171 struct neighbour *n;
213 struct neighbour *n; in nfp_tunnel_keep_alive()
242 /* Update the used timestamp of neighbour */ in nfp_tunnel_keep_alive()
255 struct neighbour *n; in nfp_tunnel_keep_alive_v6()
284 /* Update the used timestamp of neighbour */ in nfp_tunnel_keep_alive_v6()
467 void *flow, struct neighbour *neigh, bool is_ipv6, in nfp_tun_write_neigh()
[all …]
|
| D | main.h | 96 * @neigh_nb: Notifier to monitor neighbour state
119 * struct nfp_tun_neigh - basic neighbour data
131 * struct nfp_tun_neigh_ext - extended neighbour data
143 * struct nfp_tun_neigh_v4 - neighbour/route entry on the NFP for IPv4
146 * @common: Neighbour/route common info
147 * @ext: Neighbour/route extended info
159 * struct nfp_tun_neigh_v6 - neighbour/route entry on the NFP for IPv6
162 * @common: Neighbour/route common info
163 * @ext: Neighbour/route extended info
179 * @payload: The neighbour info payload
|
| /linux-6.14.4/net/atm/ |
| D | clip.c | 120 /* The neighbour entry n->lock is held. */
121 static int neigh_check_cb(struct neighbour *n) in neigh_check_cb()
266 static void clip_neigh_solicit(struct neighbour *neigh, struct sk_buff *skb) in clip_neigh_solicit()
274 static void clip_neigh_error(struct neighbour *neigh, struct sk_buff *skb) in clip_neigh_error()
290 static int clip_constructor(struct net_device *dev, struct neighbour *neigh) in clip_constructor()
314 * to allocate the neighbour entry but not to ask atmarpd for resolution. Also,
334 struct neighbour *n; in clip_start_xmit()
355 pr_err("NO NEIGHBOUR !\n"); in clip_start_xmit()
377 pr_debug("using neighbour %p, vcc %p\n", n, vcc); in clip_start_xmit()
446 struct neighbour *neigh; in clip_setentry()
[all …]
|
| /linux-6.14.4/tools/testing/selftests/net/ |
| D | ndisc_unsolicited_na_test.sh | 83 # doesn't add neighbour entries.
149 # Neighbour entry expected to be present for 011 case
152 # Neighbour entry expected to be absent for all other cases
163 # and add a delay to ensure neighbour processing is done.
167 # Verify the neighbour table
|
| /linux-6.14.4/include/uapi/linux/ |
| D | neighbour.h | 105 * Neighbour tables specific messages.
107 * To retrieve the neighbour tables send RTM_GETNEIGHTBL with the
108 * NLM_F_DUMP flag set. Every neighbour table configuration is
121 * To change neighbour table attributes, send RTM_SETNEIGHTBL
|
| /linux-6.14.4/drivers/net/ethernet/marvell/prestera/ |
| D | prestera_router.c | 33 /* Indicate if neighbour is reachable by direct route */
151 prestera_util_neigh2nc_key(struct prestera_switch *sw, struct neighbour *n, in prestera_util_neigh2nc_key()
294 static void prestera_util_kern_set_neigh_offload(struct neighbour *n, in prestera_util_kern_set_neigh_offload()
390 /* Decided, that uc_nh route with key==nh is obviously neighbour route */
432 struct neighbour *n) in prestera_neigh_iface_init()
684 struct neighbour *n; in __prestera_k_arb_n_offload_set()
738 /* But better to use tb_id of route, which pointed to this neighbour. */ in __prestera_k_arb_n_lpm_set()
784 /* Kernel neighbour -> neigh_cache info */
789 struct neighbour *n; in __prestera_k_arb_nc_kern_n_fetch()
873 * place for neighbour entry. So represent direct route in __prestera_pr_k_arb_fc_lpm_info_calc()
[all …]
|
| /linux-6.14.4/net/ipv6/ |
| D | ndisc.c | 3 * Neighbour Discovery for IPv6
75 static bool ndisc_key_eq(const struct neighbour *neigh, const void *pkey);
78 static int ndisc_constructor(struct neighbour *neigh);
79 static void ndisc_solicit(struct neighbour *neigh, struct sk_buff *skb);
80 static void ndisc_error_report(struct neighbour *neigh, struct sk_buff *skb);
324 static bool ndisc_key_eq(const struct neighbour *n, const void *pkey) in ndisc_key_eq()
329 static int ndisc_constructor(struct neighbour *neigh) in ndisc_constructor()
727 static void ndisc_error_report(struct neighbour *neigh, struct sk_buff *skb) in ndisc_error_report()
739 static void ndisc_solicit(struct neighbour *neigh, struct sk_buff *skb) in ndisc_solicit()
782 void ndisc_update(const struct net_device *dev, struct neighbour *neigh, in ndisc_update()
[all …]
|