/linux-master/include/net/ |
H A D | netevent.h | 16 struct neighbour; 22 struct neighbour *neigh; 27 NETEVENT_NEIGH_UPDATE = 1, /* arg is struct neighbour ptr */
|
H A D | neighbour.h | 5 #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 D | arp.h | 8 #include <net/neighbour.h> 22 static inline struct neighbour *__ipv4_neigh_lookup_noref(struct net_device *dev, u32 key) 31 struct neighbour *__ipv4_neigh_lookup_noref(struct net_device *dev, u32 key) 37 static inline struct neighbour *__ipv4_neigh_lookup(struct net_device *dev, u32 key) 39 struct neighbour *n; 52 struct neighbour *n;
|
H A D | atmclip.h | 15 #include <net/neighbour.h> 42 struct neighbour *neigh; /* neighbour back-pointer */
|
H A 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. 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, 267 struct neighbour *neig [all...] |
H A D | dst_ops.h | 35 struct neighbour * (*neigh_lookup)(const struct dst_entry *dst,
|
H A D | dst.h | 20 #include <net/neighbour.h> 399 static inline struct neighbour *dst_neigh_lookup(const struct dst_entry *dst, const void *daddr) 401 struct neighbour *n = dst->ops->neigh_lookup(dst, NULL, daddr); 405 static inline struct neighbour *dst_neigh_lookup_skb(const struct dst_entry *dst, 408 struct neighbour *n; 561 struct neighbour *dst_blackhole_neigh_lookup(const struct dst_entry *dst,
|
/linux-master/include/uapi/linux/ |
H A D | netrom.h | 31 ax25_address neighbour; member in struct:nr_route_struct
|
H A D | rose.h | 69 ax25_address neighbour; member in struct:rose_route_struct
|
/linux-master/drivers/net/ethernet/chelsio/cxgb3/ |
H A D | t3cdev.h | 40 #include <net/neighbour.h> 61 void (*neigh_update)(struct t3cdev *dev, struct neighbour *neigh);
|
H A 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);
|
H A D | l2t.c | 39 #include <net/neighbour.h> 74 static inline void neigh_replace(struct l2t_entry *e, struct neighbour *n) 283 static inline void reuse_entry(struct l2t_entry *e, struct neighbour *neigh) 306 struct neighbour *neigh; 399 void t3_l2t_update(struct t3cdev *dev, struct neighbour *neigh)
|
/linux-master/drivers/net/ethernet/chelsio/cxgb4/ |
H A 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, 120 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh);
|
/linux-master/net/x25/ |
H A D | x25_subr.c | 55 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; 94 int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS; 168 if (x25->neighbour->extended) { 190 x25->neighbour->global_facil_mask); 235 if (x25->neighbour->extended) { 254 x25_transmit_link(skb, x25->neighbour); 289 if (x25->neighbour->extended) { 309 if (x25->neighbour->extended) { 360 if (x25->neighbour) { 362 x25_neigh_put(x25->neighbour); [all...] |
H A D | x25_out.c | 54 int header_len = x25->neighbour->extended ? X25_EXT_MIN_LEN : 94 if (x25->neighbour->extended) 123 if (x25->neighbour->extended) { 133 x25_transmit_link(skb, x25->neighbour); 153 x25_transmit_link(skb, x25->neighbour); 162 modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
|
H A D | x25_proc.c | 93 if (!x25->neighbour || !x25->neighbour->dev) 96 devname = x25->neighbour->dev->name;
|
/linux-master/include/trace/events/ |
H A 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-master/net/rose/ |
H A D | rose_in.c | 59 rose->neighbour->use--; 82 rose->neighbour->use--; 87 rose->neighbour->use--; 123 rose->neighbour->use--; 236 rose->neighbour->use--; 256 rose_sk(sk)->neighbour->use--;
|
H A D | rose_route.c | 49 * neighbour if it is new. 77 if (ax25cmp(&rose_route->neighbour, 91 rose_neigh->callsign = rose_route->neighbour; 161 rose_node->neighbour[0] = rose_neigh; 187 rose_node->neighbour[rose_node->count] = rose_neigh; 318 if (ax25cmp(&rose_route->neighbour, 331 if (rose_node->neighbour[i] == rose_neigh) { 344 rose_node->neighbour[0] = 345 rose_node->neighbour[1]; 348 rose_node->neighbour[ [all...] |
/linux-master/net/netrom/ |
H A D | nr_route.c | 95 * neighbour if it is new. 116 * The L2 link to a neighbour has failed in the past 117 * and now a frame comes from this neighbour. We assume 128 if (nr_nodet->routes[i].neighbour == nr_neigh) 201 nr_node->routes[0].neighbour = nr_neigh; 220 if (nr_node->routes[i].neighbour == nr_neigh) { 236 nr_node->routes[0].neighbour = nr_neigh; 245 nr_node->routes[2].neighbour->count--; 246 nr_neigh_put(nr_node->routes[2].neighbour); 248 if (nr_node->routes[2].neighbour 324 nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev) argument [all...] |
/linux-master/net/core/ |
H A D | neighbour.c | 11 * 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) 98 static void neigh_cleanup_and_release(struct neighbour *neigh) 118 static void neigh_mark_dead(struct neighbour *n) 129 static void neigh_update_gc_list(struct neighbour * [all...] |
/linux-master/net/6lowpan/ |
H A D | ndisc.c | 56 static void lowpan_ndisc_802154_update(struct neighbour *n, u32 flags, 103 struct neighbour *n, u32 flags, u8 icmp6_type, 115 u8 icmp6_type, struct neighbour *neigh,
|
/linux-master/drivers/net/ethernet/rocker/ |
H A D | rocker.h | 15 #include <net/neighbour.h> 127 struct neighbour *n); 129 struct neighbour *n);
|
/linux-master/net/bridge/ |
H A D | br_nf_core.c | 40 static struct neighbour *fake_neigh_lookup(const struct dst_entry *dst,
|
/linux-master/net/ipv4/ |
H A D | arp.c | 61 * 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) 223 static int arp_constructor(struct neighbour *neigh) 294 static void arp_error_report(struct neighbour *neigh, struct sk_buff *skb) 333 static void arp_solicit(struct neighbour *neig [all...] |