2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2012 Chelsio Communications, Inc.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * 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 AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 #include <sys/cdefs.h>
29 __FBSDID("$FreeBSD$");
32 #include "opt_inet6.h"
34 #include <sys/param.h>
35 #include <sys/eventhandler.h>
36 #include <sys/systm.h>
37 #include <sys/kernel.h>
38 #include <sys/module.h>
41 #include <sys/mutex.h>
42 #include <sys/rwlock.h>
43 #include <sys/socket.h>
45 #include <netinet/in.h>
47 #include "common/common.h"
48 #include "common/t4_msg.h"
52 * Module locking notes: There is a RW lock protecting the L2 table as a
53 * whole plus a spinlock per L2T entry. Entry lookups and allocations happen
54 * under the protection of the table lock, individual entry changes happen
55 * while holding that entry's spinlock. The table lock nests outside the
56 * entry locks. Allocations of new entries take the table lock as writers so
57 * no other lookups can happen while allocating new entries. Entry updates
58 * take the table lock as readers so multiple entries can be updated in
59 * parallel. An L2T entry can be dropped by decrementing its reference count
60 * and therefore can happen in parallel with entry allocation but no entry
61 * can change state or increment its ref count during allocation as both of
62 * these perform lookups.
64 * Note: We do not take references to ifnets in this module because both
65 * the TOE and the sockets already hold references to the interfaces and the
66 * lifetime of an L2T entry is fully contained in the lifetime of the TOE.
70 * Allocate a free L2T entry. Must be called with l2t_data.lock held.
73 t4_alloc_l2e(struct l2t_data *d)
75 struct l2t_entry *end, *e, **p;
77 rw_assert(&d->lock, RA_WLOCKED);
79 if (!atomic_load_acq_int(&d->nfree))
82 /* there's definitely a free entry */
83 for (e = d->rover, end = &d->l2tab[d->l2t_size]; e != end; ++e)
84 if (atomic_load_acq_int(&e->refcnt) == 0)
87 for (e = d->l2tab; atomic_load_acq_int(&e->refcnt); ++e)
91 atomic_subtract_int(&d->nfree, 1);
94 * The entry we found may be an inactive entry that is
95 * presently in the hash table. We need to remove it.
97 if (e->state < L2T_STATE_SWITCHING) {
98 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) {
107 e->state = L2T_STATE_UNUSED;
111 static struct l2t_entry *
112 find_or_alloc_l2e(struct l2t_data *d, uint16_t vlan, uint8_t port, uint8_t *dmac)
114 struct l2t_entry *end, *e, **p;
115 struct l2t_entry *first_free = NULL;
117 for (e = &d->l2tab[0], end = &d->l2tab[d->l2t_size]; e != end; ++e) {
118 if (atomic_load_acq_int(&e->refcnt) == 0) {
121 } else if (e->state == L2T_STATE_SWITCHING &&
122 memcmp(e->dmac, dmac, ETHER_ADDR_LEN) == 0 &&
123 e->vlan == vlan && e->lport == port)
124 return (e); /* Found existing entry that matches. */
127 if (first_free == NULL)
128 return (NULL); /* No match and no room for a new entry. */
131 * The entry we found may be an inactive entry that is
132 * presently in the hash table. We need to remove it.
135 if (e->state < L2T_STATE_SWITCHING) {
136 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) {
144 e->state = L2T_STATE_UNUSED;
150 * Write an L2T entry. Must be called with the entry locked.
151 * The write may be synchronous or asynchronous.
154 t4_write_l2e(struct l2t_entry *e, int sync)
158 struct wrq_cookie cookie;
159 struct cpl_l2t_write_req *req;
162 mtx_assert(&e->lock, MA_OWNED);
163 MPASS(e->wrq != NULL);
168 req = start_wrq_wr(wrq, howmany(sizeof(*req), 16), &cookie);
172 idx = e->idx + sc->vres.l2t.start;
174 OPCODE_TID(req) = htonl(MK_OPCODE_TID(CPL_L2T_WRITE_REQ, idx |
175 V_SYNC_WR(sync) | V_TID_QID(e->iqid)));
176 req->params = htons(V_L2T_W_PORT(e->lport) | V_L2T_W_NOREPLY(!sync));
177 req->l2t_idx = htons(idx);
178 req->vlan = htons(e->vlan);
179 memcpy(req->dst_mac, e->dmac, sizeof(req->dst_mac));
181 commit_wrq_wr(wrq, req, &cookie);
183 if (sync && e->state != L2T_STATE_SWITCHING)
184 e->state = L2T_STATE_SYNC_WRITE;
190 * Allocate an L2T entry for use by a switching rule. Such need to be
191 * explicitly freed and while busy they are not on any hash chain, so normal
192 * address resolution updates do not see them.
195 t4_l2t_alloc_switching(struct adapter *sc, uint16_t vlan, uint8_t port,
198 struct l2t_data *d = sc->l2t;
203 e = find_or_alloc_l2e(d, vlan, port, eth_addr);
205 if (atomic_load_acq_int(&e->refcnt) == 0) {
206 mtx_lock(&e->lock); /* avoid race with t4_l2t_free */
207 e->wrq = &sc->sge.ctrlq[0];
208 e->iqid = sc->sge.fwq.abs_id;
209 e->state = L2T_STATE_SWITCHING;
212 memcpy(e->dmac, eth_addr, ETHER_ADDR_LEN);
213 atomic_store_rel_int(&e->refcnt, 1);
214 atomic_subtract_int(&d->nfree, 1);
215 rc = t4_write_l2e(e, 0);
216 mtx_unlock(&e->lock);
220 MPASS(e->vlan == vlan);
221 MPASS(e->lport == port);
222 atomic_add_int(&e->refcnt, 1);
225 rw_wunlock(&d->lock);
230 t4_init_l2t(struct adapter *sc, int flags)
235 l2t_size = sc->vres.l2t.size;
236 if (l2t_size < 2) /* At least 1 bucket for IP and 1 for IPv6 */
239 d = malloc(sizeof(*d) + l2t_size * sizeof (struct l2t_entry), M_CXGBE,
244 d->l2t_size = l2t_size;
246 atomic_store_rel_int(&d->nfree, l2t_size);
247 rw_init(&d->lock, "L2T");
249 for (i = 0; i < l2t_size; i++) {
250 struct l2t_entry *e = &d->l2tab[i];
253 e->state = L2T_STATE_UNUSED;
254 mtx_init(&e->lock, "L2T_E", NULL, MTX_DEF);
255 STAILQ_INIT(&e->wr_list);
256 atomic_store_rel_int(&e->refcnt, 0);
265 t4_free_l2t(struct l2t_data *d)
269 for (i = 0; i < d->l2t_size; i++)
270 mtx_destroy(&d->l2tab[i].lock);
271 rw_destroy(&d->lock);
278 do_l2t_write_rpl(struct sge_iq *iq, const struct rss_header *rss,
281 const struct cpl_l2t_write_rpl *rpl = (const void *)(rss + 1);
282 unsigned int tid = GET_TID(rpl);
283 unsigned int idx = tid % L2T_SIZE;
285 if (__predict_false(rpl->status != CPL_ERR_NONE)) {
287 "Unexpected L2T_WRITE_RPL (%u) for entry at hw_idx %u\n",
295 static inline unsigned int
296 vlan_prio(const struct l2t_entry *e)
298 return e->vlan >> 13;
302 l2e_state(const struct l2t_entry *e)
305 case L2T_STATE_VALID: return 'V'; /* valid, fast-path entry */
306 case L2T_STATE_STALE: return 'S'; /* needs revalidation, but usable */
307 case L2T_STATE_SYNC_WRITE: return 'W';
308 case L2T_STATE_RESOLVING: return STAILQ_EMPTY(&e->wr_list) ? 'R' : 'A';
309 case L2T_STATE_SWITCHING: return 'X';
315 sysctl_l2t(SYSCTL_HANDLER_ARGS)
317 struct adapter *sc = arg1;
318 struct l2t_data *l2t = sc->l2t;
321 int rc, i, header = 0;
322 char ip[INET6_ADDRSTRLEN];
327 rc = sysctl_wire_old_buffer(req, 0);
331 sb = sbuf_new_for_sysctl(NULL, NULL, 4096, req);
336 for (i = 0; i < l2t->l2t_size; i++, e++) {
338 if (e->state == L2T_STATE_UNUSED)
342 sbuf_printf(sb, " Idx IP address "
343 "Ethernet address VLAN/P LP State Users Port");
346 if (e->state == L2T_STATE_SWITCHING)
349 inet_ntop(e->ipv6 ? AF_INET6 : AF_INET, &e->addr[0],
354 * XXX: IPv6 addresses may not align properly in the output.
356 sbuf_printf(sb, "\n%4u %-15s %02x:%02x:%02x:%02x:%02x:%02x %4d"
358 e->idx, ip, e->dmac[0], e->dmac[1], e->dmac[2],
359 e->dmac[3], e->dmac[4], e->dmac[5],
360 e->vlan & 0xfff, vlan_prio(e), e->lport,
361 l2e_state(e), atomic_load_acq_int(&e->refcnt),
362 e->ifp ? e->ifp->if_xname : "-");
364 mtx_unlock(&e->lock);
367 rc = sbuf_finish(sb);