lib: cleanup
[dpdk.git] / lib / librte_lpm / rte_lpm6.c
index 5af74a5..b981e40 100644 (file)
@@ -24,6 +24,7 @@
 #include <rte_hash.h>
 #include <assert.h>
 #include <rte_jhash.h>
+#include <rte_tailq.h>
 
 #include "rte_lpm6.h"
 
@@ -807,18 +808,6 @@ add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl,
        return 1;
 }
 
-/*
- * Add a route
- */
-int
-rte_lpm6_add_v20(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
-               uint8_t next_hop)
-{
-       return rte_lpm6_add_v1705(lpm, ip, depth, next_hop);
-}
-VERSION_SYMBOL(rte_lpm6_add, _v20, 2.0);
-
-
 /*
  * Simulate adding a route to LPM
  *
@@ -840,7 +829,7 @@ simulate_add(struct rte_lpm6 *lpm, const uint8_t *masked_ip, uint8_t depth)
 
        /* Inspect the first three bytes through tbl24 on the first step. */
        ret = simulate_add_step(lpm, lpm->tbl24, &tbl_next, masked_ip,
-                       ADD_FIRST_BYTE, 1, depth, &need_tbl_nb);
+               ADD_FIRST_BYTE, 1, depth, &need_tbl_nb);
        total_need_tbl_nb = need_tbl_nb;
        /*
         * Inspect one by one the rest of the bytes until
@@ -849,7 +838,7 @@ simulate_add(struct rte_lpm6 *lpm, const uint8_t *masked_ip, uint8_t depth)
        for (i = ADD_FIRST_BYTE; i < RTE_LPM6_IPV6_ADDR_SIZE && ret == 1; i++) {
                tbl = tbl_next;
                ret = simulate_add_step(lpm, tbl, &tbl_next, masked_ip, 1,
-                               (uint8_t)(i+1), depth, &need_tbl_nb);
+                       (uint8_t)(i + 1), depth, &need_tbl_nb);
                total_need_tbl_nb += need_tbl_nb;
        }
 
@@ -860,9 +849,12 @@ simulate_add(struct rte_lpm6 *lpm, const uint8_t *masked_ip, uint8_t depth)
        return 0;
 }
 
+/*
+ * Add a route
+ */
 int
