git.droids-corp.org
/
dpdk.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
net/mlx5: make tunnel hub list thread safe
[dpdk.git]
/
lib
/
librte_acl
/
acl_gen.c
diff --git
a/lib/librte_acl/acl_gen.c
b/lib/librte_acl/acl_gen.c
index
bed66be
..
e759a2c
100644
(file)
--- a/
lib/librte_acl/acl_gen.c
+++ b/
lib/librte_acl/acl_gen.c
@@
-133,7
+133,7
@@
acl_node_fill_dfa(const struct rte_acl_node *node,
for (n = 0; n < RTE_ACL_DFA_SIZE; n++) {
if (bits->bits[n / (sizeof(bits_t) * CHAR_BIT)] &
for (n = 0; n < RTE_ACL_DFA_SIZE; n++) {
if (bits->bits[n / (sizeof(bits_t) * CHAR_BIT)] &
- (1 << (n % (sizeof(bits_t) * CHAR_BIT)))) {
+ (1
U
<< (n % (sizeof(bits_t) * CHAR_BIT)))) {
dfa[n] = resolved ? child->node_index : x;
ranges += (last_bit == 0);
dfa[n] = resolved ? child->node_index : x;
ranges += (last_bit == 0);
@@
-163,7
+163,7
@@
acl_count_sequential_groups(struct rte_acl_bitset *bits, int zero_one)
for (n = QRANGE_MIN; n < UINT8_MAX + 1; n++) {
if (bits->bits[n / (sizeof(bits_t) * 8)] &
for (n = QRANGE_MIN; n < UINT8_MAX + 1; n++) {
if (bits->bits[n / (sizeof(bits_t) * 8)] &
- (1 << (n % (sizeof(bits_t) * 8)))) {
+ (1
U
<< (n % (sizeof(bits_t) * 8)))) {
if (zero_one == 1 && last_bit != 1)
ranges++;
last_bit = 1;
if (zero_one == 1 && last_bit != 1)
ranges++;
last_bit = 1;
@@
-175,7
+175,7
@@
acl_count_sequential_groups(struct rte_acl_bitset *bits, int zero_one)
}
for (n = 0; n < QRANGE_MIN; n++) {
if (bits->bits[n / (sizeof(bits_t) * 8)] &
}
for (n = 0; n < QRANGE_MIN; n++) {
if (bits->bits[n / (sizeof(bits_t) * 8)] &
- (1
<< (n % (sizeof(bits_t) * 8
)))) {
+ (1
U << (n % (sizeof(bits_t) * CHAR_BIT
)))) {
if (zero_one == 1 && last_bit != 1)
ranges++;
last_bit = 1;
if (zero_one == 1 && last_bit != 1)
ranges++;
last_bit = 1;
@@
-496,7
+496,7
@@
rte_acl_gen(struct rte_acl_ctx *ctx, struct rte_acl_trie *trie,
* highest index, that points to itself)
*/
* highest index, that points to itself)
*/
- node_array[RTE_ACL_DFA_SIZE] = RTE_ACL_
DFA_SIZE | RTE_ACL_NODE_SINGL
E;
+ node_array[RTE_ACL_DFA_SIZE] = RTE_ACL_
IDLE_NOD
E;
for (n = 0; n < RTE_ACL_DFA_SIZE; n++)
node_array[n] = no_match;
for (n = 0; n < RTE_ACL_DFA_SIZE; n++)
node_array[n] = no_match;