Rather than reading the size directly from the ring structure, use the dedicated ring function for that purpose. Previous commits to do this only did so for the null crypto driver which was the only one compiled in by default, but all other drivers need to be similarly updated. Fixes: b11c78a2e0c6 ("crypto/null: use ring size function") Signed-off-by: Bruce Richardson <bruce.richardson@intel.com>
345 lines
8.7 KiB
C
345 lines
8.7 KiB
C
/*-
|
|
* BSD LICENSE
|
|
*
|
|
* Copyright(c) 2016 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 <string.h>
|
|
|
|
#include <rte_common.h>
|
|
#include <rte_malloc.h>
|
|
#include <rte_cryptodev_pmd.h>
|
|
|
|
#include "rte_kasumi_pmd_private.h"
|
|
|
|
static const struct rte_cryptodev_capabilities kasumi_pmd_capabilities[] = {
|
|
{ /* KASUMI (F9) */
|
|
.op = RTE_CRYPTO_OP_TYPE_SYMMETRIC,
|
|
{.sym = {
|
|
.xform_type = RTE_CRYPTO_SYM_XFORM_AUTH,
|
|
{.auth = {
|
|
.algo = RTE_CRYPTO_AUTH_KASUMI_F9,
|
|
.block_size = 8,
|
|
.key_size = {
|
|
.min = 16,
|
|
.max = 16,
|
|
.increment = 0
|
|
},
|
|
.digest_size = {
|
|
.min = 4,
|
|
.max = 4,
|
|
.increment = 0
|
|
},
|
|
.aad_size = {
|
|
.min = 8,
|
|
.max = 8,
|
|
.increment = 0
|
|
}
|
|
}, }
|
|
}, }
|
|
},
|
|
{ /* KASUMI (F8) */
|
|
.op = RTE_CRYPTO_OP_TYPE_SYMMETRIC,
|
|
{.sym = {
|
|
.xform_type = RTE_CRYPTO_SYM_XFORM_CIPHER,
|
|
{.cipher = {
|
|
.algo = RTE_CRYPTO_CIPHER_KASUMI_F8,
|
|
.block_size = 8,
|
|
.key_size = {
|
|
.min = 16,
|
|
.max = 16,
|
|
.increment = 0
|
|
},
|
|
.iv_size = {
|
|
.min = 8,
|
|
.max = 8,
|
|
.increment = 0
|
|
}
|
|
}, }
|
|
}, }
|
|
},
|
|
RTE_CRYPTODEV_END_OF_CAPABILITIES_LIST()
|
|
};
|
|
|
|
/** Configure device */
|
|
static int
|
|
kasumi_pmd_config(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
/** Start device */
|
|
static int
|
|
kasumi_pmd_start(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
/** Stop device */
|
|
static void
|
|
kasumi_pmd_stop(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
}
|
|
|
|
/** Close device */
|
|
static int
|
|
kasumi_pmd_close(__rte_unused struct rte_cryptodev *dev)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
|
|
/** Get device statistics */
|
|
static void
|
|
kasumi_pmd_stats_get(struct rte_cryptodev *dev,
|
|
struct rte_cryptodev_stats *stats)
|
|
{
|
|
int qp_id;
|
|
|
|
for (qp_id = 0; qp_id < dev->data->nb_queue_pairs; qp_id++) {
|
|
struct kasumi_qp *qp = dev->data->queue_pairs[qp_id];
|
|
|
|
stats->enqueued_count += qp->qp_stats.enqueued_count;
|
|
stats->dequeued_count += qp->qp_stats.dequeued_count;
|
|
|
|
stats->enqueue_err_count += qp->qp_stats.enqueue_err_count;
|
|
stats->dequeue_err_count += qp->qp_stats.dequeue_err_count;
|
|
}
|
|
}
|
|
|
|
/** Reset device statistics */
|
|
static void
|
|
kasumi_pmd_stats_reset(struct rte_cryptodev *dev)
|
|
{
|
|
int qp_id;
|
|
|
|
for (qp_id = 0; qp_id < dev->data->nb_queue_pairs; qp_id++) {
|
|
struct kasumi_qp *qp = dev->data->queue_pairs[qp_id];
|
|
|
|
memset(&qp->qp_stats, 0, sizeof(qp->qp_stats));
|
|
}
|
|
}
|
|
|
|
|
|
/** Get device info */
|
|
static void
|
|
kasumi_pmd_info_get(struct rte_cryptodev *dev,
|
|
struct rte_cryptodev_info *dev_info)
|
|
{
|
|
struct kasumi_private *internals = dev->data->dev_private;
|
|
|
|
if (dev_info != NULL) {
|
|
dev_info->dev_type = dev->dev_type;
|
|
dev_info->max_nb_queue_pairs = internals->max_nb_queue_pairs;
|
|
dev_info->sym.max_nb_sessions = internals->max_nb_sessions;
|
|
dev_info->feature_flags = dev->feature_flags;
|
|
dev_info->capabilities = kasumi_pmd_capabilities;
|
|
}
|
|
}
|
|
|
|
/** Release queue pair */
|
|
static int
|
|
kasumi_pmd_qp_release(struct rte_cryptodev *dev, uint16_t qp_id)
|
|
{
|
|
struct kasumi_qp *qp = dev->data->queue_pairs[qp_id];
|
|
|
|
if (qp != NULL) {
|
|
rte_ring_free(qp->processed_ops);
|
|
rte_free(qp);
|
|
dev->data->queue_pairs[qp_id] = NULL;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/** set a unique name for the queue pair based on its name, dev_id and qp_id */
|
|
static int
|
|
kasumi_pmd_qp_set_unique_name(struct rte_cryptodev *dev,
|
|
struct kasumi_qp *qp)
|
|
{
|
|
unsigned n = snprintf(qp->name, sizeof(qp->name),
|
|
"kasumi_pmd_%u_qp_%u",
|
|
dev->data->dev_id, qp->id);
|
|
|
|
if (n > sizeof(qp->name))
|
|
return -1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/** Create a ring to place processed ops on */
|
|
static struct rte_ring *
|
|
kasumi_pmd_qp_create_processed_ops_ring(struct kasumi_qp *qp,
|
|
unsigned ring_size, int socket_id)
|
|
{
|
|
struct rte_ring *r;
|
|
|
|
r = rte_ring_lookup(qp->name);
|
|
if (r) {
|
|
if (rte_ring_get_size(r) == ring_size) {
|
|
KASUMI_LOG_INFO("Reusing existing ring %s"
|
|
" for processed packets",
|
|
qp->name);
|
|
return r;
|
|
}
|
|
|
|
KASUMI_LOG_ERR("Unable to reuse existing ring %s"
|
|
" for processed packets",
|
|
qp->name);
|
|
return NULL;
|
|
}
|
|
|
|
return rte_ring_create(qp->name, ring_size, socket_id,
|
|
RING_F_SP_ENQ | RING_F_SC_DEQ);
|
|
}
|
|
|
|
/** Setup a queue pair */
|
|
static int
|
|
kasumi_pmd_qp_setup(struct rte_cryptodev *dev, uint16_t qp_id,
|
|
const struct rte_cryptodev_qp_conf *qp_conf,
|
|
int socket_id)
|
|
{
|
|
struct kasumi_qp *qp = NULL;
|
|
|
|
/* Free memory prior to re-allocation if needed. */
|
|
if (dev->data->queue_pairs[qp_id] != NULL)
|
|
kasumi_pmd_qp_release(dev, qp_id);
|
|
|
|
/* Allocate the queue pair data structure. */
|
|
qp = rte_zmalloc_socket("KASUMI PMD Queue Pair", sizeof(*qp),
|
|
RTE_CACHE_LINE_SIZE, socket_id);
|
|
if (qp == NULL)
|
|
return (-ENOMEM);
|
|
|
|
qp->id = qp_id;
|
|
dev->data->queue_pairs[qp_id] = qp;
|
|
|
|
if (kasumi_pmd_qp_set_unique_name(dev, qp))
|
|
goto qp_setup_cleanup;
|
|
|
|
qp->processed_ops = kasumi_pmd_qp_create_processed_ops_ring(qp,
|
|
qp_conf->nb_descriptors, socket_id);
|
|
if (qp->processed_ops == NULL)
|
|
goto qp_setup_cleanup;
|
|
|
|
qp->sess_mp = dev->data->session_pool;
|
|
|
|
memset(&qp->qp_stats, 0, sizeof(qp->qp_stats));
|
|
|
|
return 0;
|
|
|
|
qp_setup_cleanup:
|
|
rte_free(qp);
|
|
|
|
return -1;
|
|
}
|
|
|
|
/** Start queue pair */
|
|
static int
|
|
kasumi_pmd_qp_start(__rte_unused struct rte_cryptodev *dev,
|
|
__rte_unused uint16_t queue_pair_id)
|
|
{
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
/** Stop queue pair */
|
|
static int
|
|
kasumi_pmd_qp_stop(__rte_unused struct rte_cryptodev *dev,
|
|
__rte_unused uint16_t queue_pair_id)
|
|
{
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
/** Return the number of allocated queue pairs */
|
|
static uint32_t
|
|
kasumi_pmd_qp_count(struct rte_cryptodev *dev)
|
|
{
|
|
return dev->data->nb_queue_pairs;
|
|
}
|
|
|
|
/** Returns the size of the KASUMI session structure */
|
|
static unsigned
|
|
kasumi_pmd_session_get_size(struct rte_cryptodev *dev __rte_unused)
|
|
{
|
|
return sizeof(struct kasumi_session);
|
|
}
|
|
|
|
/** Configure a KASUMI session from a crypto xform chain */
|
|
static void *
|
|
kasumi_pmd_session_configure(struct rte_cryptodev *dev __rte_unused,
|
|
struct rte_crypto_sym_xform *xform, void *sess)
|
|
{
|
|
if (unlikely(sess == NULL)) {
|
|
KASUMI_LOG_ERR("invalid session struct");
|
|
return NULL;
|
|
}
|
|
|
|
if (kasumi_set_session_parameters(sess, xform) != 0) {
|
|
KASUMI_LOG_ERR("failed configure session parameters");
|
|
return NULL;
|
|
}
|
|
|
|
return sess;
|
|
}
|
|
|
|
/** Clear the memory of session so it doesn't leave key material behind */
|
|
static void
|
|
kasumi_pmd_session_clear(struct rte_cryptodev *dev __rte_unused, void *sess)
|
|
{
|
|
/*
|
|
* Current just resetting the whole data structure, need to investigate
|
|
* whether a more selective reset of key would be more performant
|
|
*/
|
|
if (sess)
|
|
memset(sess, 0, sizeof(struct kasumi_session));
|
|
}
|
|
|
|
struct rte_cryptodev_ops kasumi_pmd_ops = {
|
|
.dev_configure = kasumi_pmd_config,
|
|
.dev_start = kasumi_pmd_start,
|
|
.dev_stop = kasumi_pmd_stop,
|
|
.dev_close = kasumi_pmd_close,
|
|
|
|
.stats_get = kasumi_pmd_stats_get,
|
|
.stats_reset = kasumi_pmd_stats_reset,
|
|
|
|
.dev_infos_get = kasumi_pmd_info_get,
|
|
|
|
.queue_pair_setup = kasumi_pmd_qp_setup,
|
|
.queue_pair_release = kasumi_pmd_qp_release,
|
|
.queue_pair_start = kasumi_pmd_qp_start,
|
|
.queue_pair_stop = kasumi_pmd_qp_stop,
|
|
.queue_pair_count = kasumi_pmd_qp_count,
|
|
|
|
.session_get_size = kasumi_pmd_session_get_size,
|
|
.session_configure = kasumi_pmd_session_configure,
|
|
.session_clear = kasumi_pmd_session_clear
|
|
};
|
|
|
|
struct rte_cryptodev_ops *rte_kasumi_pmd_ops = &kasumi_pmd_ops;
|