b3bbd9e5f2
Change crypto device's session management to make it device independent and simplify architecture when session is intended to be used on more than one device. Sessions private data is agnostic to underlying device by adding an indirection in the sessions private data using the crypto driver identifier. A single session can contain indirections to multiple device types. New function rte_cryptodev_sym_session_init has been created, to initialize the driver private session data per driver to be used on a same session, and rte_cryptodev_sym_session_clear to clear this data before calling rte_cryptodev_sym_session_free. Signed-off-by: Slawomir Mrozowicz <slawomirx.mrozowicz@intel.com> Signed-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com> Acked-by: Declan Doherty <declan.doherty@intel.com> Acked-by: Akhil Goyal <akhil.goyal@nxp.com>
241 lines
6.6 KiB
C
241 lines
6.6 KiB
C
/*-
|
|
* BSD LICENSE
|
|
*
|
|
* Copyright(c) 2017 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 <rte_cryptodev.h>
|
|
#include <rte_malloc.h>
|
|
|
|
#include "rte_cryptodev_scheduler_operations.h"
|
|
#include "scheduler_pmd_private.h"
|
|
|
|
struct rr_scheduler_qp_ctx {
|
|
struct scheduler_slave slaves[RTE_CRYPTODEV_SCHEDULER_MAX_NB_SLAVES];
|
|
uint32_t nb_slaves;
|
|
|
|
uint32_t last_enq_slave_idx;
|
|
uint32_t last_deq_slave_idx;
|
|
};
|
|
|
|
static uint16_t
|
|
schedule_enqueue(void *qp, struct rte_crypto_op **ops, uint16_t nb_ops)
|
|
{
|
|
struct rr_scheduler_qp_ctx *rr_qp_ctx =
|
|
((struct scheduler_qp_ctx *)qp)->private_qp_ctx;
|
|
uint32_t slave_idx = rr_qp_ctx->last_enq_slave_idx;
|
|
struct scheduler_slave *slave = &rr_qp_ctx->slaves[slave_idx];
|
|
uint16_t i, processed_ops;
|
|
|
|
if (unlikely(nb_ops == 0))
|
|
return 0;
|
|
|
|
for (i = 0; i < nb_ops && i < 4; i++)
|
|
rte_prefetch0(ops[i]->sym->session);
|
|
|
|
processed_ops = rte_cryptodev_enqueue_burst(slave->dev_id,
|
|
slave->qp_id, ops, nb_ops);
|
|
|
|
slave->nb_inflight_cops += processed_ops;
|
|
|
|
rr_qp_ctx->last_enq_slave_idx += 1;
|
|
rr_qp_ctx->last_enq_slave_idx %= rr_qp_ctx->nb_slaves;
|
|
|
|
return processed_ops;
|
|
}
|
|
|
|
static uint16_t
|
|
schedule_enqueue_ordering(void *qp, struct rte_crypto_op **ops,
|
|
uint16_t nb_ops)
|
|
{
|
|
struct rte_ring *order_ring =
|
|
((struct scheduler_qp_ctx *)qp)->order_ring;
|
|
uint16_t nb_ops_to_enq = get_max_enqueue_order_count(order_ring,
|
|
nb_ops);
|
|
uint16_t nb_ops_enqd = schedule_enqueue(qp, ops,
|
|
nb_ops_to_enq);
|
|
|
|
scheduler_order_insert(order_ring, ops, nb_ops_enqd);
|
|
|
|
return nb_ops_enqd;
|
|
}
|
|
|
|
|
|
static uint16_t
|
|
schedule_dequeue(void *qp, struct rte_crypto_op **ops, uint16_t nb_ops)
|
|
{
|
|
struct rr_scheduler_qp_ctx *rr_qp_ctx =
|
|
((struct scheduler_qp_ctx *)qp)->private_qp_ctx;
|
|
struct scheduler_slave *slave;
|
|
uint32_t last_slave_idx = rr_qp_ctx->last_deq_slave_idx;
|
|
uint16_t nb_deq_ops;
|
|
|
|
if (unlikely(rr_qp_ctx->slaves[last_slave_idx].nb_inflight_cops == 0)) {
|
|
do {
|
|
last_slave_idx += 1;
|
|
|
|
if (unlikely(last_slave_idx >= rr_qp_ctx->nb_slaves))
|
|
last_slave_idx = 0;
|
|
/* looped back, means no inflight cops in the queue */
|
|
if (last_slave_idx == rr_qp_ctx->last_deq_slave_idx)
|
|
return 0;
|
|
} while (rr_qp_ctx->slaves[last_slave_idx].nb_inflight_cops
|
|
== 0);
|
|
}
|
|
|
|
slave = &rr_qp_ctx->slaves[last_slave_idx];
|
|
|
|
nb_deq_ops = rte_cryptodev_dequeue_burst(slave->dev_id,
|
|
slave->qp_id, ops, nb_ops);
|
|
|
|
last_slave_idx += 1;
|
|
last_slave_idx %= rr_qp_ctx->nb_slaves;
|
|
|
|
rr_qp_ctx->last_deq_slave_idx = last_slave_idx;
|
|
|
|
slave->nb_inflight_cops -= nb_deq_ops;
|
|
|
|
return nb_deq_ops;
|
|
}
|
|
|
|
static uint16_t
|
|
schedule_dequeue_ordering(void *qp, struct rte_crypto_op **ops,
|
|
uint16_t nb_ops)
|
|
{
|
|
struct rte_ring *order_ring =
|
|
((struct scheduler_qp_ctx *)qp)->order_ring;
|
|
|
|
schedule_dequeue(qp, ops, nb_ops);
|
|
|
|
return scheduler_order_drain(order_ring, ops, nb_ops);
|
|
}
|
|
|
|
static int
|
|
slave_attach(__rte_unused struct rte_cryptodev *dev,
|
|
__rte_unused uint8_t slave_id)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
slave_detach(__rte_unused struct rte_cryptodev *dev,
|
|
__rte_unused uint8_t slave_id)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
scheduler_start(struct rte_cryptodev *dev)
|
|
{
|
|
struct scheduler_ctx *sched_ctx = dev->data->dev_private;
|
|
uint16_t i;
|
|
|
|
if (sched_ctx->reordering_enabled) {
|
|
dev->enqueue_burst = &schedule_enqueue_ordering;
|
|
dev->dequeue_burst = &schedule_dequeue_ordering;
|
|
} else {
|
|
dev->enqueue_burst = &schedule_enqueue;
|
|
dev->dequeue_burst = &schedule_dequeue;
|
|
}
|
|
|
|
for (i = 0; i < dev->data->nb_queue_pairs; i++) {
|
|
struct scheduler_qp_ctx *qp_ctx = dev->data->queue_pairs[i];
|
|
struct rr_scheduler_qp_ctx *rr_qp_ctx =
|
|
qp_ctx->private_qp_ctx;
|
|
uint32_t j;
|
|
|
|
memset(rr_qp_ctx->slaves, 0,
|
|
RTE_CRYPTODEV_SCHEDULER_MAX_NB_SLAVES *
|
|
sizeof(struct scheduler_slave));
|
|
for (j = 0; j < sched_ctx->nb_slaves; j++) {
|
|
rr_qp_ctx->slaves[j].dev_id =
|
|
sched_ctx->slaves[j].dev_id;
|
|
rr_qp_ctx->slaves[j].qp_id = i;
|
|
}
|
|
|
|
rr_qp_ctx->nb_slaves = sched_ctx->nb_slaves;
|
|
|
|
rr_qp_ctx->last_enq_slave_idx = 0;
|
|
rr_qp_ctx->last_deq_slave_idx = 0;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
scheduler_stop(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
scheduler_config_qp(struct rte_cryptodev *dev, uint16_t qp_id)
|
|
{
|
|
struct scheduler_qp_ctx *qp_ctx = dev->data->queue_pairs[qp_id];
|
|
struct rr_scheduler_qp_ctx *rr_qp_ctx;
|
|
|
|
rr_qp_ctx = rte_zmalloc_socket(NULL, sizeof(*rr_qp_ctx), 0,
|
|
rte_socket_id());
|
|
if (!rr_qp_ctx) {
|
|
CS_LOG_ERR("failed allocate memory for private queue pair");
|
|
return -ENOMEM;
|
|
}
|
|
|
|
qp_ctx->private_qp_ctx = (void *)rr_qp_ctx;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
scheduler_create_private_ctx(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
struct rte_cryptodev_scheduler_ops scheduler_rr_ops = {
|
|
slave_attach,
|
|
slave_detach,
|
|
scheduler_start,
|
|
scheduler_stop,
|
|
scheduler_config_qp,
|
|
scheduler_create_private_ctx,
|
|
NULL, /* option_set */
|
|
NULL /* option_get */
|
|
};
|
|
|
|
struct rte_cryptodev_scheduler scheduler = {
|
|
.name = "roundrobin-scheduler",
|
|
.description = "scheduler which will round robin burst across "
|
|
"slave crypto devices",
|
|
.mode = CDEV_SCHED_MODE_ROUNDROBIN,
|
|
.ops = &scheduler_rr_ops
|
|
};
|
|
|
|
struct rte_cryptodev_scheduler *roundrobin_scheduler = &scheduler;
|