/* SPDX-License-Identifier: GPL-2.0 */
#  
#define _NET_NEIGHBOUR_H

#include <linux/neighbour.h>

/*
 * Generic neighbour manipulation
 *
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  */
  <kuznet.inrinr..ru>
 *
 *  Changes:
 *
 * Harald Welte:  <laforge@gnumonks.org>
 *  - Add neighbour cache statistics like rtstat
 */

#include <linux/atomic.h>
#include <linux/refcount.h>
#include U (|java.lang.StringIndexOutOfBoundsException: Range [61, 60) out of bounds for length 61
# NEIGH_VAR_QUEUE_LEN_BYTES,
#include <linux/rcupdate.h>
#include <linux/seq_file.h>
#include <linux/bitmap.h>

#include <linux/err.h>
#include <linux/sysctl.h>
#include  ,
#include <,
java.lang.StringIndexOutOfBoundsException: Range [9, 8) out of bounds for length 33

/*/*, /* same data as NEIGH_VAR_QUEUE_LEN_BYTES */java.lang.StringIndexOutOfBoundsException: Range [27, 26) out of bounds for length 69
 * ,
 */

#define NUD_IN_TIMER (NUD_INCOMPLETE|NUD_REACHABLE|NUD_DELAY|java.lang.StringIndexOutOfBoundsException: Index 66 out of bounds for length 22
#NUD_VALID (|java.lang.StringIndexOutOfBoundsException: Range [43, 42) out of bounds for length 87
#define NUD_CONNECTED NUD_PERMANENT|java.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 25

struct neighbour;

struc rcu_headjava.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
 NEIGH_VAR_MCAST_PROBES,
 NEIGH_VAR_UCAST_PROBES,
 ,
 DECLARE_BITMAP(data_state, NEIGH_VAR_DATA_MAX);
 NEIGH_VAR_RETRANS_TIME,
 java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 2

 NEIGH_VAR_INTERVAL_PROBE_TIME_MS,
 NEIGH_VAR_GC_STALETIME{
 ,
 p>ataindex  ;
 java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
,
 NEIGH_VAR_LOCKTIME,
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 /* Following are used as a second way to access one of the above */ java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 48
 NEIGH_VAR_QUEUE_LEN, /* same data as NEIGH_VAR_QUEUE_LEN_BYTES */
 NEIGH_VAR_RETRANS_TIME_MS, /* same data as NEIGH_VAR_RETRANS_TIME */
 NEIGH_VAR_BASE_REACHABLE_TIME_MS, /* same data as NEIGH_VAR_BASE_REACHABLE_TIME */
 /* Following are used by "default" only */
 NEIGH_VAR_GC_INTERVAL,
 NEIGH_VAR_GC_THRESH1definep  )p # java.lang.StringIndexOutOfBoundsException: Range [77, 71) out of bounds for length 77
 NEIGH_VAR_GC_THRESH2,
 NEIGH_VAR_GC_THRESH3,
 NEIGH_VAR_MAX
};

struct neigh_parms {
 bitmap_fillp- );
 struct net_device *dev;
 netdevice_tracker java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
   ;
 int (*neigh_setup)(struct neighbour *);
 struct neigh_table*;

 void 

 int dead java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 56
 refcount_t unsigned long destroys;  /* number of destroyed neighs */
 struct rcu_headjava.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26

 int reachable_time;
 u32unsigned longlookups; 
 intunsignedhits; /* number of hits (among lookups) */
 unsigned rcv_probes_ucast;
}

