Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * execExpr.c
4 : * Expression evaluation infrastructure.
5 : *
6 : * During executor startup, we compile each expression tree (which has
7 : * previously been processed by the parser and planner) into an ExprState,
8 : * using ExecInitExpr() et al. This converts the tree into a flat array
9 : * of ExprEvalSteps, which may be thought of as instructions in a program.
10 : * At runtime, we'll execute steps, starting with the first, until we reach
11 : * an EEOP_DONE_{RETURN|NO_RETURN} opcode.
12 : *
13 : * This file contains the "compilation" logic. It is independent of the
14 : * specific execution technology we use (switch statement, computed goto,
15 : * JIT compilation, etc).
16 : *
17 : * See src/backend/executor/README for some background, specifically the
18 : * "Expression Trees and ExprState nodes", "Expression Initialization",
19 : * and "Expression Evaluation" sections.
20 : *
21 : *
22 : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
23 : * Portions Copyright (c) 1994, Regents of the University of California
24 : *
25 : *
26 : * IDENTIFICATION
27 : * src/backend/executor/execExpr.c
28 : *
29 : *-------------------------------------------------------------------------
30 : */
31 : #include "postgres.h"
32 :
33 : #include "access/nbtree.h"
34 : #include "catalog/objectaccess.h"
35 : #include "catalog/pg_proc.h"
36 : #include "catalog/pg_type.h"
37 : #include "executor/execExpr.h"
38 : #include "executor/nodeSubplan.h"
39 : #include "funcapi.h"
40 : #include "jit/jit.h"
41 : #include "miscadmin.h"
42 : #include "nodes/makefuncs.h"
43 : #include "nodes/nodeFuncs.h"
44 : #include "nodes/subscripting.h"
45 : #include "optimizer/optimizer.h"
46 : #include "pgstat.h"
47 : #include "utils/acl.h"
48 : #include "utils/array.h"
49 : #include "utils/builtins.h"
50 : #include "utils/jsonfuncs.h"
51 : #include "utils/jsonpath.h"
52 : #include "utils/lsyscache.h"
53 : #include "utils/typcache.h"
54 :
55 :
56 : typedef struct ExprSetupInfo
57 : {
58 : /*
59 : * Highest attribute numbers fetched from inner/outer/scan/old/new tuple
60 : * slots:
61 : */
62 : AttrNumber last_inner;
63 : AttrNumber last_outer;
64 : AttrNumber last_scan;
65 : AttrNumber last_old;
66 : AttrNumber last_new;
67 : /* MULTIEXPR SubPlan nodes appearing in the expression: */
68 : List *multiexpr_subplans;
69 : } ExprSetupInfo;
70 :
71 : static void ExecReadyExpr(ExprState *state);
72 : static void ExecInitExprRec(Expr *node, ExprState *state,
73 : Datum *resv, bool *resnull);
74 : static void ExecInitFunc(ExprEvalStep *scratch, Expr *node, List *args,
75 : Oid funcid, Oid inputcollid,
76 : ExprState *state);
77 : static void ExecInitSubPlanExpr(SubPlan *subplan,
78 : ExprState *state,
79 : Datum *resv, bool *resnull);
80 : static void ExecCreateExprSetupSteps(ExprState *state, Node *node);
81 : static void ExecPushExprSetupSteps(ExprState *state, ExprSetupInfo *info);
82 : static bool expr_setup_walker(Node *node, ExprSetupInfo *info);
83 : static bool ExecComputeSlotInfo(ExprState *state, ExprEvalStep *op);
84 : static void ExecInitWholeRowVar(ExprEvalStep *scratch, Var *variable,
85 : ExprState *state);
86 : static void ExecInitSubscriptingRef(ExprEvalStep *scratch,
87 : SubscriptingRef *sbsref,
88 : ExprState *state,
89 : Datum *resv, bool *resnull);
90 : static bool isAssignmentIndirectionExpr(Expr *expr);
91 : static void ExecInitCoerceToDomain(ExprEvalStep *scratch, CoerceToDomain *ctest,
92 : ExprState *state,
93 : Datum *resv, bool *resnull);
94 : static void ExecBuildAggTransCall(ExprState *state, AggState *aggstate,
95 : ExprEvalStep *scratch,
96 : FunctionCallInfo fcinfo, AggStatePerTrans pertrans,
97 : int transno, int setno, int setoff, bool ishash,
98 : bool nullcheck);
99 : static void ExecInitJsonExpr(JsonExpr *jsexpr, ExprState *state,
100 : Datum *resv, bool *resnull,
101 : ExprEvalStep *scratch);
102 : static void ExecInitJsonCoercion(ExprState *state, JsonReturning *returning,
103 : ErrorSaveContext *escontext, bool omit_quotes,
104 : bool exists_coerce,
105 : Datum *resv, bool *resnull);
106 :
107 :
108 : /*
109 : * ExecInitExpr: prepare an expression tree for execution
110 : *
111 : * This function builds and returns an ExprState implementing the given
112 : * Expr node tree. The return ExprState can then be handed to ExecEvalExpr
113 : * for execution. Because the Expr tree itself is read-only as far as
114 : * ExecInitExpr and ExecEvalExpr are concerned, several different executions
115 : * of the same plan tree can occur concurrently. (But note that an ExprState
116 : * does mutate at runtime, so it can't be re-used concurrently.)
117 : *
118 : * This must be called in a memory context that will last as long as repeated
119 : * executions of the expression are needed. Typically the context will be
120 : * the same as the per-query context of the associated ExprContext.
121 : *
122 : * Any Aggref, WindowFunc, or SubPlan nodes found in the tree are added to
123 : * the lists of such nodes held by the parent PlanState.
124 : *
125 : * Note: there is no ExecEndExpr function; we assume that any resource
126 : * cleanup needed will be handled by just releasing the memory context
127 : * in which the state tree is built. Functions that require additional
128 : * cleanup work can register a shutdown callback in the ExprContext.
129 : *
130 : * 'node' is the root of the expression tree to compile.
131 : * 'parent' is the PlanState node that owns the expression.
132 : *
133 : * 'parent' may be NULL if we are preparing an expression that is not
134 : * associated with a plan tree. (If so, it can't have aggs or subplans.)
135 : * Such cases should usually come through ExecPrepareExpr, not directly here.
136 : *
137 : * Also, if 'node' is NULL, we just return NULL. This is convenient for some
138 : * callers that may or may not have an expression that needs to be compiled.
139 : * Note that a NULL ExprState pointer *cannot* be handed to ExecEvalExpr,
140 : * although ExecQual and ExecCheck will accept one (and treat it as "true").
141 : */
142 : ExprState *
143 521107 : ExecInitExpr(Expr *node, PlanState *parent)
144 : {
145 : ExprState *state;
146 521107 : ExprEvalStep scratch = {0};
147 :
148 : /* Special case: NULL expression produces a NULL ExprState pointer */
149 521107 : if (node == NULL)
150 28752 : return NULL;
151 :
152 : /* Initialize ExprState with empty step list */
153 492355 : state = makeNode(ExprState);
154 492355 : state->expr = node;
155 492355 : state->parent = parent;
156 492355 : state->ext_params = NULL;
157 :
158 : /* Insert setup steps as needed */
159 492355 : ExecCreateExprSetupSteps(state, (Node *) node);
160 :
161 : /* Compile the expression proper */
162 492355 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
163 :
164 : /* Finally, append a DONE step */
165 492340 : scratch.opcode = EEOP_DONE_RETURN;
166 492340 : ExprEvalPushStep(state, &scratch);
167 :
168 492340 : ExecReadyExpr(state);
169 :
170 492340 : return state;
171 : }
172 :
173 : /*
174 : * ExecInitExprWithParams: prepare a standalone expression tree for execution
175 : *
176 : * This is the same as ExecInitExpr, except that there is no parent PlanState,
177 : * and instead we may have a ParamListInfo describing PARAM_EXTERN Params.
178 : */
179 : ExprState *
180 40830 : ExecInitExprWithParams(Expr *node, ParamListInfo ext_params)
181 : {
182 : ExprState *state;
183 40830 : ExprEvalStep scratch = {0};
184 :
185 : /* Special case: NULL expression produces a NULL ExprState pointer */
186 40830 : if (node == NULL)
187 0 : return NULL;
188 :
189 : /* Initialize ExprState with empty step list */
190 40830 : state = makeNode(ExprState);
191 40830 : state->expr = node;
192 40830 : state->parent = NULL;
193 40830 : state->ext_params = ext_params;
194 :
195 : /* Insert setup steps as needed */
196 40830 : ExecCreateExprSetupSteps(state, (Node *) node);
197 :
198 : /* Compile the expression proper */
199 40830 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
200 :
201 : /* Finally, append a DONE step */
202 40830 : scratch.opcode = EEOP_DONE_RETURN;
203 40830 : ExprEvalPushStep(state, &scratch);
204 :
205 40830 : ExecReadyExpr(state);
206 :
207 40830 : return state;
208 : }
209 :
210 : /*
211 : * ExecInitQual: prepare a qual for execution by ExecQual
212 : *
213 : * Prepares for the evaluation of a conjunctive boolean expression (qual list
214 : * with implicit AND semantics) that returns true if none of the
215 : * subexpressions are false.
216 : *
217 : * We must return true if the list is empty. Since that's a very common case,
218 : * we optimize it a bit further by translating to a NULL ExprState pointer
219 : * rather than setting up an ExprState that computes constant TRUE. (Some
220 : * especially hot-spot callers of ExecQual detect this and avoid calling
221 : * ExecQual at all.)
222 : *
223 : * If any of the subexpressions yield NULL, then the result of the conjunction
224 : * is false. This makes ExecQual primarily useful for evaluating WHERE
225 : * clauses, since SQL specifies that tuples with null WHERE results do not
226 : * get selected.
227 : */
228 : ExprState *
229 918006 : ExecInitQual(List *qual, PlanState *parent)
230 : {
231 : ExprState *state;
232 918006 : ExprEvalStep scratch = {0};
233 918006 : List *adjust_jumps = NIL;
234 :
235 : /* short-circuit (here and in ExecQual) for empty restriction list */
236 918006 : if (qual == NIL)
237 671579 : return NULL;
238 :
239 : Assert(IsA(qual, List));
240 :
241 246427 : state = makeNode(ExprState);
242 246427 : state->expr = (Expr *) qual;
243 246427 : state->parent = parent;
244 246427 : state->ext_params = NULL;
245 :
246 : /* mark expression as to be used with ExecQual() */
247 246427 : state->flags = EEO_FLAG_IS_QUAL;
248 :
249 : /* Insert setup steps as needed */
250 246427 : ExecCreateExprSetupSteps(state, (Node *) qual);
251 :
252 : /*
253 : * ExecQual() needs to return false for an expression returning NULL. That
254 : * allows us to short-circuit the evaluation the first time a NULL is
255 : * encountered. As qual evaluation is a hot-path this warrants using a
256 : * special opcode for qual evaluation that's simpler than BOOL_AND (which
257 : * has more complex NULL handling).
258 : */
259 246427 : scratch.opcode = EEOP_QUAL;
260 :
261 : /*
262 : * We can use ExprState's resvalue/resnull as target for each qual expr.
263 : */
264 246427 : scratch.resvalue = &state->resvalue;
265 246427 : scratch.resnull = &state->resnull;
266 :
267 793664 : foreach_ptr(Expr, node, qual)
268 : {
269 : /* first evaluate expression */
270 300810 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
271 :
272 : /* then emit EEOP_QUAL to detect if it's false (or null) */
273 300810 : scratch.d.qualexpr.jumpdone = -1;
274 300810 : ExprEvalPushStep(state, &scratch);
275 300810 : adjust_jumps = lappend_int(adjust_jumps,
276 300810 : state->steps_len - 1);
277 : }
278 :
279 : /* adjust jump targets */
280 793664 : foreach_int(jump, adjust_jumps)
281 : {
282 300810 : ExprEvalStep *as = &state->steps[jump];
283 :
284 : Assert(as->opcode == EEOP_QUAL);
285 : Assert(as->d.qualexpr.jumpdone == -1);
286 300810 : as->d.qualexpr.jumpdone = state->steps_len;
287 : }
288 :
289 : /*
290 : * At the end, we don't need to do anything more. The last qual expr must
291 : * have yielded TRUE, and since its result is stored in the desired output
292 : * location, we're done.
293 : */
294 246427 : scratch.opcode = EEOP_DONE_RETURN;
295 246427 : ExprEvalPushStep(state, &scratch);
296 :
297 246427 : ExecReadyExpr(state);
298 :
299 246427 : return state;
300 : }
301 :
302 : /*
303 : * ExecInitCheck: prepare a check constraint for execution by ExecCheck
304 : *
305 : * This is much like ExecInitQual/ExecQual, except that a null result from
306 : * the conjunction is treated as TRUE. This behavior is appropriate for
307 : * evaluating CHECK constraints, since SQL specifies that NULL constraint
308 : * conditions are not failures.
309 : *
310 : * Note that like ExecInitQual, this expects input in implicit-AND format.
311 : * Users of ExecCheck that have expressions in normal explicit-AND format
312 : * can just apply ExecInitExpr to produce suitable input for ExecCheck.
313 : */
314 : ExprState *
315 1930 : ExecInitCheck(List *qual, PlanState *parent)
316 : {
317 : /* short-circuit (here and in ExecCheck) for empty restriction list */
318 1930 : if (qual == NIL)
319 90 : return NULL;
320 :
321 : Assert(IsA(qual, List));
322 :
323 : /*
324 : * Just convert the implicit-AND list to an explicit AND (if there's more
325 : * than one entry), and compile normally. Unlike ExecQual, we can't
326 : * short-circuit on NULL results, so the regular AND behavior is needed.
327 : */
328 1840 : return ExecInitExpr(make_ands_explicit(qual), parent);
329 : }
330 :
331 : /*
332 : * Call ExecInitExpr() on a list of expressions, return a list of ExprStates.
333 : */
334 : List *
335 241557 : ExecInitExprList(List *nodes, PlanState *parent)
336 : {
337 241557 : List *result = NIL;
338 : ListCell *lc;
339 :
340 458271 : foreach(lc, nodes)
341 : {
342 216714 : Expr *e = lfirst(lc);
343 :
344 216714 : result = lappend(result, ExecInitExpr(e, parent));
345 : }
346 :
347 241557 : return result;
348 : }
349 :
350 : /*
351 : * ExecBuildProjectionInfo
352 : *
353 : * Build a ProjectionInfo node for evaluating the given tlist in the given
354 : * econtext, and storing the result into the tuple slot. (Caller must have
355 : * ensured that tuple slot has a descriptor matching the tlist!)
356 : *
357 : * inputDesc can be NULL, but if it is not, we check to see whether simple
358 : * Vars in the tlist match the descriptor. It is important to provide
359 : * inputDesc for relation-scan plan nodes, as a cross check that the relation
360 : * hasn't been changed since the plan was made. At higher levels of a plan,
361 : * there is no need to recheck.
362 : *
363 : * This is implemented by internally building an ExprState that performs the
364 : * whole projection in one go.
365 : *
366 : * Caution: before PG v10, the targetList was a list of ExprStates; now it
367 : * should be the planner-created targetlist, since we do the compilation here.
368 : */
369 : ProjectionInfo *
370 390086 : ExecBuildProjectionInfo(List *targetList,
371 : ExprContext *econtext,
372 : TupleTableSlot *slot,
373 : PlanState *parent,
374 : TupleDesc inputDesc)
375 : {
376 390086 : ProjectionInfo *projInfo = makeNode(ProjectionInfo);
377 : ExprState *state;
378 390086 : ExprEvalStep scratch = {0};
379 : ListCell *lc;
380 :
381 390086 : projInfo->pi_exprContext = econtext;
382 : /* We embed ExprState into ProjectionInfo instead of doing extra palloc */
383 390086 : projInfo->pi_state.type = T_ExprState;
384 390086 : state = &projInfo->pi_state;
385 390086 : state->expr = (Expr *) targetList;
386 390086 : state->parent = parent;
387 390086 : state->ext_params = NULL;
388 :
389 390086 : state->resultslot = slot;
390 :
391 : /* Insert setup steps as needed */
392 390086 : ExecCreateExprSetupSteps(state, (Node *) targetList);
393 :
394 : /* Now compile each tlist column */
395 1465563 : foreach(lc, targetList)
396 : {
397 1075511 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
398 1075511 : Var *variable = NULL;
399 1075511 : AttrNumber attnum = 0;
400 1075511 : bool isSafeVar = false;
401 :
402 : /*
403 : * If tlist expression is a safe non-system Var, use the fast-path
404 : * ASSIGN_*_VAR opcodes. "Safe" means that we don't need to apply
405 : * CheckVarSlotCompatibility() during plan startup. If a source slot
406 : * was provided, we make the equivalent tests here; if a slot was not
407 : * provided, we assume that no check is needed because we're dealing
408 : * with a non-relation-scan-level expression.
409 : */
410 1075511 : if (tle->expr != NULL &&
411 1075511 : IsA(tle->expr, Var) &&
412 667404 : ((Var *) tle->expr)->varattno > 0)
413 : {
414 : /* Non-system Var, but how safe is it? */
415 618310 : variable = (Var *) tle->expr;
416 618310 : attnum = variable->varattno;
417 :
418 618310 : if (inputDesc == NULL)
419 361611 : isSafeVar = true; /* can't check, just assume OK */
420 256699 : else if (attnum <= inputDesc->natts)
421 : {
422 256369 : Form_pg_attribute attr = TupleDescAttr(inputDesc, attnum - 1);
423 :
424 : /*
425 : * If user attribute is dropped or has a type mismatch, don't
426 : * use ASSIGN_*_VAR. Instead let the normal expression
427 : * machinery handle it (which'll possibly error out).
428 : */
429 256369 : if (!attr->attisdropped && variable->vartype == attr->atttypid)
430 : {
431 255903 : isSafeVar = true;
432 : }
433 : }
434 : }
435 :
436 1075511 : if (isSafeVar)
437 : {
438 : /* Fast-path: just generate an EEOP_ASSIGN_*_VAR step */
439 617514 : switch (variable->varno)
440 : {
441 110312 : case INNER_VAR:
442 : /* get the tuple from the inner node */
443 110312 : scratch.opcode = EEOP_ASSIGN_INNER_VAR;
444 110312 : break;
445 :
446 250639 : case OUTER_VAR:
447 : /* get the tuple from the outer node */
448 250639 : scratch.opcode = EEOP_ASSIGN_OUTER_VAR;
449 250639 : break;
450 :
451 : /* INDEX_VAR is handled by default case */
452 :
453 256563 : default:
454 :
455 : /*
456 : * Get the tuple from the relation being scanned, or the
457 : * old/new tuple slot, if old/new values were requested.
458 : */
459 256563 : switch (variable->varreturningtype)
460 : {
461 255616 : case VAR_RETURNING_DEFAULT:
462 255616 : scratch.opcode = EEOP_ASSIGN_SCAN_VAR;
463 255616 : break;
464 473 : case VAR_RETURNING_OLD:
465 473 : scratch.opcode = EEOP_ASSIGN_OLD_VAR;
466 473 : state->flags |= EEO_FLAG_HAS_OLD;
467 473 : break;
468 474 : case VAR_RETURNING_NEW:
469 474 : scratch.opcode = EEOP_ASSIGN_NEW_VAR;
470 474 : state->flags |= EEO_FLAG_HAS_NEW;
471 474 : break;
472 : }
473 256563 : break;
474 : }
475 :
476 617514 : scratch.d.assign_var.attnum = attnum - 1;
477 617514 : scratch.d.assign_var.resultnum = tle->resno - 1;
478 617514 : ExprEvalPushStep(state, &scratch);
479 : }
480 : else
481 : {
482 : /*
483 : * Otherwise, compile the column expression normally.
484 : *
485 : * We can't tell the expression to evaluate directly into the
486 : * result slot, as the result slot (and the exprstate for that
487 : * matter) can change between executions. We instead evaluate
488 : * into the ExprState's resvalue/resnull and then move.
489 : */
490 457997 : ExecInitExprRec(tle->expr, state,
491 : &state->resvalue, &state->resnull);
492 :
493 : /*
494 : * Column might be referenced multiple times in upper nodes, so
495 : * force value to R/O - but only if it could be an expanded datum.
496 : */
497 457966 : if (get_typlen(exprType((Node *) tle->expr)) == -1)
498 161855 : scratch.opcode = EEOP_ASSIGN_TMP_MAKE_RO;
499 : else
500 296111 : scratch.opcode = EEOP_ASSIGN_TMP;
501 457966 : scratch.d.assign_tmp.resultnum = tle->resno - 1;
502 457966 : ExprEvalPushStep(state, &scratch);
503 : }
504 : }
505 :
506 390052 : scratch.opcode = EEOP_DONE_NO_RETURN;
507 390052 : ExprEvalPushStep(state, &scratch);
508 :
509 390052 : ExecReadyExpr(state);
510 :
511 390052 : return projInfo;
512 : }
513 :
514 : /*
515 : * ExecBuildUpdateProjection
516 : *
517 : * Build a ProjectionInfo node for constructing a new tuple during UPDATE.
518 : * The projection will be executed in the given econtext and the result will
519 : * be stored into the given tuple slot. (Caller must have ensured that tuple
520 : * slot has a descriptor matching the target rel!)
521 : *
522 : * When evalTargetList is false, targetList contains the UPDATE ... SET
523 : * expressions that have already been computed by a subplan node; the values
524 : * from this tlist are assumed to be available in the "outer" tuple slot.
525 : * When evalTargetList is true, targetList contains the UPDATE ... SET
526 : * expressions that must be computed (which could contain references to
527 : * the outer, inner, or scan tuple slots).
528 : *
529 : * In either case, targetColnos contains a list of the target column numbers
530 : * corresponding to the non-resjunk entries of targetList. The tlist values
531 : * are assigned into these columns of the result tuple slot. Target columns
532 : * not listed in targetColnos are filled from the UPDATE's old tuple, which
533 : * is assumed to be available in the "scan" tuple slot.
534 : *
535 : * targetList can also contain resjunk columns. These must be evaluated
536 : * if evalTargetList is true, but their values are discarded.
537 : *
538 : * relDesc must describe the relation we intend to update.
539 : *
540 : * This is basically a specialized variant of ExecBuildProjectionInfo.
541 : * However, it also performs sanity checks equivalent to ExecCheckPlanOutput.
542 : * Since we never make a normal tlist equivalent to the whole
543 : * tuple-to-be-assigned, there is no convenient way to apply
544 : * ExecCheckPlanOutput, so we must do our safety checks here.
545 : */
546 : ProjectionInfo *
547 8424 : ExecBuildUpdateProjection(List *targetList,
548 : bool evalTargetList,
549 : List *targetColnos,
550 : TupleDesc relDesc,
551 : ExprContext *econtext,
552 : TupleTableSlot *slot,
553 : PlanState *parent)
554 : {
555 8424 : ProjectionInfo *projInfo = makeNode(ProjectionInfo);
556 : ExprState *state;
557 : int nAssignableCols;
558 : bool sawJunk;
559 : Bitmapset *assignedCols;
560 8424 : ExprSetupInfo deform = {0, 0, 0, 0, 0, NIL};
561 8424 : ExprEvalStep scratch = {0};
562 : int outerattnum;
563 : ListCell *lc,
564 : *lc2;
565 :
566 8424 : projInfo->pi_exprContext = econtext;
567 : /* We embed ExprState into ProjectionInfo instead of doing extra palloc */
568 8424 : projInfo->pi_state.type = T_ExprState;
569 8424 : state = &projInfo->pi_state;
570 8424 : if (evalTargetList)
571 1368 : state->expr = (Expr *) targetList;
572 : else
573 7056 : state->expr = NULL; /* not used */
574 8424 : state->parent = parent;
575 8424 : state->ext_params = NULL;
576 :
577 8424 : state->resultslot = slot;
578 :
579 : /*
580 : * Examine the targetList to see how many non-junk columns there are, and
581 : * to verify that the non-junk columns come before the junk ones.
582 : */
583 8424 : nAssignableCols = 0;
584 8424 : sawJunk = false;
585 28174 : foreach(lc, targetList)
586 : {
587 19750 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
588 :
589 19750 : if (tle->resjunk)
590 8855 : sawJunk = true;
591 : else
592 : {
593 10895 : if (sawJunk)
594 0 : elog(ERROR, "subplan target list is out of order");
595 10895 : nAssignableCols++;
596 : }
597 : }
598 :
599 : /* We should have one targetColnos entry per non-junk column */
600 8424 : if (nAssignableCols != list_length(targetColnos))
601 0 : elog(ERROR, "targetColnos does not match subplan target list");
602 :
603 : /*
604 : * Build a bitmapset of the columns in targetColnos. (We could just use
605 : * list_member_int() tests, but that risks O(N^2) behavior with many
606 : * columns.)
607 : */
608 8424 : assignedCols = NULL;
609 19319 : foreach(lc, targetColnos)
610 : {
611 10895 : AttrNumber targetattnum = lfirst_int(lc);
612 :
613 10895 : assignedCols = bms_add_member(assignedCols, targetattnum);
614 : }
615 :
616 : /*
617 : * We need to insert EEOP_*_FETCHSOME steps to ensure the input tuples are
618 : * sufficiently deconstructed. The scan tuple must be deconstructed at
619 : * least as far as the last old column we need.
620 : */
621 14143 : for (int attnum = relDesc->natts; attnum > 0; attnum--)
622 : {
623 12830 : CompactAttribute *attr = TupleDescCompactAttr(relDesc, attnum - 1);
624 :
625 12830 : if (attr->attisdropped)
626 111 : continue;
627 12719 : if (bms_is_member(attnum, assignedCols))
628 5608 : continue;
629 7111 : deform.last_scan = attnum;
630 7111 : break;
631 : }
632 :
633 : /*
634 : * If we're actually evaluating the tlist, incorporate its input
635 : * requirements too; otherwise, we'll just need to fetch the appropriate
636 : * number of columns of the "outer" tuple.
637 : */
638 8424 : if (evalTargetList)
639 1368 : expr_setup_walker((Node *) targetList, &deform);
640 : else
641 7056 : deform.last_outer = nAssignableCols;
642 :
643 8424 : ExecPushExprSetupSteps(state, &deform);
644 :
645 : /*
646 : * Now generate code to evaluate the tlist's assignable expressions or
647 : * fetch them from the outer tuple, incidentally validating that they'll
648 : * be of the right data type. The checks above ensure that the forboth()
649 : * will iterate over exactly the non-junk columns. Note that we don't
650 : * bother evaluating any remaining resjunk columns.
651 : */
652 8424 : outerattnum = 0;
653 19319 : forboth(lc, targetList, lc2, targetColnos)
654 : {
655 10895 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
656 10895 : AttrNumber targetattnum = lfirst_int(lc2);
657 : Form_pg_attribute attr;
658 :
659 : Assert(!tle->resjunk);
660 :
661 : /*
662 : * Apply sanity checks comparable to ExecCheckPlanOutput().
663 : */
664 10895 : if (targetattnum <= 0 || targetattnum > relDesc->natts)
665 0 : ereport(ERROR,
666 : (errcode(ERRCODE_DATATYPE_MISMATCH),
667 : errmsg("table row type and query-specified row type do not match"),
668 : errdetail("Query has too many columns.")));
669 10895 : attr = TupleDescAttr(relDesc, targetattnum - 1);
670 :
671 10895 : if (attr->attisdropped)
672 0 : ereport(ERROR,
673 : (errcode(ERRCODE_DATATYPE_MISMATCH),
674 : errmsg("table row type and query-specified row type do not match"),
675 : errdetail("Query provides a value for a dropped column at ordinal position %d.",
676 : targetattnum)));
677 10895 : if (exprType((Node *) tle->expr) != attr->atttypid)
678 0 : ereport(ERROR,
679 : (errcode(ERRCODE_DATATYPE_MISMATCH),
680 : errmsg("table row type and query-specified row type do not match"),
681 : errdetail("Table has type %s at ordinal position %d, but query expects %s.",
682 : format_type_be(attr->atttypid),
683 : targetattnum,
684 : format_type_be(exprType((Node *) tle->expr)))));
685 :
686 : /* OK, generate code to perform the assignment. */
687 10895 : if (evalTargetList)
688 : {
689 : /*
690 : * We must evaluate the TLE's expression and assign it. We do not
691 : * bother jumping through hoops for "safe" Vars like
692 : * ExecBuildProjectionInfo does; this is a relatively less-used
693 : * path and it doesn't seem worth expending code for that.
694 : */
695 1864 : ExecInitExprRec(tle->expr, state,
696 : &state->resvalue, &state->resnull);
697 : /* Needn't worry about read-only-ness here, either. */
698 1864 : scratch.opcode = EEOP_ASSIGN_TMP;
699 1864 : scratch.d.assign_tmp.resultnum = targetattnum - 1;
700 1864 : ExprEvalPushStep(state, &scratch);
701 : }
702 : else
703 : {
704 : /* Just assign from the outer tuple. */
705 9031 : scratch.opcode = EEOP_ASSIGN_OUTER_VAR;
706 9031 : scratch.d.assign_var.attnum = outerattnum;
707 9031 : scratch.d.assign_var.resultnum = targetattnum - 1;
708 9031 : ExprEvalPushStep(state, &scratch);
709 : }
710 10895 : outerattnum++;
711 : }
712 :
713 : /*
714 : * Now generate code to copy over any old columns that were not assigned
715 : * to, and to ensure that dropped columns are set to NULL.
716 : */
717 80534 : for (int attnum = 1; attnum <= relDesc->natts; attnum++)
718 : {
719 72110 : CompactAttribute *attr = TupleDescCompactAttr(relDesc, attnum - 1);
720 :
721 72110 : if (attr->attisdropped)
722 : {
723 : /* Put a null into the ExprState's resvalue/resnull ... */
724 205 : scratch.opcode = EEOP_CONST;
725 205 : scratch.resvalue = &state->resvalue;
726 205 : scratch.resnull = &state->resnull;
727 205 : scratch.d.constval.value = (Datum) 0;
728 205 : scratch.d.constval.isnull = true;
729 205 : ExprEvalPushStep(state, &scratch);
730 : /* ... then assign it to the result slot */
731 205 : scratch.opcode = EEOP_ASSIGN_TMP;
732 205 : scratch.d.assign_tmp.resultnum = attnum - 1;
733 205 : ExprEvalPushStep(state, &scratch);
734 : }
735 71905 : else if (!bms_is_member(attnum, assignedCols))
736 : {
737 : /* Certainly the right type, so needn't check */
738 61010 : scratch.opcode = EEOP_ASSIGN_SCAN_VAR;
739 61010 : scratch.d.assign_var.attnum = attnum - 1;
740 61010 : scratch.d.assign_var.resultnum = attnum - 1;
741 61010 : ExprEvalPushStep(state, &scratch);
742 : }
743 : }
744 :
745 8424 : scratch.opcode = EEOP_DONE_NO_RETURN;
746 8424 : ExprEvalPushStep(state, &scratch);
747 :
748 8424 : ExecReadyExpr(state);
749 :
750 8424 : return projInfo;
751 : }
752 :
753 : /*
754 : * ExecPrepareExpr --- initialize for expression execution outside a normal
755 : * Plan tree context.
756 : *
757 : * This differs from ExecInitExpr in that we don't assume the caller is
758 : * already running in the EState's per-query context. Also, we run the
759 : * passed expression tree through expression_planner() to prepare it for
760 : * execution. (In ordinary Plan trees the regular planning process will have
761 : * made the appropriate transformations on expressions, but for standalone
762 : * expressions this won't have happened.)
763 : */
764 : ExprState *
765 13632 : ExecPrepareExpr(Expr *node, EState *estate)
766 : {
767 : ExprState *result;
768 : MemoryContext oldcontext;
769 :
770 13632 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
771 :
772 13632 : node = expression_planner(node);
773 :
774 13629 : result = ExecInitExpr(node, NULL);
775 :
776 13626 : MemoryContextSwitchTo(oldcontext);
777 :
778 13626 : return result;
779 : }
780 :
781 : /*
782 : * ExecPrepareQual --- initialize for qual execution outside a normal
783 : * Plan tree context.
784 : *
785 : * This differs from ExecInitQual in that we don't assume the caller is
786 : * already running in the EState's per-query context. Also, we run the
787 : * passed expression tree through expression_planner() to prepare it for
788 : * execution. (In ordinary Plan trees the regular planning process will have
789 : * made the appropriate transformations on expressions, but for standalone
790 : * expressions this won't have happened.)
791 : */
792 : ExprState *
793 30351 : ExecPrepareQual(List *qual, EState *estate)
794 : {
795 : ExprState *result;
796 : MemoryContext oldcontext;
797 :
798 30351 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
799 :
800 30351 : qual = (List *) expression_planner((Expr *) qual);
801 :
802 30351 : result = ExecInitQual(qual, NULL);
803 :
804 30351 : MemoryContextSwitchTo(oldcontext);
805 :
806 30351 : return result;
807 : }
808 :
809 : /*
810 : * ExecPrepareCheck -- initialize check constraint for execution outside a
811 : * normal Plan tree context.
812 : *
813 : * See ExecPrepareExpr() and ExecInitCheck() for details.
814 : */
815 : ExprState *
816 1930 : ExecPrepareCheck(List *qual, EState *estate)
817 : {
818 : ExprState *result;
819 : MemoryContext oldcontext;
820 :
821 1930 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
822 :
823 1930 : qual = (List *) expression_planner((Expr *) qual);
824 :
825 1930 : result = ExecInitCheck(qual, NULL);
826 :
827 1930 : MemoryContextSwitchTo(oldcontext);
828 :
829 1930 : return result;
830 : }
831 :
832 : /*
833 : * Call ExecPrepareExpr() on each member of a list of Exprs, and return
834 : * a list of ExprStates.
835 : *
836 : * See ExecPrepareExpr() for details.
837 : */
838 : List *
839 8693 : ExecPrepareExprList(List *nodes, EState *estate)
840 : {
841 8693 : List *result = NIL;
842 : MemoryContext oldcontext;
843 : ListCell *lc;
844 :
845 : /* Ensure that the list cell nodes are in the right context too */
846 8693 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
847 :
848 17791 : foreach(lc, nodes)
849 : {
850 9098 : Expr *e = (Expr *) lfirst(lc);
851 :
852 9098 : result = lappend(result, ExecPrepareExpr(e, estate));
853 : }
854 :
855 8693 : MemoryContextSwitchTo(oldcontext);
856 :
857 8693 : return result;
858 : }
859 :
860 : /*
861 : * ExecCheck - evaluate a check constraint
862 : *
863 : * For check constraints, a null result is taken as TRUE, ie the constraint
864 : * passes.
865 : *
866 : * The check constraint may have been prepared with ExecInitCheck
867 : * (possibly via ExecPrepareCheck) if the caller had it in implicit-AND
868 : * format, but a regular boolean expression prepared with ExecInitExpr or
869 : * ExecPrepareExpr works too.
870 : */
871 : bool
872 56254 : ExecCheck(ExprState *state, ExprContext *econtext)
873 : {
874 : Datum ret;
875 : bool isnull;
876 :
877 : /* short-circuit (here and in ExecInitCheck) for empty restriction list */
878 56254 : if (state == NULL)
879 90 : return true;
880 :
881 : /* verify that expression was not compiled using ExecInitQual */
882 : Assert(!(state->flags & EEO_FLAG_IS_QUAL));
883 :
884 56164 : ret = ExecEvalExprSwitchContext(state, econtext, &isnull);
885 :
886 56161 : if (isnull)
887 1419 : return true;
888 :
889 54742 : return DatumGetBool(ret);
890 : }
891 :
892 : /*
893 : * Prepare a compiled expression for execution. This has to be called for
894 : * every ExprState before it can be executed.
895 : *
896 : * NB: While this currently only calls ExecReadyInterpretedExpr(),
897 : * this will likely get extended to further expression evaluation methods.
898 : * Therefore this should be used instead of directly calling
899 : * ExecReadyInterpretedExpr().
900 : */
901 : static void
902 1257753 : ExecReadyExpr(ExprState *state)
903 : {
904 1257753 : if (jit_compile_expr(state))
905 3630 : return;
906 :
907 1254123 : ExecReadyInterpretedExpr(state);
908 : }
909 :
910 : /*
911 : * Append the steps necessary for the evaluation of node to ExprState->steps,
912 : * possibly recursing into sub-expressions of node.
913 : *
914 : * node - expression to evaluate
915 : * state - ExprState to whose ->steps to append the necessary operations
916 : * resv / resnull - where to store the result of the node into
917 : */
918 : static void
919 2719354 : ExecInitExprRec(Expr *node, ExprState *state,
920 : Datum *resv, bool *resnull)
921 : {
922 2719354 : ExprEvalStep scratch = {0};
923 :
924 : /* Guard against stack overflow due to overly complex expressions */
925 2719354 : check_stack_depth();
926 :
927 : /* Step's output location is always what the caller gave us */
928 : Assert(resv != NULL && resnull != NULL);
929 2719354 : scratch.resvalue = resv;
930 2719354 : scratch.resnull = resnull;
931 :
932 : /* cases should be ordered as they are in enum NodeTag */
933 2719354 : switch (nodeTag(node))
934 : {
935 687885 : case T_Var:
936 : {
937 687885 : Var *variable = (Var *) node;
938 :
939 687885 : if (variable->varattno == InvalidAttrNumber)
940 : {
941 : /* whole-row Var */
942 2655 : ExecInitWholeRowVar(&scratch, variable, state);
943 : }
944 685230 : else if (variable->varattno <= 0)
945 : {
946 : /* system column */
947 50595 : scratch.d.var.attnum = variable->varattno;
948 50595 : scratch.d.var.vartype = variable->vartype;
949 50595 : scratch.d.var.varreturningtype = variable->varreturningtype;
950 50595 : switch (variable->varno)
951 : {
952 3 : case INNER_VAR:
953 3 : scratch.opcode = EEOP_INNER_SYSVAR;
954 3 : break;
955 6 : case OUTER_VAR:
956 6 : scratch.opcode = EEOP_OUTER_SYSVAR;
957 6 : break;
958 :
959 : /* INDEX_VAR is handled by default case */
960 :
961 50586 : default:
962 50586 : switch (variable->varreturningtype)
963 : {
964 50262 : case VAR_RETURNING_DEFAULT:
965 50262 : scratch.opcode = EEOP_SCAN_SYSVAR;
966 50262 : break;
967 162 : case VAR_RETURNING_OLD:
968 162 : scratch.opcode = EEOP_OLD_SYSVAR;
969 162 : state->flags |= EEO_FLAG_HAS_OLD;
970 162 : break;
971 162 : case VAR_RETURNING_NEW:
972 162 : scratch.opcode = EEOP_NEW_SYSVAR;
973 162 : state->flags |= EEO_FLAG_HAS_NEW;
974 162 : break;
975 : }
976 50586 : break;
977 : }
978 : }
979 : else
980 : {
981 : /* regular user column */
982 634635 : scratch.d.var.attnum = variable->varattno - 1;
983 634635 : scratch.d.var.vartype = variable->vartype;
984 634635 : scratch.d.var.varreturningtype = variable->varreturningtype;
985 634635 : switch (variable->varno)
986 : {
987 74454 : case INNER_VAR:
988 74454 : scratch.opcode = EEOP_INNER_VAR;
989 74454 : break;
990 190324 : case OUTER_VAR:
991 190324 : scratch.opcode = EEOP_OUTER_VAR;
992 190324 : break;
993 :
994 : /* INDEX_VAR is handled by default case */
995 :
996 369857 : default:
997 369857 : switch (variable->varreturningtype)
998 : {
999 369611 : case VAR_RETURNING_DEFAULT:
1000 369611 : scratch.opcode = EEOP_SCAN_VAR;
1001 369611 : break;
1002 123 : case VAR_RETURNING_OLD:
1003 123 : scratch.opcode = EEOP_OLD_VAR;
1004 123 : state->flags |= EEO_FLAG_HAS_OLD;
1005 123 : break;
1006 123 : case VAR_RETURNING_NEW:
1007 123 : scratch.opcode = EEOP_NEW_VAR;
1008 123 : state->flags |= EEO_FLAG_HAS_NEW;
1009 123 : break;
1010 : }
1011 369857 : break;
1012 : }
1013 : }
1014 :
1015 687885 : ExprEvalPushStep(state, &scratch);
1016 687885 : break;
1017 : }
1018 :
1019 561954 : case T_Const:
1020 : {
1021 561954 : Const *con = (Const *) node;
1022 :
1023 561954 : scratch.opcode = EEOP_CONST;
1024 561954 : scratch.d.constval.value = con->constvalue;
1025 561954 : scratch.d.constval.isnull = con->constisnull;
1026 :
1027 561954 : ExprEvalPushStep(state, &scratch);
1028 561954 : break;
1029 : }
1030 :
1031 389024 : case T_Param:
1032 : {
1033 389024 : Param *param = (Param *) node;
1034 : ParamListInfo params;
1035 :
1036 389024 : switch (param->paramkind)
1037 : {
1038 129237 : case PARAM_EXEC:
1039 129237 : scratch.opcode = EEOP_PARAM_EXEC;
1040 129237 : scratch.d.param.paramid = param->paramid;
1041 129237 : scratch.d.param.paramtype = param->paramtype;
1042 129237 : ExprEvalPushStep(state, &scratch);
1043 129237 : break;
1044 259787 : case PARAM_EXTERN:
1045 :
1046 : /*
1047 : * If we have a relevant ParamCompileHook, use it;
1048 : * otherwise compile a standard EEOP_PARAM_EXTERN
1049 : * step. ext_params, if supplied, takes precedence
1050 : * over info from the parent node's EState (if any).
1051 : */
1052 259787 : if (state->ext_params)
1053 36760 : params = state->ext_params;
1054 223027 : else if (state->parent &&
1055 222928 : state->parent->state)
1056 222928 : params = state->parent->state->es_param_list_info;
1057 : else
1058 99 : params = NULL;
1059 259787 : if (params && params->paramCompile)
1060 : {
1061 75158 : params->paramCompile(params, param, state,
1062 : resv, resnull);
1063 : }
1064 : else
1065 : {
1066 184629 : scratch.opcode = EEOP_PARAM_EXTERN;
1067 184629 : scratch.d.param.paramid = param->paramid;
1068 184629 : scratch.d.param.paramtype = param->paramtype;
1069 184629 : ExprEvalPushStep(state, &scratch);
1070 : }
1071 259787 : break;
1072 0 : default:
1073 0 : elog(ERROR, "unrecognized paramkind: %d",
1074 : (int) param->paramkind);
1075 : break;
1076 : }
1077 389024 : break;
1078 : }
1079 :
1080 30559 : case T_Aggref:
1081 : {
1082 30559 : Aggref *aggref = (Aggref *) node;
1083 :
1084 30559 : scratch.opcode = EEOP_AGGREF;
1085 30559 : scratch.d.aggref.aggno = aggref->aggno;
1086 :
1087 30559 : if (state->parent && IsA(state->parent, AggState))
1088 30559 : {
1089 30559 : AggState *aggstate = (AggState *) state->parent;
1090 :
1091 30559 : aggstate->aggs = lappend(aggstate->aggs, aggref);
1092 : }
1093 : else
1094 : {
1095 : /* planner messed up */
1096 0 : elog(ERROR, "Aggref found in non-Agg plan node");
1097 : }
1098 :
1099 30559 : ExprEvalPushStep(state, &scratch);
1100 30559 : break;
1101 : }
1102 :
1103 179 : case T_GroupingFunc:
1104 : {
1105 179 : GroupingFunc *grp_node = (GroupingFunc *) node;
1106 : Agg *agg;
1107 :
1108 179 : if (!state->parent || !IsA(state->parent, AggState) ||
1109 179 : !IsA(state->parent->plan, Agg))
1110 0 : elog(ERROR, "GroupingFunc found in non-Agg plan node");
1111 :
1112 179 : scratch.opcode = EEOP_GROUPING_FUNC;
1113 :
1114 179 : agg = (Agg *) (state->parent->plan);
1115 :
1116 179 : if (agg->groupingSets)
1117 130 : scratch.d.grouping_func.clauses = grp_node->cols;
1118 : else
1119 49 : scratch.d.grouping_func.clauses = NIL;
1120 :
1121 179 : ExprEvalPushStep(state, &scratch);
1122 179 : break;
1123 : }
1124 :
1125 1854 : case T_WindowFunc:
1126 : {
1127 1854 : WindowFunc *wfunc = (WindowFunc *) node;
1128 1854 : WindowFuncExprState *wfstate = makeNode(WindowFuncExprState);
1129 :
1130 1854 : wfstate->wfunc = wfunc;
1131 :
1132 1854 : if (state->parent && IsA(state->parent, WindowAggState))
1133 1854 : {
1134 1854 : WindowAggState *winstate = (WindowAggState *) state->parent;
1135 : int nfuncs;
1136 :
1137 1854 : winstate->funcs = lappend(winstate->funcs, wfstate);
1138 1854 : nfuncs = ++winstate->numfuncs;
1139 1854 : if (wfunc->winagg)
1140 834 : winstate->numaggs++;
1141 :
1142 : /* for now initialize agg using old style expressions */
1143 1854 : wfstate->args = ExecInitExprList(wfunc->args,
1144 : state->parent);
1145 1854 : wfstate->aggfilter = ExecInitExpr(wfunc->aggfilter,
1146 : state->parent);
1147 :
1148 : /*
1149 : * Complain if the windowfunc's arguments contain any
1150 : * windowfuncs; nested window functions are semantically
1151 : * nonsensical. (This should have been caught earlier,
1152 : * but we defend against it here anyway.)
1153 : */
1154 1854 : if (nfuncs != winstate->numfuncs)
1155 0 : ereport(ERROR,
1156 : (errcode(ERRCODE_WINDOWING_ERROR),
1157 : errmsg("window function calls cannot be nested")));
1158 : }
1159 : else
1160 : {
1161 : /* planner messed up */
1162 0 : elog(ERROR, "WindowFunc found in non-WindowAgg plan node");
1163 : }
1164 :
1165 1854 : scratch.opcode = EEOP_WINDOW_FUNC;
1166 1854 : scratch.d.window_func.wfstate = wfstate;
1167 1854 : ExprEvalPushStep(state, &scratch);
1168 1854 : break;
1169 : }
1170 :
1171 122 : case T_MergeSupportFunc:
1172 : {
1173 : /* must be in a MERGE, else something messed up */
1174 122 : if (!state->parent ||
1175 122 : !IsA(state->parent, ModifyTableState) ||
1176 122 : ((ModifyTableState *) state->parent)->operation != CMD_MERGE)
1177 0 : elog(ERROR, "MergeSupportFunc found in non-merge plan node");
1178 :
1179 122 : scratch.opcode = EEOP_MERGE_SUPPORT_FUNC;
1180 122 : ExprEvalPushStep(state, &scratch);
1181 122 : break;
1182 : }
1183 :
1184 14022 : case T_SubscriptingRef:
1185 : {
1186 14022 : SubscriptingRef *sbsref = (SubscriptingRef *) node;
1187 :
1188 14022 : ExecInitSubscriptingRef(&scratch, sbsref, state, resv, resnull);
1189 14022 : break;
1190 : }
1191 :
1192 299484 : case T_FuncExpr:
1193 : {
1194 299484 : FuncExpr *func = (FuncExpr *) node;
1195 :
1196 299484 : ExecInitFunc(&scratch, node,
1197 : func->args, func->funcid, func->inputcollid,
1198 : state);
1199 299441 : ExprEvalPushStep(state, &scratch);
1200 299441 : break;
1201 : }
1202 :
1203 451884 : case T_OpExpr:
1204 : {
1205 451884 : OpExpr *op = (OpExpr *) node;
1206 :
1207 451884 : ExecInitFunc(&scratch, node,
1208 : op->args, op->opfuncid, op->inputcollid,
1209 : state);
1210 451884 : ExprEvalPushStep(state, &scratch);
1211 451884 : break;
1212 : }
1213 :
1214 589 : case T_DistinctExpr:
1215 : {
1216 589 : DistinctExpr *op = (DistinctExpr *) node;
1217 :
1218 589 : ExecInitFunc(&scratch, node,
1219 : op->args, op->opfuncid, op->inputcollid,
1220 : state);
1221 :
1222 : /*
1223 : * Change opcode of call instruction to EEOP_DISTINCT.
1224 : *
1225 : * XXX: historically we've not called the function usage
1226 : * pgstat infrastructure - that seems inconsistent given that
1227 : * we do so for normal function *and* operator evaluation. If
1228 : * we decided to do that here, we'd probably want separate
1229 : * opcodes for FUSAGE or not.
1230 : */
1231 589 : scratch.opcode = EEOP_DISTINCT;
1232 589 : ExprEvalPushStep(state, &scratch);
1233 589 : break;
1234 : }
1235 :
1236 252 : case T_NullIfExpr:
1237 : {
1238 252 : NullIfExpr *op = (NullIfExpr *) node;
1239 :
1240 252 : ExecInitFunc(&scratch, node,
1241 : op->args, op->opfuncid, op->inputcollid,
1242 : state);
1243 :
1244 : /*
1245 : * If first argument is of varlena type, we'll need to ensure
1246 : * that the value passed to the comparison function is a
1247 : * read-only pointer.
1248 : */
1249 252 : scratch.d.func.make_ro =
1250 252 : (get_typlen(exprType((Node *) linitial(op->args))) == -1);
1251 :
1252 : /*
1253 : * Change opcode of call instruction to EEOP_NULLIF.
1254 : *
1255 : * XXX: historically we've not called the function usage
1256 : * pgstat infrastructure - that seems inconsistent given that
1257 : * we do so for normal function *and* operator evaluation. If
1258 : * we decided to do that here, we'd probably want separate
1259 : * opcodes for FUSAGE or not.
1260 : */
1261 252 : scratch.opcode = EEOP_NULLIF;
1262 252 : ExprEvalPushStep(state, &scratch);
1263 252 : break;
1264 : }
1265 :
1266 18998 : case T_ScalarArrayOpExpr:
1267 : {
1268 18998 : ScalarArrayOpExpr *opexpr = (ScalarArrayOpExpr *) node;
1269 : Expr *scalararg;
1270 : Expr *arrayarg;
1271 : FmgrInfo *finfo;
1272 : FunctionCallInfo fcinfo;
1273 : AclResult aclresult;
1274 : Oid cmpfuncid;
1275 :
1276 : /*
1277 : * Select the correct comparison function. When we do hashed
1278 : * NOT IN clauses, the opfuncid will be the inequality
1279 : * comparison function and negfuncid will be set to equality.
1280 : * We need to use the equality function for hash probes.
1281 : */
1282 18998 : if (OidIsValid(opexpr->negfuncid))
1283 : {
1284 : Assert(OidIsValid(opexpr->hashfuncid));
1285 35 : cmpfuncid = opexpr->negfuncid;
1286 : }
1287 : else
1288 18963 : cmpfuncid = opexpr->opfuncid;
1289 :
1290 : Assert(list_length(opexpr->args) == 2);
1291 18998 : scalararg = (Expr *) linitial(opexpr->args);
1292 18998 : arrayarg = (Expr *) lsecond(opexpr->args);
1293 :
1294 : /* Check permission to call function */
1295 18998 : aclresult = object_aclcheck(ProcedureRelationId, cmpfuncid,
1296 : GetUserId(),
1297 : ACL_EXECUTE);
1298 18998 : if (aclresult != ACLCHECK_OK)
1299 0 : aclcheck_error(aclresult, OBJECT_FUNCTION,
1300 0 : get_func_name(cmpfuncid));
1301 18998 : InvokeFunctionExecuteHook(cmpfuncid);
1302 :
1303 18998 : if (OidIsValid(opexpr->hashfuncid))
1304 : {
1305 215 : aclresult = object_aclcheck(ProcedureRelationId, opexpr->hashfuncid,
1306 : GetUserId(),
1307 : ACL_EXECUTE);
1308 215 : if (aclresult != ACLCHECK_OK)
1309 0 : aclcheck_error(aclresult, OBJECT_FUNCTION,
1310 0 : get_func_name(opexpr->hashfuncid));
1311 215 : InvokeFunctionExecuteHook(opexpr->hashfuncid);
1312 : }
1313 :
1314 : /* Set up the primary fmgr lookup information */
1315 18998 : finfo = palloc0_object(FmgrInfo);
1316 18998 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
1317 18998 : fmgr_info(cmpfuncid, finfo);
1318 18998 : fmgr_info_set_expr((Node *) node, finfo);
1319 18998 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
1320 : opexpr->inputcollid, NULL, NULL);
1321 :
1322 : /*
1323 : * If hashfuncid is set, we create a EEOP_HASHED_SCALARARRAYOP
1324 : * step instead of a EEOP_SCALARARRAYOP. This provides much
1325 : * faster lookup performance than the normal linear search
1326 : * when the number of items in the array is anything but very
1327 : * small.
1328 : */
1329 18998 : if (OidIsValid(opexpr->hashfuncid))
1330 : {
1331 : /* Evaluate scalar directly into left function argument */
1332 215 : ExecInitExprRec(scalararg, state,
1333 : &fcinfo->args[0].value, &fcinfo->args[0].isnull);
1334 :
1335 : /*
1336 : * Evaluate array argument into our return value. There's
1337 : * no danger in that, because the return value is
1338 : * guaranteed to be overwritten by
1339 : * EEOP_HASHED_SCALARARRAYOP, and will not be passed to
1340 : * any other expression.
1341 : */
1342 215 : ExecInitExprRec(arrayarg, state, resv, resnull);
1343 :
1344 : /* And perform the operation */
1345 215 : scratch.opcode = EEOP_HASHED_SCALARARRAYOP;
1346 215 : scratch.d.hashedscalararrayop.inclause = opexpr->useOr;
1347 215 : scratch.d.hashedscalararrayop.finfo = finfo;
1348 215 : scratch.d.hashedscalararrayop.fcinfo_data = fcinfo;
1349 215 : scratch.d.hashedscalararrayop.saop = opexpr;
1350 :
1351 :
1352 215 : ExprEvalPushStep(state, &scratch);
1353 : }
1354 : else
1355 : {
1356 : /* Evaluate scalar directly into left function argument */
1357 18783 : ExecInitExprRec(scalararg, state,
1358 : &fcinfo->args[0].value,
1359 : &fcinfo->args[0].isnull);
1360 :
1361 : /*
1362 : * Evaluate array argument into our return value. There's
1363 : * no danger in that, because the return value is
1364 : * guaranteed to be overwritten by EEOP_SCALARARRAYOP, and
1365 : * will not be passed to any other expression.
1366 : */
1367 18783 : ExecInitExprRec(arrayarg, state, resv, resnull);
1368 :
1369 : /* And perform the operation */
1370 18783 : scratch.opcode = EEOP_SCALARARRAYOP;
1371 18783 : scratch.d.scalararrayop.element_type = InvalidOid;
1372 18783 : scratch.d.scalararrayop.useOr = opexpr->useOr;
1373 18783 : scratch.d.scalararrayop.finfo = finfo;
1374 18783 : scratch.d.scalararrayop.fcinfo_data = fcinfo;
1375 18783 : scratch.d.scalararrayop.fn_addr = finfo->fn_addr;
1376 18783 : ExprEvalPushStep(state, &scratch);
1377 : }
1378 18998 : break;
1379 : }
1380 :
1381 35422 : case T_BoolExpr:
1382 : {
1383 35422 : BoolExpr *boolexpr = (BoolExpr *) node;
1384 35422 : int nargs = list_length(boolexpr->args);
1385 35422 : List *adjust_jumps = NIL;
1386 : int off;
1387 : ListCell *lc;
1388 :
1389 : /* allocate scratch memory used by all steps of AND/OR */
1390 35422 : if (boolexpr->boolop != NOT_EXPR)
1391 27878 : scratch.d.boolexpr.anynull = palloc_object(bool);
1392 :
1393 : /*
1394 : * For each argument evaluate the argument itself, then
1395 : * perform the bool operation's appropriate handling.
1396 : *
1397 : * We can evaluate each argument into our result area, since
1398 : * the short-circuiting logic means we only need to remember
1399 : * previous NULL values.
1400 : *
1401 : * AND/OR is split into separate STEP_FIRST (one) / STEP (zero
1402 : * or more) / STEP_LAST (one) steps, as each of those has to
1403 : * perform different work. The FIRST/LAST split is valid
1404 : * because AND/OR have at least two arguments.
1405 : */
1406 35422 : off = 0;
1407 105796 : foreach(lc, boolexpr->args)
1408 : {
1409 70374 : Expr *arg = (Expr *) lfirst(lc);
1410 :
1411 : /* Evaluate argument into our output variable */
1412 70374 : ExecInitExprRec(arg, state, resv, resnull);
1413 :
1414 : /* Perform the appropriate step type */
1415 70374 : switch (boolexpr->boolop)
1416 : {
1417 41913 : case AND_EXPR:
1418 : Assert(nargs >= 2);
1419 :
1420 41913 : if (off == 0)
1421 18701 : scratch.opcode = EEOP_BOOL_AND_STEP_FIRST;
1422 23212 : else if (off + 1 == nargs)
1423 18701 : scratch.opcode = EEOP_BOOL_AND_STEP_LAST;
1424 : else
1425 4511 : scratch.opcode = EEOP_BOOL_AND_STEP;
1426 41913 : break;
1427 20917 : case OR_EXPR:
1428 : Assert(nargs >= 2);
1429 :
1430 20917 : if (off == 0)
1431 9177 : scratch.opcode = EEOP_BOOL_OR_STEP_FIRST;
1432 11740 : else if (off + 1 == nargs)
1433 9177 : scratch.opcode = EEOP_BOOL_OR_STEP_LAST;
1434 : else
1435 2563 : scratch.opcode = EEOP_BOOL_OR_STEP;
1436 20917 : break;
1437 7544 : case NOT_EXPR:
1438 : Assert(nargs == 1);
1439 :
1440 7544 : scratch.opcode = EEOP_BOOL_NOT_STEP;
1441 7544 : break;
1442 0 : default:
1443 0 : elog(ERROR, "unrecognized boolop: %d",
1444 : (int) boolexpr->boolop);
1445 : break;
1446 : }
1447 :
1448 70374 : scratch.d.boolexpr.jumpdone = -1;
1449 70374 : ExprEvalPushStep(state, &scratch);
1450 70374 : adjust_jumps = lappend_int(adjust_jumps,
1451 70374 : state->steps_len - 1);
1452 70374 : off++;
1453 : }
1454 :
1455 : /* adjust jump targets */
1456 105796 : foreach(lc, adjust_jumps)
1457 : {
1458 70374 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
1459 :
1460 : Assert(as->d.boolexpr.jumpdone == -1);
1461 70374 : as->d.boolexpr.jumpdone = state->steps_len;
1462 : }
1463 :
1464 35422 : break;
1465 : }
1466 :
1467 14801 : case T_SubPlan:
1468 : {
1469 14801 : SubPlan *subplan = (SubPlan *) node;
1470 :
1471 : /*
1472 : * Real execution of a MULTIEXPR SubPlan has already been
1473 : * done. What we have to do here is return a dummy NULL record
1474 : * value in case this targetlist element is assigned
1475 : * someplace.
1476 : */
1477 14801 : if (subplan->subLinkType == MULTIEXPR_SUBLINK)
1478 : {
1479 30 : scratch.opcode = EEOP_CONST;
1480 30 : scratch.d.constval.value = (Datum) 0;
1481 30 : scratch.d.constval.isnull = true;
1482 30 : ExprEvalPushStep(state, &scratch);
1483 30 : break;
1484 : }
1485 :
1486 14771 : ExecInitSubPlanExpr(subplan, state, resv, resnull);
1487 14771 : break;
1488 : }
1489 :
1490 4762 : case T_FieldSelect:
1491 : {
1492 4762 : FieldSelect *fselect = (FieldSelect *) node;
1493 :
1494 : /* evaluate row/record argument into result area */
1495 4762 : ExecInitExprRec(fselect->arg, state, resv, resnull);
1496 :
1497 : /* and extract field */
1498 4762 : scratch.opcode = EEOP_FIELDSELECT;
1499 4762 : scratch.d.fieldselect.fieldnum = fselect->fieldnum;
1500 4762 : scratch.d.fieldselect.resulttype = fselect->resulttype;
1501 4762 : scratch.d.fieldselect.rowcache.cacheptr = NULL;
1502 :
1503 4762 : ExprEvalPushStep(state, &scratch);
1504 4762 : break;
1505 : }
1506 :
1507 191 : case T_FieldStore:
1508 : {
1509 191 : FieldStore *fstore = (FieldStore *) node;
1510 : TupleDesc tupDesc;
1511 : ExprEvalRowtypeCache *rowcachep;
1512 : Datum *values;
1513 : bool *nulls;
1514 : int ncolumns;
1515 : ListCell *l1,
1516 : *l2;
1517 :
1518 : /* find out the number of columns in the composite type */
1519 191 : tupDesc = lookup_rowtype_tupdesc(fstore->resulttype, -1);
1520 191 : ncolumns = tupDesc->natts;
1521 191 : ReleaseTupleDesc(tupDesc);
1522 :
1523 : /* create workspace for column values */
1524 191 : values = palloc_array(Datum, ncolumns);
1525 191 : nulls = palloc_array(bool, ncolumns);
1526 :
1527 : /* create shared composite-type-lookup cache struct */
1528 191 : rowcachep = palloc_object(ExprEvalRowtypeCache);
1529 191 : rowcachep->cacheptr = NULL;
1530 :
1531 : /* emit code to evaluate the composite input value */
1532 191 : ExecInitExprRec(fstore->arg, state, resv, resnull);
1533 :
1534 : /* next, deform the input tuple into our workspace */
1535 191 : scratch.opcode = EEOP_FIELDSTORE_DEFORM;
1536 191 : scratch.d.fieldstore.fstore = fstore;
1537 191 : scratch.d.fieldstore.rowcache = rowcachep;
1538 191 : scratch.d.fieldstore.values = values;
1539 191 : scratch.d.fieldstore.nulls = nulls;
1540 191 : scratch.d.fieldstore.ncolumns = ncolumns;
1541 191 : ExprEvalPushStep(state, &scratch);
1542 :
1543 : /* evaluate new field values, store in workspace columns */
1544 445 : forboth(l1, fstore->newvals, l2, fstore->fieldnums)
1545 : {
1546 254 : Expr *e = (Expr *) lfirst(l1);
1547 254 : AttrNumber fieldnum = lfirst_int(l2);
1548 : Datum *save_innermost_caseval;
1549 : bool *save_innermost_casenull;
1550 :
1551 254 : if (fieldnum <= 0 || fieldnum > ncolumns)
1552 0 : elog(ERROR, "field number %d is out of range in FieldStore",
1553 : fieldnum);
1554 :
1555 : /*
1556 : * Use the CaseTestExpr mechanism to pass down the old
1557 : * value of the field being replaced; this is needed in
1558 : * case the newval is itself a FieldStore or
1559 : * SubscriptingRef that has to obtain and modify the old
1560 : * value. It's safe to reuse the CASE mechanism because
1561 : * there cannot be a CASE between here and where the value
1562 : * would be needed, and a field assignment can't be within
1563 : * a CASE either. (So saving and restoring
1564 : * innermost_caseval is just paranoia, but let's do it
1565 : * anyway.)
1566 : *
1567 : * Another non-obvious point is that it's safe to use the
1568 : * field's values[]/nulls[] entries as both the caseval
1569 : * source and the result address for this subexpression.
1570 : * That's okay only because (1) both FieldStore and
1571 : * SubscriptingRef evaluate their arg or refexpr inputs
1572 : * first, and (2) any such CaseTestExpr is directly the
1573 : * arg or refexpr input. So any read of the caseval will
1574 : * occur before there's a chance to overwrite it. Also,
1575 : * if multiple entries in the newvals/fieldnums lists
1576 : * target the same field, they'll effectively be applied
1577 : * left-to-right which is what we want.
1578 : */
1579 254 : save_innermost_caseval = state->innermost_caseval;
1580 254 : save_innermost_casenull = state->innermost_casenull;
1581 254 : state->innermost_caseval = &values[fieldnum - 1];
1582 254 : state->innermost_casenull = &nulls[fieldnum - 1];
1583 :
1584 254 : ExecInitExprRec(e, state,
1585 254 : &values[fieldnum - 1],
1586 254 : &nulls[fieldnum - 1]);
1587 :
1588 254 : state->innermost_caseval = save_innermost_caseval;
1589 254 : state->innermost_casenull = save_innermost_casenull;
1590 : }
1591 :
1592 : /* finally, form result tuple */
1593 191 : scratch.opcode = EEOP_FIELDSTORE_FORM;
1594 191 : scratch.d.fieldstore.fstore = fstore;
1595 191 : scratch.d.fieldstore.rowcache = rowcachep;
1596 191 : scratch.d.fieldstore.values = values;
1597 191 : scratch.d.fieldstore.nulls = nulls;
1598 191 : scratch.d.fieldstore.ncolumns = ncolumns;
1599 191 : ExprEvalPushStep(state, &scratch);
1600 191 : break;
1601 : }
1602 :
1603 64025 : case T_RelabelType:
1604 : {
1605 : /* relabel doesn't need to do anything at runtime */
1606 64025 : RelabelType *relabel = (RelabelType *) node;
1607 :
1608 64025 : ExecInitExprRec(relabel->arg, state, resv, resnull);
1609 64025 : break;
1610 : }
1611 :
1612 19261 : case T_CoerceViaIO:
1613 : {
1614 19261 : CoerceViaIO *iocoerce = (CoerceViaIO *) node;
1615 : Oid iofunc;
1616 : bool typisvarlena;
1617 : Oid typioparam;
1618 : FunctionCallInfo fcinfo_in;
1619 :
1620 : /* evaluate argument into step's result area */
1621 19261 : ExecInitExprRec(iocoerce->arg, state, resv, resnull);
1622 :
1623 : /*
1624 : * Prepare both output and input function calls, to be
1625 : * evaluated inside a single evaluation step for speed - this
1626 : * can be a very common operation.
1627 : *
1628 : * We don't check permissions here as a type's input/output
1629 : * function are assumed to be executable by everyone.
1630 : */
1631 19261 : if (state->escontext == NULL)
1632 19261 : scratch.opcode = EEOP_IOCOERCE;
1633 : else
1634 0 : scratch.opcode = EEOP_IOCOERCE_SAFE;
1635 :
1636 : /* lookup the source type's output function */
1637 19261 : scratch.d.iocoerce.finfo_out = palloc0_object(FmgrInfo);
1638 19261 : scratch.d.iocoerce.fcinfo_data_out = palloc0(SizeForFunctionCallInfo(1));
1639 :
1640 19261 : getTypeOutputInfo(exprType((Node *) iocoerce->arg),
1641 : &iofunc, &typisvarlena);
1642 19261 : fmgr_info(iofunc, scratch.d.iocoerce.finfo_out);
1643 19261 : fmgr_info_set_expr((Node *) node, scratch.d.iocoerce.finfo_out);
1644 19261 : InitFunctionCallInfoData(*scratch.d.iocoerce.fcinfo_data_out,
1645 : scratch.d.iocoerce.finfo_out,
1646 : 1, InvalidOid, NULL, NULL);
1647 :
1648 : /* lookup the result type's input function */
1649 19261 : scratch.d.iocoerce.finfo_in = palloc0_object(FmgrInfo);
1650 19261 : scratch.d.iocoerce.fcinfo_data_in = palloc0(SizeForFunctionCallInfo(3));
1651 :
1652 19261 : getTypeInputInfo(iocoerce->resulttype,
1653 : &iofunc, &typioparam);
1654 19261 : fmgr_info(iofunc, scratch.d.iocoerce.finfo_in);
1655 19261 : fmgr_info_set_expr((Node *) node, scratch.d.iocoerce.finfo_in);
1656 19261 : InitFunctionCallInfoData(*scratch.d.iocoerce.fcinfo_data_in,
1657 : scratch.d.iocoerce.finfo_in,
1658 : 3, InvalidOid, NULL, NULL);
1659 :
1660 : /*
1661 : * We can preload the second and third arguments for the input
1662 : * function, since they're constants.
1663 : */
1664 19261 : fcinfo_in = scratch.d.iocoerce.fcinfo_data_in;
1665 19261 : fcinfo_in->args[1].value = ObjectIdGetDatum(typioparam);
1666 19261 : fcinfo_in->args[1].isnull = false;
1667 19261 : fcinfo_in->args[2].value = Int32GetDatum(-1);
1668 19261 : fcinfo_in->args[2].isnull = false;
1669 :
1670 19261 : fcinfo_in->context = (Node *) state->escontext;
1671 :
1672 19261 : ExprEvalPushStep(state, &scratch);
1673 19261 : break;
1674 : }
1675 :
1676 2966 : case T_ArrayCoerceExpr:
1677 : {
1678 2966 : ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
1679 : Oid resultelemtype;
1680 : ExprState *elemstate;
1681 :
1682 : /* evaluate argument into step's result area */
1683 2966 : ExecInitExprRec(acoerce->arg, state, resv, resnull);
1684 :
1685 2966 : resultelemtype = get_element_type(acoerce->resulttype);
1686 2966 : if (!OidIsValid(resultelemtype))
1687 0 : ereport(ERROR,
1688 : (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1689 : errmsg("target type is not an array")));
1690 :
1691 : /*
1692 : * Construct a sub-expression for the per-element expression;
1693 : * but don't ready it until after we check it for triviality.
1694 : * We assume it hasn't any Var references, but does have a
1695 : * CaseTestExpr representing the source array element values.
1696 : */
1697 2966 : elemstate = makeNode(ExprState);
1698 2966 : elemstate->expr = acoerce->elemexpr;
1699 2966 : elemstate->parent = state->parent;
1700 2966 : elemstate->ext_params = state->ext_params;
1701 :
1702 2966 : elemstate->innermost_caseval = palloc_object(Datum);
1703 2966 : elemstate->innermost_casenull = palloc_object(bool);
1704 :
1705 2966 : ExecInitExprRec(acoerce->elemexpr, elemstate,
1706 : &elemstate->resvalue, &elemstate->resnull);
1707 :
1708 2963 : if (elemstate->steps_len == 1 &&
1709 2731 : elemstate->steps[0].opcode == EEOP_CASE_TESTVAL)
1710 : {
1711 : /* Trivial, so we need no per-element work at runtime */
1712 2731 : elemstate = NULL;
1713 : }
1714 : else
1715 : {
1716 : /* Not trivial, so append a DONE step */
1717 232 : scratch.opcode = EEOP_DONE_RETURN;
1718 232 : ExprEvalPushStep(elemstate, &scratch);
1719 : /* and ready the subexpression */
1720 232 : ExecReadyExpr(elemstate);
1721 : }
1722 :
1723 2963 : scratch.opcode = EEOP_ARRAYCOERCE;
1724 2963 : scratch.d.arraycoerce.elemexprstate = elemstate;
1725 2963 : scratch.d.arraycoerce.resultelemtype = resultelemtype;
1726 :
1727 2963 : if (elemstate)
1728 : {
1729 : /* Set up workspace for array_map */
1730 232 : scratch.d.arraycoerce.amstate = palloc0_object(ArrayMapState);
1731 : }
1732 : else
1733 : {
1734 : /* Don't need workspace if there's no subexpression */
1735 2731 : scratch.d.arraycoerce.amstate = NULL;
1736 : }
1737 :
1738 2963 : ExprEvalPushStep(state, &scratch);
1739 2963 : break;
1740 : }
1741 :
1742 418 : case T_ConvertRowtypeExpr:
1743 : {
1744 418 : ConvertRowtypeExpr *convert = (ConvertRowtypeExpr *) node;
1745 : ExprEvalRowtypeCache *rowcachep;
1746 :
1747 : /* cache structs must be out-of-line for space reasons */
1748 418 : rowcachep = palloc(2 * sizeof(ExprEvalRowtypeCache));
1749 418 : rowcachep[0].cacheptr = NULL;
1750 418 : rowcachep[1].cacheptr = NULL;
1751 :
1752 : /* evaluate argument into step's result area */
1753 418 : ExecInitExprRec(convert->arg, state, resv, resnull);
1754 :
1755 : /* and push conversion step */
1756 418 : scratch.opcode = EEOP_CONVERT_ROWTYPE;
1757 418 : scratch.d.convert_rowtype.inputtype =
1758 418 : exprType((Node *) convert->arg);
1759 418 : scratch.d.convert_rowtype.outputtype = convert->resulttype;
1760 418 : scratch.d.convert_rowtype.incache = &rowcachep[0];
1761 418 : scratch.d.convert_rowtype.outcache = &rowcachep[1];
1762 418 : scratch.d.convert_rowtype.map = NULL;
1763 :
1764 418 : ExprEvalPushStep(state, &scratch);
1765 418 : break;
1766 : }
1767 :
1768 : /* note that CaseWhen expressions are handled within this block */
1769 53459 : case T_CaseExpr:
1770 : {
1771 53459 : CaseExpr *caseExpr = (CaseExpr *) node;
1772 53459 : List *adjust_jumps = NIL;
1773 53459 : Datum *caseval = NULL;
1774 53459 : bool *casenull = NULL;
1775 : ListCell *lc;
1776 :
1777 : /*
1778 : * If there's a test expression, we have to evaluate it and
1779 : * save the value where the CaseTestExpr placeholders can find
1780 : * it.
1781 : */
1782 53459 : if (caseExpr->arg != NULL)
1783 : {
1784 : /* Evaluate testexpr into caseval/casenull workspace */
1785 2360 : caseval = palloc_object(Datum);
1786 2360 : casenull = palloc_object(bool);
1787 :
1788 2360 : ExecInitExprRec(caseExpr->arg, state,
1789 : caseval, casenull);
1790 :
1791 : /*
1792 : * Since value might be read multiple times, force to R/O
1793 : * - but only if it could be an expanded datum.
1794 : */
1795 2360 : if (get_typlen(exprType((Node *) caseExpr->arg)) == -1)
1796 : {
1797 : /* change caseval in-place */
1798 39 : scratch.opcode = EEOP_MAKE_READONLY;
1799 39 : scratch.resvalue = caseval;
1800 39 : scratch.resnull = casenull;
1801 39 : scratch.d.make_readonly.value = caseval;
1802 39 : scratch.d.make_readonly.isnull = casenull;
1803 39 : ExprEvalPushStep(state, &scratch);
1804 : /* restore normal settings of scratch fields */
1805 39 : scratch.resvalue = resv;
1806 39 : scratch.resnull = resnull;
1807 : }
1808 : }
1809 :
1810 : /*
1811 : * Prepare to evaluate each of the WHEN clauses in turn; as
1812 : * soon as one is true we return the value of the
1813 : * corresponding THEN clause. If none are true then we return
1814 : * the value of the ELSE clause, or NULL if there is none.
1815 : */
1816 149729 : foreach(lc, caseExpr->args)
1817 : {
1818 96270 : CaseWhen *when = (CaseWhen *) lfirst(lc);
1819 : Datum *save_innermost_caseval;
1820 : bool *save_innermost_casenull;
1821 : int whenstep;
1822 :
1823 : /*
1824 : * Make testexpr result available to CaseTestExpr nodes
1825 : * within the condition. We must save and restore prior
1826 : * setting of innermost_caseval fields, in case this node
1827 : * is itself within a larger CASE.
1828 : *
1829 : * If there's no test expression, we don't actually need
1830 : * to save and restore these fields; but it's less code to
1831 : * just do so unconditionally.
1832 : */
1833 96270 : save_innermost_caseval = state->innermost_caseval;
1834 96270 : save_innermost_casenull = state->innermost_casenull;
1835 96270 : state->innermost_caseval = caseval;
1836 96270 : state->innermost_casenull = casenull;
1837 :
1838 : /* evaluate condition into CASE's result variables */
1839 96270 : ExecInitExprRec(when->expr, state, resv, resnull);
1840 :
1841 96270 : state->innermost_caseval = save_innermost_caseval;
1842 96270 : state->innermost_casenull = save_innermost_casenull;
1843 :
1844 : /* If WHEN result isn't true, jump to next CASE arm */
1845 96270 : scratch.opcode = EEOP_JUMP_IF_NOT_TRUE;
1846 96270 : scratch.d.jump.jumpdone = -1; /* computed later */
1847 96270 : ExprEvalPushStep(state, &scratch);
1848 96270 : whenstep = state->steps_len - 1;
1849 :
1850 : /*
1851 : * If WHEN result is true, evaluate THEN result, storing
1852 : * it into the CASE's result variables.
1853 : */
1854 96270 : ExecInitExprRec(when->result, state, resv, resnull);
1855 :
1856 : /* Emit JUMP step to jump to end of CASE's code */
1857 96270 : scratch.opcode = EEOP_JUMP;
1858 96270 : scratch.d.jump.jumpdone = -1; /* computed later */
1859 96270 : ExprEvalPushStep(state, &scratch);
1860 :
1861 : /*
1862 : * Don't know address for that jump yet, compute once the
1863 : * whole CASE expression is built.
1864 : */
1865 96270 : adjust_jumps = lappend_int(adjust_jumps,
1866 96270 : state->steps_len - 1);
1867 :
1868 : /*
1869 : * But we can set WHEN test's jump target now, to make it
1870 : * jump to the next WHEN subexpression or the ELSE.
1871 : */
1872 96270 : state->steps[whenstep].d.jump.jumpdone = state->steps_len;
1873 : }
1874 :
1875 : /* transformCaseExpr always adds a default */
1876 : Assert(caseExpr->defresult);
1877 :
1878 : /* evaluate ELSE expr into CASE's result variables */
1879 53459 : ExecInitExprRec(caseExpr->defresult, state,
1880 : resv, resnull);
1881 :
1882 : /* adjust jump targets */
1883 149729 : foreach(lc, adjust_jumps)
1884 : {
1885 96270 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
1886 :
1887 : Assert(as->opcode == EEOP_JUMP);
1888 : Assert(as->d.jump.jumpdone == -1);
1889 96270 : as->d.jump.jumpdone = state->steps_len;
1890 : }
1891 :
1892 53459 : break;
1893 : }
1894 :
1895 13107 : case T_CaseTestExpr:
1896 : {
1897 : /*
1898 : * Read from location identified by innermost_caseval. Note
1899 : * that innermost_caseval could be NULL, if this node isn't
1900 : * actually within a CaseExpr, ArrayCoerceExpr, etc structure.
1901 : * That can happen because some parts of the system abuse
1902 : * CaseTestExpr to cause a read of a value externally supplied
1903 : * in econtext->caseValue_datum. We'll take care of that by
1904 : * generating a specialized operation.
1905 : */
1906 13107 : if (state->innermost_caseval == NULL)
1907 749 : scratch.opcode = EEOP_CASE_TESTVAL_EXT;
1908 : else
1909 : {
1910 12358 : scratch.opcode = EEOP_CASE_TESTVAL;
1911 12358 : scratch.d.casetest.value = state->innermost_caseval;
1912 12358 : scratch.d.casetest.isnull = state->innermost_casenull;
1913 : }
1914 13107 : ExprEvalPushStep(state, &scratch);
1915 13107 : break;
1916 : }
1917 :
1918 14755 : case T_ArrayExpr:
1919 : {
1920 14755 : ArrayExpr *arrayexpr = (ArrayExpr *) node;
1921 14755 : int nelems = list_length(arrayexpr->elements);
1922 : ListCell *lc;
1923 : int elemoff;
1924 :
1925 : /*
1926 : * Evaluate by computing each element, and then forming the
1927 : * array. Elements are computed into scratch arrays
1928 : * associated with the ARRAYEXPR step.
1929 : */
1930 14755 : scratch.opcode = EEOP_ARRAYEXPR;
1931 14755 : scratch.d.arrayexpr.elemvalues =
1932 14755 : palloc_array(Datum, nelems);
1933 14755 : scratch.d.arrayexpr.elemnulls =
1934 14755 : palloc_array(bool, nelems);
1935 14755 : scratch.d.arrayexpr.nelems = nelems;
1936 :
1937 : /* fill remaining fields of step */
1938 14755 : scratch.d.arrayexpr.multidims = arrayexpr->multidims;
1939 14755 : scratch.d.arrayexpr.elemtype = arrayexpr->element_typeid;
1940 :
1941 : /* do one-time catalog lookup for type info */
1942 14755 : get_typlenbyvalalign(arrayexpr->element_typeid,
1943 : &scratch.d.arrayexpr.elemlength,
1944 : &scratch.d.arrayexpr.elembyval,
1945 : &scratch.d.arrayexpr.elemalign);
1946 :
1947 : /* prepare to evaluate all arguments */
1948 14755 : elemoff = 0;
1949 55108 : foreach(lc, arrayexpr->elements)
1950 : {
1951 40353 : Expr *e = (Expr *) lfirst(lc);
1952 :
1953 40353 : ExecInitExprRec(e, state,
1954 40353 : &scratch.d.arrayexpr.elemvalues[elemoff],
1955 40353 : &scratch.d.arrayexpr.elemnulls[elemoff]);
1956 40353 : elemoff++;
1957 : }
1958 :
1959 : /* and then collect all into an array */
1960 14755 : ExprEvalPushStep(state, &scratch);
1961 14755 : break;
1962 : }
1963 :
1964 2848 : case T_RowExpr:
1965 : {
1966 2848 : RowExpr *rowexpr = (RowExpr *) node;
1967 2848 : int nelems = list_length(rowexpr->args);
1968 : TupleDesc tupdesc;
1969 : int i;
1970 : ListCell *l;
1971 :
1972 : /* Build tupdesc to describe result tuples */
1973 2848 : if (rowexpr->row_typeid == RECORDOID)
1974 : {
1975 : /* generic record, use types of given expressions */
1976 1509 : tupdesc = ExecTypeFromExprList(rowexpr->args);
1977 : /* ... but adopt RowExpr's column aliases */
1978 1509 : ExecTypeSetColNames(tupdesc, rowexpr->colnames);
1979 : /* Bless the tupdesc so it can be looked up later */
1980 1509 : BlessTupleDesc(tupdesc);
1981 : }
1982 : else
1983 : {
1984 : /* it's been cast to a named type, use that */
1985 1339 : tupdesc = lookup_rowtype_tupdesc_copy(rowexpr->row_typeid, -1);
1986 : }
1987 :
1988 : /*
1989 : * In the named-type case, the tupdesc could have more columns
1990 : * than are in the args list, since the type might have had
1991 : * columns added since the ROW() was parsed. We want those
1992 : * extra columns to go to nulls, so we make sure that the
1993 : * workspace arrays are large enough and then initialize any
1994 : * extra columns to read as NULLs.
1995 : */
1996 : Assert(nelems <= tupdesc->natts);
1997 2848 : nelems = Max(nelems, tupdesc->natts);
1998 :
1999 : /*
2000 : * Evaluate by first building datums for each field, and then
2001 : * a final step forming the composite datum.
2002 : */
2003 2848 : scratch.opcode = EEOP_ROW;
2004 2848 : scratch.d.row.tupdesc = tupdesc;
2005 :
2006 : /* space for the individual field datums */
2007 2848 : scratch.d.row.elemvalues =
2008 2848 : palloc_array(Datum, nelems);
2009 2848 : scratch.d.row.elemnulls =
2010 2848 : palloc_array(bool, nelems);
2011 : /* as explained above, make sure any extra columns are null */
2012 2848 : memset(scratch.d.row.elemnulls, true, sizeof(bool) * nelems);
2013 :
2014 : /* Set up evaluation, skipping any deleted columns */
2015 2848 : i = 0;
2016 10344 : foreach(l, rowexpr->args)
2017 : {
2018 7499 : Form_pg_attribute att = TupleDescAttr(tupdesc, i);
2019 7499 : Expr *e = (Expr *) lfirst(l);
2020 :
2021 7499 : if (!att->attisdropped)
2022 : {
2023 : /*
2024 : * Guard against ALTER COLUMN TYPE on rowtype since
2025 : * the RowExpr was created. XXX should we check
2026 : * typmod too? Not sure we can be sure it'll be the
2027 : * same.
2028 : */
2029 7490 : if (exprType((Node *) e) != att->atttypid)
2030 3 : ereport(ERROR,
2031 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2032 : errmsg("ROW() column has type %s instead of type %s",
2033 : format_type_be(exprType((Node *) e)),
2034 : format_type_be(att->atttypid))));
2035 : }
2036 : else
2037 : {
2038 : /*
2039 : * Ignore original expression and insert a NULL. We
2040 : * don't really care what type of NULL it is, so
2041 : * always make an int4 NULL.
2042 : */
2043 9 : e = (Expr *) makeNullConst(INT4OID, -1, InvalidOid);
2044 : }
2045 :
2046 : /* Evaluate column expr into appropriate workspace slot */
2047 7496 : ExecInitExprRec(e, state,
2048 7496 : &scratch.d.row.elemvalues[i],
2049 7496 : &scratch.d.row.elemnulls[i]);
2050 7496 : i++;
2051 : }
2052 :
2053 : /* And finally build the row value */
2054 2845 : ExprEvalPushStep(state, &scratch);
2055 2845 : break;
2056 : }
2057 :
2058 132 : case T_RowCompareExpr:
2059 : {
2060 132 : RowCompareExpr *rcexpr = (RowCompareExpr *) node;
2061 132 : int nopers = list_length(rcexpr->opnos);
2062 132 : List *adjust_jumps = NIL;
2063 : ListCell *l_left_expr,
2064 : *l_right_expr,
2065 : *l_opno,
2066 : *l_opfamily,
2067 : *l_inputcollid;
2068 : ListCell *lc;
2069 :
2070 : /*
2071 : * Iterate over each field, prepare comparisons. To handle
2072 : * NULL results, prepare jumps to after the expression. If a
2073 : * comparison yields a != 0 result, jump to the final step.
2074 : */
2075 : Assert(list_length(rcexpr->largs) == nopers);
2076 : Assert(list_length(rcexpr->rargs) == nopers);
2077 : Assert(list_length(rcexpr->opfamilies) == nopers);
2078 : Assert(list_length(rcexpr->inputcollids) == nopers);
2079 :
2080 423 : forfive(l_left_expr, rcexpr->largs,
2081 : l_right_expr, rcexpr->rargs,
2082 : l_opno, rcexpr->opnos,
2083 : l_opfamily, rcexpr->opfamilies,
2084 : l_inputcollid, rcexpr->inputcollids)
2085 : {
2086 291 : Expr *left_expr = (Expr *) lfirst(l_left_expr);
2087 291 : Expr *right_expr = (Expr *) lfirst(l_right_expr);
2088 291 : Oid opno = lfirst_oid(l_opno);
2089 291 : Oid opfamily = lfirst_oid(l_opfamily);
2090 291 : Oid inputcollid = lfirst_oid(l_inputcollid);
2091 : int strategy;
2092 : Oid lefttype;
2093 : Oid righttype;
2094 : Oid proc;
2095 : FmgrInfo *finfo;
2096 : FunctionCallInfo fcinfo;
2097 :
2098 291 : get_op_opfamily_properties(opno, opfamily, false,
2099 : &strategy,
2100 : &lefttype,
2101 : &righttype);
2102 291 : proc = get_opfamily_proc(opfamily,
2103 : lefttype,
2104 : righttype,
2105 : BTORDER_PROC);
2106 291 : if (!OidIsValid(proc))
2107 0 : elog(ERROR, "missing support function %d(%u,%u) in opfamily %u",
2108 : BTORDER_PROC, lefttype, righttype, opfamily);
2109 :
2110 : /* Set up the primary fmgr lookup information */
2111 291 : finfo = palloc0_object(FmgrInfo);
2112 291 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
2113 291 : fmgr_info(proc, finfo);
2114 291 : fmgr_info_set_expr((Node *) node, finfo);
2115 291 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
2116 : inputcollid, NULL, NULL);
2117 :
2118 : /*
2119 : * If we enforced permissions checks on index support
2120 : * functions, we'd need to make a check here. But the
2121 : * index support machinery doesn't do that, and thus
2122 : * neither does this code.
2123 : */
2124 :
2125 : /* evaluate left and right args directly into fcinfo */
2126 291 : ExecInitExprRec(left_expr, state,
2127 : &fcinfo->args[0].value, &fcinfo->args[0].isnull);
2128 291 : ExecInitExprRec(right_expr, state,
2129 : &fcinfo->args[1].value, &fcinfo->args[1].isnull);
2130 :
2131 291 : scratch.opcode = EEOP_ROWCOMPARE_STEP;
2132 291 : scratch.d.rowcompare_step.finfo = finfo;
2133 291 : scratch.d.rowcompare_step.fcinfo_data = fcinfo;
2134 291 : scratch.d.rowcompare_step.fn_addr = finfo->fn_addr;
2135 : /* jump targets filled below */
2136 291 : scratch.d.rowcompare_step.jumpnull = -1;
2137 291 : scratch.d.rowcompare_step.jumpdone = -1;
2138 :
2139 291 : ExprEvalPushStep(state, &scratch);
2140 291 : adjust_jumps = lappend_int(adjust_jumps,
2141 291 : state->steps_len - 1);
2142 : }
2143 :
2144 : /*
2145 : * We could have a zero-column rowtype, in which case the rows
2146 : * necessarily compare equal.
2147 : */
2148 132 : if (nopers == 0)
2149 : {
2150 0 : scratch.opcode = EEOP_CONST;
2151 0 : scratch.d.constval.value = Int32GetDatum(0);
2152 0 : scratch.d.constval.isnull = false;
2153 0 : ExprEvalPushStep(state, &scratch);
2154 : }
2155 :
2156 : /* Finally, examine the last comparison result */
2157 132 : scratch.opcode = EEOP_ROWCOMPARE_FINAL;
2158 132 : scratch.d.rowcompare_final.cmptype = rcexpr->cmptype;
2159 132 : ExprEvalPushStep(state, &scratch);
2160 :
2161 : /* adjust jump targets */
2162 423 : foreach(lc, adjust_jumps)
2163 : {
2164 291 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
2165 :
2166 : Assert(as->opcode == EEOP_ROWCOMPARE_STEP);
2167 : Assert(as->d.rowcompare_step.jumpdone == -1);
2168 : Assert(as->d.rowcompare_step.jumpnull == -1);
2169 :
2170 : /* jump to comparison evaluation */
2171 291 : as->d.rowcompare_step.jumpdone = state->steps_len - 1;
2172 : /* jump to the following expression */
2173 291 : as->d.rowcompare_step.jumpnull = state->steps_len;
2174 : }
2175 :
2176 132 : break;
2177 : }
2178 :
2179 1883 : case T_CoalesceExpr:
2180 : {
2181 1883 : CoalesceExpr *coalesce = (CoalesceExpr *) node;
2182 1883 : List *adjust_jumps = NIL;
2183 : ListCell *lc;
2184 :
2185 : /* We assume there's at least one arg */
2186 : Assert(coalesce->args != NIL);
2187 :
2188 : /*
2189 : * Prepare evaluation of all coalesced arguments, after each
2190 : * one push a step that short-circuits if not null.
2191 : */
2192 5655 : foreach(lc, coalesce->args)
2193 : {
2194 3772 : Expr *e = (Expr *) lfirst(lc);
2195 :
2196 : /* evaluate argument, directly into result datum */
2197 3772 : ExecInitExprRec(e, state, resv, resnull);
2198 :
2199 : /* if it's not null, skip to end of COALESCE expr */
2200 3772 : scratch.opcode = EEOP_JUMP_IF_NOT_NULL;
2201 3772 : scratch.d.jump.jumpdone = -1; /* adjust later */
2202 3772 : ExprEvalPushStep(state, &scratch);
2203 :
2204 3772 : adjust_jumps = lappend_int(adjust_jumps,
2205 3772 : state->steps_len - 1);
2206 : }
2207 :
2208 : /*
2209 : * No need to add a constant NULL return - we only can get to
2210 : * the end of the expression if a NULL already is being
2211 : * returned.
2212 : */
2213 :
2214 : /* adjust jump targets */
2215 5655 : foreach(lc, adjust_jumps)
2216 : {
2217 3772 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
2218 :
2219 : Assert(as->opcode == EEOP_JUMP_IF_NOT_NULL);
2220 : Assert(as->d.jump.jumpdone == -1);
2221 3772 : as->d.jump.jumpdone = state->steps_len;
2222 : }
2223 :
2224 1883 : break;
2225 : }
2226 :
2227 1232 : case T_MinMaxExpr:
2228 : {
2229 1232 : MinMaxExpr *minmaxexpr = (MinMaxExpr *) node;
2230 1232 : int nelems = list_length(minmaxexpr->args);
2231 : TypeCacheEntry *typentry;
2232 : FmgrInfo *finfo;
2233 : FunctionCallInfo fcinfo;
2234 : ListCell *lc;
2235 : int off;
2236 :
2237 : /* Look up the btree comparison function for the datatype */
2238 1232 : typentry = lookup_type_cache(minmaxexpr->minmaxtype,
2239 : TYPECACHE_CMP_PROC);
2240 1232 : if (!OidIsValid(typentry->cmp_proc))
2241 0 : ereport(ERROR,
2242 : (errcode(ERRCODE_UNDEFINED_FUNCTION),
2243 : errmsg("could not identify a comparison function for type %s",
2244 : format_type_be(minmaxexpr->minmaxtype))));
2245 :
2246 : /*
2247 : * If we enforced permissions checks on index support
2248 : * functions, we'd need to make a check here. But the index
2249 : * support machinery doesn't do that, and thus neither does
2250 : * this code.
2251 : */
2252 :
2253 : /* Perform function lookup */
2254 1232 : finfo = palloc0_object(FmgrInfo);
2255 1232 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
2256 1232 : fmgr_info(typentry->cmp_proc, finfo);
2257 1232 : fmgr_info_set_expr((Node *) node, finfo);
2258 1232 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
2259 : minmaxexpr->inputcollid, NULL, NULL);
2260 :
2261 1232 : scratch.opcode = EEOP_MINMAX;
2262 : /* allocate space to store arguments */
2263 1232 : scratch.d.minmax.values = palloc_array(Datum, nelems);
2264 1232 : scratch.d.minmax.nulls = palloc_array(bool, nelems);
2265 1232 : scratch.d.minmax.nelems = nelems;
2266 :
2267 1232 : scratch.d.minmax.op = minmaxexpr->op;
2268 1232 : scratch.d.minmax.finfo = finfo;
2269 1232 : scratch.d.minmax.fcinfo_data = fcinfo;
2270 :
2271 : /* evaluate expressions into minmax->values/nulls */
2272 1232 : off = 0;
2273 3750 : foreach(lc, minmaxexpr->args)
2274 : {
2275 2518 : Expr *e = (Expr *) lfirst(lc);
2276 :
2277 2518 : ExecInitExprRec(e, state,
2278 2518 : &scratch.d.minmax.values[off],
2279 2518 : &scratch.d.minmax.nulls[off]);
2280 2518 : off++;
2281 : }
2282 :
2283 : /* and push the final comparison */
2284 1232 : ExprEvalPushStep(state, &scratch);
2285 1232 : break;
2286 : }
2287 :
2288 2804 : case T_SQLValueFunction:
2289 : {
2290 2804 : SQLValueFunction *svf = (SQLValueFunction *) node;
2291 :
2292 2804 : scratch.opcode = EEOP_SQLVALUEFUNCTION;
2293 2804 : scratch.d.sqlvaluefunction.svf = svf;
2294 :
2295 2804 : ExprEvalPushStep(state, &scratch);
2296 2804 : break;
2297 : }
2298 :
2299 351 : case T_XmlExpr:
2300 : {
2301 351 : XmlExpr *xexpr = (XmlExpr *) node;
2302 351 : int nnamed = list_length(xexpr->named_args);
2303 351 : int nargs = list_length(xexpr->args);
2304 : int off;
2305 : ListCell *arg;
2306 :
2307 351 : scratch.opcode = EEOP_XMLEXPR;
2308 351 : scratch.d.xmlexpr.xexpr = xexpr;
2309 :
2310 : /* allocate space for storing all the arguments */
2311 351 : if (nnamed)
2312 : {
2313 30 : scratch.d.xmlexpr.named_argvalue = palloc_array(Datum, nnamed);
2314 30 : scratch.d.xmlexpr.named_argnull = palloc_array(bool, nnamed);
2315 : }
2316 : else
2317 : {
2318 321 : scratch.d.xmlexpr.named_argvalue = NULL;
2319 321 : scratch.d.xmlexpr.named_argnull = NULL;
2320 : }
2321 :
2322 351 : if (nargs)
2323 : {
2324 309 : scratch.d.xmlexpr.argvalue = palloc_array(Datum, nargs);
2325 309 : scratch.d.xmlexpr.argnull = palloc_array(bool, nargs);
2326 : }
2327 : else
2328 : {
2329 42 : scratch.d.xmlexpr.argvalue = NULL;
2330 42 : scratch.d.xmlexpr.argnull = NULL;
2331 : }
2332 :
2333 : /* prepare argument execution */
2334 351 : off = 0;
2335 435 : foreach(arg, xexpr->named_args)
2336 : {
2337 84 : Expr *e = (Expr *) lfirst(arg);
2338 :
2339 84 : ExecInitExprRec(e, state,
2340 84 : &scratch.d.xmlexpr.named_argvalue[off],
2341 84 : &scratch.d.xmlexpr.named_argnull[off]);
2342 84 : off++;
2343 : }
2344 :
2345 351 : off = 0;
2346 819 : foreach(arg, xexpr->args)
2347 : {
2348 468 : Expr *e = (Expr *) lfirst(arg);
2349 :
2350 468 : ExecInitExprRec(e, state,
2351 468 : &scratch.d.xmlexpr.argvalue[off],
2352 468 : &scratch.d.xmlexpr.argnull[off]);
2353 468 : off++;
2354 : }
2355 :
2356 : /* and evaluate the actual XML expression */
2357 351 : ExprEvalPushStep(state, &scratch);
2358 351 : break;
2359 : }
2360 :
2361 114 : case T_JsonValueExpr:
2362 : {
2363 114 : JsonValueExpr *jve = (JsonValueExpr *) node;
2364 :
2365 : Assert(jve->raw_expr != NULL);
2366 114 : ExecInitExprRec(jve->raw_expr, state, resv, resnull);
2367 : Assert(jve->formatted_expr != NULL);
2368 114 : ExecInitExprRec(jve->formatted_expr, state, resv, resnull);
2369 114 : break;
2370 : }
2371 :
2372 683 : case T_JsonConstructorExpr:
2373 : {
2374 683 : JsonConstructorExpr *ctor = (JsonConstructorExpr *) node;
2375 683 : List *args = ctor->args;
2376 : ListCell *lc;
2377 683 : int nargs = list_length(args);
2378 683 : int argno = 0;
2379 :
2380 683 : if (ctor->func)
2381 : {
2382 210 : ExecInitExprRec(ctor->func, state, resv, resnull);
2383 : }
2384 473 : else if ((ctor->type == JSCTOR_JSON_PARSE && !ctor->unique) ||
2385 412 : ctor->type == JSCTOR_JSON_SERIALIZE)
2386 : {
2387 : /* Use the value of the first argument as result */
2388 110 : ExecInitExprRec(linitial(args), state, resv, resnull);
2389 : }
2390 : else
2391 : {
2392 : JsonConstructorExprState *jcstate;
2393 :
2394 363 : jcstate = palloc0_object(JsonConstructorExprState);
2395 :
2396 363 : scratch.opcode = EEOP_JSON_CONSTRUCTOR;
2397 363 : scratch.d.json_constructor.jcstate = jcstate;
2398 :
2399 363 : jcstate->constructor = ctor;
2400 363 : jcstate->arg_values = palloc_array(Datum, nargs);
2401 363 : jcstate->arg_nulls = palloc_array(bool, nargs);
2402 363 : jcstate->arg_types = palloc_array(Oid, nargs);
2403 363 : jcstate->nargs = nargs;
2404 :
2405 1139 : foreach(lc, args)
2406 : {
2407 776 : Expr *arg = (Expr *) lfirst(lc);
2408 :
2409 776 : jcstate->arg_types[argno] = exprType((Node *) arg);
2410 :
2411 776 : if (IsA(arg, Const))
2412 : {
2413 : /* Don't evaluate const arguments every round */
2414 707 : Const *con = (Const *) arg;
2415 :
2416 707 : jcstate->arg_values[argno] = con->constvalue;
2417 707 : jcstate->arg_nulls[argno] = con->constisnull;
2418 : }
2419 : else
2420 : {
2421 69 : ExecInitExprRec(arg, state,
2422 69 : &jcstate->arg_values[argno],
2423 69 : &jcstate->arg_nulls[argno]);
2424 : }
2425 776 : argno++;
2426 : }
2427 :
2428 : /* prepare type cache for datum_to_json[b]() */
2429 363 : if (ctor->type == JSCTOR_JSON_SCALAR)
2430 : {
2431 56 : bool is_jsonb =
2432 56 : ctor->returning->format->format_type == JS_FORMAT_JSONB;
2433 :
2434 56 : jcstate->arg_type_cache =
2435 56 : palloc(sizeof(*jcstate->arg_type_cache) * nargs);
2436 :
2437 112 : for (int i = 0; i < nargs; i++)
2438 : {
2439 : JsonTypeCategory category;
2440 : Oid outfuncid;
2441 56 : Oid typid = jcstate->arg_types[i];
2442 :
2443 56 : json_categorize_type(typid, is_jsonb,
2444 : &category, &outfuncid);
2445 :
2446 56 : jcstate->arg_type_cache[i].outfuncid = outfuncid;
2447 56 : jcstate->arg_type_cache[i].category = (int) category;
2448 : }
2449 : }
2450 :
2451 363 : ExprEvalPushStep(state, &scratch);
2452 : }
2453 :
2454 683 : if (ctor->coercion)
2455 : {
2456 187 : Datum *innermost_caseval = state->innermost_caseval;
2457 187 : bool *innermost_isnull = state->innermost_casenull;
2458 :
2459 187 : state->innermost_caseval = resv;
2460 187 : state->innermost_casenull = resnull;
2461 :
2462 187 : ExecInitExprRec(ctor->coercion, state, resv, resnull);
2463 :
2464 187 : state->innermost_caseval = innermost_caseval;
2465 187 : state->innermost_casenull = innermost_isnull;
2466 : }
2467 : }
2468 683 : break;
2469 :
2470 175 : case T_JsonIsPredicate:
2471 : {
2472 175 : JsonIsPredicate *pred = (JsonIsPredicate *) node;
2473 :
2474 175 : ExecInitExprRec((Expr *) pred->expr, state, resv, resnull);
2475 :
2476 175 : scratch.opcode = EEOP_IS_JSON;
2477 175 : scratch.d.is_json.pred = pred;
2478 :
2479 175 : ExprEvalPushStep(state, &scratch);
2480 175 : break;
2481 : }
2482 :
2483 1358 : case T_JsonExpr:
2484 : {
2485 1358 : JsonExpr *jsexpr = castNode(JsonExpr, node);
2486 :
2487 : /*
2488 : * No need to initialize a full JsonExprState For
2489 : * JSON_TABLE(), because the upstream caller tfuncFetchRows()
2490 : * is only interested in the value of formatted_expr.
2491 : */
2492 1358 : if (jsexpr->op == JSON_TABLE_OP)
2493 202 : ExecInitExprRec((Expr *) jsexpr->formatted_expr, state,
2494 : resv, resnull);
2495 : else
2496 1156 : ExecInitJsonExpr(jsexpr, state, resv, resnull, &scratch);
2497 1358 : break;
2498 : }
2499 :
2500 14753 : case T_NullTest:
2501 : {
2502 14753 : NullTest *ntest = (NullTest *) node;
2503 :
2504 14753 : if (ntest->nulltesttype == IS_NULL)
2505 : {
2506 3976 : if (ntest->argisrow)
2507 114 : scratch.opcode = EEOP_NULLTEST_ROWISNULL;
2508 : else
2509 3862 : scratch.opcode = EEOP_NULLTEST_ISNULL;
2510 : }
2511 10777 : else if (ntest->nulltesttype == IS_NOT_NULL)
2512 : {
2513 10777 : if (ntest->argisrow)
2514 122 : scratch.opcode = EEOP_NULLTEST_ROWISNOTNULL;
2515 : else
2516 10655 : scratch.opcode = EEOP_NULLTEST_ISNOTNULL;
2517 : }
2518 : else
2519 : {
2520 0 : elog(ERROR, "unrecognized nulltesttype: %d",
2521 : (int) ntest->nulltesttype);
2522 : }
2523 : /* initialize cache in case it's a row test */
2524 14753 : scratch.d.nulltest_row.rowcache.cacheptr = NULL;
2525 :
2526 : /* first evaluate argument into result variable */
2527 14753 : ExecInitExprRec(ntest->arg, state,
2528 : resv, resnull);
2529 :
2530 : /* then push the test of that argument */
2531 14753 : ExprEvalPushStep(state, &scratch);
2532 14753 : break;
2533 : }
2534 :
2535 744 : case T_BooleanTest:
2536 : {
2537 744 : BooleanTest *btest = (BooleanTest *) node;
2538 :
2539 : /*
2540 : * Evaluate argument, directly into result datum. That's ok,
2541 : * because resv/resnull is definitely not used anywhere else,
2542 : * and will get overwritten by the below EEOP_BOOLTEST_IS_*
2543 : * step.
2544 : */
2545 744 : ExecInitExprRec(btest->arg, state, resv, resnull);
2546 :
2547 744 : switch (btest->booltesttype)
2548 : {
2549 250 : case IS_TRUE:
2550 250 : scratch.opcode = EEOP_BOOLTEST_IS_TRUE;
2551 250 : break;
2552 198 : case IS_NOT_TRUE:
2553 198 : scratch.opcode = EEOP_BOOLTEST_IS_NOT_TRUE;
2554 198 : break;
2555 119 : case IS_FALSE:
2556 119 : scratch.opcode = EEOP_BOOLTEST_IS_FALSE;
2557 119 : break;
2558 85 : case IS_NOT_FALSE:
2559 85 : scratch.opcode = EEOP_BOOLTEST_IS_NOT_FALSE;
2560 85 : break;
2561 35 : case IS_UNKNOWN:
2562 : /* Same as scalar IS NULL test */
2563 35 : scratch.opcode = EEOP_NULLTEST_ISNULL;
2564 35 : break;
2565 57 : case IS_NOT_UNKNOWN:
2566 : /* Same as scalar IS NOT NULL test */
2567 57 : scratch.opcode = EEOP_NULLTEST_ISNOTNULL;
2568 57 : break;
2569 0 : default:
2570 0 : elog(ERROR, "unrecognized booltesttype: %d",
2571 : (int) btest->booltesttype);
2572 : }
2573 :
2574 744 : ExprEvalPushStep(state, &scratch);
2575 744 : break;
2576 : }
2577 :
2578 4910 : case T_CoerceToDomain:
2579 : {
2580 4910 : CoerceToDomain *ctest = (CoerceToDomain *) node;
2581 :
2582 4910 : ExecInitCoerceToDomain(&scratch, ctest, state,
2583 : resv, resnull);
2584 4910 : break;
2585 : }
2586 :
2587 6896 : case T_CoerceToDomainValue:
2588 : {
2589 : /*
2590 : * Read from location identified by innermost_domainval. Note
2591 : * that innermost_domainval could be NULL, if we're compiling
2592 : * a standalone domain check rather than one embedded in a
2593 : * larger expression. In that case we must read from
2594 : * econtext->domainValue_datum. We'll take care of that by
2595 : * generating a specialized operation.
2596 : */
2597 6896 : if (state->innermost_domainval == NULL)
2598 1388 : scratch.opcode = EEOP_DOMAIN_TESTVAL_EXT;
2599 : else
2600 : {
2601 5508 : scratch.opcode = EEOP_DOMAIN_TESTVAL;
2602 : /* we share instruction union variant with case testval */
2603 5508 : scratch.d.casetest.value = state->innermost_domainval;
2604 5508 : scratch.d.casetest.isnull = state->innermost_domainnull;
2605 : }
2606 6896 : ExprEvalPushStep(state, &scratch);
2607 6896 : break;
2608 : }
2609 :
2610 1 : case T_CurrentOfExpr:
2611 : {
2612 1 : scratch.opcode = EEOP_CURRENTOFEXPR;
2613 1 : ExprEvalPushStep(state, &scratch);
2614 1 : break;
2615 : }
2616 :
2617 269 : case T_NextValueExpr:
2618 : {
2619 269 : NextValueExpr *nve = (NextValueExpr *) node;
2620 :
2621 269 : scratch.opcode = EEOP_NEXTVALUEEXPR;
2622 269 : scratch.d.nextvalueexpr.seqid = nve->seqid;
2623 269 : scratch.d.nextvalueexpr.seqtypid = nve->typeId;
2624 :
2625 269 : ExprEvalPushStep(state, &scratch);
2626 269 : break;
2627 : }
2628 :
2629 228 : case T_ReturningExpr:
2630 : {
2631 228 : ReturningExpr *rexpr = (ReturningExpr *) node;
2632 : int retstep;
2633 :
2634 : /* Skip expression evaluation if OLD/NEW row doesn't exist */
2635 228 : scratch.opcode = EEOP_RETURNINGEXPR;
2636 228 : scratch.d.returningexpr.nullflag = rexpr->retold ?
2637 : EEO_FLAG_OLD_IS_NULL : EEO_FLAG_NEW_IS_NULL;
2638 228 : scratch.d.returningexpr.jumpdone = -1; /* set below */
2639 228 : ExprEvalPushStep(state, &scratch);
2640 228 : retstep = state->steps_len - 1;
2641 :
2642 : /* Steps to evaluate expression to return */
2643 228 : ExecInitExprRec(rexpr->retexpr, state, resv, resnull);
2644 :
2645 : /* Jump target used if OLD/NEW row doesn't exist */
2646 228 : state->steps[retstep].d.returningexpr.jumpdone = state->steps_len;
2647 :
2648 : /* Update ExprState flags */
2649 228 : if (rexpr->retold)
2650 114 : state->flags |= EEO_FLAG_HAS_OLD;
2651 : else
2652 114 : state->flags |= EEO_FLAG_HAS_NEW;
2653 :
2654 228 : break;
2655 : }
2656 :
2657 0 : default:
2658 0 : elog(ERROR, "unrecognized node type: %d",
2659 : (int) nodeTag(node));
2660 : break;
2661 : }
2662 2719305 : }
2663 :
2664 : /*
2665 : * Add another expression evaluation step to ExprState->steps.
2666 : *
2667 : * Note that this potentially re-allocates es->steps, therefore no pointer
2668 : * into that array may be used while the expression is still being built.
2669 : */
2670 : void
2671 6271867 : ExprEvalPushStep(ExprState *es, const ExprEvalStep *s)
2672 : {
2673 6271867 : if (es->steps_alloc == 0)
2674 : {
2675 1260496 : es->steps_alloc = 16;
2676 1260496 : es->steps = palloc_array(ExprEvalStep, es->steps_alloc);
2677 : }
2678 5011371 : else if (es->steps_alloc == es->steps_len)
2679 : {
2680 48229 : es->steps_alloc *= 2;
2681 48229 : es->steps = repalloc(es->steps,
2682 48229 : sizeof(ExprEvalStep) * es->steps_alloc);
2683 : }
2684 :
2685 6271867 : memcpy(&es->steps[es->steps_len++], s, sizeof(ExprEvalStep));
2686 6271867 : }
2687 :
2688 : /*
2689 : * Perform setup necessary for the evaluation of a function-like expression,
2690 : * appending argument evaluation steps to the steps list in *state, and
2691 : * setting up *scratch so it is ready to be pushed.
2692 : *
2693 : * *scratch is not pushed here, so that callers may override the opcode,
2694 : * which is useful for function-like cases like DISTINCT.
2695 : */
2696 : static void
2697 752209 : ExecInitFunc(ExprEvalStep *scratch, Expr *node, List *args, Oid funcid,
2698 : Oid inputcollid, ExprState *state)
2699 : {
2700 752209 : int nargs = list_length(args);
2701 : AclResult aclresult;
2702 : FmgrInfo *flinfo;
2703 : FunctionCallInfo fcinfo;
2704 : int argno;
2705 : ListCell *lc;
2706 :
2707 : /* Check permission to call function */
2708 752209 : aclresult = object_aclcheck(ProcedureRelationId, funcid, GetUserId(), ACL_EXECUTE);
2709 752209 : if (aclresult != ACLCHECK_OK)
2710 43 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(funcid));
2711 752166 : InvokeFunctionExecuteHook(funcid);
2712 :
2713 : /*
2714 : * Safety check on nargs. Under normal circumstances this should never
2715 : * fail, as parser should check sooner. But possibly it might fail if
2716 : * server has been compiled with FUNC_MAX_ARGS smaller than some functions
2717 : * declared in pg_proc?
2718 : */
2719 752166 : if (nargs > FUNC_MAX_ARGS)
2720 0 : ereport(ERROR,
2721 : (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
2722 : errmsg_plural("cannot pass more than %d argument to a function",
2723 : "cannot pass more than %d arguments to a function",
2724 : FUNC_MAX_ARGS,
2725 : FUNC_MAX_ARGS)));
2726 :
2727 : /* Allocate function lookup data and parameter workspace for this call */
2728 752166 : scratch->d.func.finfo = palloc0_object(FmgrInfo);
2729 752166 : scratch->d.func.fcinfo_data = palloc0(SizeForFunctionCallInfo(nargs));
2730 752166 : flinfo = scratch->d.func.finfo;
2731 752166 : fcinfo = scratch->d.func.fcinfo_data;
2732 :
2733 : /* Set up the primary fmgr lookup information */
2734 752166 : fmgr_info(funcid, flinfo);
2735 752166 : fmgr_info_set_expr((Node *) node, flinfo);
2736 :
2737 : /* Initialize function call parameter structure too */
2738 752166 : InitFunctionCallInfoData(*fcinfo, flinfo,
2739 : nargs, inputcollid, NULL, NULL);
2740 :
2741 : /* Keep extra copies of this info to save an indirection at runtime */
2742 752166 : scratch->d.func.fn_addr = flinfo->fn_addr;
2743 752166 : scratch->d.func.nargs = nargs;
2744 :
2745 : /* We only support non-set functions here */
2746 752166 : if (flinfo->fn_retset)
2747 0 : ereport(ERROR,
2748 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2749 : errmsg("set-valued function called in context that cannot accept a set"),
2750 : state->parent ?
2751 : executor_errposition(state->parent->state,
2752 : exprLocation((Node *) node)) : 0));
2753 :
2754 : /* Build code to evaluate arguments directly into the fcinfo struct */
2755 752166 : argno = 0;
2756 2044971 : foreach(lc, args)
2757 : {
2758 1292805 : Expr *arg = (Expr *) lfirst(lc);
2759 :
2760 1292805 : if (IsA(arg, Const))
2761 : {
2762 : /*
2763 : * Don't evaluate const arguments every round; especially
2764 : * interesting for constants in comparisons.
2765 : */
2766 518231 : Const *con = (Const *) arg;
2767 :
2768 518231 : fcinfo->args[argno].value = con->constvalue;
2769 518231 : fcinfo->args[argno].isnull = con->constisnull;
2770 : }
2771 : else
2772 : {
2773 774574 : ExecInitExprRec(arg, state,
2774 : &fcinfo->args[argno].value,
2775 : &fcinfo->args[argno].isnull);
2776 : }
2777 1292805 : argno++;
2778 : }
2779 :
2780 : /* Insert appropriate opcode depending on strictness and stats level */
2781 752166 : if (pgstat_track_functions <= flinfo->fn_stats)
2782 : {
2783 752059 : if (flinfo->fn_strict && nargs > 0)
2784 : {
2785 : /* Choose nargs optimized implementation if available. */
2786 673994 : if (nargs == 1)
2787 134972 : scratch->opcode = EEOP_FUNCEXPR_STRICT_1;
2788 539022 : else if (nargs == 2)
2789 520372 : scratch->opcode = EEOP_FUNCEXPR_STRICT_2;
2790 : else
2791 18650 : scratch->opcode = EEOP_FUNCEXPR_STRICT;
2792 : }
2793 : else
2794 78065 : scratch->opcode = EEOP_FUNCEXPR;
2795 : }
2796 : else
2797 : {
2798 107 : if (flinfo->fn_strict && nargs > 0)
2799 3 : scratch->opcode = EEOP_FUNCEXPR_STRICT_FUSAGE;
2800 : else
2801 104 : scratch->opcode = EEOP_FUNCEXPR_FUSAGE;
2802 : }
2803 752166 : }
2804 :
2805 : /*
2806 : * Append the steps necessary for the evaluation of a SubPlan node to
2807 : * ExprState->steps.
2808 : *
2809 : * subplan - SubPlan expression to evaluate
2810 : * state - ExprState to whose ->steps to append the necessary operations
2811 : * resv / resnull - where to store the result of the node into
2812 : */
2813 : static void
2814 14834 : ExecInitSubPlanExpr(SubPlan *subplan,
2815 : ExprState *state,
2816 : Datum *resv, bool *resnull)
2817 : {
2818 14834 : ExprEvalStep scratch = {0};
2819 : SubPlanState *sstate;
2820 : ListCell *pvar;
2821 : ListCell *l;
2822 :
2823 14834 : if (!state->parent)
2824 0 : elog(ERROR, "SubPlan found with no parent plan");
2825 :
2826 : /*
2827 : * Generate steps to evaluate input arguments for the subplan.
2828 : *
2829 : * We evaluate the argument expressions into resv/resnull, and then use
2830 : * PARAM_SET to update the parameter. We do that, instead of evaluating
2831 : * directly into the param, to avoid depending on the pointer value
2832 : * remaining stable / being included in the generated expression. It's ok
2833 : * to use resv/resnull for multiple params, as each parameter evaluation
2834 : * is immediately followed by an EEOP_PARAM_SET (and thus are saved before
2835 : * they could be overwritten again).
2836 : *
2837 : * Any calculation we have to do can be done in the parent econtext, since
2838 : * the Param values don't need to have per-query lifetime.
2839 : */
2840 : Assert(list_length(subplan->parParam) == list_length(subplan->args));
2841 37380 : forboth(l, subplan->parParam, pvar, subplan->args)
2842 : {
2843 22546 : int paramid = lfirst_int(l);
2844 22546 : Expr *arg = (Expr *) lfirst(pvar);
2845 :
2846 22546 : ExecInitExprRec(arg, state, resv, resnull);
2847 :
2848 22546 : scratch.opcode = EEOP_PARAM_SET;
2849 22546 : scratch.resvalue = resv;
2850 22546 : scratch.resnull = resnull;
2851 22546 : scratch.d.param.paramid = paramid;
2852 : /* paramtype's not actually used, but we might as well fill it */
2853 22546 : scratch.d.param.paramtype = exprType((Node *) arg);
2854 22546 : ExprEvalPushStep(state, &scratch);
2855 : }
2856 :
2857 14834 : sstate = ExecInitSubPlan(subplan, state->parent);
2858 :
2859 : /* add SubPlanState nodes to state->parent->subPlan */
2860 14834 : state->parent->subPlan = lappend(state->parent->subPlan,
2861 : sstate);
2862 :
2863 14834 : scratch.opcode = EEOP_SUBPLAN;
2864 14834 : scratch.resvalue = resv;
2865 14834 : scratch.resnull = resnull;
2866 14834 : scratch.d.subplan.sstate = sstate;
2867 :
2868 14834 : ExprEvalPushStep(state, &scratch);
2869 14834 : }
2870 :
2871 : /*
2872 : * Add expression steps performing setup that's needed before any of the
2873 : * main execution of the expression.
2874 : */
2875 : static void
2876 1206004 : ExecCreateExprSetupSteps(ExprState *state, Node *node)
2877 : {
2878 1206004 : ExprSetupInfo info = {0, 0, 0, 0, 0, NIL};
2879 :
2880 : /* Prescan to find out what we need. */
2881 1206004 : expr_setup_walker(node, &info);
2882 :
2883 : /* And generate those steps. */
2884 1206001 : ExecPushExprSetupSteps(state, &info);
2885 1206001 : }
2886 :
2887 : /*
2888 : * Add steps performing expression setup as indicated by "info".
2889 : * This is useful when building an ExprState covering more than one expression.
2890 : */
2891 : static void
2892 1241895 : ExecPushExprSetupSteps(ExprState *state, ExprSetupInfo *info)
2893 : {
2894 1241895 : ExprEvalStep scratch = {0};
2895 : ListCell *lc;
2896 :
2897 1241895 : scratch.resvalue = NULL;
2898 1241895 : scratch.resnull = NULL;
2899 :
2900 : /*
2901 : * Add steps deforming the ExprState's inner/outer/scan/old/new slots as
2902 : * much as required by any Vars appearing in the expression.
2903 : */
2904 1241895 : if (info->last_inner > 0)
2905 : {
2906 97559 : scratch.opcode = EEOP_INNER_FETCHSOME;
2907 97559 : scratch.d.fetch.last_var = info->last_inner;
2908 97559 : scratch.d.fetch.fixed = false;
2909 97559 : scratch.d.fetch.kind = NULL;
2910 97559 : scratch.d.fetch.known_desc = NULL;
2911 97559 : if (ExecComputeSlotInfo(state, &scratch))
2912 88592 : ExprEvalPushStep(state, &scratch);
2913 : }
2914 1241895 : if (info->last_outer > 0)
2915 : {
2916 178191 : scratch.opcode = EEOP_OUTER_FETCHSOME;
2917 178191 : scratch.d.fetch.last_var = info->last_outer;
2918 178191 : scratch.d.fetch.fixed = false;
2919 178191 : scratch.d.fetch.kind = NULL;
2920 178191 : scratch.d.fetch.known_desc = NULL;
2921 178191 : if (ExecComputeSlotInfo(state, &scratch))
2922 98328 : ExprEvalPushStep(state, &scratch);
2923 : }
2924 1241895 : if (info->last_scan > 0)
2925 : {
2926 323835 : scratch.opcode = EEOP_SCAN_FETCHSOME;
2927 323835 : scratch.d.fetch.last_var = info->last_scan;
2928 323835 : scratch.d.fetch.fixed = false;
2929 323835 : scratch.d.fetch.kind = NULL;
2930 323835 : scratch.d.fetch.known_desc = NULL;
2931 323835 : if (ExecComputeSlotInfo(state, &scratch))
2932 301477 : ExprEvalPushStep(state, &scratch);
2933 : }
2934 1241895 : if (info->last_old > 0)
2935 : {
2936 182 : scratch.opcode = EEOP_OLD_FETCHSOME;
2937 182 : scratch.d.fetch.last_var = info->last_old;
2938 182 : scratch.d.fetch.fixed = false;
2939 182 : scratch.d.fetch.kind = NULL;
2940 182 : scratch.d.fetch.known_desc = NULL;
2941 182 : if (ExecComputeSlotInfo(state, &scratch))
2942 182 : ExprEvalPushStep(state, &scratch);
2943 : }
2944 1241895 : if (info->last_new > 0)
2945 : {
2946 183 : scratch.opcode = EEOP_NEW_FETCHSOME;
2947 183 : scratch.d.fetch.last_var = info->last_new;
2948 183 : scratch.d.fetch.fixed = false;
2949 183 : scratch.d.fetch.kind = NULL;
2950 183 : scratch.d.fetch.known_desc = NULL;
2951 183 : if (ExecComputeSlotInfo(state, &scratch))
2952 183 : ExprEvalPushStep(state, &scratch);
2953 : }
2954 :
2955 : /*
2956 : * Add steps to execute any MULTIEXPR SubPlans appearing in the
2957 : * expression. We need to evaluate these before any of the Params
2958 : * referencing their outputs are used, but after we've prepared for any
2959 : * Var references they may contain. (There cannot be cross-references
2960 : * between MULTIEXPR SubPlans, so we needn't worry about their order.)
2961 : */
2962 1241958 : foreach(lc, info->multiexpr_subplans)
2963 : {
2964 63 : SubPlan *subplan = (SubPlan *) lfirst(lc);
2965 :
2966 : Assert(subplan->subLinkType == MULTIEXPR_SUBLINK);
2967 :
2968 : /* The result can be ignored, but we better put it somewhere */
2969 63 : ExecInitSubPlanExpr(subplan, state,
2970 : &state->resvalue, &state->resnull);
2971 : }
2972 1241895 : }
2973 :
2974 : /*
2975 : * expr_setup_walker: expression walker for ExecCreateExprSetupSteps
2976 : */
2977 : static bool
2978 5876126 : expr_setup_walker(Node *node, ExprSetupInfo *info)
2979 : {
2980 5876126 : if (node == NULL)
2981 228716 : return false;
2982 5647410 : if (IsA(node, Var))
2983 : {
2984 1306848 : Var *variable = (Var *) node;
2985 1306848 : AttrNumber attnum = variable->varattno;
2986 :
2987 1306848 : switch (variable->varno)
2988 : {
2989 184856 : case INNER_VAR:
2990 184856 : info->last_inner = Max(info->last_inner, attnum);
2991 184856 : break;
2992 :
2993 442172 : case OUTER_VAR:
2994 442172 : info->last_outer = Max(info->last_outer, attnum);
2995 442172 : break;
2996 :
2997 : /* INDEX_VAR is handled by default case */
2998 :
2999 679820 : default:
3000 679820 : switch (variable->varreturningtype)
3001 : {
3002 678173 : case VAR_RETURNING_DEFAULT:
3003 678173 : info->last_scan = Max(info->last_scan, attnum);
3004 678173 : break;
3005 823 : case VAR_RETURNING_OLD:
3006 823 : info->last_old = Max(info->last_old, attnum);
3007 823 : break;
3008 824 : case VAR_RETURNING_NEW:
3009 824 : info->last_new = Max(info->last_new, attnum);
3010 824 : break;
3011 : }
3012 679820 : break;
3013 : }
3014 1306848 : return false;
3015 : }
3016 :
3017 : /* Collect all MULTIEXPR SubPlans, too */
3018 4340562 : if (IsA(node, SubPlan))
3019 : {
3020 14834 : SubPlan *subplan = (SubPlan *) node;
3021 :
3022 14834 : if (subplan->subLinkType == MULTIEXPR_SUBLINK)
3023 63 : info->multiexpr_subplans = lappend(info->multiexpr_subplans,
3024 : subplan);
3025 : }
3026 :
3027 : /*
3028 : * Don't examine the arguments or filters of Aggrefs or WindowFuncs,
3029 : * because those do not represent expressions to be evaluated within the
3030 : * calling expression's econtext. GroupingFunc arguments are never
3031 : * evaluated at all.
3032 : */
3033 4340562 : if (IsA(node, Aggref))
3034 30565 : return false;
3035 4309997 : if (IsA(node, WindowFunc))
3036 1854 : return false;
3037 4308143 : if (IsA(node, GroupingFunc))
3038 179 : return false;
3039 4307964 : return expression_tree_walker(node, expr_setup_walker, info);
3040 : }
3041 :
3042 : /*
3043 : * Compute additional information for EEOP_*_FETCHSOME ops.
3044 : *
3045 : * The goal is to determine whether a slot is 'fixed', that is, every
3046 : * evaluation of the expression will have the same type of slot, with an
3047 : * equivalent descriptor.
3048 : *
3049 : * EEOP_OLD_FETCHSOME and EEOP_NEW_FETCHSOME are used to process RETURNING, if
3050 : * OLD/NEW columns are referred to explicitly. In both cases, the tuple
3051 : * descriptor comes from the parent scan node, so we treat them the same as
3052 : * EEOP_SCAN_FETCHSOME.
3053 : *
3054 : * Returns true if the deforming step is required, false otherwise.
3055 : */
3056 : static bool
3057 626986 : ExecComputeSlotInfo(ExprState *state, ExprEvalStep *op)
3058 : {
3059 626986 : PlanState *parent = state->parent;
3060 626986 : TupleDesc desc = NULL;
3061 626986 : const TupleTableSlotOps *tts_ops = NULL;
3062 626986 : bool isfixed = false;
3063 626986 : ExprEvalOp opcode = op->opcode;
3064 :
3065 : Assert(opcode == EEOP_INNER_FETCHSOME ||
3066 : opcode == EEOP_OUTER_FETCHSOME ||
3067 : opcode == EEOP_SCAN_FETCHSOME ||
3068 : opcode == EEOP_OLD_FETCHSOME ||
3069 : opcode == EEOP_NEW_FETCHSOME);
3070 :
3071 626986 : if (op->d.fetch.known_desc != NULL)
3072 : {
3073 27036 : desc = op->d.fetch.known_desc;
3074 27036 : tts_ops = op->d.fetch.kind;
3075 27036 : isfixed = op->d.fetch.kind != NULL;
3076 : }
3077 599950 : else if (!parent)
3078 : {
3079 7709 : isfixed = false;
3080 : }
3081 592241 : else if (opcode == EEOP_INNER_FETCHSOME)
3082 : {
3083 97503 : PlanState *is = innerPlanState(parent);
3084 :
3085 97503 : if (parent->inneropsset && !parent->inneropsfixed)
3086 : {
3087 0 : isfixed = false;
3088 : }
3089 97503 : else if (parent->inneropsset && parent->innerops)
3090 : {
3091 0 : isfixed = true;
3092 0 : tts_ops = parent->innerops;
3093 0 : desc = ExecGetResultType(is);
3094 : }
3095 97503 : else if (is)
3096 : {
3097 96147 : tts_ops = ExecGetResultSlotOps(is, &isfixed);
3098 96147 : desc = ExecGetResultType(is);
3099 : }
3100 : }
3101 494738 : else if (opcode == EEOP_OUTER_FETCHSOME)
3102 : {
3103 178084 : PlanState *os = outerPlanState(parent);
3104 :
3105 178084 : if (parent->outeropsset && !parent->outeropsfixed)
3106 : {
3107 623 : isfixed = false;
3108 : }
3109 177461 : else if (parent->outeropsset && parent->outerops)
3110 : {
3111 22995 : isfixed = true;
3112 22995 : tts_ops = parent->outerops;
3113 22995 : desc = ExecGetResultType(os);
3114 : }
3115 154466 : else if (os)
3116 : {
3117 154460 : tts_ops = ExecGetResultSlotOps(os, &isfixed);
3118 154460 : desc = ExecGetResultType(os);
3119 : }
3120 : }
3121 316654 : else if (opcode == EEOP_SCAN_FETCHSOME ||
3122 183 : opcode == EEOP_OLD_FETCHSOME ||
3123 : opcode == EEOP_NEW_FETCHSOME)
3124 : {
3125 316654 : desc = parent->scandesc;
3126 :
3127 316654 : if (parent->scanops)
3128 304353 : tts_ops = parent->scanops;
3129 :
3130 316654 : if (parent->scanopsset)
3131 304353 : isfixed = parent->scanopsfixed;
3132 : }
3133 :
3134 626986 : if (isfixed && desc != NULL && tts_ops != NULL)
3135 : {
3136 591010 : op->d.fetch.fixed = true;
3137 591010 : op->d.fetch.kind = tts_ops;
3138 591010 : op->d.fetch.known_desc = desc;
3139 : }
3140 : else
3141 : {
3142 35976 : op->d.fetch.fixed = false;
3143 35976 : op->d.fetch.kind = NULL;
3144 35976 : op->d.fetch.known_desc = NULL;
3145 : }
3146 :
3147 : /* if the slot is known to always virtual we never need to deform */
3148 626986 : if (op->d.fetch.fixed && op->d.fetch.kind == &TTSOpsVirtual)
3149 114982 : return false;
3150 :
3151 512004 : return true;
3152 : }
3153 :
3154 : /*
3155 : * Prepare step for the evaluation of a whole-row variable.
3156 : * The caller still has to push the step.
3157 : */
3158 : static void
3159 2655 : ExecInitWholeRowVar(ExprEvalStep *scratch, Var *variable, ExprState *state)
3160 : {
3161 2655 : PlanState *parent = state->parent;
3162 :
3163 : /* fill in all but the target */
3164 2655 : scratch->opcode = EEOP_WHOLEROW;
3165 2655 : scratch->d.wholerow.var = variable;
3166 2655 : scratch->d.wholerow.first = true;
3167 2655 : scratch->d.wholerow.slow = false;
3168 2655 : scratch->d.wholerow.tupdesc = NULL; /* filled at runtime */
3169 2655 : scratch->d.wholerow.junkFilter = NULL;
3170 :
3171 : /* update ExprState flags if Var refers to OLD/NEW */
3172 2655 : if (variable->varreturningtype == VAR_RETURNING_OLD)
3173 65 : state->flags |= EEO_FLAG_HAS_OLD;
3174 2590 : else if (variable->varreturningtype == VAR_RETURNING_NEW)
3175 65 : state->flags |= EEO_FLAG_HAS_NEW;
3176 :
3177 : /*
3178 : * If the input tuple came from a subquery, it might contain "resjunk"
3179 : * columns (such as GROUP BY or ORDER BY columns), which we don't want to
3180 : * keep in the whole-row result. We can get rid of such columns by
3181 : * passing the tuple through a JunkFilter --- but to make one, we have to
3182 : * lay our hands on the subquery's targetlist. Fortunately, there are not
3183 : * very many cases where this can happen, and we can identify all of them
3184 : * by examining our parent PlanState. We assume this is not an issue in
3185 : * standalone expressions that don't have parent plans. (Whole-row Vars
3186 : * can occur in such expressions, but they will always be referencing
3187 : * table rows.)
3188 : */
3189 2655 : if (parent)
3190 : {
3191 2630 : PlanState *subplan = NULL;
3192 :
3193 2630 : switch (nodeTag(parent))
3194 : {
3195 169 : case T_SubqueryScanState:
3196 169 : subplan = ((SubqueryScanState *) parent)->subplan;
3197 169 : break;
3198 86 : case T_CteScanState:
3199 86 : subplan = ((CteScanState *) parent)->cteplanstate;
3200 86 : break;
3201 2375 : default:
3202 2375 : break;
3203 : }
3204 :
3205 2630 : if (subplan)
3206 : {
3207 255 : bool junk_filter_needed = false;
3208 : ListCell *tlist;
3209 :
3210 : /* Detect whether subplan tlist actually has any junk columns */
3211 784 : foreach(tlist, subplan->plan->targetlist)
3212 : {
3213 535 : TargetEntry *tle = (TargetEntry *) lfirst(tlist);
3214 :
3215 535 : if (tle->resjunk)
3216 : {
3217 6 : junk_filter_needed = true;
3218 6 : break;
3219 : }
3220 : }
3221 :
3222 : /* If so, build the junkfilter now */
3223 255 : if (junk_filter_needed)
3224 : {
3225 6 : scratch->d.wholerow.junkFilter =
3226 6 : ExecInitJunkFilter(subplan->plan->targetlist,
3227 : ExecInitExtraTupleSlot(parent->state, NULL,
3228 : &TTSOpsVirtual));
3229 : }
3230 : }
3231 : }
3232 2655 : }
3233 :
3234 : /*
3235 : * Prepare evaluation of a SubscriptingRef expression.
3236 : */
3237 : static void
3238 14022 : ExecInitSubscriptingRef(ExprEvalStep *scratch, SubscriptingRef *sbsref,
3239 : ExprState *state, Datum *resv, bool *resnull)
3240 : {
3241 14022 : bool isAssignment = (sbsref->refassgnexpr != NULL);
3242 14022 : int nupper = list_length(sbsref->refupperindexpr);
3243 14022 : int nlower = list_length(sbsref->reflowerindexpr);
3244 : const SubscriptRoutines *sbsroutines;
3245 : SubscriptingRefState *sbsrefstate;
3246 : SubscriptExecSteps methods;
3247 : char *ptr;
3248 14022 : List *adjust_jumps = NIL;
3249 : ListCell *lc;
3250 : int i;
3251 :
3252 : /* Look up the subscripting support methods */
3253 14022 : sbsroutines = getSubscriptingRoutines(sbsref->refcontainertype, NULL);
3254 14022 : if (!sbsroutines)
3255 0 : ereport(ERROR,
3256 : (errcode(ERRCODE_DATATYPE_MISMATCH),
3257 : errmsg("cannot subscript type %s because it does not support subscripting",
3258 : format_type_be(sbsref->refcontainertype)),
3259 : state->parent ?
3260 : executor_errposition(state->parent->state,
3261 : exprLocation((Node *) sbsref)) : 0));
3262 :
3263 : /* Allocate sbsrefstate, with enough space for per-subscript arrays too */
3264 14022 : sbsrefstate = palloc0(MAXALIGN(sizeof(SubscriptingRefState)) +
3265 14022 : (nupper + nlower) * (sizeof(Datum) +
3266 : 2 * sizeof(bool)));
3267 :
3268 : /* Fill constant fields of SubscriptingRefState */
3269 14022 : sbsrefstate->isassignment = isAssignment;
3270 14022 : sbsrefstate->numupper = nupper;
3271 14022 : sbsrefstate->numlower = nlower;
3272 : /* Set up per-subscript arrays */
3273 14022 : ptr = ((char *) sbsrefstate) + MAXALIGN(sizeof(SubscriptingRefState));
3274 14022 : sbsrefstate->upperindex = (Datum *) ptr;
3275 14022 : ptr += nupper * sizeof(Datum);
3276 14022 : sbsrefstate->lowerindex = (Datum *) ptr;
3277 14022 : ptr += nlower * sizeof(Datum);
3278 14022 : sbsrefstate->upperprovided = (bool *) ptr;
3279 14022 : ptr += nupper * sizeof(bool);
3280 14022 : sbsrefstate->lowerprovided = (bool *) ptr;
3281 14022 : ptr += nlower * sizeof(bool);
3282 14022 : sbsrefstate->upperindexnull = (bool *) ptr;
3283 14022 : ptr += nupper * sizeof(bool);
3284 14022 : sbsrefstate->lowerindexnull = (bool *) ptr;
3285 : /* ptr += nlower * sizeof(bool); */
3286 :
3287 : /*
3288 : * Let the container-type-specific code have a chance. It must fill the
3289 : * "methods" struct with function pointers for us to possibly use in
3290 : * execution steps below; and it can optionally set up some data pointed
3291 : * to by the workspace field.
3292 : */
3293 14022 : memset(&methods, 0, sizeof(methods));
3294 14022 : sbsroutines->exec_setup(sbsref, sbsrefstate, &methods);
3295 :
3296 : /*
3297 : * Evaluate array input. It's safe to do so into resv/resnull, because we
3298 : * won't use that as target for any of the other subexpressions, and it'll
3299 : * be overwritten by the final EEOP_SBSREF_FETCH/ASSIGN step, which is
3300 : * pushed last.
3301 : */
3302 14022 : ExecInitExprRec(sbsref->refexpr, state, resv, resnull);
3303 :
3304 : /*
3305 : * If refexpr yields NULL, and the operation should be strict, then result
3306 : * is NULL. We can implement this with just JUMP_IF_NULL, since we
3307 : * evaluated the array into the desired target location.
3308 : */
3309 14022 : if (!isAssignment && sbsroutines->fetch_strict)
3310 : {
3311 13362 : scratch->opcode = EEOP_JUMP_IF_NULL;
3312 13362 : scratch->d.jump.jumpdone = -1; /* adjust later */
3313 13362 : ExprEvalPushStep(state, scratch);
3314 13362 : adjust_jumps = lappend_int(adjust_jumps,
3315 13362 : state->steps_len - 1);
3316 : }
3317 :
3318 : /* Evaluate upper subscripts */
3319 14022 : i = 0;
3320 28339 : foreach(lc, sbsref->refupperindexpr)
3321 : {
3322 14317 : Expr *e = (Expr *) lfirst(lc);
3323 :
3324 : /* When slicing, individual subscript bounds can be omitted */
3325 14317 : if (!e)
3326 : {
3327 39 : sbsrefstate->upperprovided[i] = false;
3328 39 : sbsrefstate->upperindexnull[i] = true;
3329 : }
3330 : else
3331 : {
3332 14278 : sbsrefstate->upperprovided[i] = true;
3333 : /* Each subscript is evaluated into appropriate array entry */
3334 14278 : ExecInitExprRec(e, state,
3335 14278 : &sbsrefstate->upperindex[i],
3336 14278 : &sbsrefstate->upperindexnull[i]);
3337 : }
3338 14317 : i++;
3339 : }
3340 :
3341 : /* Evaluate lower subscripts similarly */
3342 14022 : i = 0;
3343 14325 : foreach(lc, sbsref->reflowerindexpr)
3344 : {
3345 303 : Expr *e = (Expr *) lfirst(lc);
3346 :
3347 : /* When slicing, individual subscript bounds can be omitted */
3348 303 : if (!e)
3349 : {
3350 39 : sbsrefstate->lowerprovided[i] = false;
3351 39 : sbsrefstate->lowerindexnull[i] = true;
3352 : }
3353 : else
3354 : {
3355 264 : sbsrefstate->lowerprovided[i] = true;
3356 : /* Each subscript is evaluated into appropriate array entry */
3357 264 : ExecInitExprRec(e, state,
3358 264 : &sbsrefstate->lowerindex[i],
3359 264 : &sbsrefstate->lowerindexnull[i]);
3360 : }
3361 303 : i++;
3362 : }
3363 :
3364 : /* SBSREF_SUBSCRIPTS checks and converts all the subscripts at once */
3365 14022 : if (methods.sbs_check_subscripts)
3366 : {
3367 14015 : scratch->opcode = EEOP_SBSREF_SUBSCRIPTS;
3368 14015 : scratch->d.sbsref_subscript.subscriptfunc = methods.sbs_check_subscripts;
3369 14015 : scratch->d.sbsref_subscript.state = sbsrefstate;
3370 14015 : scratch->d.sbsref_subscript.jumpdone = -1; /* adjust later */
3371 14015 : ExprEvalPushStep(state, scratch);
3372 14015 : adjust_jumps = lappend_int(adjust_jumps,
3373 14015 : state->steps_len - 1);
3374 : }
3375 :
3376 14022 : if (isAssignment)
3377 : {
3378 : Datum *save_innermost_caseval;
3379 : bool *save_innermost_casenull;
3380 :
3381 : /* Check for unimplemented methods */
3382 660 : if (!methods.sbs_assign)
3383 0 : ereport(ERROR,
3384 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3385 : errmsg("type %s does not support subscripted assignment",
3386 : format_type_be(sbsref->refcontainertype))));
3387 :
3388 : /*
3389 : * We might have a nested-assignment situation, in which the
3390 : * refassgnexpr is itself a FieldStore or SubscriptingRef that needs
3391 : * to obtain and modify the previous value of the array element or
3392 : * slice being replaced. If so, we have to extract that value from
3393 : * the array and pass it down via the CaseTestExpr mechanism. It's
3394 : * safe to reuse the CASE mechanism because there cannot be a CASE
3395 : * between here and where the value would be needed, and an array
3396 : * assignment can't be within a CASE either. (So saving and restoring
3397 : * innermost_caseval is just paranoia, but let's do it anyway.)
3398 : *
3399 : * Since fetching the old element might be a nontrivial expense, do it
3400 : * only if the argument actually needs it.
3401 : */
3402 660 : if (isAssignmentIndirectionExpr(sbsref->refassgnexpr))
3403 : {
3404 93 : if (!methods.sbs_fetch_old)
3405 0 : ereport(ERROR,
3406 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3407 : errmsg("type %s does not support subscripted assignment",
3408 : format_type_be(sbsref->refcontainertype))));
3409 93 : scratch->opcode = EEOP_SBSREF_OLD;
3410 93 : scratch->d.sbsref.subscriptfunc = methods.sbs_fetch_old;
3411 93 : scratch->d.sbsref.state = sbsrefstate;
3412 93 : ExprEvalPushStep(state, scratch);
3413 : }
3414 :
3415 : /* SBSREF_OLD puts extracted value into prevvalue/prevnull */
3416 660 : save_innermost_caseval = state->innermost_caseval;
3417 660 : save_innermost_casenull = state->innermost_casenull;
3418 660 : state->innermost_caseval = &sbsrefstate->prevvalue;
3419 660 : state->innermost_casenull = &sbsrefstate->prevnull;
3420 :
3421 : /* evaluate replacement value into replacevalue/replacenull */
3422 660 : ExecInitExprRec(sbsref->refassgnexpr, state,
3423 : &sbsrefstate->replacevalue, &sbsrefstate->replacenull);
3424 :
3425 660 : state->innermost_caseval = save_innermost_caseval;
3426 660 : state->innermost_casenull = save_innermost_casenull;
3427 :
3428 : /* and perform the assignment */
3429 660 : scratch->opcode = EEOP_SBSREF_ASSIGN;
3430 660 : scratch->d.sbsref.subscriptfunc = methods.sbs_assign;
3431 660 : scratch->d.sbsref.state = sbsrefstate;
3432 660 : ExprEvalPushStep(state, scratch);
3433 : }
3434 : else
3435 : {
3436 : /* array fetch is much simpler */
3437 13362 : scratch->opcode = EEOP_SBSREF_FETCH;
3438 13362 : scratch->d.sbsref.subscriptfunc = methods.sbs_fetch;
3439 13362 : scratch->d.sbsref.state = sbsrefstate;
3440 13362 : ExprEvalPushStep(state, scratch);
3441 : }
3442 :
3443 : /* adjust jump targets */
3444 41399 : foreach(lc, adjust_jumps)
3445 : {
3446 27377 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
3447 :
3448 27377 : if (as->opcode == EEOP_SBSREF_SUBSCRIPTS)
3449 : {
3450 : Assert(as->d.sbsref_subscript.jumpdone == -1);
3451 14015 : as->d.sbsref_subscript.jumpdone = state->steps_len;
3452 : }
3453 : else
3454 : {
3455 : Assert(as->opcode == EEOP_JUMP_IF_NULL);
3456 : Assert(as->d.jump.jumpdone == -1);
3457 13362 : as->d.jump.jumpdone = state->steps_len;
3458 : }
3459 : }
3460 14022 : }
3461 :
3462 : /*
3463 : * Helper for preparing SubscriptingRef expressions for evaluation: is expr
3464 : * a nested FieldStore or SubscriptingRef that needs the old element value
3465 : * passed down?
3466 : *
3467 : * (We could use this in FieldStore too, but in that case passing the old
3468 : * value is so cheap there's no need.)
3469 : *
3470 : * Note: it might seem that this needs to recurse, but in most cases it does
3471 : * not; the CaseTestExpr, if any, will be directly the arg or refexpr of the
3472 : * top-level node. Nested-assignment situations give rise to expression
3473 : * trees in which each level of assignment has its own CaseTestExpr, and the
3474 : * recursive structure appears within the newvals or refassgnexpr field.
3475 : * There is an exception, though: if the array is an array-of-domain, we will
3476 : * have a CoerceToDomain or RelabelType as the refassgnexpr, and we need to
3477 : * be able to look through that.
3478 : */
3479 : static bool
3480 702 : isAssignmentIndirectionExpr(Expr *expr)
3481 : {
3482 702 : if (expr == NULL)
3483 0 : return false; /* just paranoia */
3484 702 : if (IsA(expr, FieldStore))
3485 : {
3486 93 : FieldStore *fstore = (FieldStore *) expr;
3487 :
3488 93 : if (fstore->arg && IsA(fstore->arg, CaseTestExpr))
3489 93 : return true;
3490 : }
3491 609 : else if (IsA(expr, SubscriptingRef))
3492 : {
3493 16 : SubscriptingRef *sbsRef = (SubscriptingRef *) expr;
3494 :
3495 16 : if (sbsRef->refexpr && IsA(sbsRef->refexpr, CaseTestExpr))
3496 0 : return true;
3497 : }
3498 593 : else if (IsA(expr, CoerceToDomain))
3499 : {
3500 33 : CoerceToDomain *cd = (CoerceToDomain *) expr;
3501 :
3502 33 : return isAssignmentIndirectionExpr(cd->arg);
3503 : }
3504 560 : else if (IsA(expr, RelabelType))
3505 : {
3506 9 : RelabelType *r = (RelabelType *) expr;
3507 :
3508 9 : return isAssignmentIndirectionExpr(r->arg);
3509 : }
3510 567 : return false;
3511 : }
3512 :
3513 : /*
3514 : * Prepare evaluation of a CoerceToDomain expression.
3515 : */
3516 : static void
3517 4910 : ExecInitCoerceToDomain(ExprEvalStep *scratch, CoerceToDomain *ctest,
3518 : ExprState *state, Datum *resv, bool *resnull)
3519 : {
3520 : DomainConstraintRef *constraint_ref;
3521 4910 : Datum *domainval = NULL;
3522 4910 : bool *domainnull = NULL;
3523 : ListCell *l;
3524 :
3525 4910 : scratch->d.domaincheck.resulttype = ctest->resulttype;
3526 : /* we'll allocate workspace only if needed */
3527 4910 : scratch->d.domaincheck.checkvalue = NULL;
3528 4910 : scratch->d.domaincheck.checknull = NULL;
3529 4910 : scratch->d.domaincheck.escontext = state->escontext;
3530 :
3531 : /*
3532 : * Evaluate argument - it's fine to directly store it into resv/resnull,
3533 : * if there's constraint failures there'll be errors, otherwise it's what
3534 : * needs to be returned.
3535 : */
3536 4910 : ExecInitExprRec(ctest->arg, state, resv, resnull);
3537 :
3538 : /*
3539 : * Note: if the argument is of varlena type, it could be a R/W expanded
3540 : * object. We want to return the R/W pointer as the final result, but we
3541 : * have to pass a R/O pointer as the value to be tested by any functions
3542 : * in check expressions. We don't bother to emit a MAKE_READONLY step
3543 : * unless there's actually at least one check expression, though. Until
3544 : * we've tested that, domainval/domainnull are NULL.
3545 : */
3546 :
3547 : /*
3548 : * Collect the constraints associated with the domain.
3549 : *
3550 : * Note: before PG v10 we'd recheck the set of constraints during each
3551 : * evaluation of the expression. Now we bake them into the ExprState
3552 : * during executor initialization. That means we don't need typcache.c to
3553 : * provide compiled exprs.
3554 : */
3555 4910 : constraint_ref = palloc_object(DomainConstraintRef);
3556 4910 : InitDomainConstraintRef(ctest->resulttype,
3557 : constraint_ref,
3558 : CurrentMemoryContext,
3559 : false);
3560 :
3561 : /*
3562 : * Compile code to check each domain constraint. NOTNULL constraints can
3563 : * just be applied on the resv/resnull value, but for CHECK constraints we
3564 : * need more pushups.
3565 : */
3566 10319 : foreach(l, constraint_ref->constraints)
3567 : {
3568 5409 : DomainConstraintState *con = (DomainConstraintState *) lfirst(l);
3569 : Datum *save_innermost_domainval;
3570 : bool *save_innermost_domainnull;
3571 :
3572 5409 : scratch->d.domaincheck.constraintname = con->name;
3573 :
3574 5409 : switch (con->constrainttype)
3575 : {
3576 198 : case DOM_CONSTRAINT_NOTNULL:
3577 198 : scratch->opcode = EEOP_DOMAIN_NOTNULL;
3578 198 : ExprEvalPushStep(state, scratch);
3579 198 : break;
3580 5211 : case DOM_CONSTRAINT_CHECK:
3581 : /* Allocate workspace for CHECK output if we didn't yet */
3582 5211 : if (scratch->d.domaincheck.checkvalue == NULL)
3583 : {
3584 4781 : scratch->d.domaincheck.checkvalue =
3585 4781 : palloc_object(Datum);
3586 4781 : scratch->d.domaincheck.checknull =
3587 4781 : palloc_object(bool);
3588 : }
3589 :
3590 : /*
3591 : * If first time through, determine where CoerceToDomainValue
3592 : * nodes should read from.
3593 : */
3594 5211 : if (domainval == NULL)
3595 : {
3596 : /*
3597 : * Since value might be read multiple times, force to R/O
3598 : * - but only if it could be an expanded datum.
3599 : */
3600 4781 : if (get_typlen(ctest->resulttype) == -1)
3601 : {
3602 1551 : ExprEvalStep scratch2 = {0};
3603 :
3604 : /* Yes, so make output workspace for MAKE_READONLY */
3605 1551 : domainval = palloc_object(Datum);
3606 1551 : domainnull = palloc_object(bool);
3607 :
3608 : /* Emit MAKE_READONLY */
3609 1551 : scratch2.opcode = EEOP_MAKE_READONLY;
3610 1551 : scratch2.resvalue = domainval;
3611 1551 : scratch2.resnull = domainnull;
3612 1551 : scratch2.d.make_readonly.value = resv;
3613 1551 : scratch2.d.make_readonly.isnull = resnull;
3614 1551 : ExprEvalPushStep(state, &scratch2);
3615 : }
3616 : else
3617 : {
3618 : /* No, so it's fine to read from resv/resnull */
3619 3230 : domainval = resv;
3620 3230 : domainnull = resnull;
3621 : }
3622 : }
3623 :
3624 : /*
3625 : * Set up value to be returned by CoerceToDomainValue nodes.
3626 : * We must save and restore innermost_domainval/null fields,
3627 : * in case this node is itself within a check expression for
3628 : * another domain.
3629 : */
3630 5211 : save_innermost_domainval = state->innermost_domainval;
3631 5211 : save_innermost_domainnull = state->innermost_domainnull;
3632 5211 : state->innermost_domainval = domainval;
3633 5211 : state->innermost_domainnull = domainnull;
3634 :
3635 : /* evaluate check expression value */
3636 5211 : ExecInitExprRec(con->check_expr, state,
3637 : scratch->d.domaincheck.checkvalue,
3638 : scratch->d.domaincheck.checknull);
3639 :
3640 5211 : state->innermost_domainval = save_innermost_domainval;
3641 5211 : state->innermost_domainnull = save_innermost_domainnull;
3642 :
3643 : /* now test result */
3644 5211 : scratch->opcode = EEOP_DOMAIN_CHECK;
3645 5211 : ExprEvalPushStep(state, scratch);
3646 :
3647 5211 : break;
3648 0 : default:
3649 0 : elog(ERROR, "unrecognized constraint type: %d",
3650 : (int) con->constrainttype);
3651 : break;
3652 : }
3653 : }
3654 4910 : }
3655 :
3656 : /*
3657 : * Build transition/combine function invocations for all aggregate transition
3658 : * / combination function invocations in a grouping sets phase. This has to
3659 : * invoke all sort based transitions in a phase (if doSort is true), all hash
3660 : * based transitions (if doHash is true), or both (both true).
3661 : *
3662 : * The resulting expression will, for each set of transition values, first
3663 : * check for filters, evaluate aggregate input, check that that input is not
3664 : * NULL for a strict transition function, and then finally invoke the
3665 : * transition for each of the concurrently computed grouping sets.
3666 : *
3667 : * If nullcheck is true, the generated code will check for a NULL pointer to
3668 : * the array of AggStatePerGroup, and skip evaluation if so.
3669 : */
3670 : ExprState *
3671 27470 : ExecBuildAggTrans(AggState *aggstate, AggStatePerPhase phase,
3672 : bool doSort, bool doHash, bool nullcheck)
3673 : {
3674 27470 : ExprState *state = makeNode(ExprState);
3675 27470 : PlanState *parent = &aggstate->ss.ps;
3676 27470 : ExprEvalStep scratch = {0};
3677 27470 : bool isCombine = DO_AGGSPLIT_COMBINE(aggstate->aggsplit);
3678 27470 : ExprSetupInfo deform = {0, 0, 0, 0, 0, NIL};
3679 :
3680 27470 : state->expr = (Expr *) aggstate;
3681 27470 : state->parent = parent;
3682 :
3683 27470 : scratch.resvalue = &state->resvalue;
3684 27470 : scratch.resnull = &state->resnull;
3685 :
3686 : /*
3687 : * First figure out which slots, and how many columns from each, we're
3688 : * going to need.
3689 : */
3690 57932 : for (int transno = 0; transno < aggstate->numtrans; transno++)
3691 : {
3692 30462 : AggStatePerTrans pertrans = &aggstate->pertrans[transno];
3693 :
3694 30462 : expr_setup_walker((Node *) pertrans->aggref->aggdirectargs,
3695 : &deform);
3696 30462 : expr_setup_walker((Node *) pertrans->aggref->args,
3697 : &deform);
3698 30462 : expr_setup_walker((Node *) pertrans->aggref->aggorder,
3699 : &deform);
3700 30462 : expr_setup_walker((Node *) pertrans->aggref->aggdistinct,
3701 : &deform);
3702 30462 : expr_setup_walker((Node *) pertrans->aggref->aggfilter,
3703 : &deform);
3704 : }
3705 27470 : ExecPushExprSetupSteps(state, &deform);
3706 :
3707 : /*
3708 : * Emit instructions for each transition value / grouping set combination.
3709 : */
3710 57932 : for (int transno = 0; transno < aggstate->numtrans; transno++)
3711 : {
3712 30462 : AggStatePerTrans pertrans = &aggstate->pertrans[transno];
3713 30462 : FunctionCallInfo trans_fcinfo = pertrans->transfn_fcinfo;
3714 30462 : List *adjust_bailout = NIL;
3715 30462 : NullableDatum *strictargs = NULL;
3716 30462 : bool *strictnulls = NULL;
3717 : int argno;
3718 : ListCell *bail;
3719 :
3720 : /*
3721 : * If filter present, emit. Do so before evaluating the input, to
3722 : * avoid potentially unneeded computations, or even worse, unintended
3723 : * side-effects. When combining, all the necessary filtering has
3724 : * already been done.
3725 : */
3726 30462 : if (pertrans->aggref->aggfilter && !isCombine)
3727 : {
3728 : /* evaluate filter expression */
3729 380 : ExecInitExprRec(pertrans->aggref->aggfilter, state,
3730 : &state->resvalue, &state->resnull);
3731 : /* and jump out if false */
3732 380 : scratch.opcode = EEOP_JUMP_IF_NOT_TRUE;
3733 380 : scratch.d.jump.jumpdone = -1; /* adjust later */
3734 380 : ExprEvalPushStep(state, &scratch);
3735 380 : adjust_bailout = lappend_int(adjust_bailout,
3736 380 : state->steps_len - 1);
3737 : }
3738 :
3739 : /*
3740 : * Evaluate arguments to aggregate/combine function.
3741 : */
3742 30462 : argno = 0;
3743 30462 : if (isCombine)
3744 : {
3745 : /*
3746 : * Combining two aggregate transition values. Instead of directly
3747 : * coming from a tuple the input is a, potentially deserialized,
3748 : * transition value.
3749 : */
3750 : TargetEntry *source_tle;
3751 :
3752 : Assert(pertrans->numSortCols == 0);
3753 : Assert(list_length(pertrans->aggref->args) == 1);
3754 :
3755 1123 : strictargs = trans_fcinfo->args + 1;
3756 1123 : source_tle = (TargetEntry *) linitial(pertrans->aggref->args);
3757 :
3758 : /*
3759 : * deserialfn_oid will be set if we must deserialize the input
3760 : * state before calling the combine function.
3761 : */
3762 1123 : if (!OidIsValid(pertrans->deserialfn_oid))
3763 : {
3764 : /*
3765 : * Start from 1, since the 0th arg will be the transition
3766 : * value
3767 : */
3768 1063 : ExecInitExprRec(source_tle->expr, state,
3769 1063 : &trans_fcinfo->args[argno + 1].value,
3770 1063 : &trans_fcinfo->args[argno + 1].isnull);
3771 : }
3772 : else
3773 : {
3774 60 : FunctionCallInfo ds_fcinfo = pertrans->deserialfn_fcinfo;
3775 :
3776 : /* evaluate argument */
3777 60 : ExecInitExprRec(source_tle->expr, state,
3778 : &ds_fcinfo->args[0].value,
3779 : &ds_fcinfo->args[0].isnull);
3780 :
3781 : /* Dummy second argument for type-safety reasons */
3782 60 : ds_fcinfo->args[1].value = PointerGetDatum(NULL);
3783 60 : ds_fcinfo->args[1].isnull = false;
3784 :
3785 : /*
3786 : * Don't call a strict deserialization function with NULL
3787 : * input
3788 : */
3789 60 : if (pertrans->deserialfn.fn_strict)
3790 60 : scratch.opcode = EEOP_AGG_STRICT_DESERIALIZE;
3791 : else
3792 0 : scratch.opcode = EEOP_AGG_DESERIALIZE;
3793 :
3794 60 : scratch.d.agg_deserialize.fcinfo_data = ds_fcinfo;
3795 60 : scratch.d.agg_deserialize.jumpnull = -1; /* adjust later */
3796 60 : scratch.resvalue = &trans_fcinfo->args[argno + 1].value;
3797 60 : scratch.resnull = &trans_fcinfo->args[argno + 1].isnull;
3798 :
3799 60 : ExprEvalPushStep(state, &scratch);
3800 : /* don't add an adjustment unless the function is strict */
3801 60 : if (pertrans->deserialfn.fn_strict)
3802 60 : adjust_bailout = lappend_int(adjust_bailout,
3803 60 : state->steps_len - 1);
3804 :
3805 : /* restore normal settings of scratch fields */
3806 60 : scratch.resvalue = &state->resvalue;
3807 60 : scratch.resnull = &state->resnull;
3808 : }
3809 1123 : argno++;
3810 :
3811 : Assert(pertrans->numInputs == argno);
3812 : }
3813 29339 : else if (!pertrans->aggsortrequired)
3814 : {
3815 : ListCell *arg;
3816 :
3817 : /*
3818 : * Normal transition function without ORDER BY / DISTINCT or with
3819 : * ORDER BY / DISTINCT but the planner has given us pre-sorted
3820 : * input.
3821 : */
3822 29191 : strictargs = trans_fcinfo->args + 1;
3823 :
3824 49900 : foreach(arg, pertrans->aggref->args)
3825 : {
3826 21476 : TargetEntry *source_tle = (TargetEntry *) lfirst(arg);
3827 :
3828 : /*
3829 : * Don't initialize args for any ORDER BY clause that might
3830 : * exist in a presorted aggregate.
3831 : */
3832 21476 : if (argno == pertrans->numTransInputs)
3833 767 : break;
3834 :
3835 : /*
3836 : * Start from 1, since the 0th arg will be the transition
3837 : * value
3838 : */
3839 20709 : ExecInitExprRec(source_tle->expr, state,
3840 20709 : &trans_fcinfo->args[argno + 1].value,
3841 20709 : &trans_fcinfo->args[argno + 1].isnull);
3842 20709 : argno++;
3843 : }
3844 : Assert(pertrans->numTransInputs == argno);
3845 : }
3846 148 : else if (pertrans->numInputs == 1)
3847 : {
3848 : /*
3849 : * Non-presorted DISTINCT and/or ORDER BY case, with a single
3850 : * column sorted on.
3851 : */
3852 124 : TargetEntry *source_tle =
3853 124 : (TargetEntry *) linitial(pertrans->aggref->args);
3854 :
3855 : Assert(list_length(pertrans->aggref->args) == 1);
3856 :
3857 124 : ExecInitExprRec(source_tle->expr, state,
3858 : &state->resvalue,
3859 : &state->resnull);
3860 124 : strictnulls = &state->resnull;
3861 124 : argno++;
3862 :
3863 : Assert(pertrans->numInputs == argno);
3864 : }
3865 : else
3866 : {
3867 : /*
3868 : * Non-presorted DISTINCT and/or ORDER BY case, with multiple
3869 : * columns sorted on.
3870 : */
3871 24 : Datum *values = pertrans->sortslot->tts_values;
3872 24 : bool *nulls = pertrans->sortslot->tts_isnull;
3873 : ListCell *arg;
3874 :
3875 24 : strictnulls = nulls;
3876 :
3877 84 : foreach(arg, pertrans->aggref->args)
3878 : {
3879 60 : TargetEntry *source_tle = (TargetEntry *) lfirst(arg);
3880 :
3881 60 : ExecInitExprRec(source_tle->expr, state,
3882 60 : &values[argno], &nulls[argno]);
3883 60 : argno++;
3884 : }
3885 : Assert(pertrans->numInputs == argno);
3886 : }
3887 :
3888 : /*
3889 : * For a strict transfn, nothing happens when there's a NULL input; we
3890 : * just keep the prior transValue. This is true for both plain and
3891 : * sorted/distinct aggregates.
3892 : */
3893 30462 : if (trans_fcinfo->flinfo->fn_strict && pertrans->numTransInputs > 0)
3894 : {
3895 5627 : if (strictnulls)
3896 81 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_NULLS;
3897 5546 : else if (strictargs && pertrans->numTransInputs == 1)
3898 5432 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_ARGS_1;
3899 : else
3900 114 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_ARGS;
3901 5627 : scratch.d.agg_strict_input_check.nulls = strictnulls;
3902 5627 : scratch.d.agg_strict_input_check.args = strictargs;
3903 5627 : scratch.d.agg_strict_input_check.jumpnull = -1; /* adjust later */
3904 5627 : scratch.d.agg_strict_input_check.nargs = pertrans->numTransInputs;
3905 5627 : ExprEvalPushStep(state, &scratch);
3906 5627 : adjust_bailout = lappend_int(adjust_bailout,
3907 5627 : state->steps_len - 1);
3908 : }
3909 :
3910 : /* Handle DISTINCT aggregates which have pre-sorted input */
3911 30462 : if (pertrans->numDistinctCols > 0 && !pertrans->aggsortrequired)
3912 : {
3913 218 : if (pertrans->numDistinctCols > 1)
3914 51 : scratch.opcode = EEOP_AGG_PRESORTED_DISTINCT_MULTI;
3915 : else
3916 167 : scratch.opcode = EEOP_AGG_PRESORTED_DISTINCT_SINGLE;
3917 :
3918 218 : scratch.d.agg_presorted_distinctcheck.pertrans = pertrans;
3919 218 : scratch.d.agg_presorted_distinctcheck.jumpdistinct = -1; /* adjust later */
3920 218 : ExprEvalPushStep(state, &scratch);
3921 218 : adjust_bailout = lappend_int(adjust_bailout,
3922 218 : state->steps_len - 1);
3923 : }
3924 :
3925 : /*
3926 : * Call transition function (once for each concurrently evaluated
3927 : * grouping set). Do so for both sort and hash based computations, as
3928 : * applicable.
3929 : */
3930 30462 : if (doSort)
3931 : {
3932 26385 : int processGroupingSets = Max(phase->numsets, 1);
3933 26385 : int setoff = 0;
3934 :
3935 53343 : for (int setno = 0; setno < processGroupingSets; setno++)
3936 : {
3937 26958 : ExecBuildAggTransCall(state, aggstate, &scratch, trans_fcinfo,
3938 : pertrans, transno, setno, setoff, false,
3939 : nullcheck);
3940 26958 : setoff++;
3941 : }
3942 : }
3943 :
3944 30462 : if (doHash)
3945 : {
3946 4266 : int numHashes = aggstate->num_hashes;
3947 : int setoff;
3948 :
3949 : /* in MIXED mode, there'll be preceding transition values */
3950 4266 : if (aggstate->aggstrategy != AGG_HASHED)
3951 201 : setoff = aggstate->maxsets;
3952 : else
3953 4065 : setoff = 0;
3954 :
3955 9137 : for (int setno = 0; setno < numHashes; setno++)
3956 : {
3957 4871 : ExecBuildAggTransCall(state, aggstate, &scratch, trans_fcinfo,
3958 : pertrans, transno, setno, setoff, true,
3959 : nullcheck);
3960 4871 : setoff++;
3961 : }
3962 : }
3963 :
3964 : /* adjust early bail out jump target(s) */
3965 36747 : foreach(bail, adjust_bailout)
3966 : {
3967 6285 : ExprEvalStep *as = &state->steps[lfirst_int(bail)];
3968 :
3969 6285 : if (as->opcode == EEOP_JUMP_IF_NOT_TRUE)
3970 : {
3971 : Assert(as->d.jump.jumpdone == -1);
3972 380 : as->d.jump.jumpdone = state->steps_len;
3973 : }
3974 5905 : else if (as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_ARGS ||
3975 5791 : as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_ARGS_1 ||
3976 359 : as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_NULLS)
3977 : {
3978 : Assert(as->d.agg_strict_input_check.jumpnull == -1);
3979 5627 : as->d.agg_strict_input_check.jumpnull = state->steps_len;
3980 : }
3981 278 : else if (as->opcode == EEOP_AGG_STRICT_DESERIALIZE)
3982 : {
3983 : Assert(as->d.agg_deserialize.jumpnull == -1);
3984 60 : as->d.agg_deserialize.jumpnull = state->steps_len;
3985 : }
3986 218 : else if (as->opcode == EEOP_AGG_PRESORTED_DISTINCT_SINGLE ||
3987 51 : as->opcode == EEOP_AGG_PRESORTED_DISTINCT_MULTI)
3988 : {
3989 : Assert(as->d.agg_presorted_distinctcheck.jumpdistinct == -1);
3990 218 : as->d.agg_presorted_distinctcheck.jumpdistinct = state->steps_len;
3991 : }
3992 : else
3993 : Assert(false);
3994 : }
3995 : }
3996 :
3997 27470 : scratch.resvalue = NULL;
3998 27470 : scratch.resnull = NULL;
3999 27470 : scratch.opcode = EEOP_DONE_NO_RETURN;
4000 27470 : ExprEvalPushStep(state, &scratch);
4001 :
4002 27470 : ExecReadyExpr(state);
4003 :
4004 27470 : return state;
4005 : }
4006 :
4007 : /*
4008 : * Build transition/combine function invocation for a single transition
4009 : * value. This is separated from ExecBuildAggTrans() because there are
4010 : * multiple callsites (hash and sort in some grouping set cases).
4011 : */
4012 : static void
4013 31829 : ExecBuildAggTransCall(ExprState *state, AggState *aggstate,
4014 : ExprEvalStep *scratch,
4015 : FunctionCallInfo fcinfo, AggStatePerTrans pertrans,
4016 : int transno, int setno, int setoff, bool ishash,
4017 : bool nullcheck)
4018 : {
4019 : ExprContext *aggcontext;
4020 31829 : int adjust_jumpnull = -1;
4021 :
4022 31829 : if (ishash)
4023 4871 : aggcontext = aggstate->hashcontext;
4024 : else
4025 26958 : aggcontext = aggstate->aggcontexts[setno];
4026 :
4027 : /* add check for NULL pointer? */
4028 31829 : if (nullcheck)
4029 : {
4030 210 : scratch->opcode = EEOP_AGG_PLAIN_PERGROUP_NULLCHECK;
4031 210 : scratch->d.agg_plain_pergroup_nullcheck.setoff = setoff;
4032 : /* adjust later */
4033 210 : scratch->d.agg_plain_pergroup_nullcheck.jumpnull = -1;
4034 210 : ExprEvalPushStep(state, scratch);
4035 210 : adjust_jumpnull = state->steps_len - 1;
4036 : }
4037 :
4038 : /*
4039 : * Determine appropriate transition implementation.
4040 : *
4041 : * For non-ordered aggregates and ORDER BY / DISTINCT aggregates with
4042 : * presorted input:
4043 : *
4044 : * If the initial value for the transition state doesn't exist in the
4045 : * pg_aggregate table then we will let the first non-NULL value returned
4046 : * from the outer procNode become the initial value. (This is useful for
4047 : * aggregates like max() and min().) The noTransValue flag signals that we
4048 : * need to do so. If true, generate a
4049 : * EEOP_AGG_INIT_STRICT_PLAIN_TRANS{,_BYVAL} step. This step also needs to
4050 : * do the work described next:
4051 : *
4052 : * If the function is strict, but does have an initial value, choose
4053 : * EEOP_AGG_STRICT_PLAIN_TRANS{,_BYVAL}, which skips the transition
4054 : * function if the transition value has become NULL (because a previous
4055 : * transition function returned NULL). This step also needs to do the work
4056 : * described next:
4057 : *
4058 : * Otherwise we call EEOP_AGG_PLAIN_TRANS{,_BYVAL}, which does not have to
4059 : * perform either of the above checks.
4060 : *
4061 : * Having steps with overlapping responsibilities is not nice, but
4062 : * aggregations are very performance sensitive, making this worthwhile.
4063 : *
4064 : * For ordered aggregates:
4065 : *
4066 : * Only need to choose between the faster path for a single ordered
4067 : * column, and the one between multiple columns. Checking strictness etc
4068 : * is done when finalizing the aggregate. See
4069 : * process_ordered_aggregate_{single, multi} and
4070 : * advance_transition_function.
4071 : */
4072 31829 : if (!pertrans->aggsortrequired)
4073 : {
4074 31657 : if (pertrans->transtypeByVal)
4075 : {
4076 29584 : if (fcinfo->flinfo->fn_strict &&
4077 15621 : pertrans->initValueIsNull)
4078 2629 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_INIT_STRICT_BYVAL;
4079 26955 : else if (fcinfo->flinfo->fn_strict)
4080 12992 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_STRICT_BYVAL;
4081 : else
4082 13963 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_BYVAL;
4083 : }
4084 : else
4085 : {
4086 2073 : if (fcinfo->flinfo->fn_strict &&
4087 1887 : pertrans->initValueIsNull)
4088 543 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_INIT_STRICT_BYREF;
4089 1530 : else if (fcinfo->flinfo->fn_strict)
4090 1344 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_STRICT_BYREF;
4091 : else
4092 186 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_BYREF;
4093 : }
4094 : }
4095 172 : else if (pertrans->numInputs == 1)
4096 142 : scratch->opcode = EEOP_AGG_ORDERED_TRANS_DATUM;
4097 : else
4098 30 : scratch->opcode = EEOP_AGG_ORDERED_TRANS_TUPLE;
4099 :
4100 31829 : scratch->d.agg_trans.pertrans = pertrans;
4101 31829 : scratch->d.agg_trans.setno = setno;
4102 31829 : scratch->d.agg_trans.setoff = setoff;
4103 31829 : scratch->d.agg_trans.transno = transno;
4104 31829 : scratch->d.agg_trans.aggcontext = aggcontext;
4105 31829 : ExprEvalPushStep(state, scratch);
4106 :
4107 : /* fix up jumpnull */
4108 31829 : if (adjust_jumpnull != -1)
4109 : {
4110 210 : ExprEvalStep *as = &state->steps[adjust_jumpnull];
4111 :
4112 : Assert(as->opcode == EEOP_AGG_PLAIN_PERGROUP_NULLCHECK);
4113 : Assert(as->d.agg_plain_pergroup_nullcheck.jumpnull == -1);
4114 210 : as->d.agg_plain_pergroup_nullcheck.jumpnull = state->steps_len;
4115 : }
4116 31829 : }
4117 :
4118 : /*
4119 : * Build an ExprState that calls the given hash function(s) on the attnums
4120 : * given by 'keyColIdx' . When numCols > 1, the hash values returned by each
4121 : * hash function are combined to produce a single hash value.
4122 : *
4123 : * desc: tuple descriptor for the to-be-hashed columns
4124 : * ops: TupleTableSlotOps to use for the give TupleDesc
4125 : * hashfunctions: FmgrInfos for each hash function to call, one per numCols.
4126 : * These are used directly in the returned ExprState so must remain allocated.
4127 : * collations: collation to use when calling the hash function.
4128 : * numCols: array length of hashfunctions, collations and keyColIdx.
4129 : * parent: PlanState node that the resulting ExprState will be evaluated at
4130 : * init_value: Normally 0, but can be set to other values to seed the hash
4131 : * with. Non-zero is marginally slower, so best to only use if it's provably
4132 : * worthwhile.
4133 : */
4134 : ExprState *
4135 4314 : ExecBuildHash32FromAttrs(TupleDesc desc, const TupleTableSlotOps *ops,
4136 : FmgrInfo *hashfunctions, Oid *collations,
4137 : int numCols, AttrNumber *keyColIdx,
4138 : PlanState *parent, uint32 init_value)
4139 : {
4140 4314 : ExprState *state = makeNode(ExprState);
4141 4314 : ExprEvalStep scratch = {0};
4142 4314 : NullableDatum *iresult = NULL;
4143 : intptr_t opcode;
4144 4314 : AttrNumber last_attnum = 0;
4145 :
4146 : Assert(numCols >= 0);
4147 :
4148 4314 : state->parent = parent;
4149 :
4150 : /*
4151 : * Make a place to store intermediate hash values between subsequent
4152 : * hashing of individual columns. We only need this if there is more than
4153 : * one column to hash or an initial value plus one column.
4154 : */
4155 4314 : if ((int64) numCols + (init_value != 0) > 1)
4156 1755 : iresult = palloc_object(NullableDatum);
4157 :
4158 : /* find the highest attnum so we deform the tuple to that point */
4159 11122 : for (int i = 0; i < numCols; i++)
4160 6808 : last_attnum = Max(last_attnum, keyColIdx[i]);
4161 :
4162 4314 : scratch.opcode = EEOP_INNER_FETCHSOME;
4163 4314 : scratch.d.fetch.last_var = last_attnum;
4164 4314 : scratch.d.fetch.fixed = false;
4165 4314 : scratch.d.fetch.kind = ops;
4166 4314 : scratch.d.fetch.known_desc = desc;
4167 4314 : if (ExecComputeSlotInfo(state, &scratch))
4168 2916 : ExprEvalPushStep(state, &scratch);
4169 :
4170 4314 : if (init_value == 0)
4171 : {
4172 : /*
4173 : * No initial value, so we can assign the result of the hash function
4174 : * for the first attribute without having to concern ourselves with
4175 : * combining the result with any initial value.
4176 : */
4177 3894 : opcode = EEOP_HASHDATUM_FIRST;
4178 : }
4179 : else
4180 : {
4181 : /*
4182 : * Set up operation to set the initial value. Normally we store this
4183 : * in the intermediate hash value location, but if there are no
4184 : * columns to hash, store it in the ExprState's result field.
4185 : */
4186 420 : scratch.opcode = EEOP_HASHDATUM_SET_INITVAL;
4187 420 : scratch.d.hashdatum_initvalue.init_value = UInt32GetDatum(init_value);
4188 420 : scratch.resvalue = numCols > 0 ? &iresult->value : &state->resvalue;
4189 420 : scratch.resnull = numCols > 0 ? &iresult->isnull : &state->resnull;
4190 :
4191 420 : ExprEvalPushStep(state, &scratch);
4192 :
4193 : /*
4194 : * When using an initial value use the NEXT32 ops as the FIRST ops
4195 : * would overwrite the stored initial value.
4196 : */
4197 420 : opcode = EEOP_HASHDATUM_NEXT32;
4198 : }
4199 :
4200 11122 : for (int i = 0; i < numCols; i++)
4201 : {
4202 : FmgrInfo *finfo;
4203 : FunctionCallInfo fcinfo;
4204 6808 : Oid inputcollid = collations[i];
4205 6808 : AttrNumber attnum = keyColIdx[i] - 1;
4206 :
4207 6808 : finfo = &hashfunctions[i];
4208 6808 : fcinfo = palloc0(SizeForFunctionCallInfo(1));
4209 :
4210 : /* Initialize function call parameter structure too */
4211 6808 : InitFunctionCallInfoData(*fcinfo, finfo, 1, inputcollid, NULL, NULL);
4212 :
4213 : /*
4214 : * Fetch inner Var for this attnum and store it in the 1st arg of the
4215 : * hash func.
4216 : */
4217 6808 : scratch.opcode = EEOP_INNER_VAR;
4218 6808 : scratch.resvalue = &fcinfo->args[0].value;
4219 6808 : scratch.resnull = &fcinfo->args[0].isnull;
4220 6808 : scratch.d.var.attnum = attnum;
4221 6808 : scratch.d.var.vartype = TupleDescAttr(desc, attnum)->atttypid;
4222 6808 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4223 :
4224 6808 : ExprEvalPushStep(state, &scratch);
4225 :
4226 : /* Call the hash function */
4227 6808 : scratch.opcode = opcode;
4228 :
4229 6808 : if (i == numCols - 1)
4230 : {
4231 : /*
4232 : * The result for hashing the final column is stored in the
4233 : * ExprState.
4234 : */
4235 4314 : scratch.resvalue = &state->resvalue;
4236 4314 : scratch.resnull = &state->resnull;
4237 : }
4238 : else
4239 : {
4240 : Assert(iresult != NULL);
4241 :
4242 : /* intermediate values are stored in an intermediate result */
4243 2494 : scratch.resvalue = &iresult->value;
4244 2494 : scratch.resnull = &iresult->isnull;
4245 : }
4246 :
4247 : /*
4248 : * NEXT32 opcodes need to look at the intermediate result. We might
4249 : * as well just set this for all ops. FIRSTs won't look at it.
4250 : */
4251 6808 : scratch.d.hashdatum.iresult = iresult;
4252 :
4253 6808 : scratch.d.hashdatum.finfo = finfo;
4254 6808 : scratch.d.hashdatum.fcinfo_data = fcinfo;
4255 6808 : scratch.d.hashdatum.fn_addr = finfo->fn_addr;
4256 6808 : scratch.d.hashdatum.jumpdone = -1;
4257 :
4258 6808 : ExprEvalPushStep(state, &scratch);
4259 :
4260 : /* subsequent attnums must be combined with the previous */
4261 6808 : opcode = EEOP_HASHDATUM_NEXT32;
4262 : }
4263 :
4264 4314 : scratch.resvalue = NULL;
4265 4314 : scratch.resnull = NULL;
4266 4314 : scratch.opcode = EEOP_DONE_RETURN;
4267 4314 : ExprEvalPushStep(state, &scratch);
4268 :
4269 4314 : ExecReadyExpr(state);
4270 :
4271 4314 : return state;
4272 : }
4273 :
4274 : /*
4275 : * Build an ExprState that calls the given hash function(s) on the given
4276 : * 'hash_exprs'. When multiple expressions are present, the hash values
4277 : * returned by each hash function are combined to produce a single hash value.
4278 : *
4279 : * desc: tuple descriptor for the to-be-hashed expressions
4280 : * ops: TupleTableSlotOps for the TupleDesc
4281 : * hashfunc_oids: Oid for each hash function to call, one for each 'hash_expr'
4282 : * collations: collation to use when calling the hash function.
4283 : * hash_expr: list of expressions to hash the value of
4284 : * opstrict: array corresponding to the 'hashfunc_oids' to store op_strict()
4285 : * parent: PlanState node that the 'hash_exprs' will be evaluated at
4286 : * init_value: Normally 0, but can be set to other values to seed the hash
4287 : * with some other value. Using non-zero is slightly less efficient but can
4288 : * be useful.
4289 : * keep_nulls: if true, evaluation of the returned ExprState will abort early
4290 : * returning NULL if the given hash function is strict and the Datum to hash
4291 : * is null. When set to false, any NULL input Datums are skipped.
4292 : */
4293 : ExprState *
4294 36304 : ExecBuildHash32Expr(TupleDesc desc, const TupleTableSlotOps *ops,
4295 : const Oid *hashfunc_oids, const List *collations,
4296 : const List *hash_exprs, const bool *opstrict,
4297 : PlanState *parent, uint32 init_value, bool keep_nulls)
4298 : {
4299 36304 : ExprState *state = makeNode(ExprState);
4300 36304 : ExprEvalStep scratch = {0};
4301 36304 : NullableDatum *iresult = NULL;
4302 36304 : List *adjust_jumps = NIL;
4303 : ListCell *lc;
4304 : ListCell *lc2;
4305 : intptr_t strict_opcode;
4306 : intptr_t opcode;
4307 36304 : int num_exprs = list_length(hash_exprs);
4308 :
4309 : Assert(num_exprs == list_length(collations));
4310 :
4311 36304 : state->parent = parent;
4312 :
4313 : /* Insert setup steps as needed. */
4314 36304 : ExecCreateExprSetupSteps(state, (Node *) hash_exprs);
4315 :
4316 : /*
4317 : * Make a place to store intermediate hash values between subsequent
4318 : * hashing of individual expressions. We only need this if there is more
4319 : * than one expression to hash or an initial value plus one expression.
4320 : */
4321 36304 : if ((int64) num_exprs + (init_value != 0) > 1)
4322 3242 : iresult = palloc_object(NullableDatum);
4323 :
4324 36304 : if (init_value == 0)
4325 : {
4326 : /*
4327 : * No initial value, so we can assign the result of the hash function
4328 : * for the first hash_expr without having to concern ourselves with
4329 : * combining the result with any initial value.
4330 : */
4331 36304 : strict_opcode = EEOP_HASHDATUM_FIRST_STRICT;
4332 36304 : opcode = EEOP_HASHDATUM_FIRST;
4333 : }
4334 : else
4335 : {
4336 : /*
4337 : * Set up operation to set the initial value. Normally we store this
4338 : * in the intermediate hash value location, but if there are no exprs
4339 : * to hash, store it in the ExprState's result field.
4340 : */
4341 0 : scratch.opcode = EEOP_HASHDATUM_SET_INITVAL;
4342 0 : scratch.d.hashdatum_initvalue.init_value = UInt32GetDatum(init_value);
4343 0 : scratch.resvalue = num_exprs > 0 ? &iresult->value : &state->resvalue;
4344 0 : scratch.resnull = num_exprs > 0 ? &iresult->isnull : &state->resnull;
4345 :
4346 0 : ExprEvalPushStep(state, &scratch);
4347 :
4348 : /*
4349 : * When using an initial value use the NEXT32/NEXT32_STRICT ops as the
4350 : * FIRST/FIRST_STRICT ops would overwrite the stored initial value.
4351 : */
4352 0 : strict_opcode = EEOP_HASHDATUM_NEXT32_STRICT;
4353 0 : opcode = EEOP_HASHDATUM_NEXT32;
4354 : }
4355 :
4356 75934 : forboth(lc, hash_exprs, lc2, collations)
4357 : {
4358 39630 : Expr *expr = (Expr *) lfirst(lc);
4359 : FmgrInfo *finfo;
4360 : FunctionCallInfo fcinfo;
4361 39630 : int i = foreach_current_index(lc);
4362 : Oid funcid;
4363 39630 : Oid inputcollid = lfirst_oid(lc2);
4364 :
4365 39630 : funcid = hashfunc_oids[i];
4366 :
4367 : /* Allocate hash function lookup data. */
4368 39630 : finfo = palloc0_object(FmgrInfo);
4369 39630 : fcinfo = palloc0(SizeForFunctionCallInfo(1));
4370 :
4371 39630 : fmgr_info(funcid, finfo);
4372 :
4373 : /*
4374 : * Build the steps to evaluate the hash function's argument have it so
4375 : * the value of that is stored in the 0th argument of the hash func.
4376 : */
4377 39630 : ExecInitExprRec(expr,
4378 : state,
4379 : &fcinfo->args[0].value,
4380 : &fcinfo->args[0].isnull);
4381 :
4382 39630 : if (i == num_exprs - 1)
4383 : {
4384 : /* the result for hashing the final expr is stored in the state */
4385 36304 : scratch.resvalue = &state->resvalue;
4386 36304 : scratch.resnull = &state->resnull;
4387 : }
4388 : else
4389 : {
4390 : Assert(iresult != NULL);
4391 :
4392 : /* intermediate values are stored in an intermediate result */
4393 3326 : scratch.resvalue = &iresult->value;
4394 3326 : scratch.resnull = &iresult->isnull;
4395 : }
4396 :
4397 : /*
4398 : * NEXT32 opcodes need to look at the intermediate result. We might
4399 : * as well just set this for all ops. FIRSTs won't look at it.
4400 : */
4401 39630 : scratch.d.hashdatum.iresult = iresult;
4402 :
4403 : /* Initialize function call parameter structure too */
4404 39630 : InitFunctionCallInfoData(*fcinfo, finfo, 1, inputcollid, NULL, NULL);
4405 :
4406 39630 : scratch.d.hashdatum.finfo = finfo;
4407 39630 : scratch.d.hashdatum.fcinfo_data = fcinfo;
4408 39630 : scratch.d.hashdatum.fn_addr = finfo->fn_addr;
4409 :
4410 39630 : scratch.opcode = opstrict[i] && !keep_nulls ? strict_opcode : opcode;
4411 39630 : scratch.d.hashdatum.jumpdone = -1;
4412 :
4413 39630 : ExprEvalPushStep(state, &scratch);
4414 39630 : adjust_jumps = lappend_int(adjust_jumps, state->steps_len - 1);
4415 :
4416 : /*
4417 : * For subsequent keys we must combine the hash value with the
4418 : * previous hashes.
4419 : */
4420 39630 : strict_opcode = EEOP_HASHDATUM_NEXT32_STRICT;
4421 39630 : opcode = EEOP_HASHDATUM_NEXT32;
4422 : }
4423 :
4424 : /* adjust jump targets */
4425 75934 : foreach(lc, adjust_jumps)
4426 : {
4427 39630 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4428 :
4429 : Assert(as->opcode == EEOP_HASHDATUM_FIRST ||
4430 : as->opcode == EEOP_HASHDATUM_FIRST_STRICT ||
4431 : as->opcode == EEOP_HASHDATUM_NEXT32 ||
4432 : as->opcode == EEOP_HASHDATUM_NEXT32_STRICT);
4433 : Assert(as->d.hashdatum.jumpdone == -1);
4434 39630 : as->d.hashdatum.jumpdone = state->steps_len;
4435 : }
4436 :
4437 36304 : scratch.resvalue = NULL;
4438 36304 : scratch.resnull = NULL;
4439 36304 : scratch.opcode = EEOP_DONE_RETURN;
4440 36304 : ExprEvalPushStep(state, &scratch);
4441 :
4442 36304 : ExecReadyExpr(state);
4443 :
4444 36304 : return state;
4445 : }
4446 :
4447 : /*
4448 : * Build equality expression that can be evaluated using ExecQual(), returning
4449 : * true if the expression context's inner/outer tuple are NOT DISTINCT. I.e
4450 : * two nulls match, a null and a not-null don't match.
4451 : *
4452 : * desc: tuple descriptor of the to-be-compared tuples
4453 : * numCols: the number of attributes to be examined
4454 : * keyColIdx: array of attribute column numbers
4455 : * eqFunctions: array of function oids of the equality functions to use
4456 : * parent: parent executor node
4457 : */
4458 : ExprState *
4459 10363 : ExecBuildGroupingEqual(TupleDesc ldesc, TupleDesc rdesc,
4460 : const TupleTableSlotOps *lops, const TupleTableSlotOps *rops,
4461 : int numCols,
4462 : const AttrNumber *keyColIdx,
4463 : const Oid *eqfunctions,
4464 : const Oid *collations,
4465 : PlanState *parent)
4466 : {
4467 10363 : ExprState *state = makeNode(ExprState);
4468 10363 : ExprEvalStep scratch = {0};
4469 10363 : int maxatt = -1;
4470 10363 : List *adjust_jumps = NIL;
4471 : ListCell *lc;
4472 :
4473 : /*
4474 : * When no columns are actually compared, the result's always true. See
4475 : * special case in ExecQual().
4476 : */
4477 10363 : if (numCols == 0)
4478 0 : return NULL;
4479 :
4480 10363 : state->expr = NULL;
4481 10363 : state->flags = EEO_FLAG_IS_QUAL;
4482 10363 : state->parent = parent;
4483 :
4484 10363 : scratch.resvalue = &state->resvalue;
4485 10363 : scratch.resnull = &state->resnull;
4486 :
4487 : /* compute max needed attribute */
4488 27549 : for (int natt = 0; natt < numCols; natt++)
4489 : {
4490 17186 : int attno = keyColIdx[natt];
4491 :
4492 17186 : if (attno > maxatt)
4493 16998 : maxatt = attno;
4494 : }
4495 : Assert(maxatt >= 0);
4496 :
4497 : /* push deform steps */
4498 10363 : scratch.opcode = EEOP_INNER_FETCHSOME;
4499 10363 : scratch.d.fetch.last_var = maxatt;
4500 10363 : scratch.d.fetch.fixed = false;
4501 10363 : scratch.d.fetch.known_desc = ldesc;
4502 10363 : scratch.d.fetch.kind = lops;
4503 10363 : if (ExecComputeSlotInfo(state, &scratch))
4504 8965 : ExprEvalPushStep(state, &scratch);
4505 :
4506 10363 : scratch.opcode = EEOP_OUTER_FETCHSOME;
4507 10363 : scratch.d.fetch.last_var = maxatt;
4508 10363 : scratch.d.fetch.fixed = false;
4509 10363 : scratch.d.fetch.known_desc = rdesc;
4510 10363 : scratch.d.fetch.kind = rops;
4511 10363 : if (ExecComputeSlotInfo(state, &scratch))
4512 10363 : ExprEvalPushStep(state, &scratch);
4513 :
4514 : /*
4515 : * Start comparing at the last field (least significant sort key). That's
4516 : * the most likely to be different if we are dealing with sorted input.
4517 : */
4518 27549 : for (int natt = numCols; --natt >= 0;)
4519 : {
4520 17186 : int attno = keyColIdx[natt];
4521 17186 : Form_pg_attribute latt = TupleDescAttr(ldesc, attno - 1);
4522 17186 : Form_pg_attribute ratt = TupleDescAttr(rdesc, attno - 1);
4523 17186 : Oid foid = eqfunctions[natt];
4524 17186 : Oid collid = collations[natt];
4525 : FmgrInfo *finfo;
4526 : FunctionCallInfo fcinfo;
4527 : AclResult aclresult;
4528 :
4529 : /* Check permission to call function */
4530 17186 : aclresult = object_aclcheck(ProcedureRelationId, foid, GetUserId(), ACL_EXECUTE);
4531 17186 : if (aclresult != ACLCHECK_OK)
4532 0 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(foid));
4533 :
4534 17186 : InvokeFunctionExecuteHook(foid);
4535 :
4536 : /* Set up the primary fmgr lookup information */
4537 17186 : finfo = palloc0_object(FmgrInfo);
4538 17186 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
4539 17186 : fmgr_info(foid, finfo);
4540 17186 : fmgr_info_set_expr(NULL, finfo);
4541 17186 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
4542 : collid, NULL, NULL);
4543 :
4544 : /* left arg */
4545 17186 : scratch.opcode = EEOP_INNER_VAR;
4546 17186 : scratch.d.var.attnum = attno - 1;
4547 17186 : scratch.d.var.vartype = latt->atttypid;
4548 17186 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4549 17186 : scratch.resvalue = &fcinfo->args[0].value;
4550 17186 : scratch.resnull = &fcinfo->args[0].isnull;
4551 17186 : ExprEvalPushStep(state, &scratch);
4552 :
4553 : /* right arg */
4554 17186 : scratch.opcode = EEOP_OUTER_VAR;
4555 17186 : scratch.d.var.attnum = attno - 1;
4556 17186 : scratch.d.var.vartype = ratt->atttypid;
4557 17186 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4558 17186 : scratch.resvalue = &fcinfo->args[1].value;
4559 17186 : scratch.resnull = &fcinfo->args[1].isnull;
4560 17186 : ExprEvalPushStep(state, &scratch);
4561 :
4562 : /* evaluate distinctness */
4563 17186 : scratch.opcode = EEOP_NOT_DISTINCT;
4564 17186 : scratch.d.func.finfo = finfo;
4565 17186 : scratch.d.func.fcinfo_data = fcinfo;
4566 17186 : scratch.d.func.fn_addr = finfo->fn_addr;
4567 17186 : scratch.d.func.nargs = 2;
4568 17186 : scratch.resvalue = &state->resvalue;
4569 17186 : scratch.resnull = &state->resnull;
4570 17186 : ExprEvalPushStep(state, &scratch);
4571 :
4572 : /* then emit EEOP_QUAL to detect if result is false (or null) */
4573 17186 : scratch.opcode = EEOP_QUAL;
4574 17186 : scratch.d.qualexpr.jumpdone = -1;
4575 17186 : scratch.resvalue = &state->resvalue;
4576 17186 : scratch.resnull = &state->resnull;
4577 17186 : ExprEvalPushStep(state, &scratch);
4578 17186 : adjust_jumps = lappend_int(adjust_jumps,
4579 17186 : state->steps_len - 1);
4580 : }
4581 :
4582 : /* adjust jump targets */
4583 27549 : foreach(lc, adjust_jumps)
4584 : {
4585 17186 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4586 :
4587 : Assert(as->opcode == EEOP_QUAL);
4588 : Assert(as->d.qualexpr.jumpdone == -1);
4589 17186 : as->d.qualexpr.jumpdone = state->steps_len;
4590 : }
4591 :
4592 10363 : scratch.resvalue = NULL;
4593 10363 : scratch.resnull = NULL;
4594 10363 : scratch.opcode = EEOP_DONE_RETURN;
4595 10363 : ExprEvalPushStep(state, &scratch);
4596 :
4597 10363 : ExecReadyExpr(state);
4598 :
4599 10363 : return state;
4600 : }
4601 :
4602 : /*
4603 : * Build equality expression that can be evaluated using ExecQual(), returning
4604 : * true if the expression context's inner/outer tuples are equal. Datums in
4605 : * the inner/outer slots are assumed to be in the same order and quantity as
4606 : * the 'eqfunctions' parameter. NULLs are treated as equal.
4607 : *
4608 : * desc: tuple descriptor of the to-be-compared tuples
4609 : * lops: the slot ops for the inner tuple slots
4610 : * rops: the slot ops for the outer tuple slots
4611 : * eqFunctions: array of function oids of the equality functions to use
4612 : * this must be the same length as the 'param_exprs' list.
4613 : * collations: collation Oids to use for equality comparison. Must be the
4614 : * same length as the 'param_exprs' list.
4615 : * parent: parent executor node
4616 : */
4617 : ExprState *
4618 998 : ExecBuildParamSetEqual(TupleDesc desc,
4619 : const TupleTableSlotOps *lops,
4620 : const TupleTableSlotOps *rops,
4621 : const Oid *eqfunctions,
4622 : const Oid *collations,
4623 : const List *param_exprs,
4624 : PlanState *parent)
4625 : {
4626 998 : ExprState *state = makeNode(ExprState);
4627 998 : ExprEvalStep scratch = {0};
4628 998 : int maxatt = list_length(param_exprs);
4629 998 : List *adjust_jumps = NIL;
4630 : ListCell *lc;
4631 :
4632 998 : state->expr = NULL;
4633 998 : state->flags = EEO_FLAG_IS_QUAL;
4634 998 : state->parent = parent;
4635 :
4636 998 : scratch.resvalue = &state->resvalue;
4637 998 : scratch.resnull = &state->resnull;
4638 :
4639 : /* push deform steps */
4640 998 : scratch.opcode = EEOP_INNER_FETCHSOME;
4641 998 : scratch.d.fetch.last_var = maxatt;
4642 998 : scratch.d.fetch.fixed = false;
4643 998 : scratch.d.fetch.known_desc = desc;
4644 998 : scratch.d.fetch.kind = lops;
4645 998 : if (ExecComputeSlotInfo(state, &scratch))
4646 998 : ExprEvalPushStep(state, &scratch);
4647 :
4648 998 : scratch.opcode = EEOP_OUTER_FETCHSOME;
4649 998 : scratch.d.fetch.last_var = maxatt;
4650 998 : scratch.d.fetch.fixed = false;
4651 998 : scratch.d.fetch.known_desc = desc;
4652 998 : scratch.d.fetch.kind = rops;
4653 998 : if (ExecComputeSlotInfo(state, &scratch))
4654 0 : ExprEvalPushStep(state, &scratch);
4655 :
4656 2028 : for (int attno = 0; attno < maxatt; attno++)
4657 : {
4658 1030 : Form_pg_attribute att = TupleDescAttr(desc, attno);
4659 1030 : Oid foid = eqfunctions[attno];
4660 1030 : Oid collid = collations[attno];
4661 : FmgrInfo *finfo;
4662 : FunctionCallInfo fcinfo;
4663 : AclResult aclresult;
4664 :
4665 : /* Check permission to call function */
4666 1030 : aclresult = object_aclcheck(ProcedureRelationId, foid, GetUserId(), ACL_EXECUTE);
4667 1030 : if (aclresult != ACLCHECK_OK)
4668 0 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(foid));
4669 :
4670 1030 : InvokeFunctionExecuteHook(foid);
4671 :
4672 : /* Set up the primary fmgr lookup information */
4673 1030 : finfo = palloc0_object(FmgrInfo);
4674 1030 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
4675 1030 : fmgr_info(foid, finfo);
4676 1030 : fmgr_info_set_expr(NULL, finfo);
4677 1030 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
4678 : collid, NULL, NULL);
4679 :
4680 : /* left arg */
4681 1030 : scratch.opcode = EEOP_INNER_VAR;
4682 1030 : scratch.d.var.attnum = attno;
4683 1030 : scratch.d.var.vartype = att->atttypid;
4684 1030 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4685 1030 : scratch.resvalue = &fcinfo->args[0].value;
4686 1030 : scratch.resnull = &fcinfo->args[0].isnull;
4687 1030 : ExprEvalPushStep(state, &scratch);
4688 :
4689 : /* right arg */
4690 1030 : scratch.opcode = EEOP_OUTER_VAR;
4691 1030 : scratch.d.var.attnum = attno;
4692 1030 : scratch.d.var.vartype = att->atttypid;
4693 1030 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4694 1030 : scratch.resvalue = &fcinfo->args[1].value;
4695 1030 : scratch.resnull = &fcinfo->args[1].isnull;
4696 1030 : ExprEvalPushStep(state, &scratch);
4697 :
4698 : /* evaluate distinctness */
4699 1030 : scratch.opcode = EEOP_NOT_DISTINCT;
4700 1030 : scratch.d.func.finfo = finfo;
4701 1030 : scratch.d.func.fcinfo_data = fcinfo;
4702 1030 : scratch.d.func.fn_addr = finfo->fn_addr;
4703 1030 : scratch.d.func.nargs = 2;
4704 1030 : scratch.resvalue = &state->resvalue;
4705 1030 : scratch.resnull = &state->resnull;
4706 1030 : ExprEvalPushStep(state, &scratch);
4707 :
4708 : /* then emit EEOP_QUAL to detect if result is false (or null) */
4709 1030 : scratch.opcode = EEOP_QUAL;
4710 1030 : scratch.d.qualexpr.jumpdone = -1;
4711 1030 : scratch.resvalue = &state->resvalue;
4712 1030 : scratch.resnull = &state->resnull;
4713 1030 : ExprEvalPushStep(state, &scratch);
4714 1030 : adjust_jumps = lappend_int(adjust_jumps,
4715 1030 : state->steps_len - 1);
4716 : }
4717 :
4718 : /* adjust jump targets */
4719 2028 : foreach(lc, adjust_jumps)
4720 : {
4721 1030 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4722 :
4723 : Assert(as->opcode == EEOP_QUAL);
4724 : Assert(as->d.qualexpr.jumpdone == -1);
4725 1030 : as->d.qualexpr.jumpdone = state->steps_len;
4726 : }
4727 :
4728 998 : scratch.resvalue = NULL;
4729 998 : scratch.resnull = NULL;
4730 998 : scratch.opcode = EEOP_DONE_RETURN;
4731 998 : ExprEvalPushStep(state, &scratch);
4732 :
4733 998 : ExecReadyExpr(state);
4734 :
4735 998 : return state;
4736 : }
4737 :
4738 : /*
4739 : * Push steps to evaluate a JsonExpr and its various subsidiary expressions.
4740 : */
4741 : static void
4742 1156 : ExecInitJsonExpr(JsonExpr *jsexpr, ExprState *state,
4743 : Datum *resv, bool *resnull,
4744 : ExprEvalStep *scratch)
4745 : {
4746 1156 : JsonExprState *jsestate = palloc0_object(JsonExprState);
4747 : ListCell *argexprlc;
4748 : ListCell *argnamelc;
4749 1156 : List *jumps_return_null = NIL;
4750 1156 : List *jumps_to_end = NIL;
4751 : ListCell *lc;
4752 : ErrorSaveContext *escontext;
4753 1156 : bool returning_domain =
4754 1156 : get_typtype(jsexpr->returning->typid) == TYPTYPE_DOMAIN;
4755 :
4756 : Assert(jsexpr->on_error != NULL);
4757 :
4758 1156 : jsestate->jsexpr = jsexpr;
4759 :
4760 : /*
4761 : * Evaluate formatted_expr storing the result into
4762 : * jsestate->formatted_expr.
4763 : */
4764 1156 : ExecInitExprRec((Expr *) jsexpr->formatted_expr, state,
4765 : &jsestate->formatted_expr.value,
4766 : &jsestate->formatted_expr.isnull);
4767 :
4768 : /* JUMP to return NULL if formatted_expr evaluates to NULL */
4769 1156 : jumps_return_null = lappend_int(jumps_return_null, state->steps_len);
4770 1156 : scratch->opcode = EEOP_JUMP_IF_NULL;
4771 1156 : scratch->resnull = &jsestate->formatted_expr.isnull;
4772 1156 : scratch->d.jump.jumpdone = -1; /* set below */
4773 1156 : ExprEvalPushStep(state, scratch);
4774 :
4775 : /*
4776 : * Evaluate pathspec expression storing the result into
4777 : * jsestate->pathspec.
4778 : */
4779 1156 : ExecInitExprRec((Expr *) jsexpr->path_spec, state,
4780 : &jsestate->pathspec.value,
4781 : &jsestate->pathspec.isnull);
4782 :
4783 : /* JUMP to return NULL if path_spec evaluates to NULL */
4784 1156 : jumps_return_null = lappend_int(jumps_return_null, state->steps_len);
4785 1156 : scratch->opcode = EEOP_JUMP_IF_NULL;
4786 1156 : scratch->resnull = &jsestate->pathspec.isnull;
4787 1156 : scratch->d.jump.jumpdone = -1; /* set below */
4788 1156 : ExprEvalPushStep(state, scratch);
4789 :
4790 : /* Steps to compute PASSING args. */
4791 1156 : jsestate->args = NIL;
4792 1609 : forboth(argexprlc, jsexpr->passing_values,
4793 : argnamelc, jsexpr->passing_names)
4794 : {
4795 453 : Expr *argexpr = (Expr *) lfirst(argexprlc);
4796 453 : String *argname = lfirst_node(String, argnamelc);
4797 453 : JsonPathVariable *var = palloc_object(JsonPathVariable);
4798 :
4799 453 : var->name = argname->sval;
4800 453 : var->namelen = strlen(var->name);
4801 453 : var->typid = exprType((Node *) argexpr);
4802 453 : var->typmod = exprTypmod((Node *) argexpr);
4803 :
4804 453 : ExecInitExprRec(argexpr, state, &var->value, &var->isnull);
4805 :
4806 453 : jsestate->args = lappend(jsestate->args, var);
4807 : }
4808 :
4809 : /* Step for jsonpath evaluation; see ExecEvalJsonExprPath(). */
4810 1156 : scratch->opcode = EEOP_JSONEXPR_PATH;
4811 1156 : scratch->resvalue = resv;
4812 1156 : scratch->resnull = resnull;
4813 1156 : scratch->d.jsonexpr.jsestate = jsestate;
4814 1156 : ExprEvalPushStep(state, scratch);
4815 :
4816 : /*
4817 : * Step to return NULL after jumping to skip the EEOP_JSONEXPR_PATH step
4818 : * when either formatted_expr or pathspec is NULL. Adjust jump target
4819 : * addresses of JUMPs that we added above.
4820 : */
4821 3468 : foreach(lc, jumps_return_null)
4822 : {
4823 2312 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4824 :
4825 2312 : as->d.jump.jumpdone = state->steps_len;
4826 : }
4827 1156 : scratch->opcode = EEOP_CONST;
4828 1156 : scratch->resvalue = resv;
4829 1156 : scratch->resnull = resnull;
4830 1156 : scratch->d.constval.value = (Datum) 0;
4831 1156 : scratch->d.constval.isnull = true;
4832 1156 : ExprEvalPushStep(state, scratch);
4833 :
4834 2312 : escontext = jsexpr->on_error->btype != JSON_BEHAVIOR_ERROR ?
4835 1156 : &jsestate->escontext : NULL;
4836 :
4837 : /*
4838 : * To handle coercion errors softly, use the following ErrorSaveContext to
4839 : * pass to ExecInitExprRec() when initializing the coercion expressions
4840 : * and in the EEOP_JSONEXPR_COERCION step.
4841 : */
4842 1156 : jsestate->escontext.type = T_ErrorSaveContext;
4843 :
4844 : /*
4845 : * Steps to coerce the result value computed by EEOP_JSONEXPR_PATH or the
4846 : * NULL returned on NULL input as described above.
4847 : */
4848 1156 : jsestate->jump_eval_coercion = -1;
4849 1156 : if (jsexpr->use_json_coercion)
4850 : {
4851 444 : jsestate->jump_eval_coercion = state->steps_len;
4852 :
4853 444 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
4854 444 : jsexpr->omit_quotes,
4855 444 : jsexpr->op == JSON_EXISTS_OP,
4856 : resv, resnull);
4857 : }
4858 712 : else if (jsexpr->use_io_coercion)
4859 : {
4860 : /*
4861 : * Here we only need to initialize the FunctionCallInfo for the target
4862 : * type's input function, which is called by ExecEvalJsonExprPath()
4863 : * itself, so no additional step is necessary.
4864 : */
4865 : Oid typinput;
4866 : Oid typioparam;
4867 : FmgrInfo *finfo;
4868 : FunctionCallInfo fcinfo;
4869 :
4870 325 : getTypeInputInfo(jsexpr->returning->typid, &typinput, &typioparam);
4871 325 : finfo = palloc0_object(FmgrInfo);
4872 325 : fcinfo = palloc0(SizeForFunctionCallInfo(3));
4873 325 : fmgr_info(typinput, finfo);
4874 325 : fmgr_info_set_expr((Node *) jsexpr->returning, finfo);
4875 325 : InitFunctionCallInfoData(*fcinfo, finfo, 3, InvalidOid, NULL, NULL);
4876 :
4877 : /*
4878 : * We can preload the second and third arguments for the input
4879 : * function, since they're constants.
4880 : */
4881 325 : fcinfo->args[1].value = ObjectIdGetDatum(typioparam);
4882 325 : fcinfo->args[1].isnull = false;
4883 325 : fcinfo->args[2].value = Int32GetDatum(jsexpr->returning->typmod);
4884 325 : fcinfo->args[2].isnull = false;
4885 325 : fcinfo->context = (Node *) escontext;
4886 :
4887 325 : jsestate->input_fcinfo = fcinfo;
4888 : }
4889 :
4890 : /*
4891 : * Add a special step, if needed, to check if the coercion evaluation ran
4892 : * into an error but was not thrown because the ON ERROR behavior is not
4893 : * ERROR. It will set jsestate->error if an error did occur.
4894 : */
4895 1156 : if (jsestate->jump_eval_coercion >= 0 && escontext != NULL)
4896 : {
4897 333 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
4898 333 : scratch->d.jsonexpr.jsestate = jsestate;
4899 333 : ExprEvalPushStep(state, scratch);
4900 : }
4901 :
4902 1156 : jsestate->jump_empty = jsestate->jump_error = -1;
4903 :
4904 : /*
4905 : * Step to check jsestate->error and return the ON ERROR expression if
4906 : * there is one. This handles both the errors that occur during jsonpath
4907 : * evaluation in EEOP_JSONEXPR_PATH and subsequent coercion evaluation.
4908 : *
4909 : * Speed up common cases by avoiding extra steps for a NULL-valued ON
4910 : * ERROR expression unless RETURNING a domain type, where constraints must
4911 : * be checked. ExecEvalJsonExprPath() already returns NULL on error,
4912 : * making additional steps unnecessary in typical scenarios. Note that the
4913 : * default ON ERROR behavior for JSON_VALUE() and JSON_QUERY() is to
4914 : * return NULL.
4915 : */
4916 1156 : if (jsexpr->on_error->btype != JSON_BEHAVIOR_ERROR &&
4917 943 : (!(IsA(jsexpr->on_error->expr, Const) &&
4918 919 : ((Const *) jsexpr->on_error->expr)->constisnull) ||
4919 : returning_domain))
4920 : {
4921 : ErrorSaveContext *saved_escontext;
4922 :
4923 297 : jsestate->jump_error = state->steps_len;
4924 :
4925 : /* JUMP to end if false, that is, skip the ON ERROR expression. */
4926 297 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4927 297 : scratch->opcode = EEOP_JUMP_IF_NOT_TRUE;
4928 297 : scratch->resvalue = &jsestate->error.value;
4929 297 : scratch->resnull = &jsestate->error.isnull;
4930 297 : scratch->d.jump.jumpdone = -1; /* set below */
4931 297 : ExprEvalPushStep(state, scratch);
4932 :
4933 : /*
4934 : * Steps to evaluate the ON ERROR expression; handle errors softly to
4935 : * rethrow them in COERCION_FINISH step that will be added later.
4936 : */
4937 297 : saved_escontext = state->escontext;
4938 297 : state->escontext = escontext;
4939 297 : ExecInitExprRec((Expr *) jsexpr->on_error->expr,
4940 : state, resv, resnull);
4941 297 : state->escontext = saved_escontext;
4942 :
4943 : /* Step to coerce the ON ERROR expression if needed */
4944 297 : if (jsexpr->on_error->coerce)
4945 87 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
4946 87 : jsexpr->omit_quotes, false,
4947 : resv, resnull);
4948 :
4949 : /*
4950 : * Add a COERCION_FINISH step to check for errors that may occur when
4951 : * coercing and rethrow them.
4952 : */
4953 297 : if (jsexpr->on_error->coerce ||
4954 210 : IsA(jsexpr->on_error->expr, CoerceViaIO) ||
4955 210 : IsA(jsexpr->on_error->expr, CoerceToDomain))
4956 : {
4957 111 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
4958 111 : scratch->resvalue = resv;
4959 111 : scratch->resnull = resnull;
4960 111 : scratch->d.jsonexpr.jsestate = jsestate;
4961 111 : ExprEvalPushStep(state, scratch);
4962 : }
4963 :
4964 : /* JUMP to end to skip the ON EMPTY steps added below. */
4965 297 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4966 297 : scratch->opcode = EEOP_JUMP;
4967 297 : scratch->d.jump.jumpdone = -1;
4968 297 : ExprEvalPushStep(state, scratch);
4969 : }
4970 :
4971 : /*
4972 : * Step to check jsestate->empty and return the ON EMPTY expression if
4973 : * there is one.
4974 : *
4975 : * See the comment above for details on the optimization for NULL-valued
4976 : * expressions.
4977 : */
4978 1156 : if (jsexpr->on_empty != NULL &&
4979 994 : jsexpr->on_empty->btype != JSON_BEHAVIOR_ERROR &&
4980 961 : (!(IsA(jsexpr->on_empty->expr, Const) &&
4981 934 : ((Const *) jsexpr->on_empty->expr)->constisnull) ||
4982 : returning_domain))
4983 : {
4984 : ErrorSaveContext *saved_escontext;
4985 :
4986 192 : jsestate->jump_empty = state->steps_len;
4987 :
4988 : /* JUMP to end if false, that is, skip the ON EMPTY expression. */
4989 192 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4990 192 : scratch->opcode = EEOP_JUMP_IF_NOT_TRUE;
4991 192 : scratch->resvalue = &jsestate->empty.value;
4992 192 : scratch->resnull = &jsestate->empty.isnull;
4993 192 : scratch->d.jump.jumpdone = -1; /* set below */
4994 192 : ExprEvalPushStep(state, scratch);
4995 :
4996 : /*
4997 : * Steps to evaluate the ON EMPTY expression; handle errors softly to
4998 : * rethrow them in COERCION_FINISH step that will be added later.
4999 : */
5000 192 : saved_escontext = state->escontext;
5001 192 : state->escontext = escontext;
5002 192 : ExecInitExprRec((Expr *) jsexpr->on_empty->expr,
5003 : state, resv, resnull);
5004 192 : state->escontext = saved_escontext;
5005 :
5006 : /* Step to coerce the ON EMPTY expression if needed */
5007 192 : if (jsexpr->on_empty->coerce)
5008 87 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
5009 87 : jsexpr->omit_quotes, false,
5010 : resv, resnull);
5011 :
5012 : /*
5013 : * Add a COERCION_FINISH step to check for errors that may occur when
5014 : * coercing and rethrow them.
5015 : */
5016 192 : if (jsexpr->on_empty->coerce ||
5017 105 : IsA(jsexpr->on_empty->expr, CoerceViaIO) ||
5018 105 : IsA(jsexpr->on_empty->expr, CoerceToDomain))
5019 : {
5020 :
5021 114 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
5022 114 : scratch->resvalue = resv;
5023 114 : scratch->resnull = resnull;
5024 114 : scratch->d.jsonexpr.jsestate = jsestate;
5025 114 : ExprEvalPushStep(state, scratch);
5026 : }
5027 : }
5028 :
5029 1942 : foreach(lc, jumps_to_end)
5030 : {
5031 786 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
5032 :
5033 786 : as->d.jump.jumpdone = state->steps_len;
5034 : }
5035 :
5036 1156 : jsestate->jump_end = state->steps_len;
5037 1156 : }
5038 :
5039 : /*
5040 : * Initialize a EEOP_JSONEXPR_COERCION step to coerce the value given in resv
5041 : * to the given RETURNING type.
5042 : */
5043 : static void
5044 618 : ExecInitJsonCoercion(ExprState *state, JsonReturning *returning,
5045 : ErrorSaveContext *escontext, bool omit_quotes,
5046 : bool exists_coerce,
5047 : Datum *resv, bool *resnull)
5048 : {
5049 618 : ExprEvalStep scratch = {0};
5050 :
5051 : /* For json_populate_type() */
5052 618 : scratch.opcode = EEOP_JSONEXPR_COERCION;
5053 618 : scratch.resvalue = resv;
5054 618 : scratch.resnull = resnull;
5055 618 : scratch.d.jsonexpr_coercion.targettype = returning->typid;
5056 618 : scratch.d.jsonexpr_coercion.targettypmod = returning->typmod;
5057 618 : scratch.d.jsonexpr_coercion.json_coercion_cache = NULL;
5058 618 : scratch.d.jsonexpr_coercion.escontext = escontext;
5059 618 : scratch.d.jsonexpr_coercion.omit_quotes = omit_quotes;
5060 618 : scratch.d.jsonexpr_coercion.exists_coerce = exists_coerce;
5061 678 : scratch.d.jsonexpr_coercion.exists_cast_to_int = exists_coerce &&
5062 60 : getBaseType(returning->typid) == INT4OID;
5063 678 : scratch.d.jsonexpr_coercion.exists_check_domain = exists_coerce &&
5064 60 : DomainHasConstraints(returning->typid);
5065 618 : ExprEvalPushStep(state, &scratch);
5066 618 : }
|
