4 * Copyright(c) 2010-2014 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.
39 #include <sys/queue.h>
42 #include <rte_branch_prediction.h>
43 #include <rte_common.h>
44 #include <rte_memory.h>
45 #include <rte_malloc.h>
46 #include <rte_memzone.h>
47 #include <rte_memcpy.h>
48 #include <rte_tailq.h>
50 #include <rte_eal_memconfig.h>
51 #include <rte_per_lcore.h>
52 #include <rte_string_fns.h>
53 #include <rte_errno.h>
54 #include <rte_rwlock.h>
55 #include <rte_spinlock.h>
59 #define RTE_LPM6_TBL24_NUM_ENTRIES (1 << 24)
60 #define RTE_LPM6_TBL8_GROUP_NUM_ENTRIES 256
61 #define RTE_LPM6_TBL8_MAX_NUM_GROUPS (1 << 21)
63 #define RTE_LPM6_VALID_EXT_ENTRY_BITMASK 0xA0000000
64 #define RTE_LPM6_LOOKUP_SUCCESS 0x20000000
65 #define RTE_LPM6_TBL8_BITMASK 0x001FFFFF
67 #define ADD_FIRST_BYTE 3
68 #define LOOKUP_FIRST_BYTE 4
70 #define BYTES2_SIZE 16
72 #define lpm6_tbl8_gindex next_hop
74 /** Flags for setting an entry as valid/invalid. */
80 TAILQ_HEAD(rte_lpm6_list, rte_lpm6);
82 /** Tbl entry structure. It is the same for both tbl24 and tbl8 */
83 struct rte_lpm6_tbl_entry {
84 uint32_t next_hop: 21; /**< Next hop / next table to be checked. */
85 uint32_t depth :8; /**< Rule depth. */
88 uint32_t valid :1; /**< Validation flag. */
89 uint32_t valid_group :1; /**< Group validation flag. */
90 uint32_t ext_entry :1; /**< External entry. */
93 /** Rules tbl entry structure. */
94 struct rte_lpm6_rule {
95 uint8_t ip[RTE_LPM6_IPV6_ADDR_SIZE]; /**< Rule IP address. */
96 uint8_t next_hop; /**< Rule next hop. */
97 uint8_t depth; /**< Rule depth. */
100 /** LPM6 structure. */
102 TAILQ_ENTRY(rte_lpm6) next; /**< Next in list. */
105 char name[RTE_LPM6_NAMESIZE]; /**< Name of the lpm. */
106 uint32_t max_rules; /**< Max number of rules. */
107 uint32_t used_rules; /**< Used rules so far. */
108 uint32_t number_tbl8s; /**< Number of tbl8s to allocate. */
109 uint32_t next_tbl8; /**< Next tbl8 to be used. */
112 struct rte_lpm6_rule *rules_tbl; /**< LPM rules. */
113 struct rte_lpm6_tbl_entry tbl24[RTE_LPM6_TBL24_NUM_ENTRIES]
114 __rte_cache_aligned; /**< LPM tbl24 table. */
115 struct rte_lpm6_tbl_entry tbl8[0]
116 __rte_cache_aligned; /**< LPM tbl8 table. */
120 * Takes an array of uint8_t (IPv6 address) and masks it using the depth.
121 * It leaves untouched one bit per unit in the depth variable
122 * and set the rest to 0.
125 mask_ip(uint8_t *ip, uint8_t depth)
127 int16_t part_depth, mask;
132 for (i = 0; i < RTE_LPM6_IPV6_ADDR_SIZE; i++) {
133 if (part_depth < BYTE_SIZE && part_depth >= 0) {
134 mask = (uint16_t)(~(UINT8_MAX >> part_depth));
135 ip[i] = (uint8_t)(ip[i] & mask);
136 } else if (part_depth < 0) {
139 part_depth -= BYTE_SIZE;
144 * Allocates memory for LPM object
147 rte_lpm6_create(const char *name, int socket_id,
148 const struct rte_lpm6_config *config)
150 char mem_name[RTE_LPM6_NAMESIZE];
151 struct rte_lpm6 *lpm = NULL;
152 uint64_t mem_size, rules_size;
153 struct rte_lpm6_list *lpm_list;
155 /* Check that we have an initialised tail queue */
157 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6, rte_lpm6_list)) == NULL) {
158 rte_errno = E_RTE_NO_TAILQ;
162 RTE_BUILD_BUG_ON(sizeof(struct rte_lpm6_tbl_entry) != sizeof(uint32_t));
164 /* Check user arguments. */
165 if ((name == NULL) || (socket_id < -1) || (config == NULL) ||
166 (config->max_rules == 0) ||
167 config->number_tbl8s > RTE_LPM6_TBL8_MAX_NUM_GROUPS) {
172 rte_snprintf(mem_name, sizeof(mem_name), "LPM_%s", name);
174 /* Determine the amount of memory to allocate. */
175 mem_size = sizeof(*lpm) + (sizeof(lpm->tbl8[0]) *
176 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * config->number_tbl8s);
177 rules_size = sizeof(struct rte_lpm6_rule) * config->max_rules;
179 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
181 /* Guarantee there's no existing */
182 TAILQ_FOREACH(lpm, lpm_list, next) {
183 if (strncmp(name, lpm->name, RTE_LPM6_NAMESIZE) == 0)
189 /* Allocate memory to store the LPM data structures. */
190 lpm = (struct rte_lpm6 *)rte_zmalloc_socket(mem_name, (size_t)mem_size,
191 CACHE_LINE_SIZE, socket_id);
194 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
198 lpm->rules_tbl = (struct rte_lpm6_rule *)rte_zmalloc_socket(NULL,
199 (size_t)rules_size, CACHE_LINE_SIZE, socket_id);
201 if (lpm->rules_tbl == NULL) {
202 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
207 /* Save user arguments. */
208 lpm->max_rules = config->max_rules;
209 lpm->number_tbl8s = config->number_tbl8s;
210 rte_snprintf(lpm->name, sizeof(lpm->name), "%s", name);
212 TAILQ_INSERT_TAIL(lpm_list, lpm, next);
215 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
221 * Find an existing lpm table and return a pointer to it.
224 rte_lpm6_find_existing(const char *name)
227 struct rte_lpm6_list *lpm_list;
229 /* Check that we have an initialised tail queue */
230 if ((lpm_list = RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6,
231 rte_lpm6_list)) == NULL) {
232 rte_errno = E_RTE_NO_TAILQ;
236 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
237 TAILQ_FOREACH(l, lpm_list, next) {
238 if (strncmp(name, l->name, RTE_LPM6_NAMESIZE) == 0)
241 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
250 * Deallocates memory for given LPM table.
253 rte_lpm6_free(struct rte_lpm6 *lpm)
255 /* Check user arguments. */
259 RTE_EAL_TAILQ_REMOVE(RTE_TAILQ_LPM6, rte_lpm6_list, lpm);
260 rte_free(lpm->rules_tbl);
265 * Checks if a rule already exists in the rules table and updates
266 * the nexthop if so. Otherwise it adds a new rule if enough space is available.
268 static inline int32_t
269 rule_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t next_hop, uint8_t depth)
273 /* Scan through rule list to see if rule already exists. */
274 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
276 /* If rule already exists update its next_hop and return. */
277 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
278 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
279 lpm->rules_tbl[rule_index].depth == depth) {
280 lpm->rules_tbl[rule_index].next_hop = next_hop;
287 * If rule does not exist check if there is space to add a new rule to
288 * this rule group. If there is no space return error.
290 if (lpm->used_rules == lpm->max_rules) {
294 /* If there is space for the new rule add it. */
295 rte_memcpy(lpm->rules_tbl[rule_index].ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
296 lpm->rules_tbl[rule_index].next_hop = next_hop;
297 lpm->rules_tbl[rule_index].depth = depth;
299 /* Increment the used rules counter for this rule group. */
306 * Function that expands a rule across the data structure when a less-generic
307 * one has been added before. It assures that every possible combination of bits
308 * in the IP address returns a match.
311 expand_rule(struct rte_lpm6 *lpm, uint32_t tbl8_gindex, uint8_t depth,
314 uint32_t tbl8_group_end, tbl8_gindex_next, j;
316 tbl8_group_end = tbl8_gindex + RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
318 struct rte_lpm6_tbl_entry new_tbl8_entry = {
320 .valid_group = VALID,
322 .next_hop = next_hop,
326 for (j = tbl8_gindex; j < tbl8_group_end; j++) {
327 if (!lpm->tbl8[j].valid || (lpm->tbl8[j].ext_entry == 0
328 && lpm->tbl8[j].depth <= depth)) {
330 lpm->tbl8[j] = new_tbl8_entry;
332 } else if (lpm->tbl8[j].ext_entry == 1) {
334 tbl8_gindex_next = lpm->tbl8[j].lpm6_tbl8_gindex
335 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
336 expand_rule(lpm, tbl8_gindex_next, depth, next_hop);
342 * Partially adds a new route to the data structure (tbl24+tbl8s).
343 * It returns 0 on success, a negative number on failure, or 1 if
344 * the process needs to be continued by calling the function again.
347 add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl,
348 struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip, uint8_t bytes,
349 uint8_t first_byte, uint8_t depth, uint8_t next_hop)
351 uint32_t tbl_index, tbl_range, tbl8_group_start, tbl8_group_end, i;
354 uint8_t bits_covered;
357 * Calculate index to the table based on the number and position
358 * of the bytes being inspected in this step.
361 for (i = first_byte; i < (uint32_t)(first_byte + bytes); i++) {
362 bitshift = (int8_t)((bytes - i)*BYTE_SIZE);
364 if (bitshift < 0) bitshift = 0;
365 tbl_index = tbl_index | ip[i-1] << bitshift;
368 /* Number of bits covered in this step */
369 bits_covered = (uint8_t)((bytes+first_byte-1)*BYTE_SIZE);
372 * If depth if smaller than this number (ie this is the last step)
373 * expand the rule across the relevant positions in the table.
375 if (depth <= bits_covered) {
376 tbl_range = 1 << (bits_covered - depth);
378 for (i = tbl_index; i < (tbl_index + tbl_range); i++) {
379 if (!tbl[i].valid || (tbl[i].ext_entry == 0 &&
380 tbl[i].depth <= depth)) {
382 struct rte_lpm6_tbl_entry new_tbl_entry = {
383 .next_hop = next_hop,
386 .valid_group = VALID,
390 tbl[i] = new_tbl_entry;
392 } else if (tbl[i].ext_entry == 1) {
395 * If tbl entry is valid and extended calculate the index
396 * into next tbl8 and expand the rule across the data structure.
398 tbl8_gindex = tbl[i].lpm6_tbl8_gindex *
399 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
400 expand_rule(lpm, tbl8_gindex, depth, next_hop);
407 * If this is not the last step just fill one position
408 * and calculate the index to the next table.
411 /* If it's invalid a new tbl8 is needed */
412 if (!tbl[tbl_index].valid) {
413 if (lpm->next_tbl8 < lpm->number_tbl8s)
414 tbl8_gindex = (lpm->next_tbl8)++;
418 struct rte_lpm6_tbl_entry new_tbl_entry = {
419 .lpm6_tbl8_gindex = tbl8_gindex,
422 .valid_group = VALID,
426 tbl[tbl_index] = new_tbl_entry;
429 * If it's valid but not extended the rule that was stored *
430 * here needs to be moved to the next table.
432 else if (tbl[tbl_index].ext_entry == 0) {
433 /* Search for free tbl8 group. */
434 if (lpm->next_tbl8 < lpm->number_tbl8s)
435 tbl8_gindex = (lpm->next_tbl8)++;
439 tbl8_group_start = tbl8_gindex *
440 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
441 tbl8_group_end = tbl8_group_start +
442 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
444 /* Populate new tbl8 with tbl value. */
445 for (i = tbl8_group_start; i < tbl8_group_end; i++) {
446 lpm->tbl8[i].valid = VALID;
447 lpm->tbl8[i].depth = tbl[tbl_index].depth;
448 lpm->tbl8[i].next_hop = tbl[tbl_index].next_hop;
449 lpm->tbl8[i].ext_entry = 0;
453 * Update tbl entry to point to new tbl8 entry. Note: The
454 * ext_flag and tbl8_index need to be updated simultaneously,
455 * so assign whole structure in one go.
457 struct rte_lpm6_tbl_entry new_tbl_entry = {
458 .lpm6_tbl8_gindex = tbl8_gindex,
461 .valid_group = VALID,
465 tbl[tbl_index] = new_tbl_entry;
468 *tbl_next = &(lpm->tbl8[tbl[tbl_index].lpm6_tbl8_gindex *
469 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES]);
479 rte_lpm6_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
482 struct rte_lpm6_tbl_entry *tbl;
483 struct rte_lpm6_tbl_entry *tbl_next;
486 uint8_t masked_ip[RTE_LPM6_IPV6_ADDR_SIZE];
489 /* Check user arguments. */
490 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH))
493 /* Copy the IP and mask it to avoid modifying user's input data. */
494 memcpy(masked_ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
495 mask_ip(masked_ip, depth);
497 /* Add the rule to the rule table. */
498 rule_index = rule_add(lpm, masked_ip, next_hop, depth);
500 /* If there is no space available for new rule return error. */
501 if (rule_index < 0) {
505 /* Inspect the first three bytes through tbl24 on the first step. */
507 status = add_step (lpm, tbl, &tbl_next, masked_ip, ADD_FIRST_BYTE, 1,
510 rte_lpm6_delete(lpm, masked_ip, depth);
516 * Inspect one by one the rest of the bytes until
517 * the process is completed.
519 for (i = ADD_FIRST_BYTE; i < RTE_LPM6_IPV6_ADDR_SIZE && status == 1; i++) {
521 status = add_step (lpm, tbl, &tbl_next, masked_ip, 1, (uint8_t)(i+1),
524 rte_lpm6_delete(lpm, masked_ip, depth);
534 * Takes a pointer to a table entry and inspect one level.
535 * The function returns 0 on lookup success, ENOENT if no match was found
536 * or 1 if the process needs to be continued by calling the function again.
539 lookup_step(const struct rte_lpm6 *lpm, const struct rte_lpm6_tbl_entry *tbl,
540 const struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip,
541 uint8_t first_byte, uint8_t *next_hop)
543 uint32_t tbl8_index, tbl_entry;
545 /* Take the integer value from the pointer. */
546 tbl_entry = *(const uint32_t *)tbl;
548 /* If it is valid and extended we calculate the new pointer to return. */
549 if ((tbl_entry & RTE_LPM6_VALID_EXT_ENTRY_BITMASK) ==
550 RTE_LPM6_VALID_EXT_ENTRY_BITMASK) {
552 tbl8_index = ip[first_byte-1] +
553 ((tbl_entry & RTE_LPM6_TBL8_BITMASK) *
554 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES);
556 *tbl_next = &lpm->tbl8[tbl8_index];
560 /* If not extended then we can have a match. */
561 *next_hop = (uint8_t)tbl_entry;
562 return (tbl_entry & RTE_LPM6_LOOKUP_SUCCESS) ? 0 : -ENOENT;
570 rte_lpm6_lookup(const struct rte_lpm6 *lpm, uint8_t *ip, uint8_t *next_hop)
572 const struct rte_lpm6_tbl_entry *tbl;
573 const struct rte_lpm6_tbl_entry *tbl_next;
576 uint32_t tbl24_index;
578 /* DEBUG: Check user input arguments. */
579 if ((lpm == NULL) || (ip == NULL) || (next_hop == NULL)) {
583 first_byte = LOOKUP_FIRST_BYTE;
584 tbl24_index = (ip[0] << BYTES2_SIZE) | (ip[1] << BYTE_SIZE) | ip[2];
586 /* Calculate pointer to the first entry to be inspected */
587 tbl = &lpm->tbl24[tbl24_index];
590 /* Continue inspecting following levels until success or failure */
591 status = lookup_step(lpm, tbl, &tbl_next, ip, first_byte++, next_hop);
593 } while (status == 1);
599 * Looks up a group of IP addresses
602 rte_lpm6_lookup_bulk_func(const struct rte_lpm6 *lpm,
603 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
604 int16_t * next_hops, unsigned n)
607 const struct rte_lpm6_tbl_entry *tbl;
608 const struct rte_lpm6_tbl_entry *tbl_next;
609 uint32_t tbl24_index;
610 uint8_t first_byte, next_hop;
613 /* DEBUG: Check user input arguments. */
614 if ((lpm == NULL) || (ips == NULL) || (next_hops == NULL)) {
618 for (i = 0; i < n; i++) {
619 first_byte = LOOKUP_FIRST_BYTE;
620 tbl24_index = (ips[i][0] << BYTES2_SIZE) |
621 (ips[i][1] << BYTE_SIZE) | ips[i][2];
623 /* Calculate pointer to the first entry to be inspected */
624 tbl = &lpm->tbl24[tbl24_index];
627 /* Continue inspecting following levels until success or failure */
628 status = lookup_step(lpm, tbl, &tbl_next, ips[i], first_byte++,
631 } while (status == 1);
636 next_hops[i] = next_hop;
643 * Finds a rule in rule table.
644 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
646 static inline int32_t
647 rule_find(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
651 /* Scan used rules at given depth to find rule. */
652 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
653 /* If rule is found return the rule index. */
654 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
655 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
656 lpm->rules_tbl[rule_index].depth == depth) {
662 /* If rule is not found return -ENOENT. */
667 * Delete a rule from the rule table.
668 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
671 rule_delete(struct rte_lpm6 *lpm, int32_t rule_index)
674 * Overwrite redundant rule with last rule in group and decrement rule
677 lpm->rules_tbl[rule_index] = lpm->rules_tbl[lpm->used_rules-1];
685 rte_lpm6_delete(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
687 int32_t rule_to_delete_index;
688 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
692 * Check input arguments.
694 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH)) {
698 /* Copy the IP and mask it to avoid modifying user's input data. */
699 memcpy(ip_masked, ip, RTE_LPM6_IPV6_ADDR_SIZE);
700 mask_ip(ip_masked, depth);
703 * Find the index of the input rule, that needs to be deleted, in the
706 rule_to_delete_index = rule_find(lpm, ip_masked, depth);
709 * Check if rule_to_delete_index was found. If no rule was found the
710 * function rule_find returns -ENOENT.
712 if (rule_to_delete_index < 0)
713 return rule_to_delete_index;
715 /* Delete the rule from the rule table. */
716 rule_delete(lpm, rule_to_delete_index);
719 * Set all the table entries to 0 (ie delete every rule
720 * from the data structure.
723 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
724 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
725 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
728 * Add every rule again (except for the one that was removed from
731 for (i = 0; i < lpm->used_rules; i++) {
732 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
733 lpm->rules_tbl[i].next_hop);
740 * Deletes a group of rules
743 rte_lpm6_delete_bulk_func(struct rte_lpm6 *lpm,
744 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE], uint8_t *depths, unsigned n)
746 int32_t rule_to_delete_index;
747 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
751 * Check input arguments.
753 if ((lpm == NULL) || (ips == NULL) || (depths == NULL)) {
757 for (i = 0; i < n; i++) {
758 /* Copy the IP and mask it to avoid modifying user's input data. */
759 memcpy(ip_masked, ips[i], RTE_LPM6_IPV6_ADDR_SIZE);
760 mask_ip(ip_masked, depths[i]);
763 * Find the index of the input rule, that needs to be deleted, in the
766 rule_to_delete_index = rule_find(lpm, ip_masked, depths[i]);
769 * Check if rule_to_delete_index was found. If no rule was found the
770 * function rule_find returns -ENOENT.
772 if (rule_to_delete_index < 0)
775 /* Delete the rule from the rule table. */
776 rule_delete(lpm, rule_to_delete_index);
780 * Set all the table entries to 0 (ie delete every rule
781 * from the data structure.
784 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
785 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
786 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
789 * Add every rule again (except for the ones that were removed from
792 for (i = 0; i < lpm->used_rules; i++) {
793 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
794 lpm->rules_tbl[i].next_hop);
801 * Delete all rules from the LPM table.
804 rte_lpm6_delete_all(struct rte_lpm6 *lpm)
806 /* Zero used rules counter. */
809 /* Zero next tbl8 index. */
813 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
816 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0]) *
817 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
819 /* Delete all rules form the rules table. */
820 memset(lpm->rules_tbl, 0, sizeof(struct rte_lpm6_rule) * lpm->max_rules);