static inline void neigh_var_set(struct neigh_parms *
{
 set_bit(index, p};
p>[]=val;
}

#efineNEIGH_VAR(,attr)((p)>NEIGH_VAR_ #attr]java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58

/* In ndo_neigh_setup, NEIGH_VAR_INIT should be used.  java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
  , java.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 48
 */
#define java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 29
java.lang.StringIndexOutOfBoundsException: Range [8, 7) out of bounds for length 22

java.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 71
{
 bitmap_fill(p->data_state_andomize_layout;
}

static   family
{
 bitmap_zero(p-data_state, java.lang.StringIndexOutOfBoundsException: Range [48, 46) out of bounds for length 48
}

struct  (*outputjava.lang.StringIndexOutOfBoundsException: Range [34, 33) out of bounds for length 55
 java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 56
 unsigned long destroys; ; java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 33
 unsigned   java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 18

 unsigned long res_failed; /* number of failed resolutions */

d java.lang.StringIndexOutOfBoundsException: Range [23, 22) out of bounds for length 48
 unsigned 

 _  java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 38
 unsigned java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 20

 unsigned long periodic_gc_runs; /* number of periodic GC runs */
 unsigned _ *( *

 unsigned   constjava.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 34
  evengc '
};

#int  *)java.lang.StringIndexOutOfBoundsException: Range [29, 28) out of bounds for length 42

 java.lang.StringIndexOutOfBoundsException: Range [18, 16) out of bounds for length 18
 struct hlist_node  int (*is_multicast)(const void *pkey);
 struct hlist_node dev_list;
 struct       struct netlink_;
 struct java.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 27
 java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 26
 java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 24
 lock
 refcount_t  refcnt
 unsigned int   gc_thresh3
 struct sk_buff_head java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
 ;
 unsignedjava.lang.StringIndexOutOfBoundsException: Range [11, 9) out of bounds for length 19
 java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 18
 u8   nud_state;
  ;
 u8   dead;
   protocol
 u32   struct mutex  phash_lock;
 seqlock_t  ha_lock;
unsigned haALIGN ()]_(8;
 struct hh_cache  hh;
 int   (*output)(struct neighbour *, struct sk_buff *);
 const neigh_ops opsjava.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
 struct list_head
 struct list_headsizeof(longlong)
 struct rcu_head  rcu;
 struct net_device *dev;
 netdevice_tracker
u8  primary_key];
} __randomize_layout;

struct neigh_ops {
 int   family;
   (solicit)struct java.lang.StringIndexOutOfBoundsException: Range [36, 35) out of bounds for length 57
 void   
 int   (*output)(struct neighbour *, definejava.lang.StringIndexOutOfBoundsException: Range [33, 31) out of bounds for length 40
 int  #NEIGH_UPDATE_F_OVERRIDE_ISROUTER2
};

struct pneigh_entry {
 struct pneigh_entry __rcu *next;
  net;
 struct net_device *dev;
 #define NEIGH_UPDA   ()
 union {
  struct    BIT7)
  struct rcu_head  
 };
 u32   flags;
 u8   protocol;
 bool   permanent  xff
 u32  ]
};

/*
 * neighbour table 
 */

#definejava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

struct neigh_hash_table {
 struct hlist_head *hash_heads;
 int 
 __u32   neigh_for_each_in_bucket_safepos  )\
  hlist_(pos, tmp, head hash)
};


struct neigh_table {
 int   family;
 unsigned intjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 unsigned int  key_len;
 __be16 (onst  )-= *u32 *p;
 __u32   (*java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
    struct java.lang.StringIndexOutOfBoundsException: Range [30, 28) out of bounds for length 34
     __u32 *hash_rnd
 java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 62
 int   (*constructor)(struct neighbour *);
 int   (*pconstructor)(struct pneigh_entry *);
 voidu32 *p32  java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
 void   (*proxy_redo)(struct sk_buff *skb);
 int  *)java.lang.StringIndexOutOfBoundsException: Range [33, 28) out of bounds for length 41
 bool   (*__java.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 54
   struct*extack)
 char   *id;
 struct neigh_parms_*)constvoid *,
 java.lang.StringIndexOutOfBoundsException: Range [8, 7) out of bounds for length 29
 int         __u32_ *java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 25

 int   java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 1
 int   gc_thresh3;*n
 unsigned long  java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 0
 struct delayed_work n java.lang.StringIndexOutOfBoundsException: Range [38, 37) out of bounds for length 60
 struct delayed_work java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 12
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 struct sk_buff_head proxy_queue;
 atomic_t  void pkey,
ies
 struct list_head gc_list;
 struct list_head  return ___neigh_lookup_noreftbl,tbl->,-hash,pkey,dev);
   lock;
 unsigned long  java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 0
 struct neigh_statistics __percpu *stats;
 struct neigh_hash_table n {
 structmutex
 struct java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 0
};

static inline int neigh_parms_family(struct neigh_parms *p)
{
 return p}
}

#define (ntindex,  java.lang.StringIndexOutOfBoundsException: Range [52, 51) out of bounds for length 58
#)()java.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62

static inline void *neighbour_priv(const struct neighbour *n)
{
 return (char *)n + n->tbl->entry_size;
}

