Home
last modified time | relevance | path

Searched refs:neighbour (Results 1 - 25 of 218) sorted by relevance

123456789

/kernel/linux/linux-5.10/include/net/
H A Dneighbour.h5 #include <linux/neighbour.h>
8 * Generic neighbour manipulation
17 * - Add neighbour cache statistics like rtstat
41 struct neighbour;
74 int (*neigh_setup)(struct neighbour *);
134 struct neighbour { struct
135 struct neighbour __rcu *next;
155 int (*output)(struct neighbour *, struct sk_buff *);
165 void (*solicit)(struct neighbour *, struct sk_buff *);
166 void (*error_report)(struct neighbour *, struc
[all...]
H A Darp.h8 #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()
59 /* avoid dirtying neighbour */ in __ipv4_confirm_neigh()
H A Dndisc.h8 * ICMP codes for neighbour discovery messages
61 #include <net/neighbour.h>
146 * This structure defines the hooks for IPv6 neighbour discovery.
163 * void (*update)(const struct net_device *dev, struct neighbour *n,
166 * This function is called when IPv6 ndisc updates the neighbour cache
171 * struct neighbour *neigh, u8 *ha_buf,
207 void (*update)(const struct net_device *dev, struct neighbour *n,
211 struct neighbour *neigh, u8 *ha_buf,
247 struct neighbour *n, u32 flags, in ndisc_ops_update()
267 struct neighbour *neig in ndisc_ops_redirect_opt_addr_space()
[all...]
H A Dnetevent.h16 struct neighbour;
21 struct neighbour *neigh;
26 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
/kernel/linux/linux-6.6/include/net/
H A Dneighbour.h5 #include <linux/neighbour.h>
8 * Generic neighbour manipulation
17 * - Add neighbour cache statistics like rtstat
41 struct neighbour;
76 int (*neigh_setup)(struct neighbour *);
137 struct neighbour { struct
138 struct neighbour __rcu *next;
158 int (*output)(struct neighbour *, struct sk_buff *);
170 void (*solicit)(struct neighbour *, struct sk_buff *);
171 void (*error_report)(struct neighbour *, struc
[all...]
H A Darp.h8 #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()
H A Dndisc.h8 * ICMP codes for neighbour discovery messages
61 #include <net/neighbour.h>
146 * This structure defines the hooks for IPv6 neighbour discovery.
163 * void (*update)(const struct net_device *dev, struct neighbour *n,
166 * This function is called when IPv6 ndisc updates the neighbour cache
171 * struct neighbour *neigh, u8 *ha_buf,
207 void (*update)(const struct net_device *dev, struct neighbour *n,
211 struct neighbour *neigh, u8 *ha_buf,
247 struct neighbour *n, u32 flags, in ndisc_ops_update()
267 struct neighbour *neig in ndisc_ops_redirect_opt_addr_space()
[all...]
H A Dnetevent.h16 struct neighbour;
22 struct neighbour *neigh;
27 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
/kernel/linux/common_modules/newip/third_party/linux-5.10/include/net/
H A Dnndisc.h9 #include <net/neighbour.h>
28 static inline bool neigh_key_eq800(const struct neighbour *n, const void *pkey) in neigh_key_eq800()
46 static inline struct neighbour *__nip_neigh_lookup_noref(struct net_device *dev, in __nip_neigh_lookup_noref()
53 static inline struct neighbour *__nip_neigh_lookup(struct net_device *dev, in __nip_neigh_lookup()
56 struct neighbour *n; in __nip_neigh_lookup()
/kernel/linux/linux-5.10/net/x25/
H A Dx25_subr.c55 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...]
H A Dx25_out.c54 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()
/kernel/linux/linux-6.6/net/x25/
H A Dx25_subr.c55 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...]
H A Dx25_out.c54 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()
/kernel/linux/linux-5.10/net/netrom/
H A Dnr_route.c95 * 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 in nr_add_node()
323 nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev) nr_del_node() argument
[all...]
/kernel/linux/linux-6.6/net/netrom/
H A Dnr_route.c95 * 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 in nr_add_node()
324 nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev) nr_del_node() argument
[all...]
/kernel/linux/linux-5.10/net/core/
H A Dneighbour.c11 * 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) in neigh_blackhole()
99 static void neigh_cleanup_and_release(struct neighbour *neigh) in neigh_cleanup_and_release()
119 static void neigh_mark_dead(struct neighbour *n) in neigh_mark_dead()
128 static void neigh_update_gc_list(struct neighbour *
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dneigh.h10 #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),
/kernel/linux/linux-6.6/include/trace/events/
H A Dneigh.h10 #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),
/kernel/linux/linux-5.10/drivers/net/ethernet/chelsio/cxgb4/
H A Dl2t.h60 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,
120 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh);
/kernel/linux/linux-6.6/drivers/net/ethernet/chelsio/cxgb4/
H A Dl2t.h60 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,
120 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh);
/kernel/linux/linux-5.10/net/rose/
H A Drose_route.c49 * 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[ in rose_del_node()
[all...]
H A Drose_in.c58 rose->neighbour->use--; in rose_state1_machine()
81 rose->neighbour->use--; in rose_state2_machine()
86 rose->neighbour->use--; in rose_state2_machine()
122 rose->neighbour->use--; in rose_state3_machine()
235 rose->neighbour->use--; in rose_state4_machine()
255 rose_sk(sk)->neighbour->use--; in rose_state5_machine()
/kernel/linux/linux-6.6/net/rose/
H A Drose_route.c49 * 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[ in rose_del_node()
[all...]
H A Drose_in.c59 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()
/kernel/linux/linux-6.6/net/core/
H A Dneighbour.c11 * Harald Welte Add neighbour cache statistics like rtstat
29 #include <net/neighbour.h>
54 static void __neigh_notify(struct neighbour *n, int type, int flags,
56 static void neigh_update_notify(struct neighbour *neigh, u32 nlmsg_pid);
70 It will result in deadlocks, if backend/driver wants to use neighbour
89 not make callbacks to neighbour tables.
92 static int neigh_blackhole(struct neighbour *neigh, struct sk_buff *skb) in neigh_blackhole()
98 static void neigh_cleanup_and_release(struct neighbour *neigh) in neigh_cleanup_and_release()
118 static void neigh_mark_dead(struct neighbour *n) in neigh_mark_dead()
129 static void neigh_update_gc_list(struct neighbour *
[all...]

Completed in 21 milliseconds

123456789