The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/dev/cxgb/cxgb_l2t.h

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /**************************************************************************
    2 
    3 Copyright (c) 2007, Chelsio Inc.
    4 All rights reserved.
    5 
    6 Redistribution and use in source and binary forms, with or without
    7 modification, are permitted provided that the following conditions are met:
    8 
    9  1. Redistributions of source code must retain the above copyright notice,
   10     this list of conditions and the following disclaimer.
   11 
   12  2. Neither the name of the Chelsio Corporation nor the names of its
   13     contributors may be used to endorse or promote products derived from
   14     this software without specific prior written permission.
   15 
   16 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
   17 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   18 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   19 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
   20 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
   21 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
   22 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
   23 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
   24 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
   25 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
   26 POSSIBILITY OF SUCH DAMAGE.
   27 
   28 $FreeBSD$
   29 
   30 ***************************************************************************/
   31 #ifndef _CHELSIO_L2T_H
   32 #define _CHELSIO_L2T_H
   33 
   34 #include <dev/cxgb/ulp/toecore/toedev.h>
   35 #include <sys/lock.h>
   36 
   37 #if __FreeBSD_version > 700000
   38 #include <sys/rwlock.h>
   39 #else
   40 #define rwlock mtx
   41 #define rw_wlock(x) mtx_lock((x))
   42 #define rw_wunlock(x) mtx_unlock((x))
   43 #define rw_rlock(x) mtx_lock((x))
   44 #define rw_runlock(x) mtx_unlock((x))
   45 #define rw_init(x, str) mtx_init((x), (str), NULL, MTX_DEF)
   46 #define rw_destroy(x) mtx_destroy((x))
   47 #endif
   48 
   49 enum {
   50         L2T_STATE_VALID,      /* entry is up to date */
   51         L2T_STATE_STALE,      /* entry may be used but needs revalidation */
   52         L2T_STATE_RESOLVING,  /* entry needs address resolution */
   53         L2T_STATE_UNUSED      /* entry not in use */
   54 };
   55 
   56 /*
   57  * Each L2T entry plays multiple roles.  First of all, it keeps state for the
   58  * corresponding entry of the HW L2 table and maintains a queue of offload
   59  * packets awaiting address resolution.  Second, it is a node of a hash table
   60  * chain, where the nodes of the chain are linked together through their next
   61  * pointer.  Finally, each node is a bucket of a hash table, pointing to the
   62  * first element in its chain through its first pointer.
   63  */
   64 struct l2t_entry {
   65         uint16_t state;               /* entry state */
   66         uint16_t idx;                 /* entry index */
   67         uint32_t addr;                /* dest IP address */
   68         int ifindex;                  /* neighbor's net_device's ifindex */
   69         uint16_t smt_idx;             /* SMT index */
   70         uint16_t vlan;                /* VLAN TCI (id: bits 0-11, prio: 13-15 */
   71         struct rtentry *neigh;        /* associated neighbour */
   72         struct l2t_entry *first;      /* start of hash chain */
   73         struct l2t_entry *next;       /* next l2t_entry on chain */
   74         struct mbuf *arpq_head;       /* queue of packets awaiting resolution */
   75         struct mbuf *arpq_tail;
   76         struct mtx lock;
   77         volatile uint32_t refcnt;     /* entry reference count */
   78         uint8_t dmac[6];              /* neighbour's MAC address */
   79 #ifndef NETEVENT
   80 #ifdef CONFIG_CHELSIO_T3_MODULE
   81         struct timer_list update_timer;
   82         struct toedev *tdev;
   83 #endif
   84 #endif
   85 };
   86 
   87 struct l2t_data {
   88         unsigned int nentries;      /* number of entries */
   89         struct l2t_entry *rover;    /* starting point for next allocation */
   90         volatile uint32_t nfree;    /* number of free entries */
   91         struct rwlock lock;
   92         struct l2t_entry l2tab[0];
   93 };
   94 
   95 typedef void (*arp_failure_handler_func)(struct toedev *dev,
   96                                          struct mbuf *m);
   97 
   98 /*
   99  * Callback stored in an skb to handle address resolution failure.
  100  */
  101 struct l2t_mbuf_cb {
  102         arp_failure_handler_func arp_failure_handler;
  103 };
  104 
  105 /*
  106  * XXX 
  107  */
  108 #define L2T_MBUF_CB(skb) ((struct l2t_mbuf_cb *)(skb)->cb)
  109 
  110 
  111 static __inline void set_arp_failure_handler(struct mbuf *m,
  112                                            arp_failure_handler_func hnd)
  113 {
  114 #if 0
  115         L2T_SKB_CB(skb)->arp_failure_handler = hnd;
  116 #endif
  117         panic("implement me");
  118 }
  119 
  120 /*
  121  * Getting to the L2 data from an offload device.
  122  */
  123 #define L2DATA(dev) ((dev)->l2opt)
  124 
  125 void t3_l2e_free(struct l2t_data *d, struct l2t_entry *e);
  126 void t3_l2t_update(struct toedev *dev, struct rtentry *ifp);
  127 struct l2t_entry *t3_l2t_get(struct toedev *dev, struct rtentry *neigh,
  128                              unsigned int smt_idx);
  129 int t3_l2t_send_slow(struct toedev *dev, struct mbuf *m,
  130                      struct l2t_entry *e);
  131 void t3_l2t_send_event(struct toedev *dev, struct l2t_entry *e);
  132 struct l2t_data *t3_init_l2t(unsigned int l2t_capacity);
  133 void t3_free_l2t(struct l2t_data *d);
  134 
  135 #ifdef CONFIG_PROC_FS
  136 int t3_l2t_proc_setup(struct proc_dir_entry *dir, struct l2t_data *d);
  137 void t3_l2t_proc_free(struct proc_dir_entry *dir);
  138 #else
  139 #define l2t_proc_setup(dir, d) 0
  140 #define l2t_proc_free(dir)
  141 #endif
  142 
  143 int cxgb_ofld_send(struct toedev *dev, struct mbuf *m);
  144 
  145 static inline int l2t_send(struct toedev *dev, struct mbuf *m,
  146                            struct l2t_entry *e)
  147 {
  148         if (__predict_true(e->state == L2T_STATE_VALID))
  149                 return cxgb_ofld_send(dev, m);
  150         return t3_l2t_send_slow(dev, m, e);
  151 }
  152 
  153 static inline void l2t_release(struct l2t_data *d, struct l2t_entry *e)
  154 {
  155         if (atomic_fetchadd_int(&e->refcnt, -1) == 1)
  156                 t3_l2e_free(d, e);
  157 }
  158 
  159 static inline void l2t_hold(struct l2t_data *d, struct l2t_entry *e)
  160 {
  161         if (atomic_fetchadd_int(&e->refcnt, 1) == 1)  /* 0 -> 1 transition */
  162                 atomic_add_int(&d->nfree, 1);
  163 }
  164 
  165 #endif

Cache object: fd5203742f22e33a89626aa8f529e4d8


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.