diff mbox series

rib: fix traversal with /32 route

Message ID 20220414200104.245071-1-stephen@networkplumber.org (mailing list archive)
State Accepted, archived
Delegated to: Thomas Monjalon
Headers
Series rib: fix traversal with /32 route |

Checks

Context Check Description
ci/checkpatch success coding style OK
ci/Intel-compilation success Compilation OK
ci/iol-mellanox-Performance success Performance Testing PASS
ci/github-robot: build success github build: passed
ci/iol-intel-Functional success Functional Testing PASS
ci/iol-intel-Performance success Performance Testing PASS
ci/iol-aarch64-unit-testing success Testing PASS
ci/iol-x86_64-compile-testing success Testing PASS
ci/iol-aarch64-compile-testing success Testing PASS
ci/iol-x86_64-unit-testing success Testing PASS
ci/iol-abi-testing success Testing PASS
ci/intel-Testing success Testing PASS

Commit Message

Stephen Hemminger April 14, 2022, 8:01 p.m. UTC 
  If a /32 route is entered in the RIB the code to traverse
will not see that a a end of the tree. This is due to trying
to do a negative shift which is an undefined in C.

Fix by checking for max depth as is already done in rib6.

Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
---
 lib/rib/rte_rib.c | 2 ++
 1 file changed, 2 insertions(+)

Comments

Stephen Hemminger April 15, 2022, 2:29 a.m. UTC | #1 
On Thu, 14 Apr 2022 13:01:04 -0700
Stephen Hemminger <stephen@networkplumber.org> wrote:

> If a /32 route is entered in the RIB the code to traverse
> will not see that a a end of the tree. This is due to trying
> to do a negative shift which is an undefined in C.
> 
> Fix by checking for max depth as is already done in rib6.
> 
> Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
> ---
>  lib/rib/rte_rib.c | 2 ++
>  1 file changed, 2 insertions(+)
> 
> diff --git a/lib/rib/rte_rib.c b/lib/rib/rte_rib.c
> index cd9e823068d2..0603980cabd2 100644
> --- a/lib/rib/rte_rib.c
> +++ b/lib/rib/rte_rib.c
> @@ -71,6 +71,8 @@ is_covered(uint32_t ip1, uint32_t ip2, uint8_t depth)
>  static inline struct rte_rib_node *
>  get_nxt_node(struct rte_rib_node *node, uint32_t ip)
>  {
> +	if (node->depth == RIB_MAXDEPTH)
> +		return NULL;
>  	return (ip & (1 << (31 - node->depth))) ? node->right : node->left;
>  }


Fixes: 5a5793a5ffa2 ("rib: add RIB library")
Vladimir Medvedkin April 26, 2022, 2:28 p.m. UTC | #2 
+Cc:stable@dpdk.org

On 14/04/2022 21:01, Stephen Hemminger wrote:
> If a /32 route is entered in the RIB the code to traverse
> will not see that a a end of the tree. This is due to trying
> to do a negative shift which is an undefined in C.
> 
> Fix by checking for max depth as is already done in rib6.
> 
> Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
> ---
>   lib/rib/rte_rib.c | 2 ++
>   1 file changed, 2 insertions(+)
> 
> diff --git a/lib/rib/rte_rib.c b/lib/rib/rte_rib.c
> index cd9e823068d2..0603980cabd2 100644
> --- a/lib/rib/rte_rib.c
> +++ b/lib/rib/rte_rib.c
> @@ -71,6 +71,8 @@ is_covered(uint32_t ip1, uint32_t ip2, uint8_t depth)
>   static inline struct rte_rib_node *
>   get_nxt_node(struct rte_rib_node *node, uint32_t ip)
>   {
> +	if (node->depth == RIB_MAXDEPTH)
> +		return NULL;
>   	return (ip & (1 << (31 - node->depth))) ? node->right : node->left;
>   }
>   

Acked-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com>
Vladimir Medvedkin April 26, 2022, 2:30 p.m. UTC | #3 
Fixes: 5a5793a5ffa2 ("rib: add RIB library")

On 26/04/2022 15:28, Medvedkin, Vladimir wrote:
> +Cc:stable@dpdk.org
> 
> On 14/04/2022 21:01, Stephen Hemminger wrote:
>> If a /32 route is entered in the RIB the code to traverse
>> will not see that a a end of the tree. This is due to trying
>> to do a negative shift which is an undefined in C.
>>
>> Fix by checking for max depth as is already done in rib6.
>>
>> Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
>> ---
>>   lib/rib/rte_rib.c | 2 ++
>>   1 file changed, 2 insertions(+)
>>
>> diff --git a/lib/rib/rte_rib.c b/lib/rib/rte_rib.c
>> index cd9e823068d2..0603980cabd2 100644
>> --- a/lib/rib/rte_rib.c
>> +++ b/lib/rib/rte_rib.c
>> @@ -71,6 +71,8 @@ is_covered(uint32_t ip1, uint32_t ip2, uint8_t depth)
>>   static inline struct rte_rib_node *
>>   get_nxt_node(struct rte_rib_node *node, uint32_t ip)
>>   {
>> +    if (node->depth == RIB_MAXDEPTH)
>> +        return NULL;
>>       return (ip & (1 << (31 - node->depth))) ? node->right : node->left;
>>   }
> 
> Acked-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com>
>
Thomas Monjalon June 1, 2022, 7:04 a.m. UTC | #4 
26/04/2022 16:30, Medvedkin, Vladimir:
> Fixes: 5a5793a5ffa2 ("rib: add RIB library")
> 
> On 26/04/2022 15:28, Medvedkin, Vladimir wrote:
> > +Cc:stable@dpdk.org
> > 
> > On 14/04/2022 21:01, Stephen Hemminger wrote:
> >> If a /32 route is entered in the RIB the code to traverse
> >> will not see that a a end of the tree. This is due to trying
> >> to do a negative shift which is an undefined in C.
> >>
> >> Fix by checking for max depth as is already done in rib6.
> >>
> >> Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
> >> ---
> >>   lib/rib/rte_rib.c | 2 ++
> >>   1 file changed, 2 insertions(+)
> >>
> >> diff --git a/lib/rib/rte_rib.c b/lib/rib/rte_rib.c
> >> index cd9e823068d2..0603980cabd2 100644
> >> --- a/lib/rib/rte_rib.c
> >> +++ b/lib/rib/rte_rib.c
> >> @@ -71,6 +71,8 @@ is_covered(uint32_t ip1, uint32_t ip2, uint8_t depth)
> >>   static inline struct rte_rib_node *
> >>   get_nxt_node(struct rte_rib_node *node, uint32_t ip)
> >>   {
> >> +    if (node->depth == RIB_MAXDEPTH)
> >> +        return NULL;
> >>       return (ip & (1 << (31 - node->depth))) ? node->right : node->left;
> >>   }
> > 
> > Acked-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com>

Applied, thanks.
diff mbox series

Patch

diff --git a/lib/rib/rte_rib.c b/lib/rib/rte_rib.c
index cd9e823068d2..0603980cabd2 100644
--- a/lib/rib/rte_rib.c
+++ b/lib/rib/rte_rib.c
@@ -71,6 +71,8 @@  is_covered(uint32_t ip1, uint32_t ip2, uint8_t depth)
 static inline struct rte_rib_node *
 get_nxt_node(struct rte_rib_node *node, uint32_t ip)
 {
+	if (node->depth == RIB_MAXDEPTH)
+		return NULL;
 	return (ip & (1 << (31 - node->depth))) ? node->right : node->left;
 }