summaryrefslogtreecommitdiff
path: root/src/backend/utils/adt/selfuncs.c
diff options
context:
space:
mode:
authorDavid Rowley <drowley@postgresql.org>2023-11-28 10:41:12 +1300
committerDavid Rowley <drowley@postgresql.org>2023-11-28 10:41:12 +1300
commit930d2b442ff12e6d466a8c62cecdf3f17680aa3e (patch)
tree113e988c1913042e50e15457fcce82fe488f52b5 /src/backend/utils/adt/selfuncs.c
parent75680c3d805e2323cd437ac567f0677fdfc7b680 (diff)
Don't use bms_membership() in cases where we don't need to
00b41463c adjusted Bitmapset so that an empty set is always represented as NULL. This makes checking for empty sets far cheaper than it used to be. There were various places in the code where we'd call bms_membership() to handle the 3 possible BMS_Membership values. For the BMS_SINGLETON case, we'd also call bms_singleton_member() to find the single set member. This can now be done in a more optimal way by first checking if the set is NULL and then not bothering with bms_membership() and simply call bms_get_singleton_member() instead to find the single member. This function will return false if there are multiple members in the set. Here we also tidy up some logic in examine_variable() for the single member case. There's now no need to call bms_is_member() as we've already established that we're working with a singleton Bitmapset, so we can just check if varRelid matches the singleton member. Reviewed-by: Richard Guo Discussion: https://postgr.es/m/CAApHDvqW+CxNPcY245GaWiuqkkqgTudtG2ncGvvSjGn2wdTZLA@mail.gmail.com
Diffstat (limited to 'src/backend/utils/adt/selfuncs.c')
-rw-r--r--src/backend/utils/adt/selfuncs.c42
1 files changed, 22 insertions, 20 deletions
diff --git a/src/backend/utils/adt/selfuncs.c b/src/backend/utils/adt/selfuncs.c
index 35c9e3c86fe..e11d022827a 100644
--- a/src/backend/utils/adt/selfuncs.c
+++ b/src/backend/utils/adt/selfuncs.c
@@ -5028,22 +5028,27 @@ examine_variable(PlannerInfo *root, Node *node, int varRelid,
onerel = NULL;
- switch (bms_membership(varnos))
+ if (bms_is_empty(varnos))
{
- case BMS_EMPTY_SET:
- /* No Vars at all ... must be pseudo-constant clause */
- break;
- case BMS_SINGLETON:
- if (varRelid == 0 || bms_is_member(varRelid, varnos))
+ /* No Vars at all ... must be pseudo-constant clause */
+ }
+ else
+ {
+ int relid;
+
+ if (bms_get_singleton_member(varnos, &relid))
+ {
+ if (varRelid == 0 || varRelid == relid)
{
- onerel = find_base_rel(root,
- (varRelid ? varRelid : bms_singleton_member(varnos)));
+ onerel = find_base_rel(root, relid);
vardata->rel = onerel;
node = basenode; /* strip any relabeling */
}
/* else treat it as a constant */
- break;
- case BMS_MULTIPLE:
+ }
+ else
+ {
+ /* varnos has multiple relids */
if (varRelid == 0)
{
/* treat it as a variable of a join relation */
@@ -5058,7 +5063,7 @@ examine_variable(PlannerInfo *root, Node *node, int varRelid,
/* note: no point in expressional-index search here */
}
/* else treat it as a constant */
- break;
+ }
}
bms_free(varnos);
@@ -6381,17 +6386,14 @@ find_join_input_rel(PlannerInfo *root, Relids relids)
{
RelOptInfo *rel = NULL;
- switch (bms_membership(relids))
+ if (!bms_is_empty(relids))
{
- case BMS_EMPTY_SET:
- /* should not happen */
- break;
- case BMS_SINGLETON:
- rel = find_base_rel(root, bms_singleton_member(relids));
- break;
- case BMS_MULTIPLE:
+ int relid;
+
+ if (bms_get_singleton_member(relids, &relid))
+ rel = find_base_rel(root, relid);
+ else
rel = find_join_rel(root, relids);
- break;
}
if (rel == NULL)