Re: Remove useless associativity/precedence from parsers

From: Bruce Momjian <bruce(at)momjian(dot)us>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: Akim Demaille <akim(at)lrde(dot)epita(dot)fr>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Remove useless associativity/precedence from parsers
Date: 2019-06-14 00:40:47
Message-ID: 20190614004047.rvp2a3aumbjo6u4d@momjian.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, May 21, 2019 at 03:06:43PM -0400, Tom Lane wrote:
> * Speed of the generated parser could be better. I suspect this has
> a lot to do with the fact that our grammar is huge, and so are the
> tables, and that causes lots of cache misses. Maybe this could be
> addressed by trying to make the tables smaller and/or laid out in
> a way with better cache locality?

Agreed. This was brought up in January, with a little more specificity:

https://www.postgresql.org/message-id/20190125223859.GD13803@momjian.us

With our scanner keywords list now more cache-aware, and with us
planning to use Bison for years to come, has anyone ever looked at
reordering the bison state machine array to be more cache aware, e.g.,
having common states next to each other rather than scattered around the
array?

--
Bruce Momjian <bruce(at)momjian(dot)us> http://momjian.us
EnterpriseDB http://enterprisedb.com

+ As you are, so once was I. As I am, so you will be. +
+ Ancient Roman grave inscription +

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Michael Paquier 2019-06-14 00:42:31 Re: Fix inconsistencies for v12 (pass 2)
Previous Message Tomas Vondra 2019-06-14 00:12:07 Re: [Proposal] Table-level Transparent Data Encryption (TDE) and Key Management Service (KMS)