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
16 * - Redistributions of source code must retain the above
17 * copyright notice, this list of conditions and the following
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
35 #include <linux/skbuff.h>
36 #include <linux/netdevice.h>
37 #include <linux/etherdevice.h>
38 #include <linux/if_vlan.h>
40 #include <linux/dma-mapping.h>
41 #include <linux/jiffies.h>
42 #include <linux/prefetch.h>
43 #include <linux/export.h>
52 * Rx buffer size. We use largish buffers if possible but settle for single
53 * pages under memory shortage.
56 # define FL_PG_ORDER 0
58 # define FL_PG_ORDER (16 - PAGE_SHIFT)
61 /* RX_PULL_LEN should be <= RX_COPY_THRES */
62 #define RX_COPY_THRES 256
63 #define RX_PULL_LEN 128
66 * Main body length for sk_buffs used for Rx Ethernet packets with fragments.
67 * Should be >= RX_PULL_LEN but possibly bigger to give pskb_may_pull some room.
69 #define RX_PKT_SKB_LEN 512
72 * Max number of Tx descriptors we clean up at a time. Should be modest as
73 * freeing skbs isn't cheap and it happens while holding locks. We just need
74 * to free packets faster than they arrive, we eventually catch up and keep
75 * the amortized cost reasonable. Must be >= 2 * TXQ_STOP_THRES.
77 #define MAX_TX_RECLAIM 16
80 * Max number of Rx buffers we replenish at a time. Again keep this modest,
81 * allocating buffers isn't cheap either.
83 #define MAX_RX_REFILL 16U
86 * Period of the Rx queue check timer. This timer is infrequent as it has
87 * something to do only when the system experiences severe memory shortage.
89 #define RX_QCHECK_PERIOD (HZ / 2)
92 * Period of the Tx queue check timer.
94 #define TX_QCHECK_PERIOD (HZ / 2)
96 /* SGE Hung Ingress DMA Threshold Warning time (in Hz) and Warning Repeat Rate
97 * (in RX_QCHECK_PERIOD multiples). If we find one of the SGE Ingress DMA
98 * State Machines in the same state for this amount of time (in HZ) then we'll
99 * issue a warning about a potential hang. We'll repeat the warning as the
100 * SGE Ingress DMA Channel appears to be hung every N RX_QCHECK_PERIODs till
101 * the situation clears. If the situation clears, we'll note that as well.
103 #define SGE_IDMA_WARN_THRESH (1 * HZ)
104 #define SGE_IDMA_WARN_REPEAT (20 * RX_QCHECK_PERIOD)
107 * Max number of Tx descriptors to be reclaimed by the Tx timer.
109 #define MAX_TIMER_TX_RECLAIM 100
112 * Timer index used when backing off due to memory shortage.
114 #define NOMEM_TMR_IDX (SGE_NTIMERS - 1)
117 * An FL with <= FL_STARVE_THRES buffers is starving and a periodic timer will
118 * attempt to refill it.
120 #define FL_STARVE_THRES 4
123 * Suspend an Ethernet Tx queue with fewer available descriptors than this.
124 * This is the same as calc_tx_descs() for a TSO packet with
125 * nr_frags == MAX_SKB_FRAGS.
127 #define ETHTXQ_STOP_THRES \
128 (1 + DIV_ROUND_UP((3 * MAX_SKB_FRAGS) / 2 + (MAX_SKB_FRAGS & 1), 8))
131 * Suspension threshold for non-Ethernet Tx queues. We require enough room
132 * for a full sized WR.
134 #define TXQ_STOP_THRES (SGE_MAX_WR_LEN / sizeof(struct tx_desc))
137 * Max Tx descriptor space we allow for an Ethernet packet to be inlined
140 #define MAX_IMM_TX_PKT_LEN 128
143 * Max size of a WR sent through a control Tx queue.
145 #define MAX_CTRL_WR_LEN SGE_MAX_WR_LEN
147 struct tx_sw_desc { /* SW state per Tx descriptor */
149 struct ulptx_sgl *sgl;
152 struct rx_sw_desc { /* SW state per Rx descriptor */
158 * Rx buffer sizes for "useskbs" Free List buffers (one ingress packet pe skb
159 * buffer). We currently only support two sizes for 1500- and 9000-byte MTUs.
160 * We could easily support more but there doesn't seem to be much need for
163 #define FL_MTU_SMALL 1500
164 #define FL_MTU_LARGE 9000
166 static inline unsigned int fl_mtu_bufsize(struct adapter *adapter,
169 struct sge *s = &adapter->sge;
171 return ALIGN(s->pktshift + ETH_HLEN + VLAN_HLEN + mtu, s->fl_align);
174 #define FL_MTU_SMALL_BUFSIZE(adapter) fl_mtu_bufsize(adapter, FL_MTU_SMALL)
175 #define FL_MTU_LARGE_BUFSIZE(adapter) fl_mtu_bufsize(adapter, FL_MTU_LARGE)
178 * Bits 0..3 of rx_sw_desc.dma_addr have special meaning. The hardware uses
179 * these to specify the buffer size as an index into the SGE Free List Buffer
180 * Size register array. We also use bit 4, when the buffer has been unmapped
181 * for DMA, but this is of course never sent to the hardware and is only used
182 * to prevent double unmappings. All of the above requires that the Free List
183 * Buffers which we allocate have the bottom 5 bits free (0) -- i.e. are
184 * 32-byte or or a power of 2 greater in alignment. Since the SGE's minimal
185 * Free List Buffer alignment is 32 bytes, this works out for us ...
188 RX_BUF_FLAGS = 0x1f, /* bottom five bits are special */
189 RX_BUF_SIZE = 0x0f, /* bottom three bits are for buf sizes */
190 RX_UNMAPPED_BUF = 0x10, /* buffer is not mapped */
193 * XXX We shouldn't depend on being able to use these indices.
194 * XXX Especially when some other Master PF has initialized the
195 * XXX adapter or we use the Firmware Configuration File. We
196 * XXX should really search through the Host Buffer Size register
197 * XXX array for the appropriately sized buffer indices.
199 RX_SMALL_PG_BUF = 0x0, /* small (PAGE_SIZE) page buffer */
200 RX_LARGE_PG_BUF = 0x1, /* buffer large (FL_PG_ORDER) page buffer */
202 RX_SMALL_MTU_BUF = 0x2, /* small MTU buffer */
203 RX_LARGE_MTU_BUF = 0x3, /* large MTU buffer */
206 static int timer_pkt_quota[] = {1, 1, 2, 3, 4, 5};
207 #define MIN_NAPI_WORK 1
209 static inline dma_addr_t get_buf_addr(const struct rx_sw_desc *d)
211 return d->dma_addr & ~(dma_addr_t)RX_BUF_FLAGS;
214 static inline bool is_buf_mapped(const struct rx_sw_desc *d)
216 return !(d->dma_addr & RX_UNMAPPED_BUF);
220 * txq_avail - return the number of available slots in a Tx queue
223 * Returns the number of descriptors in a Tx queue available to write new
226 static inline unsigned int txq_avail(const struct sge_txq *q)
228 return q->size - 1 - q->in_use;
232 * fl_cap - return the capacity of a free-buffer list
235 * Returns the capacity of a free-buffer list. The capacity is less than
236 * the size because one descriptor needs to be left unpopulated, otherwise
237 * HW will think the FL is empty.
239 static inline unsigned int fl_cap(const struct sge_fl *fl)
241 return fl->size - 8; /* 1 descriptor = 8 buffers */
244 static inline bool fl_starving(const struct sge_fl *fl)
246 return fl->avail - fl->pend_cred <= FL_STARVE_THRES;
249 static int map_skb(struct device *dev, const struct sk_buff *skb,
252 const skb_frag_t *fp, *end;
253 const struct skb_shared_info *si;
255 *addr = dma_map_single(dev, skb->data, skb_headlen(skb), DMA_TO_DEVICE);
256 if (dma_mapping_error(dev, *addr))
259 si = skb_shinfo(skb);
260 end = &si->frags[si->nr_frags];
262 for (fp = si->frags; fp < end; fp++) {
263 *++addr = skb_frag_dma_map(dev, fp, 0, skb_frag_size(fp),
265 if (dma_mapping_error(dev, *addr))
271 while (fp-- > si->frags)
272 dma_unmap_page(dev, *--addr, skb_frag_size(fp), DMA_TO_DEVICE);
274 dma_unmap_single(dev, addr[-1], skb_headlen(skb), DMA_TO_DEVICE);
279 #ifdef CONFIG_NEED_DMA_MAP_STATE
280 static void unmap_skb(struct device *dev, const struct sk_buff *skb,
281 const dma_addr_t *addr)
283 const skb_frag_t *fp, *end;
284 const struct skb_shared_info *si;
286 dma_unmap_single(dev, *addr++, skb_headlen(skb), DMA_TO_DEVICE);
288 si = skb_shinfo(skb);
289 end = &si->frags[si->nr_frags];
290 for (fp = si->frags; fp < end; fp++)
291 dma_unmap_page(dev, *addr++, skb_frag_size(fp), DMA_TO_DEVICE);
295 * deferred_unmap_destructor - unmap a packet when it is freed
298 * This is the packet destructor used for Tx packets that need to remain
299 * mapped until they are freed rather than until their Tx descriptors are
302 static void deferred_unmap_destructor(struct sk_buff *skb)
304 unmap_skb(skb->dev->dev.parent, skb, (dma_addr_t *)skb->head);
308 static void unmap_sgl(struct device *dev, const struct sk_buff *skb,
309 const struct ulptx_sgl *sgl, const struct sge_txq *q)
311 const struct ulptx_sge_pair *p;
312 unsigned int nfrags = skb_shinfo(skb)->nr_frags;
314 if (likely(skb_headlen(skb)))
315 dma_unmap_single(dev, be64_to_cpu(sgl->addr0), ntohl(sgl->len0),
318 dma_unmap_page(dev, be64_to_cpu(sgl->addr0), ntohl(sgl->len0),
324 * the complexity below is because of the possibility of a wrap-around
325 * in the middle of an SGL
327 for (p = sgl->sge; nfrags >= 2; nfrags -= 2) {
328 if (likely((u8 *)(p + 1) <= (u8 *)q->stat)) {
329 unmap: dma_unmap_page(dev, be64_to_cpu(p->addr[0]),
330 ntohl(p->len[0]), DMA_TO_DEVICE);
331 dma_unmap_page(dev, be64_to_cpu(p->addr[1]),
332 ntohl(p->len[1]), DMA_TO_DEVICE);
334 } else if ((u8 *)p == (u8 *)q->stat) {
335 p = (const struct ulptx_sge_pair *)q->desc;
337 } else if ((u8 *)p + 8 == (u8 *)q->stat) {
338 const __be64 *addr = (const __be64 *)q->desc;
340 dma_unmap_page(dev, be64_to_cpu(addr[0]),
341 ntohl(p->len[0]), DMA_TO_DEVICE);
342 dma_unmap_page(dev, be64_to_cpu(addr[1]),
343 ntohl(p->len[1]), DMA_TO_DEVICE);
344 p = (const struct ulptx_sge_pair *)&addr[2];
346 const __be64 *addr = (const __be64 *)q->desc;
348 dma_unmap_page(dev, be64_to_cpu(p->addr[0]),
349 ntohl(p->len[0]), DMA_TO_DEVICE);
350 dma_unmap_page(dev, be64_to_cpu(addr[0]),
351 ntohl(p->len[1]), DMA_TO_DEVICE);
352 p = (const struct ulptx_sge_pair *)&addr[1];
358 if ((u8 *)p == (u8 *)q->stat)
359 p = (const struct ulptx_sge_pair *)q->desc;
360 addr = (u8 *)p + 16 <= (u8 *)q->stat ? p->addr[0] :
361 *(const __be64 *)q->desc;
362 dma_unmap_page(dev, be64_to_cpu(addr), ntohl(p->len[0]),
368 * free_tx_desc - reclaims Tx descriptors and their buffers
369 * @adapter: the adapter
370 * @q: the Tx queue to reclaim descriptors from
371 * @n: the number of descriptors to reclaim
372 * @unmap: whether the buffers should be unmapped for DMA
374 * Reclaims Tx descriptors from an SGE Tx queue and frees the associated
375 * Tx buffers. Called with the Tx queue lock held.
377 static void free_tx_desc(struct adapter *adap, struct sge_txq *q,
378 unsigned int n, bool unmap)
380 struct tx_sw_desc *d;
381 unsigned int cidx = q->cidx;
382 struct device *dev = adap->pdev_dev;
386 if (d->skb) { /* an SGL is present */
388 unmap_sgl(dev, d->skb, d->sgl, q);
389 dev_consume_skb_any(d->skb);
393 if (++cidx == q->size) {
402 * Return the number of reclaimable descriptors in a Tx queue.
404 static inline int reclaimable(const struct sge_txq *q)
406 int hw_cidx = ntohs(q->stat->cidx);
408 return hw_cidx < 0 ? hw_cidx + q->size : hw_cidx;
412 * reclaim_completed_tx - reclaims completed Tx descriptors
414 * @q: the Tx queue to reclaim completed descriptors from
415 * @unmap: whether the buffers should be unmapped for DMA
417 * Reclaims Tx descriptors that the SGE has indicated it has processed,
418 * and frees the associated buffers if possible. Called with the Tx
421 static inline void reclaim_completed_tx(struct adapter *adap, struct sge_txq *q,
424 int avail = reclaimable(q);
428 * Limit the amount of clean up work we do at a time to keep
429 * the Tx lock hold time O(1).
431 if (avail > MAX_TX_RECLAIM)
432 avail = MAX_TX_RECLAIM;
434 free_tx_desc(adap, q, avail, unmap);
439 static inline int get_buf_size(struct adapter *adapter,
440 const struct rx_sw_desc *d)
442 struct sge *s = &adapter->sge;
443 unsigned int rx_buf_size_idx = d->dma_addr & RX_BUF_SIZE;
446 switch (rx_buf_size_idx) {
447 case RX_SMALL_PG_BUF:
448 buf_size = PAGE_SIZE;
451 case RX_LARGE_PG_BUF:
452 buf_size = PAGE_SIZE << s->fl_pg_order;
455 case RX_SMALL_MTU_BUF:
456 buf_size = FL_MTU_SMALL_BUFSIZE(adapter);
459 case RX_LARGE_MTU_BUF:
460 buf_size = FL_MTU_LARGE_BUFSIZE(adapter);
471 * free_rx_bufs - free the Rx buffers on an SGE free list
473 * @q: the SGE free list to free buffers from
474 * @n: how many buffers to free
476 * Release the next @n buffers on an SGE free-buffer Rx queue. The
477 * buffers must be made inaccessible to HW before calling this function.
479 static void free_rx_bufs(struct adapter *adap, struct sge_fl *q, int n)
482 struct rx_sw_desc *d = &q->sdesc[q->cidx];
484 if (is_buf_mapped(d))
485 dma_unmap_page(adap->pdev_dev, get_buf_addr(d),
486 get_buf_size(adap, d),
490 if (++q->cidx == q->size)
497 * unmap_rx_buf - unmap the current Rx buffer on an SGE free list
499 * @q: the SGE free list
501 * Unmap the current buffer on an SGE free-buffer Rx queue. The
502 * buffer must be made inaccessible to HW before calling this function.
504 * This is similar to @free_rx_bufs above but does not free the buffer.
505 * Do note that the FL still loses any further access to the buffer.
507 static void unmap_rx_buf(struct adapter *adap, struct sge_fl *q)
509 struct rx_sw_desc *d = &q->sdesc[q->cidx];
511 if (is_buf_mapped(d))
512 dma_unmap_page(adap->pdev_dev, get_buf_addr(d),
513 get_buf_size(adap, d), PCI_DMA_FROMDEVICE);
515 if (++q->cidx == q->size)
520 static inline void ring_fl_db(struct adapter *adap, struct sge_fl *q)
523 if (q->pend_cred >= 8) {
524 val = PIDX(q->pend_cred / 8);
525 if (!is_t4(adap->params.chip))
530 /* If we're on T4, use the old doorbell mechanism; otherwise
531 * use the new BAR2 mechanism.
533 if (is_t4(adap->params.chip)) {
534 t4_write_reg(adap, MYPF_REG(SGE_PF_KDOORBELL),
535 val | QID(q->cntxt_id));
537 writel(val, adap->bar2 + q->udb + SGE_UDB_KDOORBELL);
539 /* This Write memory Barrier will force the write to
540 * the User Doorbell area to be flushed.
548 static inline void set_rx_sw_desc(struct rx_sw_desc *sd, struct page *pg,
552 sd->dma_addr = mapping; /* includes size low bits */
556 * refill_fl - refill an SGE Rx buffer ring
558 * @q: the ring to refill
559 * @n: the number of new buffers to allocate
560 * @gfp: the gfp flags for the allocations
562 * (Re)populate an SGE free-buffer queue with up to @n new packet buffers,
563 * allocated with the supplied gfp flags. The caller must assure that
564 * @n does not exceed the queue's capacity. If afterwards the queue is
565 * found critically low mark it as starving in the bitmap of starving FLs.
567 * Returns the number of buffers allocated.
569 static unsigned int refill_fl(struct adapter *adap, struct sge_fl *q, int n,
572 struct sge *s = &adap->sge;
575 unsigned int cred = q->avail;
576 __be64 *d = &q->desc[q->pidx];
577 struct rx_sw_desc *sd = &q->sdesc[q->pidx];
579 gfp |= __GFP_NOWARN | __GFP_COLD;
581 if (s->fl_pg_order == 0)
582 goto alloc_small_pages;
585 * Prefer large buffers
588 pg = alloc_pages(gfp | __GFP_COMP, s->fl_pg_order);
590 q->large_alloc_failed++;
591 break; /* fall back to single pages */
594 mapping = dma_map_page(adap->pdev_dev, pg, 0,
595 PAGE_SIZE << s->fl_pg_order,
597 if (unlikely(dma_mapping_error(adap->pdev_dev, mapping))) {
598 __free_pages(pg, s->fl_pg_order);
599 goto out; /* do not try small pages for this error */
601 mapping |= RX_LARGE_PG_BUF;
602 *d++ = cpu_to_be64(mapping);
604 set_rx_sw_desc(sd, pg, mapping);
608 if (++q->pidx == q->size) {
618 pg = __skb_alloc_page(gfp, NULL);
624 mapping = dma_map_page(adap->pdev_dev, pg, 0, PAGE_SIZE,
626 if (unlikely(dma_mapping_error(adap->pdev_dev, mapping))) {
630 *d++ = cpu_to_be64(mapping);
632 set_rx_sw_desc(sd, pg, mapping);
636 if (++q->pidx == q->size) {
643 out: cred = q->avail - cred;
644 q->pend_cred += cred;
647 if (unlikely(fl_starving(q))) {
649 set_bit(q->cntxt_id - adap->sge.egr_start,
650 adap->sge.starving_fl);
656 static inline void __refill_fl(struct adapter *adap, struct sge_fl *fl)
658 refill_fl(adap, fl, min(MAX_RX_REFILL, fl_cap(fl) - fl->avail),
663 * alloc_ring - allocate resources for an SGE descriptor ring
664 * @dev: the PCI device's core device
665 * @nelem: the number of descriptors
666 * @elem_size: the size of each descriptor
667 * @sw_size: the size of the SW state associated with each ring element
668 * @phys: the physical address of the allocated ring
669 * @metadata: address of the array holding the SW state for the ring
670 * @stat_size: extra space in HW ring for status information
671 * @node: preferred node for memory allocations
673 * Allocates resources for an SGE descriptor ring, such as Tx queues,
674 * free buffer lists, or response queues. Each SGE ring requires
675 * space for its HW descriptors plus, optionally, space for the SW state
676 * associated with each HW entry (the metadata). The function returns
677 * three values: the virtual address for the HW ring (the return value
678 * of the function), the bus address of the HW ring, and the address
681 static void *alloc_ring(struct device *dev, size_t nelem, size_t elem_size,
682 size_t sw_size, dma_addr_t *phys, void *metadata,
683 size_t stat_size, int node)
685 size_t len = nelem * elem_size + stat_size;
687 void *p = dma_alloc_coherent(dev, len, phys, GFP_KERNEL);
692 s = kzalloc_node(nelem * sw_size, GFP_KERNEL, node);
695 dma_free_coherent(dev, len, p, *phys);
700 *(void **)metadata = s;
706 * sgl_len - calculates the size of an SGL of the given capacity
707 * @n: the number of SGL entries
709 * Calculates the number of flits needed for a scatter/gather list that
710 * can hold the given number of entries.
712 static inline unsigned int sgl_len(unsigned int n)
715 return (3 * n) / 2 + (n & 1) + 2;
719 * flits_to_desc - returns the num of Tx descriptors for the given flits
720 * @n: the number of flits
722 * Returns the number of Tx descriptors needed for the supplied number
725 static inline unsigned int flits_to_desc(unsigned int n)
727 BUG_ON(n > SGE_MAX_WR_LEN / 8);
728 return DIV_ROUND_UP(n, 8);
732 * is_eth_imm - can an Ethernet packet be sent as immediate data?
735 * Returns whether an Ethernet packet is small enough to fit as
736 * immediate data. Return value corresponds to headroom required.
738 static inline int is_eth_imm(const struct sk_buff *skb)
740 int hdrlen = skb_shinfo(skb)->gso_size ?
741 sizeof(struct cpl_tx_pkt_lso_core) : 0;
743 hdrlen += sizeof(struct cpl_tx_pkt);
744 if (skb->len <= MAX_IMM_TX_PKT_LEN - hdrlen)
750 * calc_tx_flits - calculate the number of flits for a packet Tx WR
753 * Returns the number of flits needed for a Tx WR for the given Ethernet
754 * packet, including the needed WR and CPL headers.
756 static inline unsigned int calc_tx_flits(const struct sk_buff *skb)
759 int hdrlen = is_eth_imm(skb);
762 return DIV_ROUND_UP(skb->len + hdrlen, sizeof(__be64));
764 flits = sgl_len(skb_shinfo(skb)->nr_frags + 1) + 4;
765 if (skb_shinfo(skb)->gso_size)
771 * calc_tx_descs - calculate the number of Tx descriptors for a packet
774 * Returns the number of Tx descriptors needed for the given Ethernet
775 * packet, including the needed WR and CPL headers.
777 static inline unsigned int calc_tx_descs(const struct sk_buff *skb)
779 return flits_to_desc(calc_tx_flits(skb));
783 * write_sgl - populate a scatter/gather list for a packet
785 * @q: the Tx queue we are writing into
786 * @sgl: starting location for writing the SGL
787 * @end: points right after the end of the SGL
788 * @start: start offset into skb main-body data to include in the SGL
789 * @addr: the list of bus addresses for the SGL elements
791 * Generates a gather list for the buffers that make up a packet.
792 * The caller must provide adequate space for the SGL that will be written.
793 * The SGL includes all of the packet's page fragments and the data in its
794 * main body except for the first @start bytes. @sgl must be 16-byte
795 * aligned and within a Tx descriptor with available space. @end points
796 * right after the end of the SGL but does not account for any potential
797 * wrap around, i.e., @end > @sgl.
799 static void write_sgl(const struct sk_buff *skb, struct sge_txq *q,
800 struct ulptx_sgl *sgl, u64 *end, unsigned int start,
801 const dma_addr_t *addr)
804 struct ulptx_sge_pair *to;
805 const struct skb_shared_info *si = skb_shinfo(skb);
806 unsigned int nfrags = si->nr_frags;
807 struct ulptx_sge_pair buf[MAX_SKB_FRAGS / 2 + 1];
809 len = skb_headlen(skb) - start;
811 sgl->len0 = htonl(len);
812 sgl->addr0 = cpu_to_be64(addr[0] + start);
815 sgl->len0 = htonl(skb_frag_size(&si->frags[0]));
816 sgl->addr0 = cpu_to_be64(addr[1]);
819 sgl->cmd_nsge = htonl(ULPTX_CMD(ULP_TX_SC_DSGL) | ULPTX_NSGE(nfrags));
820 if (likely(--nfrags == 0))
823 * Most of the complexity below deals with the possibility we hit the
824 * end of the queue in the middle of writing the SGL. For this case
825 * only we create the SGL in a temporary buffer and then copy it.
827 to = (u8 *)end > (u8 *)q->stat ? buf : sgl->sge;
829 for (i = (nfrags != si->nr_frags); nfrags >= 2; nfrags -= 2, to++) {
830 to->len[0] = cpu_to_be32(skb_frag_size(&si->frags[i]));
831 to->len[1] = cpu_to_be32(skb_frag_size(&si->frags[++i]));
832 to->addr[0] = cpu_to_be64(addr[i]);
833 to->addr[1] = cpu_to_be64(addr[++i]);
836 to->len[0] = cpu_to_be32(skb_frag_size(&si->frags[i]));
837 to->len[1] = cpu_to_be32(0);
838 to->addr[0] = cpu_to_be64(addr[i + 1]);
840 if (unlikely((u8 *)end > (u8 *)q->stat)) {
841 unsigned int part0 = (u8 *)q->stat - (u8 *)sgl->sge, part1;
844 memcpy(sgl->sge, buf, part0);
845 part1 = (u8 *)end - (u8 *)q->stat;
846 memcpy(q->desc, (u8 *)buf + part0, part1);
847 end = (void *)q->desc + part1;
849 if ((uintptr_t)end & 8) /* 0-pad to multiple of 16 */
853 /* This function copies 64 byte coalesced work request to
854 * memory mapped BAR2 space(user space writes).
855 * For coalesced WR SGE, fetches data from the FIFO instead of from Host.
857 static void cxgb_pio_copy(u64 __iomem *dst, u64 *src)
870 * ring_tx_db - check and potentially ring a Tx queue's doorbell
873 * @n: number of new descriptors to give to HW
875 * Ring the doorbel for a Tx queue.
877 static inline void ring_tx_db(struct adapter *adap, struct sge_txq *q, int n)
879 wmb(); /* write descriptors before telling HW */
881 if (is_t4(adap->params.chip)) {
885 /* For T4 we need to participate in the Doorbell Recovery
888 spin_lock_irqsave(&q->db_lock, flags);
890 t4_write_reg(adap, MYPF_REG(SGE_PF_KDOORBELL),
891 QID(q->cntxt_id) | val);
894 q->db_pidx = q->pidx;
895 spin_unlock_irqrestore(&q->db_lock, flags);
897 u32 val = PIDX_T5(n);
899 /* T4 and later chips share the same PIDX field offset within
900 * the doorbell, but T5 and later shrank the field in order to
901 * gain a bit for Doorbell Priority. The field was absurdly
902 * large in the first place (14 bits) so we just use the T5
903 * and later limits and warn if a Queue ID is too large.
905 WARN_ON(val & DBPRIO(1));
907 /* For T5 and later we use the Write-Combine mapped BAR2 User
908 * Doorbell mechanism. If we're only writing a single TX
909 * Descriptor and TX Write Combining hasn't been disabled, we
910 * can use the Write Combining Gather Buffer; otherwise we use
911 * the simple doorbell.
917 unsigned int *wr = (unsigned int *)&q->desc[index];
919 cxgb_pio_copy((u64 __iomem *)
920 (adap->bar2 + q->udb +
924 writel(val, adap->bar2 + q->udb + SGE_UDB_KDOORBELL);
927 /* This Write Memory Barrier will force the write to the User
928 * Doorbell area to be flushed. This is needed to prevent
929 * writes on different CPUs for the same queue from hitting
930 * the adapter out of order. This is required when some Work
931 * Requests take the Write Combine Gather Buffer path (user
932 * doorbell area offset [SGE_UDB_WCDOORBELL..+63]) and some
933 * take the traditional path where we simply increment the
934 * PIDX (User Doorbell area SGE_UDB_KDOORBELL) and have the
935 * hardware DMA read the actual Work Request.
942 * inline_tx_skb - inline a packet's data into Tx descriptors
944 * @q: the Tx queue where the packet will be inlined
945 * @pos: starting position in the Tx queue where to inline the packet
947 * Inline a packet's contents directly into Tx descriptors, starting at
948 * the given position within the Tx DMA ring.
949 * Most of the complexity of this operation is dealing with wrap arounds
950 * in the middle of the packet we want to inline.
952 static void inline_tx_skb(const struct sk_buff *skb, const struct sge_txq *q,
956 int left = (void *)q->stat - pos;
958 if (likely(skb->len <= left)) {
959 if (likely(!skb->data_len))
960 skb_copy_from_linear_data(skb, pos, skb->len);
962 skb_copy_bits(skb, 0, pos, skb->len);
965 skb_copy_bits(skb, 0, pos, left);
966 skb_copy_bits(skb, left, q->desc, skb->len - left);
967 pos = (void *)q->desc + (skb->len - left);
970 /* 0-pad to multiple of 16 */
971 p = PTR_ALIGN(pos, 8);
972 if ((uintptr_t)p & 8)
977 * Figure out what HW csum a packet wants and return the appropriate control
980 static u64 hwcsum(const struct sk_buff *skb)
983 const struct iphdr *iph = ip_hdr(skb);
985 if (iph->version == 4) {
986 if (iph->protocol == IPPROTO_TCP)
987 csum_type = TX_CSUM_TCPIP;
988 else if (iph->protocol == IPPROTO_UDP)
989 csum_type = TX_CSUM_UDPIP;
992 * unknown protocol, disable HW csum
993 * and hope a bad packet is detected
995 return TXPKT_L4CSUM_DIS;
999 * this doesn't work with extension headers
1001 const struct ipv6hdr *ip6h = (const struct ipv6hdr *)iph;
1003 if (ip6h->nexthdr == IPPROTO_TCP)
1004 csum_type = TX_CSUM_TCPIP6;
1005 else if (ip6h->nexthdr == IPPROTO_UDP)
1006 csum_type = TX_CSUM_UDPIP6;
1011 if (likely(csum_type >= TX_CSUM_TCPIP))
1012 return TXPKT_CSUM_TYPE(csum_type) |
1013 TXPKT_IPHDR_LEN(skb_network_header_len(skb)) |
1014 TXPKT_ETHHDR_LEN(skb_network_offset(skb) - ETH_HLEN);
1016 int start = skb_transport_offset(skb);
1018 return TXPKT_CSUM_TYPE(csum_type) | TXPKT_CSUM_START(start) |
1019 TXPKT_CSUM_LOC(start + skb->csum_offset);
1023 static void eth_txq_stop(struct sge_eth_txq *q)
1025 netif_tx_stop_queue(q->txq);
1029 static inline void txq_advance(struct sge_txq *q, unsigned int n)
1033 if (q->pidx >= q->size)
1038 * t4_eth_xmit - add a packet to an Ethernet Tx queue
1040 * @dev: the egress net device
1042 * Add a packet to an SGE Ethernet Tx queue. Runs with softirqs disabled.
1044 netdev_tx_t t4_eth_xmit(struct sk_buff *skb, struct net_device *dev)
1050 unsigned int flits, ndesc;
1051 struct adapter *adap;
1052 struct sge_eth_txq *q;
1053 const struct port_info *pi;
1054 struct fw_eth_tx_pkt_wr *wr;
1055 struct cpl_tx_pkt_core *cpl;
1056 const struct skb_shared_info *ssi;
1057 dma_addr_t addr[MAX_SKB_FRAGS + 1];
1058 bool immediate = false;
1061 * The chip min packet length is 10 octets but play safe and reject
1062 * anything shorter than an Ethernet header.
1064 if (unlikely(skb->len < ETH_HLEN)) {
1065 out_free: dev_kfree_skb_any(skb);
1066 return NETDEV_TX_OK;
1069 pi = netdev_priv(dev);
1071 qidx = skb_get_queue_mapping(skb);
1072 q = &adap->sge.ethtxq[qidx + pi->first_qset];
1074 reclaim_completed_tx(adap, &q->q, true);
1076 flits = calc_tx_flits(skb);
1077 ndesc = flits_to_desc(flits);
1078 credits = txq_avail(&q->q) - ndesc;
1080 if (unlikely(credits < 0)) {
1082 dev_err(adap->pdev_dev,
1083 "%s: Tx ring %u full while queue awake!\n",
1085 return NETDEV_TX_BUSY;
1088 if (is_eth_imm(skb))
1092 unlikely(map_skb(adap->pdev_dev, skb, addr) < 0)) {
1097 wr_mid = FW_WR_LEN16(DIV_ROUND_UP(flits, 2));
1098 if (unlikely(credits < ETHTXQ_STOP_THRES)) {
1100 wr_mid |= FW_WR_EQUEQ | FW_WR_EQUIQ;
1103 wr = (void *)&q->q.desc[q->q.pidx];
1104 wr->equiq_to_len16 = htonl(wr_mid);
1105 wr->r3 = cpu_to_be64(0);
1106 end = (u64 *)wr + flits;
1108 len = immediate ? skb->len : 0;
1109 ssi = skb_shinfo(skb);
1110 if (ssi->gso_size) {
1111 struct cpl_tx_pkt_lso *lso = (void *)wr;
1112 bool v6 = (ssi->gso_type & SKB_GSO_TCPV6) != 0;
1113 int l3hdr_len = skb_network_header_len(skb);
1114 int eth_xtra_len = skb_network_offset(skb) - ETH_HLEN;
1116 len += sizeof(*lso);
1117 wr->op_immdlen = htonl(FW_WR_OP(FW_ETH_TX_PKT_WR) |
1118 FW_WR_IMMDLEN(len));
1119 lso->c.lso_ctrl = htonl(LSO_OPCODE(CPL_TX_PKT_LSO) |
1120 LSO_FIRST_SLICE | LSO_LAST_SLICE |
1122 LSO_ETHHDR_LEN(eth_xtra_len / 4) |
1123 LSO_IPHDR_LEN(l3hdr_len / 4) |
1124 LSO_TCPHDR_LEN(tcp_hdr(skb)->doff));
1125 lso->c.ipid_ofst = htons(0);
1126 lso->c.mss = htons(ssi->gso_size);
1127 lso->c.seqno_offset = htonl(0);
1128 lso->c.len = htonl(skb->len);
1129 cpl = (void *)(lso + 1);
1130 cntrl = TXPKT_CSUM_TYPE(v6 ? TX_CSUM_TCPIP6 : TX_CSUM_TCPIP) |
1131 TXPKT_IPHDR_LEN(l3hdr_len) |
1132 TXPKT_ETHHDR_LEN(eth_xtra_len);
1134 q->tx_cso += ssi->gso_segs;
1136 len += sizeof(*cpl);
1137 wr->op_immdlen = htonl(FW_WR_OP(FW_ETH_TX_PKT_WR) |
1138 FW_WR_IMMDLEN(len));
1139 cpl = (void *)(wr + 1);
1140 if (skb->ip_summed == CHECKSUM_PARTIAL) {
1141 cntrl = hwcsum(skb) | TXPKT_IPCSUM_DIS;
1144 cntrl = TXPKT_L4CSUM_DIS | TXPKT_IPCSUM_DIS;
1147 if (vlan_tx_tag_present(skb)) {
1149 cntrl |= TXPKT_VLAN_VLD | TXPKT_VLAN(vlan_tx_tag_get(skb));
1152 cpl->ctrl0 = htonl(TXPKT_OPCODE(CPL_TX_PKT_XT) |
1153 TXPKT_INTF(pi->tx_chan) | TXPKT_PF(adap->fn));
1154 cpl->pack = htons(0);
1155 cpl->len = htons(skb->len);
1156 cpl->ctrl1 = cpu_to_be64(cntrl);
1159 inline_tx_skb(skb, &q->q, cpl + 1);
1160 dev_consume_skb_any(skb);
1164 write_sgl(skb, &q->q, (struct ulptx_sgl *)(cpl + 1), end, 0,
1168 last_desc = q->q.pidx + ndesc - 1;
1169 if (last_desc >= q->q.size)
1170 last_desc -= q->q.size;
1171 q->q.sdesc[last_desc].skb = skb;
1172 q->q.sdesc[last_desc].sgl = (struct ulptx_sgl *)(cpl + 1);
1175 txq_advance(&q->q, ndesc);
1177 ring_tx_db(adap, &q->q, ndesc);
1178 return NETDEV_TX_OK;
1182 * reclaim_completed_tx_imm - reclaim completed control-queue Tx descs
1183 * @q: the SGE control Tx queue
1185 * This is a variant of reclaim_completed_tx() that is used for Tx queues
1186 * that send only immediate data (presently just the control queues) and
1187 * thus do not have any sk_buffs to release.
1189 static inline void reclaim_completed_tx_imm(struct sge_txq *q)
1191 int hw_cidx = ntohs(q->stat->cidx);
1192 int reclaim = hw_cidx - q->cidx;
1197 q->in_use -= reclaim;
1202 * is_imm - check whether a packet can be sent as immediate data
1205 * Returns true if a packet can be sent as a WR with immediate data.
1207 static inline int is_imm(const struct sk_buff *skb)
1209 return skb->len <= MAX_CTRL_WR_LEN;
1213 * ctrlq_check_stop - check if a control queue is full and should stop
1215 * @wr: most recent WR written to the queue
1217 * Check if a control queue has become full and should be stopped.
1218 * We clean up control queue descriptors very lazily, only when we are out.
1219 * If the queue is still full after reclaiming any completed descriptors
1220 * we suspend it and have the last WR wake it up.
1222 static void ctrlq_check_stop(struct sge_ctrl_txq *q, struct fw_wr_hdr *wr)
1224 reclaim_completed_tx_imm(&q->q);
1225 if (unlikely(txq_avail(&q->q) < TXQ_STOP_THRES)) {
1226 wr->lo |= htonl(FW_WR_EQUEQ | FW_WR_EQUIQ);
1233 * ctrl_xmit - send a packet through an SGE control Tx queue
1234 * @q: the control queue
1237 * Send a packet through an SGE control Tx queue. Packets sent through
1238 * a control queue must fit entirely as immediate data.
1240 static int ctrl_xmit(struct sge_ctrl_txq *q, struct sk_buff *skb)
1243 struct fw_wr_hdr *wr;
1245 if (unlikely(!is_imm(skb))) {
1248 return NET_XMIT_DROP;
1251 ndesc = DIV_ROUND_UP(skb->len, sizeof(struct tx_desc));
1252 spin_lock(&q->sendq.lock);
1254 if (unlikely(q->full)) {
1255 skb->priority = ndesc; /* save for restart */
1256 __skb_queue_tail(&q->sendq, skb);
1257 spin_unlock(&q->sendq.lock);
1261 wr = (struct fw_wr_hdr *)&q->q.desc[q->q.pidx];
1262 inline_tx_skb(skb, &q->q, wr);
1264 txq_advance(&q->q, ndesc);
1265 if (unlikely(txq_avail(&q->q) < TXQ_STOP_THRES))
1266 ctrlq_check_stop(q, wr);
1268 ring_tx_db(q->adap, &q->q, ndesc);
1269 spin_unlock(&q->sendq.lock);
1272 return NET_XMIT_SUCCESS;
1276 * restart_ctrlq - restart a suspended control queue
1277 * @data: the control queue to restart
1279 * Resumes transmission on a suspended Tx control queue.
1281 static void restart_ctrlq(unsigned long data)
1283 struct sk_buff *skb;
1284 unsigned int written = 0;
1285 struct sge_ctrl_txq *q = (struct sge_ctrl_txq *)data;
1287 spin_lock(&q->sendq.lock);
1288 reclaim_completed_tx_imm(&q->q);
1289 BUG_ON(txq_avail(&q->q) < TXQ_STOP_THRES); /* q should be empty */
1291 while ((skb = __skb_dequeue(&q->sendq)) != NULL) {
1292 struct fw_wr_hdr *wr;
1293 unsigned int ndesc = skb->priority; /* previously saved */
1296 * Write descriptors and free skbs outside the lock to limit
1297 * wait times. q->full is still set so new skbs will be queued.
1299 spin_unlock(&q->sendq.lock);
1301 wr = (struct fw_wr_hdr *)&q->q.desc[q->q.pidx];
1302 inline_tx_skb(skb, &q->q, wr);
1306 txq_advance(&q->q, ndesc);
1307 if (unlikely(txq_avail(&q->q) < TXQ_STOP_THRES)) {
1308 unsigned long old = q->q.stops;
1310 ctrlq_check_stop(q, wr);
1311 if (q->q.stops != old) { /* suspended anew */
1312 spin_lock(&q->sendq.lock);
1317 ring_tx_db(q->adap, &q->q, written);
1320 spin_lock(&q->sendq.lock);
1323 ringdb: if (written)
1324 ring_tx_db(q->adap, &q->q, written);
1325 spin_unlock(&q->sendq.lock);
1329 * t4_mgmt_tx - send a management message
1330 * @adap: the adapter
1331 * @skb: the packet containing the management message
1333 * Send a management message through control queue 0.
1335 int t4_mgmt_tx(struct adapter *adap, struct sk_buff *skb)
1340 ret = ctrl_xmit(&adap->sge.ctrlq[0], skb);
1346 * is_ofld_imm - check whether a packet can be sent as immediate data
1349 * Returns true if a packet can be sent as an offload WR with immediate
1350 * data. We currently use the same limit as for Ethernet packets.
1352 static inline int is_ofld_imm(const struct sk_buff *skb)
1354 return skb->len <= MAX_IMM_TX_PKT_LEN;
1358 * calc_tx_flits_ofld - calculate # of flits for an offload packet
1361 * Returns the number of flits needed for the given offload packet.
1362 * These packets are already fully constructed and no additional headers
1365 static inline unsigned int calc_tx_flits_ofld(const struct sk_buff *skb)
1367 unsigned int flits, cnt;
1369 if (is_ofld_imm(skb))
1370 return DIV_ROUND_UP(skb->len, 8);
1372 flits = skb_transport_offset(skb) / 8U; /* headers */
1373 cnt = skb_shinfo(skb)->nr_frags;
1374 if (skb_tail_pointer(skb) != skb_transport_header(skb))
1376 return flits + sgl_len(cnt);
1380 * txq_stop_maperr - stop a Tx queue due to I/O MMU exhaustion
1381 * @adap: the adapter
1382 * @q: the queue to stop
1384 * Mark a Tx queue stopped due to I/O MMU exhaustion and resulting
1385 * inability to map packets. A periodic timer attempts to restart
1388 static void txq_stop_maperr(struct sge_ofld_txq *q)
1392 set_bit(q->q.cntxt_id - q->adap->sge.egr_start,
1393 q->adap->sge.txq_maperr);
1397 * ofldtxq_stop - stop an offload Tx queue that has become full
1398 * @q: the queue to stop
1399 * @skb: the packet causing the queue to become full
1401 * Stops an offload Tx queue that has become full and modifies the packet
1402 * being written to request a wakeup.
1404 static void ofldtxq_stop(struct sge_ofld_txq *q, struct sk_buff *skb)
1406 struct fw_wr_hdr *wr = (struct fw_wr_hdr *)skb->data;
1408 wr->lo |= htonl(FW_WR_EQUEQ | FW_WR_EQUIQ);
1414 * service_ofldq - restart a suspended offload queue
1415 * @q: the offload queue
1417 * Services an offload Tx queue by moving packets from its packet queue
1418 * to the HW Tx ring. The function starts and ends with the queue locked.
1420 static void service_ofldq(struct sge_ofld_txq *q)
1424 struct sk_buff *skb;
1425 unsigned int written = 0;
1426 unsigned int flits, ndesc;
1428 while ((skb = skb_peek(&q->sendq)) != NULL && !q->full) {
1430 * We drop the lock but leave skb on sendq, thus retaining
1431 * exclusive access to the state of the queue.
1433 spin_unlock(&q->sendq.lock);
1435 reclaim_completed_tx(q->adap, &q->q, false);
1437 flits = skb->priority; /* previously saved */
1438 ndesc = flits_to_desc(flits);
1439 credits = txq_avail(&q->q) - ndesc;
1440 BUG_ON(credits < 0);
1441 if (unlikely(credits < TXQ_STOP_THRES))
1442 ofldtxq_stop(q, skb);
1444 pos = (u64 *)&q->q.desc[q->q.pidx];
1445 if (is_ofld_imm(skb))
1446 inline_tx_skb(skb, &q->q, pos);
1447 else if (map_skb(q->adap->pdev_dev, skb,
1448 (dma_addr_t *)skb->head)) {
1450 spin_lock(&q->sendq.lock);
1453 int last_desc, hdr_len = skb_transport_offset(skb);
1455 memcpy(pos, skb->data, hdr_len);
1456 write_sgl(skb, &q->q, (void *)pos + hdr_len,
1457 pos + flits, hdr_len,
1458 (dma_addr_t *)skb->head);
1459 #ifdef CONFIG_NEED_DMA_MAP_STATE
1460 skb->dev = q->adap->port[0];
1461 skb->destructor = deferred_unmap_destructor;
1463 last_desc = q->q.pidx + ndesc - 1;
1464 if (last_desc >= q->q.size)
1465 last_desc -= q->q.size;
1466 q->q.sdesc[last_desc].skb = skb;
1469 txq_advance(&q->q, ndesc);
1471 if (unlikely(written > 32)) {
1472 ring_tx_db(q->adap, &q->q, written);
1476 spin_lock(&q->sendq.lock);
1477 __skb_unlink(skb, &q->sendq);
1478 if (is_ofld_imm(skb))
1481 if (likely(written))
1482 ring_tx_db(q->adap, &q->q, written);
1486 * ofld_xmit - send a packet through an offload queue
1487 * @q: the Tx offload queue
1490 * Send an offload packet through an SGE offload queue.
1492 static int ofld_xmit(struct sge_ofld_txq *q, struct sk_buff *skb)
1494 skb->priority = calc_tx_flits_ofld(skb); /* save for restart */
1495 spin_lock(&q->sendq.lock);
1496 __skb_queue_tail(&q->sendq, skb);
1497 if (q->sendq.qlen == 1)
1499 spin_unlock(&q->sendq.lock);
1500 return NET_XMIT_SUCCESS;
1504 * restart_ofldq - restart a suspended offload queue
1505 * @data: the offload queue to restart
1507 * Resumes transmission on a suspended Tx offload queue.
1509 static void restart_ofldq(unsigned long data)
1511 struct sge_ofld_txq *q = (struct sge_ofld_txq *)data;
1513 spin_lock(&q->sendq.lock);
1514 q->full = 0; /* the queue actually is completely empty now */
1516 spin_unlock(&q->sendq.lock);
1520 * skb_txq - return the Tx queue an offload packet should use
1523 * Returns the Tx queue an offload packet should use as indicated by bits
1524 * 1-15 in the packet's queue_mapping.
1526 static inline unsigned int skb_txq(const struct sk_buff *skb)
1528 return skb->queue_mapping >> 1;
1532 * is_ctrl_pkt - return whether an offload packet is a control packet
1535 * Returns whether an offload packet should use an OFLD or a CTRL
1536 * Tx queue as indicated by bit 0 in the packet's queue_mapping.
1538 static inline unsigned int is_ctrl_pkt(const struct sk_buff *skb)
1540 return skb->queue_mapping & 1;
1543 static inline int ofld_send(struct adapter *adap, struct sk_buff *skb)
1545 unsigned int idx = skb_txq(skb);
1547 if (unlikely(is_ctrl_pkt(skb))) {
1548 /* Single ctrl queue is a requirement for LE workaround path */
1549 if (adap->tids.nsftids)
1551 return ctrl_xmit(&adap->sge.ctrlq[idx], skb);
1553 return ofld_xmit(&adap->sge.ofldtxq[idx], skb);
1557 * t4_ofld_send - send an offload packet
1558 * @adap: the adapter
1561 * Sends an offload packet. We use the packet queue_mapping to select the
1562 * appropriate Tx queue as follows: bit 0 indicates whether the packet
1563 * should be sent as regular or control, bits 1-15 select the queue.
1565 int t4_ofld_send(struct adapter *adap, struct sk_buff *skb)
1570 ret = ofld_send(adap, skb);
1576 * cxgb4_ofld_send - send an offload packet
1577 * @dev: the net device
1580 * Sends an offload packet. This is an exported version of @t4_ofld_send,
1581 * intended for ULDs.
1583 int cxgb4_ofld_send(struct net_device *dev, struct sk_buff *skb)
1585 return t4_ofld_send(netdev2adap(dev), skb);
1587 EXPORT_SYMBOL(cxgb4_ofld_send);
1589 static inline void copy_frags(struct sk_buff *skb,
1590 const struct pkt_gl *gl, unsigned int offset)
1594 /* usually there's just one frag */
1595 __skb_fill_page_desc(skb, 0, gl->frags[0].page,
1596 gl->frags[0].offset + offset,
1597 gl->frags[0].size - offset);
1598 skb_shinfo(skb)->nr_frags = gl->nfrags;
1599 for (i = 1; i < gl->nfrags; i++)
1600 __skb_fill_page_desc(skb, i, gl->frags[i].page,
1601 gl->frags[i].offset,
1604 /* get a reference to the last page, we don't own it */
1605 get_page(gl->frags[gl->nfrags - 1].page);
1609 * cxgb4_pktgl_to_skb - build an sk_buff from a packet gather list
1610 * @gl: the gather list
1611 * @skb_len: size of sk_buff main body if it carries fragments
1612 * @pull_len: amount of data to move to the sk_buff's main body
1614 * Builds an sk_buff from the given packet gather list. Returns the
1615 * sk_buff or %NULL if sk_buff allocation failed.
1617 struct sk_buff *cxgb4_pktgl_to_skb(const struct pkt_gl *gl,
1618 unsigned int skb_len, unsigned int pull_len)
1620 struct sk_buff *skb;
1623 * Below we rely on RX_COPY_THRES being less than the smallest Rx buffer
1624 * size, which is expected since buffers are at least PAGE_SIZEd.
1625 * In this case packets up to RX_COPY_THRES have only one fragment.
1627 if (gl->tot_len <= RX_COPY_THRES) {
1628 skb = dev_alloc_skb(gl->tot_len);
1631 __skb_put(skb, gl->tot_len);
1632 skb_copy_to_linear_data(skb, gl->va, gl->tot_len);
1634 skb = dev_alloc_skb(skb_len);
1637 __skb_put(skb, pull_len);
1638 skb_copy_to_linear_data(skb, gl->va, pull_len);
1640 copy_frags(skb, gl, pull_len);
1641 skb->len = gl->tot_len;
1642 skb->data_len = skb->len - pull_len;
1643 skb->truesize += skb->data_len;
1647 EXPORT_SYMBOL(cxgb4_pktgl_to_skb);
1650 * t4_pktgl_free - free a packet gather list
1651 * @gl: the gather list
1653 * Releases the pages of a packet gather list. We do not own the last
1654 * page on the list and do not free it.
1656 static void t4_pktgl_free(const struct pkt_gl *gl)
1659 const struct page_frag *p;
1661 for (p = gl->frags, n = gl->nfrags - 1; n--; p++)
1666 * Process an MPS trace packet. Give it an unused protocol number so it won't
1667 * be delivered to anyone and send it to the stack for capture.
1669 static noinline int handle_trace_pkt(struct adapter *adap,
1670 const struct pkt_gl *gl)
1672 struct sk_buff *skb;
1674 skb = cxgb4_pktgl_to_skb(gl, RX_PULL_LEN, RX_PULL_LEN);
1675 if (unlikely(!skb)) {
1680 if (is_t4(adap->params.chip))
1681 __skb_pull(skb, sizeof(struct cpl_trace_pkt));
1683 __skb_pull(skb, sizeof(struct cpl_t5_trace_pkt));
1685 skb_reset_mac_header(skb);
1686 skb->protocol = htons(0xffff);
1687 skb->dev = adap->port[0];
1688 netif_receive_skb(skb);
1692 static void do_gro(struct sge_eth_rxq *rxq, const struct pkt_gl *gl,
1693 const struct cpl_rx_pkt *pkt)
1695 struct adapter *adapter = rxq->rspq.adap;
1696 struct sge *s = &adapter->sge;
1698 struct sk_buff *skb;
1700 skb = napi_get_frags(&rxq->rspq.napi);
1701 if (unlikely(!skb)) {
1703 rxq->stats.rx_drops++;
1707 copy_frags(skb, gl, s->pktshift);
1708 skb->len = gl->tot_len - s->pktshift;
1709 skb->data_len = skb->len;
1710 skb->truesize += skb->data_len;
1711 skb->ip_summed = CHECKSUM_UNNECESSARY;
1712 skb_record_rx_queue(skb, rxq->rspq.idx);
1713 if (rxq->rspq.netdev->features & NETIF_F_RXHASH)
1714 skb_set_hash(skb, (__force u32)pkt->rsshdr.hash_val,
1717 if (unlikely(pkt->vlan_ex)) {
1718 __vlan_hwaccel_put_tag(skb, htons(ETH_P_8021Q), ntohs(pkt->vlan));
1719 rxq->stats.vlan_ex++;
1721 ret = napi_gro_frags(&rxq->rspq.napi);
1722 if (ret == GRO_HELD)
1723 rxq->stats.lro_pkts++;
1724 else if (ret == GRO_MERGED || ret == GRO_MERGED_FREE)
1725 rxq->stats.lro_merged++;
1727 rxq->stats.rx_cso++;
1731 * t4_ethrx_handler - process an ingress ethernet packet
1732 * @q: the response queue that received the packet
1733 * @rsp: the response queue descriptor holding the RX_PKT message
1734 * @si: the gather list of packet fragments
1736 * Process an ingress ethernet packet and deliver it to the stack.
1738 int t4_ethrx_handler(struct sge_rspq *q, const __be64 *rsp,
1739 const struct pkt_gl *si)
1742 struct sk_buff *skb;
1743 const struct cpl_rx_pkt *pkt;
1744 struct sge_eth_rxq *rxq = container_of(q, struct sge_eth_rxq, rspq);
1745 struct sge *s = &q->adap->sge;
1746 int cpl_trace_pkt = is_t4(q->adap->params.chip) ?
1747 CPL_TRACE_PKT : CPL_TRACE_PKT_T5;
1749 if (unlikely(*(u8 *)rsp == cpl_trace_pkt))
1750 return handle_trace_pkt(q->adap, si);
1752 pkt = (const struct cpl_rx_pkt *)rsp;
1753 csum_ok = pkt->csum_calc && !pkt->err_vec &&
1754 (q->netdev->features & NETIF_F_RXCSUM);
1755 if ((pkt->l2info & htonl(RXF_TCP)) &&
1756 (q->netdev->features & NETIF_F_GRO) && csum_ok && !pkt->ip_frag) {
1757 do_gro(rxq, si, pkt);
1761 skb = cxgb4_pktgl_to_skb(si, RX_PKT_SKB_LEN, RX_PULL_LEN);
1762 if (unlikely(!skb)) {
1764 rxq->stats.rx_drops++;
1768 __skb_pull(skb, s->pktshift); /* remove ethernet header padding */
1769 skb->protocol = eth_type_trans(skb, q->netdev);
1770 skb_record_rx_queue(skb, q->idx);
1771 if (skb->dev->features & NETIF_F_RXHASH)
1772 skb_set_hash(skb, (__force u32)pkt->rsshdr.hash_val,
1777 if (csum_ok && (pkt->l2info & htonl(RXF_UDP | RXF_TCP))) {
1778 if (!pkt->ip_frag) {
1779 skb->ip_summed = CHECKSUM_UNNECESSARY;
1780 rxq->stats.rx_cso++;
1781 } else if (pkt->l2info & htonl(RXF_IP)) {
1782 __sum16 c = (__force __sum16)pkt->csum;
1783 skb->csum = csum_unfold(c);
1784 skb->ip_summed = CHECKSUM_COMPLETE;
1785 rxq->stats.rx_cso++;
1788 skb_checksum_none_assert(skb);
1790 if (unlikely(pkt->vlan_ex)) {
1791 __vlan_hwaccel_put_tag(skb, htons(ETH_P_8021Q), ntohs(pkt->vlan));
1792 rxq->stats.vlan_ex++;
1794 netif_receive_skb(skb);
1799 * restore_rx_bufs - put back a packet's Rx buffers
1800 * @si: the packet gather list
1801 * @q: the SGE free list
1802 * @frags: number of FL buffers to restore
1804 * Puts back on an FL the Rx buffers associated with @si. The buffers
1805 * have already been unmapped and are left unmapped, we mark them so to
1806 * prevent further unmapping attempts.
1808 * This function undoes a series of @unmap_rx_buf calls when we find out
1809 * that the current packet can't be processed right away afterall and we
1810 * need to come back to it later. This is a very rare event and there's
1811 * no effort to make this particularly efficient.
1813 static void restore_rx_bufs(const struct pkt_gl *si, struct sge_fl *q,
1816 struct rx_sw_desc *d;
1820 q->cidx = q->size - 1;
1823 d = &q->sdesc[q->cidx];
1824 d->page = si->frags[frags].page;
1825 d->dma_addr |= RX_UNMAPPED_BUF;
1831 * is_new_response - check if a response is newly written
1832 * @r: the response descriptor
1833 * @q: the response queue
1835 * Returns true if a response descriptor contains a yet unprocessed
1838 static inline bool is_new_response(const struct rsp_ctrl *r,
1839 const struct sge_rspq *q)
1841 return RSPD_GEN(r->type_gen) == q->gen;
1845 * rspq_next - advance to the next entry in a response queue
1848 * Updates the state of a response queue to advance it to the next entry.
1850 static inline void rspq_next(struct sge_rspq *q)
1852 q->cur_desc = (void *)q->cur_desc + q->iqe_len;
1853 if (unlikely(++q->cidx == q->size)) {
1856 q->cur_desc = q->desc;
1861 * process_responses - process responses from an SGE response queue
1862 * @q: the ingress queue to process
1863 * @budget: how many responses can be processed in this round
1865 * Process responses from an SGE response queue up to the supplied budget.
1866 * Responses include received packets as well as control messages from FW
1869 * Additionally choose the interrupt holdoff time for the next interrupt
1870 * on this queue. If the system is under memory shortage use a fairly
1871 * long delay to help recovery.
1873 static int process_responses(struct sge_rspq *q, int budget)
1876 int budget_left = budget;
1877 const struct rsp_ctrl *rc;
1878 struct sge_eth_rxq *rxq = container_of(q, struct sge_eth_rxq, rspq);
1879 struct adapter *adapter = q->adap;
1880 struct sge *s = &adapter->sge;
1882 while (likely(budget_left)) {
1883 rc = (void *)q->cur_desc + (q->iqe_len - sizeof(*rc));
1884 if (!is_new_response(rc, q))
1888 rsp_type = RSPD_TYPE(rc->type_gen);
1889 if (likely(rsp_type == RSP_TYPE_FLBUF)) {
1890 struct page_frag *fp;
1892 const struct rx_sw_desc *rsd;
1893 u32 len = ntohl(rc->pldbuflen_qid), bufsz, frags;
1895 if (len & RSPD_NEWBUF) {
1896 if (likely(q->offset > 0)) {
1897 free_rx_bufs(q->adap, &rxq->fl, 1);
1900 len = RSPD_LEN(len);
1904 /* gather packet fragments */
1905 for (frags = 0, fp = si.frags; ; frags++, fp++) {
1906 rsd = &rxq->fl.sdesc[rxq->fl.cidx];
1907 bufsz = get_buf_size(adapter, rsd);
1908 fp->page = rsd->page;
1909 fp->offset = q->offset;
1910 fp->size = min(bufsz, len);
1914 unmap_rx_buf(q->adap, &rxq->fl);
1918 * Last buffer remains mapped so explicitly make it
1919 * coherent for CPU access.
1921 dma_sync_single_for_cpu(q->adap->pdev_dev,
1923 fp->size, DMA_FROM_DEVICE);
1925 si.va = page_address(si.frags[0].page) +
1929 si.nfrags = frags + 1;
1930 ret = q->handler(q, q->cur_desc, &si);
1931 if (likely(ret == 0))
1932 q->offset += ALIGN(fp->size, s->fl_align);
1934 restore_rx_bufs(&si, &rxq->fl, frags);
1935 } else if (likely(rsp_type == RSP_TYPE_CPL)) {
1936 ret = q->handler(q, q->cur_desc, NULL);
1938 ret = q->handler(q, (const __be64 *)rc, CXGB4_MSG_AN);
1941 if (unlikely(ret)) {
1942 /* couldn't process descriptor, back off for recovery */
1943 q->next_intr_params = QINTR_TIMER_IDX(NOMEM_TMR_IDX);
1951 if (q->offset >= 0 && rxq->fl.size - rxq->fl.avail >= 16)
1952 __refill_fl(q->adap, &rxq->fl);
1953 return budget - budget_left;
1957 * napi_rx_handler - the NAPI handler for Rx processing
1958 * @napi: the napi instance
1959 * @budget: how many packets we can process in this round
1961 * Handler for new data events when using NAPI. This does not need any
1962 * locking or protection from interrupts as data interrupts are off at
1963 * this point and other adapter interrupts do not interfere (the latter
1964 * in not a concern at all with MSI-X as non-data interrupts then have
1965 * a separate handler).
1967 static int napi_rx_handler(struct napi_struct *napi, int budget)
1969 unsigned int params;
1970 struct sge_rspq *q = container_of(napi, struct sge_rspq, napi);
1971 int work_done = process_responses(q, budget);
1974 if (likely(work_done < budget)) {
1977 napi_complete(napi);
1978 timer_index = QINTR_TIMER_IDX_GET(q->next_intr_params);
1980 if (q->adaptive_rx) {
1981 if (work_done > max(timer_pkt_quota[timer_index],
1983 timer_index = (timer_index + 1);
1985 timer_index = timer_index - 1;
1987 timer_index = clamp(timer_index, 0, SGE_TIMERREGS - 1);
1988 q->next_intr_params = QINTR_TIMER_IDX(timer_index) |
1990 params = q->next_intr_params;
1992 params = q->next_intr_params;
1993 q->next_intr_params = q->intr_params;
1996 params = QINTR_TIMER_IDX(7);
1998 val = CIDXINC(work_done) | SEINTARM(params);
1999 if (is_t4(q->adap->params.chip)) {
2000 t4_write_reg(q->adap, MYPF_REG(SGE_PF_GTS),
2001 val | INGRESSQID((u32)q->cntxt_id));
2003 writel(val, q->adap->bar2 + q->udb + SGE_UDB_GTS);
2010 * The MSI-X interrupt handler for an SGE response queue.
2012 irqreturn_t t4_sge_intr_msix(int irq, void *cookie)
2014 struct sge_rspq *q = cookie;
2016 napi_schedule(&q->napi);
2021 * Process the indirect interrupt entries in the interrupt queue and kick off
2022 * NAPI for each queue that has generated an entry.
2024 static unsigned int process_intrq(struct adapter *adap)
2026 unsigned int credits;
2027 const struct rsp_ctrl *rc;
2028 struct sge_rspq *q = &adap->sge.intrq;
2031 spin_lock(&adap->sge.intrq_lock);
2032 for (credits = 0; ; credits++) {
2033 rc = (void *)q->cur_desc + (q->iqe_len - sizeof(*rc));
2034 if (!is_new_response(rc, q))
2038 if (RSPD_TYPE(rc->type_gen) == RSP_TYPE_INTR) {
2039 unsigned int qid = ntohl(rc->pldbuflen_qid);
2041 qid -= adap->sge.ingr_start;
2042 napi_schedule(&adap->sge.ingr_map[qid]->napi);
2048 val = CIDXINC(credits) | SEINTARM(q->intr_params);
2049 if (is_t4(adap->params.chip)) {
2050 t4_write_reg(adap, MYPF_REG(SGE_PF_GTS),
2051 val | INGRESSQID(q->cntxt_id));
2053 writel(val, adap->bar2 + q->udb + SGE_UDB_GTS);
2056 spin_unlock(&adap->sge.intrq_lock);
2061 * The MSI interrupt handler, which handles data events from SGE response queues
2062 * as well as error and other async events as they all use the same MSI vector.
2064 static irqreturn_t t4_intr_msi(int irq, void *cookie)
2066 struct adapter *adap = cookie;
2068 t4_slow_intr_handler(adap);
2069 process_intrq(adap);
2074 * Interrupt handler for legacy INTx interrupts.
2075 * Handles data events from SGE response queues as well as error and other
2076 * async events as they all use the same interrupt line.
2078 static irqreturn_t t4_intr_intx(int irq, void *cookie)
2080 struct adapter *adap = cookie;
2082 t4_write_reg(adap, MYPF_REG(PCIE_PF_CLI), 0);
2083 if (t4_slow_intr_handler(adap) | process_intrq(adap))
2085 return IRQ_NONE; /* probably shared interrupt */
2089 * t4_intr_handler - select the top-level interrupt handler
2090 * @adap: the adapter
2092 * Selects the top-level interrupt handler based on the type of interrupts
2093 * (MSI-X, MSI, or INTx).
2095 irq_handler_t t4_intr_handler(struct adapter *adap)
2097 if (adap->flags & USING_MSIX)
2098 return t4_sge_intr_msix;
2099 if (adap->flags & USING_MSI)
2101 return t4_intr_intx;
2104 static void sge_rx_timer_cb(unsigned long data)
2107 unsigned int i, idma_same_state_cnt[2];
2108 struct adapter *adap = (struct adapter *)data;
2109 struct sge *s = &adap->sge;
2111 for (i = 0; i < ARRAY_SIZE(s->starving_fl); i++)
2112 for (m = s->starving_fl[i]; m; m &= m - 1) {
2113 struct sge_eth_rxq *rxq;
2114 unsigned int id = __ffs(m) + i * BITS_PER_LONG;
2115 struct sge_fl *fl = s->egr_map[id];
2117 clear_bit(id, s->starving_fl);
2118 smp_mb__after_atomic();
2120 if (fl_starving(fl)) {
2121 rxq = container_of(fl, struct sge_eth_rxq, fl);
2122 if (napi_reschedule(&rxq->rspq.napi))
2125 set_bit(id, s->starving_fl);
2129 t4_write_reg(adap, SGE_DEBUG_INDEX, 13);
2130 idma_same_state_cnt[0] = t4_read_reg(adap, SGE_DEBUG_DATA_HIGH);
2131 idma_same_state_cnt[1] = t4_read_reg(adap, SGE_DEBUG_DATA_LOW);
2133 for (i = 0; i < 2; i++) {
2134 u32 debug0, debug11;
2136 /* If the Ingress DMA Same State Counter ("timer") is less
2137 * than 1s, then we can reset our synthesized Stall Timer and
2138 * continue. If we have previously emitted warnings about a
2139 * potential stalled Ingress Queue, issue a note indicating
2140 * that the Ingress Queue has resumed forward progress.
2142 if (idma_same_state_cnt[i] < s->idma_1s_thresh) {
2143 if (s->idma_stalled[i] >= SGE_IDMA_WARN_THRESH)
2144 CH_WARN(adap, "SGE idma%d, queue%u,resumed after %d sec\n",
2146 s->idma_stalled[i]/HZ);
2147 s->idma_stalled[i] = 0;
2151 /* Synthesize an SGE Ingress DMA Same State Timer in the Hz
2152 * domain. The first time we get here it'll be because we
2153 * passed the 1s Threshold; each additional time it'll be
2154 * because the RX Timer Callback is being fired on its regular
2157 * If the stall is below our Potential Hung Ingress Queue
2158 * Warning Threshold, continue.
2160 if (s->idma_stalled[i] == 0)
2161 s->idma_stalled[i] = HZ;
2163 s->idma_stalled[i] += RX_QCHECK_PERIOD;
2165 if (s->idma_stalled[i] < SGE_IDMA_WARN_THRESH)
2168 /* We'll issue a warning every SGE_IDMA_WARN_REPEAT Hz */
2169 if (((s->idma_stalled[i] - HZ) % SGE_IDMA_WARN_REPEAT) != 0)
2172 /* Read and save the SGE IDMA State and Queue ID information.
2173 * We do this every time in case it changes across time ...
2175 t4_write_reg(adap, SGE_DEBUG_INDEX, 0);
2176 debug0 = t4_read_reg(adap, SGE_DEBUG_DATA_LOW);
2177 s->idma_state[i] = (debug0 >> (i * 9)) & 0x3f;
2179 t4_write_reg(adap, SGE_DEBUG_INDEX, 11);
2180 debug11 = t4_read_reg(adap, SGE_DEBUG_DATA_LOW);
2181 s->idma_qid[i] = (debug11 >> (i * 16)) & 0xffff;
2183 CH_WARN(adap, "SGE idma%u, queue%u, maybe stuck state%u %dsecs (debug0=%#x, debug11=%#x)\n",
2184 i, s->idma_qid[i], s->idma_state[i],
2185 s->idma_stalled[i]/HZ, debug0, debug11);
2186 t4_sge_decode_idma_state(adap, s->idma_state[i]);
2189 mod_timer(&s->rx_timer, jiffies + RX_QCHECK_PERIOD);
2192 static void sge_tx_timer_cb(unsigned long data)
2195 unsigned int i, budget;
2196 struct adapter *adap = (struct adapter *)data;
2197 struct sge *s = &adap->sge;
2199 for (i = 0; i < ARRAY_SIZE(s->txq_maperr); i++)
2200 for (m = s->txq_maperr[i]; m; m &= m - 1) {
2201 unsigned long id = __ffs(m) + i * BITS_PER_LONG;
2202 struct sge_ofld_txq *txq = s->egr_map[id];
2204 clear_bit(id, s->txq_maperr);
2205 tasklet_schedule(&txq->qresume_tsk);
2208 budget = MAX_TIMER_TX_RECLAIM;
2209 i = s->ethtxq_rover;
2211 struct sge_eth_txq *q = &s->ethtxq[i];
2214 time_after_eq(jiffies, q->txq->trans_start + HZ / 100) &&
2215 __netif_tx_trylock(q->txq)) {
2216 int avail = reclaimable(&q->q);
2222 free_tx_desc(adap, &q->q, avail, true);
2223 q->q.in_use -= avail;
2226 __netif_tx_unlock(q->txq);
2229 if (++i >= s->ethqsets)
2231 } while (budget && i != s->ethtxq_rover);
2232 s->ethtxq_rover = i;
2233 mod_timer(&s->tx_timer, jiffies + (budget ? TX_QCHECK_PERIOD : 2));
2237 * udb_address - return the BAR2 User Doorbell address for a Queue
2238 * @adap: the adapter
2239 * @cntxt_id: the Queue Context ID
2240 * @qpp: Queues Per Page (for all PFs)
2242 * Returns the BAR2 address of the user Doorbell associated with the
2243 * indicated Queue Context ID. Note that this is only applicable
2246 static u64 udb_address(struct adapter *adap, unsigned int cntxt_id,
2251 unsigned short udb_density;
2252 unsigned long qpshift;
2255 BUG_ON(is_t4(adap->params.chip));
2257 s_qpp = (QUEUESPERPAGEPF0 +
2258 (QUEUESPERPAGEPF1 - QUEUESPERPAGEPF0) * adap->fn);
2259 udb_density = 1 << ((qpp >> s_qpp) & QUEUESPERPAGEPF0_MASK);
2260 qpshift = PAGE_SHIFT - ilog2(udb_density);
2261 udb = (u64)cntxt_id << qpshift;
2263 page = udb / PAGE_SIZE;
2264 udb += (cntxt_id - (page * udb_density)) * SGE_UDB_SIZE;
2269 static u64 udb_address_eq(struct adapter *adap, unsigned int cntxt_id)
2271 return udb_address(adap, cntxt_id,
2272 t4_read_reg(adap, SGE_EGRESS_QUEUES_PER_PAGE_PF));
2275 static u64 udb_address_iq(struct adapter *adap, unsigned int cntxt_id)
2277 return udb_address(adap, cntxt_id,
2278 t4_read_reg(adap, SGE_INGRESS_QUEUES_PER_PAGE_PF));
2281 int t4_sge_alloc_rxq(struct adapter *adap, struct sge_rspq *iq, bool fwevtq,
2282 struct net_device *dev, int intr_idx,
2283 struct sge_fl *fl, rspq_handler_t hnd)
2287 struct sge *s = &adap->sge;
2288 struct port_info *pi = netdev_priv(dev);
2290 /* Size needs to be multiple of 16, including status entry. */
2291 iq->size = roundup(iq->size, 16);
2293 iq->desc = alloc_ring(adap->pdev_dev, iq->size, iq->iqe_len, 0,
2294 &iq->phys_addr, NULL, 0, NUMA_NO_NODE);
2298 memset(&c, 0, sizeof(c));
2299 c.op_to_vfn = htonl(FW_CMD_OP(FW_IQ_CMD) | FW_CMD_REQUEST |
2300 FW_CMD_WRITE | FW_CMD_EXEC |
2301 FW_IQ_CMD_PFN(adap->fn) | FW_IQ_CMD_VFN(0));
2302 c.alloc_to_len16 = htonl(FW_IQ_CMD_ALLOC | FW_IQ_CMD_IQSTART(1) |
2304 c.type_to_iqandstindex = htonl(FW_IQ_CMD_TYPE(FW_IQ_TYPE_FL_INT_CAP) |
2305 FW_IQ_CMD_IQASYNCH(fwevtq) | FW_IQ_CMD_VIID(pi->viid) |
2306 FW_IQ_CMD_IQANDST(intr_idx < 0) | FW_IQ_CMD_IQANUD(1) |
2307 FW_IQ_CMD_IQANDSTINDEX(intr_idx >= 0 ? intr_idx :
2309 c.iqdroprss_to_iqesize = htons(FW_IQ_CMD_IQPCIECH(pi->tx_chan) |
2310 FW_IQ_CMD_IQGTSMODE |
2311 FW_IQ_CMD_IQINTCNTTHRESH(iq->pktcnt_idx) |
2312 FW_IQ_CMD_IQESIZE(ilog2(iq->iqe_len) - 4));
2313 c.iqsize = htons(iq->size);
2314 c.iqaddr = cpu_to_be64(iq->phys_addr);
2317 fl->size = roundup(fl->size, 8);
2318 fl->desc = alloc_ring(adap->pdev_dev, fl->size, sizeof(__be64),
2319 sizeof(struct rx_sw_desc), &fl->addr,
2320 &fl->sdesc, s->stat_len, NUMA_NO_NODE);
2324 flsz = fl->size / 8 + s->stat_len / sizeof(struct tx_desc);
2325 c.iqns_to_fl0congen = htonl(FW_IQ_CMD_FL0PACKEN(1) |
2326 FW_IQ_CMD_FL0FETCHRO(1) |
2327 FW_IQ_CMD_FL0DATARO(1) |
2328 FW_IQ_CMD_FL0PADEN(1));
2329 c.fl0dcaen_to_fl0cidxfthresh = htons(FW_IQ_CMD_FL0FBMIN(2) |
2330 FW_IQ_CMD_FL0FBMAX(3));
2331 c.fl0size = htons(flsz);
2332 c.fl0addr = cpu_to_be64(fl->addr);
2335 ret = t4_wr_mbox(adap, adap->fn, &c, sizeof(c), &c);
2339 netif_napi_add(dev, &iq->napi, napi_rx_handler, 64);
2340 iq->cur_desc = iq->desc;
2343 iq->next_intr_params = iq->intr_params;
2344 iq->cntxt_id = ntohs(c.iqid);
2345 iq->abs_id = ntohs(c.physiqid);
2346 if (!is_t4(adap->params.chip))
2347 iq->udb = udb_address_iq(adap, iq->cntxt_id);
2348 iq->size--; /* subtract status entry */
2352 /* set offset to -1 to distinguish ingress queues without FL */
2353 iq->offset = fl ? 0 : -1;
2355 adap->sge.ingr_map[iq->cntxt_id - adap->sge.ingr_start] = iq;
2358 fl->cntxt_id = ntohs(c.fl0id);
2359 fl->avail = fl->pend_cred = 0;
2360 fl->pidx = fl->cidx = 0;
2361 fl->alloc_failed = fl->large_alloc_failed = fl->starving = 0;
2362 adap->sge.egr_map[fl->cntxt_id - adap->sge.egr_start] = fl;
2364 /* Note, we must initialize the Free List User Doorbell
2365 * address before refilling the Free List!
2367 if (!is_t4(adap->params.chip))
2368 fl->udb = udb_address_eq(adap, fl->cntxt_id);
2369 refill_fl(adap, fl, fl_cap(fl), GFP_KERNEL);
2377 dma_free_coherent(adap->pdev_dev, iq->size * iq->iqe_len,
2378 iq->desc, iq->phys_addr);
2381 if (fl && fl->desc) {
2384 dma_free_coherent(adap->pdev_dev, flsz * sizeof(struct tx_desc),
2385 fl->desc, fl->addr);
2391 static void init_txq(struct adapter *adap, struct sge_txq *q, unsigned int id)
2394 if (!is_t4(adap->params.chip))
2395 q->udb = udb_address_eq(adap, q->cntxt_id);
2398 q->cidx = q->pidx = 0;
2399 q->stops = q->restarts = 0;
2400 q->stat = (void *)&q->desc[q->size];
2401 spin_lock_init(&q->db_lock);
2402 adap->sge.egr_map[id - adap->sge.egr_start] = q;
2405 int t4_sge_alloc_eth_txq(struct adapter *adap, struct sge_eth_txq *txq,
2406 struct net_device *dev, struct netdev_queue *netdevq,
2410 struct fw_eq_eth_cmd c;
2411 struct sge *s = &adap->sge;
2412 struct port_info *pi = netdev_priv(dev);
2414 /* Add status entries */
2415 nentries = txq->q.size + s->stat_len / sizeof(struct tx_desc);
2417 txq->q.desc = alloc_ring(adap->pdev_dev, txq->q.size,
2418 sizeof(struct tx_desc), sizeof(struct tx_sw_desc),
2419 &txq->q.phys_addr, &txq->q.sdesc, s->stat_len,
2420 netdev_queue_numa_node_read(netdevq));
2424 memset(&c, 0, sizeof(c));
2425 c.op_to_vfn = htonl(FW_CMD_OP(FW_EQ_ETH_CMD) | FW_CMD_REQUEST |
2426 FW_CMD_WRITE | FW_CMD_EXEC |
2427 FW_EQ_ETH_CMD_PFN(adap->fn) | FW_EQ_ETH_CMD_VFN(0));
2428 c.alloc_to_len16 = htonl(FW_EQ_ETH_CMD_ALLOC |
2429 FW_EQ_ETH_CMD_EQSTART | FW_LEN16(c));
2430 c.viid_pkd = htonl(FW_EQ_ETH_CMD_AUTOEQUEQE |
2431 FW_EQ_ETH_CMD_VIID(pi->viid));
2432 c.fetchszm_to_iqid = htonl(FW_EQ_ETH_CMD_HOSTFCMODE(2) |
2433 FW_EQ_ETH_CMD_PCIECHN(pi->tx_chan) |
2434 FW_EQ_ETH_CMD_FETCHRO(1) |
2435 FW_EQ_ETH_CMD_IQID(iqid));
2436 c.dcaen_to_eqsize = htonl(FW_EQ_ETH_CMD_FBMIN(2) |
2437 FW_EQ_ETH_CMD_FBMAX(3) |
2438 FW_EQ_ETH_CMD_CIDXFTHRESH(5) |
2439 FW_EQ_ETH_CMD_EQSIZE(nentries));
2440 c.eqaddr = cpu_to_be64(txq->q.phys_addr);
2442 ret = t4_wr_mbox(adap, adap->fn, &c, sizeof(c), &c);
2444 kfree(txq->q.sdesc);
2445 txq->q.sdesc = NULL;
2446 dma_free_coherent(adap->pdev_dev,
2447 nentries * sizeof(struct tx_desc),
2448 txq->q.desc, txq->q.phys_addr);
2453 init_txq(adap, &txq->q, FW_EQ_ETH_CMD_EQID_GET(ntohl(c.eqid_pkd)));
2455 txq->tso = txq->tx_cso = txq->vlan_ins = 0;
2456 txq->mapping_err = 0;
2460 int t4_sge_alloc_ctrl_txq(struct adapter *adap, struct sge_ctrl_txq *txq,
2461 struct net_device *dev, unsigned int iqid,
2462 unsigned int cmplqid)
2465 struct fw_eq_ctrl_cmd c;
2466 struct sge *s = &adap->sge;
2467 struct port_info *pi = netdev_priv(dev);
2469 /* Add status entries */
2470 nentries = txq->q.size + s->stat_len / sizeof(struct tx_desc);
2472 txq->q.desc = alloc_ring(adap->pdev_dev, nentries,
2473 sizeof(struct tx_desc), 0, &txq->q.phys_addr,
2474 NULL, 0, NUMA_NO_NODE);
2478 c.op_to_vfn = htonl(FW_CMD_OP(FW_EQ_CTRL_CMD) | FW_CMD_REQUEST |
2479 FW_CMD_WRITE | FW_CMD_EXEC |
2480 FW_EQ_CTRL_CMD_PFN(adap->fn) |
2481 FW_EQ_CTRL_CMD_VFN(0));
2482 c.alloc_to_len16 = htonl(FW_EQ_CTRL_CMD_ALLOC |
2483 FW_EQ_CTRL_CMD_EQSTART | FW_LEN16(c));
2484 c.cmpliqid_eqid = htonl(FW_EQ_CTRL_CMD_CMPLIQID(cmplqid));
2485 c.physeqid_pkd = htonl(0);
2486 c.fetchszm_to_iqid = htonl(FW_EQ_CTRL_CMD_HOSTFCMODE(2) |
2487 FW_EQ_CTRL_CMD_PCIECHN(pi->tx_chan) |
2488 FW_EQ_CTRL_CMD_FETCHRO |
2489 FW_EQ_CTRL_CMD_IQID(iqid));
2490 c.dcaen_to_eqsize = htonl(FW_EQ_CTRL_CMD_FBMIN(2) |
2491 FW_EQ_CTRL_CMD_FBMAX(3) |
2492 FW_EQ_CTRL_CMD_CIDXFTHRESH(5) |
2493 FW_EQ_CTRL_CMD_EQSIZE(nentries));
2494 c.eqaddr = cpu_to_be64(txq->q.phys_addr);
2496 ret = t4_wr_mbox(adap, adap->fn, &c, sizeof(c), &c);
2498 dma_free_coherent(adap->pdev_dev,
2499 nentries * sizeof(struct tx_desc),
2500 txq->q.desc, txq->q.phys_addr);
2505 init_txq(adap, &txq->q, FW_EQ_CTRL_CMD_EQID_GET(ntohl(c.cmpliqid_eqid)));
2507 skb_queue_head_init(&txq->sendq);
2508 tasklet_init(&txq->qresume_tsk, restart_ctrlq, (unsigned long)txq);
2513 int t4_sge_alloc_ofld_txq(struct adapter *adap, struct sge_ofld_txq *txq,
2514 struct net_device *dev, unsigned int iqid)
2517 struct fw_eq_ofld_cmd c;
2518 struct sge *s = &adap->sge;
2519 struct port_info *pi = netdev_priv(dev);
2521 /* Add status entries */
2522 nentries = txq->q.size + s->stat_len / sizeof(struct tx_desc);
2524 txq->q.desc = alloc_ring(adap->pdev_dev, txq->q.size,
2525 sizeof(struct tx_desc), sizeof(struct tx_sw_desc),
2526 &txq->q.phys_addr, &txq->q.sdesc, s->stat_len,
2531 memset(&c, 0, sizeof(c));
2532 c.op_to_vfn = htonl(FW_CMD_OP(FW_EQ_OFLD_CMD) | FW_CMD_REQUEST |
2533 FW_CMD_WRITE | FW_CMD_EXEC |
2534 FW_EQ_OFLD_CMD_PFN(adap->fn) |
2535 FW_EQ_OFLD_CMD_VFN(0));
2536 c.alloc_to_len16 = htonl(FW_EQ_OFLD_CMD_ALLOC |
2537 FW_EQ_OFLD_CMD_EQSTART | FW_LEN16(c));
2538 c.fetchszm_to_iqid = htonl(FW_EQ_OFLD_CMD_HOSTFCMODE(2) |
2539 FW_EQ_OFLD_CMD_PCIECHN(pi->tx_chan) |
2540 FW_EQ_OFLD_CMD_FETCHRO(1) |
2541 FW_EQ_OFLD_CMD_IQID(iqid));
2542 c.dcaen_to_eqsize = htonl(FW_EQ_OFLD_CMD_FBMIN(2) |
2543 FW_EQ_OFLD_CMD_FBMAX(3) |
2544 FW_EQ_OFLD_CMD_CIDXFTHRESH(5) |
2545 FW_EQ_OFLD_CMD_EQSIZE(nentries));
2546 c.eqaddr = cpu_to_be64(txq->q.phys_addr);
2548 ret = t4_wr_mbox(adap, adap->fn, &c, sizeof(c), &c);
2550 kfree(txq->q.sdesc);
2551 txq->q.sdesc = NULL;
2552 dma_free_coherent(adap->pdev_dev,
2553 nentries * sizeof(struct tx_desc),
2554 txq->q.desc, txq->q.phys_addr);
2559 init_txq(adap, &txq->q, FW_EQ_OFLD_CMD_EQID_GET(ntohl(c.eqid_pkd)));
2561 skb_queue_head_init(&txq->sendq);
2562 tasklet_init(&txq->qresume_tsk, restart_ofldq, (unsigned long)txq);
2564 txq->mapping_err = 0;
2568 static void free_txq(struct adapter *adap, struct sge_txq *q)
2570 struct sge *s = &adap->sge;
2572 dma_free_coherent(adap->pdev_dev,
2573 q->size * sizeof(struct tx_desc) + s->stat_len,
2574 q->desc, q->phys_addr);
2580 static void free_rspq_fl(struct adapter *adap, struct sge_rspq *rq,
2583 struct sge *s = &adap->sge;
2584 unsigned int fl_id = fl ? fl->cntxt_id : 0xffff;
2586 adap->sge.ingr_map[rq->cntxt_id - adap->sge.ingr_start] = NULL;
2587 t4_iq_free(adap, adap->fn, adap->fn, 0, FW_IQ_TYPE_FL_INT_CAP,
2588 rq->cntxt_id, fl_id, 0xffff);
2589 dma_free_coherent(adap->pdev_dev, (rq->size + 1) * rq->iqe_len,
2590 rq->desc, rq->phys_addr);
2591 netif_napi_del(&rq->napi);
2593 rq->cntxt_id = rq->abs_id = 0;
2597 free_rx_bufs(adap, fl, fl->avail);
2598 dma_free_coherent(adap->pdev_dev, fl->size * 8 + s->stat_len,
2599 fl->desc, fl->addr);
2608 * t4_free_ofld_rxqs - free a block of consecutive Rx queues
2609 * @adap: the adapter
2610 * @n: number of queues
2611 * @q: pointer to first queue
2613 * Release the resources of a consecutive block of offload Rx queues.
2615 void t4_free_ofld_rxqs(struct adapter *adap, int n, struct sge_ofld_rxq *q)
2617 for ( ; n; n--, q++)
2619 free_rspq_fl(adap, &q->rspq,
2620 q->fl.size ? &q->fl : NULL);
2624 * t4_free_sge_resources - free SGE resources
2625 * @adap: the adapter
2627 * Frees resources used by the SGE queue sets.
2629 void t4_free_sge_resources(struct adapter *adap)
2632 struct sge_eth_rxq *eq = adap->sge.ethrxq;
2633 struct sge_eth_txq *etq = adap->sge.ethtxq;
2635 /* clean up Ethernet Tx/Rx queues */
2636 for (i = 0; i < adap->sge.ethqsets; i++, eq++, etq++) {
2638 free_rspq_fl(adap, &eq->rspq,
2639 eq->fl.size ? &eq->fl : NULL);
2641 t4_eth_eq_free(adap, adap->fn, adap->fn, 0,
2643 free_tx_desc(adap, &etq->q, etq->q.in_use, true);
2644 kfree(etq->q.sdesc);
2645 free_txq(adap, &etq->q);
2649 /* clean up RDMA and iSCSI Rx queues */
2650 t4_free_ofld_rxqs(adap, adap->sge.ofldqsets, adap->sge.ofldrxq);
2651 t4_free_ofld_rxqs(adap, adap->sge.rdmaqs, adap->sge.rdmarxq);
2652 t4_free_ofld_rxqs(adap, adap->sge.rdmaciqs, adap->sge.rdmaciq);
2654 /* clean up offload Tx queues */
2655 for (i = 0; i < ARRAY_SIZE(adap->sge.ofldtxq); i++) {
2656 struct sge_ofld_txq *q = &adap->sge.ofldtxq[i];
2659 tasklet_kill(&q->qresume_tsk);
2660 t4_ofld_eq_free(adap, adap->fn, adap->fn, 0,
2662 free_tx_desc(adap, &q->q, q->q.in_use, false);
2664 __skb_queue_purge(&q->sendq);
2665 free_txq(adap, &q->q);
2669 /* clean up control Tx queues */
2670 for (i = 0; i < ARRAY_SIZE(adap->sge.ctrlq); i++) {
2671 struct sge_ctrl_txq *cq = &adap->sge.ctrlq[i];
2674 tasklet_kill(&cq->qresume_tsk);
2675 t4_ctrl_eq_free(adap, adap->fn, adap->fn, 0,
2677 __skb_queue_purge(&cq->sendq);
2678 free_txq(adap, &cq->q);
2682 if (adap->sge.fw_evtq.desc)
2683 free_rspq_fl(adap, &adap->sge.fw_evtq, NULL);
2685 if (adap->sge.intrq.desc)
2686 free_rspq_fl(adap, &adap->sge.intrq, NULL);
2688 /* clear the reverse egress queue map */
2689 memset(adap->sge.egr_map, 0, sizeof(adap->sge.egr_map));
2692 void t4_sge_start(struct adapter *adap)
2694 adap->sge.ethtxq_rover = 0;
2695 mod_timer(&adap->sge.rx_timer, jiffies + RX_QCHECK_PERIOD);
2696 mod_timer(&adap->sge.tx_timer, jiffies + TX_QCHECK_PERIOD);
2700 * t4_sge_stop - disable SGE operation
2701 * @adap: the adapter
2703 * Stop tasklets and timers associated with the DMA engine. Note that
2704 * this is effective only if measures have been taken to disable any HW
2705 * events that may restart them.
2707 void t4_sge_stop(struct adapter *adap)
2710 struct sge *s = &adap->sge;
2712 if (in_interrupt()) /* actions below require waiting */
2715 if (s->rx_timer.function)
2716 del_timer_sync(&s->rx_timer);
2717 if (s->tx_timer.function)
2718 del_timer_sync(&s->tx_timer);
2720 for (i = 0; i < ARRAY_SIZE(s->ofldtxq); i++) {
2721 struct sge_ofld_txq *q = &s->ofldtxq[i];
2724 tasklet_kill(&q->qresume_tsk);
2726 for (i = 0; i < ARRAY_SIZE(s->ctrlq); i++) {
2727 struct sge_ctrl_txq *cq = &s->ctrlq[i];
2730 tasklet_kill(&cq->qresume_tsk);
2735 * t4_sge_init - initialize SGE
2736 * @adap: the adapter
2738 * Performs SGE initialization needed every time after a chip reset.
2739 * We do not initialize any of the queues here, instead the driver
2740 * top-level must request them individually.
2742 * Called in two different modes:
2744 * 1. Perform actual hardware initialization and record hard-coded
2745 * parameters which were used. This gets used when we're the
2746 * Master PF and the Firmware Configuration File support didn't
2747 * work for some reason.
2749 * 2. We're not the Master PF or initialization was performed with
2750 * a Firmware Configuration File. In this case we need to grab
2751 * any of the SGE operating parameters that we need to have in
2752 * order to do our job and make sure we can live with them ...
2755 static int t4_sge_init_soft(struct adapter *adap)
2757 struct sge *s = &adap->sge;
2758 u32 fl_small_pg, fl_large_pg, fl_small_mtu, fl_large_mtu;
2759 u32 timer_value_0_and_1, timer_value_2_and_3, timer_value_4_and_5;
2760 u32 ingress_rx_threshold;
2763 * Verify that CPL messages are going to the Ingress Queue for
2764 * process_responses() and that only packet data is going to the
2767 if ((t4_read_reg(adap, SGE_CONTROL) & RXPKTCPLMODE_MASK) !=
2768 RXPKTCPLMODE(X_RXPKTCPLMODE_SPLIT)) {
2769 dev_err(adap->pdev_dev, "bad SGE CPL MODE\n");
2774 * Validate the Host Buffer Register Array indices that we want to
2777 * XXX Note that we should really read through the Host Buffer Size
2778 * XXX register array and find the indices of the Buffer Sizes which
2779 * XXX meet our needs!
2781 #define READ_FL_BUF(x) \
2782 t4_read_reg(adap, SGE_FL_BUFFER_SIZE0+(x)*sizeof(u32))
2784 fl_small_pg = READ_FL_BUF(RX_SMALL_PG_BUF);
2785 fl_large_pg = READ_FL_BUF(RX_LARGE_PG_BUF);
2786 fl_small_mtu = READ_FL_BUF(RX_SMALL_MTU_BUF);
2787 fl_large_mtu = READ_FL_BUF(RX_LARGE_MTU_BUF);
2789 /* We only bother using the Large Page logic if the Large Page Buffer
2790 * is larger than our Page Size Buffer.
2792 if (fl_large_pg <= fl_small_pg)
2797 /* The Page Size Buffer must be exactly equal to our Page Size and the
2798 * Large Page Size Buffer should be 0 (per above) or a power of 2.
2800 if (fl_small_pg != PAGE_SIZE ||
2801 (fl_large_pg & (fl_large_pg-1)) != 0) {
2802 dev_err(adap->pdev_dev, "bad SGE FL page buffer sizes [%d, %d]\n",
2803 fl_small_pg, fl_large_pg);
2807 s->fl_pg_order = ilog2(fl_large_pg) - PAGE_SHIFT;
2809 if (fl_small_mtu < FL_MTU_SMALL_BUFSIZE(adap) ||
2810 fl_large_mtu < FL_MTU_LARGE_BUFSIZE(adap)) {
2811 dev_err(adap->pdev_dev, "bad SGE FL MTU sizes [%d, %d]\n",
2812 fl_small_mtu, fl_large_mtu);
2817 * Retrieve our RX interrupt holdoff timer values and counter
2818 * threshold values from the SGE parameters.
2820 timer_value_0_and_1 = t4_read_reg(adap, SGE_TIMER_VALUE_0_AND_1);
2821 timer_value_2_and_3 = t4_read_reg(adap, SGE_TIMER_VALUE_2_AND_3);
2822 timer_value_4_and_5 = t4_read_reg(adap, SGE_TIMER_VALUE_4_AND_5);
2823 s->timer_val[0] = core_ticks_to_us(adap,
2824 TIMERVALUE0_GET(timer_value_0_and_1));
2825 s->timer_val[1] = core_ticks_to_us(adap,
2826 TIMERVALUE1_GET(timer_value_0_and_1));
2827 s->timer_val[2] = core_ticks_to_us(adap,
2828 TIMERVALUE2_GET(timer_value_2_and_3));
2829 s->timer_val[3] = core_ticks_to_us(adap,
2830 TIMERVALUE3_GET(timer_value_2_and_3));
2831 s->timer_val[4] = core_ticks_to_us(adap,
2832 TIMERVALUE4_GET(timer_value_4_and_5));
2833 s->timer_val[5] = core_ticks_to_us(adap,
2834 TIMERVALUE5_GET(timer_value_4_and_5));
2836 ingress_rx_threshold = t4_read_reg(adap, SGE_INGRESS_RX_THRESHOLD);
2837 s->counter_val[0] = THRESHOLD_0_GET(ingress_rx_threshold);
2838 s->counter_val[1] = THRESHOLD_1_GET(ingress_rx_threshold);
2839 s->counter_val[2] = THRESHOLD_2_GET(ingress_rx_threshold);
2840 s->counter_val[3] = THRESHOLD_3_GET(ingress_rx_threshold);
2845 static int t4_sge_init_hard(struct adapter *adap)
2847 struct sge *s = &adap->sge;
2850 * Set up our basic SGE mode to deliver CPL messages to our Ingress
2851 * Queue and Packet Date to the Free List.
2853 t4_set_reg_field(adap, SGE_CONTROL, RXPKTCPLMODE_MASK,
2857 * Set up to drop DOORBELL writes when the DOORBELL FIFO overflows
2858 * and generate an interrupt when this occurs so we can recover.
2860 if (is_t4(adap->params.chip)) {
2861 t4_set_reg_field(adap, A_SGE_DBFIFO_STATUS,
2862 V_HP_INT_THRESH(M_HP_INT_THRESH) |
2863 V_LP_INT_THRESH(M_LP_INT_THRESH),
2864 V_HP_INT_THRESH(dbfifo_int_thresh) |
2865 V_LP_INT_THRESH(dbfifo_int_thresh));
2867 t4_set_reg_field(adap, A_SGE_DBFIFO_STATUS,
2868 V_LP_INT_THRESH_T5(M_LP_INT_THRESH_T5),
2869 V_LP_INT_THRESH_T5(dbfifo_int_thresh));
2870 t4_set_reg_field(adap, SGE_DBFIFO_STATUS2,
2871 V_HP_INT_THRESH_T5(M_HP_INT_THRESH_T5),
2872 V_HP_INT_THRESH_T5(dbfifo_int_thresh));
2874 t4_set_reg_field(adap, A_SGE_DOORBELL_CONTROL, F_ENABLE_DROP,
2878 * SGE_FL_BUFFER_SIZE0 (RX_SMALL_PG_BUF) is set up by
2879 * t4_fixup_host_params().
2881 s->fl_pg_order = FL_PG_ORDER;
2884 SGE_FL_BUFFER_SIZE0+RX_LARGE_PG_BUF*sizeof(u32),
2885 PAGE_SIZE << FL_PG_ORDER);
2886 t4_write_reg(adap, SGE_FL_BUFFER_SIZE0+RX_SMALL_MTU_BUF*sizeof(u32),
2887 FL_MTU_SMALL_BUFSIZE(adap));
2888 t4_write_reg(adap, SGE_FL_BUFFER_SIZE0+RX_LARGE_MTU_BUF*sizeof(u32),
2889 FL_MTU_LARGE_BUFSIZE(adap));
2892 * Note that the SGE Ingress Packet Count Interrupt Threshold and
2893 * Timer Holdoff values must be supplied by our caller.
2895 t4_write_reg(adap, SGE_INGRESS_RX_THRESHOLD,
2896 THRESHOLD_0(s->counter_val[0]) |
2897 THRESHOLD_1(s->counter_val[1]) |
2898 THRESHOLD_2(s->counter_val[2]) |
2899 THRESHOLD_3(s->counter_val[3]));
2900 t4_write_reg(adap, SGE_TIMER_VALUE_0_AND_1,
2901 TIMERVALUE0(us_to_core_ticks(adap, s->timer_val[0])) |
2902 TIMERVALUE1(us_to_core_ticks(adap, s->timer_val[1])));
2903 t4_write_reg(adap, SGE_TIMER_VALUE_2_AND_3,
2904 TIMERVALUE2(us_to_core_ticks(adap, s->timer_val[2])) |
2905 TIMERVALUE3(us_to_core_ticks(adap, s->timer_val[3])));
2906 t4_write_reg(adap, SGE_TIMER_VALUE_4_AND_5,
2907 TIMERVALUE4(us_to_core_ticks(adap, s->timer_val[4])) |
2908 TIMERVALUE5(us_to_core_ticks(adap, s->timer_val[5])));
2913 int t4_sge_init(struct adapter *adap)
2915 struct sge *s = &adap->sge;
2916 u32 sge_control, sge_conm_ctrl;
2917 int ret, egress_threshold;
2920 * Ingress Padding Boundary and Egress Status Page Size are set up by
2921 * t4_fixup_host_params().
2923 sge_control = t4_read_reg(adap, SGE_CONTROL);
2924 s->pktshift = PKTSHIFT_GET(sge_control);
2925 s->stat_len = (sge_control & EGRSTATUSPAGESIZE_MASK) ? 128 : 64;
2926 s->fl_align = 1 << (INGPADBOUNDARY_GET(sge_control) +
2927 X_INGPADBOUNDARY_SHIFT);
2929 if (adap->flags & USING_SOFT_PARAMS)
2930 ret = t4_sge_init_soft(adap);
2932 ret = t4_sge_init_hard(adap);
2937 * A FL with <= fl_starve_thres buffers is starving and a periodic
2938 * timer will attempt to refill it. This needs to be larger than the
2939 * SGE's Egress Congestion Threshold. If it isn't, then we can get
2940 * stuck waiting for new packets while the SGE is waiting for us to
2941 * give it more Free List entries. (Note that the SGE's Egress
2942 * Congestion Threshold is in units of 2 Free List pointers.) For T4,
2943 * there was only a single field to control this. For T5 there's the
2944 * original field which now only applies to Unpacked Mode Free List
2945 * buffers and a new field which only applies to Packed Mode Free List
2948 sge_conm_ctrl = t4_read_reg(adap, SGE_CONM_CTRL);
2949 if (is_t4(adap->params.chip))
2950 egress_threshold = EGRTHRESHOLD_GET(sge_conm_ctrl);
2952 egress_threshold = EGRTHRESHOLDPACKING_GET(sge_conm_ctrl);
2953 s->fl_starve_thres = 2*egress_threshold + 1;
2955 setup_timer(&s->rx_timer, sge_rx_timer_cb, (unsigned long)adap);
2956 setup_timer(&s->tx_timer, sge_tx_timer_cb, (unsigned long)adap);
2957 s->idma_1s_thresh = core_ticks_per_usec(adap) * 1000000; /* 1 s */
2958 s->idma_stalled[0] = 0;
2959 s->idma_stalled[1] = 0;
2960 spin_lock_init(&s->intrq_lock);