2005-04-18 05:05:31 +08:00
|
|
|
/*******************************************************************
|
|
|
|
|
* This file is part of the Emulex Linux Device Driver for *
|
2005-06-25 22:34:39 +08:00
|
|
|
* Fibre Channel Host Bus Adapters. *
|
2018-01-31 07:59:03 +08:00
|
|
|
* Copyright (C) 2017-2018 Broadcom. All Rights Reserved. The term *
|
2018-06-26 23:24:31 +08:00
|
|
|
* “Broadcom” refers to Broadcom Inc. and/or its subsidiaries. *
|
2014-04-05 01:52:50 +08:00
|
|
|
* Copyright (C) 2004-2014 Emulex. All rights reserved. *
|
2005-06-25 22:34:39 +08:00
|
|
|
* EMULEX and SLI are trademarks of Emulex. *
|
2017-02-13 05:52:39 +08:00
|
|
|
* www.broadcom.com *
|
2005-06-25 22:34:39 +08:00
|
|
|
* Portions Copyright (C) 2004-2005 Christoph Hellwig *
|
2005-04-18 05:05:31 +08:00
|
|
|
* *
|
|
|
|
|
* This program is free software; you can redistribute it and/or *
|
2005-06-25 22:34:39 +08:00
|
|
|
* modify it under the terms of version 2 of the GNU General *
|
|
|
|
|
* Public License as published by the Free Software Foundation. *
|
|
|
|
|
* This program is distributed in the hope that it will be useful. *
|
|
|
|
|
* ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND *
|
|
|
|
|
* WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, *
|
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT, ARE *
|
|
|
|
|
* DISCLAIMED, EXCEPT TO THE EXTENT THAT SUCH DISCLAIMERS ARE HELD *
|
|
|
|
|
* TO BE LEGALLY INVALID. See the GNU General Public License for *
|
|
|
|
|
* more details, a copy of which can be found in the file COPYING *
|
|
|
|
|
* included with this package. *
|
2005-04-18 05:05:31 +08:00
|
|
|
*******************************************************************/
|
|
|
|
|
|
|
|
|
|
#include <linux/mempool.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 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2005-04-18 05:05:31 +08:00
|
|
|
#include <linux/pci.h>
|
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
|
|
2017-02-13 05:52:30 +08:00
|
|
|
#include <scsi/scsi.h>
|
2005-08-11 03:03:01 +08:00
|
|
|
#include <scsi/scsi_device.h>
|
|
|
|
|
#include <scsi/scsi_transport_fc.h>
|
2017-02-13 05:52:30 +08:00
|
|
|
#include <scsi/fc/fc_fs.h>
|
2005-08-11 03:03:01 +08:00
|
|
|
|
2009-05-23 02:51:39 +08:00
|
|
|
#include "lpfc_hw4.h"
|
2005-04-18 05:05:31 +08:00
|
|
|
#include "lpfc_hw.h"
|
|
|
|
|
#include "lpfc_sli.h"
|
2009-05-23 02:51:39 +08:00
|
|
|
#include "lpfc_sli4.h"
|
2008-09-07 23:52:10 +08:00
|
|
|
#include "lpfc_nl.h"
|
2005-04-18 05:05:31 +08:00
|
|
|
#include "lpfc_disc.h"
|
|
|
|
|
#include "lpfc.h"
|
2017-02-13 05:52:30 +08:00
|
|
|
#include "lpfc_scsi.h"
|
2005-04-18 05:05:31 +08:00
|
|
|
#include "lpfc_crtn.h"
|
2013-12-18 09:29:47 +08:00
|
|
|
#include "lpfc_logmsg.h"
|
2005-04-18 05:05:31 +08:00
|
|
|
|
|
|
|
|
#define LPFC_MBUF_POOL_SIZE 64 /* max elements in MBUF safety pool */
|
|
|
|
|
#define LPFC_MEM_POOL_SIZE 64 /* max elem in non-DMA safety pool */
|
2014-02-20 22:56:45 +08:00
|
|
|
#define LPFC_DEVICE_DATA_POOL_SIZE 64 /* max elements in device data pool */
|
2020-07-01 05:49:53 +08:00
|
|
|
#define LPFC_RRQ_POOL_SIZE 256 /* max elements in non-DMA pool */
|
2020-10-21 04:27:12 +08:00
|
|
|
#define LPFC_MBX_POOL_SIZE 256 /* max elements in MBX non-DMA pool */
|
2005-04-18 05:05:31 +08:00
|
|
|
|
2013-12-18 09:29:47 +08:00
|
|
|
int
|
|
|
|
|
lpfc_mem_alloc_active_rrq_pool_s4(struct lpfc_hba *phba) {
|
|
|
|
|
size_t bytes;
|
|
|
|
|
int max_xri = phba->sli4_hba.max_cfg_param.max_xri;
|
|
|
|
|
|
|
|
|
|
if (max_xri <= 0)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
bytes = ((BITS_PER_LONG - 1 + max_xri) / BITS_PER_LONG) *
|
|
|
|
|
sizeof(unsigned long);
|
|
|
|
|
phba->cfg_rrq_xri_bitmap_sz = bytes;
|
|
|
|
|
phba->active_rrq_pool = mempool_create_kmalloc_pool(LPFC_MEM_POOL_SIZE,
|
|
|
|
|
bytes);
|
|
|
|
|
if (!phba->active_rrq_pool)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
else
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
2007-06-18 08:56:36 +08:00
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* lpfc_mem_alloc - create and allocate all PCI and memory pools
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA to allocate pools for
|
2020-07-22 00:41:36 +08:00
|
|
|
* @align: alignment requirement for blocks; must be a power of two
|
2008-08-25 09:49:00 +08:00
|
|
|
*
|
scsi: lpfc: Support dynamic unbounded SGL lists on G7 hardware.
Typical SLI-4 hardware supports up to 2 4KB pages to be registered per XRI
to contain the exchanges Scatter/Gather List. This caps the number of SGL
elements that can be in the SGL. There are not extensions to extend the
list out of the 2 pages.
The G7 hardware adds a SGE type that allows the SGL to be vectored to a
different scatter/gather list segment. And that segment can contain a SGE
to go to another segment and so on. The initial segment must still be
pre-registered for the XRI, but it can be a much smaller amount (256Bytes)
as it can now be dynamically grown. This much smaller allocation can
handle the SG list for most normal I/O, and the dynamic aspect allows it to
support many MB's if needed.
The implementation creates a pool which contains "segments" and which is
initially sized to hold the initial small segment per xri. If an I/O
requires additional segments, they are allocated from the pool. If the
pool has no more segments, the pool is grown based on what is now
needed. After the I/O completes, the additional segments are returned to
the pool for use by other I/Os. Once allocated, the additional segments are
not released under the assumption of "if needed once, it will be needed
again". Pools are kept on a per-hardware queue basis, which is typically
1:1 per cpu, but may be shared by multiple cpus.
The switch to the smaller initial allocation significantly reduces the
memory footprint of the driver (which only grows if large ios are
issued). Based on the several K of XRIs for the adapter, the 8KB->256B
reduction can conserve 32MBs or more.
It has been observed with per-cpu resource pools that allocating a resource
on CPU A, may be put back on CPU B. While the get routines are distributed
evenly, only a limited subset of CPUs may be handling the put routines.
This can put a strain on the lpfc_put_cmd_rsp_buf_per_cpu routine because
all the resources are being put on a limited subset of CPUs.
Signed-off-by: Dick Kennedy <dick.kennedy@broadcom.com>
Signed-off-by: James Smart <jsmart2021@gmail.com>
Signed-off-by: Martin K. Petersen <martin.petersen@oracle.com>
2019-08-15 07:57:09 +08:00
|
|
|
* Description: Creates and allocates PCI pools lpfc_mbuf_pool,
|
|
|
|
|
* lpfc_hrb_pool. Creates and allocates kmalloc-backed mempools
|
2008-08-25 09:49:00 +08:00
|
|
|
* for LPFC_MBOXQ_t and lpfc_nodelist. Also allocates the VPI bitmask.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Not interrupt-safe. Must be called with no locks held. If any
|
|
|
|
|
* allocation fails, frees all successfully allocated memory before returning.
|
|
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* 0 on success
|
|
|
|
|
* -ENOMEM on failure (if any memory allocations fail)
|
|
|
|
|
**/
|
2005-04-18 05:05:31 +08:00
|
|
|
int
|
2009-05-23 02:51:39 +08:00
|
|
|
lpfc_mem_alloc(struct lpfc_hba *phba, int align)
|
2005-04-18 05:05:31 +08:00
|
|
|
{
|
|
|
|
|
struct lpfc_dma_pool *pool = &phba->lpfc_mbuf_safety_pool;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
phba->lpfc_mbuf_pool = dma_pool_create("lpfc_mbuf_pool", &phba->pcidev->dev,
|
2009-05-23 02:51:39 +08:00
|
|
|
LPFC_BPL_SIZE,
|
|
|
|
|
align, 0);
|
2005-04-18 05:05:31 +08:00
|
|
|
if (!phba->lpfc_mbuf_pool)
|
scsi: lpfc: Support dynamic unbounded SGL lists on G7 hardware.
Typical SLI-4 hardware supports up to 2 4KB pages to be registered per XRI
to contain the exchanges Scatter/Gather List. This caps the number of SGL
elements that can be in the SGL. There are not extensions to extend the
list out of the 2 pages.
The G7 hardware adds a SGE type that allows the SGL to be vectored to a
different scatter/gather list segment. And that segment can contain a SGE
to go to another segment and so on. The initial segment must still be
pre-registered for the XRI, but it can be a much smaller amount (256Bytes)
as it can now be dynamically grown. This much smaller allocation can
handle the SG list for most normal I/O, and the dynamic aspect allows it to
support many MB's if needed.
The implementation creates a pool which contains "segments" and which is
initially sized to hold the initial small segment per xri. If an I/O
requires additional segments, they are allocated from the pool. If the
pool has no more segments, the pool is grown based on what is now
needed. After the I/O completes, the additional segments are returned to
the pool for use by other I/Os. Once allocated, the additional segments are
not released under the assumption of "if needed once, it will be needed
again". Pools are kept on a per-hardware queue basis, which is typically
1:1 per cpu, but may be shared by multiple cpus.
The switch to the smaller initial allocation significantly reduces the
memory footprint of the driver (which only grows if large ios are
issued). Based on the several K of XRIs for the adapter, the 8KB->256B
reduction can conserve 32MBs or more.
It has been observed with per-cpu resource pools that allocating a resource
on CPU A, may be put back on CPU B. While the get routines are distributed
evenly, only a limited subset of CPUs may be handling the put routines.
This can put a strain on the lpfc_put_cmd_rsp_buf_per_cpu routine because
all the resources are being put on a limited subset of CPUs.
Signed-off-by: Dick Kennedy <dick.kennedy@broadcom.com>
Signed-off-by: James Smart <jsmart2021@gmail.com>
Signed-off-by: Martin K. Petersen <martin.petersen@oracle.com>
2019-08-15 07:57:09 +08:00
|
|
|
goto fail;
|
2005-04-18 05:05:31 +08:00
|
|
|
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 04:55:00 +08:00
|
|
|
pool->elements = kmalloc_array(LPFC_MBUF_POOL_SIZE,
|
|
|
|
|
sizeof(struct lpfc_dmabuf),
|
|
|
|
|
GFP_KERNEL);
|
2007-01-02 08:07:32 +08:00
|
|
|
if (!pool->elements)
|
|
|
|
|
goto fail_free_lpfc_mbuf_pool;
|
|
|
|
|
|
2005-04-18 05:05:31 +08:00
|
|
|
pool->max_count = 0;
|
|
|
|
|
pool->current_count = 0;
|
|
|
|
|
for ( i = 0; i < LPFC_MBUF_POOL_SIZE; i++) {
|
2017-07-06 16:13:05 +08:00
|
|
|
pool->elements[i].virt = dma_pool_alloc(phba->lpfc_mbuf_pool,
|
2005-04-18 05:05:31 +08:00
|
|
|
GFP_KERNEL, &pool->elements[i].phys);
|
|
|
|
|
if (!pool->elements[i].virt)
|
|
|
|
|
goto fail_free_mbuf_pool;
|
|
|
|
|
pool->max_count++;
|
|
|
|
|
pool->current_count++;
|
|
|
|
|
}
|
|
|
|
|
|
2020-10-21 04:27:12 +08:00
|
|
|
phba->mbox_mem_pool = mempool_create_kmalloc_pool(LPFC_MBX_POOL_SIZE,
|
|
|
|
|
sizeof(LPFC_MBOXQ_t));
|
2005-04-18 05:05:31 +08:00
|
|
|
if (!phba->mbox_mem_pool)
|
|
|
|
|
goto fail_free_mbuf_pool;
|
|
|
|
|
|
2006-03-26 17:37:47 +08:00
|
|
|
phba->nlp_mem_pool = mempool_create_kmalloc_pool(LPFC_MEM_POOL_SIZE,
|
|
|
|
|
sizeof(struct lpfc_nodelist));
|
2005-04-18 05:05:31 +08:00
|
|
|
if (!phba->nlp_mem_pool)
|
|
|
|
|
goto fail_free_mbox_pool;
|
2009-07-19 22:01:16 +08:00
|
|
|
|
|
|
|
|
if (phba->sli_rev == LPFC_SLI_REV4) {
|
2010-11-21 12:11:55 +08:00
|
|
|
phba->rrq_pool =
|
2020-07-01 05:49:53 +08:00
|
|
|
mempool_create_kmalloc_pool(LPFC_RRQ_POOL_SIZE,
|
2010-11-21 12:11:55 +08:00
|
|
|
sizeof(struct lpfc_node_rrq));
|
|
|
|
|
if (!phba->rrq_pool)
|
|
|
|
|
goto fail_free_nlp_mem_pool;
|
2017-07-06 16:13:05 +08:00
|
|
|
phba->lpfc_hrb_pool = dma_pool_create("lpfc_hrb_pool",
|
|
|
|
|
&phba->pcidev->dev,
|
2009-05-23 02:51:39 +08:00
|
|
|
LPFC_HDR_BUF_SIZE, align, 0);
|
2009-07-19 22:01:16 +08:00
|
|
|
if (!phba->lpfc_hrb_pool)
|
2010-11-21 12:11:55 +08:00
|
|
|
goto fail_free_rrq_mem_pool;
|
2009-07-19 22:01:16 +08:00
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
phba->lpfc_drb_pool = dma_pool_create("lpfc_drb_pool",
|
|
|
|
|
&phba->pcidev->dev,
|
2009-05-23 02:51:39 +08:00
|
|
|
LPFC_DATA_BUF_SIZE, align, 0);
|
2009-07-19 22:01:16 +08:00
|
|
|
if (!phba->lpfc_drb_pool)
|
|
|
|
|
goto fail_free_hrb_pool;
|
|
|
|
|
phba->lpfc_hbq_pool = NULL;
|
|
|
|
|
} else {
|
2017-07-06 16:13:05 +08:00
|
|
|
phba->lpfc_hbq_pool = dma_pool_create("lpfc_hbq_pool",
|
|
|
|
|
&phba->pcidev->dev, LPFC_BPL_SIZE, align, 0);
|
2009-07-19 22:01:16 +08:00
|
|
|
if (!phba->lpfc_hbq_pool)
|
|
|
|
|
goto fail_free_nlp_mem_pool;
|
|
|
|
|
phba->lpfc_hrb_pool = NULL;
|
|
|
|
|
phba->lpfc_drb_pool = NULL;
|
|
|
|
|
}
|
2007-06-18 08:56:38 +08:00
|
|
|
|
2014-02-20 22:56:45 +08:00
|
|
|
if (phba->cfg_EnableXLane) {
|
|
|
|
|
phba->device_data_mem_pool = mempool_create_kmalloc_pool(
|
|
|
|
|
LPFC_DEVICE_DATA_POOL_SIZE,
|
|
|
|
|
sizeof(struct lpfc_device_data));
|
|
|
|
|
if (!phba->device_data_mem_pool)
|
2017-02-13 05:52:30 +08:00
|
|
|
goto fail_free_drb_pool;
|
2014-02-20 22:56:45 +08:00
|
|
|
} else {
|
|
|
|
|
phba->device_data_mem_pool = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-18 05:05:31 +08:00
|
|
|
return 0;
|
2017-02-13 05:52:30 +08:00
|
|
|
fail_free_drb_pool:
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_destroy(phba->lpfc_drb_pool);
|
2017-02-13 05:52:30 +08:00
|
|
|
phba->lpfc_drb_pool = NULL;
|
2009-07-19 22:01:16 +08:00
|
|
|
fail_free_hrb_pool:
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_destroy(phba->lpfc_hrb_pool);
|
2009-05-23 02:51:39 +08:00
|
|
|
phba->lpfc_hrb_pool = NULL;
|
2010-11-21 12:11:55 +08:00
|
|
|
fail_free_rrq_mem_pool:
|
|
|
|
|
mempool_destroy(phba->rrq_pool);
|
|
|
|
|
phba->rrq_pool = NULL;
|
2007-06-18 08:56:37 +08:00
|
|
|
fail_free_nlp_mem_pool:
|
|
|
|
|
mempool_destroy(phba->nlp_mem_pool);
|
|
|
|
|
phba->nlp_mem_pool = NULL;
|
2005-04-18 05:05:31 +08:00
|
|
|
fail_free_mbox_pool:
|
|
|
|
|
mempool_destroy(phba->mbox_mem_pool);
|
2007-06-18 08:56:36 +08:00
|
|
|
phba->mbox_mem_pool = NULL;
|
2005-04-18 05:05:31 +08:00
|
|
|
fail_free_mbuf_pool:
|
2007-01-02 08:07:32 +08:00
|
|
|
while (i--)
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_mbuf_pool, pool->elements[i].virt,
|
2005-04-18 05:05:31 +08:00
|
|
|
pool->elements[i].phys);
|
|
|
|
|
kfree(pool->elements);
|
2007-01-02 08:07:32 +08:00
|
|
|
fail_free_lpfc_mbuf_pool:
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_destroy(phba->lpfc_mbuf_pool);
|
2007-06-18 08:56:36 +08:00
|
|
|
phba->lpfc_mbuf_pool = NULL;
|
2005-04-18 05:05:31 +08:00
|
|
|
fail:
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-16 06:20:44 +08:00
|
|
|
int
|
|
|
|
|
lpfc_nvmet_mem_alloc(struct lpfc_hba *phba)
|
|
|
|
|
{
|
|
|
|
|
phba->lpfc_nvmet_drb_pool =
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_create("lpfc_nvmet_drb_pool",
|
|
|
|
|
&phba->pcidev->dev, LPFC_NVMET_DATA_BUF_SIZE,
|
2017-05-16 06:20:44 +08:00
|
|
|
SGL_ALIGN_SZ, 0);
|
|
|
|
|
if (!phba->lpfc_nvmet_drb_pool) {
|
|
|
|
|
lpfc_printf_log(phba, KERN_ERR, LOG_INIT,
|
|
|
|
|
"6024 Can't enable NVME Target - no memory\n");
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-05-23 02:51:39 +08:00
|
|
|
* lpfc_mem_free - Frees memory allocated by lpfc_mem_alloc
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA to free memory for
|
|
|
|
|
*
|
2009-05-23 02:51:39 +08:00
|
|
|
* Description: Free the memory allocated by lpfc_mem_alloc routine. This
|
|
|
|
|
* routine is a the counterpart of lpfc_mem_alloc.
|
2008-08-25 09:49:00 +08:00
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
2005-04-18 05:05:31 +08:00
|
|
|
void
|
2009-05-23 02:51:39 +08:00
|
|
|
lpfc_mem_free(struct lpfc_hba *phba)
|
2005-04-18 05:05:31 +08:00
|
|
|
{
|
|
|
|
|
int i;
|
2009-05-23 02:51:39 +08:00
|
|
|
struct lpfc_dma_pool *pool = &phba->lpfc_mbuf_safety_pool;
|
2014-02-20 22:56:45 +08:00
|
|
|
struct lpfc_device_data *device_data;
|
2005-04-18 05:05:31 +08:00
|
|
|
|
2009-05-23 02:51:39 +08:00
|
|
|
/* Free HBQ pools */
|
2007-06-18 08:56:37 +08:00
|
|
|
lpfc_sli_hbqbuf_free_all(phba);
|
2019-07-21 19:42:29 +08:00
|
|
|
dma_pool_destroy(phba->lpfc_nvmet_drb_pool);
|
2017-05-16 06:20:44 +08:00
|
|
|
phba->lpfc_nvmet_drb_pool = NULL;
|
2019-07-21 19:42:29 +08:00
|
|
|
|
|
|
|
|
dma_pool_destroy(phba->lpfc_drb_pool);
|
2009-05-23 02:51:39 +08:00
|
|
|
phba->lpfc_drb_pool = NULL;
|
2019-07-21 19:42:29 +08:00
|
|
|
|
|
|
|
|
dma_pool_destroy(phba->lpfc_hrb_pool);
|
2009-05-23 02:51:39 +08:00
|
|
|
phba->lpfc_hrb_pool = NULL;
|
2019-07-21 19:42:29 +08:00
|
|
|
|
|
|
|
|
dma_pool_destroy(phba->lpfc_hbq_pool);
|
2009-07-19 22:01:16 +08:00
|
|
|
phba->lpfc_hbq_pool = NULL;
|
2016-05-10 09:39:43 +08:00
|
|
|
|
2019-07-21 19:42:29 +08:00
|
|
|
mempool_destroy(phba->rrq_pool);
|
2012-08-04 00:34:15 +08:00
|
|
|
phba->rrq_pool = NULL;
|
|
|
|
|
|
2009-05-23 02:51:39 +08:00
|
|
|
/* Free NLP memory pool */
|
|
|
|
|
mempool_destroy(phba->nlp_mem_pool);
|
|
|
|
|
phba->nlp_mem_pool = NULL;
|
2016-05-10 09:39:43 +08:00
|
|
|
if (phba->sli_rev == LPFC_SLI_REV4 && phba->active_rrq_pool) {
|
2013-12-18 09:29:47 +08:00
|
|
|
mempool_destroy(phba->active_rrq_pool);
|
|
|
|
|
phba->active_rrq_pool = NULL;
|
|
|
|
|
}
|
2009-05-23 02:51:39 +08:00
|
|
|
|
|
|
|
|
/* Free mbox memory pool */
|
|
|
|
|
mempool_destroy(phba->mbox_mem_pool);
|
|
|
|
|
phba->mbox_mem_pool = NULL;
|
|
|
|
|
|
|
|
|
|
/* Free MBUF memory pool */
|
|
|
|
|
for (i = 0; i < pool->current_count; i++)
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_mbuf_pool, pool->elements[i].virt,
|
2009-05-23 02:51:39 +08:00
|
|
|
pool->elements[i].phys);
|
|
|
|
|
kfree(pool->elements);
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_destroy(phba->lpfc_mbuf_pool);
|
2009-05-23 02:51:39 +08:00
|
|
|
phba->lpfc_mbuf_pool = NULL;
|
2007-06-18 08:56:37 +08:00
|
|
|
|
2014-02-20 22:56:45 +08:00
|
|
|
/* Free Device Data memory pool */
|
|
|
|
|
if (phba->device_data_mem_pool) {
|
|
|
|
|
/* Ensure all objects have been returned to the pool */
|
|
|
|
|
while (!list_empty(&phba->luns)) {
|
|
|
|
|
device_data = list_first_entry(&phba->luns,
|
|
|
|
|
struct lpfc_device_data,
|
|
|
|
|
listentry);
|
|
|
|
|
list_del(&device_data->listentry);
|
|
|
|
|
mempool_free(device_data, phba->device_data_mem_pool);
|
|
|
|
|
}
|
|
|
|
|
mempool_destroy(phba->device_data_mem_pool);
|
|
|
|
|
}
|
|
|
|
|
phba->device_data_mem_pool = NULL;
|
2009-05-23 02:51:39 +08:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* lpfc_mem_free_all - Frees all PCI and driver memory
|
|
|
|
|
* @phba: HBA to free memory for
|
|
|
|
|
*
|
|
|
|
|
* Description: Free memory from PCI and driver memory pools and also those
|
2017-02-13 05:52:30 +08:00
|
|
|
* used : lpfc_sg_dma_buf_pool, lpfc_mbuf_pool, lpfc_hrb_pool. Frees
|
2009-05-23 02:51:39 +08:00
|
|
|
* kmalloc-backed mempools for LPFC_MBOXQ_t and lpfc_nodelist. Also frees
|
|
|
|
|
* the VPI bitmask.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
|
|
|
|
void
|
|
|
|
|
lpfc_mem_free_all(struct lpfc_hba *phba)
|
|
|
|
|
{
|
|
|
|
|
struct lpfc_sli *psli = &phba->sli;
|
|
|
|
|
LPFC_MBOXQ_t *mbox, *next_mbox;
|
|
|
|
|
struct lpfc_dmabuf *mp;
|
|
|
|
|
|
|
|
|
|
/* Free memory used in mailbox queue back to mailbox memory pool */
|
2005-04-18 05:05:31 +08:00
|
|
|
list_for_each_entry_safe(mbox, next_mbox, &psli->mboxq, list) {
|
2018-11-30 08:09:29 +08:00
|
|
|
mp = (struct lpfc_dmabuf *)(mbox->ctx_buf);
|
2005-04-18 05:05:31 +08:00
|
|
|
if (mp) {
|
|
|
|
|
lpfc_mbuf_free(phba, mp->virt, mp->phys);
|
|
|
|
|
kfree(mp);
|
|
|
|
|
}
|
|
|
|
|
list_del(&mbox->list);
|
|
|
|
|
mempool_free(mbox, phba->mbox_mem_pool);
|
|
|
|
|
}
|
2009-05-23 02:51:39 +08:00
|
|
|
/* Free memory used in mailbox cmpl list back to mailbox memory pool */
|
2007-06-18 08:56:38 +08:00
|
|
|
list_for_each_entry_safe(mbox, next_mbox, &psli->mboxq_cmpl, list) {
|
2018-11-30 08:09:29 +08:00
|
|
|
mp = (struct lpfc_dmabuf *)(mbox->ctx_buf);
|
2007-06-18 08:56:38 +08:00
|
|
|
if (mp) {
|
|
|
|
|
lpfc_mbuf_free(phba, mp->virt, mp->phys);
|
|
|
|
|
kfree(mp);
|
|
|
|
|
}
|
|
|
|
|
list_del(&mbox->list);
|
|
|
|
|
mempool_free(mbox, phba->mbox_mem_pool);
|
|
|
|
|
}
|
2009-05-23 02:51:39 +08:00
|
|
|
/* Free the active mailbox command back to the mailbox memory pool */
|
|
|
|
|
spin_lock_irq(&phba->hbalock);
|
2005-04-18 05:05:31 +08:00
|
|
|
psli->sli_flag &= ~LPFC_SLI_MBOX_ACTIVE;
|
2009-05-23 02:51:39 +08:00
|
|
|
spin_unlock_irq(&phba->hbalock);
|
2005-04-18 05:05:31 +08:00
|
|
|
if (psli->mbox_active) {
|
|
|
|
|
mbox = psli->mbox_active;
|
2018-11-30 08:09:29 +08:00
|
|
|
mp = (struct lpfc_dmabuf *)(mbox->ctx_buf);
|
2005-04-18 05:05:31 +08:00
|
|
|
if (mp) {
|
|
|
|
|
lpfc_mbuf_free(phba, mp->virt, mp->phys);
|
|
|
|
|
kfree(mp);
|
|
|
|
|
}
|
|
|
|
|
mempool_free(mbox, phba->mbox_mem_pool);
|
|
|
|
|
psli->mbox_active = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2009-05-23 02:51:39 +08:00
|
|
|
/* Free and destroy all the allocated memory pools */
|
|
|
|
|
lpfc_mem_free(phba);
|
2007-06-18 08:56:36 +08:00
|
|
|
|
scsi: lpfc: Support dynamic unbounded SGL lists on G7 hardware.
Typical SLI-4 hardware supports up to 2 4KB pages to be registered per XRI
to contain the exchanges Scatter/Gather List. This caps the number of SGL
elements that can be in the SGL. There are not extensions to extend the
list out of the 2 pages.
The G7 hardware adds a SGE type that allows the SGL to be vectored to a
different scatter/gather list segment. And that segment can contain a SGE
to go to another segment and so on. The initial segment must still be
pre-registered for the XRI, but it can be a much smaller amount (256Bytes)
as it can now be dynamically grown. This much smaller allocation can
handle the SG list for most normal I/O, and the dynamic aspect allows it to
support many MB's if needed.
The implementation creates a pool which contains "segments" and which is
initially sized to hold the initial small segment per xri. If an I/O
requires additional segments, they are allocated from the pool. If the
pool has no more segments, the pool is grown based on what is now
needed. After the I/O completes, the additional segments are returned to
the pool for use by other I/Os. Once allocated, the additional segments are
not released under the assumption of "if needed once, it will be needed
again". Pools are kept on a per-hardware queue basis, which is typically
1:1 per cpu, but may be shared by multiple cpus.
The switch to the smaller initial allocation significantly reduces the
memory footprint of the driver (which only grows if large ios are
issued). Based on the several K of XRIs for the adapter, the 8KB->256B
reduction can conserve 32MBs or more.
It has been observed with per-cpu resource pools that allocating a resource
on CPU A, may be put back on CPU B. While the get routines are distributed
evenly, only a limited subset of CPUs may be handling the put routines.
This can put a strain on the lpfc_put_cmd_rsp_buf_per_cpu routine because
all the resources are being put on a limited subset of CPUs.
Signed-off-by: Dick Kennedy <dick.kennedy@broadcom.com>
Signed-off-by: James Smart <jsmart2021@gmail.com>
Signed-off-by: Martin K. Petersen <martin.petersen@oracle.com>
2019-08-15 07:57:09 +08:00
|
|
|
/* Free DMA buffer memory pool */
|
|
|
|
|
dma_pool_destroy(phba->lpfc_sg_dma_buf_pool);
|
|
|
|
|
phba->lpfc_sg_dma_buf_pool = NULL;
|
|
|
|
|
|
|
|
|
|
dma_pool_destroy(phba->lpfc_cmd_rsp_buf_pool);
|
|
|
|
|
phba->lpfc_cmd_rsp_buf_pool = NULL;
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/* Free the iocb lookup array */
|
2006-07-07 03:49:34 +08:00
|
|
|
kfree(psli->iocbq_lookup);
|
|
|
|
|
psli->iocbq_lookup = NULL;
|
2009-05-23 02:51:39 +08:00
|
|
|
|
|
|
|
|
return;
|
2005-04-18 05:05:31 +08:00
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* lpfc_mbuf_alloc - Allocate an mbuf from the lpfc_mbuf_pool PCI pool
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA which owns the pool to allocate from
|
|
|
|
|
* @mem_flags: indicates if this is a priority (MEM_PRI) allocation
|
|
|
|
|
* @handle: used to return the DMA-mapped address of the mbuf
|
|
|
|
|
*
|
|
|
|
|
* Description: Allocates a DMA-mapped buffer from the lpfc_mbuf_pool PCI pool.
|
2017-07-06 16:13:05 +08:00
|
|
|
* Allocates from generic dma_pool_alloc function first and if that fails and
|
2008-08-25 09:49:00 +08:00
|
|
|
* mem_flags has MEM_PRI set (the only defined flag), returns an mbuf from the
|
|
|
|
|
* HBA's pool.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Not interrupt-safe. Must be called with no locks held. Takes
|
|
|
|
|
* phba->hbalock.
|
|
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* pointer to the allocated mbuf on success
|
|
|
|
|
* NULL on failure
|
|
|
|
|
**/
|
2005-04-18 05:05:31 +08:00
|
|
|
void *
|
|
|
|
|
lpfc_mbuf_alloc(struct lpfc_hba *phba, int mem_flags, dma_addr_t *handle)
|
|
|
|
|
{
|
|
|
|
|
struct lpfc_dma_pool *pool = &phba->lpfc_mbuf_safety_pool;
|
2007-06-18 08:56:36 +08:00
|
|
|
unsigned long iflags;
|
2005-04-18 05:05:31 +08:00
|
|
|
void *ret;
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
ret = dma_pool_alloc(phba->lpfc_mbuf_pool, GFP_KERNEL, handle);
|
2005-04-18 05:05:31 +08:00
|
|
|
|
2007-06-18 08:56:36 +08:00
|
|
|
spin_lock_irqsave(&phba->hbalock, iflags);
|
2007-06-18 08:56:38 +08:00
|
|
|
if (!ret && (mem_flags & MEM_PRI) && pool->current_count) {
|
2005-04-18 05:05:31 +08:00
|
|
|
pool->current_count--;
|
|
|
|
|
ret = pool->elements[pool->current_count].virt;
|
|
|
|
|
*handle = pool->elements[pool->current_count].phys;
|
|
|
|
|
}
|
2007-06-18 08:56:36 +08:00
|
|
|
spin_unlock_irqrestore(&phba->hbalock, iflags);
|
2005-04-18 05:05:31 +08:00
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* __lpfc_mbuf_free - Free an mbuf from the lpfc_mbuf_pool PCI pool (locked)
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA which owns the pool to return to
|
|
|
|
|
* @virt: mbuf to free
|
|
|
|
|
* @dma: the DMA-mapped address of the lpfc_mbuf_pool to be freed
|
|
|
|
|
*
|
|
|
|
|
* Description: Returns an mbuf lpfc_mbuf_pool to the lpfc_mbuf_safety_pool if
|
|
|
|
|
* it is below its max_count, frees the mbuf otherwise.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Must be called with phba->hbalock held to synchronize access to
|
|
|
|
|
* lpfc_mbuf_safety_pool.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
2005-04-18 05:05:31 +08:00
|
|
|
void
|
2007-06-18 08:56:36 +08:00
|
|
|
__lpfc_mbuf_free(struct lpfc_hba * phba, void *virt, dma_addr_t dma)
|
2005-04-18 05:05:31 +08:00
|
|
|
{
|
|
|
|
|
struct lpfc_dma_pool *pool = &phba->lpfc_mbuf_safety_pool;
|
|
|
|
|
|
|
|
|
|
if (pool->current_count < pool->max_count) {
|
|
|
|
|
pool->elements[pool->current_count].virt = virt;
|
|
|
|
|
pool->elements[pool->current_count].phys = dma;
|
|
|
|
|
pool->current_count++;
|
|
|
|
|
} else {
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_mbuf_pool, virt, dma);
|
2005-04-18 05:05:31 +08:00
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
2007-06-18 08:56:36 +08:00
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* lpfc_mbuf_free - Free an mbuf from the lpfc_mbuf_pool PCI pool (unlocked)
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA which owns the pool to return to
|
|
|
|
|
* @virt: mbuf to free
|
|
|
|
|
* @dma: the DMA-mapped address of the lpfc_mbuf_pool to be freed
|
|
|
|
|
*
|
|
|
|
|
* Description: Returns an mbuf lpfc_mbuf_pool to the lpfc_mbuf_safety_pool if
|
|
|
|
|
* it is below its max_count, frees the mbuf otherwise.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Takes phba->hbalock. Can be called with or without other locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
2007-06-18 08:56:36 +08:00
|
|
|
void
|
|
|
|
|
lpfc_mbuf_free(struct lpfc_hba * phba, void *virt, dma_addr_t dma)
|
|
|
|
|
{
|
|
|
|
|
unsigned long iflags;
|
|
|
|
|
|
|
|
|
|
spin_lock_irqsave(&phba->hbalock, iflags);
|
|
|
|
|
__lpfc_mbuf_free(phba, virt, dma);
|
|
|
|
|
spin_unlock_irqrestore(&phba->hbalock, iflags);
|
|
|
|
|
return;
|
|
|
|
|
}
|
2007-06-18 08:56:37 +08:00
|
|
|
|
2017-02-13 05:52:34 +08:00
|
|
|
/**
|
|
|
|
|
* lpfc_nvmet_buf_alloc - Allocate an nvmet_buf from the
|
|
|
|
|
* lpfc_sg_dma_buf_pool PCI pool
|
|
|
|
|
* @phba: HBA which owns the pool to allocate from
|
|
|
|
|
* @mem_flags: indicates if this is a priority (MEM_PRI) allocation
|
|
|
|
|
* @handle: used to return the DMA-mapped address of the nvmet_buf
|
|
|
|
|
*
|
|
|
|
|
* Description: Allocates a DMA-mapped buffer from the lpfc_sg_dma_buf_pool
|
2017-07-06 16:13:05 +08:00
|
|
|
* PCI pool. Allocates from generic dma_pool_alloc function.
|
2017-02-13 05:52:34 +08:00
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* pointer to the allocated nvmet_buf on success
|
|
|
|
|
* NULL on failure
|
|
|
|
|
**/
|
|
|
|
|
void *
|
|
|
|
|
lpfc_nvmet_buf_alloc(struct lpfc_hba *phba, int mem_flags, dma_addr_t *handle)
|
|
|
|
|
{
|
|
|
|
|
void *ret;
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
ret = dma_pool_alloc(phba->lpfc_sg_dma_buf_pool, GFP_KERNEL, handle);
|
2017-02-13 05:52:34 +08:00
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* lpfc_nvmet_buf_free - Free an nvmet_buf from the lpfc_sg_dma_buf_pool
|
|
|
|
|
* PCI pool
|
|
|
|
|
* @phba: HBA which owns the pool to return to
|
|
|
|
|
* @virt: nvmet_buf to free
|
|
|
|
|
* @dma: the DMA-mapped address of the lpfc_sg_dma_buf_pool to be freed
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
|
|
|
|
void
|
|
|
|
|
lpfc_nvmet_buf_free(struct lpfc_hba *phba, void *virt, dma_addr_t dma)
|
|
|
|
|
{
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_sg_dma_buf_pool, virt, dma);
|
2017-02-13 05:52:34 +08:00
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* lpfc_els_hbq_alloc - Allocate an HBQ buffer
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA to allocate HBQ buffer for
|
|
|
|
|
*
|
2009-05-23 02:51:39 +08:00
|
|
|
* Description: Allocates a DMA-mapped HBQ buffer from the lpfc_hrb_pool PCI
|
2008-08-25 09:49:00 +08:00
|
|
|
* pool along a non-DMA-mapped container for it.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Not interrupt-safe. Must be called with no locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* pointer to HBQ on success
|
|
|
|
|
* NULL on failure
|
|
|
|
|
**/
|
2007-08-02 23:10:31 +08:00
|
|
|
struct hbq_dmabuf *
|
|
|
|
|
lpfc_els_hbq_alloc(struct lpfc_hba *phba)
|
2007-06-18 08:56:37 +08:00
|
|
|
{
|
2007-08-02 23:10:31 +08:00
|
|
|
struct hbq_dmabuf *hbqbp;
|
|
|
|
|
|
2011-12-14 02:22:37 +08:00
|
|
|
hbqbp = kzalloc(sizeof(struct hbq_dmabuf), GFP_KERNEL);
|
2007-08-02 23:10:31 +08:00
|
|
|
if (!hbqbp)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
hbqbp->dbuf.virt = dma_pool_alloc(phba->lpfc_hbq_pool, GFP_KERNEL,
|
2007-08-02 23:10:31 +08:00
|
|
|
&hbqbp->dbuf.phys);
|
|
|
|
|
if (!hbqbp->dbuf.virt) {
|
|
|
|
|
kfree(hbqbp);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2017-02-13 05:52:30 +08:00
|
|
|
hbqbp->total_size = LPFC_BPL_SIZE;
|
2007-08-02 23:10:31 +08:00
|
|
|
return hbqbp;
|
2007-06-18 08:56:37 +08:00
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-05-23 02:51:39 +08:00
|
|
|
* lpfc_els_hbq_free - Frees an HBQ buffer allocated with lpfc_els_hbq_alloc
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA buffer was allocated for
|
|
|
|
|
* @hbqbp: HBQ container returned by lpfc_els_hbq_alloc
|
|
|
|
|
*
|
|
|
|
|
* Description: Frees both the container and the DMA-mapped buffer returned by
|
|
|
|
|
* lpfc_els_hbq_alloc.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Can be called with or without locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
2007-06-18 08:56:37 +08:00
|
|
|
void
|
2007-08-02 23:10:31 +08:00
|
|
|
lpfc_els_hbq_free(struct lpfc_hba *phba, struct hbq_dmabuf *hbqbp)
|
2007-06-18 08:56:37 +08:00
|
|
|
{
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_hbq_pool, hbqbp->dbuf.virt, hbqbp->dbuf.phys);
|
2007-08-02 23:10:31 +08:00
|
|
|
kfree(hbqbp);
|
2007-06-18 08:56:37 +08:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2009-05-23 02:51:39 +08:00
|
|
|
/**
|
|
|
|
|
* lpfc_sli4_rb_alloc - Allocate an SLI4 Receive buffer
|
|
|
|
|
* @phba: HBA to allocate a receive buffer for
|
|
|
|
|
*
|
|
|
|
|
* Description: Allocates a DMA-mapped receive buffer from the lpfc_hrb_pool PCI
|
|
|
|
|
* pool along a non-DMA-mapped container for it.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Not interrupt-safe. Must be called with no locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* pointer to HBQ on success
|
|
|
|
|
* NULL on failure
|
|
|
|
|
**/
|
|
|
|
|
struct hbq_dmabuf *
|
|
|
|
|
lpfc_sli4_rb_alloc(struct lpfc_hba *phba)
|
|
|
|
|
{
|
|
|
|
|
struct hbq_dmabuf *dma_buf;
|
|
|
|
|
|
2011-12-14 02:22:37 +08:00
|
|
|
dma_buf = kzalloc(sizeof(struct hbq_dmabuf), GFP_KERNEL);
|
2009-05-23 02:51:39 +08:00
|
|
|
if (!dma_buf)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_buf->hbuf.virt = dma_pool_alloc(phba->lpfc_hrb_pool, GFP_KERNEL,
|
2009-05-23 02:51:39 +08:00
|
|
|
&dma_buf->hbuf.phys);
|
|
|
|
|
if (!dma_buf->hbuf.virt) {
|
|
|
|
|
kfree(dma_buf);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_buf->dbuf.virt = dma_pool_alloc(phba->lpfc_drb_pool, GFP_KERNEL,
|
2009-05-23 02:51:39 +08:00
|
|
|
&dma_buf->dbuf.phys);
|
|
|
|
|
if (!dma_buf->dbuf.virt) {
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_hrb_pool, dma_buf->hbuf.virt,
|
2009-05-23 02:51:39 +08:00
|
|
|
dma_buf->hbuf.phys);
|
|
|
|
|
kfree(dma_buf);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2017-02-13 05:52:30 +08:00
|
|
|
dma_buf->total_size = LPFC_DATA_BUF_SIZE;
|
2009-05-23 02:51:39 +08:00
|
|
|
return dma_buf;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* lpfc_sli4_rb_free - Frees a receive buffer
|
|
|
|
|
* @phba: HBA buffer was allocated for
|
|
|
|
|
* @dmab: DMA Buffer container returned by lpfc_sli4_hbq_alloc
|
|
|
|
|
*
|
|
|
|
|
* Description: Frees both the container and the DMA-mapped buffers returned by
|
|
|
|
|
* lpfc_sli4_rb_alloc.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Can be called with or without locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
|
|
|
|
void
|
|
|
|
|
lpfc_sli4_rb_free(struct lpfc_hba *phba, struct hbq_dmabuf *dmab)
|
|
|
|
|
{
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_hrb_pool, dmab->hbuf.virt, dmab->hbuf.phys);
|
|
|
|
|
dma_pool_free(phba->lpfc_drb_pool, dmab->dbuf.virt, dmab->dbuf.phys);
|
2009-05-23 02:51:39 +08:00
|
|
|
kfree(dmab);
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-13 05:52:34 +08:00
|
|
|
/**
|
|
|
|
|
* lpfc_sli4_nvmet_alloc - Allocate an SLI4 Receive buffer
|
|
|
|
|
* @phba: HBA to allocate a receive buffer for
|
|
|
|
|
*
|
|
|
|
|
* Description: Allocates a DMA-mapped receive buffer from the lpfc_hrb_pool PCI
|
|
|
|
|
* pool along a non-DMA-mapped container for it.
|
|
|
|
|
*
|
|
|
|
|
* Returns:
|
|
|
|
|
* pointer to HBQ on success
|
|
|
|
|
* NULL on failure
|
|
|
|
|
**/
|
|
|
|
|
struct rqb_dmabuf *
|
|
|
|
|
lpfc_sli4_nvmet_alloc(struct lpfc_hba *phba)
|
|
|
|
|
{
|
|
|
|
|
struct rqb_dmabuf *dma_buf;
|
|
|
|
|
|
2020-10-21 04:27:11 +08:00
|
|
|
dma_buf = kzalloc(sizeof(*dma_buf), GFP_KERNEL);
|
2017-02-13 05:52:34 +08:00
|
|
|
if (!dma_buf)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_buf->hbuf.virt = dma_pool_alloc(phba->lpfc_hrb_pool, GFP_KERNEL,
|
2017-02-13 05:52:34 +08:00
|
|
|
&dma_buf->hbuf.phys);
|
|
|
|
|
if (!dma_buf->hbuf.virt) {
|
|
|
|
|
kfree(dma_buf);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_buf->dbuf.virt = dma_pool_alloc(phba->lpfc_nvmet_drb_pool,
|
2017-05-16 06:20:44 +08:00
|
|
|
GFP_KERNEL, &dma_buf->dbuf.phys);
|
2017-02-13 05:52:34 +08:00
|
|
|
if (!dma_buf->dbuf.virt) {
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_hrb_pool, dma_buf->hbuf.virt,
|
2017-02-13 05:52:34 +08:00
|
|
|
dma_buf->hbuf.phys);
|
|
|
|
|
kfree(dma_buf);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2017-05-16 06:20:44 +08:00
|
|
|
dma_buf->total_size = LPFC_NVMET_DATA_BUF_SIZE;
|
2017-02-13 05:52:34 +08:00
|
|
|
return dma_buf;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* lpfc_sli4_nvmet_free - Frees a receive buffer
|
|
|
|
|
* @phba: HBA buffer was allocated for
|
|
|
|
|
* @dmab: DMA Buffer container returned by lpfc_sli4_rbq_alloc
|
|
|
|
|
*
|
|
|
|
|
* Description: Frees both the container and the DMA-mapped buffers returned by
|
|
|
|
|
* lpfc_sli4_nvmet_alloc.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Can be called with or without locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
|
|
|
|
void
|
|
|
|
|
lpfc_sli4_nvmet_free(struct lpfc_hba *phba, struct rqb_dmabuf *dmab)
|
|
|
|
|
{
|
2017-07-06 16:13:05 +08:00
|
|
|
dma_pool_free(phba->lpfc_hrb_pool, dmab->hbuf.virt, dmab->hbuf.phys);
|
|
|
|
|
dma_pool_free(phba->lpfc_nvmet_drb_pool,
|
2017-05-16 06:20:44 +08:00
|
|
|
dmab->dbuf.virt, dmab->dbuf.phys);
|
2017-02-13 05:52:34 +08:00
|
|
|
kfree(dmab);
|
|
|
|
|
}
|
|
|
|
|
|
2008-08-25 09:49:00 +08:00
|
|
|
/**
|
2009-04-07 06:47:14 +08:00
|
|
|
* lpfc_in_buf_free - Free a DMA buffer
|
2008-08-25 09:49:00 +08:00
|
|
|
* @phba: HBA buffer is associated with
|
|
|
|
|
* @mp: Buffer to free
|
|
|
|
|
*
|
|
|
|
|
* Description: Frees the given DMA buffer in the appropriate way given if the
|
|
|
|
|
* HBA is running in SLI3 mode with HBQs enabled.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Takes phba->hbalock. Can be called with or without other locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
2007-06-18 08:56:38 +08:00
|
|
|
void
|
|
|
|
|
lpfc_in_buf_free(struct lpfc_hba *phba, struct lpfc_dmabuf *mp)
|
|
|
|
|
{
|
|
|
|
|
struct hbq_dmabuf *hbq_entry;
|
2008-02-09 07:50:25 +08:00
|
|
|
unsigned long flags;
|
2007-06-18 08:56:38 +08:00
|
|
|
|
2008-02-09 07:50:14 +08:00
|
|
|
if (!mp)
|
|
|
|
|
return;
|
|
|
|
|
|
2007-06-18 08:56:38 +08:00
|
|
|
if (phba->sli3_options & LPFC_SLI3_HBQ_ENABLED) {
|
2017-02-13 05:52:30 +08:00
|
|
|
hbq_entry = container_of(mp, struct hbq_dmabuf, dbuf);
|
2008-02-09 07:50:25 +08:00
|
|
|
/* Check whether HBQ is still in use */
|
|
|
|
|
spin_lock_irqsave(&phba->hbalock, flags);
|
|
|
|
|
if (!phba->hbq_in_use) {
|
|
|
|
|
spin_unlock_irqrestore(&phba->hbalock, flags);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
list_del(&hbq_entry->dbuf.list);
|
2007-06-18 08:56:38 +08:00
|
|
|
if (hbq_entry->tag == -1) {
|
2007-08-02 23:10:31 +08:00
|
|
|
(phba->hbqs[LPFC_ELS_HBQ].hbq_free_buffer)
|
|
|
|
|
(phba, hbq_entry);
|
2007-06-18 08:56:38 +08:00
|
|
|
} else {
|
|
|
|
|
lpfc_sli_free_hbq(phba, hbq_entry);
|
|
|
|
|
}
|
2008-02-09 07:50:25 +08:00
|
|
|
spin_unlock_irqrestore(&phba->hbalock, flags);
|
2007-06-18 08:56:38 +08:00
|
|
|
} else {
|
|
|
|
|
lpfc_mbuf_free(phba, mp->virt, mp->phys);
|
|
|
|
|
kfree(mp);
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
2017-02-13 05:52:37 +08:00
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* lpfc_rq_buf_free - Free a RQ DMA buffer
|
|
|
|
|
* @phba: HBA buffer is associated with
|
|
|
|
|
* @mp: Buffer to free
|
|
|
|
|
*
|
|
|
|
|
* Description: Frees the given DMA buffer in the appropriate way given by
|
|
|
|
|
* reposting it to its associated RQ so it can be reused.
|
|
|
|
|
*
|
|
|
|
|
* Notes: Takes phba->hbalock. Can be called with or without other locks held.
|
|
|
|
|
*
|
|
|
|
|
* Returns: None
|
|
|
|
|
**/
|
|
|
|
|
void
|
|
|
|
|
lpfc_rq_buf_free(struct lpfc_hba *phba, struct lpfc_dmabuf *mp)
|
|
|
|
|
{
|
|
|
|
|
struct lpfc_rqb *rqbp;
|
|
|
|
|
struct lpfc_rqe hrqe;
|
|
|
|
|
struct lpfc_rqe drqe;
|
|
|
|
|
struct rqb_dmabuf *rqb_entry;
|
|
|
|
|
unsigned long flags;
|
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
|
|
if (!mp)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
rqb_entry = container_of(mp, struct rqb_dmabuf, hbuf);
|
|
|
|
|
rqbp = rqb_entry->hrq->rqbp;
|
|
|
|
|
|
|
|
|
|
spin_lock_irqsave(&phba->hbalock, flags);
|
|
|
|
|
list_del(&rqb_entry->hbuf.list);
|
|
|
|
|
hrqe.address_lo = putPaddrLow(rqb_entry->hbuf.phys);
|
|
|
|
|
hrqe.address_hi = putPaddrHigh(rqb_entry->hbuf.phys);
|
|
|
|
|
drqe.address_lo = putPaddrLow(rqb_entry->dbuf.phys);
|
|
|
|
|
drqe.address_hi = putPaddrHigh(rqb_entry->dbuf.phys);
|
|
|
|
|
rc = lpfc_sli4_rq_put(rqb_entry->hrq, rqb_entry->drq, &hrqe, &drqe);
|
|
|
|
|
if (rc < 0) {
|
2017-05-16 06:20:45 +08:00
|
|
|
lpfc_printf_log(phba, KERN_ERR, LOG_INIT,
|
2018-01-31 07:58:52 +08:00
|
|
|
"6409 Cannot post to HRQ %d: %x %x %x "
|
|
|
|
|
"DRQ %x %x\n",
|
2017-05-16 06:20:45 +08:00
|
|
|
rqb_entry->hrq->queue_id,
|
|
|
|
|
rqb_entry->hrq->host_index,
|
2018-01-31 07:58:52 +08:00
|
|
|
rqb_entry->hrq->hba_index,
|
|
|
|
|
rqb_entry->hrq->entry_count,
|
|
|
|
|
rqb_entry->drq->host_index,
|
|
|
|
|
rqb_entry->drq->hba_index);
|
2020-10-21 04:27:13 +08:00
|
|
|
(rqbp->rqb_free_buffer)(phba, rqb_entry);
|
2017-02-13 05:52:37 +08:00
|
|
|
} else {
|
|
|
|
|
list_add_tail(&rqb_entry->hbuf.list, &rqbp->rqb_buffer_list);
|
|
|
|
|
rqbp->buffer_count++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&phba->hbalock, flags);
|
|
|
|
|
}
|