Home
last modified time | relevance | path

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

1234567

/linux/Documentation/netlink/specs/ !
H A Drt-neigh.yaml9 IP neighbour management over rtnetlink.
187 name: neighbour-attrs
351 doc: Add new neighbour entry
353 attribute-set: neighbour-attrs
357 attributes: &neighbour-all
372 doc: Remove an existing neighbour entry
374 attribute-set: neighbour-attrs
383 doc: Notify a neighbour deletion
389 doc: Get or dump neighbour entries
391 attribute-set: neighbour-attrs
[all …]
/linux/include/net/ !
H A Dndisc.h8 * ICMP codes for neighbour discovery messages
61 #include <net/neighbour.h>
137 * This structure defines the hooks for IPv6 neighbour discovery.
149 * void (*update)(const struct net_device *dev, struct neighbour *n,
152 * This function is called when IPv6 ndisc updates the neighbour cache
157 * struct neighbour *neigh, u8 *ha_buf,
192 void (*update)(const struct net_device *dev, struct neighbour *n,
196 struct neighbour *neigh, u8 *ha_buf,
223 struct neighbour *n, u32 flags, in ndisc_ops_update()
243 struct neighbour *neigh, in ndisc_ops_redirect_opt_addr_space()
[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 Dnetevent.h16 struct neighbour;
22 struct neighbour *neigh;
27 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
H A Datmclip.h15 #include <net/neighbour.h>
42 struct neighbour *neigh; /* neighbour back-pointer */
/linux/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->count == 0 && !nr_node->routes[2].neighbour->locked) in nr_add_node()
[all …]
/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/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,
56 static void neigh_update_notify(struct neighbour *neigh, u32 nlmsg_pid);
84 Neighbour hash table buckets are protected with rwlock tbl->lock.
89 It will result in deadlocks, if backend/driver wants to use neighbour
94 Neighbour entries are protected:
108 not make callbacks to neighbour tables.
111 static int neigh_blackhole(struct neighbour *neigh, struct sk_buff *skb) in neigh_blackhole()
117 static void neigh_cleanup_and_release(struct neighbour *neigh) in neigh_cleanup_and_release()
[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/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[1] = 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()
124 rose->neighbour->use--; in rose_state3_machine()
237 rose->neighbour->use--; in rose_state4_machine()
257 rose_sk(sk)->neighbour->use--; in rose_state5_machine()
/linux/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()
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/link might impose additional limits in x25_rx_call_request()
[all …]
/linux/net/batman-adv/ !
H A Doriginator.c520 * batadv_neigh_node_get() - retrieve a neighbour from the list
521 * @orig_node: originator which the neighbour belongs to
522 * @hard_iface: the interface where this neighbour is connected to
523 * @addr: the address of the neighbour
525 * Looks for and possibly returns a neighbour belonging to this originator list
557 * batadv_hardif_neigh_create() - create a hardif neighbour node
558 * @hard_iface: the interface this neighbour is connected to
559 * @neigh_addr: the interface address of the neighbour to retrieve
560 * @orig_node: originator object representing the neighbour
562 * 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
197 * metric of a single hop neighbour
198 * @neigh: the neighbour to probe
214 * batadv_v_elp_wifi_neigh_probe() - send link probing packets to a neighbour
215 * @neigh: the neighbour to probe
217 * Sends a predefined number of unicast wifi packets to a given neighbour in
220 * this neighbour..
484 * batadv_v_elp_neigh_update() - update an ELP neighbour node
[all …]
/linux/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,
118 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh);
/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);
/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/net/atm/ !
H A Dclip.c132 /* The neighbour entry n->lock is held. */
133 static int neigh_check_cb(struct neighbour *n) in neigh_check_cb()
277 static void clip_neigh_solicit(struct neighbour *neigh, struct sk_buff *skb) in clip_neigh_solicit()
285 static void clip_neigh_error(struct neighbour *neigh, struct sk_buff *skb) in clip_neigh_error()
301 static int clip_constructor(struct net_device *dev, struct neighbour *neigh) in clip_constructor()
325 * to allocate the neighbour entry but not to ask atmarpd for resolution. Also,
345 struct neighbour *n; in clip_start_xmit()
366 pr_err("NO NEIGHBOUR !\n"); in clip_start_xmit()
388 pr_debug("using neighbour %p, vcc %p\n", n, vcc); in clip_start_xmit()
459 struct neighbour *neigh; in clip_setentry()
[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/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/drivers/net/ethernet/rocker/ !
H A Drocker.h15 #include <net/neighbour.h>
127 struct neighbour *n);
129 struct neighbour *n);
/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/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()
726 static void ndisc_error_report(struct neighbour *neigh, struct sk_buff *skb) in ndisc_error_report()
738 static void ndisc_solicit(struct neighbour *neigh, struct sk_buff *skb) in ndisc_solicit()
778 void ndisc_update(const struct net_device *dev, struct neighbour *neigh, in ndisc_update()
[all …]

1234567