1*99a2dd95SBruce Richardson /*
2*99a2dd95SBruce Richardson * SPDX-License-Identifier: BSD-3-Clause
3*99a2dd95SBruce Richardson * Copyright (C) IBM Corporation 2016.
4*99a2dd95SBruce Richardson */
5*99a2dd95SBruce Richardson
6*99a2dd95SBruce Richardson #include "acl_run_altivec.h"
7*99a2dd95SBruce Richardson
8*99a2dd95SBruce Richardson int
rte_acl_classify_altivec(const struct rte_acl_ctx * ctx,const uint8_t ** data,uint32_t * results,uint32_t num,uint32_t categories)9*99a2dd95SBruce Richardson rte_acl_classify_altivec(const struct rte_acl_ctx *ctx, const uint8_t **data,
10*99a2dd95SBruce Richardson uint32_t *results, uint32_t num, uint32_t categories)
11*99a2dd95SBruce Richardson {
12*99a2dd95SBruce Richardson if (likely(num >= MAX_SEARCHES_ALTIVEC8))
13*99a2dd95SBruce Richardson return search_altivec_8(ctx, data, results, num, categories);
14*99a2dd95SBruce Richardson else if (num >= MAX_SEARCHES_ALTIVEC4)
15*99a2dd95SBruce Richardson return search_altivec_4(ctx, data, results, num, categories);
16*99a2dd95SBruce Richardson else
17*99a2dd95SBruce Richardson return rte_acl_classify_scalar(ctx, data, results, num,
18*99a2dd95SBruce Richardson categories);
19*99a2dd95SBruce Richardson }
20