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_tailq_entry);
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. */
103 char name[RTE_LPM6_NAMESIZE]; /**< Name of the lpm. */
104 uint32_t max_rules; /**< Max number of rules. */
105 uint32_t used_rules; /**< Used rules so far. */
106 uint32_t number_tbl8s; /**< Number of tbl8s to allocate. */
107 uint32_t next_tbl8; /**< Next tbl8 to be used. */
110 struct rte_lpm6_rule *rules_tbl; /**< LPM rules. */
111 struct rte_lpm6_tbl_entry tbl24[RTE_LPM6_TBL24_NUM_ENTRIES]
112 __rte_cache_aligned; /**< LPM tbl24 table. */
113 struct rte_lpm6_tbl_entry tbl8[0]
114 __rte_cache_aligned; /**< LPM tbl8 table. */
118 * Takes an array of uint8_t (IPv6 address) and masks it using the depth.
119 * It leaves untouched one bit per unit in the depth variable
120 * and set the rest to 0.
123 mask_ip(uint8_t *ip, uint8_t depth)
125 int16_t part_depth, mask;
130 for (i = 0; i < RTE_LPM6_IPV6_ADDR_SIZE; i++) {
131 if (part_depth < BYTE_SIZE && part_depth >= 0) {
132 mask = (uint16_t)(~(UINT8_MAX >> part_depth));
133 ip[i] = (uint8_t)(ip[i] & mask);
134 } else if (part_depth < 0) {
137 part_depth -= BYTE_SIZE;
142 * Allocates memory for LPM object
145 rte_lpm6_create(const char *name, int socket_id,
146 const struct rte_lpm6_config *config)
148 char mem_name[RTE_LPM6_NAMESIZE];
149 struct rte_lpm6 *lpm = NULL;
150 struct rte_tailq_entry *te;
151 uint64_t mem_size, rules_size;
152 struct rte_lpm6_list *lpm_list;
154 /* Check that we have an initialised tail queue */
156 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6, rte_lpm6_list)) == NULL) {
157 rte_errno = E_RTE_NO_TAILQ;
161 RTE_BUILD_BUG_ON(sizeof(struct rte_lpm6_tbl_entry) != sizeof(uint32_t));
163 /* Check user arguments. */
164 if ((name == NULL) || (socket_id < -1) || (config == NULL) ||
165 (config->max_rules == 0) ||
166 config->number_tbl8s > RTE_LPM6_TBL8_MAX_NUM_GROUPS) {
171 snprintf(mem_name, sizeof(mem_name), "LPM_%s", name);
173 /* Determine the amount of memory to allocate. */
174 mem_size = sizeof(*lpm) + (sizeof(lpm->tbl8[0]) *
175 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * config->number_tbl8s);
176 rules_size = sizeof(struct rte_lpm6_rule) * config->max_rules;
178 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
180 /* Guarantee there's no existing */
181 TAILQ_FOREACH(te, lpm_list, next) {
182 lpm = (struct rte_lpm6 *) te->data;
183 if (strncmp(name, lpm->name, RTE_LPM6_NAMESIZE) == 0)
189 /* allocate tailq entry */
190 te = rte_zmalloc("LPM6_TAILQ_ENTRY", sizeof(*te), 0);
192 RTE_LOG(ERR, LPM, "Failed to allocate tailq entry!\n");
196 /* Allocate memory to store the LPM data structures. */
197 lpm = (struct rte_lpm6 *)rte_zmalloc_socket(mem_name, (size_t)mem_size,
198 CACHE_LINE_SIZE, socket_id);
201 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
206 lpm->rules_tbl = (struct rte_lpm6_rule *)rte_zmalloc_socket(NULL,
207 (size_t)rules_size, CACHE_LINE_SIZE, socket_id);
209 if (lpm->rules_tbl == NULL) {
210 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
216 /* Save user arguments. */
217 lpm->max_rules = config->max_rules;
218 lpm->number_tbl8s = config->number_tbl8s;
219 snprintf(lpm->name, sizeof(lpm->name), "%s", name);
221 te->data = (void *) lpm;
223 TAILQ_INSERT_TAIL(lpm_list, te, next);
226 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
232 * Find an existing lpm table and return a pointer to it.
235 rte_lpm6_find_existing(const char *name)
237 struct rte_lpm6 *l = NULL;
238 struct rte_tailq_entry *te;
239 struct rte_lpm6_list *lpm_list;
241 /* Check that we have an initialised tail queue */
242 if ((lpm_list = RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM6,
243 rte_lpm6_list)) == NULL) {
244 rte_errno = E_RTE_NO_TAILQ;
248 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
249 TAILQ_FOREACH(te, lpm_list, next) {
250 l = (struct rte_lpm6 *) te->data;
251 if (strncmp(name, l->name, RTE_LPM6_NAMESIZE) == 0)
254 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
265 * Deallocates memory for given LPM table.
268 rte_lpm6_free(struct rte_lpm6 *lpm)
270 struct rte_lpm6_list *lpm_list;
271 struct rte_tailq_entry *te;
273 /* Check user arguments. */
277 /* check that we have an initialised tail queue */
279 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_LPM, rte_lpm6_list)) == NULL) {
280 rte_errno = E_RTE_NO_TAILQ;
284 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
286 /* find our tailq entry */
287 TAILQ_FOREACH(te, lpm_list, next) {
288 if (te->data == (void *) lpm)
292 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
296 TAILQ_REMOVE(lpm_list, te, next);
298 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
305 * Checks if a rule already exists in the rules table and updates
306 * the nexthop if so. Otherwise it adds a new rule if enough space is available.
308 static inline int32_t
309 rule_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t next_hop, uint8_t depth)
313 /* Scan through rule list to see if rule already exists. */
314 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
316 /* If rule already exists update its next_hop and return. */
317 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
318 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
319 lpm->rules_tbl[rule_index].depth == depth) {
320 lpm->rules_tbl[rule_index].next_hop = next_hop;
327 * If rule does not exist check if there is space to add a new rule to
328 * this rule group. If there is no space return error.
330 if (lpm->used_rules == lpm->max_rules) {
334 /* If there is space for the new rule add it. */
335 rte_memcpy(lpm->rules_tbl[rule_index].ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
336 lpm->rules_tbl[rule_index].next_hop = next_hop;
337 lpm->rules_tbl[rule_index].depth = depth;
339 /* Increment the used rules counter for this rule group. */
346 * Function that expands a rule across the data structure when a less-generic
347 * one has been added before. It assures that every possible combination of bits
348 * in the IP address returns a match.
351 expand_rule(struct rte_lpm6 *lpm, uint32_t tbl8_gindex, uint8_t depth,
354 uint32_t tbl8_group_end, tbl8_gindex_next, j;
356 tbl8_group_end = tbl8_gindex + RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
358 struct rte_lpm6_tbl_entry new_tbl8_entry = {
360 .valid_group = VALID,
362 .next_hop = next_hop,
366 for (j = tbl8_gindex; j < tbl8_group_end; j++) {
367 if (!lpm->tbl8[j].valid || (lpm->tbl8[j].ext_entry == 0
368 && lpm->tbl8[j].depth <= depth)) {
370 lpm->tbl8[j] = new_tbl8_entry;
372 } else if (lpm->tbl8[j].ext_entry == 1) {
374 tbl8_gindex_next = lpm->tbl8[j].lpm6_tbl8_gindex
375 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
376 expand_rule(lpm, tbl8_gindex_next, depth, next_hop);
382 * Partially adds a new route to the data structure (tbl24+tbl8s).
383 * It returns 0 on success, a negative number on failure, or 1 if
384 * the process needs to be continued by calling the function again.
387 add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl,
388 struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip, uint8_t bytes,
389 uint8_t first_byte, uint8_t depth, uint8_t next_hop)
391 uint32_t tbl_index, tbl_range, tbl8_group_start, tbl8_group_end, i;
394 uint8_t bits_covered;
397 * Calculate index to the table based on the number and position
398 * of the bytes being inspected in this step.
401 for (i = first_byte; i < (uint32_t)(first_byte + bytes); i++) {
402 bitshift = (int8_t)((bytes - i)*BYTE_SIZE);
404 if (bitshift < 0) bitshift = 0;
405 tbl_index = tbl_index | ip[i-1] << bitshift;
408 /* Number of bits covered in this step */
409 bits_covered = (uint8_t)((bytes+first_byte-1)*BYTE_SIZE);
412 * If depth if smaller than this number (ie this is the last step)
413 * expand the rule across the relevant positions in the table.
415 if (depth <= bits_covered) {
416 tbl_range = 1 << (bits_covered - depth);
418 for (i = tbl_index; i < (tbl_index + tbl_range); i++) {
419 if (!tbl[i].valid || (tbl[i].ext_entry == 0 &&
420 tbl[i].depth <= depth)) {
422 struct rte_lpm6_tbl_entry new_tbl_entry = {
423 .next_hop = next_hop,
426 .valid_group = VALID,
430 tbl[i] = new_tbl_entry;
432 } else if (tbl[i].ext_entry == 1) {
435 * If tbl entry is valid and extended calculate the index
436 * into next tbl8 and expand the rule across the data structure.
438 tbl8_gindex = tbl[i].lpm6_tbl8_gindex *
439 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
440 expand_rule(lpm, tbl8_gindex, depth, next_hop);
447 * If this is not the last step just fill one position
448 * and calculate the index to the next table.
451 /* If it's invalid a new tbl8 is needed */
452 if (!tbl[tbl_index].valid) {
453 if (lpm->next_tbl8 < lpm->number_tbl8s)
454 tbl8_gindex = (lpm->next_tbl8)++;
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 * If it's valid but not extended the rule that was stored *
470 * here needs to be moved to the next table.
472 else if (tbl[tbl_index].ext_entry == 0) {
473 /* Search for free tbl8 group. */
474 if (lpm->next_tbl8 < lpm->number_tbl8s)
475 tbl8_gindex = (lpm->next_tbl8)++;
479 tbl8_group_start = tbl8_gindex *
480 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
481 tbl8_group_end = tbl8_group_start +
482 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES;
484 /* Populate new tbl8 with tbl value. */
485 for (i = tbl8_group_start; i < tbl8_group_end; i++) {
486 lpm->tbl8[i].valid = VALID;
487 lpm->tbl8[i].depth = tbl[tbl_index].depth;
488 lpm->tbl8[i].next_hop = tbl[tbl_index].next_hop;
489 lpm->tbl8[i].ext_entry = 0;
493 * Update tbl entry to point to new tbl8 entry. Note: The
494 * ext_flag and tbl8_index need to be updated simultaneously,
495 * so assign whole structure in one go.
497 struct rte_lpm6_tbl_entry new_tbl_entry = {
498 .lpm6_tbl8_gindex = tbl8_gindex,
501 .valid_group = VALID,
505 tbl[tbl_index] = new_tbl_entry;
508 *tbl_next = &(lpm->tbl8[tbl[tbl_index].lpm6_tbl8_gindex *
509 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES]);
519 rte_lpm6_add(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
522 struct rte_lpm6_tbl_entry *tbl;
523 struct rte_lpm6_tbl_entry *tbl_next;
526 uint8_t masked_ip[RTE_LPM6_IPV6_ADDR_SIZE];
529 /* Check user arguments. */
530 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH))
533 /* Copy the IP and mask it to avoid modifying user's input data. */
534 memcpy(masked_ip, ip, RTE_LPM6_IPV6_ADDR_SIZE);
535 mask_ip(masked_ip, depth);
537 /* Add the rule to the rule table. */
538 rule_index = rule_add(lpm, masked_ip, next_hop, depth);
540 /* If there is no space available for new rule return error. */
541 if (rule_index < 0) {
545 /* Inspect the first three bytes through tbl24 on the first step. */
547 status = add_step (lpm, tbl, &tbl_next, masked_ip, ADD_FIRST_BYTE, 1,
550 rte_lpm6_delete(lpm, masked_ip, depth);
556 * Inspect one by one the rest of the bytes until
557 * the process is completed.
559 for (i = ADD_FIRST_BYTE; i < RTE_LPM6_IPV6_ADDR_SIZE && status == 1; i++) {
561 status = add_step (lpm, tbl, &tbl_next, masked_ip, 1, (uint8_t)(i+1),
564 rte_lpm6_delete(lpm, masked_ip, depth);
574 * Takes a pointer to a table entry and inspect one level.
575 * The function returns 0 on lookup success, ENOENT if no match was found
576 * or 1 if the process needs to be continued by calling the function again.
579 lookup_step(const struct rte_lpm6 *lpm, const struct rte_lpm6_tbl_entry *tbl,
580 const struct rte_lpm6_tbl_entry **tbl_next, uint8_t *ip,
581 uint8_t first_byte, uint8_t *next_hop)
583 uint32_t tbl8_index, tbl_entry;
585 /* Take the integer value from the pointer. */
586 tbl_entry = *(const uint32_t *)tbl;
588 /* If it is valid and extended we calculate the new pointer to return. */
589 if ((tbl_entry & RTE_LPM6_VALID_EXT_ENTRY_BITMASK) ==
590 RTE_LPM6_VALID_EXT_ENTRY_BITMASK) {
592 tbl8_index = ip[first_byte-1] +
593 ((tbl_entry & RTE_LPM6_TBL8_BITMASK) *
594 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES);
596 *tbl_next = &lpm->tbl8[tbl8_index];
600 /* If not extended then we can have a match. */
601 *next_hop = (uint8_t)tbl_entry;
602 return (tbl_entry & RTE_LPM6_LOOKUP_SUCCESS) ? 0 : -ENOENT;
610 rte_lpm6_lookup(const struct rte_lpm6 *lpm, uint8_t *ip, uint8_t *next_hop)
612 const struct rte_lpm6_tbl_entry *tbl;
613 const struct rte_lpm6_tbl_entry *tbl_next;
616 uint32_t tbl24_index;
618 /* DEBUG: Check user input arguments. */
619 if ((lpm == NULL) || (ip == NULL) || (next_hop == NULL)) {
623 first_byte = LOOKUP_FIRST_BYTE;
624 tbl24_index = (ip[0] << BYTES2_SIZE) | (ip[1] << BYTE_SIZE) | ip[2];
626 /* Calculate pointer to the first entry to be inspected */
627 tbl = &lpm->tbl24[tbl24_index];
630 /* Continue inspecting following levels until success or failure */
631 status = lookup_step(lpm, tbl, &tbl_next, ip, first_byte++, next_hop);
633 } while (status == 1);
639 * Looks up a group of IP addresses
642 rte_lpm6_lookup_bulk_func(const struct rte_lpm6 *lpm,
643 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE],
644 int16_t * next_hops, unsigned n)
647 const struct rte_lpm6_tbl_entry *tbl;
648 const struct rte_lpm6_tbl_entry *tbl_next;
649 uint32_t tbl24_index;
650 uint8_t first_byte, next_hop;
653 /* DEBUG: Check user input arguments. */
654 if ((lpm == NULL) || (ips == NULL) || (next_hops == NULL)) {
658 for (i = 0; i < n; i++) {
659 first_byte = LOOKUP_FIRST_BYTE;
660 tbl24_index = (ips[i][0] << BYTES2_SIZE) |
661 (ips[i][1] << BYTE_SIZE) | ips[i][2];
663 /* Calculate pointer to the first entry to be inspected */
664 tbl = &lpm->tbl24[tbl24_index];
667 /* Continue inspecting following levels until success or failure */
668 status = lookup_step(lpm, tbl, &tbl_next, ips[i], first_byte++,
671 } while (status == 1);
676 next_hops[i] = next_hop;
683 * Finds a rule in rule table.
684 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
686 static inline int32_t
687 rule_find(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
691 /* Scan used rules at given depth to find rule. */
692 for (rule_index = 0; rule_index < lpm->used_rules; rule_index++) {
693 /* If rule is found return the rule index. */
694 if ((memcmp (lpm->rules_tbl[rule_index].ip, ip,
695 RTE_LPM6_IPV6_ADDR_SIZE) == 0) &&
696 lpm->rules_tbl[rule_index].depth == depth) {
702 /* If rule is not found return -ENOENT. */
707 * Look for a rule in the high-level rules table
710 rte_lpm6_is_rule_present(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
713 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
716 /* Check user arguments. */
717 if ((lpm == NULL) || next_hop == NULL || ip == NULL ||
718 (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH))
721 /* Copy the IP and mask it to avoid modifying user's input data. */
722 memcpy(ip_masked, ip, RTE_LPM6_IPV6_ADDR_SIZE);
723 mask_ip(ip_masked, depth);
725 /* Look for the rule using rule_find. */
726 rule_index = rule_find(lpm, ip_masked, depth);
728 if (rule_index >= 0) {
729 *next_hop = lpm->rules_tbl[rule_index].next_hop;
733 /* If rule is not found return 0. */
738 * Delete a rule from the rule table.
739 * NOTE: Valid range for depth parameter is 1 .. 128 inclusive.
742 rule_delete(struct rte_lpm6 *lpm, int32_t rule_index)
745 * Overwrite redundant rule with last rule in group and decrement rule
748 lpm->rules_tbl[rule_index] = lpm->rules_tbl[lpm->used_rules-1];
756 rte_lpm6_delete(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth)
758 int32_t rule_to_delete_index;
759 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
763 * Check input arguments.
765 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM6_MAX_DEPTH)) {
769 /* Copy the IP and mask it to avoid modifying user's input data. */
770 memcpy(ip_masked, ip, RTE_LPM6_IPV6_ADDR_SIZE);
771 mask_ip(ip_masked, depth);
774 * Find the index of the input rule, that needs to be deleted, in the
777 rule_to_delete_index = rule_find(lpm, ip_masked, depth);
780 * Check if rule_to_delete_index was found. If no rule was found the
781 * function rule_find returns -ENOENT.
783 if (rule_to_delete_index < 0)
784 return rule_to_delete_index;
786 /* Delete the rule from the rule table. */
787 rule_delete(lpm, rule_to_delete_index);
790 * Set all the table entries to 0 (ie delete every rule
791 * from the data structure.
794 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
795 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
796 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
799 * Add every rule again (except for the one that was removed from
802 for (i = 0; i < lpm->used_rules; i++) {
803 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
804 lpm->rules_tbl[i].next_hop);
811 * Deletes a group of rules
814 rte_lpm6_delete_bulk_func(struct rte_lpm6 *lpm,
815 uint8_t ips[][RTE_LPM6_IPV6_ADDR_SIZE], uint8_t *depths, unsigned n)
817 int32_t rule_to_delete_index;
818 uint8_t ip_masked[RTE_LPM6_IPV6_ADDR_SIZE];
822 * Check input arguments.
824 if ((lpm == NULL) || (ips == NULL) || (depths == NULL)) {
828 for (i = 0; i < n; i++) {
829 /* Copy the IP and mask it to avoid modifying user's input data. */
830 memcpy(ip_masked, ips[i], RTE_LPM6_IPV6_ADDR_SIZE);
831 mask_ip(ip_masked, depths[i]);
834 * Find the index of the input rule, that needs to be deleted, in the
837 rule_to_delete_index = rule_find(lpm, ip_masked, depths[i]);
840 * Check if rule_to_delete_index was found. If no rule was found the
841 * function rule_find returns -ENOENT.
843 if (rule_to_delete_index < 0)
846 /* Delete the rule from the rule table. */
847 rule_delete(lpm, rule_to_delete_index);
851 * Set all the table entries to 0 (ie delete every rule
852 * from the data structure.
855 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
856 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
857 * RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
860 * Add every rule again (except for the ones that were removed from
863 for (i = 0; i < lpm->used_rules; i++) {
864 rte_lpm6_add(lpm, lpm->rules_tbl[i].ip, lpm->rules_tbl[i].depth,
865 lpm->rules_tbl[i].next_hop);
872 * Delete all rules from the LPM table.
875 rte_lpm6_delete_all(struct rte_lpm6 *lpm)
877 /* Zero used rules counter. */
880 /* Zero next tbl8 index. */
884 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
887 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0]) *
888 RTE_LPM6_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
890 /* Delete all rules form the rules table. */
891 memset(lpm->rules_tbl, 0, sizeof(struct rte_lpm6_rule) * lpm->max_rules);