121 lines
4.1 KiB
C
121 lines
4.1 KiB
C
|
/*
|
||
|
* Copyright(c) 2015 Intel Corporation.
|
||
|
*
|
||
|
* This file is provided under a dual BSD/GPLv2 license. When using or
|
||
|
* redistributing this file, you may do so under either license.
|
||
|
*
|
||
|
* GPL LICENSE SUMMARY
|
||
|
*
|
||
|
* This program is free software; you can redistribute it and/or 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, but
|
||
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
|
* General Public License for more details.
|
||
|
*
|
||
|
* BSD LICENSE
|
||
|
*
|
||
|
* 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.
|
||
|
* - Neither the name of Intel Corporation nor the names of its
|
||
|
* contributors may be used to endorse or promote products derived
|
||
|
* from this software without specific prior written permission.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*
|
||
|
*/
|
||
|
|
||
|
#include "qp.h"
|
||
|
|
||
|
/**
|
||
|
* rvt_create_qp - create a queue pair for a device
|
||
|
* @ibpd: the protection domain who's device we create the queue pair for
|
||
|
* @init_attr: the attributes of the queue pair
|
||
|
* @udata: user data for libibverbs.so
|
||
|
*
|
||
|
* Returns the queue pair on success, otherwise returns an errno.
|
||
|
*
|
||
|
* Called by the ib_create_qp() core verbs function.
|
||
|
*/
|
||
|
struct ib_qp *rvt_create_qp(struct ib_pd *ibpd,
|
||
|
struct ib_qp_init_attr *init_attr,
|
||
|
struct ib_udata *udata)
|
||
|
{
|
||
|
/*
|
||
|
* Queue pair creation is mostly an rvt issue. However, drivers have
|
||
|
* their own unique idea of what queue pare numbers mean. For instance
|
||
|
* there is a reserved range for PSM.
|
||
|
*
|
||
|
* VI-DRIVER-API: make_qpn()
|
||
|
* Returns a valid QPN for verbs to use
|
||
|
*/
|
||
|
return ERR_PTR(-EOPNOTSUPP);
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* qib_modify_qp - modify the attributes of a queue pair
|
||
|
* @ibqp: the queue pair who's attributes we're modifying
|
||
|
* @attr: the new attributes
|
||
|
* @attr_mask: the mask of attributes to modify
|
||
|
* @udata: user data for libibverbs.so
|
||
|
*
|
||
|
* Returns 0 on success, otherwise returns an errno.
|
||
|
*/
|
||
|
int rvt_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
|
||
|
int attr_mask, struct ib_udata *udata)
|
||
|
{
|
||
|
/*
|
||
|
* VT-DRIVER-API: qp_mtu()
|
||
|
* OPA devices have a per VL MTU the driver has a mapping of IB SL to SC
|
||
|
* to VL and the mapping table of MTUs per VL. This is not something
|
||
|
* that IB has and should not live in the rvt.
|
||
|
*/
|
||
|
return -EOPNOTSUPP;
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* rvt_destroy_qp - destroy a queue pair
|
||
|
* @ibqp: the queue pair to destroy
|
||
|
*
|
||
|
* Returns 0 on success.
|
||
|
*
|
||
|
* Note that this can be called while the QP is actively sending or
|
||
|
* receiving!
|
||
|
*/
|
||
|
int rvt_destroy_qp(struct ib_qp *ibqp)
|
||
|
{
|
||
|
/*
|
||
|
* VT-DRIVER-API: qp_flush()
|
||
|
* Driver provies a mechanism to flush and wait for that flush to
|
||
|
* finish.
|
||
|
*/
|
||
|
|
||
|
return -EOPNOTSUPP;
|
||
|
}
|
||
|
|
||
|
int rvt_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
|
||
|
int attr_mask, struct ib_qp_init_attr *init_attr)
|
||
|
{
|
||
|
return -EOPNOTSUPP;
|
||
|
}
|