pgsql: Tidy up code in get_cheapest_group_keys_order()

From: David Rowley <drowley(at)postgresql(dot)org>
To: pgsql-committers(at)lists(dot)postgresql(dot)org
Subject: pgsql: Tidy up code in get_cheapest_group_keys_order()
Date: 2022-07-13 02:03:45
Message-ID: E1oBRj6-002WPs-8S@gemulon.postgresql.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-committers

Tidy up code in get_cheapest_group_keys_order()

There are a few things that we could do a little better within
get_cheapest_group_keys_order():

1. We should be using list_free() rather than pfree() on a List.

2. We should use for_each_from() instead of manually coding a for loop to
skip the first n elements of a List

3. list_truncate(list_copy(...), n) is not a great way to copy the first n
elements of a list. Let's invent list_copy_head() for that. That way we
don't need to copy the entire list just to truncate it directly
afterwards.

4. We can simplify finding the cheapest cost by setting the cheapest cost
variable to DBL_MAX. That allows us to skip special-casing the initial
iteration of the loop.

Author: David Rowley
Discussion: https://postgr.es/m/CAApHDvrGyL3ft8waEkncG9y5HDMu5TFFJB1paoTC8zi9YK97Nw@mail.gmail.com
Backpatch-through: 15, where get_cheapest_group_keys_order was added.

Branch
------
REL_15_STABLE

Details
-------
https://git.postgresql.org/pg/commitdiff/44b5d5625389c2e001e0ffe3d435c35965862adc

Modified Files
--------------
src/backend/nodes/list.c | 21 +++++++++++++++++++++
src/backend/optimizer/path/pathkeys.c | 34 ++++++++++++++++++----------------
src/include/nodes/pg_list.h | 1 +
3 files changed, 40 insertions(+), 16 deletions(-)

Browse pgsql-committers by date

  From Date Subject
Next Message John Naylor 2022-07-13 02:23:10 Re: pgsql: Clarify that pg_dump takes ACCESS SHARE lock
Previous Message David Rowley 2022-07-13 02:03:15 pgsql: Tidy up code in get_cheapest_group_keys_order()