From 015659b59dc9720cd2796bb17097447655c48e16 Mon Sep 17 00:00:00 2001 From: Amit Langote Date: Mon, 24 Mar 2025 21:18:02 +0900 Subject: [PATCH v2 2/3] Make derived clause lookup in EquivalenceClass more efficient Previously, derived clauses were stored in ec_derives, a List of RestrictInfos. These clauses are looked up later using the left and right EquivalenceMembers and the clause's parent EC, typically during join clause generation. This lookup becomes expensive in queries with many partitions or joins, where ec_derives may contain thousands of entries. In particular, create_join_clause() can spend significant time scanning this list. To improve performance, a hash table (ec_derives_hash) is now built when ec_derives_list exceeds 32 entries, matching the threshold used for join_rel_hash. To reflect this dual structure, the ec_derives field is renamed to ec_derives_list. The list is retained alongside the hash table to support _outEquivalenceClass() and EquivalenceClass merging, which both operate on ec_derives_list. Lookup logic is updated to consult the hash table when available. For constant-containing ECs, lookups are done by the non-constant EM alone; the constant EM is assumed to be unique and may not be available at lookup time. In such cases, hash entries use em2 = NULL. An assertion originally placed in find_derived_clause_for_ec_member() is moved into ec_search_derived_clause_for_ems() to enforce the same invariant in both hash and list lookup paths. Author: Ashutosh Bapat Reviewed-by: Alvaro Herrera Reviewed-by: Amit Langote Tested-by: Dmitry Dolgov <9erthalion6@gmail.com> Tested-by: Alvaro Herrera Tested-by: Amit Langote Discussion: https://postgr.es/m/CAExHW5vZiQtWU6moszLP5iZ8gLX_ZAUbgEX0DxGLx9PGWCtqUg@mail.gmail.com --- src/backend/nodes/outfuncs.c | 7 +- src/backend/optimizer/path/costsize.c | 3 +- src/backend/optimizer/path/equivclass.c | 360 +++++++++++++++++----- src/backend/optimizer/plan/analyzejoins.c | 5 +- src/include/nodes/pathnodes.h | 17 +- src/include/optimizer/paths.h | 4 +- src/tools/pgindent/typedefs.list | 2 + 7 files changed, 319 insertions(+), 79 deletions(-) diff --git a/src/backend/nodes/outfuncs.c b/src/backend/nodes/outfuncs.c index bb9bdd67192..642ead7e629 100644 --- a/src/backend/nodes/outfuncs.c +++ b/src/backend/nodes/outfuncs.c @@ -467,7 +467,12 @@ _outEquivalenceClass(StringInfo str, const EquivalenceClass *node) WRITE_OID_FIELD(ec_collation); WRITE_NODE_FIELD(ec_members); WRITE_NODE_FIELD(ec_sources); - WRITE_NODE_FIELD(ec_derives); + WRITE_NODE_FIELD(ec_derives_list); + + /* + * ec_derives_list and ec_derives_hash contain the same set of + * RestrictInfos, hence no need to write contents of ec_derives_hash. + */ WRITE_BITMAPSET_FIELD(ec_relids); WRITE_BOOL_FIELD(ec_has_const); WRITE_BOOL_FIELD(ec_has_volatile); diff --git a/src/backend/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c index 256568d05a2..7d23a8385b6 100644 --- a/src/backend/optimizer/path/costsize.c +++ b/src/backend/optimizer/path/costsize.c @@ -5849,7 +5849,8 @@ get_foreign_key_join_selectivity(PlannerInfo *root, if (ec && ec->ec_has_const) { EquivalenceMember *em = fkinfo->fk_eclass_member[i]; - RestrictInfo *rinfo = find_derived_clause_for_ec_member(ec, + RestrictInfo *rinfo = find_derived_clause_for_ec_member(root, + ec, em); if (rinfo) diff --git a/src/backend/optimizer/path/equivclass.c b/src/backend/optimizer/path/equivclass.c index 493a95d26cc..0d21461dc7c 100644 --- a/src/backend/optimizer/path/equivclass.c +++ b/src/backend/optimizer/path/equivclass.c @@ -20,6 +20,7 @@ #include "access/stratnum.h" #include "catalog/pg_type.h" +#include "common/hashfn.h" #include "nodes/makefuncs.h" #include "nodes/nodeFuncs.h" #include "optimizer/appendinfo.h" @@ -72,7 +73,47 @@ static Bitmapset *get_eclass_indexes_for_relids(PlannerInfo *root, Relids relids); static Bitmapset *get_common_eclass_indexes(PlannerInfo *root, Relids relids1, Relids relids2); +static void add_derived_clauses(EquivalenceClass *ec, List *clauses); +static void add_derived_clause(EquivalenceClass *ec, RestrictInfo *clause); +static RestrictInfo *search_clause_for_ems(PlannerInfo *root, EquivalenceClass *ec, + EquivalenceMember *leftem, + EquivalenceMember *rightem, + EquivalenceClass *parent_ec); +static RestrictInfo *search_derived_clause_for_ems(PlannerInfo *root, + EquivalenceClass *ec, + EquivalenceMember *leftem, + EquivalenceMember *rightem, + EquivalenceClass *parent_ec); +static void add_clause_to_derives_hash(EquivalenceClass *ec, RestrictInfo *rinfo); +static void build_ec_derives_hash(PlannerInfo *root, EquivalenceClass *ec); + + +/* Hash key for derived clause lookup by EquivalenceMembers. */ +typedef struct +{ + EquivalenceMember *em1; + EquivalenceMember *em2; + EquivalenceClass *parent_ec; +} ECDerivesKey; +/* Hash table entry in ec_derives_hash. */ +typedef struct +{ + uint32 status; + ECDerivesKey key; + RestrictInfo *rinfo; +} ECDerivesEntry; + +#define SH_PREFIX derives +#define SH_ELEMENT_TYPE ECDerivesEntry +#define SH_KEY_TYPE ECDerivesKey +#define SH_KEY key +#define SH_HASH_KEY(tb, key) hash_bytes((const unsigned char *) &(key), sizeof(ECDerivesKey)) +#define SH_EQUAL(tb, a, b) ((a).em1 == (b).em1 && (a).em2 == (b).em2 && (a).parent_ec == (b).parent_ec) +#define SH_SCOPE static inline +#define SH_DECLARE +#define SH_DEFINE +#include "lib/simplehash.h" /* * process_equivalence @@ -342,7 +383,7 @@ process_equivalence(PlannerInfo *root, */ ec1->ec_members = list_concat(ec1->ec_members, ec2->ec_members); ec1->ec_sources = list_concat(ec1->ec_sources, ec2->ec_sources); - ec1->ec_derives = list_concat(ec1->ec_derives, ec2->ec_derives); + add_derived_clauses(ec1, ec2->ec_derives_list); ec1->ec_relids = bms_join(ec1->ec_relids, ec2->ec_relids); ec1->ec_has_const |= ec2->ec_has_const; /* can't need to set has_volatile */ @@ -355,7 +396,7 @@ process_equivalence(PlannerInfo *root, /* just to avoid debugging confusion w/ dangling pointers: */ ec2->ec_members = NIL; ec2->ec_sources = NIL; - ec2->ec_derives = NIL; + clear_ec_derived_clauses(ec2); ec2->ec_relids = NULL; ec1->ec_sources = lappend(ec1->ec_sources, restrictinfo); ec1->ec_min_security = Min(ec1->ec_min_security, @@ -412,7 +453,8 @@ process_equivalence(PlannerInfo *root, ec->ec_collation = collation; ec->ec_members = NIL; ec->ec_sources = list_make1(restrictinfo); - ec->ec_derives = NIL; + ec->ec_derives_list = NIL; + ec->ec_derives_hash = NULL; ec->ec_relids = NULL; ec->ec_has_const = false; ec->ec_has_volatile = false; @@ -671,7 +713,8 @@ get_eclass_for_sort_expr(PlannerInfo *root, newec->ec_collation = collation; newec->ec_members = NIL; newec->ec_sources = NIL; - newec->ec_derives = NIL; + newec->ec_derives_list = NIL; + newec->ec_derives_hash = NULL; newec->ec_relids = NULL; newec->ec_has_const = false; newec->ec_has_volatile = contain_volatile_functions((Node *) expr); @@ -1026,7 +1069,7 @@ relation_can_be_sorted_early(PlannerInfo *root, RelOptInfo *rel, * scanning of the quals and before Path construction begins. * * We make no attempt to avoid generating duplicate RestrictInfos here: we - * don't search ec_sources or ec_derives for matches. It doesn't really + * don't search source or derived clauses for matches. It doesn't really * seem worth the trouble to do so. */ void @@ -1188,11 +1231,11 @@ generate_base_implied_equalities_const(PlannerInfo *root, /* * If the clause didn't degenerate to a constant, fill in the correct - * markings for a mergejoinable clause, and save it in ec_derives. (We - * will not re-use such clauses directly, but selectivity estimation - * may consult the list later. Note that this use of ec_derives does - * not overlap with its use for join clauses, since we never generate - * join clauses from an ec_has_const eclass.) + * markings for a mergejoinable clause, and save it as a derived + * clause. (We will not re-use such clauses directly, but selectivity + * estimation may consult those later. Note that this use of derived + * clauses does not overlap with its use for join clauses, since we + * never generate join clauses from an ec_has_const eclass.) */ if (rinfo && rinfo->mergeopfamilies) { @@ -1200,7 +1243,7 @@ generate_base_implied_equalities_const(PlannerInfo *root, rinfo->left_ec = rinfo->right_ec = ec; rinfo->left_em = cur_em; rinfo->right_em = const_em; - ec->ec_derives = lappend(ec->ec_derives, rinfo); + add_derived_clause(ec, rinfo); } } } @@ -1265,10 +1308,10 @@ generate_base_implied_equalities_no_const(PlannerInfo *root, /* * If the clause didn't degenerate to a constant, fill in the - * correct markings for a mergejoinable clause. We don't put it - * in ec_derives however; we don't currently need to re-find such - * clauses, and we don't want to clutter that list with non-join - * clauses. + * correct markings for a mergejoinable clause. We don't save it + * as a derived clause however; we don't currently need to re-find + * such clauses, and we don't want to clutter that set with + * non-join clauses. */ if (rinfo && rinfo->mergeopfamilies) { @@ -1369,7 +1412,7 @@ generate_base_implied_equalities_broken(PlannerInfo *root, * we consider different join paths, we avoid generating multiple copies: * whenever we select a particular pair of EquivalenceMembers to join, * we check to see if the pair matches any original clause (in ec_sources) - * or previously-built clause (in ec_derives). This saves memory and allows + * or previously-built derived clause. This saves memory and allows * re-use of information cached in RestrictInfos. We also avoid generating * commutative duplicates, i.e. if the algorithm selects "a.x = b.y" but * we already have "b.y = a.x", we return the existing clause. @@ -1754,9 +1797,9 @@ generate_join_implied_equalities_broken(PlannerInfo *root, /* * If we have to translate, just brute-force apply adjust_appendrel_attrs * to all the RestrictInfos at once. This will result in returning - * RestrictInfos that are not listed in ec_derives, but there shouldn't be - * any duplication, and it's a sufficiently narrow corner case that we - * shouldn't sweat too much over it anyway. + * RestrictInfos that are not part of EC derived clauses , but there + * shouldn't be any duplication, and it's a sufficiently narrow corner + * case that we shouldn't sweat too much over it anyway. * * Since inner_rel might be an indirect descendant of the baserel * mentioned in the ec_sources clauses, we have to be prepared to apply @@ -1802,6 +1845,97 @@ select_equality_operator(EquivalenceClass *ec, Oid lefttype, Oid righttype) return InvalidOid; } +/* + * search_clause_for_ems + * Return an already built RestrictInfo for the given pair of + * EquivalenceMembers, if exists. + * + * We can use either original source clauses or previously-derived clauses, and + * a commutator clause is acceptable. + * + * We used to verify that opno matches, but that seems redundant: even if it's + * not identical, it'd better have the same effects, or the operator families + * we're using are broken. + * + * Returns NULL if the required RestrictInfo is not already built. + */ +static RestrictInfo * +search_clause_for_ems(PlannerInfo *root, EquivalenceClass *ec, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec) +{ + foreach_node(RestrictInfo, rinfo, ec->ec_sources) + { + if (rinfo->left_em == leftem && + rinfo->right_em == rightem && + rinfo->parent_ec == parent_ec) + return rinfo; + if (rinfo->left_em == rightem && + rinfo->right_em == leftem && + rinfo->parent_ec == parent_ec) + return rinfo; + } + + return search_derived_clause_for_ems(root, ec, leftem, rightem, parent_ec); +} + +/* + * search_derived_clause_for_ems + * Similar to search_clause_for_ems() but looks up derived clauses. + */ +static RestrictInfo * +search_derived_clause_for_ems(PlannerInfo *root, EquivalenceClass *ec, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec) +{ + /* + * Switch to using hash lookup when list grows "too long". The threshold + * is arbitrary and is known only here. + */ + if (!ec->ec_derives_hash && list_length(ec->ec_derives_list) >= 32) + build_ec_derives_hash(root, ec); + + /* Perform hash table lookup or linear search as appropriate. */ + if (ec->ec_derives_hash) + { + ECDerivesKey key; + RestrictInfo *rinfo; + ECDerivesEntry *entry; + + /* + * add_clause_to_derives_hash() explains why we don't perform a second + * search by swapping EquivalenceMembers. + */ + key.em1 = leftem; + key.em2 = rightem; + key.parent_ec = parent_ec; + entry = derives_lookup(ec->ec_derives_hash, key); + if (entry) + { + rinfo = entry->rinfo; + Assert(rinfo); + return rinfo; + } + } + else + { + foreach_node(RestrictInfo, rinfo, ec->ec_derives_list) + { + if (!rightem && + rinfo->left_em == leftem) + { + Assert(rinfo->right_em->em_is_const); + return rinfo; + } + if (rinfo->left_em == leftem && + rinfo->right_em == rightem && + rinfo->parent_ec == parent_ec) + return rinfo; + if (rinfo->left_em == rightem && + rinfo->right_em == leftem && + rinfo->parent_ec == parent_ec) + return rinfo; + } + } + + return NULL; +} /* * create_join_clause @@ -1823,43 +1957,11 @@ create_join_clause(PlannerInfo *root, { RestrictInfo *rinfo; RestrictInfo *parent_rinfo = NULL; - ListCell *lc; MemoryContext oldcontext; - /* - * Search to see if we already built a RestrictInfo for this pair of - * EquivalenceMembers. We can use either original source clauses or - * previously-derived clauses, and a commutator clause is acceptable. - * - * We used to verify that opno matches, but that seems redundant: even if - * it's not identical, it'd better have the same effects, or the operator - * families we're using are broken. - */ - foreach(lc, ec->ec_sources) - { - rinfo = (RestrictInfo *) lfirst(lc); - if (rinfo->left_em == leftem && - rinfo->right_em == rightem && - rinfo->parent_ec == parent_ec) - return rinfo; - if (rinfo->left_em == rightem && - rinfo->right_em == leftem && - rinfo->parent_ec == parent_ec) - return rinfo; - } - - foreach(lc, ec->ec_derives) - { - rinfo = (RestrictInfo *) lfirst(lc); - if (rinfo->left_em == leftem && - rinfo->right_em == rightem && - rinfo->parent_ec == parent_ec) - return rinfo; - if (rinfo->left_em == rightem && - rinfo->right_em == leftem && - rinfo->parent_ec == parent_ec) - return rinfo; - } + rinfo = search_clause_for_ems(root, ec, leftem, rightem, parent_ec); + if (rinfo) + return rinfo; /* * Not there, so build it, in planner context so we can re-use it. (Not @@ -1923,7 +2025,7 @@ create_join_clause(PlannerInfo *root, rinfo->left_em = leftem; rinfo->right_em = rightem; /* and save it for possible re-use */ - ec->ec_derives = lappend(ec->ec_derives, rinfo); + add_derived_clause(ec, rinfo); MemoryContextSwitchTo(oldcontext); @@ -2648,28 +2750,14 @@ match_eclasses_to_foreign_key_col(PlannerInfo *root, * Returns NULL if no such clause can be found. */ RestrictInfo * -find_derived_clause_for_ec_member(EquivalenceClass *ec, +find_derived_clause_for_ec_member(PlannerInfo *root, + EquivalenceClass *ec, EquivalenceMember *em) { - ListCell *lc; - Assert(ec->ec_has_const); Assert(!em->em_is_const); - foreach(lc, ec->ec_derives) - { - RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); - /* - * generate_base_implied_equalities_const will have put non-const - * members on the left side of derived clauses. - */ - if (rinfo->left_em == em) - { - Assert(rinfo->right_em->em_is_const); - return rinfo; - } - } - return NULL; + return search_derived_clause_for_ems(root, ec, em, NULL, NULL); } @@ -3442,3 +3530,131 @@ get_common_eclass_indexes(PlannerInfo *root, Relids relids1, Relids relids2) /* Calculate and return the common EC indexes, recycling the left input. */ return bms_int_members(rel1ecs, rel2ecs); } + +/* + * add_derived_clauses + * Add given clause to the set of clauses derived from the given EquivalenceClass; adding to the list and hash table if needed. + */ +static void +add_derived_clause(EquivalenceClass *ec, RestrictInfo *clause) +{ + ec->ec_derives_list = lappend(ec->ec_derives_list, clause); + if (ec->ec_derives_hash) + add_clause_to_derives_hash(ec, clause); +} + +/* + * add_derived_clauses + * Add a list of clauses to the set of clauses derived from the given EquivalenceClass; adding to the list and hash table if needed. + * + * This function is similar to above function but optimized for adding multiple + * clauses at a time to the ec_derives_list. + */ +static void +add_derived_clauses(EquivalenceClass *ec, List *clauses) +{ + ec->ec_derives_list = list_concat(ec->ec_derives_list, clauses); + if (ec->ec_derives_hash) + foreach_node(RestrictInfo, rinfo, clauses) + add_clause_to_derives_hash(ec, rinfo); +} + +/* + * build_ec_derives_hash + * Construct the auxiliary hash table for derived clauses. + */ +static void +build_ec_derives_hash(PlannerInfo *root, EquivalenceClass *ec) +{ + Assert(!ec->ec_derives_hash); + + /* Create the hash table */ + ec->ec_derives_hash = derives_create(root->planner_cxt, 256L, NULL); + + foreach_node(RestrictInfo, rinfo, ec->ec_derives_list) + add_clause_to_derives_hash(ec, rinfo); +} + +/* + * add_clause_to_derives_hash + * Add the given clause to the hash table of derived clauses in the given EquivalenceClass. + */ +static void +add_clause_to_derives_hash(EquivalenceClass *ec, RestrictInfo *rinfo) +{ + ECDerivesKey key; + ECDerivesEntry *entry; + bool found; + + /* + * Per generate_base_implied_equalities_const(), a constant always appears + * on the RHS of equality. + */ + Assert(!rinfo->left_em->em_is_const); + + if (rinfo->right_em->em_is_const) + { + /* + * generate_base_implied_equalities_const() doesn't set parent_ec + * since clauses involving constants are not redundant. + */ + Assert(!rinfo->parent_ec); + + /* + * find_derived_clause_for_ec_member() looks up a clause involving a + * constant by the non-constant EquivalenceMember. The actual constant + * EquivalenceMember is irrelevant for such lookup and is not + * available when looking up. Further there is only one constant + * EquivalenceMember per EquivalenceClass. For ease of lookup, we set + * right_em to NULL in the key. + */ + key.em1 = rinfo->left_em; + key.em2 = NULL; + key.parent_ec = rinfo->parent_ec; + entry = derives_insert(ec->ec_derives_hash, key, &found); + Assert(!found); + entry->rinfo = rinfo; + } + else + { + key.em1 = rinfo->left_em; + key.em2 = rinfo->right_em; + key.parent_ec = rinfo->parent_ec; + entry = derives_insert(ec->ec_derives_hash, key, &found); + Assert(!found); + entry->rinfo = rinfo; + + /* + * Add another entry to match the clause even if left and right EMs + * have swapped. + */ + key.em1 = rinfo->right_em; + key.em2 = rinfo->left_em; + key.parent_ec = rinfo->parent_ec; + entry = derives_insert(ec->ec_derives_hash, key, &found); + Assert(!found); + entry->rinfo = rinfo; + } + +} + +/* + * ec_clear_derived_clauses + * Reset the ec_derives list and the hash table. + * + * We destroy the hash table since it consumes more space than the list. But we + * don't bother to free the list. + * + * XXX: when there are thousands of partitions involved, the list can grow + * sizable and thus freeing it might be desirable. + */ +void +clear_ec_derived_clauses(EquivalenceClass *ec) +{ + ec->ec_derives_list = NIL; + if (ec->ec_derives_hash) + { + derives_destroy(ec->ec_derives_hash); + ec->ec_derives_hash = NULL; + } +} diff --git a/src/backend/optimizer/plan/analyzejoins.c b/src/backend/optimizer/plan/analyzejoins.c index 8a8d4a2af33..84489cdc4b4 100644 --- a/src/backend/optimizer/plan/analyzejoins.c +++ b/src/backend/optimizer/plan/analyzejoins.c @@ -749,7 +749,7 @@ remove_rel_from_eclass(EquivalenceClass *ec, SpecialJoinInfo *sjinfo, * drop them. (At this point, any such clauses would be base restriction * clauses, which we'd not need anymore anyway.) */ - ec->ec_derives = NIL; + clear_ec_derived_clauses(ec); } /* @@ -1544,8 +1544,7 @@ update_eclasses(EquivalenceClass *ec, int from, int to) list_free(ec->ec_members); ec->ec_members = new_members; - list_free(ec->ec_derives); - ec->ec_derives = NULL; + clear_ec_derived_clauses(ec); /* Update EC source expressions */ foreach_node(RestrictInfo, rinfo, ec->ec_sources) diff --git a/src/include/nodes/pathnodes.h b/src/include/nodes/pathnodes.h index c24a1fc8514..d4af0df010e 100644 --- a/src/include/nodes/pathnodes.h +++ b/src/include/nodes/pathnodes.h @@ -1422,7 +1422,22 @@ typedef struct EquivalenceClass Oid ec_collation; /* collation, if datatypes are collatable */ List *ec_members; /* list of EquivalenceMembers */ List *ec_sources; /* list of generating RestrictInfos */ - List *ec_derives; /* list of derived RestrictInfos */ + + /* + * ec_derives_list is a list of derived RestrictInfos. For small problems + * we just scan the list to lookup RestrictInfos with given + * EquivalenceMembers, but when there are many derived clauses, because of + * many partitions or many tables being joined or both, we build hash + * table for faster lookups. The hash table is present and valid when + * ec_derives_hash is not NULL. Note that we still maintain the list even + * when using the hash table for lookups; this simplifies life for + * _outEquivalenceClass() and when merging two EquivalenceClasses. + * + * Note that ec_sources contains the clauses, mentioned in the query, + * which are fewer. It does not need a hash table for lookups. + */ + List *ec_derives_list; + struct derives_hash *ec_derives_hash; Relids ec_relids; /* all relids appearing in ec_members, except * for child members (see below) */ bool ec_has_const; /* any pseudoconstants in ec_members? */ diff --git a/src/include/optimizer/paths.h b/src/include/optimizer/paths.h index bc5dfd7db41..f80fcf606d6 100644 --- a/src/include/optimizer/paths.h +++ b/src/include/optimizer/paths.h @@ -167,7 +167,8 @@ extern bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2, extern EquivalenceClass *match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno); -extern RestrictInfo *find_derived_clause_for_ec_member(EquivalenceClass *ec, +extern RestrictInfo *find_derived_clause_for_ec_member(PlannerInfo *root, + EquivalenceClass *ec, EquivalenceMember *em); extern void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, @@ -197,6 +198,7 @@ extern bool eclass_useful_for_merging(PlannerInfo *root, extern bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist); extern bool is_redundant_with_indexclauses(RestrictInfo *rinfo, List *indexclauses); +extern void clear_ec_derived_clauses(EquivalenceClass *ec); /* * pathkeys.c diff --git a/src/tools/pgindent/typedefs.list b/src/tools/pgindent/typedefs.list index bfa276d2d35..8115df0ab92 100644 --- a/src/tools/pgindent/typedefs.list +++ b/src/tools/pgindent/typedefs.list @@ -665,6 +665,8 @@ DumpableObjectWithAcl DynamicFileList DynamicZoneAbbrev EC_KEY +ECDerivesKey +ECDerivesEntry EDGE ENGINE EOM_flatten_into_method -- 2.43.0