2020-02-05 20:25:05 +00:00
|
|
|
/*-
|
|
|
|
* 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 "nvme_internal.h"
|
|
|
|
|
|
|
|
struct spdk_nvme_poll_group *
|
|
|
|
spdk_nvme_poll_group_create(void *ctx)
|
|
|
|
{
|
|
|
|
struct spdk_nvme_poll_group *group;
|
|
|
|
|
|
|
|
group = calloc(1, sizeof(*group));
|
|
|
|
if (group == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
group->ctx = ctx;
|
|
|
|
STAILQ_INIT(&group->tgroups);
|
|
|
|
|
|
|
|
return group;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
spdk_nvme_poll_group_add(struct spdk_nvme_poll_group *group, struct spdk_nvme_qpair *qpair)
|
|
|
|
{
|
|
|
|
struct spdk_nvme_transport_poll_group *tgroup;
|
|
|
|
const struct spdk_nvme_transport *transport;
|
|
|
|
|
2020-04-14 21:28:49 +00:00
|
|
|
if (nvme_qpair_get_state(qpair) != NVME_QPAIR_DISCONNECTED) {
|
2020-02-05 20:25:05 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
STAILQ_FOREACH(tgroup, &group->tgroups, link) {
|
|
|
|
if (tgroup->transport == qpair->transport) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* See if a new transport has been added (dlopen style) and we need to update the poll group */
|
|
|
|
if (!tgroup) {
|
|
|
|
transport = nvme_get_first_transport();
|
|
|
|
while (transport != NULL) {
|
|
|
|
if (transport == qpair->transport) {
|
|
|
|
tgroup = nvme_transport_poll_group_create(transport);
|
|
|
|
if (tgroup == NULL) {
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
tgroup->group = group;
|
|
|
|
STAILQ_INSERT_TAIL(&group->tgroups, tgroup, link);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
transport = nvme_get_next_transport(transport);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return tgroup ? nvme_transport_poll_group_add(tgroup, qpair) : -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
spdk_nvme_poll_group_remove(struct spdk_nvme_poll_group *group, struct spdk_nvme_qpair *qpair)
|
|
|
|
{
|
|
|
|
struct spdk_nvme_transport_poll_group *tgroup;
|
|
|
|
|
|
|
|
STAILQ_FOREACH(tgroup, &group->tgroups, link) {
|
|
|
|
if (tgroup->transport == qpair->transport) {
|
|
|
|
return nvme_transport_poll_group_remove(tgroup, qpair);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2020-04-07 17:20:41 +00:00
|
|
|
nvme_poll_group_connect_qpair(struct spdk_nvme_qpair *qpair)
|
2020-02-05 20:25:05 +00:00
|
|
|
{
|
2020-04-07 17:20:41 +00:00
|
|
|
return nvme_transport_poll_group_connect_qpair(qpair);
|
2020-02-05 20:25:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2020-04-07 17:20:41 +00:00
|
|
|
nvme_poll_group_disconnect_qpair(struct spdk_nvme_qpair *qpair)
|
2020-02-05 20:25:05 +00:00
|
|
|
{
|
2020-04-07 17:20:41 +00:00
|
|
|
return nvme_transport_poll_group_disconnect_qpair(qpair);
|
2020-02-05 20:25:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int64_t
|
|
|
|
spdk_nvme_poll_group_process_completions(struct spdk_nvme_poll_group *group,
|
2020-04-07 17:20:41 +00:00
|
|
|
uint32_t completions_per_qpair, spdk_nvme_disconnected_qpair_cb disconnected_qpair_cb)
|
2020-02-05 20:25:05 +00:00
|
|
|
{
|
|
|
|
struct spdk_nvme_transport_poll_group *tgroup;
|
|
|
|
int64_t local_completions = 0, error_reason = 0, num_completions = 0;
|
|
|
|
|
2020-04-07 17:20:41 +00:00
|
|
|
if (disconnected_qpair_cb == NULL) {
|
2020-02-05 20:25:05 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
STAILQ_FOREACH(tgroup, &group->tgroups, link) {
|
|
|
|
local_completions = nvme_transport_poll_group_process_completions(tgroup, completions_per_qpair,
|
2020-04-07 17:20:41 +00:00
|
|
|
disconnected_qpair_cb);
|
2020-02-05 20:25:05 +00:00
|
|
|
if (local_completions < 0 && error_reason == 0) {
|
|
|
|
error_reason = local_completions;
|
|
|
|
} else {
|
|
|
|
num_completions += local_completions;
|
|
|
|
/* Just to be safe */
|
|
|
|
assert(num_completions >= 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return error_reason ? error_reason : num_completions;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
spdk_nvme_poll_group_get_ctx(struct spdk_nvme_poll_group *group)
|
|
|
|
{
|
|
|
|
return group->ctx;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
spdk_nvme_poll_group_destroy(struct spdk_nvme_poll_group *group)
|
|
|
|
{
|
|
|
|
struct spdk_nvme_transport_poll_group *tgroup, *tmp_tgroup;
|
|
|
|
|
|
|
|
STAILQ_FOREACH_SAFE(tgroup, &group->tgroups, link, tmp_tgroup) {
|
|
|
|
STAILQ_REMOVE(&group->tgroups, tgroup, spdk_nvme_transport_poll_group, link);
|
|
|
|
if (nvme_transport_poll_group_destroy(tgroup) != 0) {
|
|
|
|
STAILQ_INSERT_TAIL(&group->tgroups, tgroup, link);
|
|
|
|
return -EBUSY;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
free(group);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|