aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJakub Jelinek <jakub@redhat.com>2022-08-31 10:22:36 +0200
committerJakub Jelinek <jakub@redhat.com>2022-08-31 10:22:36 +0200
commitb3048b6ffb126a4624f66bad713fe6d1dc6dc13d (patch)
treec530eb4b10b4fe824827a52bb775e5dca6b88c7f
parent437bde93dcde8309bb23ee255924c697e8e70df9 (diff)
downloadgcc-b3048b6ffb126a4624f66bad713fe6d1dc6dc13d.zip
gcc-b3048b6ffb126a4624f66bad713fe6d1dc6dc13d.tar.gz
gcc-b3048b6ffb126a4624f66bad713fe6d1dc6dc13d.tar.bz2
libcpp: Make static checkers happy about makeuname2c [PR106778]
The assertion ensures that we point within the image and at a byte we haven't touched yet (or at least that it isn't the first byte of an already stored tree), some static checker was unhappy about first checking that it is zero and only afterwards checking that it is within bounds. 2022-08-31 Jakub Jelinek <jakub@redhat.com> PR preprocessor/106778 * makeuname2c.cc (write_nodes): Reverse order of && operands in assert.
-rw-r--r--libcpp/makeuname2c.cc2
1 files changed, 1 insertions, 1 deletions
diff --git a/libcpp/makeuname2c.cc b/libcpp/makeuname2c.cc
index f27e010..2b3c708 100644
--- a/libcpp/makeuname2c.cc
+++ b/libcpp/makeuname2c.cc
@@ -451,7 +451,7 @@ write_nodes (struct node *n, size_t off)
{
for (; n; n = n->sibling)
{
- assert (tree[off] == 0 && off < tree_size);
+ assert (off < tree_size && tree[off] == 0);
if (n->key_len > 1)
{
assert (n->key_len < 64);