From 921dd02c65981b8e08db390a94b827769e8385b0 Mon Sep 17 00:00:00 2001 From: Amit Langote Date: Fri, 22 Mar 2024 14:07:48 +0900 Subject: [PATCH v1 1/2] Reduce memory used by child SpecialJoinInfo The SpecialJoinInfo applicable to a child join is computed by translating the same applicable to the parent join in try_partitionwise_join(). The child SpecialJoinInfo is not needed once the child join RelOptInfo is created and paths are added to it. Use a local variable to hold child SpecialJoinInfo so that it doesn't need memory allocated separately. Also free the memory allocated to various Bitmapsets in SpecialJoinInfo. Those are not referenced anywhere. But we do not free the memory allocated to expression trees since those may be referenced in paths or other objects. Plain inner joins do not have SpecialJoinInfos associated with them. They are crafted on the fly for parent joins. Do the same for child joins as well. Author: Ashutosh Bapat Reviewed-by: Richard Guo Reviewed-by: Amit Langote Reviewed-by: Andrey Lepikhov Reviewed-by: Tomas Vondra Discussion: https://postgr.es/m/CAExHW5tHqEf3ASVqvFFcghYGPfpy7o3xnvhHwBGbJFMRH8KjNw@mail.gmail.com --- src/backend/optimizer/path/costsize.c | 37 +------ src/backend/optimizer/path/joinrels.c | 143 ++++++++++++++++++-------- src/include/nodes/pathnodes.h | 4 + src/include/optimizer/paths.h | 2 + 4 files changed, 111 insertions(+), 75 deletions(-) diff --git a/src/backend/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c index 3c14c605a0..1b76523e79 100644 --- a/src/backend/optimizer/path/costsize.c +++ b/src/backend/optimizer/path/costsize.c @@ -5050,23 +5050,7 @@ compute_semi_anti_join_factors(PlannerInfo *root, /* * Also get the normal inner-join selectivity of the join clauses. */ - norm_sjinfo.type = T_SpecialJoinInfo; - norm_sjinfo.min_lefthand = outerrel->relids; - norm_sjinfo.min_righthand = innerrel->relids; - norm_sjinfo.syn_lefthand = outerrel->relids; - norm_sjinfo.syn_righthand = innerrel->relids; - norm_sjinfo.jointype = JOIN_INNER; - norm_sjinfo.ojrelid = 0; - norm_sjinfo.commute_above_l = NULL; - norm_sjinfo.commute_above_r = NULL; - norm_sjinfo.commute_below_l = NULL; - norm_sjinfo.commute_below_r = NULL; - /* we don't bother trying to make the remaining fields valid */ - norm_sjinfo.lhs_strict = false; - norm_sjinfo.semi_can_btree = false; - norm_sjinfo.semi_can_hash = false; - norm_sjinfo.semi_operators = NIL; - norm_sjinfo.semi_rhs_exprs = NIL; + make_dummy_sjinfo(&norm_sjinfo, outerrel, innerrel); nselec = clauselist_selectivity(root, joinquals, @@ -5219,23 +5203,8 @@ approx_tuple_count(PlannerInfo *root, JoinPath *path, List *quals) /* * Make up a SpecialJoinInfo for JOIN_INNER semantics. */ - sjinfo.type = T_SpecialJoinInfo; - sjinfo.min_lefthand = path->outerjoinpath->parent->relids; - sjinfo.min_righthand = path->innerjoinpath->parent->relids; - sjinfo.syn_lefthand = path->outerjoinpath->parent->relids; - sjinfo.syn_righthand = path->innerjoinpath->parent->relids; - sjinfo.jointype = JOIN_INNER; - sjinfo.ojrelid = 0; - sjinfo.commute_above_l = NULL; - sjinfo.commute_above_r = NULL; - sjinfo.commute_below_l = NULL; - sjinfo.commute_below_r = NULL; - /* we don't bother trying to make the remaining fields valid */ - sjinfo.lhs_strict = false; - sjinfo.semi_can_btree = false; - sjinfo.semi_can_hash = false; - sjinfo.semi_operators = NIL; - sjinfo.semi_rhs_exprs = NIL; + make_dummy_sjinfo(&sjinfo, path->outerjoinpath->parent, + path->innerjoinpath->parent); /* Get the approximate selectivity */ foreach(l, quals) diff --git a/src/backend/optimizer/path/joinrels.c b/src/backend/optimizer/path/joinrels.c index 4750579b0a..465dcf7d5d 100644 --- a/src/backend/optimizer/path/joinrels.c +++ b/src/backend/optimizer/path/joinrels.c @@ -44,7 +44,9 @@ static void try_partitionwise_join(PlannerInfo *root, RelOptInfo *rel1, List *parent_restrictlist); static SpecialJoinInfo *build_child_join_sjinfo(PlannerInfo *root, SpecialJoinInfo *parent_sjinfo, - Relids left_relids, Relids right_relids); + RelOptInfo *left_child, + RelOptInfo *right_child); +static void free_child_sjinfo_members(SpecialJoinInfo **child_sjinfo); static void compute_partition_bounds(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, RelOptInfo *joinrel, SpecialJoinInfo *parent_sjinfo, @@ -653,6 +655,32 @@ join_is_legal(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, return true; } +/* + * make_dummy_sjinfo + * Populate the given SpecialJoinInfo for a plain inner join, between rel1 + * and rel2, which does not have a SpecialJoinInfo associated with it. + */ +void +make_dummy_sjinfo(SpecialJoinInfo *sjinfo, RelOptInfo *rel1, RelOptInfo *rel2) +{ + sjinfo->type = T_SpecialJoinInfo; + sjinfo->min_lefthand = rel1->relids; + sjinfo->min_righthand = rel2->relids; + sjinfo->syn_lefthand = rel1->relids; + sjinfo->syn_righthand = rel2->relids; + sjinfo->jointype = JOIN_INNER; + sjinfo->ojrelid = 0; + sjinfo->commute_above_l = NULL; + sjinfo->commute_above_r = NULL; + sjinfo->commute_below_l = NULL; + sjinfo->commute_below_r = NULL; + /* we don't bother trying to make the remaining fields valid */ + sjinfo->lhs_strict = false; + sjinfo->semi_can_btree = false; + sjinfo->semi_can_hash = false; + sjinfo->semi_operators = NIL; + sjinfo->semi_rhs_exprs = NIL; +} /* * make_join_rel @@ -716,23 +744,7 @@ make_join_rel(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2) if (sjinfo == NULL) { sjinfo = &sjinfo_data; - sjinfo->type = T_SpecialJoinInfo; - sjinfo->min_lefthand = rel1->relids; - sjinfo->min_righthand = rel2->relids; - sjinfo->syn_lefthand = rel1->relids; - sjinfo->syn_righthand = rel2->relids; - sjinfo->jointype = JOIN_INNER; - sjinfo->ojrelid = 0; - sjinfo->commute_above_l = NULL; - sjinfo->commute_above_r = NULL; - sjinfo->commute_below_l = NULL; - sjinfo->commute_below_r = NULL; - /* we don't bother trying to make the remaining fields valid */ - sjinfo->lhs_strict = false; - sjinfo->semi_can_btree = false; - sjinfo->semi_can_hash = false; - sjinfo->semi_operators = NIL; - sjinfo->semi_rhs_exprs = NIL; + make_dummy_sjinfo(sjinfo, rel1, rel2); } /* @@ -1616,9 +1628,8 @@ try_partitionwise_join(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, * Construct SpecialJoinInfo from parent join relations's * SpecialJoinInfo. */ - child_sjinfo = build_child_join_sjinfo(root, parent_sjinfo, - child_rel1->relids, - child_rel2->relids); + child_sjinfo = build_child_join_sjinfo(root, parent_sjinfo, child_rel1, + child_rel2); /* Find the AppendRelInfo structures */ appinfos = find_appinfos_by_relids(root, @@ -1659,6 +1670,7 @@ try_partitionwise_join(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, child_restrictlist); pfree(appinfos); + free_child_sjinfo_members(&child_sjinfo); } } @@ -1666,43 +1678,92 @@ try_partitionwise_join(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, * Construct the SpecialJoinInfo for a child-join by translating * SpecialJoinInfo for the join between parents. left_relids and right_relids * are the relids of left and right side of the join respectively. + * + * If translations are added to or removed from this function, consider freeing + * the translated objects in free_child_sjinfo_members() appropriately. */ static SpecialJoinInfo * build_child_join_sjinfo(PlannerInfo *root, SpecialJoinInfo *parent_sjinfo, - Relids left_relids, Relids right_relids) + RelOptInfo *left_child, RelOptInfo *right_child) { - SpecialJoinInfo *sjinfo = makeNode(SpecialJoinInfo); AppendRelInfo **left_appinfos; int left_nappinfos; AppendRelInfo **right_appinfos; int right_nappinfos; + SpecialJoinInfo *child_sjinfo = makeNode(SpecialJoinInfo); - memcpy(sjinfo, parent_sjinfo, sizeof(SpecialJoinInfo)); - left_appinfos = find_appinfos_by_relids(root, left_relids, + /* Dummy SpecialJoinInfos can be created without any translation. */ + if (parent_sjinfo->jointype == JOIN_INNER) + { + Assert(parent_sjinfo->ojrelid == 0); + make_dummy_sjinfo(child_sjinfo, left_child, right_child); + return child_sjinfo; + } + + memcpy(child_sjinfo, parent_sjinfo, sizeof(SpecialJoinInfo)); + left_appinfos = find_appinfos_by_relids(root, left_child->relids, &left_nappinfos); - right_appinfos = find_appinfos_by_relids(root, right_relids, + right_appinfos = find_appinfos_by_relids(root, right_child->relids, &right_nappinfos); - sjinfo->min_lefthand = adjust_child_relids(sjinfo->min_lefthand, - left_nappinfos, left_appinfos); - sjinfo->min_righthand = adjust_child_relids(sjinfo->min_righthand, - right_nappinfos, - right_appinfos); - sjinfo->syn_lefthand = adjust_child_relids(sjinfo->syn_lefthand, - left_nappinfos, left_appinfos); - sjinfo->syn_righthand = adjust_child_relids(sjinfo->syn_righthand, - right_nappinfos, - right_appinfos); + child_sjinfo->min_lefthand = + adjust_child_relids(child_sjinfo->min_lefthand, + left_nappinfos, + left_appinfos); + child_sjinfo->min_righthand = + adjust_child_relids(child_sjinfo->min_righthand, + right_nappinfos, + right_appinfos); + child_sjinfo->syn_lefthand = adjust_child_relids(child_sjinfo->syn_lefthand, + left_nappinfos, + left_appinfos); + child_sjinfo->syn_righthand = adjust_child_relids(child_sjinfo->syn_righthand, + right_nappinfos, + right_appinfos); + /* outer-join relids need no adjustment */ - sjinfo->semi_rhs_exprs = (List *) adjust_appendrel_attrs(root, - (Node *) sjinfo->semi_rhs_exprs, - right_nappinfos, - right_appinfos); + child_sjinfo->semi_rhs_exprs = + (List *) adjust_appendrel_attrs(root, + (Node *) child_sjinfo->semi_rhs_exprs, + right_nappinfos, right_appinfos); pfree(left_appinfos); pfree(right_appinfos); - return sjinfo; + return child_sjinfo; +} + +/* + * free_child_sjinfo_members + * Free memory consumed by a child SpecialJoinInfo. + * + * Only members that are translated copies of their counterpart in the parent + * SpecialJoinInfo are freed here. However, members that could be referenced + * elsewhere are not freed. + */ +static void +free_child_sjinfo_members(SpecialJoinInfo **child_sjinfo_p) +{ + SpecialJoinInfo *child_sjinfo = *child_sjinfo_p; + + /* + * Dummy SpecialJoinInfos do not have any translated fields and hence have + * nothing to free. + */ + if (child_sjinfo->jointype != JOIN_INNER) + { + bms_free(child_sjinfo->min_lefthand); + bms_free(child_sjinfo->min_righthand); + bms_free(child_sjinfo->syn_lefthand); + bms_free(child_sjinfo->syn_righthand); + + /* semi_rhs_exprs may be referenced, so don't free. */ + } + + /* Avoid dangling pointer. */ + *child_sjinfo_p = NULL; + + pfree(child_sjinfo); } /* diff --git a/src/include/nodes/pathnodes.h b/src/include/nodes/pathnodes.h index 534692bee1..7192ae5171 100644 --- a/src/include/nodes/pathnodes.h +++ b/src/include/nodes/pathnodes.h @@ -2854,6 +2854,10 @@ typedef struct PlaceHolderVar * cost estimation purposes it is sometimes useful to know the join size under * plain innerjoin semantics. Note that lhs_strict and the semi_xxx fields * are not set meaningfully within such structs. + * + * We also create transient SpecialJoinInfos for child joins by translating + * corresponding parent SpecialJoinInfos. These are also not part of + * PlannerInfo's join_info_list. */ #ifndef HAVE_SPECIALJOININFO_TYPEDEF typedef struct SpecialJoinInfo SpecialJoinInfo; diff --git a/src/include/optimizer/paths.h b/src/include/optimizer/paths.h index b137c8a589..1e340a6335 100644 --- a/src/include/optimizer/paths.h +++ b/src/include/optimizer/paths.h @@ -112,6 +112,8 @@ extern bool have_join_order_restriction(PlannerInfo *root, extern bool have_dangerous_phv(PlannerInfo *root, Relids outer_relids, Relids inner_params); extern void mark_dummy_rel(RelOptInfo *rel); +extern void make_dummy_sjinfo(SpecialJoinInfo *sjinfo, RelOptInfo *rel1, + RelOptInfo *rel2); /* * equivclass.c -- 2.43.0