Re: Avoid overflow with simplehash - Mailing list pgsql-hackers

From Tom Lane
Subject Re: Avoid overflow with simplehash
Date
Msg-id 1211829.1688656586@sss.pgh.pa.us
Whole thread Raw
In response to Re: Avoid overflow with simplehash  (Ranier Vilela <ranier.vf@gmail.com>)
Responses Re: Avoid overflow with simplehash
Re: Avoid overflow with simplehash
List pgsql-hackers
Ranier Vilela <ranier.vf@gmail.com> writes:
> See the comments:
> "Search for the first empty element."
> If the empty element is not found, startelem has PG_UINT64_MAX value,
> which do not fit in uint32.

I think the point of that assertion is exactly that we're required to
have an empty element (because max fillfactor is less than 1),
so the search should have succeeded.

It does seem like we could do

    uint64        startelem = SH_MAX_SIZE;

    ...

    Assert(startelem < SH_MAX_SIZE);

which'd make it a little clearer that the expectation is for
startelem to have changed value.  And I agree that declaring "i"
as int is wrong.

            regards, tom lane



pgsql-hackers by date:

Previous
From: Önder Kalacı
Date:
Subject: Re: [Patch] Use *other* indexes on the subscriber when REPLICA IDENTITY is FULL
Next
From: Peter Eisentraut
Date:
Subject: Re: [PATCH] Add GitLab CI to PostgreSQL