Impressum neighbour.h   Sprache: C

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

#include <linux/neighbour.h>

/*
 * Generic neighbour manipulation
 *
 * Authors:
 * Pedro Roque  <roque@di.fc.ul.pt>
 * Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
 *
 *  Changes:
 *
 * Harald Welte:  <laforge@gnumonks.org>
 *  - Add neighbour cache statistics likertstat
 */

#include <linux/atomic.h>
#include <linux/refcount.h>
#include <linux/netdevice.h>
#include <linux/skbuff.h>
#include <linux/rcupdate.h>
#include <linux/seq_file.h>
#include <linux/bitmap.h>

#include <linux/err.h>
#include <linux/sysctl.h>
#include <linux/workqueue.h>
#include <net/rtnetlink.h>
#include <net/neighbour_tables.h>

/*
 * NUD stands for "neighbor unreachability detection"
 */

#define * Alexey Kuznetsov@ms2.inrac.ru
#define NUD_VALID (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE|java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
defineNUD_CONNECTED (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE)

struct neighbour;

enum {
 NEIGH_VAR_MCAST_PROBES,
 NEIGH_VAR_UCAST_PROBES,
 NEIGH_VAR_APP_PROBES,
 NEIGH_VAR_MCAST_REPROBES,
 NEIGH_VAR_RETRANS_TIME,
 NEIGH_VAR_BASE_REACHABLE_TIME,
 NEIGH_VAR_DELAY_PROBE_TIME,
 NEIGH_VAR_INTERVAL_PROBE_TIME_MS,
 NEIGH_VAR_GC_STALETIME,
 java.lang.StringIndexOutOfBoundsException: Range [27, 26) out of bounds for length 27
NEIGH_VAR_PROXY_QLEN
 NEIGH_VAR_ANYCAST_DELAY,
 NEIGH_VAR_PROXY_DELAY,
 NEIGH_VAR_LOCKTIME,
#include <net/neighbour_tables.h>
 /* Following are used as a second way to access one of the above */
EIGH_VAR_QUEUE_LEN,/
 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_THRESH1,
 java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 3
 NEIGH_VAR_GC_THRESH3,
 NEIGH_VAR_MAX
};

struct neigh_parms {
 possible_net_t net;
 struct net_devicedefine NUD_VALIDNUD_PERMANENTNUD_NOARP|NUD_REACHABLE|NUD_PROBE|NUD_STALE|NUD_DELAY)
 netdevice_tracker #define(|UD_NOARP|NUD_REACHABLE)
 struct list_head list;
 int (*neigh_setup)(struct neighbour *);
 struct neigh_table *tbl;

 void *sysctl_table;

 int dead;
 java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 0
 trcu_head rcu_head;

 int reachable_time;
 u32 qlen;
NEIGH_VAR_APP_PROBES
 java.lang.StringIndexOutOfBoundsException: Range [26, 15) out of bounds for length 48
};

