| From: | John Naylor <johncnaylorls(at)gmail(dot)com> |
|---|---|
| To: | Bruce Momjian <bruce(at)momjian(dot)us> |
| Cc: | Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)org>, Andres Freund <andres(at)anarazel(dot)de>, "pgsql-hackers(at)lists(dot)postgresql(dot)org" <pgsql-hackers(at)lists(dot)postgresql(dot)org>, Nathan Bossart <nathandbossart(at)gmail(dot)com>, "Shankaran, Akash" <akash(dot)shankaran(at)intel(dot)com>, "Devulapalli, Raghuveer" <raghuveer(dot)devulapalli(at)intel(dot)com> |
| Subject: | Re: Proposal for Updating CRC32C with AVX-512 Algorithm. |
| Date: | 2024-12-12 11:32:20 |
| Message-ID: | CANWCAZZ1pX-Q_ayHvwjeNcuQoqsW=xHR4fxtiXeMscRdC7HS2g@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
+ * For This Function:
+ * Copyright 2015 The Chromium Authors
I went and looked at the Chromium source, and found the following
snippet that uses the same technique, but only requires 128-bit CLMUL
and has a minimum input size of 64 bytes, rather than 256. This seems
like it might be better suited for shorter inputs. Also seems much
easier than trying to get the AVX-512 hippo to dance. It uses the IEEE
polynomial, so would need new constants calculated for ours, but that
had to be done for the shared patch, too.
https://github.com/chromium/chromium/blob/main/third_party/zlib/crc32_simd.c#L215
--
John Naylor
Amazon Web Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Ilia Evdokimov | 2024-12-12 11:56:47 | Re: explain analyze rows=%.0f |
| Previous Message | Peter Eisentraut | 2024-12-12 11:07:39 | Re: Replace current implementations in crypt() and gen_salt() to OpenSSL |