PostgreSQL Source Code git master
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
clauses.h File Reference
#include "nodes/pathnodes.h"
Include dependency graph for clauses.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  WindowFuncLists
 

Functions

bool contain_agg_clause (Node *clause)
 
bool contain_window_function (Node *clause)
 
WindowFuncListsfind_window_functions (Node *clause, Index maxWinRef)
 
double expression_returns_set_rows (PlannerInfo *root, Node *clause)
 
bool contain_subplans (Node *clause)
 
char max_parallel_hazard (Query *parse)
 
bool is_parallel_safe (PlannerInfo *root, Node *node)
 
bool contain_nonstrict_functions (Node *clause)
 
bool contain_exec_param (Node *clause, List *param_ids)
 
bool contain_leaked_vars (Node *clause)
 
Relids find_nonnullable_rels (Node *clause)
 
Listfind_nonnullable_vars (Node *clause)
 
Listfind_forced_null_vars (Node *node)
 
Varfind_forced_null_var (Node *node)
 
bool is_pseudo_constant_clause (Node *clause)
 
bool is_pseudo_constant_clause_relids (Node *clause, Relids relids)
 
int NumRelids (PlannerInfo *root, Node *clause)
 
void CommuteOpExpr (OpExpr *clause)
 
Queryinline_set_returning_function (PlannerInfo *root, RangeTblEntry *rte)
 
Bitmapsetpull_paramids (Expr *expr)
 

Function Documentation

◆ CommuteOpExpr()

void CommuteOpExpr ( OpExpr clause)

Definition at line 2146 of file clauses.c.

2147{
2148 Oid opoid;
2149 Node *temp;
2150
2151 /* Sanity checks: caller is at fault if these fail */
2152 if (!is_opclause(clause) ||
2153 list_length(clause->args) != 2)
2154 elog(ERROR, "cannot commute non-binary-operator clause");
2155
2156 opoid = get_commutator(clause->opno);
2157
2158 if (!OidIsValid(opoid))
2159 elog(ERROR, "could not find commutator for operator %u",
2160 clause->opno);
2161
2162 /*
2163 * modify the clause in-place!
2164 */
2165 clause->opno = opoid;
2166 clause->opfuncid = InvalidOid;
2167 /* opresulttype, opretset, opcollid, inputcollid need not change */
2168
2169 temp = linitial(clause->args);
2170 linitial(clause->args) = lsecond(clause->args);
2171 lsecond(clause->args) = temp;
2172}
#define OidIsValid(objectId)
Definition: c.h:729
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:225
Oid get_commutator(Oid opno)
Definition: lsyscache.c:1509
static bool is_opclause(const void *clause)
Definition: nodeFuncs.h:76
static int list_length(const List *l)
Definition: pg_list.h:152
#define linitial(l)
Definition: pg_list.h:178
#define lsecond(l)
Definition: pg_list.h:183
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
Definition: nodes.h:129
Oid opno
Definition: primnodes.h:818
List * args
Definition: primnodes.h:836

References OpExpr::args, elog, ERROR, get_commutator(), InvalidOid, is_opclause(), linitial, list_length(), lsecond, OidIsValid, and OpExpr::opno.

Referenced by get_switched_clauses().

◆ contain_agg_clause()

bool contain_agg_clause ( Node clause)

Definition at line 177 of file clauses.c.

178{
179 return contain_agg_clause_walker(clause, NULL);
180}
static bool contain_agg_clause_walker(Node *node, void *context)
Definition: clauses.c:183

References contain_agg_clause_walker().

Referenced by get_eclass_for_sort_expr(), mark_nullable_by_grouping(), and subquery_planner().

◆ contain_exec_param()

bool contain_exec_param ( Node clause,
List param_ids 
)

Definition at line 1136 of file clauses.c.

1137{
1138 return contain_exec_param_walker(clause, param_ids);
1139}
static bool contain_exec_param_walker(Node *node, List *param_ids)
Definition: clauses.c:1142

References contain_exec_param_walker().

Referenced by test_opexpr_is_hashable().

◆ contain_leaked_vars()

bool contain_leaked_vars ( Node clause)

Definition at line 1262 of file clauses.c.

1263{
1264 return contain_leaked_vars_walker(clause, NULL);
1265}
static bool contain_leaked_vars_walker(Node *node, void *context)
Definition: clauses.c:1274

References contain_leaked_vars_walker().

Referenced by make_plain_restrictinfo(), and qual_is_pushdown_safe().

◆ contain_nonstrict_functions()