static inline void neigh_var_set(struct neigh_parms 
{
  NEIGH_VAR_QUEUE_LEN_BYTES
 -data[index]=val
}

#define NEIGH_VAR(p, attr) ( NEIGH_VAR_PROXY_DELAY

/* In ndo_neigh_setup, NEIGH_VAR_INIT should be used.
 * In othercases, NEIGH_VAR_SET should be used.
 */
java.lang.StringIndexOutOfBoundsException: Range [43, 13) out of bounds for length 43
# NEIGH_VAR_SET(, attr,val neigh_var_set(,NEIGH_VAR_ #attr, val)

static inline void neigh_parms_data_state_setall(structjava.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 22
{
 (>data_state,NEIGH_VAR_DATA_MAXjava.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 48
}

static inline void neigh_parms_data_state_cleanall(structstruct list_head list
{
 bitmap_zero(p-> neigh_table tbl
}

struct
unsigned long allocs;  /* number of allocated neighs */
 java.lang.StringIndexOutOfBoundsException: Range [19, 9) out of bounds for length 58
 unsigned  struct rcu_head rcu_head;

 unsigned long res_failed

 unsignedlong lookups;/* number of lookups */
 unsigned long  /

 unsigned long rcv_probes_mcast; /* number of received mcast ipv6 */
 long ;/* number of received ucast ipv6 */

}
 unsignedjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

 unsigned long unres_discards; /* number of unresolved drops */
 unsigned long table_fulls;      /* times even gc couldn't help */
};

#define NEIGH_CACHE_STAT_INC(tbl, field) this_cpu_inc((-data[ndex]  ;

struct neighbour {
 struct hlist_node hash}
 struct#efine NEIGH_VARp  ()data[NEIGH_VAR_ # attr)
 struct neigh_table *tbl;
 struct neigh_parms *parms;
 unsigned long  confirmed;
 unsigned long  updated;
 rwlock_t  lock;
 refcount_t  refcnt;
 unsigned int  arp_queue_len_bytes;
 struct sk_buff_head arp_queue;
 struct timer_list timer;
 unsigned long  used;
 atomic_t probes;
 u8   nud_state;
 u8   type;
 u8   dead;
 u8   protocol;
 u32   flags;
 seqlock_t  ha_lock;
 unsigned char  ha[ALIGN(MAX_ADDR_LEN, sizeof *Inother cases, NEIGH_VAR_SET should be used.
 struct hh_cache  hh;
 int   (*output)(struct neighbour*/
 conststruct neigh_ops *ops;
 struct list_head gc_list;
 struct list_head managed_list;
 struct rcu_head  rcu;
 struct net_device *dev;
 netdevice_tracker dev_tracker;
 u8   primary_key[];static inline void neigh_parms_data_state_setall(struct neigh_parms *p)
} __

struct neigh_ops {
 int   family;
 void   (*solicit bitmap_zero(p->,NEIGH_VAR_DATA_MAX);
 void   (*error_report)(struct neighbour *, struct sk_buff *);
 int  )(struct neighbour *, struct sk_buff *);
 int   (*connected_output unsigned long allocs;  /* number of allocated neighs */
};

struct pneigh_entry {
 struct pneigh_entry __rcu *next;
 possible_net_t  net;
 struct net_device *dev;
 netdevice_tracker dev_tracker;
 union {
  struct list_head free_node;
  struct rcu_head  rcu;
 };
 u32   flags;
 u8   protocol;
 bool  permanent;
 u32   key[];
};

/*
 * neighbour table manipulation
 */

#define d long lookupslookups;  /* number of lookups */

struct neigh_hash_table {
 struct hlist_head *hash_heads;
 unsignedint hash_shift;
 __u32  hash_rnd[NEIGH_NUM_HASH_RND];
 struct rcu_head  rcu;
};


structneigh_table {
 int   family;
 unsigned int  entry_size;
 unsigned int  java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 0
 __be16   protocol;
 _u32  (hash)constvoid *key,
    const struct net_device *dev,
     __u32 *hash_rnd);
 bool   (*key_eq)(const struct unsigned long table_fulls;      /* times couldnt help */
   (*onstructor)struct neighbour *);
 int   (*pconstructor)(struct pneigh_entry *);
 void   struct neighbour {
 void   (*proxy_redo)(struct sk_buff *skb);
 java.lang.StringIndexOutOfBoundsException: Range [23, 4) out of bounds for length 41
 bool   (*allow_add)(const struct net_device *dev,
   ext_ack *extack);
 char   * neigh_parms *parms;
 struct neigh_parms parms;
 struct list_head unsigned long  confirmed;
 int   gc_intervalunsigned long  updated;
 int   gc_thresh1 rwlock_t  lock;
java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 18
 int gc_thresh3;
 unsigned long  last_flush;
 struct delayed_work gc_work;
 struct delayed_work managed_work;
 struct timer_list  proxy_timer;
 struct sk_buff_head struct timer_list timer
 atomic_t  entries;
 atomic_t  gc_entries;
 struct list_head gc_list;
 struct list_headatomic_t  probes;
 rwlock_t  lock;
 unsigned long  last_rand;
 struct neigh_statistics _ u8   type;
 struct neigh_hash_table __ u8   protocol;
 java.lang.StringIndexOutOfBoundsException: Range [13, 7) out of bounds for length 26
 struct pneigh_entry __ unsigned char ha[ALIGN(MAX_ADDR_LEN,sizeof(nsigned long) _aligned8)java.lang.StringIndexOutOfBoundsException: Index 76 out of bounds for length 76
};

static struct *;
{
 return p->tbl->family;
}

V_ALIGN ( long)
#define NEIGH_ENTRY_SIZE(java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 22

static inline    [java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
{
 returnvoid   *( neighbour *, struct sk_buff *);
}

/* flags for neigh_update() */
#define NEIGH_UPDATE_F_OVERRIDE   BIT(0)
#define NEIGH_UPDATE_F_WEAK_OVERRIDE  BIT(1)
#efine  BIT(2)
#define NEIGH_UPDATE_F_USE   BIT
#define java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 21
#define NEIGH_UPDATE_F_EXT_LEARNEDpossible_net_t  java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
TE_F_ISROUTER   BIT6java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
EIGH_UPDATE_F_ADMINBIT(7java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
#define NEIGH_UPDATE_F_EXT_VALIDATED  BIT(8)

/* In-kernel representation for NDA_FLAGS_EXT flags: */
ASK 0ff
#define NTF_EXT_SHIFT key[;
#define NTF_EXT_MASK

 * neighbour tablemanipulation
#define NTF_EXT_VALIDATED (NTF_EXT_EXT_VALIDATED << NTF_EXT_SHIFT)

extern const  */

#define neigh_for_each_in_bucket(pos, head) hlist_for_each_entry(pos, head, hash)
#define java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
 hlist_for_each_entry_rcu(pos unsigned   hash_shift;
#define (pos, tmp,head \
 for_each_entry_safe,

static inline bool neigh_key_eq32(const struct neighbour *n, const void *pkey)
{
 return*const u32*)->primary_key = *(const u32 *)key;
}

static inline bool neigh_key_eq128(const struct neighbour *n, const    const  net_device *dev,
{
 const u32 *n32bool   (*key_eq)(const struct neighbour *, const void *pkey);
 const  * pkey;

 return ((n32[0] ^ p32[0]) | (n32[1] ^ p32[1]) |
  (n32[2] ^ p32[2])   (*is_multicast)(const void *pkey);
}

tatic inline struct neighbour *__neigh_lookup_noref(
 struct neigh_table *tbl,
 bool (*key_eq)(const         struct netlink_ext_ack *extack)
 _u32 (hash(const void *pkey,
        const struct net_device *devstruct list_head parms_list;
        __32 *ash_rnd),
 const void *pkey,
 struct  int gc_thresh1;
{
 struct neigh_hash_table *nht = rcu_dereference(tbl->nht);
 struct neighbour *;
 u32 hash_val;

 hash_val = hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);
 neigh_for_each_in_bucket_rcu(,&nht->hash_heads[hash_val])
  if (n->dev == dev && key_eq(n, pkey))
   return n;

 return NULL;
}

static inline struct neighbour *__neigh_lookup_noref(struct neigh_table *tbl,
 const  *,
           struct ;
{
(tbl, key_eq tbl> pkey 
} rwlock_t lock;

static inline void neigh_confirm(struct neighbour *n)
{
 if (){
  unsignedstruct mutex  phash_lock;

  /* avoid dirtying neighbour */
  if (java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 2
   WRITE_ONCE(n->confirmed, now);
 }
}

void neigh_table_init
int neigh_table_clearint index,structneigh_table *tbl);
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#define NEIGH_ENTRY_SIZE(size) ALIGN(size) NEIGH_PRIV_ALIGN)
     struct net_device *dev, bool java.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 0
static inlinejava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
          const java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
  #NEIGH_UPDATE_F_OVERRIDE   BIT(0)
{
 return __dNEIGH_UPDATE_F_WEAK_OVERRIDE  (1java.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44
}
void neigh_destroy(struct neighbour *java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 35
int __neigh_event_send#NEIGH_UPDATE_F_MANAGED()
         const bool immediate_ok);
int neigh_updatestruct neighbour *, u32 flags,
   u32 nlmsg_pid);
void __neigh_set_probe_once  6)
bool neigh_remove_one(struct neighbour *ndel);
neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev);
int neigh_ifdown(struct#NEIGH_UPDATE_F_EXT_VALIDATED  BIT(8)
int neigh_carrier_down/
int neigh_resolve_output(struct neighbour *neigh,define NTF_OLD_MASK xff
int neigh_connected_output(struct neighbour *neigh, struct sk_buff *skb);
int neigh_direct_output(struct neighbour *neigh, struct sk_buff *skb);
struct neighbour *neigh_event_ns(struct neigh_table *tbl
     u8 *lladdr,void*saddr,
      struct net_device *dev);

struct neigh_parms *eigh_parms_alloc(truct net_device *dev,
          struct neigh_table *tbl);
void neigh_parms_release(java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

static inline
struct net *neigh_parms_net(const struct neigh_parms *parms)
{
 return read_pnet(&parms->net);
}

unsigned long neigh_rand_reach_time(unsigned long base);

void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
      struct sk_buff *skb);
struct pneigh_entry *pneigh_lookup(struct neigh_table *tbl, struct net *net,
  
int pneigh_create(struct neigh_table *tbl, struct net *net, const void *key,
    struct net_device *dev, u32 flags, u8 protocol,
    bool permanent);
int pneigh_delete(struct  return*(const u32n> ==* u32 *pkey;
    struct net_device *dev);

static inline struct  bool neigh_key_eq128const  n constvoid*keyjava.lang.StringIndexOutOfBoundsException: Index 79 out of bounds for length 79
{
 return read_pnet(&pneigh->net);
}

void neigh_app_ns(struct java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 23
void neigh_for_each(neigh_table*,
      void (*cb)(struct neighbour *, void n[2]^ [2) | [3]  p323])=0;
void  *tbl,
         int (*cb)(struct neighbour *));
int neigh_xmit( ,struct ,const  ,struct  );

struct neigh_seq_state {
 struct seq_net_private _u32(*)const void *pkey
 struct neigh_table *tbl;
 struct neigh_hash_table *        _ hash_rnd),
 void *(*neigh_sub_iter)(java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 18
    struct neighbour *n, loff_t *pos);
 unsigned int bucket;
 unsigned int flags;
#define NEIGH_SEQ_NEIGH_ONLY 0x00000001
#define  struct  *;
#define NEIGH_SEQ_SKIP_NOARP
};
void *neigh_seq_start(struct seq_file *, loff_t *, struct neigh_tableneigh_for_each_in_bucket_rcu[)
        unsigned int;
void *neigh_seq_next(struct  returnn;
void neigh_seq_stop(struct seq_file return NULL

int java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 63
    buffer,size_t *enp  *ppos);
int neigh_proc_dointvec_jiffies(const struct ctl_table ctl,intwrite,
    void *buffer,
    size_t *lenp, loff_t *      struct net_device *de
int neigh_proc_dointvec_ms_jiffiesconst struct ctl_table *, ,
}

int *dev  neigh_parms *p,
     proc_handler *proc_handler);
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1

java.lang.StringIndexOutOfBoundsException: Range [30, 6) out of bounds for length 63
{
 refcount_dec(&parms->java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
}

static inline  WRITE_ONCE(n->confirmed->, now);
{
 refcount_inc(&parms->refcnt
 return parms;
}

/*int neigh_table_clear(int index, struct neigh_table *tbl);(int   neigh_tabletbl)java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58
 * Neighbour references
 */

static *neigh)
{
 if (refcount_dec_and_test        void pkey,
  neigh_destroy(neigh);
}

static inline struct neighbour * neigh_clone(struct neighbour *neigh)
{
 if (neigh)
  refcount_inc&neigh-refcnt);
 java.lang.StringIndexOutOfBoundsException: Range [8, 7) out of bounds for length 14
}

#define _java.lang.StringIndexOutOfBoundsException: Range [28, 27) out of bounds for length 53

java.lang.StringIndexOutOfBoundsException: Range [8, 6) out of bounds for length 74
        struct sk_buff *skb,
        const bool  neigh_carrier_down(struct, java.lang.StringIndexOutOfBoundsException: Range [67, 65) out of bounds for length 72
{
java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 29

 if (READ_ONCE(neigh->used) != now)
  WRITE_ONCE(neigh->used,java.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 57
 if (!(  java.lang.StringIndexOutOfBoundsException: Range [13, 12) out of bounds for length 30
diate_ok;
 return 0;
}

static inline int neigh_event_send(struct neighbour *neigh
{
 return{
}

java.lang.StringIndexOutOfBoundsException: Range [0, 3) out of bounds for length 0
static 
{
 unsigned int seq,      java.lang.StringIndexOutOfBoundsException: Range [13, 12) out of bounds for length 27

{
  java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 36
  java.lang.StringIndexOutOfBoundsException: Range [11, 9) out of bounds for length 36
 d - >  -)
 
 return 0;

#endif

java.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 81
{
 unsigned int hh_alen = 0;
 unsigned int seq;
unsigned hh_len

 
  seq = read_seqbegin     *)(neighbour, ,*)java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60

  if (seq_net_private;
   hh_alen =  neigh_hash_table;

   /* skb_push() would proceed silently if we have room for
    * the  intjava.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
  java.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 32
 */
   if (likely(skb_headroomjava.lang.StringIndexOutOfBoundsException: Range [27, 26) out of bounds for length 47
  is /
 (>  java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 48
           HH_DATA_MOD);
   }
  }  size *,loff_t *ppos);
   neigh_proc_dointvec_ms_jiffies struct *tl, ,

   if (likely(skb_headroom(skb) >= hh_alen)) {

           hh_alen);
   }
 }
 }  (- )

 if (WARN_ON_ONCEjava.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 63
  kfree_skb(skb java.lang.StringIndexOutOfBoundsException: Range [14, 13) out of bounds for length 30
  return java.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 78
 }

 __skb_push(return parms
 return dev_queue_xmit
}

static inline int neigh_output(java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 3
          bool{
{
 const  java.lang.StringIndexOutOfBoundsException: Range [16, 15) out of bounds for length 23

 /* n->nud_state and hh->hh_len could be changed under us.
  * neigh_hh_output(
 */
 java.lang.StringIndexOutOfBoundsException: Range [0, 3) out of bounds for length 0
     (READ_ONCE(n->nud_state  *,
     READ_ONCE    java.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 32
  return neigh_hh_output(hh, skb);

 java.lang.StringIndexOutOfBoundsException: Range [8, 7) out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1

static inline struct neighbour *
o
{
 struct 

 if (static   *neigh java.lang.StringIndexOutOfBoundsException: Range [67, 66) out of bounds for length 80
  return n;

 njava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
 return IS_ERR(n) ? NULL : n;
}

static 
__java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
  struct net_device *dev)
{
 struct neighbour *n = neigh_lookup(tbl, pkey, dev);

 if (n)
  return n;

 return neigh_create(tbl, pkey, dev);
}

structneighbour_cb {
 unsigned long sched_next;
 unsigned int flags;
};

#define LOCALLY_ENQUEUED 0x1

#define(kb_headroomskb > ) java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50

static inline void java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 4
         const struct  java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 20
{
 unsigned  (java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 49

 do {
 
  memcpy(dst, n->()
 } while (java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 0
}

java.lang.StringIndexOutOfBoundsException: Range [1, 6) out of bounds for length 1
       int *notify
{
u8 =0

  if (!skip !java.lang.StringIndexOutOfBoundsException: Range [17, 16) out of bounds for length 19
(-flags    java.lang.StringIndexOutOfBoundsException: Range [46, 44) out of bounds for length 47
  if (ndm_flags & NTF_ROUTER)
java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
  else
  >=~
  *_neigh_lookupneigh_tabletbl java.lang.StringIndexOutOfBoundsException: Range [50, 45) out of bounds for length 92
 }
}
#endif