4c6e4d4963
The NVMe over Fabrics target library now exposes a simple function call that polls the acceptor once, and the application handles registration of the poller. Also rename the transport function pointers related to the acceptor so they better reflect their purpose. Change-Id: I5fa0d516586bf17e73afeb88ff3c2d5b0d46794d Signed-off-by: Daniel Verkamp <daniel.verkamp@intel.com>
134 lines
3.2 KiB
C
134 lines
3.2 KiB
C
/*-
|
|
* BSD LICENSE
|
|
*
|
|
* Copyright (c) Intel Corporation.
|
|
* All rights reserved.
|
|
*
|
|
* 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 "transport.h"
|
|
|
|
#include <stdlib.h>
|
|
#include <strings.h>
|
|
|
|
#include "spdk/log.h"
|
|
#include "spdk/queue.h"
|
|
|
|
#include "nvmf_internal.h"
|
|
|
|
static const struct spdk_nvmf_transport *const g_transports[] = {
|
|
#ifdef SPDK_CONFIG_RDMA
|
|
&spdk_nvmf_transport_rdma,
|
|
#endif
|
|
};
|
|
|
|
#define NUM_TRANSPORTS (sizeof(g_transports) / sizeof(*g_transports))
|
|
|
|
int
|
|
spdk_nvmf_transport_init(void)
|
|
{
|
|
size_t i;
|
|
int count = 0;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
if (g_transports[i]->transport_init(g_nvmf_tgt.max_queue_depth, g_nvmf_tgt.max_io_size,
|
|
g_nvmf_tgt.in_capsule_data_size) < 0) {
|
|
SPDK_NOTICELOG("%s transport init failed\n", g_transports[i]->name);
|
|
} else {
|
|
count++;
|
|
}
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
int
|
|
spdk_nvmf_transport_fini(void)
|
|
{
|
|
size_t i;
|
|
int count = 0;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
if (g_transports[i]->transport_fini() < 0) {
|
|
SPDK_NOTICELOG("%s transport fini failed\n", g_transports[i]->name);
|
|
} else {
|
|
count++;
|
|
}
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
int
|
|
spdk_nvmf_acceptor_init(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
if (g_transports[i]->acceptor_init() < 0) {
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
spdk_nvmf_acceptor_poll(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
g_transports[i]->acceptor_poll();
|
|
}
|
|
}
|
|
|
|
void
|
|
spdk_nvmf_acceptor_fini(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
g_transports[i]->acceptor_fini();
|
|
}
|
|
}
|
|
|
|
const struct spdk_nvmf_transport *
|
|
spdk_nvmf_transport_get(const char *name)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 0; i != NUM_TRANSPORTS; i++) {
|
|
if (strcasecmp(name, g_transports[i]->name) == 0) {
|
|
return g_transports[i];
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|