bool contain_nonstrict_functions ( Node clause)

Definition at line 992 of file clauses.c.

993{
994 return contain_nonstrict_functions_walker(clause, NULL);
995}
static bool contain_nonstrict_functions_walker(Node *node, void *context)
Definition: clauses.c:1004

References contain_nonstrict_functions_walker().

Referenced by inline_function(), and pullup_replace_vars_callback().

◆ contain_subplans()

bool contain_subplans ( Node clause)

◆ contain_window_function()

bool contain_window_function ( Node clause)

Definition at line 214 of file clauses.c.

215{
216 return contain_windowfuncs(clause);
217}
bool contain_windowfuncs(Node *node)
Definition: rewriteManip.c:214

References contain_windowfuncs().

Referenced by get_eclass_for_sort_expr(), and mark_nullable_by_grouping().

◆ expression_returns_set_rows()

double expression_returns_set_rows ( PlannerInfo root,
Node clause 
)

Definition at line 288 of file clauses.c.

289{
290 if (clause == NULL)
291 return 1.0;
292 if (IsA(clause, FuncExpr))
293 {
294 FuncExpr *expr = (FuncExpr *) clause;
295
296 if (expr->funcretset)
297 return clamp_row_est(get_function_rows(root, expr->funcid, clause));
298 }
299 if (IsA(clause, OpExpr))
300 {
301 OpExpr *expr = (OpExpr *) clause;
302
303 if (expr->opretset)
304 {
305 set_opfuncid(expr);
306 return clamp_row_est(get_function_rows(root, expr->opfuncid, clause));
307 }
308 }
309 return 1.0;
310}
double clamp_row_est(double nrows)
Definition: costsize.c:213
void set_opfuncid(OpExpr *opexpr)
Definition: nodeFuncs.c:1861
#define IsA(nodeptr, _type_)
Definition: nodes.h:158
double get_function_rows(PlannerInfo *root, Oid funcid, Node *node)
Definition: plancat.c:2159
tree ctl root
Definition: radixtree.h:1857
Oid funcid
Definition: primnodes.h:750

References clamp_row_est(), FuncExpr::funcid, get_function_rows(), IsA, root, and set_opfuncid().

Referenced by create_set_projection_path(), estimate_num_groups(), and set_function_size_estimates().

◆ find_forced_null_var()

Var * find_forced_null_var ( Node node)

Definition at line 1976 of file clauses.c.

1977{
1978 if (node == NULL)
1979 return NULL;
1980 if (IsA(node, NullTest))
1981 {
1982 /* check for var IS NULL */
1983 NullTest *expr = (NullTest *) node;
1984
1985 if (expr->nulltesttype == IS_NULL && !expr->argisrow)
1986 {
1987 Var *var = (Var *) expr->arg;
1988
1989 if (var && IsA(var, Var) &&
1990 var->varlevelsup == 0)
1991 return var;
1992 }
1993 }
1994 else if (IsA(node, BooleanTest))
1995 {
1996 /* var IS UNKNOWN is equivalent to var IS NULL */
1997 BooleanTest *expr = (BooleanTest *) node;
1998
1999 if (expr->booltesttype == IS_UNKNOWN)
2000 {
2001 Var *var = (Var *) expr->arg;
2002
2003 if (var && IsA(var, Var) &&
2004 var->varlevelsup == 0)
2005 return var;
2006 }
2007 }
2008 return NULL;
2009}
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:76
@ IS_UNKNOWN
Definition: primnodes.h:1976
@ IS_NULL
Definition: primnodes.h:1952
BoolTestType booltesttype
Definition: primnodes.h:1983
Expr * arg
Definition: primnodes.h:1982
NullTestType nulltesttype
Definition: primnodes.h:1959
Expr * arg
Definition: primnodes.h:1958
Definition: primnodes.h:248
Index varlevelsup
Definition: primnodes.h:280

References NullTest::arg, BooleanTest::arg, BooleanTest::booltesttype, if(), IS_NULL, IS_UNKNOWN, IsA, NullTest::nulltesttype, and Var::varlevelsup.

Referenced by check_redundant_nullability_qual(), and find_forced_null_vars().

◆ find_forced_null_vars()

List * find_forced_null_vars ( Node node)

Definition at line 1915 of file clauses.c.

