diff options
author | Matthias Kaehlcke <mka@chromium.org> | 2019-06-18 17:14:40 -0400 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2019-06-19 17:29:38 -0400 |
commit | 25cec756891e8733433efea63b2254ddc93aa5cc (patch) | |
tree | 0b64e73061a7d708b1fc8946cb912c24613586a0 | |
parent | 16e5a266f51639492ac30761d043525d7d43f4c8 (diff) |
net/ipv4: fib_trie: Avoid cryptic ternary expressions
empty_child_inc/dec() use the ternary operator for conditional
operations. The conditions involve the post/pre in/decrement
operator and the operation is only performed when the condition
is *not* true. This is hard to parse for humans, use a regular
'if' construct instead and perform the in/decrement separately.
This also fixes two warnings that are emitted about the value
of the ternary expression being unused, when building the kernel
with clang + "kbuild: Remove unnecessary -Wno-unused-value"
(https://lore.kernel.org/patchwork/patch/1089869/):
CC net/ipv4/fib_trie.o
net/ipv4/fib_trie.c:351:2: error: expression result unused [-Werror,-Wunused-value]
++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Fixes: 95f60ea3e99a ("fib_trie: Add collapse() and should_collapse() to resize")
Signed-off-by: Matthias Kaehlcke <mka@chromium.org>
Reviewed-by: Douglas Anderson <dianders@chromium.org>
Reviewed-by: Nick Desaulniers <ndesaulniers@google.com>
Acked-by: Alexander Duyck <alexander.h.duyck@linux.intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
-rw-r--r-- | net/ipv4/fib_trie.c | 10 |
1 files changed, 8 insertions, 2 deletions
diff --git a/net/ipv4/fib_trie.c b/net/ipv4/fib_trie.c index 94e5d83db4db..90f0fc8c87bd 100644 --- a/net/ipv4/fib_trie.c +++ b/net/ipv4/fib_trie.c | |||
@@ -338,12 +338,18 @@ static struct tnode *tnode_alloc(int bits) | |||
338 | 338 | ||
339 | static inline void empty_child_inc(struct key_vector *n) | 339 | static inline void empty_child_inc(struct key_vector *n) |
340 | { | 340 | { |
341 | ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children; | 341 | tn_info(n)->empty_children++; |
342 | |||
343 | if (!tn_info(n)->empty_children) | ||
344 | tn_info(n)->full_children++; | ||
342 | } | 345 | } |
343 | 346 | ||
344 | static inline void empty_child_dec(struct key_vector *n) | 347 | static inline void empty_child_dec(struct key_vector *n) |
345 | { | 348 | { |
346 | tn_info(n)->empty_children-- ? : tn_info(n)->full_children--; | 349 | if (!tn_info(n)->empty_children) |
350 | tn_info(n)->full_children--; | ||
351 | |||
352 | tn_info(n)->empty_children--; | ||
347 | } | 353 | } |
348 | 354 | ||
349 | static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) | 355 | static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) |