remove unnecessary null checks

[dpdk.git] / lib / table / rte_swx_table.h

diff --git a/lib/table/rte_swx_table.h b/lib/table/rte_swx_table.h
index e23f230..c1383c2 100644 (file)
--- a/lib/table/rte_swx_table.h
+++ b/lib/table/rte_swx_table.h
@@ -16,7 +16,8 @@ extern "C" {
  */
 
 #include <stdint.h>
-#include <sys/queue.h>
+
+#include <rte_os.h>
 
 /** Match type. */
 enum rte_swx_table_match_type {
@@ -68,7 +69,7 @@ struct rte_swx_table_entry {
        /** Used to facilitate the membership of this table entry to a
         * linked list.
         */
-       TAILQ_ENTRY(rte_swx_table_entry) node;
+       RTE_TAILQ_ENTRY(rte_swx_table_entry) node;
 
        /** Key value for the current entry. Array of *key_size* bytes or NULL
         * if the *key_size* for the current table is 0.
@@ -111,7 +112,7 @@ struct rte_swx_table_entry {
 };
 
 /** List of table entries. */
-TAILQ_HEAD(rte_swx_table_entry_list, rte_swx_table_entry);
+RTE_TAILQ_HEAD(rte_swx_table_entry_list, rte_swx_table_entry);
 
 /**
  * Table memory footprint get
@@ -215,7 +216,7 @@ typedef int
  * operations into the same table.
  *
  * The typical reason an implementation may choose to split the table lookup
- * operation into multiple steps is to hide the latency of the inherrent memory
+ * operation into multiple steps is to hide the latency of the inherent memory
  * read operations: before a read operation with the source data likely not in
  * the CPU cache, the source data prefetch is issued and the table lookup
  * operation is postponed in favor of some other unrelated work, which the CPU