2014-06-13 11:26:50 +00:00
|
|
|
/*-
|
|
|
|
* BSD LICENSE
|
|
|
|
*
|
|
|
|
* Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
|
|
|
|
* 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_acl.h>
|
|
|
|
#include "acl.h"
|
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
TAILQ_HEAD(rte_acl_list, rte_tailq_entry);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2015-03-04 21:50:08 +00:00
|
|
|
static struct rte_tailq_elem rte_acl_tailq = {
|
|
|
|
.name = "RTE_ACL",
|
|
|
|
};
|
|
|
|
EAL_REGISTER_TAILQ(rte_acl_tailq)
|
|
|
|
|
2015-01-20 18:41:00 +00:00
|
|
|
/*
|
|
|
|
* If the compiler doesn't support AVX2 instructions,
|
|
|
|
* then the dummy one would be used instead for AVX2 classify method.
|
|
|
|
*/
|
|
|
|
int __attribute__ ((weak))
|
|
|
|
rte_acl_classify_avx2(__rte_unused const struct rte_acl_ctx *ctx,
|
|
|
|
__rte_unused const uint8_t **data,
|
|
|
|
__rte_unused uint32_t *results,
|
|
|
|
__rte_unused uint32_t num,
|
|
|
|
__rte_unused uint32_t categories)
|
|
|
|
{
|
|
|
|
return -ENOTSUP;
|
|
|
|
}
|
|
|
|
|
2015-11-06 09:40:27 +00:00
|
|
|
int __attribute__ ((weak))
|
|
|
|
rte_acl_classify_sse(__rte_unused const struct rte_acl_ctx *ctx,
|
|
|
|
__rte_unused const uint8_t **data,
|
|
|
|
__rte_unused uint32_t *results,
|
|
|
|
__rte_unused uint32_t num,
|
|
|
|
__rte_unused uint32_t categories)
|
|
|
|
{
|
|
|
|
return -ENOTSUP;
|
|
|
|
}
|
|
|
|
|
|
|
|
int __attribute__ ((weak))
|
|
|
|
rte_acl_classify_neon(__rte_unused const struct rte_acl_ctx *ctx,
|
|
|
|
__rte_unused const uint8_t **data,
|
|
|
|
__rte_unused uint32_t *results,
|
|
|
|
__rte_unused uint32_t num,
|
|
|
|
__rte_unused uint32_t categories)
|
|
|
|
{
|
|
|
|
return -ENOTSUP;
|
|
|
|
}
|
|
|
|
|
2014-09-01 15:28:44 +00:00
|
|
|
static const rte_acl_classify_t classify_fns[] = {
|
|
|
|
[RTE_ACL_CLASSIFY_DEFAULT] = rte_acl_classify_scalar,
|
|
|
|
[RTE_ACL_CLASSIFY_SCALAR] = rte_acl_classify_scalar,
|
|
|
|
[RTE_ACL_CLASSIFY_SSE] = rte_acl_classify_sse,
|
2015-01-20 18:41:00 +00:00
|
|
|
[RTE_ACL_CLASSIFY_AVX2] = rte_acl_classify_avx2,
|
2015-11-06 09:40:27 +00:00
|
|
|
[RTE_ACL_CLASSIFY_NEON] = rte_acl_classify_neon,
|
2014-09-01 15:28:44 +00:00
|
|
|
};
|
|
|
|
|
2014-11-14 14:59:31 +00:00
|
|
|
/* by default, use always available scalar code path. */
|
2014-09-01 15:28:44 +00:00
|
|
|
static enum rte_acl_classify_alg rte_acl_default_classify =
|
|
|
|
RTE_ACL_CLASSIFY_SCALAR;
|
|
|
|
|
|
|
|
static void
|
|
|
|
rte_acl_set_default_classify(enum rte_acl_classify_alg alg)
|
|
|
|
{
|
|
|
|
rte_acl_default_classify = alg;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern int
|
|
|
|
rte_acl_set_ctx_classify(struct rte_acl_ctx *ctx, enum rte_acl_classify_alg alg)
|
|
|
|
{
|
|
|
|
if (ctx == NULL || (uint32_t)alg >= RTE_DIM(classify_fns))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ctx->alg = alg;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-01-20 18:41:00 +00:00
|
|
|
/*
|
|
|
|
* Select highest available classify method as default one.
|
|
|
|
* Note that CLASSIFY_AVX2 should be set as a default only
|
|
|
|
* if both conditions are met:
|
|
|
|
* at build time compiler supports AVX2 and target cpu supports AVX2.
|
|
|
|
*/
|
2014-09-01 15:28:44 +00:00
|
|
|
static void __attribute__((constructor))
|
|
|
|
rte_acl_init(void)
|
|
|
|
{
|
|
|
|
enum rte_acl_classify_alg alg = RTE_ACL_CLASSIFY_DEFAULT;
|
|
|
|
|
2015-12-03 15:02:55 +00:00
|
|
|
#if defined(RTE_ARCH_ARM64)
|
2015-11-06 09:40:27 +00:00
|
|
|
alg = RTE_ACL_CLASSIFY_NEON;
|
2015-12-03 15:02:55 +00:00
|
|
|
#elif defined(RTE_ARCH_ARM)
|
|
|
|
if (rte_cpu_get_flag_enabled(RTE_CPUFLAG_NEON))
|
|
|
|
alg = RTE_ACL_CLASSIFY_NEON;
|
2015-11-06 09:40:27 +00:00
|
|
|
#else
|
2015-01-20 18:41:00 +00:00
|
|
|
#ifdef CC_AVX2_SUPPORT
|
|
|
|
if (rte_cpu_get_flag_enabled(RTE_CPUFLAG_AVX2))
|
|
|
|
alg = RTE_ACL_CLASSIFY_AVX2;
|
|
|
|
else if (rte_cpu_get_flag_enabled(RTE_CPUFLAG_SSE4_1))
|
|
|
|
#else
|
2014-09-01 15:28:44 +00:00
|
|
|
if (rte_cpu_get_flag_enabled(RTE_CPUFLAG_SSE4_1))
|
2015-01-20 18:41:00 +00:00
|
|
|
#endif
|
2014-09-01 15:28:44 +00:00
|
|
|
alg = RTE_ACL_CLASSIFY_SSE;
|
|
|
|
|
2015-11-06 09:40:27 +00:00
|
|
|
#endif
|
2014-09-01 15:28:44 +00:00
|
|
|
rte_acl_set_default_classify(alg);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
rte_acl_classify_alg(const struct rte_acl_ctx *ctx, const uint8_t **data,
|
|
|
|
uint32_t *results, uint32_t num, uint32_t categories,
|
|
|
|
enum rte_acl_classify_alg alg)
|
|
|
|
{
|
2015-01-20 18:40:58 +00:00
|
|
|
if (categories != 1 &&
|
|
|
|
((RTE_ACL_RESULTS_MULTIPLIER - 1) & categories) != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2014-09-01 15:28:44 +00:00
|
|
|
return classify_fns[alg](ctx, data, results, num, categories);
|
|
|
|
}
|
|
|
|
|
2015-01-20 18:40:58 +00:00
|
|
|
int
|
|
|
|
rte_acl_classify(const struct rte_acl_ctx *ctx, const uint8_t **data,
|
|
|
|
uint32_t *results, uint32_t num, uint32_t categories)
|
|
|
|
{
|
|
|
|
return rte_acl_classify_alg(ctx, data, results, num, categories,
|
|
|
|
ctx->alg);
|
|
|
|
}
|
|
|
|
|
2014-06-13 11:26:50 +00:00
|
|
|
struct rte_acl_ctx *
|
|
|
|
rte_acl_find_existing(const char *name)
|
|
|
|
{
|
2014-06-20 15:42:25 +00:00
|
|
|
struct rte_acl_ctx *ctx = NULL;
|
2014-06-13 11:26:50 +00:00
|
|
|
struct rte_acl_list *acl_list;
|
2014-06-20 15:42:25 +00:00
|
|
|
struct rte_tailq_entry *te;
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2015-03-04 21:50:08 +00:00
|
|
|
acl_list = RTE_TAILQ_CAST(rte_acl_tailq.head, rte_acl_list);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
|
|
|
rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
|
2014-06-20 15:42:25 +00:00
|
|
|
TAILQ_FOREACH(te, acl_list, next) {
|
|
|
|
ctx = (struct rte_acl_ctx *) te->data;
|
2014-06-13 11:26:50 +00:00
|
|
|
if (strncmp(name, ctx->name, sizeof(ctx->name)) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
if (te == NULL) {
|
2014-06-13 11:26:50 +00:00
|
|
|
rte_errno = ENOENT;
|
2014-06-20 15:42:25 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2014-06-13 11:26:50 +00:00
|
|
|
return ctx;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
rte_acl_free(struct rte_acl_ctx *ctx)
|
|
|
|
{
|
2014-06-20 15:42:25 +00:00
|
|
|
struct rte_acl_list *acl_list;
|
|
|
|
struct rte_tailq_entry *te;
|
|
|
|
|
2014-06-13 11:26:50 +00:00
|
|
|
if (ctx == NULL)
|
|
|
|
return;
|
|
|
|
|
2015-03-04 21:50:08 +00:00
|
|
|
acl_list = RTE_TAILQ_CAST(rte_acl_tailq.head, rte_acl_list);
|
2014-06-20 15:42:25 +00:00
|
|
|
|
|
|
|
rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
|
|
|
|
/* find our tailq entry */
|
|
|
|
TAILQ_FOREACH(te, acl_list, next) {
|
|
|
|
if (te->data == (void *) ctx)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (te == NULL) {
|
|
|
|
rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
TAILQ_REMOVE(acl_list, te, next);
|
|
|
|
|
|
|
|
rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
|
|
|
rte_free(ctx->mem);
|
|
|
|
rte_free(ctx);
|
2014-06-20 15:42:25 +00:00
|
|
|
rte_free(te);
|
2014-06-13 11:26:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct rte_acl_ctx *
|
|
|
|
rte_acl_create(const struct rte_acl_param *param)
|
|
|
|
{
|
|
|
|
size_t sz;
|
|
|
|
struct rte_acl_ctx *ctx;
|
|
|
|
struct rte_acl_list *acl_list;
|
2014-06-20 15:42:25 +00:00
|
|
|
struct rte_tailq_entry *te;
|
2014-06-13 11:26:50 +00:00
|
|
|
char name[sizeof(ctx->name)];
|
|
|
|
|
2015-03-04 21:50:08 +00:00
|
|
|
acl_list = RTE_TAILQ_CAST(rte_acl_tailq.head, rte_acl_list);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
|
|
|
/* check that input parameters are valid. */
|
|
|
|
if (param == NULL || param->name == NULL) {
|
|
|
|
rte_errno = EINVAL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-06-24 18:15:28 +00:00
|
|
|
snprintf(name, sizeof(name), "ACL_%s", param->name);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
|
|
|
/* calculate amount of memory required for pattern set. */
|
|
|
|
sz = sizeof(*ctx) + param->max_rule_num * param->rule_size;
|
|
|
|
|
|
|
|
/* get EAL TAILQ lock. */
|
|
|
|
rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
|
|
|
|
/* if we already have one with that name */
|
2014-06-20 15:42:25 +00:00
|
|
|
TAILQ_FOREACH(te, acl_list, next) {
|
|
|
|
ctx = (struct rte_acl_ctx *) te->data;
|
2014-06-13 11:26:50 +00:00
|
|
|
if (strncmp(param->name, ctx->name, sizeof(ctx->name)) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if ACL with such name doesn't exist, then create a new one. */
|
2014-06-20 15:42:25 +00:00
|
|
|
if (te == NULL) {
|
|
|
|
ctx = NULL;
|
|
|
|
te = rte_zmalloc("ACL_TAILQ_ENTRY", sizeof(*te), 0);
|
|
|
|
|
|
|
|
if (te == NULL) {
|
|
|
|
RTE_LOG(ERR, ACL, "Cannot allocate tailq entry!\n");
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
|
2014-11-19 12:26:06 +00:00
|
|
|
ctx = rte_zmalloc_socket(name, sz, RTE_CACHE_LINE_SIZE, param->socket_id);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
if (ctx == NULL) {
|
|
|
|
RTE_LOG(ERR, ACL,
|
|
|
|
"allocation of %zu bytes on socket %d for %s failed\n",
|
|
|
|
sz, param->socket_id, name);
|
|
|
|
rte_free(te);
|
|
|
|
goto exit;
|
|
|
|
}
|
2014-06-13 11:26:50 +00:00
|
|
|
/* init new allocated context. */
|
|
|
|
ctx->rules = ctx + 1;
|
|
|
|
ctx->max_rules = param->max_rule_num;
|
|
|
|
ctx->rule_sz = param->rule_size;
|
|
|
|
ctx->socket_id = param->socket_id;
|
2014-09-01 15:28:44 +00:00
|
|
|
ctx->alg = rte_acl_default_classify;
|
2014-06-24 18:15:28 +00:00
|
|
|
snprintf(ctx->name, sizeof(ctx->name), "%s", param->name);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
te->data = (void *) ctx;
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
TAILQ_INSERT_TAIL(acl_list, te, next);
|
2014-06-13 11:26:50 +00:00
|
|
|
}
|
|
|
|
|
2014-06-20 15:42:25 +00:00
|
|
|
exit:
|
2014-06-13 11:26:50 +00:00
|
|
|
rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
return ctx;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
acl_add_rules(struct rte_acl_ctx *ctx, const void *rules, uint32_t num)
|
|
|
|
{
|
|
|
|
uint8_t *pos;
|
|
|
|
|
|
|
|
if (num + ctx->num_rules > ctx->max_rules)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
pos = ctx->rules;
|
|
|
|
pos += ctx->rule_sz * ctx->num_rules;
|
|
|
|
memcpy(pos, rules, num * ctx->rule_sz);
|
|
|
|
ctx->num_rules += num;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
acl_check_rule(const struct rte_acl_rule_data *rd)
|
|
|
|
{
|
2015-06-08 10:41:24 +00:00
|
|
|
if ((RTE_LEN2MASK(RTE_ACL_MAX_CATEGORIES, typeof(rd->category_mask)) &
|
|
|
|
rd->category_mask) == 0 ||
|
2014-06-13 11:26:50 +00:00
|
|
|
rd->priority > RTE_ACL_MAX_PRIORITY ||
|
|
|
|
rd->priority < RTE_ACL_MIN_PRIORITY ||
|
|
|
|
rd->userdata == RTE_ACL_INVALID_USERDATA)
|
|
|
|
return -EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
rte_acl_add_rules(struct rte_acl_ctx *ctx, const struct rte_acl_rule *rules,
|
|
|
|
uint32_t num)
|
|
|
|
{
|
|
|
|
const struct rte_acl_rule *rv;
|
|
|
|
uint32_t i;
|
|
|
|
int32_t rc;
|
|
|
|
|
|
|
|
if (ctx == NULL || rules == NULL || 0 == ctx->rule_sz)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
for (i = 0; i != num; i++) {
|
|
|
|
rv = (const struct rte_acl_rule *)
|
|
|
|
((uintptr_t)rules + i * ctx->rule_sz);
|
|
|
|
rc = acl_check_rule(&rv->data);
|
|
|
|
if (rc != 0) {
|
|
|
|
RTE_LOG(ERR, ACL, "%s(%s): rule #%u is invalid\n",
|
|
|
|
__func__, ctx->name, i + 1);
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return acl_add_rules(ctx, rules, num);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reset all rules.
|
|
|
|
* Note that RT structures are not affected.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
rte_acl_reset_rules(struct rte_acl_ctx *ctx)
|
|
|
|
{
|
|
|
|
if (ctx != NULL)
|
|
|
|
ctx->num_rules = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reset all rules and destroys RT structures.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
rte_acl_reset(struct rte_acl_ctx *ctx)
|
|
|
|
{
|
|
|
|
if (ctx != NULL) {
|
|
|
|
rte_acl_reset_rules(ctx);
|
|
|
|
rte_acl_build(ctx, &ctx->config);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dump ACL context to the stdout.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
rte_acl_dump(const struct rte_acl_ctx *ctx)
|
|
|
|
{
|
|
|
|
if (!ctx)
|
|
|
|
return;
|
|
|
|
printf("acl context <%s>@%p\n", ctx->name, ctx);
|
2014-09-01 15:28:44 +00:00
|
|
|
printf(" socket_id=%"PRId32"\n", ctx->socket_id);
|
|
|
|
printf(" alg=%"PRId32"\n", ctx->alg);
|
2014-06-13 11:26:50 +00:00
|
|
|
printf(" max_rules=%"PRIu32"\n", ctx->max_rules);
|
|
|
|
printf(" rule_size=%"PRIu32"\n", ctx->rule_sz);
|
|
|
|
printf(" num_rules=%"PRIu32"\n", ctx->num_rules);
|
|
|
|
printf(" num_categories=%"PRIu32"\n", ctx->num_categories);
|
|
|
|
printf(" num_tries=%"PRIu32"\n", ctx->num_tries);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dump all ACL contexts to the stdout.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
rte_acl_list_dump(void)
|
|
|
|
{
|
|
|
|
struct rte_acl_ctx *ctx;
|
|
|
|
struct rte_acl_list *acl_list;
|
2014-06-20 15:42:25 +00:00
|
|
|
struct rte_tailq_entry *te;
|
2014-06-13 11:26:50 +00:00
|
|
|
|
2015-03-04 21:50:08 +00:00
|
|
|
acl_list = RTE_TAILQ_CAST(rte_acl_tailq.head, rte_acl_list);
|
2014-06-13 11:26:50 +00:00
|
|
|
|
|
|
|
rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
|
2014-06-20 15:42:25 +00:00
|
|
|
TAILQ_FOREACH(te, acl_list, next) {
|
|
|
|
ctx = (struct rte_acl_ctx *) te->data;
|
2014-06-13 11:26:50 +00:00
|
|
|
rte_acl_dump(ctx);
|
|
|
|
}
|
|
|
|
rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
|
|
|
|
}
|