-rte_lpm6_add_v1705(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
-               uint32_t next_hop)
+rte_lpm6_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
+       uint32_t next_hop)
 {
        struct rte_lpm6_tbl_entry *tbl;
        struct rte_lpm6_tbl_entry *tbl_next = NULL;
@@ -894,8 +886,8 @@ rte_lpm6_add_v1705(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
        /* Inspect the first three bytes through tbl24 on the first step. */
        tbl = lpm->tbl24;
        status = add_step(lpm, tbl, TBL24_IND, &tbl_next, &tbl_next_num,
-                       masked_ip, ADD_FIRST_BYTE, 1, depth, next_hop,
-                       is_new_rule);
+               masked_ip, ADD_FIRST_BYTE, 1, depth, next_hop,
+               is_new_rule);
        assert(status >= 0);
 
        /*
@@ -905,17 +897,13 @@ rte_lpm6_add_v1705(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
        for (i = ADD_FIRST_BYTE; i < RTE_LPM6_IPV6_ADDR_SIZE && status == 1; i++) {
                tbl = tbl_next;
                status = add_step(lpm, tbl, tbl_next_num, &tbl_next,
-                               &tbl_next_num, masked_ip, 1, (uint8_t)(i+1),
-                               depth, next_hop, is_new_rule);
+                       &tbl_next_num, masked_ip, 1, (uint8_t)(i + 1),
+                       depth, next_hop, is_new_rule);
                assert(status >= 0);
        }
 
        return status;
 }
-BIND_DEFAULT_SYMBOL(rte_lpm6_add, _v1705, 17.05);
-MAP_STATIC_SYMBOL(int rte_lpm6_add(struct rte_lpm6 *lpm, uint8_t *ip,
-                               uint8_t depth, uint32_t next_hop),
-               rte_lpm6_add_v1705);
 
 /*
  * Takes a pointer to a table entry and inspect one level.
@@ -954,25 +942,7 @@ lookup_step(const struct rte_lpm6 *lpm, const struct rte_lpm6_tbl_entry *tbl,
  * Looks up an IP
  */
 int
-rte_lpm6_lookup_v20(const struct rte_lpm6 *lpm, uint8_t *ip, uint8_t *next_hop)
-{
-       uint32_t next_hop32 = 0;
-       int32_t status;
-
-       /* DEBUG: Check user input arguments. */
-       if (next_hop == NULL)
-               return -EINVAL;
-
-       status = rte_lpm6_lookup_v1705(lpm, ip, &next_hop32);
-       if (status == 0)
-               *next_hop = (uint8_t)next_hop32;
-
-       return status;
-}
-VERSION_SYMBOL(rte_lpm6_lookup, _v20, 2.0);
-
-int
-rte_lpm6_lookup_v1705(const struct rte_lpm6 *lpm, uint8_t *ip,
+rte_lpm6_lookup(const struct rte_lpm6 *lpm, uint8_t *ip,
                uint32_t *next_hop)
 {
        const struct rte_lpm6_tbl_entry *tbl;
@@ -999,56 +969,12 @@ rte_lpm6_lookup_v1705(const struct rte_lpm6 *lpm, uint8_t *ip,
 
        return status;
 }
-BIND_DEFAULT_SYMBOL(rte_lpm6_lookup, _v1705, 17.05);
-MAP_STATIC_SYMBOL(int rte_lpm6_lookup(const struct rte_lpm6 *lpm, uint8_t *ip,
-                               uint32_t *next_hop), rte_lpm6_lookup_v1705);
 
 /*
  * Looks up a group of IP addresses
  */
 int
-rte_lpm6_lookup_bulk_func_v20(const struct rte_lpm6 *lpm,
-               uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
-               int16_t * next_hops, unsigned n)
-{
-       unsigned i;
-       const struct rte_lpm6_tbl_entry *tbl;
-       const struct rte_lpm6_tbl_entry *tbl_next = NULL;
-       uint32_t tbl24_index, next_hop;
-       uint8_t first_byte;
-       int status;
-
-       /* DEBUG: Check user input arguments. */
-       if ((lpm == NULL) || (ips == NULL) || (next_hops == NULL))
-               return -EINVAL;
-
-       for (i = 0; i < n; i++) {
-               first_byte = LOOKUP_FIRST_BYTE;
-               tbl24_index = (ips[i][0] << BYTES2_SIZE) |
-                               (ips[i][1] << BYTE_SIZE) | ips[i][2];
-
-               /* Calculate pointer to the first entry to be inspected */
-               tbl = &lpm->tbl24[tbl24_index];
-
-               do {
-                       /* Continue inspecting following levels until success or failure */
-                       status = lookup_step(lpm, tbl, &tbl_next, ips[i], first_byte++,
-                                       &next_hop);
-                       tbl = tbl_next;
-               } while (status == 1);
-
-               if (status < 0)
-                       next_hops[i] = -1;
-               else
-                       next_hops[i] = (int16_t)next_hop;
-       }
-
-       return 0;
-}
-VERSION_SYMBOL(rte_lpm6_lookup_bulk_func, _v20, 2.0);
-
-int
-rte_lpm6_lookup_bulk_func_v1705(const struct rte_lpm6 *lpm,
+rte_lpm6_lookup_bulk_func(const struct rte_lpm6 *lpm,
                uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
                int32_t *next_hops, unsigned int n)
 {
@@ -1088,37 +1014,12 @@ rte_lpm6_lookup_bulk_func_v1705(const struct rte_lpm6 *lpm,
 
        return 0;
 }
-BIND_DEFAULT_SYMBOL(rte_lpm6_lookup_bulk_func, _v1705, 17.05);
-MAP_STATIC_SYMBOL(int rte_lpm6_lookup_bulk_func(const struct rte_lpm6 *lpm,
-                               uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
-                               int32_t *next_hops, unsigned int n),
-               rte_lpm6_lookup_bulk_func_v1705);
 
 /*
  * Look for a rule in the high-level rules table
  */
 int
-rte_lpm6_is_rule_present_v20(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
-               uint8_t *next_hop)
-{
-       uint32_t next_hop32 = 0;
-       int32_t status;
-
-       /* DEBUG: Check user input arguments. */
-       if (next_hop == NULL)
-               return -EINVAL;
-
-       status = rte_lpm6_is_rule_present_v1705(lpm, ip, depth, &next_hop32);
-       if (status > 0)
-               *next_hop = (uint8_t)next_hop32;
-
-       return status;
-
-}
-VERSION_SYMBOL(rte_lpm6_is_rule_present, _v20, 2.0);
-
-int
-rte_lpm6_is_rule_present_v1705(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
+rte_lpm6_is_rule_present(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
                uint32_t *next_hop)
 {
        uint8_t masked_ip[RTE_LPM6_IPV6_ADDR_SIZE];
@@ -1134,10 +1035,6 @@ rte_lpm6_is_rule_present_v1705(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
 
        return rule_find(lpm, masked_ip, depth, next_hop);
 }
-BIND_DEFAULT_SYMBOL(rte_lpm6_is_rule_present, _v1705, 17.05);
-MAP_STATIC_SYMBOL(int rte_lpm6_is_rule_present(struct rte_lpm6 *lpm,
-                               uint8_t *ip, uint8_t depth, uint32_t *next_hop),
-               rte_lpm6_is_rule_present_v1705);
 
 /*
  * Delete a rule from the rule table.