1916{
1917 List *result = NIL;
1918 Var *var;
1919 ListCell *l;
1920
1921 if (node == NULL)
1922 return NIL;
1923 /* Check single-clause cases using subroutine */
1924 var = find_forced_null_var(node);
1925 if (var)
1926 {
1927 result = mbms_add_member(result,
1928 var->varno,
1930 }
1931 /* Otherwise, handle AND-conditions */
1932 else if (IsA(node, List))
1933 {
1934 /*
1935 * At top level, we are examining an implicit-AND list: if any of the
1936 * arms produces FALSE-or-NULL then the result is FALSE-or-NULL.
1937 */
1938 foreach(l, (List *) node)
1939 {
1940 result = mbms_add_members(result,
1942 }
1943 }
1944 else if (IsA(node, BoolExpr))
1945 {
1946 BoolExpr *expr = (BoolExpr *) node;
1947
1948 /*
1949 * We don't bother considering the OR case, because it's fairly
1950 * unlikely anyone would write "v1 IS NULL OR v1 IS NULL". Likewise,
1951 * the NOT case isn't worth expending code on.
1952 */
1953 if (expr->boolop == AND_EXPR)
1954 {
1955 /* At top level we can just recurse (to the List case) */
1956 result = find_forced_null_vars((Node *) expr->args);
1957 }
1958 }
1959 return result;
1960}
List * find_forced_null_vars(Node *node)
Definition: clauses.c:1915
Var * find_forced_null_var(Node *node)
Definition: clauses.c:1976
List * mbms_add_members(List *a, const List *b)
List * mbms_add_member(List *a, int listidx, int bitidx)
#define lfirst(lc)
Definition: pg_list.h:172
#define NIL
Definition: pg_list.h:68
@ AND_EXPR
Definition: primnodes.h:931
BoolExprType boolop
Definition: primnodes.h:939
List * args
Definition: primnodes.h:940
Definition: pg_list.h:54
AttrNumber varattno
Definition: primnodes.h:260
int varno
Definition: primnodes.h:255
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27

References AND_EXPR, BoolExpr::args, BoolExpr::boolop, find_forced_null_var(), find_forced_null_vars(), FirstLowInvalidHeapAttributeNumber, IsA, lfirst, mbms_add_member(), mbms_add_members(), NIL, Var::varattno, and Var::varno.

Referenced by find_forced_null_vars(), and reduce_outer_joins_pass2().

◆ find_nonnullable_rels()

Relids find_nonnullable_rels ( Node clause)

Definition at line 1455 of file clauses.c.

1456{
1457 return find_nonnullable_rels_walker(clause, true);
1458}
static Relids find_nonnullable_rels_walker(Node *node, bool top_level)
Definition: clauses.c:1461

References find_nonnullable_rels_walker().

Referenced by make_outerjoininfo(), and reduce_outer_joins_pass2().

◆ find_nonnullable_vars()

List * find_nonnullable_vars ( Node clause)

Definition at line 1706 of file clauses.c.

1707{
1708 return find_nonnullable_vars_walker(clause, true);
1709}
static List * find_nonnullable_vars_walker(Node *node, bool top_level)
Definition: clauses.c:1712

References find_nonnullable_vars_walker().

Referenced by reduce_outer_joins_pass2().

◆ find_window_functions()

WindowFuncLists * find_window_functions ( Node clause,
Index  maxWinRef 
)

Definition at line 227 of file clauses.c.

228{
229 WindowFuncLists *lists = palloc(sizeof(WindowFuncLists));
230
231 lists->numWindowFuncs = 0;
232 lists->maxWinRef = maxWinRef;
233 lists->windowFuncs = (List **) palloc0((maxWinRef + 1) * sizeof(List *));
234 (void) find_window_functions_walker(clause, lists);
235 return lists;
236}
static bool find_window_functions_walker(Node *node, WindowFuncLists *lists)
Definition: clauses.c:239
void * palloc0(Size size)
Definition: mcxt.c:1347
void * palloc(Size size)
Definition: mcxt.c:1317
List ** windowFuncs
Definition: clauses.h:23
Index maxWinRef
Definition: clauses.h:22
int numWindowFuncs
Definition: clauses.h:21

References find_window_functions_walker(), WindowFuncLists::maxWinRef, WindowFuncLists::numWindowFuncs, palloc(), palloc0(), and WindowFuncLists::windowFuncs.

Referenced by grouping_planner().

◆ inline_set_returning_function()

Query * inline_set_returning_function ( PlannerInfo root,
RangeTblEntry rte 
)

Definition at line 5063 of file clauses.c.

5064{
5065 RangeTblFunction *rtfunc;
5066 FuncExpr *fexpr;
5067 Oid func_oid;
5068 HeapTuple func_tuple;
5069 Form_pg_proc funcform;
5070 char *src;
5071 Datum tmp;
5072 bool isNull;
5073 MemoryContext oldcxt;
5074 MemoryContext mycxt;
5075 inline_error_callback_arg callback_arg;
5076 ErrorContextCallback sqlerrcontext;
5078 TypeFuncClass functypclass;
5079 TupleDesc rettupdesc;
5080 List *raw_parsetree_list;
5081 List *querytree_list;
5083
5084 Assert(rte->rtekind == RTE_FUNCTION);
5085
5086 /*
5087 * It doesn't make a lot of sense for a SQL SRF to refer to itself in its
5088 * own FROM clause, since that must cause infinite recursion at runtime.
5089 * It will cause this code to recurse too, so check for stack overflow.
5090 * (There's no need to do more.)
5091 */
5093
5094 /* Fail if the RTE has ORDINALITY - we don't implement that here. */
5095 if (rte->funcordinality)
5096 return NULL;
5097
5098 /* Fail if RTE isn't a single, simple FuncExpr */
5099 if (list_length(rte->functions) != 1)
5100 return NULL;
5101 rtfunc = (RangeTblFunction *) linitial(rte->functions);
5102
5103 if (!IsA(rtfunc->funcexpr, FuncExpr))
5104 return NULL;
5105 fexpr = (FuncExpr *) rtfunc->funcexpr;
5106
5107 func_oid = fexpr->funcid;
5108
5109 /*
5110 * The function must be declared to return a set, else inlining would
5111 * change the results if the contained SELECT didn't return exactly one
5112 * row.
5113 */
5114 if (!fexpr->funcretset)
5115 return NULL;
5116
5117 /*
5118 * Refuse to inline if the arguments contain any volatile functions or
5119 * sub-selects. Volatile functions are rejected because inlining may
5120 * result in the arguments being evaluated multiple times, risking a
5121 * change in behavior. Sub-selects are rejected partly for implementation
5122 * reasons (pushing them down another level might change their behavior)
5123 * and partly because they're likely to be expensive and so multiple
5124 * evaluation would be bad.
5125 */
5126 if (contain_volatile_functions((Node *) fexpr->args) ||
5127 contain_subplans((Node *) fexpr->args))
5128 return NULL;
5129
5130 /* Check permission to call function (fail later, if not) */
5131 if (object_aclcheck(ProcedureRelationId, func_oid, GetUserId(), ACL_EXECUTE) != ACLCHECK_OK)
5132 return NULL;
5133
5134 /* Check whether a plugin wants to hook function entry/exit */
5135 if (FmgrHookIsNeeded(func_oid))
5136 return NULL;
5137
5138 /*
5139 * OK, let's take a look at the function's pg_proc entry.
5140 */
5141 func_tuple = SearchSysCache1(PROCOID, ObjectIdGetDatum(func_oid));
5142 if (!HeapTupleIsValid(func_tuple))
5143 elog(ERROR, "cache lookup failed for function %u", func_oid);
5144 funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
5145
5146 /*
5147 * Forget it if the function is not SQL-language or has other showstopper
5148 * properties. In particular it mustn't be declared STRICT, since we
5149 * couldn't enforce that. It also mustn't be VOLATILE, because that is
5150 * supposed to cause it to be executed with its own snapshot, rather than
5151 * sharing the snapshot of the calling query. We also disallow returning
5152 * SETOF VOID, because inlining would result in exposing the actual result
5153 * of the function's last SELECT, which should not happen in that case.
5154 * (Rechecking prokind, proretset, and pronargs is just paranoia.)
5155 */
5156 if (funcform->prolang != SQLlanguageId ||
5157 funcform->prokind != PROKIND_FUNCTION ||
5158 funcform->proisstrict ||
5159 funcform->provolatile == PROVOLATILE_VOLATILE ||
5160 funcform->prorettype == VOIDOID ||
5161 funcform->prosecdef ||
5162 !funcform->proretset ||
5163 list_length(fexpr->args) != funcform->pronargs ||
5164 !heap_attisnull(func_tuple, Anum_pg_proc_proconfig, NULL))
5165 {
5166 ReleaseSysCache(func_tuple);
5167 return NULL;
5168 }
5169
5170 /*
5171 * Make a temporary memory context, so that we don't leak all the stuff
5172 * that parsing might create.
5173 */
5175 "inline_set_returning_function",
5177 oldcxt = MemoryContextSwitchTo(mycxt);
5178
5179 /* Fetch the function body */
5180 tmp = SysCacheGetAttrNotNull(PROCOID, func_tuple, Anum_pg_proc_prosrc);
5181 src = TextDatumGetCString(tmp);
5182
5183 /*
5184 * Setup error traceback support for ereport(). This is so that we can
5185 * finger the function that bad information came from.
5186 */
5187 callback_arg.proname = NameStr(funcform->proname);
5188 callback_arg.prosrc = src;
5189
5190 sqlerrcontext.callback = sql_inline_error_callback;
5191 sqlerrcontext.arg = &callback_arg;
5192 sqlerrcontext.previous = error_context_stack;
5193 error_context_stack = &sqlerrcontext;
5194
5195 /* If we have prosqlbody, pay attention to that not prosrc */
5196 tmp = SysCacheGetAttr(PROCOID,
5197 func_tuple,
5198 Anum_pg_proc_prosqlbody,
5199 &isNull);
5200 if (!isNull)
5201 {
5202 Node *n;
5203
5205 if (IsA(n, List))
5206 querytree_list = linitial_node(List, castNode(List, n));
5207 else
5208 querytree_list = list_make1(n);
5209 if (list_length(querytree_list) != 1)
5210 goto fail;
5211 querytree = linitial(querytree_list);
5212
5213 /* Acquire necessary locks, then apply rewriter. */
5214 AcquireRewriteLocks(querytree, true, false);
5215 querytree_list = pg_rewrite_query(querytree);
5216 if (list_length(querytree_list) != 1)
5217 goto fail;
5218 querytree = linitial(querytree_list);
5219 }
5220 else
5221 {
5222 /*
5223 * Set up to handle parameters while parsing the function body. We
5224 * can use the FuncExpr just created as the input for
5225 * prepare_sql_fn_parse_info.
5226 */
5227 pinfo = prepare_sql_fn_parse_info(func_tuple,
5228 (Node *) fexpr,
5229 fexpr->inputcollid);
5230
5231 /*
5232 * Parse, analyze, and rewrite (unlike inline_function(), we can't
5233 * skip rewriting here). We can fail as soon as we find more than one
5234 * query, though.
5235 */
5236 raw_parsetree_list = pg_parse_query(src);
5237 if (list_length(raw_parsetree_list) != 1)
5238 goto fail;
5239
5240 querytree_list = pg_analyze_and_rewrite_withcb(linitial(raw_parsetree_list),
5241 src,
5243 pinfo, NULL);
5244 if (list_length(querytree_list) != 1)
5245 goto fail;
5246 querytree = linitial(querytree_list);
5247 }
5248
5249 /*
5250 * Also resolve the actual function result tupdesc, if composite. If we
5251 * have a coldeflist, believe that; otherwise use get_expr_result_type.
5252 * (This logic should match ExecInitFunctionScan.)
5253 */
5254 if (rtfunc->funccolnames != NIL)
5255 {
5256 functypclass = TYPEFUNC_RECORD;
5257 rettupdesc = BuildDescFromLists(rtfunc->funccolnames,
5258 rtfunc->funccoltypes,
5259 rtfunc->funccoltypmods,
5260 rtfunc->funccolcollations);
5261 }
5262 else
5263 functypclass = get_expr_result_type((Node *) fexpr, NULL, &rettupdesc);
5264
5265 /*
5266 * The single command must be a plain SELECT.
5267 */
5268 if (!IsA(querytree, Query) ||
5269 querytree->commandType != CMD_SELECT)
5270 goto fail;
5271
5272 /*
5273 * Make sure the function (still) returns what it's declared to. This
5274 * will raise an error if wrong, but that's okay since the function would
5275 * fail at runtime anyway. Note that check_sql_fn_retval will also insert
5276 * coercions if needed to make the tlist expression(s) match the declared
5277 * type of the function. We also ask it to insert dummy NULL columns for
5278 * any dropped columns in rettupdesc, so that the elements of the modified
5279 * tlist match up to the attribute numbers.
5280 *
5281 * If the function returns a composite type, don't inline unless the check
5282 * shows it's returning a whole tuple result; otherwise what it's
5283 * returning is a single composite column which is not what we need.
5284 */
5285 if (!check_sql_fn_retval(list_make1(querytree_list),
5286 fexpr->funcresulttype, rettupdesc,
5287 funcform->prokind,
5288 true, NULL) &&
5289 (functypclass == TYPEFUNC_COMPOSITE ||
5290 functypclass == TYPEFUNC_COMPOSITE_DOMAIN ||
5291 functypclass == TYPEFUNC_RECORD))
5292 goto fail; /* reject not-whole-tuple-result cases */
5293
5294 /*
5295 * check_sql_fn_retval might've inserted a projection step, but that's
5296 * fine; just make sure we use the upper Query.
5297 */
5298 querytree = linitial_node(Query, querytree_list);
5299
5300 /*
5301 * Looks good --- substitute parameters into the query.
5302 */
5304 funcform->pronargs,
5305 fexpr->args);
5306
5307 /*
5308 * Copy the modified query out of the temporary memory context, and clean
5309 * up.
5310 */
5311 MemoryContextSwitchTo(oldcxt);
5312
5314
5315 MemoryContextDelete(mycxt);
5316 error_context_stack = sqlerrcontext.previous;
5317 ReleaseSysCache(func_tuple);
5318
5319 /*
5320 * We don't have to fix collations here because the upper query is already
5321 * parsed, ie, the collations in the RTE are what count.
5322 */
5323
5324 /*
5325 * Since there is now no trace of the function in the plan tree, we must
5326 * explicitly record the plan's dependency on the function.
5327 */
5329
5330 /*
5331 * We must also notice if the inserted query adds a dependency on the
5332 * calling role due to RLS quals.
5333 */
5334 if (querytree->hasRowSecurity)
5335 root->glob->dependsOnRole = true;
5336
5337 return querytree;
5338
5339 /* Here if func is not inlinable: release temp memory and return NULL */
5340fail:
5341 MemoryContextSwitchTo(oldcxt);
5342 MemoryContextDelete(mycxt);
5343 error_context_stack = sqlerrcontext.previous;
5344 ReleaseSysCache(func_tuple);
5345
5346 return NULL;
5347}
Datum querytree(PG_FUNCTION_ARGS)
Definition: _int_bool.c:665
@ ACLCHECK_OK
Definition: acl.h:183
AclResult object_aclcheck(Oid classid, Oid objectid, Oid roleid, AclMode mode)
Definition: aclchk.c:3810
#define TextDatumGetCString(d)
Definition: builtins.h:98
#define NameStr(name)
Definition: c.h:700
#define Assert(condition)
Definition: c.h:812
static Query * substitute_actual_srf_parameters(Query *expr, int nargs, List *args)
Definition: clauses.c:5356
static void sql_inline_error_callback(void *arg)
Definition: clauses.c:4947
bool contain_subplans(Node *clause)
Definition: clauses.c:329
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:537
ErrorContextCallback * error_context_stack
Definition: elog.c:94
#define FmgrHookIsNeeded(fn_oid)
Definition: fmgr.h:796
TypeFuncClass get_expr_result_type(Node *expr, Oid *resultTypeId, TupleDesc *resultTupleDesc)
Definition: funcapi.c:299
TypeFuncClass
Definition: funcapi.h:147
@ TYPEFUNC_COMPOSITE
Definition: funcapi.h:149
@ TYPEFUNC_RECORD
Definition: funcapi.h:151
@ TYPEFUNC_COMPOSITE_DOMAIN
Definition: funcapi.h:150
void sql_fn_parser_setup(struct ParseState *pstate, SQLFunctionParseInfoPtr pinfo)
Definition: functions.c:265
bool check_sql_fn_retval(List *queryTreeLists, Oid rettype, TupleDesc rettupdesc, char prokind, bool insertDroppedCols, List **resultTargetList)
Definition: functions.c:1609
SQLFunctionParseInfoPtr prepare_sql_fn_parse_info(HeapTuple procedureTuple, Node *call_expr, Oid inputCollation)
Definition: functions.c:176
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:456
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
MemoryContext CurrentMemoryContext
Definition: mcxt.c:143
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:454
#define AllocSetContextCreate
Definition: memutils.h:129
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:160
Oid GetUserId(void)
Definition: miscinit.c:517
#define copyObject(obj)
Definition: nodes.h:224
@ CMD_SELECT
Definition: nodes.h:265
#define castNode(_type_, nodeptr)
Definition: nodes.h:176
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:124
void(* ParserSetupHook)(struct ParseState *pstate, void *arg)
Definition: params.h:108
@ RTE_FUNCTION
Definition: parsenodes.h:1020
#define ACL_EXECUTE
Definition: parsenodes.h:83
#define linitial_node(type, l)
Definition: pg_list.h:181
#define list_make1(x1)
Definition: pg_list.h:212
FormData_pg_proc * Form_pg_proc
Definition: pg_proc.h:136
List * pg_analyze_and_rewrite_withcb(RawStmt *parsetree, const char *query_string, ParserSetupHook parserSetup, void *parserSetupArg, QueryEnvironment *queryEnv)
Definition: postgres.c:757
List * pg_parse_query(const char *query_string)
Definition: postgres.c:602
List * pg_rewrite_query(Query *query)
Definition: postgres.c:797
uintptr_t Datum
Definition: postgres.h:64
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
void * stringToNode(const char *str)
Definition: read.c:90
void AcquireRewriteLocks(Query *parsetree, bool forExecute, bool forUpdatePushedDown)
void record_plan_function_dependency(PlannerInfo *root, Oid funcid)
Definition: setrefs.c:3476
void check_stack_depth(void)
Definition: stack_depth.c:95
struct ErrorContextCallback * previous
Definition: elog.h:296
void(* callback)(void *arg)
Definition: elog.h:297
List * args
Definition: primnodes.h:768
bool funcordinality
Definition: parsenodes.h:1179
List * functions
Definition: parsenodes.h:1177
RTEKind rtekind
Definition: parsenodes.h:1047
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:269
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:221
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:600
Datum SysCacheGetAttrNotNull(int cacheId, HeapTuple tup, AttrNumber attributeNumber)
Definition: syscache.c:631
TupleDesc BuildDescFromLists(const List *names, const List *types, const List *typmods, const List *collations)
Definition: tupdesc.c:1006

References ACL_EXECUTE, ACLCHECK_OK, AcquireRewriteLocks(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, ErrorContextCallback::arg, FuncExpr::args, Assert, BuildDescFromLists(), ErrorContextCallback::callback, castNode, check_sql_fn_retval(), check_stack_depth(), CMD_SELECT, contain_subplans(), contain_volatile_functions(), copyObject, CurrentMemoryContext, elog, ERROR, error_context_stack, FmgrHookIsNeeded, RangeTblFunction::funcexpr, FuncExpr::funcid, RangeTblEntry::funcordinality, RangeTblEntry::functions, get_expr_result_type(), GETSTRUCT, GetUserId(), heap_attisnull(), HeapTupleIsValid, if(), IsA, linitial, linitial_node, list_length(), list_make1, MemoryContextDelete(), MemoryContextSwitchTo(), NameStr, NIL, object_aclcheck(), ObjectIdGetDatum(), pg_analyze_and_rewrite_withcb(), pg_parse_query(), pg_rewrite_query(), prepare_sql_fn_parse_info(), ErrorContextCallback::previous, inline_error_callback_arg::proname, inline_error_callback_arg::prosrc, querytree(), record_plan_function_dependency(), ReleaseSysCache(), root, RTE_FUNCTION, RangeTblEntry::rtekind, SearchSysCache1(), sql_fn_parser_setup(), sql_inline_error_callback(), stringToNode(), substitute_actual_srf_parameters(), SysCacheGetAttr(), SysCacheGetAttrNotNull(), TextDatumGetCString, TYPEFUNC_COMPOSITE, TYPEFUNC_COMPOSITE_DOMAIN, and TYPEFUNC_RECORD.

Referenced by preprocess_function_rtes().

◆ is_parallel_safe()

bool is_parallel_safe ( PlannerInfo root,
Node node 
)

Definition at line 752 of file clauses.c.

753{
755 PlannerInfo *proot;
756 ListCell *l;
757
758 /*
759 * Even if the original querytree contained nothing unsafe, we need to
760 * search the expression if we have generated any PARAM_EXEC Params while
761 * planning, because those are parallel-restricted and there might be one
762 * in this expression. But otherwise we don't need to look.
763 */
764 if (root->glob->maxParallelHazard == PROPARALLEL_SAFE &&
765 root->glob->paramExecTypes == NIL)
766 return true;
767 /* Else use max_parallel_hazard's search logic, but stop on RESTRICTED */
768 context.max_hazard = PROPARALLEL_SAFE;
769 context.max_interesting = PROPARALLEL_RESTRICTED;
770 context.safe_param_ids = NIL;
771
772 /*
773 * The params that refer to the same or parent query level are considered
774 * parallel-safe. The idea is that we compute such params at Gather or
775 * Gather Merge node and pass their value to workers.
776 */
777 for (proot = root; proot != NULL; proot = proot->parent_root)
778 {
779 foreach(l, proot->init_plans)
780 {
781 SubPlan *initsubplan = (SubPlan *) lfirst(l);
782
783 context.safe_param_ids = list_concat(context.safe_param_ids,
784 initsubplan->setParam);
785 }
786 }
787
788 return !max_parallel_hazard_walker(node, &context);
789}
static bool max_parallel_hazard_walker(Node *node, max_parallel_hazard_context *context)
Definition: clauses.c:828
List * list_concat(List *list1, const List *list2)
Definition: list.c:561
List * init_plans
Definition: pathnodes.h:299
List * setParam
Definition: primnodes.h:1088

References PlannerInfo::init_plans, lfirst, list_concat(), max_parallel_hazard_context::max_hazard, max_parallel_hazard_context::max_interesting, max_parallel_hazard_walker(), NIL, root, max_parallel_hazard_context::safe_param_ids, and SubPlan::setParam.

Referenced by apply_projection_to_path(), build_join_rel(), create_minmaxagg_path(), create_projection_path(), create_set_projection_path(), create_window_paths(), find_computable_ec_member(), grouping_planner(), make_grouping_rel(), plan_create_index_workers(), query_planner(), relation_can_be_sorted_early(), and set_rel_consider_parallel().

◆ is_pseudo_constant_clause()

bool is_pseudo_constant_clause ( Node clause)

Definition at line 2087 of file clauses.c.

2088{
2089 /*
2090 * We could implement this check in one recursive scan. But since the
2091 * check for volatile functions is both moderately expensive and unlikely
2092 * to fail, it seems better to look for Vars first and only check for
2093 * volatile functions if we find no Vars.
2094 */
2095 if (!contain_var_clause(clause) &&
2097 return true;
2098 return false;
2099}
bool contain_var_clause(Node *node)
Definition: var.c:405

References contain_var_clause(), and contain_volatile_functions().

Referenced by clauselist_selectivity_ext(), dependency_is_compatible_clause(), dependency_is_compatible_expression(), and find_window_run_conditions().

◆ is_pseudo_constant_clause_relids()

bool is_pseudo_constant_clause_relids ( Node clause,
Relids  relids 
)

Definition at line 2107 of file clauses.c.

2108{
2109 if (bms_is_empty(relids) &&
2111 return true;
2112 return false;
2113}
#define bms_is_empty(a)
Definition: bitmapset.h:118

References bms_is_empty, and contain_volatile_functions().

Referenced by clauselist_selectivity_ext().

◆ max_parallel_hazard()

char max_parallel_hazard ( Query parse)

Definition at line 733 of file clauses.c.

734{
736
737 context.max_hazard = PROPARALLEL_SAFE;
738 context.max_interesting = PROPARALLEL_UNSAFE;
739 context.safe_param_ids = NIL;
740 (void) max_parallel_hazard_walker((Node *) parse, &context);
741 return context.max_hazard;
742}
static struct subre * parse(struct vars *v, int stopper, int type, struct state *init, struct state *final)
Definition: regcomp.c:717

References max_parallel_hazard_context::max_hazard, max_parallel_hazard_context::max_interesting, max_parallel_hazard_walker(), NIL, parse(), and max_parallel_hazard_context::safe_param_ids.

Referenced by standard_planner().

◆ NumRelids()

int NumRelids ( PlannerInfo root,
Node clause 
)

Definition at line 2129 of file clauses.c.

2130{
2131 int result;
2132 Relids varnos = pull_varnos(root, clause);
2133
2134 varnos = bms_del_members(varnos, root->outer_join_rels);
2135 result = bms_num_members(varnos);
2136 bms_free(varnos);
2137 return result;
2138}
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:1161
void bms_free(Bitmapset *a)
Definition: bitmapset.c:239
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:751
Relids pull_varnos(PlannerInfo *root, Node *node)
Definition: var.c:113

References bms_del_members(), bms_free(), bms_num_members(), pull_varnos(), and root.

Referenced by clauselist_selectivity_ext(), rowcomparesel(), and treat_as_join_clause().

◆ pull_paramids()

Bitmapset * pull_paramids ( Expr expr)

Definition at line 5416 of file clauses.c.

5417{
5418 Bitmapset *result = NULL;
5419
5420 (void) pull_paramids_walker((Node *) expr, &result);
5421
5422 return result;
5423}
static bool pull_paramids_walker(Node *node, Bitmapset **context)
Definition: clauses.c:5426

References pull_paramids_walker().

Referenced by create_memoize_plan().