From: | John Naylor <john(dot)naylor(at)enterprisedb(dot)com> |
---|---|
To: | Nathan Bossart <nathandbossart(at)gmail(dot)com> |
Cc: | Masahiko Sawada <sawada(dot)mshk(at)gmail(dot)com>, Andres Freund <andres(at)anarazel(dot)de>, John Naylor <jcnaylor(at)gmail(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: optimize lookups in snapshot [sub]xip arrays |
Date: | 2022-08-10 03:50:02 |
Message-ID: | CAFBsxsFp66-1Vxf1TBRMKWc5PkmacRd5zVKs4+kuKagS=397Mg@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, Aug 10, 2022 at 7:13 AM Nathan Bossart <nathandbossart(at)gmail(dot)com> wrote:
>
> On Tue, Aug 09, 2022 at 01:00:37PM -0700, Nathan Bossart wrote:
> > Your adjustments in 0002 seem reasonable to me. I think it makes sense to
> > ensure there is test coverage for pg_lfind32(), but I don't know if that
> > syscache code is the right choice. For non-USE_SSE2 builds, it might make
> > these lookups more expensive.
Yeah.
On Wed, Aug 10, 2022 at 9:25 AM Masahiko Sawada <sawada(dot)mshk(at)gmail(dot)com> wrote:
> I think that for non-USE_SSE2 builds, there is no additional overhead
> as all assertion-related code in pg_lfind32 depends on USE_SSE2.
Nathan is referring to RelationSupportsSysCache() and
RelationHasSysCache(). They currently use binary search and using
linear search on non-x86-64 platforms is probably slower.
[Nathan again]
> One option might be to create a small test module for pg_lfind32(). Here
> is an example.
LGTM, let's see what the buildfarm thinks of 0001.
--
John Naylor
EDB: http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | David Rowley | 2022-08-10 04:04:22 | Re: dropping datumSort field |
Previous Message | Amit Kapila | 2022-08-10 03:38:36 | Re: Perform streaming logical transactions by background workers and parallel apply |