diff options
author | Alexander Duyck <alexander.h.duyck@redhat.com> | 2015-03-10 17:39:34 -0400 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2015-03-10 18:36:56 -0400 |
commit | ddb4b9a1328ea89733133e86cf1972d23891abfc (patch) | |
tree | 39e6b01f93a37c97fa6721ff7fa0976cd44a0555 | |
parent | 416377ea392823e8ea1f8a10477e7d08a9bb715e (diff) |
fib_trie: Address possible NULL pointer dereference in resize
If the inflate call failed it would return NULL. As a result tp would be
set to NULL and cause use to trigger a NULL pointer dereference in
should_halve if the inflate failed on the first attempt.
In order to prevent this we should decrement max_work before we actually
attempt to inflate as this will force us to exit before attempting to halve
a node we should have inflated. In order to keep things symmetric between
inflate and halve I went ahead and also moved the decrement of max_work for
the halve case as well so we take care of that before we actually attempt
to halve the tnode.
Fixes: 88bae714 ("fib_trie: Add key vector to root, return parent key_vector in resize")
Reported-by: Dan Carpenter <dan.carpenter@oracle.com>
Signed-off-by: Alexander Duyck <alexander.h.duyck@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
-rw-r--r-- | net/ipv4/fib_trie.c | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/net/ipv4/fib_trie.c b/net/ipv4/fib_trie.c index 44cab1d41463..83290beaf7cf 100644 --- a/net/ipv4/fib_trie.c +++ b/net/ipv4/fib_trie.c | |||
@@ -830,7 +830,7 @@ static struct key_vector *resize(struct trie *t, struct key_vector *tn) | |||
830 | /* Double as long as the resulting node has a number of | 830 | /* Double as long as the resulting node has a number of |
831 | * nonempty nodes that are above the threshold. | 831 | * nonempty nodes that are above the threshold. |
832 | */ | 832 | */ |
833 | while (should_inflate(tp, tn) && max_work) { | 833 | while (should_inflate(tp, tn) && max_work--) { |
834 | tp = inflate(t, tn); | 834 | tp = inflate(t, tn); |
835 | if (!tp) { | 835 | if (!tp) { |
836 | #ifdef CONFIG_IP_FIB_TRIE_STATS | 836 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
@@ -839,7 +839,6 @@ static struct key_vector *resize(struct trie *t, struct key_vector *tn) | |||
839 | break; | 839 | break; |
840 | } | 840 | } |
841 | 841 | ||
842 | max_work--; | ||
843 | tn = get_child(tp, cindex); | 842 | tn = get_child(tp, cindex); |
844 | } | 843 | } |
845 | 844 | ||
@@ -850,7 +849,7 @@ static struct key_vector *resize(struct trie *t, struct key_vector *tn) | |||
850 | /* Halve as long as the number of empty children in this | 849 | /* Halve as long as the number of empty children in this |
851 | * node is above threshold. | 850 | * node is above threshold. |
852 | */ | 851 | */ |
853 | while (should_halve(tp, tn) && max_work) { | 852 | while (should_halve(tp, tn) && max_work--) { |
854 | tp = halve(t, tn); | 853 | tp = halve(t, tn); |
855 | if (!tp) { | 854 | if (!tp) { |
856 | #ifdef CONFIG_IP_FIB_TRIE_STATS | 855 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
@@ -859,7 +858,6 @@ static struct key_vector *resize(struct trie *t, struct key_vector *tn) | |||
859 | break; | 858 | break; |
860 | } | 859 | } |
861 | 860 | ||
862 | max_work--; | ||
863 | tn = get_child(tp, cindex); | 861 | tn = get_child(tp, cindex); |
864 | } | 862 | } |
865 | 863 | ||