4 * Copyright(c) 2010-2013 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40 #include <sys/queue.h>
43 #include <rte_branch_prediction.h>
44 #include <rte_common.h>
45 #include <rte_memory.h>
46 #include <rte_malloc.h>
47 #include <rte_memzone.h>
48 #include <rte_memcpy.h>
49 #include <rte_tailq.h>
51 #include <rte_eal_memconfig.h>
52 #include <rte_per_lcore.h>
53 #include <rte_string_fns.h>
54 #include <rte_errno.h>
55 #include <rte_rwlock.h>
56 #include <rte_spinlock.h>
60 #define RTE_LPM6_TBL24_NUM_ENTRIES (1 << 24)
61 #define RTE_LPM6_TBL8_GROUP_NUM_ENTRIES 256
62 #define RTE_LPM6_TBL8_MAX_NUM_GROUPS (1 << 21)
64 #define RTE_LPM6_VALID_EXT_ENTRY_BITMASK 0xA0000000
65 #define RTE_LPM6_LOOKUP_SUCCESS 0x20000000
66 #define RTE_LPM6_TBL8_BITMASK 0x001FFFFF
68 #define ADD_FIRST_BYTE 3
69 #define LOOKUP_FIRST_BYTE 4
71 #define BYTES2_SIZE 16
73 #define lpm6_tbl8_gindex next_hop
75 /** Flags for setting an entry as valid/invalid. */
81 TAILQ_HEAD(rte_lpm6_list, rte_lpm6);
83 /** Tbl entry structure. It is the same for both tbl24 and tbl8 */
84 struct rte_lpm6_tbl_entry {
85 uint32_t next_hop: 21; /**< Next hop / next table to be checked. */
86 uint32_t depth :8; /**< Rule depth. */
89 uint32_t valid :1; /**< Validation flag. */
90 uint32_t valid_group :1; /**< Group validation flag. */
91 uint32_t ext_entry :1; /**< External entry. */
94 /** Rules tbl entry structure. */
95 struct rte_lpm6_rule {
96 uint8_t ip[RTE_LPM6_IPV6_ADDR_SIZE]; /**< Rule IP address. */
97 uint8_t next_hop; /**< Rule next hop. */
98 uint8_t depth; /**< Rule depth. */
101 /** LPM6 structure. */
103 TAILQ_ENTRY(rte_lpm6) next; /**< Next in list. */
106 char name[RTE_LPM6_NAMESIZE]; /**< Name of the lpm. */
107 uint32_t max_rules; /**< Max number of rules. */
108 uint32_t used_rules; /**< Used rules so far. */
109 uint32_t number_tbl8s; /**< Number of tbl8s to allocate. */
110 uint32_t next_tbl8; /**< Next tbl8 to be used. */
113 struct rte_lpm6_rule *rules_tbl; /**< LPM rules. */
114 struct rte_lpm6_tbl_entry tbl24[RTE_LPM6_TBL24_NUM_ENTRIES]
115 __rte_cache_aligned; /**< LPM tbl24 table. */
116 struct rte_lpm6_tbl_entry tbl8[0]
117 __rte_cache_aligned; /**< LPM tbl8 table. */
121 * Takes an array of uint8_t (IPv6 address) and masks it using the depth.
122 * It leaves untouched one bit per unit in the depth variable
123 * and set the rest to 0.
126 mask_ip(uint8_t *ip, uint8_t depth)
128 int16_t part_depth, mask;
133 for (i = 0; i < RTE_LPM6_IPV6_ADDR_SIZE; i++) {
134 if (part_depth < BYTE_SIZE && part_depth >= 0) {
135 mask = (uint16_t)(~(UINT8_MAX >> part_depth));
136 ip[i] = (uint8_t)(ip[i] & mask);
137 } else if (part_depth < 0) {
140 part_depth -= BYTE_SIZE;
145 * Allocates memory for LPM object
148 rte_lpm6_create(const char *name, int socket_id,
149 const struct rte_lpm6_config *config)
151 char mem_name[RTE_LPM6_NAMESIZE];
152 struct rte_lpm6 *lpm = NULL;
153 uint64_t mem_size, rules_size;
154 struct rte_lpm6_list *lpm_list;
156 /* Check that we have an initialised tail queue */
158 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6, rte_lpm6_list)) == NULL) {
159 rte_errno = E_RTE_NO_TAILQ;
163 RTE_BUILD_BUG_ON(sizeof(struct rte_lpm6_tbl_entry) != sizeof(uint32_t));
165 /* Check user arguments. */
166 if ((name == NULL) || (socket_id < -1) || (config == NULL) ||
167 (config->max_rules == 0) ||
168 config->number_tbl8s > RTE_LPM6_TBL8_MAX_NUM_GROUPS) {
173 rte_snprintf(mem_name, sizeof(mem_name), "LPM_%s", name);
175 /* Determine the amount of memory to allocate. */
176 mem_size = sizeof(*lpm) + (sizeof(lpm->tbl8[0]) *
177 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * config->number_tbl8s);
178 rules_size = sizeof(struct rte_lpm6_rule) * config->max_rules;
180 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
182 /* Guarantee there's no existing */
183 TAILQ_FOREACH(lpm, lpm_list, next) {
184 if (strncmp(name, lpm->name, RTE_LPM6_NAMESIZE) == 0)
190 /* Allocate memory to store the LPM data structures. */
191 lpm = (struct rte_lpm6 *)rte_zmalloc_socket(mem_name, (size_t)mem_size,
192 CACHE_LINE_SIZE, socket_id);
195 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
199 lpm->rules_tbl = (struct rte_lpm6_rule *)rte_zmalloc_socket(NULL,
200 (size_t)rules_size, CACHE_LINE_SIZE, socket_id);
202 if (lpm->rules_tbl == NULL) {
203 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
208 /* Save user arguments. */
209 lpm->max_rules = config->max_rules;
210 lpm->number_tbl8s = config->number_tbl8s;
211 rte_snprintf(lpm->name, sizeof(lpm->name), "%s", name);
213 TAILQ_INSERT_TAIL(lpm_list, lpm, next);
216 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
222 * Find an existing lpm table and return a pointer to it.
225 rte_lpm6_find_existing(const char *name)
228 struct rte_lpm6_list *lpm_list;
230 /* Check that we have an initialised tail queue */
231 if ((lpm_list = RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6,
232 rte_lpm6_list)) == NULL) {
233 rte_errno = E_RTE_NO_TAILQ;
237 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
238 TAILQ_FOREACH(l, lpm_list, next) {
239 if (strncmp(name, l->name, RTE_LPM6_NAMESIZE) == 0)
242 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
251 * Deallocates memory for given LPM table.
254 rte_lpm6_free(struct rte_lpm6 *lpm)
256 /* Check user arguments. */
260 RTE_EAL_TAILQ_REMOVE(RTE_TAILQ_LPM6, rte_lpm6_list, lpm);
261 rte_free(lpm->rules_tbl);
266 * Checks if a rule already exists in the rules table and updates
267 * the nexthop if so. Otherwise it adds a new rule if enough space is available.
269 static inline int32_t
270 rule_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t next_hop, uint8_t depth)
274 /* Scan through rule list to see if rule already exists. */
275 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
277 /* If rule already exists update its next_hop and return. */
278 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
279 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
280 lpm->rules_tbl[rule_index].depth == depth) {
281 lpm->rules_tbl[rule_index].next_hop = next_hop;
288 * If rule does not exist check if there is space to add a new rule to
289 * this rule group. If there is no space return error.
291 if (lpm->used_rules == lpm->max_rules) {
295 /* If there is space for the new rule add it. */
296 rte_memcpy(lpm->rules_tbl[rule_index].ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
297 lpm->rules_tbl[rule_index].next_hop = next_hop;
298 lpm->rules_tbl[rule_index].depth = depth;
300 /* Increment the used rules counter for this rule group. */
307 * Function that expands a rule across the data structure when a less-generic
308 * one has been added before. It assures that every possible combination of bits
309 * in the IP address returns a match.
312 expand_rule(struct rte_lpm6 *lpm, uint32_t tbl8_gindex, uint8_t depth,
315 uint32_t tbl8_group_end, tbl8_gindex_next, j;
317 tbl8_group_end = tbl8_gindex + RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
319 struct rte_lpm6_tbl_entry new_tbl8_entry = {
321 .valid_group = VALID,
323 .next_hop = next_hop,
327 for (j = tbl8_gindex; j < tbl8_group_end; j++) {
328 if (!lpm->tbl8[j].valid || (lpm->tbl8[j].ext_entry == 0
329 && lpm->tbl8[j].depth <= depth)) {
331 lpm->tbl8[j] = new_tbl8_entry;
333 } else if (lpm->tbl8[j].ext_entry == 1) {
335 tbl8_gindex_next = lpm->tbl8[j].lpm6_tbl8_gindex
336 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
337 expand_rule(lpm, tbl8_gindex_next, depth, next_hop);
343 * Partially adds a new route to the data structure (tbl24+tbl8s).
344 * It returns 0 on success, a negative number on failure, or 1 if
345 * the process needs to be continued by calling the function again.
348 add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl,
349 struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip, uint8_t bytes,
350 uint8_t first_byte, uint8_t depth, uint8_t next_hop)
352 uint32_t tbl_index, tbl_range, tbl8_group_start, tbl8_group_end, i;
355 uint8_t bits_covered;
358 * Calculate index to the table based on the number and position
359 * of the bytes being inspected in this step.
362 for (i = first_byte; i < (uint32_t)(first_byte + bytes); i++) {
363 bitshift = (int8_t)((bytes - i)*BYTE_SIZE);
365 if (bitshift < 0) bitshift = 0;
366 tbl_index = tbl_index | ip[i-1] << bitshift;
369 /* Number of bits covered in this step */
370 bits_covered = (uint8_t)((bytes+first_byte-1)*BYTE_SIZE);
373 * If depth if smaller than this number (ie this is the last step)
374 * expand the rule across the relevant positions in the table.
376 if (depth <= bits_covered) {
377 tbl_range = 1 << (bits_covered - depth);
379 for (i = tbl_index; i < (tbl_index + tbl_range); i++) {
380 if (!tbl[i].valid || (tbl[i].ext_entry == 0 &&
381 tbl[i].depth <= depth)) {
383 struct rte_lpm6_tbl_entry new_tbl_entry = {
384 .next_hop = next_hop,
387 .valid_group = VALID,
391 tbl[i] = new_tbl_entry;
393 } else if (tbl[i].ext_entry == 1) {
396 * If tbl entry is valid and extended calculate the index
397 * into next tbl8 and expand the rule across the data structure.
399 tbl8_gindex = tbl[i].lpm6_tbl8_gindex *
400 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
401 expand_rule(lpm, tbl8_gindex, depth, next_hop);
408 * If this is not the last step just fill one position
409 * and calculate the index to the next table.
412 /* If it's invalid a new tbl8 is needed */
413 if (!tbl[tbl_index].valid) {
414 if (lpm->next_tbl8 < lpm->number_tbl8s)
415 tbl8_gindex = (lpm->next_tbl8)++;
419 struct rte_lpm6_tbl_entry new_tbl_entry = {
420 .lpm6_tbl8_gindex = tbl8_gindex,
423 .valid_group = VALID,
427 tbl[tbl_index] = new_tbl_entry;
430 * If it's valid but not extended the rule that was stored *
431 * here needs to be moved to the next table.
433 else if (tbl[tbl_index].ext_entry == 0) {
434 /* Search for free tbl8 group. */
435 if (lpm->next_tbl8 < lpm->number_tbl8s)
436 tbl8_gindex = (lpm->next_tbl8)++;
440 tbl8_group_start = tbl8_gindex *
441 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
442 tbl8_group_end = tbl8_group_start +
443 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
445 /* Populate new tbl8 with tbl value. */
446 for (i = tbl8_group_start; i < tbl8_group_end; i++) {
447 lpm->tbl8[i].valid = VALID;
448 lpm->tbl8[i].depth = tbl[tbl_index].depth;
449 lpm->tbl8[i].next_hop = tbl[tbl_index].next_hop;
450 lpm->tbl8[i].ext_entry = 0;
454 * Update tbl entry to point to new tbl8 entry. Note: The
455 * ext_flag and tbl8_index need to be updated simultaneously,
456 * so assign whole structure in one go.
458 struct rte_lpm6_tbl_entry new_tbl_entry = {
459 .lpm6_tbl8_gindex = tbl8_gindex,
462 .valid_group = VALID,
466 tbl[tbl_index] = new_tbl_entry;
469 *tbl_next = &(lpm->tbl8[tbl[tbl_index].lpm6_tbl8_gindex *
470 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES]);
480 rte_lpm6_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
483 struct rte_lpm6_tbl_entry *tbl;
484 struct rte_lpm6_tbl_entry *tbl_next;
487 uint8_t masked_ip[RTE_LPM6_IPV6_ADDR_SIZE];
490 /* Check user arguments. */
491 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH))
494 /* Copy the IP and mask it to avoid modifying user's input data. */
495 memcpy(masked_ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
496 mask_ip(masked_ip, depth);
498 /* Add the rule to the rule table. */
499 rule_index = rule_add(lpm, masked_ip, next_hop, depth);
501 /* If there is no space available for new rule return error. */
502 if (rule_index < 0) {
506 /* Inspect the first three bytes through tbl24 on the first step. */
508 status = add_step (lpm, tbl, &tbl_next, masked_ip, ADD_FIRST_BYTE, 1,
511 rte_lpm6_delete(lpm, masked_ip, depth);
517 * Inspect one by one the rest of the bytes until
518 * the process is completed.
520 for (i = ADD_FIRST_BYTE; i < RTE_LPM6_IPV6_ADDR_SIZE && status == 1; i++) {
522 status = add_step (lpm, tbl, &tbl_next, masked_ip, 1, (uint8_t)(i+1),
525 rte_lpm6_delete(lpm, masked_ip, depth);
535 * Takes a pointer to a table entry and inspect one level.
536 * The function returns 0 on lookup success, ENOENT if no match was found
537 * or 1 if the process needs to be continued by calling the function again.
540 lookup_step(const struct rte_lpm6 *lpm, const struct rte_lpm6_tbl_entry *tbl,
541 const struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip,
542 uint8_t first_byte, uint8_t *next_hop)
544 uint32_t tbl8_index, tbl_entry;
546 /* Take the integer value from the pointer. */
547 tbl_entry = *(const uint32_t *)tbl;
549 /* If it is valid and extended we calculate the new pointer to return. */
550 if ((tbl_entry & RTE_LPM6_VALID_EXT_ENTRY_BITMASK) ==
551 RTE_LPM6_VALID_EXT_ENTRY_BITMASK) {
553 tbl8_index = ip[first_byte-1] +
554 ((tbl_entry & RTE_LPM6_TBL8_BITMASK) *
555 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES);
557 *tbl_next = &lpm->tbl8[tbl8_index];
561 /* If not extended then we can have a match. */
562 *next_hop = (uint8_t)tbl_entry;
563 return (tbl_entry & RTE_LPM6_LOOKUP_SUCCESS) ? 0 : -ENOENT;
571 rte_lpm6_lookup(const struct rte_lpm6 *lpm, uint8_t *ip, uint8_t *next_hop)
573 const struct rte_lpm6_tbl_entry *tbl;
574 const struct rte_lpm6_tbl_entry *tbl_next;
577 uint32_t tbl24_index;
579 /* DEBUG: Check user input arguments. */
580 if ((lpm == NULL) || (ip == NULL) || (next_hop == NULL)) {
584 first_byte = LOOKUP_FIRST_BYTE;
585 tbl24_index = (ip[0] << BYTES2_SIZE) | (ip[1] << BYTE_SIZE) | ip[2];
587 /* Calculate pointer to the first entry to be inspected */
588 tbl = &lpm->tbl24[tbl24_index];
591 /* Continue inspecting following levels until success or failure */
592 status = lookup_step(lpm, tbl, &tbl_next, ip, first_byte++, next_hop);
594 } while (status == 1);
600 * Looks up a group of IP addresses
603 rte_lpm6_lookup_bulk_func(const struct rte_lpm6 *lpm,
604 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
605 int16_t * next_hops, unsigned n)
608 const struct rte_lpm6_tbl_entry *tbl;
609 const struct rte_lpm6_tbl_entry *tbl_next;
610 uint32_t tbl24_index;
611 uint8_t first_byte, next_hop;
614 /* DEBUG: Check user input arguments. */
615 if ((lpm == NULL) || (ips == NULL) || (next_hops == NULL)) {
619 for (i = 0; i < n; i++) {
620 first_byte = LOOKUP_FIRST_BYTE;
621 tbl24_index = (ips[i][0] << BYTES2_SIZE) |
622 (ips[i][1] << BYTE_SIZE) | ips[i][2];
624 /* Calculate pointer to the first entry to be inspected */
625 tbl = &lpm->tbl24[tbl24_index];
628 /* Continue inspecting following levels until success or failure */
629 status = lookup_step(lpm, tbl, &tbl_next, ips[i], first_byte++,
632 } while (status == 1);
637 next_hops[i] = next_hop;
644 * Finds a rule in rule table.
645 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
647 static inline int32_t
648 rule_find(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
652 /* Scan used rules at given depth to find rule. */
653 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
654 /* If rule is found return the rule index. */
655 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
656 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
657 lpm->rules_tbl[rule_index].depth == depth) {
663 /* If rule is not found return -ENOENT. */
668 * Delete a rule from the rule table.
669 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
672 rule_delete(struct rte_lpm6 *lpm, int32_t rule_index)
675 * Overwrite redundant rule with last rule in group and decrement rule
678 lpm->rules_tbl[rule_index] = lpm->rules_tbl[lpm->used_rules-1];
686 rte_lpm6_delete(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
688 int32_t rule_to_delete_index;
689 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
693 * Check input arguments.
695 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH)) {
699 /* Copy the IP and mask it to avoid modifying user's input data. */
700 memcpy(ip_masked, ip, RTE_LPM6_IPV6_ADDR_SIZE);
701 mask_ip(ip_masked, depth);
704 * Find the index of the input rule, that needs to be deleted, in the
707 rule_to_delete_index = rule_find(lpm, ip_masked, depth);
710 * Check if rule_to_delete_index was found. If no rule was found the
711 * function rule_find returns -ENOENT.
713 if (rule_to_delete_index < 0)
714 return rule_to_delete_index;
716 /* Delete the rule from the rule table. */
717 rule_delete(lpm, rule_to_delete_index);
720 * Set all the table entries to 0 (ie delete every rule
721 * from the data structure.
724 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
725 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
726 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
729 * Add every rule again (except for the one that was removed from
732 for (i = 0; i < lpm->used_rules; i++) {
733 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
734 lpm->rules_tbl[i].next_hop);
741 * Deletes a group of rules
744 rte_lpm6_delete_bulk_func(struct rte_lpm6 *lpm,
745 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE], uint8_t *depths, unsigned n)
747 int32_t rule_to_delete_index;
748 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
752 * Check input arguments.
754 if ((lpm == NULL) || (ips == NULL) || (depths == NULL)) {
758 for (i = 0; i < n; i++) {
759 /* Copy the IP and mask it to avoid modifying user's input data. */
760 memcpy(ip_masked, ips[i], RTE_LPM6_IPV6_ADDR_SIZE);
761 mask_ip(ip_masked, depths[i]);
764 * Find the index of the input rule, that needs to be deleted, in the
767 rule_to_delete_index = rule_find(lpm, ip_masked, depths[i]);
770 * Check if rule_to_delete_index was found. If no rule was found the
771 * function rule_find returns -ENOENT.
773 if (rule_to_delete_index < 0)
776 /* Delete the rule from the rule table. */
777 rule_delete(lpm, rule_to_delete_index);
781 * Set all the table entries to 0 (ie delete every rule
782 * from the data structure.
785 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
786 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
787 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
790 * Add every rule again (except for the ones that were removed from
793 for (i = 0; i < lpm->used_rules; i++) {
794 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
795 lpm->rules_tbl[i].next_hop);
802 * Delete all rules from the LPM table.
805 rte_lpm6_delete_all(struct rte_lpm6 *lpm)
807 /* Zero used rules counter. */
810 /* Zero next tbl8 index. */
814 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
817 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0]) *
818 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
820 /* Delete all rules form the rules table. */
821 memset(lpm->rules_tbl, 0, sizeof(struct rte_lpm6_rule) * lpm->max_rules);