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.
{
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);