neighbour 175 include/linux/netdevice.h struct neighbour;
neighbour 262 include/linux/netdevice.h int (*cache)(const struct neighbour *neigh, struct hh_cache *hh);
neighbour 28 include/linux/netrom.h ax25_address neighbour;
neighbour 65 include/linux/rose.h ax25_address neighbour;
neighbour 43 include/net/atmclip.h struct neighbour *neigh; /* neighbour back-pointer */
neighbour 95 include/net/dn_dev.h struct neighbour *router; /* Default router on circuit */
neighbour 96 include/net/dn_dev.h struct neighbour *peer; /* Peer on pointopoint links */
neighbour 9 include/net/dn_neigh.h struct neighbour n;
neighbour 60 include/net/dst.h struct neighbour *neighbour;
neighbour 218 include/net/dst.h neigh_confirm(dst->neighbour);
neighbour 92 include/net/ip6_fib.h #define rt6i_nexthop u.dst.neighbour
neighbour 141 include/net/ndisc.h static inline struct neighbour * ndisc_get_neigh(struct net_device *dev, const struct in6_addr *addr)
neighbour 37 include/net/neighbour.h struct neighbour;
neighbour 46 include/net/neighbour.h int (*neigh_setup)(struct neighbour *);
neighbour 47 include/net/neighbour.h void (*neigh_cleanup)(struct neighbour *);
neighbour 101 include/net/neighbour.h struct neighbour *next;
neighbour 127 include/net/neighbour.h void (*solicit)(struct neighbour *, struct sk_buff*);
neighbour 128 include/net/neighbour.h void (*error_report)(struct neighbour *, struct sk_buff*);
neighbour 158 include/net/neighbour.h int (*constructor)(struct neighbour *);
neighbour 178 include/net/neighbour.h struct neighbour **hash_buckets;
neighbour 198 include/net/neighbour.h extern struct neighbour * neigh_lookup(struct neigh_table *tbl,
neighbour 201 include/net/neighbour.h extern struct neighbour * neigh_lookup_nodev(struct neigh_table *tbl,
neighbour 204 include/net/neighbour.h extern struct neighbour * neigh_create(struct neigh_table *tbl,
neighbour 216 include/net/neighbour.h extern struct neighbour *neigh_event_ns(struct neigh_table *tbl,
neighbour 263 include/net/neighbour.h struct neighbour *n, loff_t *pos);
neighbour 303 include/net/neighbour.h static inline struct neighbour * neigh_clone(struct neighbour *neigh)
neighbour 344 include/net/neighbour.h static inline struct neighbour *
neighbour 347 include/net/neighbour.h struct neighbour *n = neigh_lookup(tbl, pkey, dev);
neighbour 356 include/net/neighbour.h static inline struct neighbour *
neighbour 360 include/net/neighbour.h struct neighbour *n = neigh_lookup(tbl, pkey, dev);
neighbour 105 include/net/netrom.h struct nr_neigh *neighbour;
neighbour 107 include/net/rose.h struct rose_neigh *neighbour[3];
neighbour 126 include/net/rose.h struct rose_neigh *neighbour;
neighbour 146 include/net/x25.h struct x25_neigh *neighbour;
neighbour 320 net/atm/clip.c .entry_size = sizeof(struct neighbour)+sizeof(struct atmarp_entry),
neighbour 378 net/atm/clip.c if (!skb->dst->neighbour) {
neighbour 380 net/atm/clip.c skb->dst->neighbour = clip_find_neighbour(skb->dst, 1);
neighbour 381 net/atm/clip.c if (!skb->dst->neighbour) {
neighbour 392 net/atm/clip.c entry = NEIGH2ENTRY(skb->dst->neighbour);
neighbour 409 net/atm/clip.c pr_debug("using neighbour %p, vcc %p\n", skb->dst->neighbour, vcc);
neighbour 516 net/atm/clip.c struct neighbour *neigh;
neighbour 916 net/atm/clip.c struct neighbour *n = v;
neighbour 317 net/bridge/br_netfilter.c else if (dst->neighbour)
neighbour 318 net/bridge/br_netfilter.c return dst->neighbour->output(skb);
neighbour 215 net/core/dst.c struct neighbour *neigh;
neighbour 221 net/core/dst.c neigh = dst->neighbour;
neighbour 230 net/core/dst.c dst->neighbour = NULL;
neighbour 296 net/core/dst.c if (dst->neighbour && dst->neighbour->dev == dev) {
neighbour 297 net/core/dst.c dst->neighbour->dev = dst->dev;
neighbour 138 net/core/neighbour.c struct neighbour *n, **np;
neighbour 203 net/core/neighbour.c struct neighbour *n, **np = &tbl->hash_buckets[i];
neighbour 260 net/core/neighbour.c static struct neighbour *neigh_alloc(struct neigh_table *tbl)
neighbour 262 net/core/neighbour.c struct neighbour *n = NULL;
neighbour 299 net/core/neighbour.c static struct neighbour **neigh_hash_alloc(unsigned int entries)
neighbour 301 net/core/neighbour.c unsigned long size = entries * sizeof(struct neighbour *);
neighbour 302 net/core/neighbour.c struct neighbour **ret;
neighbour 307 net/core/neighbour.c ret = (struct neighbour **)
neighbour 315 net/core/neighbour.c unsigned long size = entries * sizeof(struct neighbour *);
neighbour 325 net/core/neighbour.c struct neighbour **new_hash, **old_hash;
neighbour 341 net/core/neighbour.c struct neighbour *n, *next;
neighbour 359 net/core/neighbour.c struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
neighbour 362 net/core/neighbour.c struct neighbour *n;
neighbour 382 net/core/neighbour.c struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, struct net *net,
neighbour 385 net/core/neighbour.c struct neighbour *n;
neighbour 406 net/core/neighbour.c struct neighbour *neigh_create(struct neigh_table *tbl, const void *pkey,
neighbour 412 net/core/neighbour.c struct neighbour *n1, *rc, *n = neigh_alloc(tbl);
neighbour 700 net/core/neighbour.c struct neighbour *n, **np;
neighbour 781 net/core/neighbour.c struct neighbour *neigh = (struct neighbour *)arg;
neighbour 1092 net/core/neighbour.c struct neighbour *n1 = neigh;
neighbour 1095 net/core/neighbour.c if (skb->dst && skb->dst->neighbour)
neighbour 1096 net/core/neighbour.c n1 = skb->dst->neighbour;
neighbour 1117 net/core/neighbour.c struct neighbour *neigh_event_ns(struct neigh_table *tbl,
neighbour 1121 net/core/neighbour.c struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
neighbour 1190 net/core/neighbour.c struct neighbour *neigh;
neighbour 1193 net/core/neighbour.c if (!dst || !(neigh = dst->neighbour))
neighbour 1223 net/core/neighbour.c dst, dst ? dst->neighbour : NULL);
neighbour 1237 net/core/neighbour.c struct neighbour *neigh = dst->neighbour;
neighbour 1547 net/core/neighbour.c struct neighbour *neigh;
neighbour 1618 net/core/neighbour.c struct neighbour *neigh;
neighbour 2083 net/core/neighbour.c struct neighbour *n;
neighbour 2148 net/core/neighbour.c struct neighbour *n;
neighbour 2164 net/core/neighbour.c struct neighbour *n, **np;
neighbour 2187 net/core/neighbour.c static struct neighbour *neigh_get_first(struct seq_file *seq)
neighbour 2192 net/core/neighbour.c struct neighbour *n = NULL;
neighbour 2226 net/core/neighbour.c static struct neighbour *neigh_get_next(struct seq_file *seq,
neighbour 2274 net/core/neighbour.c static struct neighbour *neigh_get_idx(struct seq_file *seq, loff_t *pos)
neighbour 2276 net/core/neighbour.c struct neighbour *n = neigh_get_first(seq);
neighbour 209 net/decnet/dn_neigh.c struct neighbour *neigh = dst->neighbour;
neighbour 228 net/decnet/dn_neigh.c struct neighbour *neigh = dst->neighbour;
neighbour 274 net/decnet/dn_neigh.c struct neighbour *neigh = dst->neighbour;
neighbour 317 net/decnet/dn_neigh.c struct neighbour *neigh = dst->neighbour;
neighbour 374 net/decnet/dn_neigh.c struct neighbour *neigh;
neighbour 435 net/decnet/dn_neigh.c struct neighbour *neigh;
neighbour 230 net/decnet/dn_route.c struct dn_dev *dn = dst->neighbour ?
neighbour 231 net/decnet/dn_route.c (struct dn_dev *)dst->neighbour->dev->dn_ptr : NULL;
neighbour 690 net/decnet/dn_route.c struct neighbour *neigh;
neighbour 694 net/decnet/dn_route.c if ((neigh = dst->neighbour) == NULL)
neighbour 728 net/decnet/dn_route.c struct neighbour *neigh = dst->neighbour;
neighbour 789 net/decnet/dn_route.c struct neighbour *n;
neighbour 801 net/decnet/dn_route.c if (dev != NULL && rt->u.dst.neighbour == NULL) {
neighbour 805 net/decnet/dn_route.c rt->u.dst.neighbour = n;
neighbour 879 net/decnet/dn_route.c struct neighbour *neigh = NULL;
neighbour 1111 net/decnet/dn_route.c rt->u.dst.neighbour = neigh;
neighbour 1212 net/decnet/dn_route.c struct neighbour *neigh = NULL;
neighbour 1372 net/decnet/dn_route.c rt->u.dst.neighbour = neigh;
neighbour 173 net/ipv4/arp.c .entry_size = sizeof(struct neighbour) + 4,
neighbour 469 net/ipv4/arp.c struct neighbour *n;
neighbour 504 net/ipv4/arp.c struct neighbour *n = dst->neighbour;
neighbour 519 net/ipv4/arp.c dst->neighbour = n;
neighbour 710 net/ipv4/arp.c struct neighbour *n;
neighbour 987 net/ipv4/arp.c struct neighbour *neigh;
neighbour 1060 net/ipv4/arp.c struct neighbour *neigh;
neighbour 1097 net/ipv4/arp.c struct neighbour *neigh;
neighbour 353 net/ipv4/fib_semantics.c struct neighbour *n;
neighbour 658 net/ipv4/ip_gre.c struct neighbour *neigh = skb->dst->neighbour;
neighbour 206 net/ipv4/ip_output.c else if (dst->neighbour)
neighbour 207 net/ipv4/ip_output.c return dst->neighbour->output(skb);
neighbour 1276 net/ipv4/route.c rt->u.dst.neighbour = NULL;
neighbour 1292 net/ipv4/route.c !(rt->u.dst.neighbour->nud_state &
neighbour 1294 net/ipv4/route.c if (rt->u.dst.neighbour)
neighbour 1295 net/ipv4/route.c neigh_event_send(rt->u.dst.neighbour, NULL);
neighbour 103 net/ipv6/ip6_output.c else if (dst->neighbour)
neighbour 104 net/ipv6/ip6_output.c return dst->neighbour->output(skb);
neighbour 492 net/ipv6/ip6_output.c if (skb->dev == dst->dev && dst->neighbour && opt->srcrt == 0 &&
neighbour 496 net/ipv6/ip6_output.c struct neighbour *n = dst->neighbour;
neighbour 967 net/ipv6/ip6_output.c if ((*dst)->neighbour && !((*dst)->neighbour->nud_state & NUD_VALID)) {
neighbour 132 net/ipv6/ndisc.c .entry_size = sizeof(struct neighbour) + sizeof(struct in6_addr),
neighbour 694 net/ipv6/ndisc.c struct neighbour *neigh;
neighbour 871 net/ipv6/ndisc.c struct neighbour *neigh;
neighbour 969 net/ipv6/ndisc.c struct neighbour *neigh;
neighbour 1075 net/ipv6/ndisc.c struct neighbour *neigh = NULL;
neighbour 1361 net/ipv6/ndisc.c struct neighbour *neigh;
neighbour 288 net/ipv6/route.c struct neighbour *neigh = rt ? rt->rt6i_nexthop : NULL;
neighbour 337 net/ipv6/route.c struct neighbour *neigh = rt->rt6i_nexthop;
neighbour 1485 net/ipv6/route.c if (neigh == rt->u.dst.neighbour)
neighbour 2224 net/ipv6/route.c if (rt->u.dst.neighbour)
neighbour 2225 net/ipv6/route.c NLA_PUT(skb, RTA_GATEWAY, 16, &rt->u.dst.neighbour->primary_key);
neighbour 563 net/ipv6/sit.c struct neighbour *neigh = NULL;
neighbour 566 net/ipv6/sit.c neigh = skb->dst->neighbour;
neighbour 588 net/ipv6/sit.c struct neighbour *neigh = NULL;
neighbour 591 net/ipv6/sit.c neigh = skb->dst->neighbour;
neighbour 122 net/netrom/nr_route.c if (nr_nodet->routes[i].neighbour == nr_neigh)
neighbour 195 net/netrom/nr_route.c nr_node->routes[0].neighbour = nr_neigh;
neighbour 213 net/netrom/nr_route.c if (nr_node->routes[i].neighbour == nr_neigh) {
neighbour 229 net/netrom/nr_route.c nr_node->routes[0].neighbour = nr_neigh;
neighbour 238 net/netrom/nr_route.c nr_node->routes[2].neighbour->count--;
neighbour 239 net/netrom/nr_route.c nr_neigh_put(nr_node->routes[2].neighbour);
neighbour 241 net/netrom/nr_route.c if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)
neighbour 242 net/netrom/nr_route.c nr_remove_neigh(nr_node->routes[2].neighbour);
neighbour 246 net/netrom/nr_route.c nr_node->routes[2].neighbour = nr_neigh;
neighbour 302 net/netrom/nr_route.c if (nr_node->routes[i].neighbour == nr_neigh) {
neighbour 362 net/netrom/nr_route.c nr_neigh = nr_neigh_get_dev(neighbour, dev);
neighbour 371 net/netrom/nr_route.c if (nr_node->routes[i].neighbour == nr_neigh) {
neighbour 496 net/netrom/nr_route.c nr_neigh = s->routes[i].neighbour;
neighbour 549 net/netrom/nr_route.c if (t->routes[i].neighbour == s) {
neighbour 675 net/netrom/nr_route.c &nr_route.neighbour,
neighbour 699 net/netrom/nr_route.c &nr_route.neighbour, dev);
neighbour 755 net/netrom/nr_route.c nr_node->routes[nr_node->which].neighbour == nr_neigh)
neighbour 818 net/netrom/nr_route.c nr_neigh = nr_node->routes[nr_node->which].neighbour;
neighbour 916 net/netrom/nr_route.c nr_node->routes[i].neighbour->number);
neighbour 176 net/rose/af_rose.c if (rose->neighbour == neigh) {
neighbour 178 net/rose/af_rose.c rose->neighbour->use--;
neighbour 179 net/rose/af_rose.c rose->neighbour = NULL;
neighbour 199 net/rose/af_rose.c rose->neighbour->use--;
neighbour 289 net/rose/af_rose.c if (rose->lci == lci && rose->neighbour == neigh)
neighbour 627 net/rose/af_rose.c rose->neighbour->use--;
neighbour 773 net/rose/af_rose.c rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause,
neighbour 775 net/rose/af_rose.c if (!rose->neighbour) {
neighbour 780 net/rose/af_rose.c rose->lci = rose_new_lci(rose->neighbour);
neighbour 829 net/rose/af_rose.c rose->neighbour->use++;
neighbour 870 net/rose/af_rose.c rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause, &diagnostic, 0);
neighbour 871 net/rose/af_rose.c if (rose->neighbour)
neighbour 1030 net/rose/af_rose.c make_rose->neighbour = neigh;
neighbour 1034 net/rose/af_rose.c make_rose->neighbour->use++;
neighbour 1086 net/rose/af_rose.c if (rose->neighbour == NULL || rose->device == NULL)
neighbour 1468 net/rose/af_rose.c (rose->neighbour) ? rose->neighbour->number : 0,
neighbour 62 net/rose/rose_in.c rose->neighbour->use--;
neighbour 85 net/rose/rose_in.c rose->neighbour->use--;
neighbour 90 net/rose/rose_in.c rose->neighbour->use--;
neighbour 126 net/rose/rose_in.c rose->neighbour->use--;
neighbour 237 net/rose/rose_in.c rose->neighbour->use--;
neighbour 257 net/rose/rose_in.c rose_sk(sk)->neighbour->use--;
neighbour 45 net/rose/rose_out.c rose_transmit_link(skb, rose->neighbour);
neighbour 80 net/rose/rose_route.c if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
neighbour 93 net/rose/rose_route.c rose_neigh->callsign = rose_route->neighbour;
neighbour 161 net/rose/rose_route.c rose_node->neighbour[0] = rose_neigh;
neighbour 187 net/rose/rose_route.c rose_node->neighbour[rose_node->count] = rose_neigh;
neighbour 314 net/rose/rose_route.c if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
neighbour 326 net/rose/rose_route.c if (rose_node->neighbour[i] == rose_neigh) {
neighbour 339 net/rose/rose_route.c rose_node->neighbour[0] =
neighbour 340 net/rose/rose_route.c rose_node->neighbour[1];
neighbour 342 net/rose/rose_route.c rose_node->neighbour[1] =
neighbour 343 net/rose/rose_route.c rose_node->neighbour[2];
neighbour 425 net/rose/rose_route.c rose_node->neighbour[0] = rose_loopback_neigh;
neighbour 494 net/rose/rose_route.c if (t->neighbour[i] != s)
neighbour 501 net/rose/rose_route.c t->neighbour[0] = t->neighbour[1];
neighbour 503 net/rose/rose_route.c t->neighbour[1] = t->neighbour[2];
neighbour 680 net/rose/rose_route.c if (node->neighbour[i]->restarted) {
neighbour 681 net/rose/rose_route.c res = node->neighbour[i];
neighbour 686 net/rose/rose_route.c if (!rose_ftimer_running(node->neighbour[i])) {
neighbour 687 net/rose/rose_route.c res = node->neighbour[i];
neighbour 909 net/rose/rose_route.c rose->neighbour->use--;
neighbour 910 net/rose/rose_route.c rose->neighbour = NULL;
neighbour 1125 net/rose/rose_route.c rose_node->neighbour[i]->number);
neighbour 198 net/rose/rose_subr.c rose_transmit_link(skb, rose->neighbour);
neighbour 182 net/rose/rose_timer.c rose->neighbour->use--;
neighbour 68 net/sched/sch_teql.c struct neighbour *ncache;
neighbour 229 net/sched/sch_teql.c struct neighbour *mn = skb->dst->neighbour;
neighbour 230 net/sched/sch_teql.c struct neighbour *n = q->ncache;
neighbour 270 net/sched/sch_teql.c skb->dst->neighbour == NULL)
neighbour 179 net/x25/af_x25.c if (x25_sk(s)->neighbour && x25_sk(s)->neighbour->dev == dev)
neighbour 291 net/x25/af_x25.c if (x25_sk(s)->lci == lci && x25_sk(s)->neighbour == nb) {
neighbour 705 net/x25/af_x25.c x25->neighbour = x25_get_neigh(rt->dev);
neighbour 706 net/x25/af_x25.c if (!x25->neighbour)
neighbour 709 net/x25/af_x25.c x25_limit_facilities(&x25->facilities, x25->neighbour);
neighbour 711 net/x25/af_x25.c x25->lci = x25_new_lci(x25->neighbour);
neighbour 748 net/x25/af_x25.c x25_neigh_put(x25->neighbour);
neighbour 935 net/x25/af_x25.c makex25->neighbour = nb;
neighbour 1012 net/x25/af_x25.c if (!x25->neighbour)
neighbour 1084 net/x25/af_x25.c if (x25->neighbour->extended) {
neighbour 1096 net/x25/af_x25.c if (x25->neighbour->extended) {
neighbour 1206 net/x25/af_x25.c skb_pull(skb, x25->neighbour->extended ?
neighbour 1628 net/x25/af_x25.c if (x25_sk(s)->neighbour == nb)
neighbour 65 net/x25/x25_in.c skb_pull(skbo, (x25->neighbour->extended) ?
neighbour 175 net/x25/x25_in.c modulus = (x25->neighbour->extended) ? X25_EMODULUS : X25_SMODULUS;
neighbour 58 net/x25/x25_out.c int header_len = x25->neighbour->extended ? X25_EXT_MIN_LEN :
neighbour 95 net/x25/x25_out.c if (x25->neighbour->extended)
neighbour 124 net/x25/x25_out.c if (x25->neighbour->extended) {
neighbour 134 net/x25/x25_out.c x25_transmit_link(skb, x25->neighbour);
neighbour 153 net/x25/x25_out.c x25_transmit_link(skb, x25->neighbour);
neighbour 162 net/x25/x25_out.c modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
neighbour 154 net/x25/x25_proc.c if (!x25->neighbour || (dev = x25->neighbour->dev) == NULL)
neighbour 157 net/x25/x25_proc.c devname = x25->neighbour->dev->name;
neighbour 57 net/x25/x25_subr.c int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
neighbour 96 net/x25/x25_subr.c int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
neighbour 172 net/x25/x25_subr.c if (x25->neighbour->extended) {
neighbour 195 net/x25/x25_subr.c x25->neighbour->global_facil_mask);
neighbour 238 net/x25/x25_subr.c if (x25->neighbour->extended) {
neighbour 257 net/x25/x25_subr.c x25_transmit_link(skb, x25->neighbour);
neighbour 288 net/x25/x25_subr.c if (x25->neighbour->extended) {
neighbour 304 net/x25/x25_subr.c if (x25->neighbour->extended) {
neighbour 1473 net/xfrm/xfrm_policy.c dst0->neighbour = neigh_clone(dst->neighbour);