| From: | John Naylor <johncnaylorls(at)gmail(dot)com> |
|---|---|
| To: | Nathan Bossart <nathandbossart(at)gmail(dot)com> |
| Cc: | PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: vectorized CRC on ARM64 |
| Date: | 2026-04-08 07:22:27 |
| Message-ID: | CANWCAZaTABWOvdwSHCWuqZs5DPCkKFFcEO5FAVxmhoZ+nnpjhg@mail.gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Tue, Apr 7, 2026 at 8:55 PM Nathan Bossart <nathandbossart(at)gmail(dot)com> wrote:
>
> On Tue, Apr 07, 2026 at 05:02:04PM +0700, John Naylor wrote:
> > Attached is how that would look. The idea is that small inputs will
> > encounter fewer branches. It'd be tricky to prove a difference with a
> > benchmark, and I see this as just making the small-input path more
> > similar to PG 18, as a risk-avoidance maneuver.
>
> Seems fine to me. I believe we do similar things elsewhere.
Pushed, thanks for looking!
--
John Naylor
Amazon Web Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Alexander Korotkov | 2026-04-08 07:31:07 | Re: Implement waiting for wal lsn replay: reloaded |
| Previous Message | John Naylor | 2026-04-08 07:17:22 | Re: tuple radix sort |