Re: reducing the footprint of ScanKeyword (was Re: Large writable variables)
Andrew Gierth <andrew@tao11.riddles.org.uk>
From: Andrew Gierth <andrew@tao11.riddles.org.uk>
To: John Naylor <jcnaylor@gmail.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>, Andres Freund <andres@anarazel.de>,
pgsql-hackers@postgresql.org
Date: 2018-12-20T00:54:39Z
Lists: pgsql-hackers
>>>>> "John" == John Naylor <jcnaylor@gmail.com> writes: > On 12/18/18, Tom Lane <tgl@sss.pgh.pa.us> wrote: >> I'd be kind of inclined to convert all uses of ScanKeyword to the >> new way, if only for consistency's sake. On the other hand, I'm not >> the one volunteering to do the work. John> That's reasonable, as long as the design is nailed down first. John> Along those lines, attached is a heavily WIP patch that only John> touches plpgsql unreserved keywords, to test out the new John> methodology in a limited area. After settling APIs and John> name/directory bikeshedding, I'll move on to the other four John> keyword types. Is there any particular reason not to go further and use a perfect hash function for the lookup, rather than binary search? -- Andrew (irc:RhodiumToad)
Commits
-
Use perfect hashing, instead of binary search, for keyword lookup.
- c64d0cd5ce24 12.0 landed
-
Reduce the size of the fmgr_builtin_oid_index[] array.
- 8ff5f824dca7 12.0 landed
-
Replace the data structure used for keyword lookup.
- afb0d0712f1a 12.0 landed