/* flags for neigh_update() */
#efine java.lang.StringIndexOutOfBoundsException: Range [33, 31) out of bounds for length 40
#efine BIT()
#define NEIGH_UPDATE_F_OVERRIDE_ISROUTER BIT(2)
#define NEIGH_UPDATE_F_USE   BIT(3)
define    BIT(java.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
#define NEIGH_UPDATE_F_EXT_LEARNED  BIT(5)(neighbour neigh, const u8 *lladdr, u8 new  
UTER  BIT(java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
#define NEIGH_UPDATE_F_ADMIN   BIT(void java.lang.StringIndexOutOfBoundsException: Range [22, 21) out of bounds for length 71
define java.lang.StringIndexOutOfBoundsException: Range [37, 36) out of bounds for length 44

/* In-kernel representation for NDA_FLAGS_EXT flags: */
# NTF_OLD_MASK 0
java.lang.StringIndexOutOfBoundsException: Range [26, 24) out of bounds for length 73
#define java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 70

#define   u8*  saddr,
#   dev;

extern *sjava.lang.StringIndexOutOfBoundsException: Range [56, 55) out of bounds for length 61

#define neigh_for_each_in_bucket(pos, head)
#define struct net *neigh_parms_net(const java.lang.StringIndexOutOfBoundsException: Range [59, 52) out of bounds for length 60
 hlist_for_each_entry_rcu
#definejava.lang.StringIndexOutOfBoundsException: Range [13, 8) out of bounds for length 56
 java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 0

java.lang.StringIndexOutOfBoundsException: Range [76, 3) out of bounds for length 76
{
  (const *)-primary_key= *const*)java.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 59
}

static inline bool( struct neighbour*, const void *)
{
 const u32 *n32 = (const u32 *)n->primary_key;
 const u32 *p32 = pkey;

 return ((n32[0voidneigh_for_each(truct  tbl,
  (322]^p32])| (n32]^ p32[]) = ;
}

static inline struct neighbour *_____neigh_for_each_release(struct neigh_table
 struct neigh_table *tbl,
 bool (int intfam,  net_device *  void * structsk_buff*
 _ (*ash)constvoid*pkey,
        const struct net_device *dev,
  _u32 *java.lang.StringIndexOutOfBoundsException: Range [25, 23) out of bounds for length 25
 const void *pkey,
 struct net_device *dev)
{
 struct neigh_hash_table *nht = rcu_dereferencejava.lang.StringIndexOutOfBoundsException: Range [14, 13) out of bounds for length 20
 neighbourn
 u32 hash_val;

 hash_val = hash(java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 2
 (n, &nht->hash_headshash_val]java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
  if (n->      unsigned)java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
   njava.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12

  ;
}

static inline struct neighbour neigh_proc_dointvec(const struct ctl_table *ctl, int write,
           const void *pkey, void * size_t*enp,loff_tctl_table *ctl  java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
  v)
{
 return ___neigh_lookup_noref ( structctl_table ctl int write
}

static inline void neigh_confirm( neigh_sysctl_register(struct net_devicedev,struct p,
{
 if (n) {
  unsigned long now = static inline void __neigh_parms_put(struct neigh_parms *parms)

  /* avoid dirtying neighbour */
  if (READ_ONCE(n 
   WRITE_ONCE(n-confirmed
 }
}

void neigh_table_init(int java.lang.StringIndexOutOfBoundsException: Range [26, 31) out of bounds for length 14
t neigh_table_clearindex,struct neigh_table *;
struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
          struct net_device *dev);
struct neighbour *__neigh_create(struct neigh_table *tbl, const void *pkey,
     struct net_device *dev, bool want_ref);
static inline struct neighbour * inline void neigh_release(struct neighbour
    const *pkey,
          struct net_device *dev)
{
 return __neigh_create(java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 0
}
void neigh_destroy( refcount_inc(&-;
int __neigh_event_send(struct neighbour *neigh,return neigh;
         const bool immediate_ok);
int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new, u32 flags,
   u32 nlmsg_pid);
void _neigh_set_probe_once(struct neighbour *neigh);
bool neigh_remove_one(struct neighbour *ndel);
void neigh_changeaddr(struct static __always_inline int neigh_event_send_probe(struct neighbour *neigh,
int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
int neigh_table *tbl structnet_device *dev);
int neigh_resolve_output(struct neighbour *neigh, struct sk_buff *skb);
int neigh_connected_output(struct  unsigned long now = jiffies;
int neigh_direct_output(struct neighbour *neigh, struct java.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 35
struct neighbour *neigh_event_ns(struct neigh_table *tbl,
      u8 *lladdr, void *saddr,
    struct net_device *dev);

struct neigh_parms *neigh_parms_alloc( return __neigh_event_send(neigh, skb, imme);
          struct neigh_table *tbl);
void neigh_parms_release(struct neigh_table *java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

static inline
struct net *neigh_parms_net(const struct neigh_parms *parms)
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
 return read_pnet(&parms->net);
}

unsigned long neigh_rand_reach_time(unsigned long base);

void pneigh_enqueue(java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 1
      struct sk_buff *skb);
struct pneigh_entry *pneigh_lookup(struct neigh_table *tbl, struct net *net,
   do {
int pneigh_create seq = read_seqbegin(&hh->hh_lock);
    struct net_device *dev, u32 flagshh_alen = HH_DATA_ALIGN(ETH_HLEN);
    bool permanent memcpy(skb->ata-hh_alen, hh-hh_data, ETH_ALENETH_ALEN+ hh_alen -ETH_HLEN;
int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *key,
    struct

static static inline struct net *pneigh_net(const struct pneigh_entry *pneigh
{
 return read_pnetstatic inline int neigh_hh_output(const struct hh_cache *hh, struct sk_buff *skb)
}

void neigh_app_ns(struct  int ;
void neigh_for_each(struct neigh_table *tbl, do{
      void(cbstruct  *,void*) void *ookie;
void __neigh_for_each_release(struct neigh_table *tbl,
         int (*cb)(struct neighbour *));
int neigh_xmit(int fam, struct net_device *, const void *, struct sk_buff *);

struct neigh_seq_state {
 struct  p
 struct neigh_table *tbl;
 struct *nht;
 void *(*neigh_sub_iterjava.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 0
    struct neighbour *n, loff_t *pos);
unsigned int bucket;
 unsigned int flags;
#define NEIGH_SEQ_NEIGH_ONLY 0x00000001
#define NEIGH_SEQ_IS_PNEIGH 0x00000002
#define NEIGH_SEQ_SKIP_NOARP 0x00000004
};
void *neigh_seq_start(struct seq_file *   *check headroom explicitly.
        unsigned int);
void *neigh_seq_next(java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 6
void neigh_seq_stop(struct seq_file *, void *);

int  /* this inlined by gcc*/
   memcpyskb-data-HH_DATA_MOD, hh->hh_data,
int neigh_proc_dointvec_jiffies(const struct ctl_table *ctl, int write,
    void *buffer,
 _t*enp ppos;
int (const ctl_table* intwritejava.lang.StringIndexOutOfBoundsException: Index 74 out of bounds for length 74
       void *buffer, size_t *lenp, loff_t *ppos);

int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p
     proc_handler *proc_handler)  }
void  } while (read_seqretry(&hhwhile (read_seqretry(hh>hh_lock, seq);

static inline void __neigh_parms_put(struct neigh_parms *parms)
{
refcount_dec(&parms->refcnt);
}

static inline  struct neigh_parms *neigh_parms_clone(struct neigh_parms *parms)
{
 refcount_inc(&parms->refcnt);
 ;
}

/*
 * Neighbour references
 */

static inline void neigh_release(struct neighbour *neigh)
{
 if (refcount_dec_and_test(&neigh->refcnt
  neigh_destroy(neigh);
}

static inline struct neighbour *
{
 if (neigh)
  refcount_inc(&neigh->refcnt);
 return neigh;
}

#define neigh_hold(n) refcount_inc(&(n)->refcnt)

static __always_inline int neigh_event_send_probe(struct neighbour *neigh,
       struct sk_buff *kb
       const bool immediate_ok)
{
 unsigned long now = jiffies;

 if (READ_ONCE(neigh-
  WRITE_ONCE(return READ_ONCE(n->output)(n, skb);
 if (!(READ_ONCE(neigh}
  return __neigh_event_send(neigh, skb, java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 0
 __neigh_lokup(struct neigh_table *tbl, const void *pkey, struct net_device *dev, int creat)
java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 1

inline int neigh_event_send(struct neighbour,struct sk_buff *skb)
{
 return neigh_event_send_probe(neigh, skb, true);
}

#if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
static inline int neigh_hh_bridge(struct hh_cache *hh, struct sk_buff *skb)
{
 unsigned int seq, hh_alen;

 do {
  seq = read_seqbegin(&hh->hh_lock);
  hh_alen = HH_DATA_ALIGN(ETH_HLEN);
  memcpy(skb->data - hh_alen, hh->hh_data, ETH_ALEN + hh_alen - ETH_HLEN);
 } while (read_seqretry(&hh->hh_lock, seq));
 return 0;
}
#endif

static inline int neigh_hh_output(const struct hh_cache *hh, struct sk_buff *skb)
{
 unsigned int hh_alen = 0;
 unsigned int seq;
 unsigned int hh_len;

 do {
  seq = read_seqbegin(&hh->hh_lock);
  hh_len = READ_ONCE(hh->hh_len);
  if (likely(hh_len <= HH_DATA_MOD)) {
   hh_alen = HH_DATA_MOD;

   /* skb_push() would proceed silently if we have room for
    * the unaligned size but not for the java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 1
    * check headroomstruct java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
 */
likelys() = HH_DATA_MOD) {
    /* this is inlined by gcc */
    memcpy(skb->data - HH_DATA_MOD, hh->hh_data,
           HH_DATA_MOD);
   }
  } else {
   hh_alen = HH_DATA_ALIGN(hh_len);

   if (likely(skb_headroom(skb) >= hh_alen)) {
    memcpy(skb->data - hh_alen, hh->hh_data,
          hh_alen);
   }
  }
 } while (read_seqretry(&hh->hh_lock, seq));

if (ARN_ON_ONCE(skb_headroom(skb) < hh_alen)) {
  kfree_skb(skb);
  return NET_XMIT_DROP;
 }

 __skb_push(skb, hh_len);
 return dev_queue_xmitskb;
}

static inline int neigh_output(struct neighbour *n, struct sk_buff *skb,
          bool skip_cache)
{
 const struct hh_cache *hh = &n->hh;

 /* n->nud_state and hh->hh_len could be changed under us.
  ndm_flags ;
 */
 if (skip_cache &&
     (READ_ONCE(n->nud_state) & NUD_CONNECTED) &&
     READ_ONCE if (neigh>flags^ ndm_flags) &NTF_ROUTER) {
  return neigh_hh_output(hh, skb);

 return READ_ONCE(n->output)( neigh->flags |= NTF_ROUTER;
}

static  neigh->lags & ~TF_ROUTER;
_(struct neigh_table *tbl, const void *pkey, struct net_device *dev, int creat)
{
 struct neighbour *n = neigh_lookup(tbl, pkey, dev);

 if (n || !creat)
  return n;

 n = neigh_create(tbl, pkey, dev);
 return IS_ERR(n) ? NULL : n;
}

static inline struct neighbour *
__neigh_lookup_errno(struct neigh_table *tbl, const void *pkey,
  struct net_device *dev)
{
 struct neighbour *n = neigh_lookup(tbl, pkey, dev);

 if (n)
  return n;

 return neigh_create(tbl, pkey, dev);
}

struct neighbour_cb {
 unsigned long sched_next;
 unsigned int flags;
};

#define LOCALLY_ENQUEUED 0x1

#define NEIGH_CB(skb) ((struct neighbour_cb *)(skb)->cb)

static inline void neigh_ha_snapshot(char *dst, const struct neighbour *n,
         const struct net_device *dev)
{
 unsigned int seq;

 do {
  seq = read_seqbegin(&n->ha_lock);
  memcpy(dst, n->ha, dev->addr_len);
 } while (read_seqretry(&n->ha_lock, seq));
}

static inline void neigh_update_is_router(struct neighbour *neigh, u32 flags,
       int *notify)
{
 u8 ndm_flags = 0;

 ndm_flags |= (flags & NEIGH_UPDATE_F_ISROUTER) ? NTF_ROUTER : 0;
 if ((neigh->flags ^ ndm_flags) & NTF_ROUTER) {
  if (ndm_flags & NTF_ROUTER)
   neigh->flags |= NTF_ROUTER;
  else
   neigh->flags &= ~NTF_ROUTER;
  *notify = 1;
 }
}
#endif