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.
40 #include <sys/queue.h>
43 #include <rte_branch_prediction.h>
44 #include <rte_common.h>
45 #include <rte_memory.h> /* for definition of RTE_CACHE_LINE_SIZE */
46 #include <rte_malloc.h>
47 #include <rte_memzone.h>
49 #include <rte_eal_memconfig.h>
50 #include <rte_per_lcore.h>
51 #include <rte_string_fns.h>
52 #include <rte_errno.h>
53 #include <rte_rwlock.h>
54 #include <rte_spinlock.h>
58 TAILQ_HEAD(rte_lpm_list, rte_tailq_entry);
60 static struct rte_tailq_elem rte_lpm_tailq = {
63 EAL_REGISTER_TAILQ(rte_lpm_tailq)
65 #define MAX_DEPTH_TBL24 24
72 /* Macro to enable/disable run-time checks. */
73 #if defined(RTE_LIBRTE_LPM_DEBUG)
74 #include <rte_debug.h>
75 #define VERIFY_DEPTH(depth) do { \
76 if ((depth == 0) || (depth > RTE_LPM_MAX_DEPTH)) \
77 rte_panic("LPM: Invalid depth (%u) at line %d", \
78 (unsigned)(depth), __LINE__); \
81 #define VERIFY_DEPTH(depth)
85 * Converts a given depth value to its corresponding mask value.
87 * depth (IN) : range = 1 - 32
88 * mask (OUT) : 32bit mask
90 static uint32_t __attribute__((pure))
91 depth_to_mask(uint8_t depth)
95 /* To calculate a mask start with a 1 on the left hand side and right
96 * shift while populating the left hand side with 1's
98 return (int)0x80000000 >> (depth - 1);
102 * Converts given depth value to its corresponding range value.
104 static inline uint32_t __attribute__((pure))
105 depth_to_range(uint8_t depth)
110 * Calculate tbl24 range. (Note: 2^depth = 1 << depth)
112 if (depth <= MAX_DEPTH_TBL24)
113 return 1 << (MAX_DEPTH_TBL24 - depth);
115 /* Else if depth is greater than 24 */
116 return 1 << (RTE_LPM_MAX_DEPTH - depth);
120 * Find an existing lpm table and return a pointer to it.
123 rte_lpm_find_existing_v20(const char *name)
125 struct rte_lpm_v20 *l = NULL;
126 struct rte_tailq_entry *te;
127 struct rte_lpm_list *lpm_list;
129 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
131 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
132 TAILQ_FOREACH(te, lpm_list, next) {
133 l = (struct rte_lpm_v20 *) te->data;
134 if (strncmp(name, l->name, RTE_LPM_NAMESIZE) == 0)
137 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
146 VERSION_SYMBOL(rte_lpm_find_existing, _v20, 2.0);
149 rte_lpm_find_existing_v1604(const char *name)
151 struct rte_lpm *l = NULL;
152 struct rte_tailq_entry *te;
153 struct rte_lpm_list *lpm_list;
155 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
157 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
158 TAILQ_FOREACH(te, lpm_list, next) {
159 l = (struct rte_lpm *) te->data;
160 if (strncmp(name, l->name, RTE_LPM_NAMESIZE) == 0)
163 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
172 BIND_DEFAULT_SYMBOL(rte_lpm_find_existing, _v1604, 16.04);
173 MAP_STATIC_SYMBOL(struct rte_lpm *rte_lpm_find_existing(const char *name),
174 rte_lpm_find_existing_v1604);
177 * Allocates memory for LPM object
180 rte_lpm_create_v20(const char *name, int socket_id, int max_rules,
181 __rte_unused int flags)
183 char mem_name[RTE_LPM_NAMESIZE];
184 struct rte_lpm_v20 *lpm = NULL;
185 struct rte_tailq_entry *te;
187 struct rte_lpm_list *lpm_list;
189 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
191 RTE_BUILD_BUG_ON(sizeof(struct rte_lpm_tbl_entry_v20) != 2);
193 /* Check user arguments. */
194 if ((name == NULL) || (socket_id < -1) || (max_rules == 0)) {
199 snprintf(mem_name, sizeof(mem_name), "LPM_%s", name);
201 /* Determine the amount of memory to allocate. */
202 mem_size = sizeof(*lpm) + (sizeof(lpm->rules_tbl[0]) * max_rules);
204 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
206 /* guarantee there's no existing */
207 TAILQ_FOREACH(te, lpm_list, next) {
208 lpm = (struct rte_lpm_v20 *) te->data;
209 if (strncmp(name, lpm->name, RTE_LPM_NAMESIZE) == 0)
218 /* allocate tailq entry */
219 te = rte_zmalloc("LPM_TAILQ_ENTRY", sizeof(*te), 0);
221 RTE_LOG(ERR, LPM, "Failed to allocate tailq entry\n");
225 /* Allocate memory to store the LPM data structures. */
226 lpm = (struct rte_lpm_v20 *)rte_zmalloc_socket(mem_name, mem_size,
227 RTE_CACHE_LINE_SIZE, socket_id);
229 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
234 /* Save user arguments. */
235 lpm->max_rules = max_rules;
236 snprintf(lpm->name, sizeof(lpm->name), "%s", name);
238 te->data = (void *) lpm;
240 TAILQ_INSERT_TAIL(lpm_list, te, next);
243 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
247 VERSION_SYMBOL(rte_lpm_create, _v20, 2.0);
250 rte_lpm_create_v1604(const char *name, int socket_id,
251 const struct rte_lpm_config *config)
253 char mem_name[RTE_LPM_NAMESIZE];
254 struct rte_lpm *lpm = NULL;
255 struct rte_tailq_entry *te;
256 uint32_t mem_size, rules_size, tbl8s_size;
257 struct rte_lpm_list *lpm_list;
259 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
261 RTE_BUILD_BUG_ON(sizeof(struct rte_lpm_tbl_entry) != 4);
263 /* Check user arguments. */
264 if ((name == NULL) || (socket_id < -1) || (config->max_rules == 0)
265 || config->number_tbl8s > RTE_LPM_MAX_TBL8_NUM_GROUPS) {
270 snprintf(mem_name, sizeof(mem_name), "LPM_%s", name);
272 /* Determine the amount of memory to allocate. */
273 mem_size = sizeof(*lpm);
274 rules_size = sizeof(struct rte_lpm_rule) * config->max_rules;
275 tbl8s_size = (sizeof(struct rte_lpm_tbl_entry) *
276 RTE_LPM_TBL8_GROUP_NUM_ENTRIES * config->number_tbl8s);
278 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
280 /* guarantee there's no existing */
281 TAILQ_FOREACH(te, lpm_list, next) {
282 lpm = (struct rte_lpm *) te->data;
283 if (strncmp(name, lpm->name, RTE_LPM_NAMESIZE) == 0)
292 /* allocate tailq entry */
293 te = rte_zmalloc("LPM_TAILQ_ENTRY", sizeof(*te), 0);
295 RTE_LOG(ERR, LPM, "Failed to allocate tailq entry\n");
299 /* Allocate memory to store the LPM data structures. */
300 lpm = (struct rte_lpm *)rte_zmalloc_socket(mem_name, mem_size,
301 RTE_CACHE_LINE_SIZE, socket_id);
303 RTE_LOG(ERR, LPM, "LPM memory allocation failed\n");
308 lpm->rules_tbl = (struct rte_lpm_rule *)rte_zmalloc_socket(NULL,
309 (size_t)rules_size, RTE_CACHE_LINE_SIZE, socket_id);
311 if (lpm->rules_tbl == NULL) {
312 RTE_LOG(ERR, LPM, "LPM rules_tbl memory allocation failed\n");
319 lpm->tbl8 = (struct rte_lpm_tbl_entry *)rte_zmalloc_socket(NULL,
320 (size_t)tbl8s_size, RTE_CACHE_LINE_SIZE, socket_id);
322 if (lpm->tbl8 == NULL) {
323 RTE_LOG(ERR, LPM, "LPM tbl8 memory allocation failed\n");
330 /* Save user arguments. */
331 lpm->max_rules = config->max_rules;
332 lpm->number_tbl8s = config->number_tbl8s;
333 snprintf(lpm->name, sizeof(lpm->name), "%s", name);
335 te->data = (void *) lpm;
337 TAILQ_INSERT_TAIL(lpm_list, te, next);
340 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
344 BIND_DEFAULT_SYMBOL(rte_lpm_create, _v1604, 16.04);
346 struct rte_lpm *rte_lpm_create(const char *name, int socket_id,
347 const struct rte_lpm_config *config), rte_lpm_create_v1604);
350 * Deallocates memory for given LPM table.
353 rte_lpm_free_v20(struct rte_lpm_v20 *lpm)
355 struct rte_lpm_list *lpm_list;
356 struct rte_tailq_entry *te;
358 /* Check user arguments. */
362 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
364 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
366 /* find our tailq entry */
367 TAILQ_FOREACH(te, lpm_list, next) {
368 if (te->data == (void *) lpm)
372 TAILQ_REMOVE(lpm_list, te, next);
374 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
379 VERSION_SYMBOL(rte_lpm_free, _v20, 2.0);
382 rte_lpm_free_v1604(struct rte_lpm *lpm)
384 struct rte_lpm_list *lpm_list;
385 struct rte_tailq_entry *te;
387 /* Check user arguments. */
391 lpm_list = RTE_TAILQ_CAST(rte_lpm_tailq.head, rte_lpm_list);
393 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
395 /* find our tailq entry */
396 TAILQ_FOREACH(te, lpm_list, next) {
397 if (te->data == (void *) lpm)
401 TAILQ_REMOVE(lpm_list, te, next);
403 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
405 rte_free(lpm->rules_tbl);
409 BIND_DEFAULT_SYMBOL(rte_lpm_free, _v1604, 16.04);
410 MAP_STATIC_SYMBOL(void rte_lpm_free(struct rte_lpm *lpm),
414 * Adds a rule to the rule table.
416 * NOTE: The rule table is split into 32 groups. Each group contains rules that
417 * apply to a specific prefix depth (i.e. group 1 contains rules that apply to
418 * prefixes with a depth of 1 etc.). In the following code (depth - 1) is used
419 * to refer to depth 1 because even though the depth range is 1 - 32, depths
420 * are stored in the rule table from 0 - 31.
421 * NOTE: Valid range for depth parameter is 1 .. 32 inclusive.
423 static inline int32_t
424 rule_add_v20(struct rte_lpm_v20 *lpm, uint32_t ip_masked, uint8_t depth,
427 uint32_t rule_gindex, rule_index, last_rule;
432 /* Scan through rule group to see if rule already exists. */
433 if (lpm->rule_info[depth - 1].used_rules > 0) {
435 /* rule_gindex stands for rule group index. */
436 rule_gindex = lpm->rule_info[depth - 1].first_rule;
437 /* Initialise rule_index to point to start of rule group. */
438 rule_index = rule_gindex;
439 /* Last rule = Last used rule in this rule group. */
440 last_rule = rule_gindex + lpm->rule_info[depth - 1].used_rules;
442 for (; rule_index < last_rule; rule_index++) {
444 /* If rule already exists update its next_hop and return. */
445 if (lpm->rules_tbl[rule_index].ip == ip_masked) {
446 lpm->rules_tbl[rule_index].next_hop = next_hop;
452 if (rule_index == lpm->max_rules)
455 /* Calculate the position in which the rule will be stored. */
458 for (i = depth - 1; i > 0; i--) {
459 if (lpm->rule_info[i - 1].used_rules > 0) {
460 rule_index = lpm->rule_info[i - 1].first_rule
461 + lpm->rule_info[i - 1].used_rules;
465 if (rule_index == lpm->max_rules)
468 lpm->rule_info[depth - 1].first_rule = rule_index;
471 /* Make room for the new rule in the array. */
472 for (i = RTE_LPM_MAX_DEPTH; i > depth; i--) {
473 if (lpm->rule_info[i - 1].first_rule
474 + lpm->rule_info[i - 1].used_rules == lpm->max_rules)
477 if (lpm->rule_info[i - 1].used_rules > 0) {
478 lpm->rules_tbl[lpm->rule_info[i - 1].first_rule
479 + lpm->rule_info[i - 1].used_rules]
480 = lpm->rules_tbl[lpm->rule_info[i - 1].first_rule];
481 lpm->rule_info[i - 1].first_rule++;
485 /* Add the new rule. */
486 lpm->rules_tbl[rule_index].ip = ip_masked;
487 lpm->rules_tbl[rule_index].next_hop = next_hop;
489 /* Increment the used rules counter for this rule group. */
490 lpm->rule_info[depth - 1].used_rules++;
495 static inline int32_t
496 rule_add_v1604(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth,
499 uint32_t rule_gindex, rule_index, last_rule;
504 /* Scan through rule group to see if rule already exists. */
505 if (lpm->rule_info[depth - 1].used_rules > 0) {
507 /* rule_gindex stands for rule group index. */
508 rule_gindex = lpm->rule_info[depth - 1].first_rule;
509 /* Initialise rule_index to point to start of rule group. */
510 rule_index = rule_gindex;
511 /* Last rule = Last used rule in this rule group. */
512 last_rule = rule_gindex + lpm->rule_info[depth - 1].used_rules;
514 for (; rule_index < last_rule; rule_index++) {
516 /* If rule already exists update its next_hop and return. */
517 if (lpm->rules_tbl[rule_index].ip == ip_masked) {
518 lpm->rules_tbl[rule_index].next_hop = next_hop;
524 if (rule_index == lpm->max_rules)
527 /* Calculate the position in which the rule will be stored. */
530 for (i = depth - 1; i > 0; i--) {
531 if (lpm->rule_info[i - 1].used_rules > 0) {
532 rule_index = lpm->rule_info[i - 1].first_rule
533 + lpm->rule_info[i - 1].used_rules;
537 if (rule_index == lpm->max_rules)
540 lpm->rule_info[depth - 1].first_rule = rule_index;
543 /* Make room for the new rule in the array. */
544 for (i = RTE_LPM_MAX_DEPTH; i > depth; i--) {
545 if (lpm->rule_info[i - 1].first_rule
546 + lpm->rule_info[i - 1].used_rules == lpm->max_rules)
549 if (lpm->rule_info[i - 1].used_rules > 0) {
550 lpm->rules_tbl[lpm->rule_info[i - 1].first_rule
551 + lpm->rule_info[i - 1].used_rules]
552 = lpm->rules_tbl[lpm->rule_info[i - 1].first_rule];
553 lpm->rule_info[i - 1].first_rule++;
557 /* Add the new rule. */
558 lpm->rules_tbl[rule_index].ip = ip_masked;
559 lpm->rules_tbl[rule_index].next_hop = next_hop;
561 /* Increment the used rules counter for this rule group. */
562 lpm->rule_info[depth - 1].used_rules++;
568 * Delete a rule from the rule table.
569 * NOTE: Valid range for depth parameter is 1 .. 32 inclusive.
572 rule_delete_v20(struct rte_lpm_v20 *lpm, int32_t rule_index, uint8_t depth)
578 lpm->rules_tbl[rule_index] =
579 lpm->rules_tbl[lpm->rule_info[depth - 1].first_rule
580 + lpm->rule_info[depth - 1].used_rules - 1];
582 for (i = depth; i < RTE_LPM_MAX_DEPTH; i++) {
583 if (lpm->rule_info[i].used_rules > 0) {
584 lpm->rules_tbl[lpm->rule_info[i].first_rule - 1] =
585 lpm->rules_tbl[lpm->rule_info[i].first_rule
586 + lpm->rule_info[i].used_rules - 1];
587 lpm->rule_info[i].first_rule--;
591 lpm->rule_info[depth - 1].used_rules--;
595 rule_delete_v1604(struct rte_lpm *lpm, int32_t rule_index, uint8_t depth)
601 lpm->rules_tbl[rule_index] =
602 lpm->rules_tbl[lpm->rule_info[depth - 1].first_rule
603 + lpm->rule_info[depth - 1].used_rules - 1];
605 for (i = depth; i < RTE_LPM_MAX_DEPTH; i++) {
606 if (lpm->rule_info[i].used_rules > 0) {
607 lpm->rules_tbl[lpm->rule_info[i].first_rule - 1] =
608 lpm->rules_tbl[lpm->rule_info[i].first_rule
609 + lpm->rule_info[i].used_rules - 1];
610 lpm->rule_info[i].first_rule--;
614 lpm->rule_info[depth - 1].used_rules--;
618 * Finds a rule in rule table.
619 * NOTE: Valid range for depth parameter is 1 .. 32 inclusive.
621 static inline int32_t
622 rule_find_v20(struct rte_lpm_v20 *lpm, uint32_t ip_masked, uint8_t depth)
624 uint32_t rule_gindex, last_rule, rule_index;
628 rule_gindex = lpm->rule_info[depth - 1].first_rule;
629 last_rule = rule_gindex + lpm->rule_info[depth - 1].used_rules;
631 /* Scan used rules at given depth to find rule. */
632 for (rule_index = rule_gindex; rule_index < last_rule; rule_index++) {
633 /* If rule is found return the rule index. */
634 if (lpm->rules_tbl[rule_index].ip == ip_masked)
638 /* If rule is not found return -EINVAL. */
642 static inline int32_t
643 rule_find_v1604(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth)
645 uint32_t rule_gindex, last_rule, rule_index;
649 rule_gindex = lpm->rule_info[depth - 1].first_rule;
650 last_rule = rule_gindex + lpm->rule_info[depth - 1].used_rules;
652 /* Scan used rules at given depth to find rule. */
653 for (rule_index = rule_gindex; rule_index < last_rule; rule_index++) {
654 /* If rule is found return the rule index. */
655 if (lpm->rules_tbl[rule_index].ip == ip_masked)
659 /* If rule is not found return -EINVAL. */
664 * Find, clean and allocate a tbl8.
666 static inline int32_t
667 tbl8_alloc_v20(struct rte_lpm_tbl_entry_v20 *tbl8)
669 uint32_t group_idx; /* tbl8 group index. */
670 struct rte_lpm_tbl_entry_v20 *tbl8_entry;
672 /* Scan through tbl8 to find a free (i.e. INVALID) tbl8 group. */
673 for (group_idx = 0; group_idx < RTE_LPM_TBL8_NUM_GROUPS;
675 tbl8_entry = &tbl8[group_idx * RTE_LPM_TBL8_GROUP_NUM_ENTRIES];
676 /* If a free tbl8 group is found clean it and set as VALID. */
677 if (!tbl8_entry->valid_group) {
678 memset(&tbl8_entry[0], 0,
679 RTE_LPM_TBL8_GROUP_NUM_ENTRIES *
680 sizeof(tbl8_entry[0]));
682 tbl8_entry->valid_group = VALID;
684 /* Return group index for allocated tbl8 group. */
689 /* If there are no tbl8 groups free then return error. */
693 static inline int32_t
694 tbl8_alloc_v1604(struct rte_lpm_tbl_entry *tbl8, uint32_t number_tbl8s)
696 uint32_t group_idx; /* tbl8 group index. */
697 struct rte_lpm_tbl_entry *tbl8_entry;
699 /* Scan through tbl8 to find a free (i.e. INVALID) tbl8 group. */
700 for (group_idx = 0; group_idx < number_tbl8s; group_idx++) {
701 tbl8_entry = &tbl8[group_idx * RTE_LPM_TBL8_GROUP_NUM_ENTRIES];
702 /* If a free tbl8 group is found clean it and set as VALID. */
703 if (!tbl8_entry->valid_group) {
704 memset(&tbl8_entry[0], 0,
705 RTE_LPM_TBL8_GROUP_NUM_ENTRIES *
706 sizeof(tbl8_entry[0]));
708 tbl8_entry->valid_group = VALID;
710 /* Return group index for allocated tbl8 group. */
715 /* If there are no tbl8 groups free then return error. */
720 tbl8_free_v20(struct rte_lpm_tbl_entry_v20 *tbl8, uint32_t tbl8_group_start)
722 /* Set tbl8 group invalid*/
723 tbl8[tbl8_group_start].valid_group = INVALID;
727 tbl8_free_v1604(struct rte_lpm_tbl_entry *tbl8, uint32_t tbl8_group_start)
729 /* Set tbl8 group invalid*/
730 tbl8[tbl8_group_start].valid_group = INVALID;
733 static inline int32_t
734 add_depth_small_v20(struct rte_lpm_v20 *lpm, uint32_t ip, uint8_t depth,
737 uint32_t tbl24_index, tbl24_range, tbl8_index, tbl8_group_end, i, j;
739 /* Calculate the index into Table24. */
740 tbl24_index = ip >> 8;
741 tbl24_range = depth_to_range(depth);
743 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
745 * For invalid OR valid and non-extended tbl 24 entries set
748 if (!lpm->tbl24[i].valid || (lpm->tbl24[i].valid_group == 0 &&
749 lpm->tbl24[i].depth <= depth)) {
751 struct rte_lpm_tbl_entry_v20 new_tbl24_entry = {
756 new_tbl24_entry.next_hop = next_hop;
758 /* Setting tbl24 entry in one go to avoid race
761 lpm->tbl24[i] = new_tbl24_entry;
766 if (lpm->tbl24[i].valid_group == 1) {
767 /* If tbl24 entry is valid and extended calculate the
770 tbl8_index = lpm->tbl24[i].group_idx *
771 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
772 tbl8_group_end = tbl8_index +
773 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
775 for (j = tbl8_index; j < tbl8_group_end; j++) {
776 if (!lpm->tbl8[j].valid ||
777 lpm->tbl8[j].depth <= depth) {
778 struct rte_lpm_tbl_entry_v20
781 .valid_group = VALID,
784 new_tbl8_entry.next_hop = next_hop;
787 * Setting tbl8 entry in one go to avoid
790 lpm->tbl8[j] = new_tbl8_entry;
801 static inline int32_t
802 add_depth_small_v1604(struct rte_lpm *lpm, uint32_t ip, uint8_t depth,
805 #define group_idx next_hop
806 uint32_t tbl24_index, tbl24_range, tbl8_index, tbl8_group_end, i, j;
808 /* Calculate the index into Table24. */
809 tbl24_index = ip >> 8;
810 tbl24_range = depth_to_range(depth);
812 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
814 * For invalid OR valid and non-extended tbl 24 entries set
817 if (!lpm->tbl24[i].valid || (lpm->tbl24[i].valid_group == 0 &&
818 lpm->tbl24[i].depth <= depth)) {
820 struct rte_lpm_tbl_entry new_tbl24_entry = {
821 .next_hop = next_hop,
827 /* Setting tbl24 entry in one go to avoid race
830 lpm->tbl24[i] = new_tbl24_entry;
835 if (lpm->tbl24[i].valid_group == 1) {
836 /* If tbl24 entry is valid and extended calculate the
839 tbl8_index = lpm->tbl24[i].group_idx *
840 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
841 tbl8_group_end = tbl8_index +
842 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
844 for (j = tbl8_index; j < tbl8_group_end; j++) {
845 if (!lpm->tbl8[j].valid ||
846 lpm->tbl8[j].depth <= depth) {
847 struct rte_lpm_tbl_entry
850 .valid_group = VALID,
852 .next_hop = next_hop,
856 * Setting tbl8 entry in one go to avoid
859 lpm->tbl8[j] = new_tbl8_entry;
870 static inline int32_t
871 add_depth_big_v20(struct rte_lpm_v20 *lpm, uint32_t ip_masked, uint8_t depth,
874 uint32_t tbl24_index;
875 int32_t tbl8_group_index, tbl8_group_start, tbl8_group_end, tbl8_index,
878 tbl24_index = (ip_masked >> 8);
879 tbl8_range = depth_to_range(depth);
881 if (!lpm->tbl24[tbl24_index].valid) {
882 /* Search for a free tbl8 group. */
883 tbl8_group_index = tbl8_alloc_v20(lpm->tbl8);
885 /* Check tbl8 allocation was successful. */
886 if (tbl8_group_index < 0) {
887 return tbl8_group_index;
890 /* Find index into tbl8 and range. */
891 tbl8_index = (tbl8_group_index *
892 RTE_LPM_TBL8_GROUP_NUM_ENTRIES) +
895 /* Set tbl8 entry. */
896 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
897 lpm->tbl8[i].depth = depth;
898 lpm->tbl8[i].next_hop = next_hop;
899 lpm->tbl8[i].valid = VALID;
903 * Update tbl24 entry to point to new tbl8 entry. Note: The
904 * ext_flag and tbl8_index need to be updated simultaneously,
905 * so assign whole structure in one go
908 struct rte_lpm_tbl_entry_v20 new_tbl24_entry = {
909 { .group_idx = (uint8_t)tbl8_group_index, },
915 lpm->tbl24[tbl24_index] = new_tbl24_entry;
917 } /* If valid entry but not extended calculate the index into Table8. */
918 else if (lpm->tbl24[tbl24_index].valid_group == 0) {
919 /* Search for free tbl8 group. */
920 tbl8_group_index = tbl8_alloc_v20(lpm->tbl8);
922 if (tbl8_group_index < 0) {
923 return tbl8_group_index;
926 tbl8_group_start = tbl8_group_index *
927 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
928 tbl8_group_end = tbl8_group_start +
929 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
931 /* Populate new tbl8 with tbl24 value. */
932 for (i = tbl8_group_start; i < tbl8_group_end; i++) {
933 lpm->tbl8[i].valid = VALID;
934 lpm->tbl8[i].depth = lpm->tbl24[tbl24_index].depth;
935 lpm->tbl8[i].next_hop =
936 lpm->tbl24[tbl24_index].next_hop;
939 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
941 /* Insert new rule into the tbl8 entry. */
942 for (i = tbl8_index; i < tbl8_index + tbl8_range; i++) {
943 lpm->tbl8[i].valid = VALID;
944 lpm->tbl8[i].depth = depth;
945 lpm->tbl8[i].next_hop = next_hop;
949 * Update tbl24 entry to point to new tbl8 entry. Note: The
950 * ext_flag and tbl8_index need to be updated simultaneously,
951 * so assign whole structure in one go.
954 struct rte_lpm_tbl_entry_v20 new_tbl24_entry = {
955 { .group_idx = (uint8_t)tbl8_group_index, },
961 lpm->tbl24[tbl24_index] = new_tbl24_entry;
964 * If it is valid, extended entry calculate the index into tbl8.
966 tbl8_group_index = lpm->tbl24[tbl24_index].group_idx;
967 tbl8_group_start = tbl8_group_index *
968 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
969 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
971 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
973 if (!lpm->tbl8[i].valid ||
974 lpm->tbl8[i].depth <= depth) {
975 struct rte_lpm_tbl_entry_v20 new_tbl8_entry = {
978 .valid_group = lpm->tbl8[i].valid_group,
980 new_tbl8_entry.next_hop = next_hop;
982 * Setting tbl8 entry in one go to avoid race
985 lpm->tbl8[i] = new_tbl8_entry;
995 static inline int32_t
996 add_depth_big_v1604(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth,
999 #define group_idx next_hop
1000 uint32_t tbl24_index;
1001 int32_t tbl8_group_index, tbl8_group_start, tbl8_group_end, tbl8_index,
1004 tbl24_index = (ip_masked >> 8);
1005 tbl8_range = depth_to_range(depth);
1007 if (!lpm->tbl24[tbl24_index].valid) {
1008 /* Search for a free tbl8 group. */
1009 tbl8_group_index = tbl8_alloc_v1604(lpm->tbl8, lpm->number_tbl8s);
1011 /* Check tbl8 allocation was successful. */
1012 if (tbl8_group_index < 0) {
1013 return tbl8_group_index;
1016 /* Find index into tbl8 and range. */
1017 tbl8_index = (tbl8_group_index *
1018 RTE_LPM_TBL8_GROUP_NUM_ENTRIES) +
1021 /* Set tbl8 entry. */
1022 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1023 lpm->tbl8[i].depth = depth;
1024 lpm->tbl8[i].next_hop = next_hop;
1025 lpm->tbl8[i].valid = VALID;
1029 * Update tbl24 entry to point to new tbl8 entry. Note: The
1030 * ext_flag and tbl8_index need to be updated simultaneously,
1031 * so assign whole structure in one go
1034 struct rte_lpm_tbl_entry new_tbl24_entry = {
1035 .group_idx = (uint8_t)tbl8_group_index,
1041 lpm->tbl24[tbl24_index] = new_tbl24_entry;
1043 } /* If valid entry but not extended calculate the index into Table8. */
1044 else if (lpm->tbl24[tbl24_index].valid_group == 0) {
1045 /* Search for free tbl8 group. */
1046 tbl8_group_index = tbl8_alloc_v1604(lpm->tbl8, lpm->number_tbl8s);
1048 if (tbl8_group_index < 0) {
1049 return tbl8_group_index;
1052 tbl8_group_start = tbl8_group_index *
1053 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1054 tbl8_group_end = tbl8_group_start +
1055 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1057 /* Populate new tbl8 with tbl24 value. */
1058 for (i = tbl8_group_start; i < tbl8_group_end; i++) {
1059 lpm->tbl8[i].valid = VALID;
1060 lpm->tbl8[i].depth = lpm->tbl24[tbl24_index].depth;
1061 lpm->tbl8[i].next_hop =
1062 lpm->tbl24[tbl24_index].next_hop;
1065 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
1067 /* Insert new rule into the tbl8 entry. */
1068 for (i = tbl8_index; i < tbl8_index + tbl8_range; i++) {
1069 lpm->tbl8[i].valid = VALID;
1070 lpm->tbl8[i].depth = depth;
1071 lpm->tbl8[i].next_hop = next_hop;
1075 * Update tbl24 entry to point to new tbl8 entry. Note: The
1076 * ext_flag and tbl8_index need to be updated simultaneously,
1077 * so assign whole structure in one go.
1080 struct rte_lpm_tbl_entry new_tbl24_entry = {
1081 .group_idx = (uint8_t)tbl8_group_index,
1087 lpm->tbl24[tbl24_index] = new_tbl24_entry;
1090 * If it is valid, extended entry calculate the index into tbl8.
1092 tbl8_group_index = lpm->tbl24[tbl24_index].group_idx;
1093 tbl8_group_start = tbl8_group_index *
1094 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1095 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
1097 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1099 if (!lpm->tbl8[i].valid ||
1100 lpm->tbl8[i].depth <= depth) {
1101 struct rte_lpm_tbl_entry new_tbl8_entry = {
1104 .next_hop = next_hop,
1105 .valid_group = lpm->tbl8[i].valid_group,
1109 * Setting tbl8 entry in one go to avoid race
1112 lpm->tbl8[i] = new_tbl8_entry;
1126 rte_lpm_add_v20(struct rte_lpm_v20 *lpm, uint32_t ip, uint8_t depth,
1129 int32_t rule_index, status = 0;
1132 /* Check user arguments. */
1133 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH))
1136 ip_masked = ip & depth_to_mask(depth);
1138 /* Add the rule to the rule table. */
1139 rule_index = rule_add_v20(lpm, ip_masked, depth, next_hop);
1141 /* If the is no space available for new rule return error. */
1142 if (rule_index < 0) {
1146 if (depth <= MAX_DEPTH_TBL24) {
1147 status = add_depth_small_v20(lpm, ip_masked, depth, next_hop);
1148 } else { /* If depth > RTE_LPM_MAX_DEPTH_TBL24 */
1149 status = add_depth_big_v20(lpm, ip_masked, depth, next_hop);
1152 * If add fails due to exhaustion of tbl8 extensions delete
1153 * rule that was added to rule table.
1156 rule_delete_v20(lpm, rule_index, depth);
1164 VERSION_SYMBOL(rte_lpm_add, _v20, 2.0);
1167 rte_lpm_add_v1604(struct rte_lpm *lpm, uint32_t ip, uint8_t depth,
1170 int32_t rule_index, status = 0;
1173 /* Check user arguments. */
1174 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH))
1177 ip_masked = ip & depth_to_mask(depth);
1179 /* Add the rule to the rule table. */
1180 rule_index = rule_add_v1604(lpm, ip_masked, depth, next_hop);
1182 /* If the is no space available for new rule return error. */
1183 if (rule_index < 0) {
1187 if (depth <= MAX_DEPTH_TBL24) {
1188 status = add_depth_small_v1604(lpm, ip_masked, depth, next_hop);
1189 } else { /* If depth > RTE_LPM_MAX_DEPTH_TBL24 */
1190 status = add_depth_big_v1604(lpm, ip_masked, depth, next_hop);
1193 * If add fails due to exhaustion of tbl8 extensions delete
1194 * rule that was added to rule table.
1197 rule_delete_v1604(lpm, rule_index, depth);
1205 BIND_DEFAULT_SYMBOL(rte_lpm_add, _v1604, 16.04);
1206 MAP_STATIC_SYMBOL(int rte_lpm_add(struct rte_lpm *lpm, uint32_t ip,
1207 uint8_t depth, uint32_t next_hop), rte_lpm_add_v1604);
1210 * Look for a rule in the high-level rules table
1213 rte_lpm_is_rule_present_v20(struct rte_lpm_v20 *lpm, uint32_t ip, uint8_t depth,
1219 /* Check user arguments. */
1220 if ((lpm == NULL) ||
1221 (next_hop == NULL) ||
1222 (depth < 1) || (depth > RTE_LPM_MAX_DEPTH))
1225 /* Look for the rule using rule_find. */
1226 ip_masked = ip & depth_to_mask(depth);
1227 rule_index = rule_find_v20(lpm, ip_masked, depth);
1229 if (rule_index >= 0) {
1230 *next_hop = lpm->rules_tbl[rule_index].next_hop;
1234 /* If rule is not found return 0. */
1237 VERSION_SYMBOL(rte_lpm_is_rule_present, _v20, 2.0);
1240 rte_lpm_is_rule_present_v1604(struct rte_lpm *lpm, uint32_t ip, uint8_t depth,
1246 /* Check user arguments. */
1247 if ((lpm == NULL) ||
1248 (next_hop == NULL) ||
1249 (depth < 1) || (depth > RTE_LPM_MAX_DEPTH))
1252 /* Look for the rule using rule_find. */
1253 ip_masked = ip & depth_to_mask(depth);
1254 rule_index = rule_find_v1604(lpm, ip_masked, depth);
1256 if (rule_index >= 0) {
1257 *next_hop = lpm->rules_tbl[rule_index].next_hop;
1261 /* If rule is not found return 0. */
1264 BIND_DEFAULT_SYMBOL(rte_lpm_is_rule_present, _v1604, 16.04);
1265 MAP_STATIC_SYMBOL(int rte_lpm_is_rule_present(struct rte_lpm *lpm, uint32_t ip,
1266 uint8_t depth, uint32_t *next_hop), rte_lpm_is_rule_present_v1604);
1268 static inline int32_t
1269 find_previous_rule_v20(struct rte_lpm_v20 *lpm, uint32_t ip, uint8_t depth,
1270 uint8_t *sub_rule_depth)
1276 for (prev_depth = (uint8_t)(depth - 1); prev_depth > 0; prev_depth--) {
1277 ip_masked = ip & depth_to_mask(prev_depth);
1279 rule_index = rule_find_v20(lpm, ip_masked, prev_depth);
1281 if (rule_index >= 0) {
1282 *sub_rule_depth = prev_depth;
1290 static inline int32_t
1291 find_previous_rule_v1604(struct rte_lpm *lpm, uint32_t ip, uint8_t depth,
1292 uint8_t *sub_rule_depth)
1298 for (prev_depth = (uint8_t)(depth - 1); prev_depth > 0; prev_depth--) {
1299 ip_masked = ip & depth_to_mask(prev_depth);
1301 rule_index = rule_find_v1604(lpm, ip_masked, prev_depth);
1303 if (rule_index >= 0) {
1304 *sub_rule_depth = prev_depth;
1312 static inline int32_t
1313 delete_depth_small_v20(struct rte_lpm_v20 *lpm, uint32_t ip_masked,
1314 uint8_t depth, int32_t sub_rule_index, uint8_t sub_rule_depth)
1316 uint32_t tbl24_range, tbl24_index, tbl8_group_index, tbl8_index, i, j;
1318 /* Calculate the range and index into Table24. */
1319 tbl24_range = depth_to_range(depth);
1320 tbl24_index = (ip_masked >> 8);
1323 * Firstly check the sub_rule_index. A -1 indicates no replacement rule
1324 * and a positive number indicates a sub_rule_index.
1326 if (sub_rule_index < 0) {
1328 * If no replacement rule exists then invalidate entries
1329 * associated with this rule.
1331 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
1333 if (lpm->tbl24[i].valid_group == 0 &&
1334 lpm->tbl24[i].depth <= depth) {
1335 lpm->tbl24[i].valid = INVALID;
1336 } else if (lpm->tbl24[i].valid_group == 1) {
1338 * If TBL24 entry is extended, then there has
1339 * to be a rule with depth >= 25 in the
1340 * associated TBL8 group.
1343 tbl8_group_index = lpm->tbl24[i].group_idx;
1344 tbl8_index = tbl8_group_index *
1345 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1347 for (j = tbl8_index; j < (tbl8_index +
1348 RTE_LPM_TBL8_GROUP_NUM_ENTRIES); j++) {
1350 if (lpm->tbl8[j].depth <= depth)
1351 lpm->tbl8[j].valid = INVALID;
1357 * If a replacement rule exists then modify entries
1358 * associated with this rule.
1361 struct rte_lpm_tbl_entry_v20 new_tbl24_entry = {
1362 {.next_hop = lpm->rules_tbl[sub_rule_index].next_hop,},
1365 .depth = sub_rule_depth,
1368 struct rte_lpm_tbl_entry_v20 new_tbl8_entry = {
1370 .valid_group = VALID,
1371 .depth = sub_rule_depth,
1373 new_tbl8_entry.next_hop =
1374 lpm->rules_tbl[sub_rule_index].next_hop;
1376 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
1378 if (lpm->tbl24[i].valid_group == 0 &&
1379 lpm->tbl24[i].depth <= depth) {
1380 lpm->tbl24[i] = new_tbl24_entry;
1381 } else if (lpm->tbl24[i].valid_group == 1) {
1383 * If TBL24 entry is extended, then there has
1384 * to be a rule with depth >= 25 in the
1385 * associated TBL8 group.
1388 tbl8_group_index = lpm->tbl24[i].group_idx;
1389 tbl8_index = tbl8_group_index *
1390 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1392 for (j = tbl8_index; j < (tbl8_index +
1393 RTE_LPM_TBL8_GROUP_NUM_ENTRIES); j++) {
1395 if (lpm->tbl8[j].depth <= depth)
1396 lpm->tbl8[j] = new_tbl8_entry;
1405 static inline int32_t
1406 delete_depth_small_v1604(struct rte_lpm *lpm, uint32_t ip_masked,
1407 uint8_t depth, int32_t sub_rule_index, uint8_t sub_rule_depth)
1409 #define group_idx next_hop
1410 uint32_t tbl24_range, tbl24_index, tbl8_group_index, tbl8_index, i, j;
1412 /* Calculate the range and index into Table24. */
1413 tbl24_range = depth_to_range(depth);
1414 tbl24_index = (ip_masked >> 8);
1417 * Firstly check the sub_rule_index. A -1 indicates no replacement rule
1418 * and a positive number indicates a sub_rule_index.
1420 if (sub_rule_index < 0) {
1422 * If no replacement rule exists then invalidate entries
1423 * associated with this rule.
1425 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
1427 if (lpm->tbl24[i].valid_group == 0 &&
1428 lpm->tbl24[i].depth <= depth) {
1429 lpm->tbl24[i].valid = INVALID;
1430 } else if (lpm->tbl24[i].valid_group == 1) {
1432 * If TBL24 entry is extended, then there has
1433 * to be a rule with depth >= 25 in the
1434 * associated TBL8 group.
1437 tbl8_group_index = lpm->tbl24[i].group_idx;
1438 tbl8_index = tbl8_group_index *
1439 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1441 for (j = tbl8_index; j < (tbl8_index +
1442 RTE_LPM_TBL8_GROUP_NUM_ENTRIES); j++) {
1444 if (lpm->tbl8[j].depth <= depth)
1445 lpm->tbl8[j].valid = INVALID;
1451 * If a replacement rule exists then modify entries
1452 * associated with this rule.
1455 struct rte_lpm_tbl_entry new_tbl24_entry = {
1456 .next_hop = lpm->rules_tbl[sub_rule_index].next_hop,
1459 .depth = sub_rule_depth,
1462 struct rte_lpm_tbl_entry new_tbl8_entry = {
1464 .valid_group = VALID,
1465 .depth = sub_rule_depth,
1466 .next_hop = lpm->rules_tbl
1467 [sub_rule_index].next_hop,
1470 for (i = tbl24_index; i < (tbl24_index + tbl24_range); i++) {
1472 if (lpm->tbl24[i].valid_group == 0 &&
1473 lpm->tbl24[i].depth <= depth) {
1474 lpm->tbl24[i] = new_tbl24_entry;
1475 } else if (lpm->tbl24[i].valid_group == 1) {
1477 * If TBL24 entry is extended, then there has
1478 * to be a rule with depth >= 25 in the
1479 * associated TBL8 group.
1482 tbl8_group_index = lpm->tbl24[i].group_idx;
1483 tbl8_index = tbl8_group_index *
1484 RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1486 for (j = tbl8_index; j < (tbl8_index +
1487 RTE_LPM_TBL8_GROUP_NUM_ENTRIES); j++) {
1489 if (lpm->tbl8[j].depth <= depth)
1490 lpm->tbl8[j] = new_tbl8_entry;
1500 * Checks if table 8 group can be recycled.
1502 * Return of -EEXIST means tbl8 is in use and thus can not be recycled.
1503 * Return of -EINVAL means tbl8 is empty and thus can be recycled
1504 * Return of value > -1 means tbl8 is in use but has all the same values and
1505 * thus can be recycled
1507 static inline int32_t
1508 tbl8_recycle_check_v20(struct rte_lpm_tbl_entry_v20 *tbl8,
1509 uint32_t tbl8_group_start)
1511 uint32_t tbl8_group_end, i;
1512 tbl8_group_end = tbl8_group_start + RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1515 * Check the first entry of the given tbl8. If it is invalid we know
1516 * this tbl8 does not contain any rule with a depth < RTE_LPM_MAX_DEPTH
1517 * (As they would affect all entries in a tbl8) and thus this table
1518 * can not be recycled.
1520 if (tbl8[tbl8_group_start].valid) {
1522 * If first entry is valid check if the depth is less than 24
1523 * and if so check the rest of the entries to verify that they
1524 * are all of this depth.
1526 if (tbl8[tbl8_group_start].depth <= MAX_DEPTH_TBL24) {
1527 for (i = (tbl8_group_start + 1); i < tbl8_group_end;
1530 if (tbl8[i].depth !=
1531 tbl8[tbl8_group_start].depth) {
1536 /* If all entries are the same return the tb8 index */
1537 return tbl8_group_start;
1543 * If the first entry is invalid check if the rest of the entries in
1544 * the tbl8 are invalid.
1546 for (i = (tbl8_group_start + 1); i < tbl8_group_end; i++) {
1550 /* If no valid entries are found then return -EINVAL. */
1554 static inline int32_t
1555 tbl8_recycle_check_v1604(struct rte_lpm_tbl_entry *tbl8,
1556 uint32_t tbl8_group_start)
1558 uint32_t tbl8_group_end, i;
1559 tbl8_group_end = tbl8_group_start + RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1562 * Check the first entry of the given tbl8. If it is invalid we know
1563 * this tbl8 does not contain any rule with a depth < RTE_LPM_MAX_DEPTH
1564 * (As they would affect all entries in a tbl8) and thus this table
1565 * can not be recycled.
1567 if (tbl8[tbl8_group_start].valid) {
1569 * If first entry is valid check if the depth is less than 24
1570 * and if so check the rest of the entries to verify that they
1571 * are all of this depth.
1573 if (tbl8[tbl8_group_start].depth <= MAX_DEPTH_TBL24) {
1574 for (i = (tbl8_group_start + 1); i < tbl8_group_end;
1577 if (tbl8[i].depth !=
1578 tbl8[tbl8_group_start].depth) {
1583 /* If all entries are the same return the tb8 index */
1584 return tbl8_group_start;
1590 * If the first entry is invalid check if the rest of the entries in
1591 * the tbl8 are invalid.
1593 for (i = (tbl8_group_start + 1); i < tbl8_group_end; i++) {
1597 /* If no valid entries are found then return -EINVAL. */
1601 static inline int32_t
1602 delete_depth_big_v20(struct rte_lpm_v20 *lpm, uint32_t ip_masked,
1603 uint8_t depth, int32_t sub_rule_index, uint8_t sub_rule_depth)
1605 uint32_t tbl24_index, tbl8_group_index, tbl8_group_start, tbl8_index,
1607 int32_t tbl8_recycle_index;
1610 * Calculate the index into tbl24 and range. Note: All depths larger
1611 * than MAX_DEPTH_TBL24 are associated with only one tbl24 entry.
1613 tbl24_index = ip_masked >> 8;
1615 /* Calculate the index into tbl8 and range. */
1616 tbl8_group_index = lpm->tbl24[tbl24_index].group_idx;
1617 tbl8_group_start = tbl8_group_index * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1618 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
1619 tbl8_range = depth_to_range(depth);
1621 if (sub_rule_index < 0) {
1623 * Loop through the range of entries on tbl8 for which the
1624 * rule_to_delete must be removed or modified.
1626 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1627 if (lpm->tbl8[i].depth <= depth)
1628 lpm->tbl8[i].valid = INVALID;
1631 /* Set new tbl8 entry. */
1632 struct rte_lpm_tbl_entry_v20 new_tbl8_entry = {
1634 .depth = sub_rule_depth,
1635 .valid_group = lpm->tbl8[tbl8_group_start].valid_group,
1638 new_tbl8_entry.next_hop =
1639 lpm->rules_tbl[sub_rule_index].next_hop;
1641 * Loop through the range of entries on tbl8 for which the
1642 * rule_to_delete must be modified.
1644 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1645 if (lpm->tbl8[i].depth <= depth)
1646 lpm->tbl8[i] = new_tbl8_entry;
1651 * Check if there are any valid entries in this tbl8 group. If all
1652 * tbl8 entries are invalid we can free the tbl8 and invalidate the
1653 * associated tbl24 entry.
1656 tbl8_recycle_index = tbl8_recycle_check_v20(lpm->tbl8, tbl8_group_start);
1658 if (tbl8_recycle_index == -EINVAL) {
1659 /* Set tbl24 before freeing tbl8 to avoid race condition. */
1660 lpm->tbl24[tbl24_index].valid = 0;
1661 tbl8_free_v20(lpm->tbl8, tbl8_group_start);
1662 } else if (tbl8_recycle_index > -1) {
1663 /* Update tbl24 entry. */
1664 struct rte_lpm_tbl_entry_v20 new_tbl24_entry = {
1665 { .next_hop = lpm->tbl8[tbl8_recycle_index].next_hop, },
1668 .depth = lpm->tbl8[tbl8_recycle_index].depth,
1671 /* Set tbl24 before freeing tbl8 to avoid race condition. */
1672 lpm->tbl24[tbl24_index] = new_tbl24_entry;
1673 tbl8_free_v20(lpm->tbl8, tbl8_group_start);
1679 static inline int32_t
1680 delete_depth_big_v1604(struct rte_lpm *lpm, uint32_t ip_masked,
1681 uint8_t depth, int32_t sub_rule_index, uint8_t sub_rule_depth)
1683 #define group_idx next_hop
1684 uint32_t tbl24_index, tbl8_group_index, tbl8_group_start, tbl8_index,
1686 int32_t tbl8_recycle_index;
1689 * Calculate the index into tbl24 and range. Note: All depths larger
1690 * than MAX_DEPTH_TBL24 are associated with only one tbl24 entry.
1692 tbl24_index = ip_masked >> 8;
1694 /* Calculate the index into tbl8 and range. */
1695 tbl8_group_index = lpm->tbl24[tbl24_index].group_idx;
1696 tbl8_group_start = tbl8_group_index * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
1697 tbl8_index = tbl8_group_start + (ip_masked & 0xFF);
1698 tbl8_range = depth_to_range(depth);
1700 if (sub_rule_index < 0) {
1702 * Loop through the range of entries on tbl8 for which the
1703 * rule_to_delete must be removed or modified.
1705 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1706 if (lpm->tbl8[i].depth <= depth)
1707 lpm->tbl8[i].valid = INVALID;
1710 /* Set new tbl8 entry. */
1711 struct rte_lpm_tbl_entry new_tbl8_entry = {
1713 .depth = sub_rule_depth,
1714 .valid_group = lpm->tbl8[tbl8_group_start].valid_group,
1715 .next_hop = lpm->rules_tbl[sub_rule_index].next_hop,
1719 * Loop through the range of entries on tbl8 for which the
1720 * rule_to_delete must be modified.
1722 for (i = tbl8_index; i < (tbl8_index + tbl8_range); i++) {
1723 if (lpm->tbl8[i].depth <= depth)
1724 lpm->tbl8[i] = new_tbl8_entry;
1729 * Check if there are any valid entries in this tbl8 group. If all
1730 * tbl8 entries are invalid we can free the tbl8 and invalidate the
1731 * associated tbl24 entry.
1734 tbl8_recycle_index = tbl8_recycle_check_v1604(lpm->tbl8, tbl8_group_start);
1736 if (tbl8_recycle_index == -EINVAL) {
1737 /* Set tbl24 before freeing tbl8 to avoid race condition. */
1738 lpm->tbl24[tbl24_index].valid = 0;
1739 tbl8_free_v1604(lpm->tbl8, tbl8_group_start);
1740 } else if (tbl8_recycle_index > -1) {
1741 /* Update tbl24 entry. */
1742 struct rte_lpm_tbl_entry new_tbl24_entry = {
1743 .next_hop = lpm->tbl8[tbl8_recycle_index].next_hop,
1746 .depth = lpm->tbl8[tbl8_recycle_index].depth,
1749 /* Set tbl24 before freeing tbl8 to avoid race condition. */
1750 lpm->tbl24[tbl24_index] = new_tbl24_entry;
1751 tbl8_free_v1604(lpm->tbl8, tbl8_group_start);
1761 rte_lpm_delete_v20(struct rte_lpm_v20 *lpm, uint32_t ip, uint8_t depth)
1763 int32_t rule_to_delete_index, sub_rule_index;
1765 uint8_t sub_rule_depth;
1767 * Check input arguments. Note: IP must be a positive integer of 32
1768 * bits in length therefore it need not be checked.
1770 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) {
1774 ip_masked = ip & depth_to_mask(depth);
1777 * Find the index of the input rule, that needs to be deleted, in the
1780 rule_to_delete_index = rule_find_v20(lpm, ip_masked, depth);
1783 * Check if rule_to_delete_index was found. If no rule was found the
1784 * function rule_find returns -EINVAL.
1786 if (rule_to_delete_index < 0)
1789 /* Delete the rule from the rule table. */
1790 rule_delete_v20(lpm, rule_to_delete_index, depth);
1793 * Find rule to replace the rule_to_delete. If there is no rule to
1794 * replace the rule_to_delete we return -1 and invalidate the table
1795 * entries associated with this rule.
1798 sub_rule_index = find_previous_rule_v20(lpm, ip, depth, &sub_rule_depth);
1801 * If the input depth value is less than 25 use function
1802 * delete_depth_small otherwise use delete_depth_big.
1804 if (depth <= MAX_DEPTH_TBL24) {
1805 return delete_depth_small_v20(lpm, ip_masked, depth,
1806 sub_rule_index, sub_rule_depth);
1807 } else { /* If depth > MAX_DEPTH_TBL24 */
1808 return delete_depth_big_v20(lpm, ip_masked, depth, sub_rule_index,
1812 VERSION_SYMBOL(rte_lpm_delete, _v20, 2.0);
1815 rte_lpm_delete_v1604(struct rte_lpm *lpm, uint32_t ip, uint8_t depth)
1817 int32_t rule_to_delete_index, sub_rule_index;
1819 uint8_t sub_rule_depth;
1821 * Check input arguments. Note: IP must be a positive integer of 32
1822 * bits in length therefore it need not be checked.
1824 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) {
1828 ip_masked = ip & depth_to_mask(depth);
1831 * Find the index of the input rule, that needs to be deleted, in the
1834 rule_to_delete_index = rule_find_v1604(lpm, ip_masked, depth);
1837 * Check if rule_to_delete_index was found. If no rule was found the
1838 * function rule_find returns -EINVAL.
1840 if (rule_to_delete_index < 0)
1843 /* Delete the rule from the rule table. */
1844 rule_delete_v1604(lpm, rule_to_delete_index, depth);
1847 * Find rule to replace the rule_to_delete. If there is no rule to
1848 * replace the rule_to_delete we return -1 and invalidate the table
1849 * entries associated with this rule.
1852 sub_rule_index = find_previous_rule_v1604(lpm, ip, depth, &sub_rule_depth);
1855 * If the input depth value is less than 25 use function
1856 * delete_depth_small otherwise use delete_depth_big.
1858 if (depth <= MAX_DEPTH_TBL24) {
1859 return delete_depth_small_v1604(lpm, ip_masked, depth,
1860 sub_rule_index, sub_rule_depth);
1861 } else { /* If depth > MAX_DEPTH_TBL24 */
1862 return delete_depth_big_v1604(lpm, ip_masked, depth, sub_rule_index,
1866 BIND_DEFAULT_SYMBOL(rte_lpm_delete, _v1604, 16.04);
1867 MAP_STATIC_SYMBOL(int rte_lpm_delete(struct rte_lpm *lpm, uint32_t ip,
1868 uint8_t depth), rte_lpm_delete_v1604);
1871 * Delete all rules from the LPM table.
1874 rte_lpm_delete_all_v20(struct rte_lpm_v20 *lpm)
1876 /* Zero rule information. */
1877 memset(lpm->rule_info, 0, sizeof(lpm->rule_info));
1880 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
1883 memset(lpm->tbl8, 0, sizeof(lpm->tbl8));
1885 /* Delete all rules form the rules table. */
1886 memset(lpm->rules_tbl, 0, sizeof(lpm->rules_tbl[0]) * lpm->max_rules);
1888 VERSION_SYMBOL(rte_lpm_delete_all, _v20, 2.0);
1891 rte_lpm_delete_all_v1604(struct rte_lpm *lpm)
1893 /* Zero rule information. */
1894 memset(lpm->rule_info, 0, sizeof(lpm->rule_info));
1897 memset(lpm->tbl24, 0, sizeof(lpm->tbl24));
1900 memset(lpm->tbl8, 0, sizeof(lpm->tbl8[0])
1901 * RTE_LPM_TBL8_GROUP_NUM_ENTRIES * lpm->number_tbl8s);
1903 /* Delete all rules form the rules table. */
1904 memset(lpm->rules_tbl, 0, sizeof(lpm->rules_tbl[0]) * lpm->max_rules);
1906 BIND_DEFAULT_SYMBOL(rte_lpm_delete_all, _v1604, 16.04);
1907 MAP_STATIC_SYMBOL(void rte_lpm_delete_all(struct rte_lpm *lpm),
1908 rte_lpm_delete_all_v1604);