2008-04-27 15:55:59 +04:00
|
|
|
/****************************************************************************
|
2013-08-30 02:32:48 +04:00
|
|
|
* Driver for Solarflare network controllers and boards
|
2008-04-27 15:55:59 +04:00
|
|
|
* Copyright 2005-2006 Fen Systems Ltd.
|
2013-08-30 02:32:48 +04:00
|
|
|
* Copyright 2005-2013 Solarflare Communications Inc.
|
2008-04-27 15:55:59 +04:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 as published
|
|
|
|
* by the Free Software Foundation, incorporated herein by reference.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/in.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 11:04:11 +03:00
|
|
|
#include <linux/slab.h>
|
2008-04-27 15:55:59 +04:00
|
|
|
#include <linux/ip.h>
|
2013-09-03 20:22:23 +04:00
|
|
|
#include <linux/ipv6.h>
|
2008-04-27 15:55:59 +04:00
|
|
|
#include <linux/tcp.h>
|
|
|
|
#include <linux/udp.h>
|
2011-05-23 00:47:17 +04:00
|
|
|
#include <linux/prefetch.h>
|
2011-09-16 03:46:05 +04:00
|
|
|
#include <linux/moduleparam.h>
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
#include <linux/iommu.h>
|
2008-04-27 15:55:59 +04:00
|
|
|
#include <net/ip.h>
|
|
|
|
#include <net/checksum.h>
|
|
|
|
#include "net_driver.h"
|
|
|
|
#include "efx.h"
|
2012-11-08 05:46:53 +04:00
|
|
|
#include "filter.h"
|
2009-11-29 18:12:08 +03:00
|
|
|
#include "nic.h"
|
2008-05-07 16:36:19 +04:00
|
|
|
#include "selftest.h"
|
2008-04-27 15:55:59 +04:00
|
|
|
#include "workarounds.h"
|
|
|
|
|
2013-02-13 14:54:41 +04:00
|
|
|
/* Preferred number of descriptors to fill at once */
|
|
|
|
#define EFX_RX_PREFERRED_BATCH 8U
|
2008-04-27 15:55:59 +04:00
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Number of RX buffers to recycle pages for. When creating the RX page recycle
|
|
|
|
* ring, this number is divided by the number of buffers per page to calculate
|
|
|
|
* the number of pages to store in the RX page recycle ring.
|
|
|
|
*/
|
|
|
|
#define EFX_RECYCLE_RING_SIZE_IOMMU 4096
|
2013-02-13 14:54:41 +04:00
|
|
|
#define EFX_RECYCLE_RING_SIZE_NOIOMMU (2 * EFX_RX_PREFERRED_BATCH)
|
2010-06-01 15:20:53 +04:00
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/* Size of buffer allocated for skb header area. */
|
2013-04-08 15:55:58 +04:00
|
|
|
#define EFX_SKB_HEADERS 128u
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* This is the percentage fill level below which new RX descriptors
|
|
|
|
* will be added to the RX descriptor ring.
|
|
|
|
*/
|
2012-04-11 16:12:41 +04:00
|
|
|
static unsigned int rx_refill_threshold;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
/* Each packet can consume up to ceil(max_frame_len / buffer_size) buffers */
|
|
|
|
#define EFX_RX_MAX_FRAGS DIV_ROUND_UP(EFX_MAX_FRAME_LEN(EFX_MAX_MTU), \
|
|
|
|
EFX_RX_USR_BUF_SIZE)
|
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/*
|
|
|
|
* RX maximum head room required.
|
|
|
|
*
|
2013-01-30 03:33:15 +04:00
|
|
|
* This must be at least 1 to prevent overflow, plus one packet-worth
|
|
|
|
* to allow pipelined receives.
|
2008-04-27 15:55:59 +04:00
|
|
|
*/
|
2013-01-30 03:33:15 +04:00
|
|
|
#define EFX_RXD_HEAD_ROOM (1 + EFX_RX_MAX_FRAGS)
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
static inline u8 *efx_rx_buf_va(struct efx_rx_buffer *buf)
|
2010-06-23 15:31:28 +04:00
|
|
|
{
|
2013-01-30 03:33:15 +04:00
|
|
|
return page_address(buf->page) + buf->page_offset;
|
2011-02-25 02:45:16 +03:00
|
|
|
}
|
|
|
|
|
2012-10-18 18:49:54 +04:00
|
|
|
static inline u32 efx_rx_buf_hash(struct efx_nic *efx, const u8 *eh)
|
2011-02-25 02:45:16 +03:00
|
|
|
{
|
2012-10-18 18:49:54 +04:00
|
|
|
#if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS)
|
|
|
|
return __le32_to_cpup((const __le32 *)(eh + efx->rx_packet_hash_offset));
|
2010-06-23 15:31:28 +04:00
|
|
|
#else
|
2012-10-18 18:49:54 +04:00
|
|
|
const u8 *data = eh + efx->rx_packet_hash_offset;
|
2012-01-05 22:54:04 +04:00
|
|
|
return (u32)data[0] |
|
|
|
|
(u32)data[1] << 8 |
|
|
|
|
(u32)data[2] << 16 |
|
|
|
|
(u32)data[3] << 24;
|
2010-06-23 15:31:28 +04:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
static inline struct efx_rx_buffer *
|
|
|
|
efx_rx_buf_next(struct efx_rx_queue *rx_queue, struct efx_rx_buffer *rx_buf)
|
|
|
|
{
|
|
|
|
if (unlikely(rx_buf == efx_rx_buffer(rx_queue, rx_queue->ptr_mask)))
|
|
|
|
return efx_rx_buffer(rx_queue, 0);
|
|
|
|
else
|
|
|
|
return rx_buf + 1;
|
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
static inline void efx_sync_rx_buffer(struct efx_nic *efx,
|
|
|
|
struct efx_rx_buffer *rx_buf,
|
|
|
|
unsigned int len)
|
|
|
|
{
|
|
|
|
dma_sync_single_for_cpu(&efx->pci_dev->dev, rx_buf->dma_addr, len,
|
|
|
|
DMA_FROM_DEVICE);
|
|
|
|
}
|
|
|
|
|
2013-02-13 14:54:41 +04:00
|
|
|
void efx_rx_config_page_split(struct efx_nic *efx)
|
|
|
|
{
|
2013-11-16 11:02:27 +04:00
|
|
|
efx->rx_page_buf_step = ALIGN(efx->rx_dma_len + efx->rx_ip_align,
|
sfc: Reduce RX scatter buffer size, and reduce alignment if appropriate
efx_start_datapath() asserts that we can fit 2 RX scatter buffers plus
a software structure, each appropriately aligned, into a single page.
Where L1_CACHE_BYTES == 256 and PAGE_SIZE == 4096, which is the case
on s390, this assertion fails.
The current scatter buffer size is also not a multiple of 64 or 128,
which are more common cache line sizes. If we can make both the start
and end of a scatter buffer cache-aligned, this will reduce the need
for read-modify-write operations on inter- processor links.
Fix the alignment by reducing EFX_RX_USR_BUF_SIZE to 2048 - 256 ==
1792. (We could use 2048 - L1_CACHE_BYTES, but EFX_RX_USR_BUF_SIZE
also affects user-level networking where a larger amount of
housekeeping data may be needed. Although this version of the driver
does not support user-level networking, I prefer to keep scattering
behaviour consistent with the out-of-tree version.)
This still doesn't fix the s390 build because like most architectures
it has NET_IP_ALIGN == 2. When NET_IP_ALIGN != 0 we cannot achieve
cache line alignment at either the start or end of a scatter buffer,
so there is actually no point in padding the buffers to a multiple of
the cache line size. All we need is 4-byte alignment of the network
header, so do that.
Adjust the assertions accordingly.
Reported-by: Geert Uytterhoeven <geert@linux-m68k.org>
Reported-by: Heiko Carstens <heiko.carstens@de.ibm.com>
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
Acked-by: Geert Uytterhoeven <geert@linux-m68k.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2013-05-13 16:01:22 +04:00
|
|
|
EFX_RX_BUF_ALIGNMENT);
|
2013-02-13 14:54:41 +04:00
|
|
|
efx->rx_bufs_per_page = efx->rx_buffer_order ? 1 :
|
|
|
|
((PAGE_SIZE - sizeof(struct efx_rx_page_state)) /
|
|
|
|
efx->rx_page_buf_step);
|
|
|
|
efx->rx_buffer_truesize = (PAGE_SIZE << efx->rx_buffer_order) /
|
|
|
|
efx->rx_bufs_per_page;
|
|
|
|
efx->rx_pages_per_batch = DIV_ROUND_UP(EFX_RX_PREFERRED_BATCH,
|
|
|
|
efx->rx_bufs_per_page);
|
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Check the RX page recycle ring for a page that can be reused. */
|
|
|
|
static struct page *efx_reuse_page(struct efx_rx_queue *rx_queue)
|
|
|
|
{
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
|
|
|
struct page *page;
|
|
|
|
struct efx_rx_page_state *state;
|
|
|
|
unsigned index;
|
|
|
|
|
|
|
|
index = rx_queue->page_remove & rx_queue->page_ptr_mask;
|
|
|
|
page = rx_queue->page_ring[index];
|
|
|
|
if (page == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
rx_queue->page_ring[index] = NULL;
|
|
|
|
/* page_remove cannot exceed page_add. */
|
|
|
|
if (rx_queue->page_remove != rx_queue->page_add)
|
|
|
|
++rx_queue->page_remove;
|
|
|
|
|
|
|
|
/* If page_count is 1 then we hold the only reference to this page. */
|
|
|
|
if (page_count(page) == 1) {
|
|
|
|
++rx_queue->page_recycle_count;
|
|
|
|
return page;
|
|
|
|
} else {
|
|
|
|
state = page_address(page);
|
|
|
|
dma_unmap_page(&efx->pci_dev->dev, state->dma_addr,
|
|
|
|
PAGE_SIZE << efx->rx_buffer_order,
|
|
|
|
DMA_FROM_DEVICE);
|
|
|
|
put_page(page);
|
|
|
|
++rx_queue->page_recycle_failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/**
|
2013-01-11 16:26:21 +04:00
|
|
|
* efx_init_rx_buffers - create EFX_RX_BATCH page-based RX buffers
|
2008-04-27 15:55:59 +04:00
|
|
|
*
|
|
|
|
* @rx_queue: Efx RX queue
|
|
|
|
*
|
2013-02-13 14:54:41 +04:00
|
|
|
* This allocates a batch of pages, maps them for DMA, and populates
|
|
|
|
* struct efx_rx_buffers for each one. Return a negative error code or
|
|
|
|
* 0 on success. If a single page can be used for multiple buffers,
|
|
|
|
* then the page will either be inserted fully, or not at all.
|
2008-04-27 15:55:59 +04:00
|
|
|
*/
|
2013-10-02 14:04:14 +04:00
|
|
|
static int efx_init_rx_buffers(struct efx_rx_queue *rx_queue, bool atomic)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
2010-06-01 15:33:17 +04:00
|
|
|
struct efx_rx_buffer *rx_buf;
|
|
|
|
struct page *page;
|
2013-01-11 03:51:54 +04:00
|
|
|
unsigned int page_offset;
|
2010-06-01 15:20:53 +04:00
|
|
|
struct efx_rx_page_state *state;
|
2010-06-01 15:33:17 +04:00
|
|
|
dma_addr_t dma_addr;
|
|
|
|
unsigned index, count;
|
|
|
|
|
2013-02-13 14:54:41 +04:00
|
|
|
count = 0;
|
|
|
|
do {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
page = efx_reuse_page(rx_queue);
|
|
|
|
if (page == NULL) {
|
2013-10-02 14:04:14 +04:00
|
|
|
page = alloc_pages(__GFP_COLD | __GFP_COMP |
|
|
|
|
(atomic ? GFP_ATOMIC : GFP_KERNEL),
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx->rx_buffer_order);
|
|
|
|
if (unlikely(page == NULL))
|
|
|
|
return -ENOMEM;
|
|
|
|
dma_addr =
|
|
|
|
dma_map_page(&efx->pci_dev->dev, page, 0,
|
|
|
|
PAGE_SIZE << efx->rx_buffer_order,
|
|
|
|
DMA_FROM_DEVICE);
|
|
|
|
if (unlikely(dma_mapping_error(&efx->pci_dev->dev,
|
|
|
|
dma_addr))) {
|
|
|
|
__free_pages(page, efx->rx_buffer_order);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
state = page_address(page);
|
|
|
|
state->dma_addr = dma_addr;
|
|
|
|
} else {
|
|
|
|
state = page_address(page);
|
|
|
|
dma_addr = state->dma_addr;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
2010-06-01 15:20:53 +04:00
|
|
|
|
|
|
|
dma_addr += sizeof(struct efx_rx_page_state);
|
2013-01-11 03:51:54 +04:00
|
|
|
page_offset = sizeof(struct efx_rx_page_state);
|
2010-06-01 15:33:17 +04:00
|
|
|
|
2013-02-13 14:54:41 +04:00
|
|
|
do {
|
|
|
|
index = rx_queue->added_count & rx_queue->ptr_mask;
|
|
|
|
rx_buf = efx_rx_buffer(rx_queue, index);
|
2013-11-16 11:02:27 +04:00
|
|
|
rx_buf->dma_addr = dma_addr + efx->rx_ip_align;
|
2013-02-13 14:54:41 +04:00
|
|
|
rx_buf->page = page;
|
2013-11-16 11:02:27 +04:00
|
|
|
rx_buf->page_offset = page_offset + efx->rx_ip_align;
|
2013-02-13 14:54:41 +04:00
|
|
|
rx_buf->len = efx->rx_dma_len;
|
2013-03-07 20:31:17 +04:00
|
|
|
rx_buf->flags = 0;
|
2013-02-13 14:54:41 +04:00
|
|
|
++rx_queue->added_count;
|
|
|
|
get_page(page);
|
|
|
|
dma_addr += efx->rx_page_buf_step;
|
|
|
|
page_offset += efx->rx_page_buf_step;
|
|
|
|
} while (page_offset + efx->rx_page_buf_step <= PAGE_SIZE);
|
2013-03-07 20:31:17 +04:00
|
|
|
|
|
|
|
rx_buf->flags = EFX_RX_BUF_LAST_IN_PAGE;
|
2013-02-13 14:54:41 +04:00
|
|
|
} while (++count < efx->rx_pages_per_batch);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Unmap a DMA-mapped page. This function is only called for the final RX
|
|
|
|
* buffer in a page.
|
|
|
|
*/
|
2008-09-01 15:47:12 +04:00
|
|
|
static void efx_unmap_rx_buffer(struct efx_nic *efx,
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
struct efx_rx_buffer *rx_buf)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
struct page *page = rx_buf->page;
|
|
|
|
|
|
|
|
if (page) {
|
|
|
|
struct efx_rx_page_state *state = page_address(page);
|
|
|
|
dma_unmap_page(&efx->pci_dev->dev,
|
|
|
|
state->dma_addr,
|
|
|
|
PAGE_SIZE << efx->rx_buffer_order,
|
|
|
|
DMA_FROM_DEVICE);
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
static void efx_free_rx_buffer(struct efx_rx_buffer *rx_buf)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
2013-01-11 16:26:21 +04:00
|
|
|
if (rx_buf->page) {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
put_page(rx_buf->page);
|
2013-01-11 16:26:21 +04:00
|
|
|
rx_buf->page = NULL;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Attempt to recycle the page if there is an RX recycle ring; the page can
|
|
|
|
* only be added if this is the final RX buffer, to prevent pages being used in
|
|
|
|
* the descriptor ring and appearing in the recycle ring simultaneously.
|
|
|
|
*/
|
|
|
|
static void efx_recycle_rx_page(struct efx_channel *channel,
|
|
|
|
struct efx_rx_buffer *rx_buf)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
struct page *page = rx_buf->page;
|
|
|
|
struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel);
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
|
|
|
unsigned index;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Only recycle the page after processing the final buffer. */
|
2013-03-07 20:31:17 +04:00
|
|
|
if (!(rx_buf->flags & EFX_RX_BUF_LAST_IN_PAGE))
|
2010-06-01 15:20:53 +04:00
|
|
|
return;
|
2010-06-01 15:20:34 +04:00
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
index = rx_queue->page_add & rx_queue->page_ptr_mask;
|
|
|
|
if (rx_queue->page_ring[index] == NULL) {
|
|
|
|
unsigned read_index = rx_queue->page_remove &
|
|
|
|
rx_queue->page_ptr_mask;
|
2010-06-01 15:20:34 +04:00
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* The next slot in the recycle ring is available, but
|
|
|
|
* increment page_remove if the read pointer currently
|
|
|
|
* points here.
|
|
|
|
*/
|
|
|
|
if (read_index == index)
|
|
|
|
++rx_queue->page_remove;
|
|
|
|
rx_queue->page_ring[index] = page;
|
|
|
|
++rx_queue->page_add;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
++rx_queue->page_recycle_full;
|
|
|
|
efx_unmap_rx_buffer(efx, rx_buf);
|
|
|
|
put_page(rx_buf->page);
|
2010-06-01 15:20:34 +04:00
|
|
|
}
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
static void efx_fini_rx_buffer(struct efx_rx_queue *rx_queue,
|
|
|
|
struct efx_rx_buffer *rx_buf)
|
|
|
|
{
|
|
|
|
/* Release the page reference we hold for the buffer. */
|
|
|
|
if (rx_buf->page)
|
|
|
|
put_page(rx_buf->page);
|
|
|
|
|
|
|
|
/* If this is the last buffer in a page, unmap and free it. */
|
2013-03-07 20:31:17 +04:00
|
|
|
if (rx_buf->flags & EFX_RX_BUF_LAST_IN_PAGE) {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_unmap_rx_buffer(rx_queue->efx, rx_buf);
|
|
|
|
efx_free_rx_buffer(rx_buf);
|
|
|
|
}
|
|
|
|
rx_buf->page = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Recycle the pages that are used by buffers that have just been received. */
|
2013-07-05 02:48:46 +04:00
|
|
|
static void efx_recycle_rx_pages(struct efx_channel *channel,
|
|
|
|
struct efx_rx_buffer *rx_buf,
|
|
|
|
unsigned int n_frags)
|
2010-06-01 15:20:34 +04:00
|
|
|
{
|
2010-09-10 10:41:47 +04:00
|
|
|
struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel);
|
2010-06-01 15:20:34 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
do {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_recycle_rx_page(channel, rx_buf);
|
2013-01-30 03:33:15 +04:00
|
|
|
rx_buf = efx_rx_buf_next(rx_queue, rx_buf);
|
|
|
|
} while (--n_frags);
|
2010-06-01 15:20:34 +04:00
|
|
|
}
|
|
|
|
|
2013-07-05 02:48:46 +04:00
|
|
|
static void efx_discard_rx_packet(struct efx_channel *channel,
|
|
|
|
struct efx_rx_buffer *rx_buf,
|
|
|
|
unsigned int n_frags)
|
|
|
|
{
|
|
|
|
struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel);
|
|
|
|
|
|
|
|
efx_recycle_rx_pages(channel, rx_buf, n_frags);
|
|
|
|
|
|
|
|
do {
|
|
|
|
efx_free_rx_buffer(rx_buf);
|
|
|
|
rx_buf = efx_rx_buf_next(rx_queue, rx_buf);
|
|
|
|
} while (--n_frags);
|
|
|
|
}
|
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/**
|
|
|
|
* efx_fast_push_rx_descriptors - push new RX descriptors quickly
|
|
|
|
* @rx_queue: RX descriptor queue
|
2012-07-10 14:56:00 +04:00
|
|
|
*
|
2008-04-27 15:55:59 +04:00
|
|
|
* This will aim to fill the RX descriptor queue up to
|
2012-04-11 16:09:24 +04:00
|
|
|
* @rx_queue->@max_fill. If there is insufficient atomic
|
2010-06-01 15:19:39 +04:00
|
|
|
* memory to do so, a slow fill will be scheduled.
|
|
|
|
*
|
|
|
|
* The caller must provide serialisation (none is used here). In practise,
|
|
|
|
* this means this function must run from the NAPI handler, or be called
|
|
|
|
* when NAPI is disabled.
|
2008-04-27 15:55:59 +04:00
|
|
|
*/
|
2013-10-02 14:04:14 +04:00
|
|
|
void efx_fast_push_rx_descriptors(struct efx_rx_queue *rx_queue, bool atomic)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
2013-02-13 14:54:41 +04:00
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
|
|
|
unsigned int fill_level, batch_size;
|
2010-06-01 15:33:17 +04:00
|
|
|
int space, rc = 0;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-05-27 19:52:54 +04:00
|
|
|
if (!rx_queue->refill_enabled)
|
|
|
|
return;
|
|
|
|
|
2010-06-01 15:19:39 +04:00
|
|
|
/* Calculate current fill level, and exit if we don't need to fill */
|
2008-04-27 15:55:59 +04:00
|
|
|
fill_level = (rx_queue->added_count - rx_queue->removed_count);
|
2010-09-10 10:42:22 +04:00
|
|
|
EFX_BUG_ON_PARANOID(fill_level > rx_queue->efx->rxq_entries);
|
2008-04-27 15:55:59 +04:00
|
|
|
if (fill_level >= rx_queue->fast_fill_trigger)
|
2010-06-01 15:20:34 +04:00
|
|
|
goto out;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Record minimum fill level */
|
2008-05-17 00:15:49 +04:00
|
|
|
if (unlikely(fill_level < rx_queue->min_fill)) {
|
2008-04-27 15:55:59 +04:00
|
|
|
if (fill_level)
|
|
|
|
rx_queue->min_fill = fill_level;
|
2008-05-17 00:15:49 +04:00
|
|
|
}
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-02-13 14:54:41 +04:00
|
|
|
batch_size = efx->rx_pages_per_batch * efx->rx_bufs_per_page;
|
2012-04-11 16:09:24 +04:00
|
|
|
space = rx_queue->max_fill - fill_level;
|
2013-02-13 14:54:41 +04:00
|
|
|
EFX_BUG_ON_PARANOID(space < batch_size);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_vdbg(rx_queue->efx, rx_status, rx_queue->efx->net_dev,
|
|
|
|
"RX queue %d fast-filling descriptor ring from"
|
2013-01-11 16:26:21 +04:00
|
|
|
" level %d to level %d\n",
|
2010-09-10 10:41:36 +04:00
|
|
|
efx_rx_queue_index(rx_queue), fill_level,
|
2013-01-11 16:26:21 +04:00
|
|
|
rx_queue->max_fill);
|
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
do {
|
2013-10-02 14:04:14 +04:00
|
|
|
rc = efx_init_rx_buffers(rx_queue, atomic);
|
2010-06-01 15:33:17 +04:00
|
|
|
if (unlikely(rc)) {
|
|
|
|
/* Ensure that we don't leave the rx queue empty */
|
|
|
|
if (rx_queue->added_count == rx_queue->removed_count)
|
|
|
|
efx_schedule_slow_fill(rx_queue);
|
|
|
|
goto out;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
2013-02-13 14:54:41 +04:00
|
|
|
} while ((space -= batch_size) >= batch_size);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_vdbg(rx_queue->efx, rx_status, rx_queue->efx->net_dev,
|
|
|
|
"RX queue %d fast-filled descriptor ring "
|
2010-09-10 10:41:36 +04:00
|
|
|
"to level %d\n", efx_rx_queue_index(rx_queue),
|
2010-06-23 15:30:07 +04:00
|
|
|
rx_queue->added_count - rx_queue->removed_count);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
out:
|
2010-06-01 15:20:34 +04:00
|
|
|
if (rx_queue->notified_count != rx_queue->added_count)
|
|
|
|
efx_nic_notify_rx_desc(rx_queue);
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
2010-06-01 15:19:39 +04:00
|
|
|
void efx_rx_slow_fill(unsigned long context)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
2010-06-01 15:19:39 +04:00
|
|
|
struct efx_rx_queue *rx_queue = (struct efx_rx_queue *)context;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-01 15:19:39 +04:00
|
|
|
/* Post an event to cause NAPI to run and refill the queue */
|
2012-02-08 03:49:52 +04:00
|
|
|
efx_nic_generate_fill_event(rx_queue);
|
2008-04-27 15:55:59 +04:00
|
|
|
++rx_queue->slow_fill_count;
|
|
|
|
}
|
|
|
|
|
2008-09-01 15:47:12 +04:00
|
|
|
static void efx_rx_packet__check_len(struct efx_rx_queue *rx_queue,
|
|
|
|
struct efx_rx_buffer *rx_buf,
|
2013-01-11 16:26:21 +04:00
|
|
|
int len)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
|
|
|
unsigned max_len = rx_buf->len - efx->type->rx_buffer_padding;
|
|
|
|
|
|
|
|
if (likely(len <= max_len))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* The packet must be discarded, but this is only a fatal error
|
|
|
|
* if the caller indicated it was
|
|
|
|
*/
|
2011-08-26 21:05:11 +04:00
|
|
|
rx_buf->flags |= EFX_RX_PKT_DISCARD;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
if ((len > rx_buf->len) && EFX_WORKAROUND_8071(efx)) {
|
2010-06-23 15:30:07 +04:00
|
|
|
if (net_ratelimit())
|
|
|
|
netif_err(efx, rx_err, efx->net_dev,
|
|
|
|
" RX queue %d seriously overlength "
|
|
|
|
"RX event (0x%x > 0x%x+0x%x). Leaking\n",
|
2010-09-10 10:41:36 +04:00
|
|
|
efx_rx_queue_index(rx_queue), len, max_len,
|
2010-06-23 15:30:07 +04:00
|
|
|
efx->type->rx_buffer_padding);
|
2008-04-27 15:55:59 +04:00
|
|
|
efx_schedule_reset(efx, RESET_TYPE_RX_RECOVERY);
|
|
|
|
} else {
|
2010-06-23 15:30:07 +04:00
|
|
|
if (net_ratelimit())
|
|
|
|
netif_err(efx, rx_err, efx->net_dev,
|
|
|
|
" RX queue %d overlength RX event "
|
|
|
|
"(0x%x > 0x%x)\n",
|
2010-09-10 10:41:36 +04:00
|
|
|
efx_rx_queue_index(rx_queue), len, max_len);
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
2010-09-10 10:41:36 +04:00
|
|
|
efx_rx_queue_channel(rx_queue)->n_rx_overlength++;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
2012-02-25 05:58:35 +04:00
|
|
|
/* Pass a received packet up through GRO. GRO can handle pages
|
|
|
|
* regardless of checksum state and skbs with a good checksum.
|
2008-04-27 15:55:59 +04:00
|
|
|
*/
|
2013-01-30 03:33:15 +04:00
|
|
|
static void
|
|
|
|
efx_rx_packet_gro(struct efx_channel *channel, struct efx_rx_buffer *rx_buf,
|
|
|
|
unsigned int n_frags, u8 *eh)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
2009-01-19 08:50:16 +03:00
|
|
|
struct napi_struct *napi = &channel->napi_str;
|
2009-10-29 10:21:24 +03:00
|
|
|
gro_result_t gro_result;
|
2013-01-11 16:26:21 +04:00
|
|
|
struct efx_nic *efx = channel->efx;
|
|
|
|
struct sk_buff *skb;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-11 16:26:21 +04:00
|
|
|
skb = napi_get_frags(napi);
|
2013-01-30 03:33:15 +04:00
|
|
|
if (unlikely(!skb)) {
|
|
|
|
while (n_frags--) {
|
|
|
|
put_page(rx_buf->page);
|
|
|
|
rx_buf->page = NULL;
|
|
|
|
rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf);
|
|
|
|
}
|
2013-01-11 16:26:21 +04:00
|
|
|
return;
|
|
|
|
}
|
2009-04-16 13:02:07 +04:00
|
|
|
|
2013-01-11 16:26:21 +04:00
|
|
|
if (efx->net_dev->features & NETIF_F_RXHASH)
|
2013-12-18 11:31:50 +04:00
|
|
|
skb_set_hash(skb, efx_rx_buf_hash(efx, eh),
|
|
|
|
PKT_HASH_TYPE_L3);
|
2013-01-11 16:26:21 +04:00
|
|
|
skb->ip_summed = ((rx_buf->flags & EFX_RX_PKT_CSUMMED) ?
|
|
|
|
CHECKSUM_UNNECESSARY : CHECKSUM_NONE);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
for (;;) {
|
|
|
|
skb_fill_page_desc(skb, skb_shinfo(skb)->nr_frags,
|
|
|
|
rx_buf->page, rx_buf->page_offset,
|
|
|
|
rx_buf->len);
|
|
|
|
rx_buf->page = NULL;
|
|
|
|
skb->len += rx_buf->len;
|
|
|
|
if (skb_shinfo(skb)->nr_frags == n_frags)
|
|
|
|
break;
|
2009-11-23 19:02:40 +03:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
skb->data_len = skb->len;
|
|
|
|
skb->truesize += n_frags * efx->rx_buffer_truesize;
|
|
|
|
|
|
|
|
skb_record_rx_queue(skb, channel->rx_queue.core_index);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
gro_result = napi_gro_frags(napi);
|
2013-01-11 16:26:21 +04:00
|
|
|
if (gro_result != GRO_DROP)
|
|
|
|
channel->irq_mod_score += 2;
|
|
|
|
}
|
2009-11-23 19:02:25 +03:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
/* Allocate and construct an SKB around page fragments */
|
2013-01-11 16:26:21 +04:00
|
|
|
static struct sk_buff *efx_rx_mk_skb(struct efx_channel *channel,
|
|
|
|
struct efx_rx_buffer *rx_buf,
|
2013-01-30 03:33:15 +04:00
|
|
|
unsigned int n_frags,
|
2013-01-11 16:26:21 +04:00
|
|
|
u8 *eh, int hdr_len)
|
|
|
|
{
|
|
|
|
struct efx_nic *efx = channel->efx;
|
|
|
|
struct sk_buff *skb;
|
2009-10-29 10:21:24 +03:00
|
|
|
|
2013-01-11 16:26:21 +04:00
|
|
|
/* Allocate an SKB to store the headers */
|
2013-11-28 22:58:11 +04:00
|
|
|
skb = netdev_alloc_skb(efx->net_dev,
|
|
|
|
efx->rx_ip_align + efx->rx_prefix_size +
|
|
|
|
hdr_len);
|
2013-01-11 16:26:21 +04:00
|
|
|
if (unlikely(skb == NULL))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
EFX_BUG_ON_PARANOID(rx_buf->len < hdr_len);
|
|
|
|
|
2013-11-28 22:58:11 +04:00
|
|
|
memcpy(skb->data + efx->rx_ip_align, eh - efx->rx_prefix_size,
|
|
|
|
efx->rx_prefix_size + hdr_len);
|
|
|
|
skb_reserve(skb, efx->rx_ip_align + efx->rx_prefix_size);
|
|
|
|
__skb_put(skb, hdr_len);
|
2013-01-11 16:26:21 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
/* Append the remaining page(s) onto the frag list */
|
2013-01-11 16:26:21 +04:00
|
|
|
if (rx_buf->len > hdr_len) {
|
2013-01-30 03:33:15 +04:00
|
|
|
rx_buf->page_offset += hdr_len;
|
|
|
|
rx_buf->len -= hdr_len;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
skb_fill_page_desc(skb, skb_shinfo(skb)->nr_frags,
|
|
|
|
rx_buf->page, rx_buf->page_offset,
|
|
|
|
rx_buf->len);
|
|
|
|
rx_buf->page = NULL;
|
|
|
|
skb->len += rx_buf->len;
|
|
|
|
skb->data_len += rx_buf->len;
|
|
|
|
if (skb_shinfo(skb)->nr_frags == n_frags)
|
|
|
|
break;
|
|
|
|
|
|
|
|
rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf);
|
|
|
|
}
|
2013-01-11 16:26:21 +04:00
|
|
|
} else {
|
|
|
|
__free_pages(rx_buf->page, efx->rx_buffer_order);
|
2013-01-30 03:33:15 +04:00
|
|
|
rx_buf->page = NULL;
|
|
|
|
n_frags = 0;
|
2009-10-29 10:21:24 +03:00
|
|
|
}
|
2013-01-11 16:26:21 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
skb->truesize += n_frags * efx->rx_buffer_truesize;
|
2013-01-11 16:26:21 +04:00
|
|
|
|
|
|
|
/* Move past the ethernet header */
|
|
|
|
skb->protocol = eth_type_trans(skb, efx->net_dev);
|
|
|
|
|
|
|
|
return skb;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void efx_rx_packet(struct efx_rx_queue *rx_queue, unsigned int index,
|
2013-01-30 03:33:15 +04:00
|
|
|
unsigned int n_frags, unsigned int len, u16 flags)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
2010-09-10 10:41:36 +04:00
|
|
|
struct efx_channel *channel = efx_rx_queue_channel(rx_queue);
|
2008-04-27 15:55:59 +04:00
|
|
|
struct efx_rx_buffer *rx_buf;
|
|
|
|
|
|
|
|
rx_buf = efx_rx_buffer(rx_queue, index);
|
2013-03-07 20:31:17 +04:00
|
|
|
rx_buf->flags |= flags;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
/* Validate the number of fragments and completed length */
|
|
|
|
if (n_frags == 1) {
|
2013-04-27 04:55:18 +04:00
|
|
|
if (!(flags & EFX_RX_PKT_PREFIX_LEN))
|
|
|
|
efx_rx_packet__check_len(rx_queue, rx_buf, len);
|
2013-01-30 03:33:15 +04:00
|
|
|
} else if (unlikely(n_frags > EFX_RX_MAX_FRAGS) ||
|
2013-03-08 14:18:28 +04:00
|
|
|
unlikely(len <= (n_frags - 1) * efx->rx_dma_len) ||
|
|
|
|
unlikely(len > n_frags * efx->rx_dma_len) ||
|
2013-01-30 03:33:15 +04:00
|
|
|
unlikely(!efx->rx_scatter)) {
|
|
|
|
/* If this isn't an explicit discard request, either
|
|
|
|
* the hardware or the driver is broken.
|
|
|
|
*/
|
|
|
|
WARN_ON(!(len == 0 && rx_buf->flags & EFX_RX_PKT_DISCARD));
|
|
|
|
rx_buf->flags |= EFX_RX_PKT_DISCARD;
|
|
|
|
}
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_vdbg(efx, rx_status, efx->net_dev,
|
2013-01-30 03:33:15 +04:00
|
|
|
"RX queue %d received ids %x-%x len %d %s%s\n",
|
2010-09-10 10:41:36 +04:00
|
|
|
efx_rx_queue_index(rx_queue), index,
|
2013-01-30 03:33:15 +04:00
|
|
|
(index + n_frags - 1) & rx_queue->ptr_mask, len,
|
2011-08-26 21:05:11 +04:00
|
|
|
(rx_buf->flags & EFX_RX_PKT_CSUMMED) ? " [SUMMED]" : "",
|
|
|
|
(rx_buf->flags & EFX_RX_PKT_DISCARD) ? " [DISCARD]" : "");
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
/* Discard packet, if instructed to do so. Process the
|
|
|
|
* previous receive first.
|
|
|
|
*/
|
2011-08-26 21:05:11 +04:00
|
|
|
if (unlikely(rx_buf->flags & EFX_RX_PKT_DISCARD)) {
|
2013-01-30 03:33:15 +04:00
|
|
|
efx_rx_flush_packet(channel);
|
2013-07-05 02:48:46 +04:00
|
|
|
efx_discard_rx_packet(channel, rx_buf, n_frags);
|
2013-01-30 03:33:15 +04:00
|
|
|
return;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
2013-04-27 04:55:18 +04:00
|
|
|
if (n_frags == 1 && !(flags & EFX_RX_PKT_PREFIX_LEN))
|
2013-01-30 03:33:15 +04:00
|
|
|
rx_buf->len = len;
|
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Release and/or sync the DMA mapping - assumes all RX buffers
|
|
|
|
* consumed in-order per RX queue.
|
2008-04-27 15:55:59 +04:00
|
|
|
*/
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_sync_rx_buffer(efx, rx_buf, rx_buf->len);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Prefetch nice and early so data will (hopefully) be in cache by
|
|
|
|
* the time we look at it.
|
|
|
|
*/
|
2013-01-30 03:33:15 +04:00
|
|
|
prefetch(efx_rx_buf_va(rx_buf));
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2012-10-18 18:49:54 +04:00
|
|
|
rx_buf->page_offset += efx->rx_prefix_size;
|
|
|
|
rx_buf->len -= efx->rx_prefix_size;
|
2013-01-30 03:33:15 +04:00
|
|
|
|
|
|
|
if (n_frags > 1) {
|
|
|
|
/* Release/sync DMA mapping for additional fragments.
|
|
|
|
* Fix length for last fragment.
|
|
|
|
*/
|
|
|
|
unsigned int tail_frags = n_frags - 1;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
rx_buf = efx_rx_buf_next(rx_queue, rx_buf);
|
|
|
|
if (--tail_frags == 0)
|
|
|
|
break;
|
2013-03-08 14:18:28 +04:00
|
|
|
efx_sync_rx_buffer(efx, rx_buf, efx->rx_dma_len);
|
2013-01-30 03:33:15 +04:00
|
|
|
}
|
2013-03-08 14:18:28 +04:00
|
|
|
rx_buf->len = len - (n_frags - 1) * efx->rx_dma_len;
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_sync_rx_buffer(efx, rx_buf, rx_buf->len);
|
2013-01-30 03:33:15 +04:00
|
|
|
}
|
2013-01-30 03:33:15 +04:00
|
|
|
|
2013-07-05 02:48:46 +04:00
|
|
|
/* All fragments have been DMA-synced, so recycle pages. */
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
rx_buf = efx_rx_buffer(rx_queue, index);
|
2013-07-05 02:48:46 +04:00
|
|
|
efx_recycle_rx_pages(channel, rx_buf, n_frags);
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/* Pipeline receives so that we give time for packet headers to be
|
|
|
|
* prefetched into cache.
|
|
|
|
*/
|
2013-01-30 03:33:14 +04:00
|
|
|
efx_rx_flush_packet(channel);
|
2013-01-30 03:33:15 +04:00
|
|
|
channel->rx_pkt_n_frags = n_frags;
|
|
|
|
channel->rx_pkt_index = index;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
2013-01-11 16:26:21 +04:00
|
|
|
static void efx_rx_deliver(struct efx_channel *channel, u8 *eh,
|
2013-01-30 03:33:15 +04:00
|
|
|
struct efx_rx_buffer *rx_buf,
|
|
|
|
unsigned int n_frags)
|
2012-01-24 02:41:30 +04:00
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
2013-01-11 16:26:21 +04:00
|
|
|
u16 hdr_len = min_t(u16, rx_buf->len, EFX_SKB_HEADERS);
|
2012-01-24 02:41:30 +04:00
|
|
|
|
2013-01-30 03:33:15 +04:00
|
|
|
skb = efx_rx_mk_skb(channel, rx_buf, n_frags, eh, hdr_len);
|
2013-01-11 16:26:21 +04:00
|
|
|
if (unlikely(skb == NULL)) {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_free_rx_buffer(rx_buf);
|
2013-01-11 16:26:21 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
skb_record_rx_queue(skb, channel->rx_queue.core_index);
|
2012-01-24 02:41:30 +04:00
|
|
|
|
|
|
|
/* Set the SKB flags */
|
|
|
|
skb_checksum_none_assert(skb);
|
2013-04-08 15:49:48 +04:00
|
|
|
if (likely(rx_buf->flags & EFX_RX_PKT_CSUMMED))
|
|
|
|
skb->ip_summed = CHECKSUM_UNNECESSARY;
|
2012-01-24 02:41:30 +04:00
|
|
|
|
2013-11-18 16:54:41 +04:00
|
|
|
efx_rx_skb_attach_timestamp(channel, skb);
|
|
|
|
|
2012-07-18 12:52:11 +04:00
|
|
|
if (channel->type->receive_skb)
|
2013-03-06 00:13:54 +04:00
|
|
|
if (channel->type->receive_skb(channel, skb))
|
2013-01-11 16:26:21 +04:00
|
|
|
return;
|
2013-03-06 00:13:54 +04:00
|
|
|
|
|
|
|
/* Pass the packet up */
|
|
|
|
netif_receive_skb(skb);
|
2012-01-24 02:41:30 +04:00
|
|
|
}
|
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
/* Handle a received packet. Second half: Touches packet payload. */
|
2013-01-30 03:33:15 +04:00
|
|
|
void __efx_rx_packet(struct efx_channel *channel)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
|
|
|
struct efx_nic *efx = channel->efx;
|
2013-01-30 03:33:15 +04:00
|
|
|
struct efx_rx_buffer *rx_buf =
|
|
|
|
efx_rx_buffer(&channel->rx_queue, channel->rx_pkt_index);
|
2013-01-30 03:33:15 +04:00
|
|
|
u8 *eh = efx_rx_buf_va(rx_buf);
|
2010-06-25 11:05:33 +04:00
|
|
|
|
2013-04-27 04:55:18 +04:00
|
|
|
/* Read length from the prefix if necessary. This already
|
|
|
|
* excludes the length of the prefix itself.
|
|
|
|
*/
|
|
|
|
if (rx_buf->flags & EFX_RX_PKT_PREFIX_LEN)
|
|
|
|
rx_buf->len = le16_to_cpup((__le16 *)
|
|
|
|
(eh + efx->rx_packet_len_offset));
|
|
|
|
|
2008-05-07 16:36:19 +04:00
|
|
|
/* If we're in loopback test, then pass the packet directly to the
|
|
|
|
* loopback layer, and free the rx_buf here
|
|
|
|
*/
|
|
|
|
if (unlikely(efx->loopback_selftest)) {
|
2011-02-25 02:45:16 +03:00
|
|
|
efx_loopback_rx_packet(efx, eh, rx_buf->len);
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_free_rx_buffer(rx_buf);
|
2013-01-30 03:33:15 +04:00
|
|
|
goto out;
|
2008-05-07 16:36:19 +04:00
|
|
|
}
|
|
|
|
|
2011-04-05 18:00:02 +04:00
|
|
|
if (unlikely(!(efx->net_dev->features & NETIF_F_RXCSUM)))
|
2011-08-26 21:05:11 +04:00
|
|
|
rx_buf->flags &= ~EFX_RX_PKT_CSUMMED;
|
2011-04-02 01:20:06 +04:00
|
|
|
|
2013-05-16 21:38:13 +04:00
|
|
|
if ((rx_buf->flags & EFX_RX_PKT_TCP) && !channel->type->receive_skb)
|
2013-01-30 03:33:15 +04:00
|
|
|
efx_rx_packet_gro(channel, rx_buf, channel->rx_pkt_n_frags, eh);
|
2012-01-24 02:41:30 +04:00
|
|
|
else
|
2013-01-30 03:33:15 +04:00
|
|
|
efx_rx_deliver(channel, eh, rx_buf, channel->rx_pkt_n_frags);
|
|
|
|
out:
|
|
|
|
channel->rx_pkt_n_frags = 0;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
int efx_probe_rx_queue(struct efx_rx_queue *rx_queue)
|
|
|
|
{
|
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
2010-09-10 10:42:22 +04:00
|
|
|
unsigned int entries;
|
2008-04-27 15:55:59 +04:00
|
|
|
int rc;
|
|
|
|
|
2010-09-10 10:42:22 +04:00
|
|
|
/* Create the smallest power-of-two aligned ring */
|
|
|
|
entries = max(roundup_pow_of_two(efx->rxq_entries), EFX_MIN_DMAQ_SIZE);
|
|
|
|
EFX_BUG_ON_PARANOID(entries > EFX_MAX_DMAQ_SIZE);
|
|
|
|
rx_queue->ptr_mask = entries - 1;
|
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_dbg(efx, probe, efx->net_dev,
|
2010-09-10 10:42:22 +04:00
|
|
|
"creating RX queue %d size %#x mask %#x\n",
|
|
|
|
efx_rx_queue_index(rx_queue), efx->rxq_entries,
|
|
|
|
rx_queue->ptr_mask);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Allocate RX buffers */
|
2011-12-02 16:36:13 +04:00
|
|
|
rx_queue->buffer = kcalloc(entries, sizeof(*rx_queue->buffer),
|
2010-09-10 10:42:22 +04:00
|
|
|
GFP_KERNEL);
|
2008-09-01 15:47:48 +04:00
|
|
|
if (!rx_queue->buffer)
|
|
|
|
return -ENOMEM;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2009-11-29 06:43:56 +03:00
|
|
|
rc = efx_nic_probe_rx(rx_queue);
|
2008-09-01 15:47:48 +04:00
|
|
|
if (rc) {
|
|
|
|
kfree(rx_queue->buffer);
|
|
|
|
rx_queue->buffer = NULL;
|
|
|
|
}
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
|
2008-04-27 15:55:59 +04:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2013-03-16 10:57:51 +04:00
|
|
|
static void efx_init_rx_recycle_ring(struct efx_nic *efx,
|
|
|
|
struct efx_rx_queue *rx_queue)
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
{
|
|
|
|
unsigned int bufs_in_recycle_ring, page_ring_size;
|
|
|
|
|
|
|
|
/* Set the RX recycle ring size */
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_IOMMU;
|
|
|
|
#else
|
2013-06-12 21:09:08 +04:00
|
|
|
if (iommu_present(&pci_bus_type))
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_IOMMU;
|
|
|
|
else
|
|
|
|
bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_NOIOMMU;
|
|
|
|
#endif /* CONFIG_PPC64 */
|
|
|
|
|
|
|
|
page_ring_size = roundup_pow_of_two(bufs_in_recycle_ring /
|
|
|
|
efx->rx_bufs_per_page);
|
|
|
|
rx_queue->page_ring = kcalloc(page_ring_size,
|
|
|
|
sizeof(*rx_queue->page_ring), GFP_KERNEL);
|
|
|
|
rx_queue->page_ptr_mask = page_ring_size - 1;
|
|
|
|
}
|
|
|
|
|
2008-09-01 15:48:46 +04:00
|
|
|
void efx_init_rx_queue(struct efx_rx_queue *rx_queue)
|
2008-04-27 15:55:59 +04:00
|
|
|
{
|
2010-09-10 10:42:22 +04:00
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
2012-04-11 16:12:41 +04:00
|
|
|
unsigned int max_fill, trigger, max_trigger;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev,
|
2010-09-10 10:41:36 +04:00
|
|
|
"initialising RX queue %d\n", efx_rx_queue_index(rx_queue));
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Initialise ptr fields */
|
|
|
|
rx_queue->added_count = 0;
|
|
|
|
rx_queue->notified_count = 0;
|
|
|
|
rx_queue->removed_count = 0;
|
|
|
|
rx_queue->min_fill = -1U;
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
efx_init_rx_recycle_ring(efx, rx_queue);
|
|
|
|
|
|
|
|
rx_queue->page_remove = 0;
|
|
|
|
rx_queue->page_add = rx_queue->page_ptr_mask + 1;
|
|
|
|
rx_queue->page_recycle_count = 0;
|
|
|
|
rx_queue->page_recycle_failed = 0;
|
|
|
|
rx_queue->page_recycle_full = 0;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Initialise limit fields */
|
2010-09-10 10:42:22 +04:00
|
|
|
max_fill = efx->rxq_entries - EFX_RXD_HEAD_ROOM;
|
2013-02-13 14:54:41 +04:00
|
|
|
max_trigger =
|
|
|
|
max_fill - efx->rx_pages_per_batch * efx->rx_bufs_per_page;
|
2012-04-11 16:12:41 +04:00
|
|
|
if (rx_refill_threshold != 0) {
|
|
|
|
trigger = max_fill * min(rx_refill_threshold, 100U) / 100U;
|
|
|
|
if (trigger > max_trigger)
|
|
|
|
trigger = max_trigger;
|
|
|
|
} else {
|
|
|
|
trigger = max_trigger;
|
|
|
|
}
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
rx_queue->max_fill = max_fill;
|
|
|
|
rx_queue->fast_fill_trigger = trigger;
|
2013-05-27 19:52:54 +04:00
|
|
|
rx_queue->refill_enabled = true;
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
/* Set up RX descriptor ring */
|
2009-11-29 06:43:56 +03:00
|
|
|
efx_nic_init_rx(rx_queue);
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void efx_fini_rx_queue(struct efx_rx_queue *rx_queue)
|
|
|
|
{
|
|
|
|
int i;
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
struct efx_nic *efx = rx_queue->efx;
|
2008-04-27 15:55:59 +04:00
|
|
|
struct efx_rx_buffer *rx_buf;
|
|
|
|
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev,
|
2010-09-10 10:41:36 +04:00
|
|
|
"shutting down RX queue %d\n", efx_rx_queue_index(rx_queue));
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2010-06-01 15:19:39 +04:00
|
|
|
del_timer_sync(&rx_queue->slow_fill);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
/* Release RX buffers from the current read ptr to the write ptr */
|
2008-04-27 15:55:59 +04:00
|
|
|
if (rx_queue->buffer) {
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
for (i = rx_queue->removed_count; i < rx_queue->added_count;
|
|
|
|
i++) {
|
|
|
|
unsigned index = i & rx_queue->ptr_mask;
|
|
|
|
rx_buf = efx_rx_buffer(rx_queue, index);
|
2008-04-27 15:55:59 +04:00
|
|
|
efx_fini_rx_buffer(rx_queue, rx_buf);
|
|
|
|
}
|
|
|
|
}
|
sfc: reuse pages to avoid DMA mapping/unmapping costs
On POWER systems, DMA mapping/unmapping operations are very expensive.
These changes reduce these costs by trying to reuse DMA mapped pages.
After all the buffers associated with a page have been processed and
passed up, the page is placed into a ring (if there is room). For
each page that is required for a refill operation, a page in the ring
is examined to determine if its page count has fallen to 1, ie. the
kernel has released its reference to these packets. If this is the
case, the page can be immediately added back into the RX descriptor
ring, without having to re-map it for DMA.
If the kernel is still holding a reference to this page, it is removed
from the ring and unmapped for DMA. Then a new page, which can
immediately be used by RX buffers in the descriptor ring, is allocated
and DMA mapped.
The time a page needs to spend in the recycle ring before the kernel
has released its page references is based on the number of buffers
that use this page. As large pages can hold more RX buffers, the RX
recycle ring can be shorter. This reduces memory usage on POWER
systems, while maintaining the performance gain achieved by recycling
pages, following the driver change to pack more than two RX buffers
into large pages.
When an IOMMU is not present, the recycle ring can be small to reduce
memory usage, since DMA mapping operations are inexpensive.
With a small recycle ring, attempting to refill the descriptor queue
with more buffers than the equivalent size of the recycle ring could
ultimately lead to memory leaks if page entries in the recycle ring
were overwritten. To prevent this, the check to see if the recycle
ring is full is changed to check if the next entry to be written is
NULL.
[bwh: Combine and rebase several commits so this is complete
before the following buffer-packing changes. Remove module
parameter.]
Signed-off-by: Ben Hutchings <bhutchings@solarflare.com>
2013-02-13 14:54:41 +04:00
|
|
|
|
|
|
|
/* Unmap and release the pages in the recycle ring. Remove the ring. */
|
|
|
|
for (i = 0; i <= rx_queue->page_ptr_mask; i++) {
|
|
|
|
struct page *page = rx_queue->page_ring[i];
|
|
|
|
struct efx_rx_page_state *state;
|
|
|
|
|
|
|
|
if (page == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
state = page_address(page);
|
|
|
|
dma_unmap_page(&efx->pci_dev->dev, state->dma_addr,
|
|
|
|
PAGE_SIZE << efx->rx_buffer_order,
|
|
|
|
DMA_FROM_DEVICE);
|
|
|
|
put_page(page);
|
|
|
|
}
|
|
|
|
kfree(rx_queue->page_ring);
|
|
|
|
rx_queue->page_ring = NULL;
|
2008-04-27 15:55:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void efx_remove_rx_queue(struct efx_rx_queue *rx_queue)
|
|
|
|
{
|
2010-06-23 15:30:07 +04:00
|
|
|
netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev,
|
2010-09-10 10:41:36 +04:00
|
|
|
"destroying RX queue %d\n", efx_rx_queue_index(rx_queue));
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2009-11-29 06:43:56 +03:00
|
|
|
efx_nic_remove_rx(rx_queue);
|
2008-04-27 15:55:59 +04:00
|
|
|
|
|
|
|
kfree(rx_queue->buffer);
|
|
|
|
rx_queue->buffer = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
module_param(rx_refill_threshold, uint, 0444);
|
|
|
|
MODULE_PARM_DESC(rx_refill_threshold,
|
2012-04-11 16:12:41 +04:00
|
|
|
"RX descriptor ring refill threshold (%)");
|
2008-04-27 15:55:59 +04:00
|
|
|
|
2012-11-08 05:46:53 +04:00
|
|
|
#ifdef CONFIG_RFS_ACCEL
|
|
|
|
|
|
|
|
int efx_filter_rfs(struct net_device *net_dev, const struct sk_buff *skb,
|
|
|
|
u16 rxq_index, u32 flow_id)
|
|
|
|
{
|
|
|
|
struct efx_nic *efx = netdev_priv(net_dev);
|
|
|
|
struct efx_channel *channel;
|
|
|
|
struct efx_filter_spec spec;
|
|
|
|
const __be16 *ports;
|
2013-09-03 20:22:23 +04:00
|
|
|
__be16 ether_type;
|
2012-11-08 05:46:53 +04:00
|
|
|
int nhoff;
|
|
|
|
int rc;
|
|
|
|
|
2013-09-03 20:22:23 +04:00
|
|
|
/* The core RPS/RFS code has already parsed and validated
|
|
|
|
* VLAN, IP and transport headers. We assume they are in the
|
|
|
|
* header area.
|
|
|
|
*/
|
2012-11-08 05:46:53 +04:00
|
|
|
|
|
|
|
if (skb->protocol == htons(ETH_P_8021Q)) {
|
2013-09-03 20:22:23 +04:00
|
|
|
const struct vlan_hdr *vh =
|
|
|
|
(const struct vlan_hdr *)skb->data;
|
2012-11-08 05:46:53 +04:00
|
|
|
|
2013-09-03 20:22:23 +04:00
|
|
|
/* We can't filter on the IP 5-tuple and the vlan
|
|
|
|
* together, so just strip the vlan header and filter
|
|
|
|
* on the IP part.
|
2012-11-08 05:46:53 +04:00
|
|
|
*/
|
2013-09-03 20:22:23 +04:00
|
|
|
EFX_BUG_ON_PARANOID(skb_headlen(skb) < sizeof(*vh));
|
|
|
|
ether_type = vh->h_vlan_encapsulated_proto;
|
|
|
|
nhoff = sizeof(struct vlan_hdr);
|
|
|
|
} else {
|
|
|
|
ether_type = skb->protocol;
|
|
|
|
nhoff = 0;
|
2012-11-08 05:46:53 +04:00
|
|
|
}
|
|
|
|
|
2013-09-03 20:22:23 +04:00
|
|
|
if (ether_type != htons(ETH_P_IP) && ether_type != htons(ETH_P_IPV6))
|
2012-11-08 05:46:53 +04:00
|
|
|
return -EPROTONOSUPPORT;
|
|
|
|
|
|
|
|
efx_filter_init_rx(&spec, EFX_FILTER_PRI_HINT,
|
|
|
|
efx->rx_scatter ? EFX_FILTER_FLAG_RX_SCATTER : 0,
|
|
|
|
rxq_index);
|
2013-09-03 20:22:23 +04:00
|
|
|
spec.match_flags =
|
|
|
|
EFX_FILTER_MATCH_ETHER_TYPE | EFX_FILTER_MATCH_IP_PROTO |
|
|
|
|
EFX_FILTER_MATCH_LOC_HOST | EFX_FILTER_MATCH_LOC_PORT |
|
|
|
|
EFX_FILTER_MATCH_REM_HOST | EFX_FILTER_MATCH_REM_PORT;
|
|
|
|
spec.ether_type = ether_type;
|
|
|
|
|
|
|
|
if (ether_type == htons(ETH_P_IP)) {
|
|
|
|
const struct iphdr *ip =
|
|
|
|
(const struct iphdr *)(skb->data + nhoff);
|
|
|
|
|
|
|
|
EFX_BUG_ON_PARANOID(skb_headlen(skb) < nhoff + sizeof(*ip));
|
|
|
|
if (ip_is_fragment(ip))
|
|
|
|
return -EPROTONOSUPPORT;
|
|
|
|
spec.ip_proto = ip->protocol;
|
|
|
|
spec.rem_host[0] = ip->saddr;
|
|
|
|
spec.loc_host[0] = ip->daddr;
|
|
|
|
EFX_BUG_ON_PARANOID(skb_headlen(skb) < nhoff + 4 * ip->ihl + 4);
|
|
|
|
ports = (const __be16 *)(skb->data + nhoff + 4 * ip->ihl);
|
|
|
|
} else {
|
|
|
|
const struct ipv6hdr *ip6 =
|
|
|
|
(const struct ipv6hdr *)(skb->data + nhoff);
|
|
|
|
|
|
|
|
EFX_BUG_ON_PARANOID(skb_headlen(skb) <
|
|
|
|
nhoff + sizeof(*ip6) + 4);
|
|
|
|
spec.ip_proto = ip6->nexthdr;
|
|
|
|
memcpy(spec.rem_host, &ip6->saddr, sizeof(ip6->saddr));
|
|
|
|
memcpy(spec.loc_host, &ip6->daddr, sizeof(ip6->daddr));
|
|
|
|
ports = (const __be16 *)(ip6 + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
spec.rem_port = ports[0];
|
|
|
|
spec.loc_port = ports[1];
|
2012-11-08 05:46:53 +04:00
|
|
|
|
|
|
|
rc = efx->type->filter_rfs_insert(efx, &spec);
|
|
|
|
if (rc < 0)
|
|
|
|
return rc;
|
|
|
|
|
|
|
|
/* Remember this so we can check whether to expire the filter later */
|
|
|
|
efx->rps_flow_id[rc] = flow_id;
|
|
|
|
channel = efx_get_channel(efx, skb_get_rx_queue(skb));
|
|
|
|
++channel->rfs_filters_added;
|
|
|
|
|
2013-09-03 20:22:23 +04:00
|
|
|
if (ether_type == htons(ETH_P_IP))
|
|
|
|
netif_info(efx, rx_status, efx->net_dev,
|
|
|
|
"steering %s %pI4:%u:%pI4:%u to queue %u [flow %u filter %d]\n",
|
|
|
|
(spec.ip_proto == IPPROTO_TCP) ? "TCP" : "UDP",
|
|
|
|
spec.rem_host, ntohs(ports[0]), spec.loc_host,
|
|
|
|
ntohs(ports[1]), rxq_index, flow_id, rc);
|
|
|
|
else
|
|
|
|
netif_info(efx, rx_status, efx->net_dev,
|
|
|
|
"steering %s [%pI6]:%u:[%pI6]:%u to queue %u [flow %u filter %d]\n",
|
|
|
|
(spec.ip_proto == IPPROTO_TCP) ? "TCP" : "UDP",
|
|
|
|
spec.rem_host, ntohs(ports[0]), spec.loc_host,
|
|
|
|
ntohs(ports[1]), rxq_index, flow_id, rc);
|
2012-11-08 05:46:53 +04:00
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool __efx_filter_rfs_expire(struct efx_nic *efx, unsigned int quota)
|
|
|
|
{
|
|
|
|
bool (*expire_one)(struct efx_nic *efx, u32 flow_id, unsigned int index);
|
|
|
|
unsigned int index, size;
|
|
|
|
u32 flow_id;
|
|
|
|
|
|
|
|
if (!spin_trylock_bh(&efx->filter_lock))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
expire_one = efx->type->filter_rfs_expire_one;
|
|
|
|
index = efx->rps_expire_index;
|
|
|
|
size = efx->type->max_rx_ip_filters;
|
|
|
|
while (quota--) {
|
|
|
|
flow_id = efx->rps_flow_id[index];
|
|
|
|
if (expire_one(efx, flow_id, index))
|
|
|
|
netif_info(efx, rx_status, efx->net_dev,
|
|
|
|
"expired filter %d [flow %u]\n",
|
|
|
|
index, flow_id);
|
|
|
|
if (++index == size)
|
|
|
|
index = 0;
|
|
|
|
}
|
|
|
|
efx->rps_expire_index = index;
|
|
|
|
|
|
|
|
spin_unlock_bh(&efx->filter_lock);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_RFS_ACCEL */
|
2013-01-16 02:00:07 +04:00
|
|
|
|
|
|
|
/**
|
|
|
|
* efx_filter_is_mc_recipient - test whether spec is a multicast recipient
|
|
|
|
* @spec: Specification to test
|
|
|
|
*
|
|
|
|
* Return: %true if the specification is a non-drop RX filter that
|
|
|
|
* matches a local MAC address I/G bit value of 1 or matches a local
|
|
|
|
* IPv4 or IPv6 address value in the respective multicast address
|
|
|
|
* range. Otherwise %false.
|
|
|
|
*/
|
|
|
|
bool efx_filter_is_mc_recipient(const struct efx_filter_spec *spec)
|
|
|
|
{
|
|
|
|
if (!(spec->flags & EFX_FILTER_FLAG_RX) ||
|
|
|
|
spec->dmaq_id == EFX_FILTER_RX_DMAQ_ID_DROP)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (spec->match_flags &
|
|
|
|
(EFX_FILTER_MATCH_LOC_MAC | EFX_FILTER_MATCH_LOC_MAC_IG) &&
|
|
|
|
is_multicast_ether_addr(spec->loc_mac))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if ((spec->match_flags &
|
|
|
|
(EFX_FILTER_MATCH_ETHER_TYPE | EFX_FILTER_MATCH_LOC_HOST)) ==
|
|
|
|
(EFX_FILTER_MATCH_ETHER_TYPE | EFX_FILTER_MATCH_LOC_HOST)) {
|
|
|
|
if (spec->ether_type == htons(ETH_P_IP) &&
|
|
|
|
ipv4_is_multicast(spec->loc_host[0]))
|
|
|
|
return true;
|
|
|
|
if (spec->ether_type == htons(ETH_P_IPV6) &&
|
|
|
|
((const u8 *)spec->loc_host)[0] == 0xff)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|