#include <rte_random.h>
#include <rte_memcpy.h>
#include <rte_errno.h>
-#include <rte_eal.h>
#include <rte_eal_memconfig.h>
#include <rte_log.h>
#include <rte_malloc.h>
/**
* Table of some irreducible polinomials over GF(2).
- * For lfsr they are reperesented in BE bit order, and
+ * For lfsr they are represented in BE bit order, and
* x^0 is masked out.
* For example, poly x^5 + x^2 + 1 will be represented
* as (101001b & 11111b) = 01001b = 0x9
return ret;
}
} else if ((next_ent != NULL) && (end > next_ent->offset)) {
- rte_free(ent);
RTE_LOG(ERR, HASH,
"Can't add helper %s due to conflict with existing"
" helper %s\n", ent->name, next_ent->name);
+ rte_free(ent);
return -ENOSPC;
}
attach_lfsr(ent, cur_ent->lfsr);
int ret;
if ((next_ent != NULL) && (end > next_ent->offset)) {
- rte_free(ent);
RTE_LOG(ERR, HASH,
"Can't add helper %s due to conflict with existing"
" helper %s\n", ent->name, next_ent->name);
+ rte_free(ent);
return -EEXIST;
}