cxgb4/l2t: Mark expected switch fall-through
[linux/fpc-iii.git] / drivers / net / ethernet / chelsio / cxgb4 / l2t.c
blob301c4df8a56646adb094e49b977e7bd5b0bcba56
1 /*
2 * This file is part of the Chelsio T4 Ethernet driver for Linux.
4 * Copyright (c) 2003-2014 Chelsio Communications, Inc. All rights reserved.
6 * This software is available to you under a choice of one of two
7 * licenses. You may choose to be licensed under the terms of the GNU
8 * General Public License (GPL) Version 2, available from the file
9 * COPYING in the main directory of this source tree, or the
10 * OpenIB.org BSD license below:
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
14 * conditions are met:
16 * - Redistributions of source code must retain the above
17 * copyright notice, this list of conditions and the following
18 * disclaimer.
20 * - Redistributions in binary form must reproduce the above
21 * copyright notice, this list of conditions and the following
22 * disclaimer in the documentation and/or other materials
23 * provided with the distribution.
25 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
26 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
27 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
28 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
29 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
30 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
31 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
32 * SOFTWARE.
35 #include <linux/skbuff.h>
36 #include <linux/netdevice.h>
37 #include <linux/if.h>
38 #include <linux/if_vlan.h>
39 #include <linux/jhash.h>
40 #include <linux/module.h>
41 #include <linux/debugfs.h>
42 #include <linux/seq_file.h>
43 #include <net/neighbour.h>
44 #include "cxgb4.h"
45 #include "l2t.h"
46 #include "t4_msg.h"
47 #include "t4fw_api.h"
48 #include "t4_regs.h"
49 #include "t4_values.h"
51 /* identifies sync vs async L2T_WRITE_REQs */
52 #define SYNC_WR_S 12
53 #define SYNC_WR_V(x) ((x) << SYNC_WR_S)
54 #define SYNC_WR_F SYNC_WR_V(1)
56 struct l2t_data {
57 unsigned int l2t_start; /* start index of our piece of the L2T */
58 unsigned int l2t_size; /* number of entries in l2tab */
59 rwlock_t lock;
60 atomic_t nfree; /* number of free entries */
61 struct l2t_entry *rover; /* starting point for next allocation */
62 struct l2t_entry l2tab[0]; /* MUST BE LAST */
65 static inline unsigned int vlan_prio(const struct l2t_entry *e)
67 return e->vlan >> VLAN_PRIO_SHIFT;
70 static inline void l2t_hold(struct l2t_data *d, struct l2t_entry *e)
72 if (atomic_add_return(1, &e->refcnt) == 1) /* 0 -> 1 transition */
73 atomic_dec(&d->nfree);
77 * To avoid having to check address families we do not allow v4 and v6
78 * neighbors to be on the same hash chain. We keep v4 entries in the first
79 * half of available hash buckets and v6 in the second. We need at least two
80 * entries in our L2T for this scheme to work.
82 enum {
83 L2T_MIN_HASH_BUCKETS = 2,
86 static inline unsigned int arp_hash(struct l2t_data *d, const u32 *key,
87 int ifindex)
89 unsigned int l2t_size_half = d->l2t_size / 2;
91 return jhash_2words(*key, ifindex, 0) % l2t_size_half;
94 static inline unsigned int ipv6_hash(struct l2t_data *d, const u32 *key,
95 int ifindex)
97 unsigned int l2t_size_half = d->l2t_size / 2;
98 u32 xor = key[0] ^ key[1] ^ key[2] ^ key[3];
100 return (l2t_size_half +
101 (jhash_2words(xor, ifindex, 0) % l2t_size_half));
104 static unsigned int addr_hash(struct l2t_data *d, const u32 *addr,
105 int addr_len, int ifindex)
107 return addr_len == 4 ? arp_hash(d, addr, ifindex) :
108 ipv6_hash(d, addr, ifindex);
112 * Checks if an L2T entry is for the given IP/IPv6 address. It does not check
113 * whether the L2T entry and the address are of the same address family.
114 * Callers ensure an address is only checked against L2T entries of the same
115 * family, something made trivial by the separation of IP and IPv6 hash chains
116 * mentioned above. Returns 0 if there's a match,
118 static int addreq(const struct l2t_entry *e, const u32 *addr)
120 if (e->v6)
121 return (e->addr[0] ^ addr[0]) | (e->addr[1] ^ addr[1]) |
122 (e->addr[2] ^ addr[2]) | (e->addr[3] ^ addr[3]);
123 return e->addr[0] ^ addr[0];
126 static void neigh_replace(struct l2t_entry *e, struct neighbour *n)
128 neigh_hold(n);
129 if (e->neigh)
130 neigh_release(e->neigh);
131 e->neigh = n;
135 * Write an L2T entry. Must be called with the entry locked.
136 * The write may be synchronous or asynchronous.
138 static int write_l2e(struct adapter *adap, struct l2t_entry *e, int sync)
140 struct l2t_data *d = adap->l2t;
141 unsigned int l2t_idx = e->idx + d->l2t_start;
142 struct sk_buff *skb;
143 struct cpl_l2t_write_req *req;
145 skb = alloc_skb(sizeof(*req), GFP_ATOMIC);
146 if (!skb)
147 return -ENOMEM;
149 req = __skb_put(skb, sizeof(*req));
150 INIT_TP_WR(req, 0);
152 OPCODE_TID(req) = htonl(MK_OPCODE_TID(CPL_L2T_WRITE_REQ,
153 l2t_idx | (sync ? SYNC_WR_F : 0) |
154 TID_QID_V(adap->sge.fw_evtq.abs_id)));
155 req->params = htons(L2T_W_PORT_V(e->lport) | L2T_W_NOREPLY_V(!sync));
156 req->l2t_idx = htons(l2t_idx);
157 req->vlan = htons(e->vlan);
158 if (e->neigh && !(e->neigh->dev->flags & IFF_LOOPBACK))
159 memcpy(e->dmac, e->neigh->ha, sizeof(e->dmac));
160 memcpy(req->dst_mac, e->dmac, sizeof(req->dst_mac));
162 t4_mgmt_tx(adap, skb);
164 if (sync && e->state != L2T_STATE_SWITCHING)
165 e->state = L2T_STATE_SYNC_WRITE;
166 return 0;
170 * Send packets waiting in an L2T entry's ARP queue. Must be called with the
171 * entry locked.
173 static void send_pending(struct adapter *adap, struct l2t_entry *e)
175 struct sk_buff *skb;
177 while ((skb = __skb_dequeue(&e->arpq)) != NULL)
178 t4_ofld_send(adap, skb);
182 * Process a CPL_L2T_WRITE_RPL. Wake up the ARP queue if it completes a
183 * synchronous L2T_WRITE. Note that the TID in the reply is really the L2T
184 * index it refers to.
186 void do_l2t_write_rpl(struct adapter *adap, const struct cpl_l2t_write_rpl *rpl)
188 struct l2t_data *d = adap->l2t;
189 unsigned int tid = GET_TID(rpl);
190 unsigned int l2t_idx = tid % L2T_SIZE;
192 if (unlikely(rpl->status != CPL_ERR_NONE)) {
193 dev_err(adap->pdev_dev,
194 "Unexpected L2T_WRITE_RPL status %u for entry %u\n",
195 rpl->status, l2t_idx);
196 return;
199 if (tid & SYNC_WR_F) {
200 struct l2t_entry *e = &d->l2tab[l2t_idx - d->l2t_start];
202 spin_lock(&e->lock);
203 if (e->state != L2T_STATE_SWITCHING) {
204 send_pending(adap, e);
205 e->state = (e->neigh->nud_state & NUD_STALE) ?
206 L2T_STATE_STALE : L2T_STATE_VALID;
208 spin_unlock(&e->lock);
213 * Add a packet to an L2T entry's queue of packets awaiting resolution.
214 * Must be called with the entry's lock held.
216 static inline void arpq_enqueue(struct l2t_entry *e, struct sk_buff *skb)
218 __skb_queue_tail(&e->arpq, skb);
221 int cxgb4_l2t_send(struct net_device *dev, struct sk_buff *skb,
222 struct l2t_entry *e)
224 struct adapter *adap = netdev2adap(dev);
226 again:
227 switch (e->state) {
228 case L2T_STATE_STALE: /* entry is stale, kick off revalidation */
229 neigh_event_send(e->neigh, NULL);
230 spin_lock_bh(&e->lock);
231 if (e->state == L2T_STATE_STALE)
232 e->state = L2T_STATE_VALID;
233 spin_unlock_bh(&e->lock);
234 /* fall through */
235 case L2T_STATE_VALID: /* fast-path, send the packet on */
236 return t4_ofld_send(adap, skb);
237 case L2T_STATE_RESOLVING:
238 case L2T_STATE_SYNC_WRITE:
239 spin_lock_bh(&e->lock);
240 if (e->state != L2T_STATE_SYNC_WRITE &&
241 e->state != L2T_STATE_RESOLVING) {
242 spin_unlock_bh(&e->lock);
243 goto again;
245 arpq_enqueue(e, skb);
246 spin_unlock_bh(&e->lock);
248 if (e->state == L2T_STATE_RESOLVING &&
249 !neigh_event_send(e->neigh, NULL)) {
250 spin_lock_bh(&e->lock);
251 if (e->state == L2T_STATE_RESOLVING &&
252 !skb_queue_empty(&e->arpq))
253 write_l2e(adap, e, 1);
254 spin_unlock_bh(&e->lock);
257 return 0;
259 EXPORT_SYMBOL(cxgb4_l2t_send);
262 * Allocate a free L2T entry. Must be called with l2t_data.lock held.
264 static struct l2t_entry *alloc_l2e(struct l2t_data *d)
266 struct l2t_entry *end, *e, **p;
268 if (!atomic_read(&d->nfree))
269 return NULL;
271 /* there's definitely a free entry */
272 for (e = d->rover, end = &d->l2tab[d->l2t_size]; e != end; ++e)
273 if (atomic_read(&e->refcnt) == 0)
274 goto found;
276 for (e = d->l2tab; atomic_read(&e->refcnt); ++e)
278 found:
279 d->rover = e + 1;
280 atomic_dec(&d->nfree);
283 * The entry we found may be an inactive entry that is
284 * presently in the hash table. We need to remove it.
286 if (e->state < L2T_STATE_SWITCHING)
287 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
288 if (*p == e) {
289 *p = e->next;
290 e->next = NULL;
291 break;
294 e->state = L2T_STATE_UNUSED;
295 return e;
298 static struct l2t_entry *find_or_alloc_l2e(struct l2t_data *d, u16 vlan,
299 u8 port, u8 *dmac)
301 struct l2t_entry *end, *e, **p;
302 struct l2t_entry *first_free = NULL;
304 for (e = &d->l2tab[0], end = &d->l2tab[d->l2t_size]; e != end; ++e) {
305 if (atomic_read(&e->refcnt) == 0) {
306 if (!first_free)
307 first_free = e;
308 } else {
309 if (e->state == L2T_STATE_SWITCHING) {
310 if (ether_addr_equal(e->dmac, dmac) &&
311 (e->vlan == vlan) && (e->lport == port))
312 goto exists;
317 if (first_free) {
318 e = first_free;
319 goto found;
322 return NULL;
324 found:
325 /* The entry we found may be an inactive entry that is
326 * presently in the hash table. We need to remove it.
328 if (e->state < L2T_STATE_SWITCHING)
329 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
330 if (*p == e) {
331 *p = e->next;
332 e->next = NULL;
333 break;
335 e->state = L2T_STATE_UNUSED;
337 exists:
338 return e;
341 /* Called when an L2T entry has no more users. The entry is left in the hash
342 * table since it is likely to be reused but we also bump nfree to indicate
343 * that the entry can be reallocated for a different neighbor. We also drop
344 * the existing neighbor reference in case the neighbor is going away and is
345 * waiting on our reference.
347 * Because entries can be reallocated to other neighbors once their ref count
348 * drops to 0 we need to take the entry's lock to avoid races with a new
349 * incarnation.
351 static void _t4_l2e_free(struct l2t_entry *e)
353 struct l2t_data *d;
354 struct sk_buff *skb;
356 if (atomic_read(&e->refcnt) == 0) { /* hasn't been recycled */
357 if (e->neigh) {
358 neigh_release(e->neigh);
359 e->neigh = NULL;
361 while ((skb = __skb_dequeue(&e->arpq)) != NULL)
362 kfree_skb(skb);
365 d = container_of(e, struct l2t_data, l2tab[e->idx]);
366 atomic_inc(&d->nfree);
369 /* Locked version of _t4_l2e_free */
370 static void t4_l2e_free(struct l2t_entry *e)
372 struct l2t_data *d;
373 struct sk_buff *skb;
375 spin_lock_bh(&e->lock);
376 if (atomic_read(&e->refcnt) == 0) { /* hasn't been recycled */
377 if (e->neigh) {
378 neigh_release(e->neigh);
379 e->neigh = NULL;
381 while ((skb = __skb_dequeue(&e->arpq)) != NULL)
382 kfree_skb(skb);
384 spin_unlock_bh(&e->lock);
386 d = container_of(e, struct l2t_data, l2tab[e->idx]);
387 atomic_inc(&d->nfree);
390 void cxgb4_l2t_release(struct l2t_entry *e)
392 if (atomic_dec_and_test(&e->refcnt))
393 t4_l2e_free(e);
395 EXPORT_SYMBOL(cxgb4_l2t_release);
398 * Update an L2T entry that was previously used for the same next hop as neigh.
399 * Must be called with softirqs disabled.
401 static void reuse_entry(struct l2t_entry *e, struct neighbour *neigh)
403 unsigned int nud_state;
405 spin_lock(&e->lock); /* avoid race with t4_l2t_free */
406 if (neigh != e->neigh)
407 neigh_replace(e, neigh);
408 nud_state = neigh->nud_state;
409 if (memcmp(e->dmac, neigh->ha, sizeof(e->dmac)) ||
410 !(nud_state & NUD_VALID))
411 e->state = L2T_STATE_RESOLVING;
412 else if (nud_state & NUD_CONNECTED)
413 e->state = L2T_STATE_VALID;
414 else
415 e->state = L2T_STATE_STALE;
416 spin_unlock(&e->lock);
419 struct l2t_entry *cxgb4_l2t_get(struct l2t_data *d, struct neighbour *neigh,
420 const struct net_device *physdev,
421 unsigned int priority)
423 u8 lport;
424 u16 vlan;
425 struct l2t_entry *e;
426 unsigned int addr_len = neigh->tbl->key_len;
427 u32 *addr = (u32 *)neigh->primary_key;
428 int ifidx = neigh->dev->ifindex;
429 int hash = addr_hash(d, addr, addr_len, ifidx);
431 if (neigh->dev->flags & IFF_LOOPBACK)
432 lport = netdev2pinfo(physdev)->tx_chan + 4;
433 else
434 lport = netdev2pinfo(physdev)->lport;
436 if (is_vlan_dev(neigh->dev))
437 vlan = vlan_dev_vlan_id(neigh->dev);
438 else
439 vlan = VLAN_NONE;
441 write_lock_bh(&d->lock);
442 for (e = d->l2tab[hash].first; e; e = e->next)
443 if (!addreq(e, addr) && e->ifindex == ifidx &&
444 e->vlan == vlan && e->lport == lport) {
445 l2t_hold(d, e);
446 if (atomic_read(&e->refcnt) == 1)
447 reuse_entry(e, neigh);
448 goto done;
451 /* Need to allocate a new entry */
452 e = alloc_l2e(d);
453 if (e) {
454 spin_lock(&e->lock); /* avoid race with t4_l2t_free */
455 e->state = L2T_STATE_RESOLVING;
456 if (neigh->dev->flags & IFF_LOOPBACK)
457 memcpy(e->dmac, physdev->dev_addr, sizeof(e->dmac));
458 memcpy(e->addr, addr, addr_len);
459 e->ifindex = ifidx;
460 e->hash = hash;
461 e->lport = lport;
462 e->v6 = addr_len == 16;
463 atomic_set(&e->refcnt, 1);
464 neigh_replace(e, neigh);
465 e->vlan = vlan;
466 e->next = d->l2tab[hash].first;
467 d->l2tab[hash].first = e;
468 spin_unlock(&e->lock);
470 done:
471 write_unlock_bh(&d->lock);
472 return e;
474 EXPORT_SYMBOL(cxgb4_l2t_get);
476 u64 cxgb4_select_ntuple(struct net_device *dev,
477 const struct l2t_entry *l2t)
479 struct adapter *adap = netdev2adap(dev);
480 struct tp_params *tp = &adap->params.tp;
481 u64 ntuple = 0;
483 /* Initialize each of the fields which we care about which are present
484 * in the Compressed Filter Tuple.
486 if (tp->vlan_shift >= 0 && l2t->vlan != VLAN_NONE)
487 ntuple |= (u64)(FT_VLAN_VLD_F | l2t->vlan) << tp->vlan_shift;
489 if (tp->port_shift >= 0)
490 ntuple |= (u64)l2t->lport << tp->port_shift;
492 if (tp->protocol_shift >= 0)
493 ntuple |= (u64)IPPROTO_TCP << tp->protocol_shift;
495 if (tp->vnic_shift >= 0 && (tp->ingress_config & VNIC_F)) {
496 u32 viid = cxgb4_port_viid(dev);
497 u32 vf = FW_VIID_VIN_G(viid);
498 u32 pf = FW_VIID_PFN_G(viid);
499 u32 vld = FW_VIID_VIVLD_G(viid);
501 ntuple |= (u64)(FT_VNID_ID_VF_V(vf) |
502 FT_VNID_ID_PF_V(pf) |
503 FT_VNID_ID_VLD_V(vld)) << tp->vnic_shift;
506 return ntuple;
508 EXPORT_SYMBOL(cxgb4_select_ntuple);
511 * Called when address resolution fails for an L2T entry to handle packets
512 * on the arpq head. If a packet specifies a failure handler it is invoked,
513 * otherwise the packet is sent to the device.
515 static void handle_failed_resolution(struct adapter *adap, struct l2t_entry *e)
517 struct sk_buff *skb;
519 while ((skb = __skb_dequeue(&e->arpq)) != NULL) {
520 const struct l2t_skb_cb *cb = L2T_SKB_CB(skb);
522 spin_unlock(&e->lock);
523 if (cb->arp_err_handler)
524 cb->arp_err_handler(cb->handle, skb);
525 else
526 t4_ofld_send(adap, skb);
527 spin_lock(&e->lock);
532 * Called when the host's neighbor layer makes a change to some entry that is
533 * loaded into the HW L2 table.
535 void t4_l2t_update(struct adapter *adap, struct neighbour *neigh)
537 struct l2t_entry *e;
538 struct sk_buff_head *arpq = NULL;
539 struct l2t_data *d = adap->l2t;
540 unsigned int addr_len = neigh->tbl->key_len;
541 u32 *addr = (u32 *) neigh->primary_key;
542 int ifidx = neigh->dev->ifindex;
543 int hash = addr_hash(d, addr, addr_len, ifidx);
545 read_lock_bh(&d->lock);
546 for (e = d->l2tab[hash].first; e; e = e->next)
547 if (!addreq(e, addr) && e->ifindex == ifidx) {
548 spin_lock(&e->lock);
549 if (atomic_read(&e->refcnt))
550 goto found;
551 spin_unlock(&e->lock);
552 break;
554 read_unlock_bh(&d->lock);
555 return;
557 found:
558 read_unlock(&d->lock);
560 if (neigh != e->neigh)
561 neigh_replace(e, neigh);
563 if (e->state == L2T_STATE_RESOLVING) {
564 if (neigh->nud_state & NUD_FAILED) {
565 arpq = &e->arpq;
566 } else if ((neigh->nud_state & (NUD_CONNECTED | NUD_STALE)) &&
567 !skb_queue_empty(&e->arpq)) {
568 write_l2e(adap, e, 1);
570 } else {
571 e->state = neigh->nud_state & NUD_CONNECTED ?
572 L2T_STATE_VALID : L2T_STATE_STALE;
573 if (memcmp(e->dmac, neigh->ha, sizeof(e->dmac)))
574 write_l2e(adap, e, 0);
577 if (arpq)
578 handle_failed_resolution(adap, e);
579 spin_unlock_bh(&e->lock);
582 /* Allocate an L2T entry for use by a switching rule. Such need to be
583 * explicitly freed and while busy they are not on any hash chain, so normal
584 * address resolution updates do not see them.
586 struct l2t_entry *t4_l2t_alloc_switching(struct adapter *adap, u16 vlan,
587 u8 port, u8 *eth_addr)
589 struct l2t_data *d = adap->l2t;
590 struct l2t_entry *e;
591 int ret;
593 write_lock_bh(&d->lock);
594 e = find_or_alloc_l2e(d, vlan, port, eth_addr);
595 if (e) {
596 spin_lock(&e->lock); /* avoid race with t4_l2t_free */
597 if (!atomic_read(&e->refcnt)) {
598 e->state = L2T_STATE_SWITCHING;
599 e->vlan = vlan;
600 e->lport = port;
601 ether_addr_copy(e->dmac, eth_addr);
602 atomic_set(&e->refcnt, 1);
603 ret = write_l2e(adap, e, 0);
604 if (ret < 0) {
605 _t4_l2e_free(e);
606 spin_unlock(&e->lock);
607 write_unlock_bh(&d->lock);
608 return NULL;
610 } else {
611 atomic_inc(&e->refcnt);
614 spin_unlock(&e->lock);
616 write_unlock_bh(&d->lock);
617 return e;
621 * @dev: net_device pointer
622 * @vlan: VLAN Id
623 * @port: Associated port
624 * @dmac: Destination MAC address to add to L2T
625 * Returns pointer to the allocated l2t entry
627 * Allocates an L2T entry for use by switching rule of a filter
629 struct l2t_entry *cxgb4_l2t_alloc_switching(struct net_device *dev, u16 vlan,
630 u8 port, u8 *dmac)
632 struct adapter *adap = netdev2adap(dev);
634 return t4_l2t_alloc_switching(adap, vlan, port, dmac);
636 EXPORT_SYMBOL(cxgb4_l2t_alloc_switching);
638 struct l2t_data *t4_init_l2t(unsigned int l2t_start, unsigned int l2t_end)
640 unsigned int l2t_size;
641 int i;
642 struct l2t_data *d;
644 if (l2t_start >= l2t_end || l2t_end >= L2T_SIZE)
645 return NULL;
646 l2t_size = l2t_end - l2t_start + 1;
647 if (l2t_size < L2T_MIN_HASH_BUCKETS)
648 return NULL;
650 d = kvzalloc(sizeof(*d) + l2t_size * sizeof(struct l2t_entry), GFP_KERNEL);
651 if (!d)
652 return NULL;
654 d->l2t_start = l2t_start;
655 d->l2t_size = l2t_size;
657 d->rover = d->l2tab;
658 atomic_set(&d->nfree, l2t_size);
659 rwlock_init(&d->lock);
661 for (i = 0; i < d->l2t_size; ++i) {
662 d->l2tab[i].idx = i;
663 d->l2tab[i].state = L2T_STATE_UNUSED;
664 spin_lock_init(&d->l2tab[i].lock);
665 atomic_set(&d->l2tab[i].refcnt, 0);
666 skb_queue_head_init(&d->l2tab[i].arpq);
668 return d;
671 static inline void *l2t_get_idx(struct seq_file *seq, loff_t pos)
673 struct l2t_data *d = seq->private;
675 return pos >= d->l2t_size ? NULL : &d->l2tab[pos];
678 static void *l2t_seq_start(struct seq_file *seq, loff_t *pos)
680 return *pos ? l2t_get_idx(seq, *pos - 1) : SEQ_START_TOKEN;
683 static void *l2t_seq_next(struct seq_file *seq, void *v, loff_t *pos)
685 v = l2t_get_idx(seq, *pos);
686 if (v)
687 ++*pos;
688 return v;
691 static void l2t_seq_stop(struct seq_file *seq, void *v)
695 static char l2e_state(const struct l2t_entry *e)
697 switch (e->state) {
698 case L2T_STATE_VALID: return 'V';
699 case L2T_STATE_STALE: return 'S';
700 case L2T_STATE_SYNC_WRITE: return 'W';
701 case L2T_STATE_RESOLVING:
702 return skb_queue_empty(&e->arpq) ? 'R' : 'A';
703 case L2T_STATE_SWITCHING: return 'X';
704 default:
705 return 'U';
709 static int l2t_seq_show(struct seq_file *seq, void *v)
711 if (v == SEQ_START_TOKEN)
712 seq_puts(seq, " Idx IP address "
713 "Ethernet address VLAN/P LP State Users Port\n");
714 else {
715 char ip[60];
716 struct l2t_data *d = seq->private;
717 struct l2t_entry *e = v;
719 spin_lock_bh(&e->lock);
720 if (e->state == L2T_STATE_SWITCHING)
721 ip[0] = '\0';
722 else
723 sprintf(ip, e->v6 ? "%pI6c" : "%pI4", e->addr);
724 seq_printf(seq, "%4u %-25s %17pM %4d %u %2u %c %5u %s\n",
725 e->idx + d->l2t_start, ip, e->dmac,
726 e->vlan & VLAN_VID_MASK, vlan_prio(e), e->lport,
727 l2e_state(e), atomic_read(&e->refcnt),
728 e->neigh ? e->neigh->dev->name : "");
729 spin_unlock_bh(&e->lock);
731 return 0;
734 static const struct seq_operations l2t_seq_ops = {
735 .start = l2t_seq_start,
736 .next = l2t_seq_next,
737 .stop = l2t_seq_stop,
738 .show = l2t_seq_show
741 static int l2t_seq_open(struct inode *inode, struct file *file)
743 int rc = seq_open(file, &l2t_seq_ops);
745 if (!rc) {
746 struct adapter *adap = inode->i_private;
747 struct seq_file *seq = file->private_data;
749 seq->private = adap->l2t;
751 return rc;
754 const struct file_operations t4_l2t_fops = {
755 .owner = THIS_MODULE,
756 .open = l2t_seq_open,
757 .read = seq_read,
758 .llseek = seq_lseek,
759 .release = seq_release,