2007-02-13 08:16:18 +08:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 Chelsio, Inc. All rights reserved.
|
|
|
|
*
|
|
|
|
* This software is available to you under a choice of one of two
|
|
|
|
* licenses. You may choose to be licensed under the terms of the GNU
|
|
|
|
* General Public License (GPL) Version 2, available from the file
|
|
|
|
* COPYING in the main directory of this source tree, or the
|
|
|
|
* OpenIB.org BSD license below:
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or
|
|
|
|
* without modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer.
|
|
|
|
*
|
|
|
|
* - Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials
|
|
|
|
* provided with the distribution.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*/
|
|
|
|
#ifndef __CXIO_HAL_H__
|
|
|
|
#define __CXIO_HAL_H__
|
|
|
|
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/mutex.h>
|
kfifo: move struct kfifo in place
This is a new generic kernel FIFO implementation.
The current kernel fifo API is not very widely used, because it has to
many constrains. Only 17 files in the current 2.6.31-rc5 used it.
FIFO's are like list's a very basic thing and a kfifo API which handles
the most use case would save a lot of development time and memory
resources.
I think this are the reasons why kfifo is not in use:
- The API is to simple, important functions are missing
- A fifo can be only allocated dynamically
- There is a requirement of a spinlock whether you need it or not
- There is no support for data records inside a fifo
So I decided to extend the kfifo in a more generic way without blowing up
the API to much. The new API has the following benefits:
- Generic usage: For kernel internal use and/or device driver.
- Provide an API for the most use case.
- Slim API: The whole API provides 25 functions.
- Linux style habit.
- DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros
- Direct copy_to_user from the fifo and copy_from_user into the fifo.
- The kfifo itself is an in place member of the using data structure, this save an
indirection access and does not waste the kernel allocator.
- Lockless access: if only one reader and one writer is active on the fifo,
which is the common use case, no additional locking is necessary.
- Remove spinlock - give the user the freedom of choice what kind of locking to use if
one is required.
- Ability to handle records. Three type of records are supported:
- Variable length records between 0-255 bytes, with a record size
field of 1 bytes.
- Variable length records between 0-65535 bytes, with a record size
field of 2 bytes.
- Fixed size records, which no record size field.
- Preserve memory resource.
- Performance!
- Easy to use!
This patch:
Since most users want to have the kfifo as part of another object,
reorganize the code to allow including struct kfifo in another data
structure. This requires changing the kfifo_alloc and kfifo_init
prototypes so that we pass an existing kfifo pointer into them. This
patch changes the implementation and all existing users.
[akpm@linux-foundation.org: fix warning]
Signed-off-by: Stefani Seibold <stefani@seibold.net>
Acked-by: Greg Kroah-Hartman <gregkh@suse.de>
Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-12-22 06:37:26 +08:00
|
|
|
#include <linux/kfifo.h>
|
2007-02-13 08:16:18 +08:00
|
|
|
|
|
|
|
#include "t3_cpl.h"
|
|
|
|
#include "t3cdev.h"
|
|
|
|
#include "cxgb3_ctl_defs.h"
|
|
|
|
#include "cxio_wr.h"
|
|
|
|
|
|
|
|
#define T3_CTRL_QP_ID FW_RI_SGEEC_START
|
|
|
|
#define T3_CTL_QP_TID FW_RI_TID_START
|
|
|
|
#define T3_CTRL_QP_SIZE_LOG2 8
|
|
|
|
#define T3_CTRL_CQ_ID 0
|
|
|
|
|
|
|
|
#define T3_MAX_NUM_RI (1<<15)
|
|
|
|
#define T3_MAX_NUM_QP (1<<15)
|
|
|
|
#define T3_MAX_NUM_CQ (1<<15)
|
|
|
|
#define T3_MAX_NUM_PD (1<<15)
|
|
|
|
#define T3_MAX_PBL_SIZE 256
|
|
|
|
#define T3_MAX_RQ_SIZE 1024
|
2008-07-15 14:48:47 +08:00
|
|
|
#define T3_MAX_QP_DEPTH (T3_MAX_RQ_SIZE-1)
|
2010-08-28 21:35:05 +08:00
|
|
|
#define T3_MAX_CQ_DEPTH 65536
|
2007-02-13 08:16:18 +08:00
|
|
|
#define T3_MAX_NUM_STAG (1<<15)
|
2008-04-30 04:46:52 +08:00
|
|
|
#define T3_MAX_MR_SIZE 0x100000000ULL
|
2008-07-15 14:48:49 +08:00
|
|
|
#define T3_PAGESIZE_MASK 0xffff000 /* 4KB-128MB */
|
2007-02-13 08:16:18 +08:00
|
|
|
|
|
|
|
#define T3_STAG_UNSET 0xffffffff
|
|
|
|
|
|
|
|
#define T3_MAX_DEV_NAME_LEN 32
|
|
|
|
|
2009-03-25 11:44:18 +08:00
|
|
|
#define CXIO_FW_MAJ 7
|
|
|
|
|
2007-02-13 08:16:18 +08:00
|
|
|
struct cxio_hal_ctrl_qp {
|
|
|
|
u32 wptr;
|
|
|
|
u32 rptr;
|
|
|
|
struct mutex lock; /* for the wtpr, can sleep */
|
|
|
|
wait_queue_head_t waitq;/* wait for RspQ/CQE msg */
|
|
|
|
union t3_wr *workq; /* the work request queue */
|
|
|
|
dma_addr_t dma_addr; /* pci bus address of the workq */
|
2010-04-02 12:29:38 +08:00
|
|
|
DEFINE_DMA_UNMAP_ADDR(mapping);
|
2007-02-13 08:16:18 +08:00
|
|
|
void __iomem *doorbell;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct cxio_hal_resource {
|
kfifo: move struct kfifo in place
This is a new generic kernel FIFO implementation.
The current kernel fifo API is not very widely used, because it has to
many constrains. Only 17 files in the current 2.6.31-rc5 used it.
FIFO's are like list's a very basic thing and a kfifo API which handles
the most use case would save a lot of development time and memory
resources.
I think this are the reasons why kfifo is not in use:
- The API is to simple, important functions are missing
- A fifo can be only allocated dynamically
- There is a requirement of a spinlock whether you need it or not
- There is no support for data records inside a fifo
So I decided to extend the kfifo in a more generic way without blowing up
the API to much. The new API has the following benefits:
- Generic usage: For kernel internal use and/or device driver.
- Provide an API for the most use case.
- Slim API: The whole API provides 25 functions.
- Linux style habit.
- DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros
- Direct copy_to_user from the fifo and copy_from_user into the fifo.
- The kfifo itself is an in place member of the using data structure, this save an
indirection access and does not waste the kernel allocator.
- Lockless access: if only one reader and one writer is active on the fifo,
which is the common use case, no additional locking is necessary.
- Remove spinlock - give the user the freedom of choice what kind of locking to use if
one is required.
- Ability to handle records. Three type of records are supported:
- Variable length records between 0-255 bytes, with a record size
field of 1 bytes.
- Variable length records between 0-65535 bytes, with a record size
field of 2 bytes.
- Fixed size records, which no record size field.
- Preserve memory resource.
- Performance!
- Easy to use!
This patch:
Since most users want to have the kfifo as part of another object,
reorganize the code to allow including struct kfifo in another data
structure. This requires changing the kfifo_alloc and kfifo_init
prototypes so that we pass an existing kfifo pointer into them. This
patch changes the implementation and all existing users.
[akpm@linux-foundation.org: fix warning]
Signed-off-by: Stefani Seibold <stefani@seibold.net>
Acked-by: Greg Kroah-Hartman <gregkh@suse.de>
Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-12-22 06:37:26 +08:00
|
|
|
struct kfifo tpt_fifo;
|
2007-02-13 08:16:18 +08:00
|
|
|
spinlock_t tpt_fifo_lock;
|
kfifo: move struct kfifo in place
This is a new generic kernel FIFO implementation.
The current kernel fifo API is not very widely used, because it has to
many constrains. Only 17 files in the current 2.6.31-rc5 used it.
FIFO's are like list's a very basic thing and a kfifo API which handles
the most use case would save a lot of development time and memory
resources.
I think this are the reasons why kfifo is not in use:
- The API is to simple, important functions are missing
- A fifo can be only allocated dynamically
- There is a requirement of a spinlock whether you need it or not
- There is no support for data records inside a fifo
So I decided to extend the kfifo in a more generic way without blowing up
the API to much. The new API has the following benefits:
- Generic usage: For kernel internal use and/or device driver.
- Provide an API for the most use case.
- Slim API: The whole API provides 25 functions.
- Linux style habit.
- DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros
- Direct copy_to_user from the fifo and copy_from_user into the fifo.
- The kfifo itself is an in place member of the using data structure, this save an
indirection access and does not waste the kernel allocator.
- Lockless access: if only one reader and one writer is active on the fifo,
which is the common use case, no additional locking is necessary.
- Remove spinlock - give the user the freedom of choice what kind of locking to use if
one is required.
- Ability to handle records. Three type of records are supported:
- Variable length records between 0-255 bytes, with a record size
field of 1 bytes.
- Variable length records between 0-65535 bytes, with a record size
field of 2 bytes.
- Fixed size records, which no record size field.
- Preserve memory resource.
- Performance!
- Easy to use!
This patch:
Since most users want to have the kfifo as part of another object,
reorganize the code to allow including struct kfifo in another data
structure. This requires changing the kfifo_alloc and kfifo_init
prototypes so that we pass an existing kfifo pointer into them. This
patch changes the implementation and all existing users.
[akpm@linux-foundation.org: fix warning]
Signed-off-by: Stefani Seibold <stefani@seibold.net>
Acked-by: Greg Kroah-Hartman <gregkh@suse.de>
Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-12-22 06:37:26 +08:00
|
|
|
struct kfifo qpid_fifo;
|
2007-02-13 08:16:18 +08:00
|
|
|
spinlock_t qpid_fifo_lock;
|
kfifo: move struct kfifo in place
This is a new generic kernel FIFO implementation.
The current kernel fifo API is not very widely used, because it has to
many constrains. Only 17 files in the current 2.6.31-rc5 used it.
FIFO's are like list's a very basic thing and a kfifo API which handles
the most use case would save a lot of development time and memory
resources.
I think this are the reasons why kfifo is not in use:
- The API is to simple, important functions are missing
- A fifo can be only allocated dynamically
- There is a requirement of a spinlock whether you need it or not
- There is no support for data records inside a fifo
So I decided to extend the kfifo in a more generic way without blowing up
the API to much. The new API has the following benefits:
- Generic usage: For kernel internal use and/or device driver.
- Provide an API for the most use case.
- Slim API: The whole API provides 25 functions.
- Linux style habit.
- DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros
- Direct copy_to_user from the fifo and copy_from_user into the fifo.
- The kfifo itself is an in place member of the using data structure, this save an
indirection access and does not waste the kernel allocator.
- Lockless access: if only one reader and one writer is active on the fifo,
which is the common use case, no additional locking is necessary.
- Remove spinlock - give the user the freedom of choice what kind of locking to use if
one is required.
- Ability to handle records. Three type of records are supported:
- Variable length records between 0-255 bytes, with a record size
field of 1 bytes.
- Variable length records between 0-65535 bytes, with a record size
field of 2 bytes.
- Fixed size records, which no record size field.
- Preserve memory resource.
- Performance!
- Easy to use!
This patch:
Since most users want to have the kfifo as part of another object,
reorganize the code to allow including struct kfifo in another data
structure. This requires changing the kfifo_alloc and kfifo_init
prototypes so that we pass an existing kfifo pointer into them. This
patch changes the implementation and all existing users.
[akpm@linux-foundation.org: fix warning]
Signed-off-by: Stefani Seibold <stefani@seibold.net>
Acked-by: Greg Kroah-Hartman <gregkh@suse.de>
Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-12-22 06:37:26 +08:00
|
|
|
struct kfifo cqid_fifo;
|
2007-02-13 08:16:18 +08:00
|
|
|
spinlock_t cqid_fifo_lock;
|
kfifo: move struct kfifo in place
This is a new generic kernel FIFO implementation.
The current kernel fifo API is not very widely used, because it has to
many constrains. Only 17 files in the current 2.6.31-rc5 used it.
FIFO's are like list's a very basic thing and a kfifo API which handles
the most use case would save a lot of development time and memory
resources.
I think this are the reasons why kfifo is not in use:
- The API is to simple, important functions are missing
- A fifo can be only allocated dynamically
- There is a requirement of a spinlock whether you need it or not
- There is no support for data records inside a fifo
So I decided to extend the kfifo in a more generic way without blowing up
the API to much. The new API has the following benefits:
- Generic usage: For kernel internal use and/or device driver.
- Provide an API for the most use case.
- Slim API: The whole API provides 25 functions.
- Linux style habit.
- DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros
- Direct copy_to_user from the fifo and copy_from_user into the fifo.
- The kfifo itself is an in place member of the using data structure, this save an
indirection access and does not waste the kernel allocator.
- Lockless access: if only one reader and one writer is active on the fifo,
which is the common use case, no additional locking is necessary.
- Remove spinlock - give the user the freedom of choice what kind of locking to use if
one is required.
- Ability to handle records. Three type of records are supported:
- Variable length records between 0-255 bytes, with a record size
field of 1 bytes.
- Variable length records between 0-65535 bytes, with a record size
field of 2 bytes.
- Fixed size records, which no record size field.
- Preserve memory resource.
- Performance!
- Easy to use!
This patch:
Since most users want to have the kfifo as part of another object,
reorganize the code to allow including struct kfifo in another data
structure. This requires changing the kfifo_alloc and kfifo_init
prototypes so that we pass an existing kfifo pointer into them. This
patch changes the implementation and all existing users.
[akpm@linux-foundation.org: fix warning]
Signed-off-by: Stefani Seibold <stefani@seibold.net>
Acked-by: Greg Kroah-Hartman <gregkh@suse.de>
Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-12-22 06:37:26 +08:00
|
|
|
struct kfifo pdid_fifo;
|
2007-02-13 08:16:18 +08:00
|
|
|
spinlock_t pdid_fifo_lock;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct cxio_qpid_list {
|
|
|
|
struct list_head entry;
|
|
|
|
u32 qpid;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct cxio_ucontext {
|
|
|
|
struct list_head qpids;
|
|
|
|
struct mutex lock;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct cxio_rdev {
|
|
|
|
char dev_name[T3_MAX_DEV_NAME_LEN];
|
|
|
|
struct t3cdev *t3cdev_p;
|
|
|
|
struct rdma_info rnic_info;
|
|
|
|
struct adap_ports port_info;
|
|
|
|
struct cxio_hal_resource *rscp;
|
|
|
|
struct cxio_hal_ctrl_qp ctrl_qp;
|
|
|
|
void *ulp;
|
|
|
|
unsigned long qpshift;
|
|
|
|
u32 qpnr;
|
|
|
|
u32 qpmask;
|
|
|
|
struct cxio_ucontext uctx;
|
|
|
|
struct gen_pool *pbl_pool;
|
|
|
|
struct gen_pool *rqt_pool;
|
|
|
|
struct list_head entry;
|
2009-03-25 11:44:18 +08:00
|
|
|
struct ch_embedded_info fw_info;
|
2009-01-27 14:22:19 +08:00
|
|
|
u32 flags;
|
|
|
|
#define CXIO_ERROR_FATAL 1
|
2007-02-13 08:16:18 +08:00
|
|
|
};
|
|
|
|
|
2009-03-30 23:37:56 +08:00
|
|
|
static inline int cxio_fatal_error(struct cxio_rdev *rdev_p)
|
|
|
|
{
|
|
|
|
return rdev_p->flags & CXIO_ERROR_FATAL;
|
|
|
|
}
|
|
|
|
|
2007-02-13 08:16:18 +08:00
|
|
|
static inline int cxio_num_stags(struct cxio_rdev *rdev_p)
|
|
|
|
{
|
|
|
|
return min((int)T3_MAX_NUM_STAG, (int)((rdev_p->rnic_info.tpt_top - rdev_p->rnic_info.tpt_base) >> 5));
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef void (*cxio_hal_ev_callback_func_t) (struct cxio_rdev * rdev_p,
|
|
|
|
struct sk_buff * skb);
|
|
|
|
|
|
|
|
#define RSPQ_CQID(rsp) (be32_to_cpu(rsp->cq_ptrid) & 0xffff)
|
|
|
|
#define RSPQ_CQPTR(rsp) ((be32_to_cpu(rsp->cq_ptrid) >> 16) & 0xffff)
|
|
|
|
#define RSPQ_GENBIT(rsp) ((be32_to_cpu(rsp->flags) >> 16) & 1)
|
|
|
|
#define RSPQ_OVERFLOW(rsp) ((be32_to_cpu(rsp->flags) >> 17) & 1)
|
|
|
|
#define RSPQ_AN(rsp) ((be32_to_cpu(rsp->flags) >> 18) & 1)
|
|
|
|
#define RSPQ_SE(rsp) ((be32_to_cpu(rsp->flags) >> 19) & 1)
|
|
|
|
#define RSPQ_NOTIFY(rsp) ((be32_to_cpu(rsp->flags) >> 20) & 1)
|
|
|
|
#define RSPQ_CQBRANCH(rsp) ((be32_to_cpu(rsp->flags) >> 21) & 1)
|
|
|
|
#define RSPQ_CREDIT_THRESH(rsp) ((be32_to_cpu(rsp->flags) >> 22) & 1)
|
|
|
|
|
|
|
|
struct respQ_msg_t {
|
|
|
|
__be32 flags; /* flit 0 */
|
|
|
|
__be32 cq_ptrid;
|
|
|
|
__be64 rsvd; /* flit 1 */
|
|
|
|
struct t3_cqe cqe; /* flits 2-3 */
|
|
|
|
};
|
|
|
|
|
|
|
|
enum t3_cq_opcode {
|
|
|
|
CQ_ARM_AN = 0x2,
|
|
|
|
CQ_ARM_SE = 0x6,
|
|
|
|
CQ_FORCE_AN = 0x3,
|
|
|
|
CQ_CREDIT_UPDATE = 0x7
|
|
|
|
};
|
|
|
|
|
|
|
|
int cxio_rdev_open(struct cxio_rdev *rdev);
|
|
|
|
void cxio_rdev_close(struct cxio_rdev *rdev);
|
|
|
|
int cxio_hal_cq_op(struct cxio_rdev *rdev, struct t3_cq *cq,
|
|
|
|
enum t3_cq_opcode op, u32 credit);
|
2010-01-28 04:22:34 +08:00
|
|
|
int cxio_create_cq(struct cxio_rdev *rdev, struct t3_cq *cq, int kernel);
|
2019-05-28 19:37:28 +08:00
|
|
|
void cxio_destroy_cq(struct cxio_rdev *rdev, struct t3_cq *cq);
|
2007-02-13 08:16:18 +08:00
|
|
|
void cxio_release_ucontext(struct cxio_rdev *rdev, struct cxio_ucontext *uctx);
|
|
|
|
void cxio_init_ucontext(struct cxio_rdev *rdev, struct cxio_ucontext *uctx);
|
|
|
|
int cxio_create_qp(struct cxio_rdev *rdev, u32 kernel_domain, struct t3_wq *wq,
|
|
|
|
struct cxio_ucontext *uctx);
|
|
|
|
int cxio_destroy_qp(struct cxio_rdev *rdev, struct t3_wq *wq,
|
|
|
|
struct cxio_ucontext *uctx);
|
|
|
|
int cxio_peek_cq(struct t3_wq *wr, struct t3_cq *cq, int opcode);
|
2008-05-07 06:56:22 +08:00
|
|
|
int cxio_write_pbl(struct cxio_rdev *rdev_p, __be64 *pbl,
|
|
|
|
u32 pbl_addr, u32 pbl_size);
|
2007-02-13 08:16:18 +08:00
|
|
|
int cxio_register_phys_mem(struct cxio_rdev *rdev, u32 * stag, u32 pdid,
|
|
|
|
enum tpt_mem_perm perm, u32 zbva, u64 to, u32 len,
|
2008-05-07 06:56:22 +08:00
|
|
|
u8 page_size, u32 pbl_size, u32 pbl_addr);
|
2007-02-13 08:16:18 +08:00
|
|
|
int cxio_reregister_phys_mem(struct cxio_rdev *rdev, u32 * stag, u32 pdid,
|
|
|
|
enum tpt_mem_perm perm, u32 zbva, u64 to, u32 len,
|
2008-05-07 06:56:22 +08:00
|
|
|
u8 page_size, u32 pbl_size, u32 pbl_addr);
|
2007-02-13 08:16:18 +08:00
|
|
|
int cxio_dereg_mem(struct cxio_rdev *rdev, u32 stag, u32 pbl_size,
|
|
|
|
u32 pbl_addr);
|
|
|
|
int cxio_allocate_window(struct cxio_rdev *rdev, u32 * stag, u32 pdid);
|
2008-07-15 14:48:45 +08:00
|
|
|
int cxio_allocate_stag(struct cxio_rdev *rdev, u32 *stag, u32 pdid, u32 pbl_size, u32 pbl_addr);
|
2007-02-13 08:16:18 +08:00
|
|
|
int cxio_deallocate_window(struct cxio_rdev *rdev, u32 stag);
|
|
|
|
int cxio_rdma_init(struct cxio_rdev *rdev, struct t3_rdma_init_attr *attr);
|
|
|
|
void cxio_register_ev_cb(cxio_hal_ev_callback_func_t ev_cb);
|
|
|
|
void cxio_unregister_ev_cb(cxio_hal_ev_callback_func_t ev_cb);
|
|
|
|
u32 cxio_hal_get_pdid(struct cxio_hal_resource *rscp);
|
|
|
|
void cxio_hal_put_pdid(struct cxio_hal_resource *rscp, u32 pdid);
|
|
|
|
int __init cxio_hal_init(void);
|
|
|
|
void __exit cxio_hal_exit(void);
|
2008-05-03 00:17:41 +08:00
|
|
|
int cxio_flush_rq(struct t3_wq *wq, struct t3_cq *cq, int count);
|
|
|
|
int cxio_flush_sq(struct t3_wq *wq, struct t3_cq *cq, int count);
|
2007-02-13 08:16:18 +08:00
|
|
|
void cxio_count_rcqes(struct t3_cq *cq, struct t3_wq *wq, int *count);
|
|
|
|
void cxio_count_scqes(struct t3_cq *cq, struct t3_wq *wq, int *count);
|
|
|
|
void cxio_flush_hw_cq(struct t3_cq *cq);
|
|
|
|
int cxio_poll_cq(struct t3_wq *wq, struct t3_cq *cq, struct t3_cqe *cqe,
|
|
|
|
u8 *cqe_flushed, u64 *cookie, u32 *credit);
|
2009-03-30 23:37:56 +08:00
|
|
|
int iwch_cxgb3_ofld_send(struct t3cdev *tdev, struct sk_buff *skb);
|
2007-02-13 08:16:18 +08:00
|
|
|
|
2017-02-10 06:23:48 +08:00
|
|
|
#ifdef pr_fmt
|
|
|
|
#undef pr_fmt
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2007-02-13 08:16:18 +08:00
|
|
|
#endif
|