Re: POC: converting Lists into arrays
Andres Freund <andres@anarazel.de>
Hi, On 2019-02-25 13:59:36 -0500, Tom Lane wrote: > Robert Haas <robertmhaas@gmail.com> writes: > > On Mon, Feb 25, 2019 at 1:17 PM Tom Lane <tgl@sss.pgh.pa.us> wrote: > >> I'm not following your point here. If we change key data structures > >> (i.e. parsetrees, plan trees, execution trees) to use some other list-ish > >> API, that *in itself* breaks everything that accesses those data > >> structures. The approach I propose here isn't zero-breakage, but it > >> requires far fewer places to be touched than a complete API replacement > >> would do. > > > Sure, but if you have third-party code that touches those things, > > it'll fail to compile. With your proposed approach, there seems to be > > a risk that it will compile but not work. > > Failing to compile isn't really a benefit IMO. It's a huge benefit. It's a lot of effort to look through all source code for potential breakages. Especially if all list usages, rather than some planner detail that comparatively few extensions touch, needs to be audited. > >> I completely disagree. Your proposal is probably an order of magnitude > >> more painful than the approach I suggest here, while not really offering > >> any additional performance benefit (or if you think there would be some, > >> you haven't explained how). Strictly on cost/benefit grounds, it isn't > >> ever going to happen that way. > > > Why would it be ten times more painful, exactly? > > Because it involves touching ten times more code (and that's a very > conservative estimate). Excluding changes in pg_list.h + list.c, > what I posted touches approximately 600 lines of code (520 insertions, > 644 deletions to be exact). For comparison's sake, there are about > 1800 uses of foreach in the tree, each of which would require at least > 3 changes to replace (the foreach itself, the ListCell variable > declaration, and at least one lfirst() reference in the loop body). > So we've already blown past 5000 lines worth of changes if we want to > do it another way ... and that's just *one* component of the List API. > Nor is there any reason to think the changes would be any more mechanical > than what I had to do here. (No fair saying that I already found the > trouble spots, either. A different implementation would likely break > assumptions in different ways.) FWIW, rewrites of this kind can be quite nicely automated using coccinelle [1]. One sometimes needs to do a bit of mop-up with variable names, but otherwise it should be mostly complete. Greetings, Andres Freund [1] http://coccinelle.lip6.fr/
Commits
-
Remove EState.es_range_table_array.
- 3c926587b592 13.0 landed
-
Rationalize use of list_concat + list_copy combinations.
- 5ee190f8ec37 13.0 landed
-
Cosmetic improvements in setup of planner's per-RTE arrays.
- 1661a4050593 13.0 landed
-
Make better use of the new List implementation in a couple of places
- efdcca55a3df 13.0 landed
-
Fix sepgsql test results for commit d97b714a2.
- 82c8a3c52adf 13.0 landed
-
Avoid using lcons and list_delete_first where it's easy to do so.
- d97b714a2199 13.0 landed
-
Remove lappend_cell...() family of List functions.
- c245776906b0 13.0 landed
-
Clean up some ad-hoc code for sorting and de-duplicating Lists.
- 2f5b8eb5a28b 13.0 landed
-
Redesign the API for list sorting (list_qsort becomes list_sort).
- 569ed7f48312 13.0 landed
-
Remove dead code.
- 4c3d05d875dd 13.0 landed
-
Represent Lists as expansible arrays, not chains of cons-cells.
- 1cff1b95ab6d 13.0 landed
-
Standardize some more loops that chase down parallel lists.
- c94fb8e8acc0 12.0 landed
-
Reimplement the linked list data structure used throughout the backend.
- d0b4399d81f3 8.0.0 cited