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

1234

/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/net/
H A Dneighbour.h5 * Generic neighbour manipulation
56 int (*neigh_setup)(struct neighbour *);
87 struct neighbour struct
89 struct neighbour *next;
115 void (*destructor)(struct neighbour *);
116 void (*solicit)(struct neighbour *, struct sk_buff*);
117 void (*error_report)(struct neighbour *, struct sk_buff*);
135 * neighbour table manipulation
146 int (*constructor)(struct neighbour *);
168 struct neighbour *hash_bucket
[all...]
H A Ddn_neigh.h9 struct neighbour n;
21 extern struct neighbour *dn_neigh_lookup(struct neigh_table *tbl, void *ptr);
H A Dndisc.h5 * ICMP codes for neighbour discovery messages
37 #include <net/neighbour.h>
81 struct neighbour *neigh,
94 struct neighbour *neigh,
115 static inline struct neighbour * ndisc_get_neigh(struct net_device *dev, struct in6_addr *addr)
H A Darp.h6 #include <net/neighbour.h>
H A Ddst.h12 #include <net/neighbour.h>
54 struct neighbour *neighbour; member in struct:dst_entry
130 neigh_confirm(dst->neighbour);
H A Datmclip.h15 #include <net/neighbour.h>
43 struct neighbour *neigh; /* neighbour back-pointer */
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/net/
H A Dneighbour.h5 * Generic neighbour manipulation
56 int (*neigh_setup)(struct neighbour *);
87 struct neighbour struct
89 struct neighbour *next;
115 void (*destructor)(struct neighbour *);
116 void (*solicit)(struct neighbour *, struct sk_buff*);
117 void (*error_report)(struct neighbour *, struct sk_buff*);
135 * neighbour table manipulation
146 int (*constructor)(struct neighbour *);
168 struct neighbour *hash_bucket
[all...]
H A Ddn_neigh.h9 struct neighbour n;
21 extern struct neighbour *dn_neigh_lookup(struct neigh_table *tbl, void *ptr);
H A Dndisc.h5 * ICMP codes for neighbour discovery messages
37 #include <net/neighbour.h>
81 struct neighbour *neigh,
94 struct neighbour *neigh,
115 static inline struct neighbour * ndisc_get_neigh(struct net_device *dev, struct in6_addr *addr)
H A Darp.h6 #include <net/neighbour.h>
H A Ddst.h12 #include <net/neighbour.h>
54 struct neighbour *neighbour; member in struct:dst_entry
130 neigh_confirm(dst->neighbour);
H A Datmclip.h15 #include <net/neighbour.h>
43 struct neighbour *neigh; /* neighbour back-pointer */
/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/linux/
H A Dnetrom.h28 ax25_address neighbour; member in struct:nr_route_struct
H A Detherdevice.h37 extern int eth_header_cache(struct neighbour *neigh,
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/linux/
H A Dnetrom.h28 ax25_address neighbour; member in struct:nr_route_struct
H A Detherdevice.h37 extern int eth_header_cache(struct neighbour *neigh,
/asus-wl-520gu-7.0.1.45/src/linux/linux/net/decnet/
H A Ddn_neigh.c20 * Steve Whitehouse : Fixed neighbour states (for now anyway).
37 #include <net/neighbour.h>
45 static int dn_neigh_construct(struct neighbour *);
46 static void dn_long_error_report(struct neighbour *, struct sk_buff *);
47 static void dn_short_error_report(struct neighbour *, struct sk_buff *);
130 static int dn_neigh_construct(struct neighbour *neigh)
168 static void dn_long_error_report(struct neighbour *neigh, struct sk_buff *skb)
175 static void dn_short_error_report(struct neighbour *neigh, struct sk_buff *skb)
184 struct neighbour *neigh = dst->neighbour;
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/net/core/
H A DMakefile24 obj-$(CONFIG_NET) += dev.o dev_mcast.o dst.o neighbour.o rtnetlink.o utils.o
H A Ddst.c146 struct neighbour *neigh = dst->neighbour;
154 dst->neighbour = NULL;
194 if (dst->neighbour && dst->neighbour->dev == dev) {
195 dst->neighbour->dev = &loopback_dev;
H A Dneighbour.c26 #include <net/neighbour.h>
50 static void neigh_app_notify(struct neighbour *n);
63 It will result in deadlocks, if backend/driver wants to use neighbour
82 not make callbacks to neighbour tables.
85 list of neighbour tables. This list is used only in process context,
114 struct neighbour *n, **np;
151 static int neigh_del_timer(struct neighbour *n)
179 struct neighbour *n, **np;
194 We must destroy neighbour entry,
224 static struct neighbour *neigh_allo
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/net/x25/
H A Dx25_subr.c65 int modulus = sk->protinfo.x25->neighbour->extended ? X25_EMODULUS :
106 int modulus = sk->protinfo.x25->neighbour->extended ? X25_EMODULUS :
179 if (sk->protinfo.x25->neighbour->extended) {
198 len = x25_create_facilities(facilities, &sk->protinfo.x25->facilities, sk->protinfo.x25->neighbour->global_facil_mask);
229 if (sk->protinfo.x25->neighbour->extended) {
248 x25_transmit_link(skb, sk->protinfo.x25->neighbour);
278 if (sk->protinfo.x25->neighbour->extended) {
294 if (sk->protinfo.x25->neighbour->extended) {
H A Dx25_out.c71 header_len = (sk->protinfo.x25->neighbour->extended) ? X25_EXT_MIN_LEN : X25_STD_MIN_LEN;
104 if (sk->protinfo.x25->neighbour->extended)
131 if (sk->protinfo.x25->neighbour->extended) {
141 x25_transmit_link(skb, sk->protinfo.x25->neighbour);
159 x25_transmit_link(skb, sk->protinfo.x25->neighbour);
168 modulus = (sk->protinfo.x25->neighbour->extended) ? X25_EMODULUS : X25_SMODULUS;
/asus-wl-520gu-7.0.1.45/src/linux/linux/net/rose/
H A Drose_route.c63 * neighbour if it is new.
80 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0 && rose_neigh->dev == dev)
87 rose_neigh->callsign = rose_route->neighbour;
152 rose_node->neighbour[0] = rose_neigh;
183 rose_node->neighbour[rose_node->count] = rose_neigh;
310 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0 && rose_neigh->dev == dev)
316 if (rose_node->neighbour[i] == rose_neigh) {
329 rose_node->neighbour[0] = rose_node->neighbour[1];
331 rose_node->neighbour[
[all...]
H A Drose_in.c74 sk->protinfo.rose->neighbour->use--;
96 sk->protinfo.rose->neighbour->use--;
101 sk->protinfo.rose->neighbour->use--;
137 sk->protinfo.rose->neighbour->use--;
246 sk->protinfo.rose->neighbour->use--;
266 sk->protinfo.rose->neighbour->use--;
/asus-wl-520gu-7.0.1.45/src/linux/linux/net/netrom/
H A Dnr_route.c17 * Change default quality for new neighbour when same
62 * neighbour if it is new.
89 * The L2 link to a neighbour has failed in the past
90 * and now a frame comes from this neighbour. We assume
99 if (node->routes[i].neighbour == nr_neigh)
158 nr_node->routes[0].neighbour = nr_neigh;
177 if (nr_node->routes[i].neighbour == nr_neigh) {
193 nr_node->routes[0].neighbour = nr_neigh;
201 nr_node->routes[2].neighbour->count--;
203 if (nr_node->routes[2].neighbour
332 nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev) argument
[all...]

Completed in 143 milliseconds

1234