Searched refs:neighbour (Results 26 - 50 of 82) sorted by relevance

1234

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/net/
H A Dip6_route.h82 struct neighbour *neigh,
113 struct neighbour *neigh,
H A Drose.h60 #define ROSE_DEFAULT_MAXVC 50 /* Maximum number of VCs per neighbour */
107 struct rose_neigh *neighbour[3]; member in struct:rose_node
126 struct rose_neigh *neighbour; member in struct:rose_sock
H A Dip6_fib.h90 #define rt6i_nexthop dst.neighbour
H A Dnetrom.h102 struct nr_neigh *neighbour; member in struct:nr_route
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/cxgb3/
H A Dcxgb3_defs.h46 void cxgb_neigh_update(struct neighbour *neigh);
H A Dl2t.c38 #include <net/neighbour.h>
73 static inline void neigh_replace(struct l2t_entry *e, struct neighbour *n)
281 static inline void reuse_entry(struct l2t_entry *e, struct neighbour *neigh)
300 struct l2t_entry *t3_l2t_get(struct t3cdev *cdev, struct neighbour *neigh,
365 void t3_l2t_update(struct t3cdev *dev, struct neighbour *neigh)
H A Dcxgb3_offload.c35 #include <net/neighbour.h>
482 static void dummy_neigh_update(struct t3cdev *dev, struct neighbour *neigh)
964 cxgb_neigh_update((struct neighbour *)ctx);
972 cxgb_neigh_update(nr->new->neighbour);
1073 void cxgb_neigh_update(struct neighbour *neigh)
1117 olddev = old->neighbour->dev;
1118 newdev = new->neighbour->dev;
1135 e = t3_l2t_get(tdev, new->neighbour, newdev);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/x25/
H A Dx25_proc.c98 if (!x25->neighbour || (dev = x25->neighbour->dev) == NULL)
101 devname = x25->neighbour->dev->name;
H A Daf_x25.c217 if (x25_sk(s)->neighbour && x25_sk(s)->neighbour->dev == dev)
321 * Find a connected X.25 socket given my LCI and neighbour.
329 if (x25_sk(s)->lci == lci && x25_sk(s)->neighbour == nb) {
784 x25->neighbour = x25_get_neigh(rt->dev);
785 if (!x25->neighbour)
788 x25_limit_facilities(&x25->facilities, x25->neighbour);
790 x25->lci = x25_new_lci(x25->neighbour);
827 x25_neigh_put(x25->neighbour);
1020 * current neighbour/lin
[all...]
H A Dx25_in.c66 skb_pull(skbo, (x25->neighbour->extended) ?
185 modulus = (x25->neighbour->extended) ? X25_EMODULUS : X25_SMODULUS;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/atm/
H A Dclip.c119 /* The neighbour entry n->lock is held. */
120 static int neigh_check_cb(struct neighbour *n)
256 static void clip_neigh_solicit(struct neighbour *neigh, struct sk_buff *skb)
262 static void clip_neigh_error(struct neighbour *neigh, struct sk_buff *skb)
280 static int clip_constructor(struct neighbour *neigh)
320 .entry_size = sizeof(struct neighbour)+sizeof(struct atmarp_entry),
352 * to allocate the neighbour entry but not to ask atmarpd for resolution. Also,
379 if (!skb_dst(skb)->neighbour) {
385 entry = NEIGH2ENTRY(skb_dst(skb)->neighbour);
402 pr_debug("using neighbour
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv4/
H A Darp.c65 * now it is in net/core/neighbour.c.
138 * Interface to generic neighbour cache.
141 static int arp_constructor(struct neighbour *neigh);
142 static void arp_solicit(struct neighbour *neigh, struct sk_buff *skb);
143 static void arp_error_report(struct neighbour *neigh, struct sk_buff *skb);
198 .entry_size = sizeof(struct neighbour) + 4,
255 static int arp_constructor(struct neighbour *neigh)
345 static void arp_error_report(struct neighbour *neigh, struct sk_buff *skb)
351 static void arp_solicit(struct neighbour *neigh, struct sk_buff *skb)
467 * It is very UGLY routine: it DOES NOT use skb->dst->neighbour,
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv6/
H A Dndisc.c95 static int ndisc_constructor(struct neighbour *neigh);
96 static void ndisc_solicit(struct neighbour *neigh, struct sk_buff *skb);
97 static void ndisc_error_report(struct neighbour *neigh, struct sk_buff *skb);
133 .entry_size = sizeof(struct neighbour) + sizeof(struct in6_addr),
365 static int ndisc_constructor(struct neighbour *neigh)
505 struct neighbour *neigh,
563 struct neighbour *neigh,
578 static void ndisc_send_na(struct net_device *dev, struct neighbour *neigh,
628 void ndisc_send_ns(struct net_device *dev, struct neighbour *neigh,
692 static void ndisc_error_report(struct neighbour *neig
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/rose/
H A Daf_rose.c164 * particular neighbour.
175 if (rose->neighbour == neigh) {
177 rose->neighbour->use--;
178 rose->neighbour = NULL;
198 rose->neighbour->use--;
288 if (rose->lci == lci && rose->neighbour == neigh)
626 rose->neighbour->use--;
772 rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause,
774 if (!rose->neighbour) {
779 rose->lci = rose_new_lci(rose->neighbour);
[all...]
H A Drose_out.c46 rose_transmit_link(skb, rose->neighbour);
H A Drose_timer.c182 rose->neighbour->use--;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/
H A Detherdevice.h41 extern int eth_header_cache(const struct neighbour *neigh, struct hh_cache *hh);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/decnet/
H A Ddn_route.c83 #include <net/neighbour.h>
221 * 230 to get the minimum acceptable mtu. If there is no neighbour, then we
230 struct dn_dev *dn = dst->neighbour ?
231 (struct dn_dev *)dst->neighbour->dev->dn_ptr : NULL;
695 struct neighbour *neigh;
699 if ((neigh = dst->neighbour) == NULL)
734 struct neighbour *neigh = dst->neighbour;
796 struct neighbour *n;
808 if (dev != NULL && rt->dst.neighbour
[all...]
H A Ddn_rules.c26 #include <net/neighbour.h>
H A Dsysctl_net_decnet.c21 #include <net/neighbour.h>
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/cxgb4/
H A Dl2t.c40 #include <net/neighbour.h>
123 static void neigh_replace(struct l2t_entry *e, struct neighbour *n)
338 static void reuse_entry(struct l2t_entry *e, struct neighbour *neigh)
356 struct l2t_entry *cxgb4_l2t_get(struct l2t_data *d, struct neighbour *neigh,
435 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh)
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/infiniband/hw/cxgb4/
H A Dcm.c42 #include <net/neighbour.h>
1377 if (dst->neighbour->dev->flags & IFF_LOOPBACK) {
1380 l2t = cxgb4_l2t_get(dev->rdev.lldi.l2t, dst->neighbour,
1392 l2t = cxgb4_l2t_get(dev->rdev.lldi.l2t, dst->neighbour,
1393 dst->neighbour->dev, 0);
1395 tx_chan = cxgb4_port_chan(dst->neighbour->dev);
1396 smac_idx = (cxgb4_port_viid(dst->neighbour->dev) & 0x7F) << 1;
1398 txq_idx = cxgb4_port_idx(dst->neighbour->dev) * step;
1399 ctrlq_idx = cxgb4_port_idx(dst->neighbour->dev);
1402 cxgb4_port_idx(dst->neighbour
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/doc/
H A Dip-cref.tex114 \item \verb|neighbour| --- ARP or NDISC cache entry
830 \section{{\tt ip neighbour} --- neighbour/arp tables management}
832 \paragraph{Abbreviations:} \verb|neighbour|, \verb|neighbor|, \verb|neigh|,
835 \paragraph{Object:} \verb|neighbour| objects establish bindings between protocol
837 Neighbour entries are organized into tables. The IPv4 neighbour table
840 The corresponding commands display neighbour bindings
841 and their properties, add new neighbour entries and delete old ones.
850 \subsection{{\tt ip neighbour add} --- add a new neighbour entr
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/infiniband/ulp/ipoib/
H A Dipoib_multicast.c265 if (!skb_dst(skb) || !skb_dst(skb)->neighbour) {
715 skb_dst(skb)->neighbour &&
716 !*to_ipoib_neigh(skb_dst(skb)->neighbour)) {
717 struct ipoib_neigh *neigh = ipoib_neigh_alloc(skb_dst(skb)->neighbour,
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ethernet/
H A Deth.c231 * eth_header_cache - fill cache entry from neighbour
232 * @neigh: source neighbour
234 * Create an Ethernet header template from the neighbour.
236 int eth_header_cache(const struct neighbour *neigh, struct hh_cache *hh)

Completed in 159 milliseconds

1234