Home
last modified time | relevance | path

Searched full:neighbour (Results 1 – 25 of 131) sorted by relevance

123456

/linux/drivers/net/ethernet/sfc/
H A Dtc_encap_actions.h20 * 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/include/net/
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 Dnetevent.h16 struct neighbour;
22 struct neighbour *neigh;
27 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
/linux/net/core/
H A Dneighbour.c11 * Harald Welte Add neighbour cache statistics like rtstat
28 #include <net/neighbour.h>
54 static void neigh_notify(struct neighbour *n, int type, int flags, u32 pid);
55 static void __neigh_notify(struct neighbour *n, int type, int flags, u32 pid);
83 Neighbour hash table buckets are protected with 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/net/batman-adv/
H A Doriginator.c519 * batadv_neigh_node_get() - retrieve a neighbour from the list
520 * @orig_node: originator which the neighbour belongs to
521 * @hard_iface: the interface where this neighbour is connected to
522 * @addr: the address of the neighbour
524 * Looks for and possibly returns a neighbour belonging to this originator list
556 * batadv_hardif_neigh_create() - create a hardif neighbour node
557 * @hard_iface: the interface this neighbour is connected to
558 * @neigh_addr: the interface address of the neighbour to retrieve
559 * @orig_node: originator object representing the neighbour
561 * Return: the hardif neighbour node if found or created or NULL otherwise.
[all …]
H A Dbat_v_elp.c73 * batadv_v_elp_get_throughput() - get the throughput towards a neighbour
74 * @neigh: the neighbour for which the throughput has to be obtained
75 * @pthroughput: calculated throughput towards the given neighbour in multiples
205 * metric of a single hop neighbour
206 * @neigh: the neighbour to probe
222 * batadv_v_elp_wifi_neigh_probe() - send link probing packets to a neighbour
223 * @neigh: the neighbour to probe
225 * Sends a predefined number of unicast wifi packets to a given neighbour in
228 * this neighbour..
492 * batadv_v_elp_neigh_update() - update an ELP neighbour node
[all …]
/linux/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),
/linux/net/x25/
H A Dx25_subr.c56 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; in x25_frames_acked()
95 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; in x25_validate_nr()
169 if (x25->neighbour->extended) { in x25_write_internal()
191 x25->neighbour->global_facil_mask); in x25_write_internal()
236 if (x25->neighbour->extended) { in x25_write_internal()
255 x25_transmit_link(skb, x25->neighbour); in x25_write_internal()
290 if (x25->neighbour->extended) { in x25_decode()
310 if (x25->neighbour->extended) { in x25_decode()
361 if (x25->neighbour) { in x25_disconnect()
363 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()
H A Daf_x25.c306 * Find a connected X.25 socket given my LCI and neighbour.
313 if (x25_sk(s)->lci == lci && x25_sk(s)->neighbour == nb) { in __x25_find_socket()
789 x25->neighbour = x25_get_neigh(rt->dev); in x25_connect()
790 if (!x25->neighbour) in x25_connect()
793 x25_limit_facilities(&x25->facilities, x25->neighbour); in x25_connect()
795 x25->lci = x25_new_lci(x25->neighbour); in x25_connect()
831 if (rc && x25->neighbour) { in x25_connect()
833 x25_neigh_put(x25->neighbour); in x25_connect()
834 x25->neighbour = NULL; in x25_connect()
1031 * current neighbour/lin in x25_rx_call_request()
[all...]
H A Dx25_proc.c93 if (!x25->neighbour || !x25->neighbour->dev) in x25_seq_socket_show()
96 devname = x25->neighbour->dev->name; in x25_seq_socket_show()
H A Dx25_link.c293 * __x25_remove_neigh - remove neighbour from x25_neigh_list
296 * Remove neighbour from x25_neigh_list. If it was there.
330 * Given a device, return the neighbour address.
403 * Release all memory associated with X.25 neighbour structures.
/linux/drivers/net/ethernet/chelsio/cxgb3/
H A Dl2t.h46 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);
H A Dl2t.c39 #include <net/neighbour.h>
74 static inline void neigh_replace(struct l2t_entry *e, struct neighbour *n) in neigh_replace()
246 static inline void reuse_entry(struct l2t_entry *e, struct neighbour *neigh) in reuse_entry()
269 struct neighbour *neigh; in t3_l2t_get()
362 void t3_l2t_update(struct t3cdev *dev, struct neighbour *neigh) in t3_l2t_update()
H A Dt3cdev.h40 #include <net/neighbour.h>
61 void (*neigh_update)(struct t3cdev *dev, struct neighbour *neigh);
/linux/drivers/net/ethernet/netronome/nfp/flower/
H A Dmain.h96 * @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/tools/testing/selftests/net/
H A Dndisc_unsolicited_na_test.sh83 # 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/drivers/net/ethernet/marvell/prestera/
H A Dprestera_router.c33 /* 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/include/uapi/linux/
H A Dneighbour.h110 * Neighbour tables specific messages.
112 * To retrieve the neighbour tables send RTM_GETNEIGHTBL with the
113 * NLM_F_DUMP flag set. Every neighbour table configuration is
126 * To change neighbour table attributes, send RTM_SETNEIGHTBL
/linux/tools/include/uapi/linux/
H A Dneighbour.h110 * Neighbour tables specific messages.
112 * To retrieve the neighbour tables send RTM_GETNEIGHTBL with the
113 * NLM_F_DUMP flag set. Every neighbour table configuration is
126 * To change neighbour table attributes, send RTM_SETNEIGHTBL
/linux/net/ipv6/
H A Dndisc.c3 * 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);
320 static bool ndisc_key_eq(const struct neighbour *n, const void *pkey) in ndisc_key_eq()
325 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()
779 void ndisc_update(const struct net_device *dev, struct neighbour *neigh, in ndisc_update()
[all …]
/linux/net/mctp/
H A Dneigh.c70 /* Removes all neighbour entries referring to a device */
136 NL_SET_ERR_MSG(extack, "Neighbour EID must be specified"); in mctp_rtm_newneigh()
141 NL_SET_ERR_MSG(extack, "Neighbour lladdr must be specified"); in mctp_rtm_newneigh()
147 NL_SET_ERR_MSG(extack, "Invalid neighbour EID"); in mctp_rtm_newneigh()
192 NL_SET_ERR_MSG(extack, "Neighbour EID must be specified"); in mctp_rtm_delneigh()
/linux/net/ipv4/
H A Darp.c61 * now it is in net/core/neighbour.c.
120 * Interface to generic neighbour cache.
123 static bool arp_key_eq(const struct neighbour *n, const void *pkey);
124 static int arp_constructor(struct neighbour *neigh);
125 static void arp_solicit(struct neighbour *neigh, struct sk_buff *skb);
126 static void arp_error_report(struct neighbour *neigh, struct sk_buff *skb);
218 static bool arp_key_eq(const struct neighbour *neigh, const void *pkey) in arp_key_eq()
223 static int arp_constructor(struct neighbour *neigh) in arp_constructor()
294 static void arp_error_report(struct neighbour *neigh, struct sk_buff *skb) in arp_error_report()
333 static void arp_solicit(struct neighbour *neigh, struct sk_buff *skb) in arp_solicit()
[all …]
/linux/drivers/net/ethernet/rocker/
H A Drocker.h15 #include <net/neighbour.h>
127 struct neighbour *n);
129 struct neighbour *n);
/linux/net/6lowpan/
H A Dndisc.c50 static void lowpan_ndisc_802154_update(struct neighbour *n, u32 flags, in lowpan_ndisc_802154_update()
95 struct neighbour *n, u32 flags, u8 icmp6_type, in lowpan_ndisc_update()
107 u8 icmp6_type, struct neighbour *neigh, in lowpan_ndisc_opt_addr_space()

123456