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 1038620 : ExecInitExpr(Expr *node, PlanState *parent)
144 : {
145 : ExprState *state;
146 1038620 : ExprEvalStep scratch = {0};
147 :
148 : /* Special case: NULL expression produces a NULL ExprState pointer */
149 1038620 : if (node == NULL)
150 56928 : return NULL;
151 :
152 : /* Initialize ExprState with empty step list */
153 981692 : state = makeNode(ExprState);
154 981692 : state->expr = node;
155 981692 : state->parent = parent;
156 981692 : state->ext_params = NULL;
157 :
158 : /* Insert setup steps as needed */
159 981692 : ExecCreateExprSetupSteps(state, (Node *) node);
160 :
161 : /* Compile the expression proper */
162 981692 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
163 :
164 : /* Finally, append a DONE step */
165 981662 : scratch.opcode = EEOP_DONE_RETURN;
166 981662 : ExprEvalPushStep(state, &scratch);
167 :
168 981662 : ExecReadyExpr(state);
169 :
170 981662 : 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 81648 : ExecInitExprWithParams(Expr *node, ParamListInfo ext_params)
181 : {
182 : ExprState *state;
183 81648 : ExprEvalStep scratch = {0};
184 :
185 : /* Special case: NULL expression produces a NULL ExprState pointer */
186 81648 : if (node == NULL)
187 0 : return NULL;
188 :
189 : /* Initialize ExprState with empty step list */
190 81648 : state = makeNode(ExprState);
191 81648 : state->expr = node;
192 81648 : state->parent = NULL;
193 81648 : state->ext_params = ext_params;
194 :
195 : /* Insert setup steps as needed */
196 81648 : ExecCreateExprSetupSteps(state, (Node *) node);
197 :
198 : /* Compile the expression proper */
199 81648 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
200 :
201 : /* Finally, append a DONE step */
202 81648 : scratch.opcode = EEOP_DONE_RETURN;
203 81648 : ExprEvalPushStep(state, &scratch);
204 :
205 81648 : ExecReadyExpr(state);
206 :
207 81648 : 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 1816588 : ExecInitQual(List *qual, PlanState *parent)
230 : {
231 : ExprState *state;
232 1816588 : ExprEvalStep scratch = {0};
233 1816588 : List *adjust_jumps = NIL;
234 :
235 : /* short-circuit (here and in ExecQual) for empty restriction list */
236 1816588 : if (qual == NIL)
237 1328760 : return NULL;
238 :
239 : Assert(IsA(qual, List));
240 :
241 487828 : state = makeNode(ExprState);
242 487828 : state->expr = (Expr *) qual;
243 487828 : state->parent = parent;
244 487828 : state->ext_params = NULL;
245 :
246 : /* mark expression as to be used with ExecQual() */
247 487828 : state->flags = EEO_FLAG_IS_QUAL;
248 :
249 : /* Insert setup steps as needed */
250 487828 : 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 487828 : scratch.opcode = EEOP_QUAL;
260 :
261 : /*
262 : * We can use ExprState's resvalue/resnull as target for each qual expr.
263 : */
264 487828 : scratch.resvalue = &state->resvalue;
265 487828 : scratch.resnull = &state->resnull;
266 :
267 1572224 : foreach_ptr(Expr, node, qual)
268 : {
269 : /* first evaluate expression */
270 596568 : ExecInitExprRec(node, state, &state->resvalue, &state->resnull);
271 :
272 : /* then emit EEOP_QUAL to detect if it's false (or null) */
273 596568 : scratch.d.qualexpr.jumpdone = -1;
274 596568 : ExprEvalPushStep(state, &scratch);
275 596568 : adjust_jumps = lappend_int(adjust_jumps,
276 596568 : state->steps_len - 1);
277 : }
278 :
279 : /* adjust jump targets */
280 1572224 : foreach_int(jump, adjust_jumps)
281 : {
282 596568 : ExprEvalStep *as = &state->steps[jump];
283 :
284 : Assert(as->opcode == EEOP_QUAL);
285 : Assert(as->d.qualexpr.jumpdone == -1);
286 596568 : 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 487828 : scratch.opcode = EEOP_DONE_RETURN;
295 487828 : ExprEvalPushStep(state, &scratch);
296 :
297 487828 : ExecReadyExpr(state);
298 :
299 487828 : 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 3848 : ExecInitCheck(List *qual, PlanState *parent)
316 : {
317 : /* short-circuit (here and in ExecCheck) for empty restriction list */
318 3848 : if (qual == NIL)
319 180 : 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 3668 : 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 479050 : ExecInitExprList(List *nodes, PlanState *parent)
336 : {
337 479050 : List *result = NIL;
338 : ListCell *lc;
339 :
340 912802 : foreach(lc, nodes)
341 : {
342 433752 : Expr *e = lfirst(lc);
343 :
344 433752 : result = lappend(result, ExecInitExpr(e, parent));
345 : }
346 :
347 479050 : 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 771646 : ExecBuildProjectionInfo(List *targetList,
371 : ExprContext *econtext,
372 : TupleTableSlot *slot,
373 : PlanState *parent,
374 : TupleDesc inputDesc)
375 : {
376 771646 : ProjectionInfo *projInfo = makeNode(ProjectionInfo);
377 : ExprState *state;
378 771646 : ExprEvalStep scratch = {0};
379 : ListCell *lc;
380 :
381 771646 : projInfo->pi_exprContext = econtext;
382 : /* We embed ExprState into ProjectionInfo instead of doing extra palloc */
383 771646 : projInfo->pi_state.type = T_ExprState;
384 771646 : state = &projInfo->pi_state;
385 771646 : state->expr = (Expr *) targetList;
386 771646 : state->parent = parent;
387 771646 : state->ext_params = NULL;
388 :
389 771646 : state->resultslot = slot;
390 :
391 : /* Insert setup steps as needed */
392 771646 : ExecCreateExprSetupSteps(state, (Node *) targetList);
393 :
394 : /* Now compile each tlist column */
395 2891486 : foreach(lc, targetList)
396 : {
397 2119908 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
398 2119908 : Var *variable = NULL;
399 2119908 : AttrNumber attnum = 0;
400 2119908 : 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 2119908 : if (tle->expr != NULL &&
411 2119908 : IsA(tle->expr, Var) &&
412 1315816 : ((Var *) tle->expr)->varattno > 0)
413 : {
414 : /* Non-system Var, but how safe is it? */
415 1217884 : variable = (Var *) tle->expr;
416 1217884 : attnum = variable->varattno;
417 :
418 1217884 : if (inputDesc == NULL)
419 712436 : isSafeVar = true; /* can't check, just assume OK */
420 505448 : else if (attnum <= inputDesc->natts)
421 : {
422 504788 : 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 504788 : if (!attr->attisdropped && variable->vartype == attr->atttypid)
430 : {
431 503856 : isSafeVar = true;
432 : }
433 : }
434 : }
435 :
436 2119908 : if (isSafeVar)
437 : {
438 : /* Fast-path: just generate an EEOP_ASSIGN_*_VAR step */
439 1216292 : switch (variable->varno)
440 : {
441 217770 : case INNER_VAR:
442 : /* get the tuple from the inner node */
443 217770 : scratch.opcode = EEOP_ASSIGN_INNER_VAR;
444 217770 : break;
445 :
446 493370 : case OUTER_VAR:
447 : /* get the tuple from the outer node */
448 493370 : scratch.opcode = EEOP_ASSIGN_OUTER_VAR;
449 493370 : break;
450 :
451 : /* INDEX_VAR is handled by default case */
452 :
453 505152 : 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 505152 : switch (variable->varreturningtype)
460 : {
461 503282 : case VAR_RETURNING_DEFAULT:
462 503282 : scratch.opcode = EEOP_ASSIGN_SCAN_VAR;
463 503282 : break;
464 934 : case VAR_RETURNING_OLD:
465 934 : scratch.opcode = EEOP_ASSIGN_OLD_VAR;
466 934 : state->flags |= EEO_FLAG_HAS_OLD;
467 934 : break;
468 936 : case VAR_RETURNING_NEW:
469 936 : scratch.opcode = EEOP_ASSIGN_NEW_VAR;
470 936 : state->flags |= EEO_FLAG_HAS_NEW;
471 936 : break;
472 : }
473 505152 : break;
474 : }
475 :
476 1216292 : scratch.d.assign_var.attnum = attnum - 1;
477 1216292 : scratch.d.assign_var.resultnum = tle->resno - 1;
478 1216292 : 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 903616 : 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 903554 : if (get_typlen(exprType((Node *) tle->expr)) == -1)
498 319526 : scratch.opcode = EEOP_ASSIGN_TMP_MAKE_RO;
499 : else
500 584028 : scratch.opcode = EEOP_ASSIGN_TMP;
501 903554 : scratch.d.assign_tmp.resultnum = tle->resno - 1;
502 903554 : ExprEvalPushStep(state, &scratch);
503 : }
504 : }
505 :
506 771578 : scratch.opcode = EEOP_DONE_NO_RETURN;
507 771578 : ExprEvalPushStep(state, &scratch);
508 :
509 771578 : ExecReadyExpr(state);
510 :
511 771578 : 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 16792 : ExecBuildUpdateProjection(List *targetList,
548 : bool evalTargetList,
549 : List *targetColnos,
550 : TupleDesc relDesc,
551 : ExprContext *econtext,
552 : TupleTableSlot *slot,
553 : PlanState *parent)
554 : {
555 16792 : ProjectionInfo *projInfo = makeNode(ProjectionInfo);
556 : ExprState *state;
557 : int nAssignableCols;
558 : bool sawJunk;
559 : Bitmapset *assignedCols;
560 16792 : ExprSetupInfo deform = {0, 0, 0, 0, 0, NIL};
561 16792 : ExprEvalStep scratch = {0};
562 : int outerattnum;
563 : ListCell *lc,
564 : *lc2;
565 :
566 16792 : projInfo->pi_exprContext = econtext;
567 : /* We embed ExprState into ProjectionInfo instead of doing extra palloc */
568 16792 : projInfo->pi_state.type = T_ExprState;
569 16792 : state = &projInfo->pi_state;
570 16792 : if (evalTargetList)
571 2712 : state->expr = (Expr *) targetList;
572 : else
573 14080 : state->expr = NULL; /* not used */
574 16792 : state->parent = parent;
575 16792 : state->ext_params = NULL;
576 :
577 16792 : 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 16792 : nAssignableCols = 0;
584 16792 : sawJunk = false;
585 56200 : foreach(lc, targetList)
586 : {
587 39408 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
588 :
589 39408 : if (tle->resjunk)
590 17674 : sawJunk = true;
591 : else
592 : {
593 21734 : if (sawJunk)
594 0 : elog(ERROR, "subplan target list is out of order");
595 21734 : nAssignableCols++;
596 : }
597 : }
598 :
599 : /* We should have one targetColnos entry per non-junk column */
600 16792 : 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 16792 : assignedCols = NULL;
609 38526 : foreach(lc, targetColnos)
610 : {
611 21734 : AttrNumber targetattnum = lfirst_int(lc);
612 :
613 21734 : 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 28190 : for (int attnum = relDesc->natts; attnum > 0; attnum--)
622 : {
623 25592 : CompactAttribute *attr = TupleDescCompactAttr(relDesc, attnum - 1);
624 :
625 25592 : if (attr->attisdropped)
626 222 : continue;
627 25370 : if (bms_is_member(attnum, assignedCols))
628 11176 : continue;
629 14194 : deform.last_scan = attnum;
630 14194 : 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 16792 : if (evalTargetList)
639 2712 : expr_setup_walker((Node *) targetList, &deform);
640 : else
641 14080 : deform.last_outer = nAssignableCols;
642 :
643 16792 : 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 16792 : outerattnum = 0;
653 38526 : forboth(lc, targetList, lc2, targetColnos)
654 : {
655 21734 : TargetEntry *tle = lfirst_node(TargetEntry, lc);
656 21734 : 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 21734 : 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 21734 : attr = TupleDescAttr(relDesc, targetattnum - 1);
670 :
671 21734 : 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 21734 : 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 21734 : 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 3704 : ExecInitExprRec(tle->expr, state,
696 : &state->resvalue, &state->resnull);
697 : /* Needn't worry about read-only-ness here, either. */
698 3704 : scratch.opcode = EEOP_ASSIGN_TMP;
699 3704 : scratch.d.assign_tmp.resultnum = targetattnum - 1;
700 3704 : ExprEvalPushStep(state, &scratch);
701 : }
702 : else
703 : {
704 : /* Just assign from the outer tuple. */
705 18030 : scratch.opcode = EEOP_ASSIGN_OUTER_VAR;
706 18030 : scratch.d.assign_var.attnum = outerattnum;
707 18030 : scratch.d.assign_var.resultnum = targetattnum - 1;
708 18030 : ExprEvalPushStep(state, &scratch);
709 : }
710 21734 : 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 160882 : for (int attnum = 1; attnum <= relDesc->natts; attnum++)
718 : {
719 144090 : CompactAttribute *attr = TupleDescCompactAttr(relDesc, attnum - 1);
720 :
721 144090 : if (attr->attisdropped)
722 : {
723 : /* Put a null into the ExprState's resvalue/resnull ... */
724 410 : scratch.opcode = EEOP_CONST;
725 410 : scratch.resvalue = &state->resvalue;
726 410 : scratch.resnull = &state->resnull;
727 410 : scratch.d.constval.value = (Datum) 0;
728 410 : scratch.d.constval.isnull = true;
729 410 : ExprEvalPushStep(state, &scratch);
730 : /* ... then assign it to the result slot */
731 410 : scratch.opcode = EEOP_ASSIGN_TMP;
732 410 : scratch.d.assign_tmp.resultnum = attnum - 1;
733 410 : ExprEvalPushStep(state, &scratch);
734 : }
735 143680 : else if (!bms_is_member(attnum, assignedCols))
736 : {
737 : /* Certainly the right type, so needn't check */
738 121946 : scratch.opcode = EEOP_ASSIGN_SCAN_VAR;
739 121946 : scratch.d.assign_var.attnum = attnum - 1;
740 121946 : scratch.d.assign_var.resultnum = attnum - 1;
741 121946 : ExprEvalPushStep(state, &scratch);
742 : }
743 : }
744 :
745 16792 : scratch.opcode = EEOP_DONE_NO_RETURN;
746 16792 : ExprEvalPushStep(state, &scratch);
747 :
748 16792 : ExecReadyExpr(state);
749 :
750 16792 : 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 26492 : ExecPrepareExpr(Expr *node, EState *estate)
766 : {
767 : ExprState *result;
768 : MemoryContext oldcontext;
769 :
770 26492 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
771 :
772 26492 : node = expression_planner(node);
773 :
774 26486 : result = ExecInitExpr(node, NULL);
775 :
776 26480 : MemoryContextSwitchTo(oldcontext);
777 :
778 26480 : 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 60426 : ExecPrepareQual(List *qual, EState *estate)
794 : {
795 : ExprState *result;
796 : MemoryContext oldcontext;
797 :
798 60426 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
799 :
800 60426 : qual = (List *) expression_planner((Expr *) qual);
801 :
802 60426 : result = ExecInitQual(qual, NULL);
803 :
804 60426 : MemoryContextSwitchTo(oldcontext);
805 :
806 60426 : 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 3848 : ExecPrepareCheck(List *qual, EState *estate)
817 : {
818 : ExprState *result;
819 : MemoryContext oldcontext;
820 :
821 3848 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
822 :
823 3848 : qual = (List *) expression_planner((Expr *) qual);
824 :
825 3848 : result = ExecInitCheck(qual, NULL);
826 :
827 3848 : MemoryContextSwitchTo(oldcontext);
828 :
829 3848 : 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 17012 : ExecPrepareExprList(List *nodes, EState *estate)
840 : {
841 17012 : List *result = NIL;
842 : MemoryContext oldcontext;
843 : ListCell *lc;
844 :
845 : /* Ensure that the list cell nodes are in the right context too */
846 17012 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
847 :
848 34560 : foreach(lc, nodes)
849 : {
850 17548 : Expr *e = (Expr *) lfirst(lc);
851 :
852 17548 : result = lappend(result, ExecPrepareExpr(e, estate));
853 : }
854 :
855 17012 : MemoryContextSwitchTo(oldcontext);
856 :
857 17012 : 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 112494 : 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 112494 : if (state == NULL)
879 180 : return true;
880 :
881 : /* verify that expression was not compiled using ExecInitQual */
882 : Assert(!(state->flags & EEO_FLAG_IS_QUAL));
883 :
884 112314 : ret = ExecEvalExprSwitchContext(state, econtext, &isnull);
885 :
886 112308 : if (isnull)
887 2836 : return true;
888 :
889 109472 : 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 2497922 : ExecReadyExpr(ExprState *state)
903 : {
904 2497922 : if (jit_compile_expr(state))
905 6684 : return;
906 :
907 2491238 : 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 5402294 : ExecInitExprRec(Expr *node, ExprState *state,
920 : Datum *resv, bool *resnull)
921 : {
922 5402294 : ExprEvalStep scratch = {0};
923 :
924 : /* Guard against stack overflow due to overly complex expressions */
925 5402294 : check_stack_depth();
926 :
927 : /* Step's output location is always what the caller gave us */
928 : Assert(resv != NULL && resnull != NULL);
929 5402294 : scratch.resvalue = resv;
930 5402294 : scratch.resnull = resnull;
931 :
932 : /* cases should be ordered as they are in enum NodeTag */
933 5402294 : switch (nodeTag(node))
934 : {
935 1366352 : case T_Var:
936 : {
937 1366352 : Var *variable = (Var *) node;
938 :
939 1366352 : if (variable->varattno == InvalidAttrNumber)
940 : {
941 : /* whole-row Var */
942 5072 : ExecInitWholeRowVar(&scratch, variable, state);
943 : }
944 1361280 : else if (variable->varattno <= 0)
945 : {
946 : /* system column */
947 100958 : scratch.d.var.attnum = variable->varattno;
948 100958 : scratch.d.var.vartype = variable->vartype;
949 100958 : scratch.d.var.varreturningtype = variable->varreturningtype;
950 100958 : switch (variable->varno)
951 : {
952 6 : case INNER_VAR:
953 6 : scratch.opcode = EEOP_INNER_SYSVAR;
954 6 : break;
955 12 : case OUTER_VAR:
956 12 : scratch.opcode = EEOP_OUTER_SYSVAR;
957 12 : break;
958 :
959 : /* INDEX_VAR is handled by default case */
960 :
961 100940 : default:
962 100940 : switch (variable->varreturningtype)
963 : {
964 100292 : case VAR_RETURNING_DEFAULT:
965 100292 : scratch.opcode = EEOP_SCAN_SYSVAR;
966 100292 : break;
967 324 : case VAR_RETURNING_OLD:
968 324 : scratch.opcode = EEOP_OLD_SYSVAR;
969 324 : state->flags |= EEO_FLAG_HAS_OLD;
970 324 : break;
971 324 : case VAR_RETURNING_NEW:
972 324 : scratch.opcode = EEOP_NEW_SYSVAR;
973 324 : state->flags |= EEO_FLAG_HAS_NEW;
974 324 : break;
975 : }
976 100940 : break;
977 : }
978 : }
979 : else
980 : {
981 : /* regular user column */
982 1260322 : scratch.d.var.attnum = variable->varattno - 1;
983 1260322 : scratch.d.var.vartype = variable->vartype;
984 1260322 : scratch.d.var.varreturningtype = variable->varreturningtype;
985 1260322 : switch (variable->varno)
986 : {
987 148218 : case INNER_VAR:
988 148218 : scratch.opcode = EEOP_INNER_VAR;
989 148218 : break;
990 378226 : case OUTER_VAR:
991 378226 : scratch.opcode = EEOP_OUTER_VAR;
992 378226 : break;
993 :
994 : /* INDEX_VAR is handled by default case */
995 :
996 733878 : default:
997 733878 : switch (variable->varreturningtype)
998 : {
999 733434 : case VAR_RETURNING_DEFAULT:
1000 733434 : scratch.opcode = EEOP_SCAN_VAR;
1001 733434 : break;
1002 222 : case VAR_RETURNING_OLD:
1003 222 : scratch.opcode = EEOP_OLD_VAR;
1004 222 : state->flags |= EEO_FLAG_HAS_OLD;
1005 222 : break;
1006 222 : case VAR_RETURNING_NEW:
1007 222 : scratch.opcode = EEOP_NEW_VAR;
1008 222 : state->flags |= EEO_FLAG_HAS_NEW;
1009 222 : break;
1010 : }
1011 733878 : break;
1012 : }
1013 : }
1014 :
1015 1366352 : ExprEvalPushStep(state, &scratch);
1016 1366352 : break;
1017 : }
1018 :
1019 1113802 : case T_Const:
1020 : {
1021 1113802 : Const *con = (Const *) node;
1022 :
1023 1113802 : scratch.opcode = EEOP_CONST;
1024 1113802 : scratch.d.constval.value = con->constvalue;
1025 1113802 : scratch.d.constval.isnull = con->constisnull;
1026 :
1027 1113802 : ExprEvalPushStep(state, &scratch);
1028 1113802 : break;
1029 : }
1030 :
1031 773396 : case T_Param:
1032 : {
1033 773396 : Param *param = (Param *) node;
1034 : ParamListInfo params;
1035 :
1036 773396 : switch (param->paramkind)
1037 : {
1038 254360 : case PARAM_EXEC:
1039 254360 : scratch.opcode = EEOP_PARAM_EXEC;
1040 254360 : scratch.d.param.paramid = param->paramid;
1041 254360 : scratch.d.param.paramtype = param->paramtype;
1042 254360 : ExprEvalPushStep(state, &scratch);
1043 254360 : break;
1044 519036 : 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 519036 : if (state->ext_params)
1053 73502 : params = state->ext_params;
1054 445534 : else if (state->parent &&
1055 445336 : state->parent->state)
1056 445336 : params = state->parent->state->es_param_list_info;
1057 : else
1058 198 : params = NULL;
1059 519036 : if (params && params->paramCompile)
1060 : {
1061 150306 : params->paramCompile(params, param, state,
1062 : resv, resnull);
1063 : }
1064 : else
1065 : {
1066 368730 : scratch.opcode = EEOP_PARAM_EXTERN;
1067 368730 : scratch.d.param.paramid = param->paramid;
1068 368730 : scratch.d.param.paramtype = param->paramtype;
1069 368730 : ExprEvalPushStep(state, &scratch);
1070 : }
1071 519036 : break;
1072 0 : default:
1073 0 : elog(ERROR, "unrecognized paramkind: %d",
1074 : (int) param->paramkind);
1075 : break;
1076 : }
1077 773396 : break;
1078 : }
1079 :
1080 60240 : case T_Aggref:
1081 : {
1082 60240 : Aggref *aggref = (Aggref *) node;
1083 :
1084 60240 : scratch.opcode = EEOP_AGGREF;
1085 60240 : scratch.d.aggref.aggno = aggref->aggno;
1086 :
1087 60240 : if (state->parent && IsA(state->parent, AggState))
1088 60240 : {
1089 60240 : AggState *aggstate = (AggState *) state->parent;
1090 :
1091 60240 : 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 60240 : ExprEvalPushStep(state, &scratch);
1100 60240 : break;
1101 : }
1102 :
1103 350 : case T_GroupingFunc:
1104 : {
1105 350 : GroupingFunc *grp_node = (GroupingFunc *) node;
1106 : Agg *agg;
1107 :
1108 350 : if (!state->parent || !IsA(state->parent, AggState) ||
1109 350 : !IsA(state->parent->plan, Agg))
1110 0 : elog(ERROR, "GroupingFunc found in non-Agg plan node");
1111 :
1112 350 : scratch.opcode = EEOP_GROUPING_FUNC;
1113 :
1114 350 : agg = (Agg *) (state->parent->plan);
1115 :
1116 350 : if (agg->groupingSets)
1117 260 : scratch.d.grouping_func.clauses = grp_node->cols;
1118 : else
1119 90 : scratch.d.grouping_func.clauses = NIL;
1120 :
1121 350 : ExprEvalPushStep(state, &scratch);
1122 350 : break;
1123 : }
1124 :
1125 3602 : case T_WindowFunc:
1126 : {
1127 3602 : WindowFunc *wfunc = (WindowFunc *) node;
1128 3602 : WindowFuncExprState *wfstate = makeNode(WindowFuncExprState);
1129 :
1130 3602 : wfstate->wfunc = wfunc;
1131 :
1132 3602 : if (state->parent && IsA(state->parent, WindowAggState))
1133 3602 : {
1134 3602 : WindowAggState *winstate = (WindowAggState *) state->parent;
1135 : int nfuncs;
1136 :
1137 3602 : winstate->funcs = lappend(winstate->funcs, wfstate);
1138 3602 : nfuncs = ++winstate->numfuncs;
1139 3602 : if (wfunc->winagg)
1140 1562 : winstate->numaggs++;
1141 :
1142 : /* for now initialize agg using old style expressions */
1143 3602 : wfstate->args = ExecInitExprList(wfunc->args,
1144 : state->parent);
1145 3602 : 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 3602 : 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 3602 : scratch.opcode = EEOP_WINDOW_FUNC;
1166 3602 : scratch.d.window_func.wfstate = wfstate;
1167 3602 : ExprEvalPushStep(state, &scratch);
1168 3602 : break;
1169 : }
1170 :
1171 244 : case T_MergeSupportFunc:
1172 : {
1173 : /* must be in a MERGE, else something messed up */
1174 244 : if (!state->parent ||
1175 244 : !IsA(state->parent, ModifyTableState) ||
1176 244 : ((ModifyTableState *) state->parent)->operation != CMD_MERGE)
1177 0 : elog(ERROR, "MergeSupportFunc found in non-merge plan node");
1178 :
1179 244 : scratch.opcode = EEOP_MERGE_SUPPORT_FUNC;
1180 244 : ExprEvalPushStep(state, &scratch);
1181 244 : break;
1182 : }
1183 :
1184 27936 : case T_SubscriptingRef:
1185 : {
1186 27936 : SubscriptingRef *sbsref = (SubscriptingRef *) node;
1187 :
1188 27936 : ExecInitSubscriptingRef(&scratch, sbsref, state, resv, resnull);
1189 27936 : break;
1190 : }
1191 :
1192 596050 : case T_FuncExpr:
1193 : {
1194 596050 : FuncExpr *func = (FuncExpr *) node;
1195 :
1196 596050 : ExecInitFunc(&scratch, node,
1197 : func->args, func->funcid, func->inputcollid,
1198 : state);
1199 595964 : ExprEvalPushStep(state, &scratch);
1200 595964 : break;
1201 : }
1202 :
1203 899508 : case T_OpExpr:
1204 : {
1205 899508 : OpExpr *op = (OpExpr *) node;
1206 :
1207 899508 : ExecInitFunc(&scratch, node,
1208 : op->args, op->opfuncid, op->inputcollid,
1209 : state);
1210 899508 : ExprEvalPushStep(state, &scratch);
1211 899508 : break;
1212 : }
1213 :
1214 1162 : case T_DistinctExpr:
1215 : {
1216 1162 : DistinctExpr *op = (DistinctExpr *) node;
1217 :
1218 1162 : 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 1162 : scratch.opcode = EEOP_DISTINCT;
1232 1162 : ExprEvalPushStep(state, &scratch);
1233 1162 : break;
1234 : }
1235 :
1236 504 : case T_NullIfExpr:
1237 : {
1238 504 : NullIfExpr *op = (NullIfExpr *) node;
1239 :
1240 504 : 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 504 : scratch.d.func.make_ro =
1250 504 : (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 504 : scratch.opcode = EEOP_NULLIF;
1262 504 : ExprEvalPushStep(state, &scratch);
1263 504 : break;
1264 : }
1265 :
1266 37734 : case T_ScalarArrayOpExpr:
1267 : {
1268 37734 : 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 37734 : if (OidIsValid(opexpr->negfuncid))
1283 : {
1284 : Assert(OidIsValid(opexpr->hashfuncid));
1285 70 : cmpfuncid = opexpr->negfuncid;
1286 : }
1287 : else
1288 37664 : cmpfuncid = opexpr->opfuncid;
1289 :
1290 : Assert(list_length(opexpr->args) == 2);
1291 37734 : scalararg = (Expr *) linitial(opexpr->args);
1292 37734 : arrayarg = (Expr *) lsecond(opexpr->args);
1293 :
1294 : /* Check permission to call function */
1295 37734 : aclresult = object_aclcheck(ProcedureRelationId, cmpfuncid,
1296 : GetUserId(),
1297 : ACL_EXECUTE);
1298 37734 : if (aclresult != ACLCHECK_OK)
1299 0 : aclcheck_error(aclresult, OBJECT_FUNCTION,
1300 0 : get_func_name(cmpfuncid));
1301 37734 : InvokeFunctionExecuteHook(cmpfuncid);
1302 :
1303 37734 : if (OidIsValid(opexpr->hashfuncid))
1304 : {
1305 430 : aclresult = object_aclcheck(ProcedureRelationId, opexpr->hashfuncid,
1306 : GetUserId(),
1307 : ACL_EXECUTE);
1308 430 : if (aclresult != ACLCHECK_OK)
1309 0 : aclcheck_error(aclresult, OBJECT_FUNCTION,
1310 0 : get_func_name(opexpr->hashfuncid));
1311 430 : InvokeFunctionExecuteHook(opexpr->hashfuncid);
1312 : }
1313 :
1314 : /* Set up the primary fmgr lookup information */
1315 37734 : finfo = palloc0_object(FmgrInfo);
1316 37734 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
1317 37734 : fmgr_info(cmpfuncid, finfo);
1318 37734 : fmgr_info_set_expr((Node *) node, finfo);
1319 37734 : 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 37734 : if (OidIsValid(opexpr->hashfuncid))
1330 : {
1331 : /* Evaluate scalar directly into left function argument */
1332 430 : 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 430 : ExecInitExprRec(arrayarg, state, resv, resnull);
1343 :
1344 : /* And perform the operation */
1345 430 : scratch.opcode = EEOP_HASHED_SCALARARRAYOP;
1346 430 : scratch.d.hashedscalararrayop.inclause = opexpr->useOr;
1347 430 : scratch.d.hashedscalararrayop.finfo = finfo;
1348 430 : scratch.d.hashedscalararrayop.fcinfo_data = fcinfo;
1349 430 : scratch.d.hashedscalararrayop.saop = opexpr;
1350 :
1351 :
1352 430 : ExprEvalPushStep(state, &scratch);
1353 : }
1354 : else
1355 : {
1356 : /* Evaluate scalar directly into left function argument */
1357 37304 : 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 37304 : ExecInitExprRec(arrayarg, state, resv, resnull);
1368 :
1369 : /* And perform the operation */
1370 37304 : scratch.opcode = EEOP_SCALARARRAYOP;
1371 37304 : scratch.d.scalararrayop.element_type = InvalidOid;
1372 37304 : scratch.d.scalararrayop.useOr = opexpr->useOr;
1373 37304 : scratch.d.scalararrayop.finfo = finfo;
1374 37304 : scratch.d.scalararrayop.fcinfo_data = fcinfo;
1375 37304 : scratch.d.scalararrayop.fn_addr = finfo->fn_addr;
1376 37304 : ExprEvalPushStep(state, &scratch);
1377 : }
1378 37734 : break;
1379 : }
1380 :
1381 69644 : case T_BoolExpr:
1382 : {
1383 69644 : BoolExpr *boolexpr = (BoolExpr *) node;
1384 69644 : int nargs = list_length(boolexpr->args);
1385 69644 : List *adjust_jumps = NIL;
1386 : int off;
1387 : ListCell *lc;
1388 :
1389 : /* allocate scratch memory used by all steps of AND/OR */
1390 69644 : if (boolexpr->boolop != NOT_EXPR)
1391 55130 : 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 69644 : off = 0;
1407 208386 : foreach(lc, boolexpr->args)
1408 : {
1409 138742 : Expr *arg = (Expr *) lfirst(lc);
1410 :
1411 : /* Evaluate argument into our output variable */
1412 138742 : ExecInitExprRec(arg, state, resv, resnull);
1413 :
1414 : /* Perform the appropriate step type */
1415 138742 : switch (boolexpr->boolop)
1416 : {
1417 83606 : case AND_EXPR:
1418 : Assert(nargs >= 2);
1419 :
1420 83606 : if (off == 0)
1421 37312 : scratch.opcode = EEOP_BOOL_AND_STEP_FIRST;
1422 46294 : else if (off + 1 == nargs)
1423 37312 : scratch.opcode = EEOP_BOOL_AND_STEP_LAST;
1424 : else
1425 8982 : scratch.opcode = EEOP_BOOL_AND_STEP;
1426 83606 : break;
1427 40622 : case OR_EXPR:
1428 : Assert(nargs >= 2);
1429 :
1430 40622 : if (off == 0)
1431 17818 : scratch.opcode = EEOP_BOOL_OR_STEP_FIRST;
1432 22804 : else if (off + 1 == nargs)
1433 17818 : scratch.opcode = EEOP_BOOL_OR_STEP_LAST;
1434 : else
1435 4986 : scratch.opcode = EEOP_BOOL_OR_STEP;
1436 40622 : break;
1437 14514 : case NOT_EXPR:
1438 : Assert(nargs == 1);
1439 :
1440 14514 : scratch.opcode = EEOP_BOOL_NOT_STEP;
1441 14514 : break;
1442 0 : default:
1443 0 : elog(ERROR, "unrecognized boolop: %d",
1444 : (int) boolexpr->boolop);
1445 : break;
1446 : }
1447 :
1448 138742 : scratch.d.boolexpr.jumpdone = -1;
1449 138742 : ExprEvalPushStep(state, &scratch);
1450 138742 : adjust_jumps = lappend_int(adjust_jumps,
1451 138742 : state->steps_len - 1);
1452 138742 : off++;
1453 : }
1454 :
1455 : /* adjust jump targets */
1456 208386 : foreach(lc, adjust_jumps)
1457 : {
1458 138742 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
1459 :
1460 : Assert(as->d.boolexpr.jumpdone == -1);
1461 138742 : as->d.boolexpr.jumpdone = state->steps_len;
1462 : }
1463 :
1464 69644 : break;
1465 : }
1466 :
1467 29664 : case T_SubPlan:
1468 : {
1469 29664 : 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 29664 : if (subplan->subLinkType == MULTIEXPR_SUBLINK)
1478 : {
1479 60 : scratch.opcode = EEOP_CONST;
1480 60 : scratch.d.constval.value = (Datum) 0;
1481 60 : scratch.d.constval.isnull = true;
1482 60 : ExprEvalPushStep(state, &scratch);
1483 60 : break;
1484 : }
1485 :
1486 29604 : ExecInitSubPlanExpr(subplan, state, resv, resnull);
1487 29604 : break;
1488 : }
1489 :
1490 8950 : case T_FieldSelect:
1491 : {
1492 8950 : FieldSelect *fselect = (FieldSelect *) node;
1493 :
1494 : /* evaluate row/record argument into result area */
1495 8950 : ExecInitExprRec(fselect->arg, state, resv, resnull);
1496 :
1497 : /* and extract field */
1498 8950 : scratch.opcode = EEOP_FIELDSELECT;
1499 8950 : scratch.d.fieldselect.fieldnum = fselect->fieldnum;
1500 8950 : scratch.d.fieldselect.resulttype = fselect->resulttype;
1501 8950 : scratch.d.fieldselect.rowcache.cacheptr = NULL;
1502 :
1503 8950 : ExprEvalPushStep(state, &scratch);
1504 8950 : break;
1505 : }
1506 :
1507 382 : case T_FieldStore:
1508 : {
1509 382 : 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 382 : tupDesc = lookup_rowtype_tupdesc(fstore->resulttype, -1);
1520 382 : ncolumns = tupDesc->natts;
1521 382 : ReleaseTupleDesc(tupDesc);
1522 :
1523 : /* create workspace for column values */
1524 382 : values = palloc_array(Datum, ncolumns);
1525 382 : nulls = palloc_array(bool, ncolumns);
1526 :
1527 : /* create shared composite-type-lookup cache struct */
1528 382 : rowcachep = palloc_object(ExprEvalRowtypeCache);
1529 382 : rowcachep->cacheptr = NULL;
1530 :
1531 : /* emit code to evaluate the composite input value */
1532 382 : ExecInitExprRec(fstore->arg, state, resv, resnull);
1533 :
1534 : /* next, deform the input tuple into our workspace */
1535 382 : scratch.opcode = EEOP_FIELDSTORE_DEFORM;
1536 382 : scratch.d.fieldstore.fstore = fstore;
1537 382 : scratch.d.fieldstore.rowcache = rowcachep;
1538 382 : scratch.d.fieldstore.values = values;
1539 382 : scratch.d.fieldstore.nulls = nulls;
1540 382 : scratch.d.fieldstore.ncolumns = ncolumns;
1541 382 : ExprEvalPushStep(state, &scratch);
1542 :
1543 : /* evaluate new field values, store in workspace columns */
1544 890 : forboth(l1, fstore->newvals, l2, fstore->fieldnums)
1545 : {
1546 508 : Expr *e = (Expr *) lfirst(l1);
1547 508 : AttrNumber fieldnum = lfirst_int(l2);
1548 : Datum *save_innermost_caseval;
1549 : bool *save_innermost_casenull;
1550 :
1551 508 : 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 508 : save_innermost_caseval = state->innermost_caseval;
1580 508 : save_innermost_casenull = state->innermost_casenull;
1581 508 : state->innermost_caseval = &values[fieldnum - 1];
1582 508 : state->innermost_casenull = &nulls[fieldnum - 1];
1583 :
1584 508 : ExecInitExprRec(e, state,
1585 508 : &values[fieldnum - 1],
1586 508 : &nulls[fieldnum - 1]);
1587 :
1588 508 : state->innermost_caseval = save_innermost_caseval;
1589 508 : state->innermost_casenull = save_innermost_casenull;
1590 : }
1591 :
1592 : /* finally, form result tuple */
1593 382 : scratch.opcode = EEOP_FIELDSTORE_FORM;
1594 382 : scratch.d.fieldstore.fstore = fstore;
1595 382 : scratch.d.fieldstore.rowcache = rowcachep;
1596 382 : scratch.d.fieldstore.values = values;
1597 382 : scratch.d.fieldstore.nulls = nulls;
1598 382 : scratch.d.fieldstore.ncolumns = ncolumns;
1599 382 : ExprEvalPushStep(state, &scratch);
1600 382 : break;
1601 : }
1602 :
1603 127784 : case T_RelabelType:
1604 : {
1605 : /* relabel doesn't need to do anything at runtime */
1606 127784 : RelabelType *relabel = (RelabelType *) node;
1607 :
1608 127784 : ExecInitExprRec(relabel->arg, state, resv, resnull);
1609 127784 : break;
1610 : }
1611 :
1612 38438 : case T_CoerceViaIO:
1613 : {
1614 38438 : 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 38438 : 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 38438 : if (state->escontext == NULL)
1632 38438 : scratch.opcode = EEOP_IOCOERCE;
1633 : else
1634 0 : scratch.opcode = EEOP_IOCOERCE_SAFE;
1635 :
1636 : /* lookup the source type's output function */
1637 38438 : scratch.d.iocoerce.finfo_out = palloc0_object(FmgrInfo);
1638 38438 : scratch.d.iocoerce.fcinfo_data_out = palloc0(SizeForFunctionCallInfo(1));
1639 :
1640 38438 : getTypeOutputInfo(exprType((Node *) iocoerce->arg),
1641 : &iofunc, &typisvarlena);
1642 38438 : fmgr_info(iofunc, scratch.d.iocoerce.finfo_out);
1643 38438 : fmgr_info_set_expr((Node *) node, scratch.d.iocoerce.finfo_out);
1644 38438 : 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 38438 : scratch.d.iocoerce.finfo_in = palloc0_object(FmgrInfo);
1650 38438 : scratch.d.iocoerce.fcinfo_data_in = palloc0(SizeForFunctionCallInfo(3));
1651 :
1652 38438 : getTypeInputInfo(iocoerce->resulttype,
1653 : &iofunc, &typioparam);
1654 38438 : fmgr_info(iofunc, scratch.d.iocoerce.finfo_in);
1655 38438 : fmgr_info_set_expr((Node *) node, scratch.d.iocoerce.finfo_in);
1656 38438 : 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 38438 : fcinfo_in = scratch.d.iocoerce.fcinfo_data_in;
1665 38438 : fcinfo_in->args[1].value = ObjectIdGetDatum(typioparam);
1666 38438 : fcinfo_in->args[1].isnull = false;
1667 38438 : fcinfo_in->args[2].value = Int32GetDatum(-1);
1668 38438 : fcinfo_in->args[2].isnull = false;
1669 :
1670 38438 : fcinfo_in->context = (Node *) state->escontext;
1671 :
1672 38438 : ExprEvalPushStep(state, &scratch);
1673 38438 : break;
1674 : }
1675 :
1676 5934 : case T_ArrayCoerceExpr:
1677 : {
1678 5934 : ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
1679 : Oid resultelemtype;
1680 : ExprState *elemstate;
1681 :
1682 : /* evaluate argument into step's result area */
1683 5934 : ExecInitExprRec(acoerce->arg, state, resv, resnull);
1684 :
1685 5934 : resultelemtype = get_element_type(acoerce->resulttype);
1686 5934 : 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 5934 : elemstate = makeNode(ExprState);
1698 5934 : elemstate->expr = acoerce->elemexpr;
1699 5934 : elemstate->parent = state->parent;
1700 5934 : elemstate->ext_params = state->ext_params;
1701 :
1702 5934 : elemstate->innermost_caseval = palloc_object(Datum);
1703 5934 : elemstate->innermost_casenull = palloc_object(bool);
1704 :
1705 5934 : ExecInitExprRec(acoerce->elemexpr, elemstate,
1706 : &elemstate->resvalue, &elemstate->resnull);
1707 :
1708 5928 : if (elemstate->steps_len == 1 &&
1709 5464 : elemstate->steps[0].opcode == EEOP_CASE_TESTVAL)
1710 : {
1711 : /* Trivial, so we need no per-element work at runtime */
1712 5464 : elemstate = NULL;
1713 : }
1714 : else
1715 : {
1716 : /* Not trivial, so append a DONE step */
1717 464 : scratch.opcode = EEOP_DONE_RETURN;
1718 464 : ExprEvalPushStep(elemstate, &scratch);
1719 : /* and ready the subexpression */
1720 464 : ExecReadyExpr(elemstate);
1721 : }
1722 :
1723 5928 : scratch.opcode = EEOP_ARRAYCOERCE;
1724 5928 : scratch.d.arraycoerce.elemexprstate = elemstate;
1725 5928 : scratch.d.arraycoerce.resultelemtype = resultelemtype;
1726 :
1727 5928 : if (elemstate)
1728 : {
1729 : /* Set up workspace for array_map */
1730 464 : scratch.d.arraycoerce.amstate = palloc0_object(ArrayMapState);
1731 : }
1732 : else
1733 : {
1734 : /* Don't need workspace if there's no subexpression */
1735 5464 : scratch.d.arraycoerce.amstate = NULL;
1736 : }
1737 :
1738 5928 : ExprEvalPushStep(state, &scratch);
1739 5928 : break;
1740 : }
1741 :
1742 830 : case T_ConvertRowtypeExpr:
1743 : {
1744 830 : ConvertRowtypeExpr *convert = (ConvertRowtypeExpr *) node;
1745 : ExprEvalRowtypeCache *rowcachep;
1746 :
1747 : /* cache structs must be out-of-line for space reasons */
1748 830 : rowcachep = palloc(2 * sizeof(ExprEvalRowtypeCache));
1749 830 : rowcachep[0].cacheptr = NULL;
1750 830 : rowcachep[1].cacheptr = NULL;
1751 :
1752 : /* evaluate argument into step's result area */
1753 830 : ExecInitExprRec(convert->arg, state, resv, resnull);
1754 :
1755 : /* and push conversion step */
1756 830 : scratch.opcode = EEOP_CONVERT_ROWTYPE;
1757 830 : scratch.d.convert_rowtype.inputtype =
1758 830 : exprType((Node *) convert->arg);
1759 830 : scratch.d.convert_rowtype.outputtype = convert->resulttype;
1760 830 : scratch.d.convert_rowtype.incache = &rowcachep[0];
1761 830 : scratch.d.convert_rowtype.outcache = &rowcachep[1];
1762 830 : scratch.d.convert_rowtype.map = NULL;
1763 :
1764 830 : ExprEvalPushStep(state, &scratch);
1765 830 : break;
1766 : }
1767 :
1768 : /* note that CaseWhen expressions are handled within this block */
1769 106732 : case T_CaseExpr:
1770 : {
1771 106732 : CaseExpr *caseExpr = (CaseExpr *) node;
1772 106732 : List *adjust_jumps = NIL;
1773 106732 : Datum *caseval = NULL;
1774 106732 : 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 106732 : if (caseExpr->arg != NULL)
1783 : {
1784 : /* Evaluate testexpr into caseval/casenull workspace */
1785 4718 : caseval = palloc_object(Datum);
1786 4718 : casenull = palloc_object(bool);
1787 :
1788 4718 : 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 4718 : if (get_typlen(exprType((Node *) caseExpr->arg)) == -1)
1796 : {
1797 : /* change caseval in-place */
1798 78 : scratch.opcode = EEOP_MAKE_READONLY;
1799 78 : scratch.resvalue = caseval;
1800 78 : scratch.resnull = casenull;
1801 78 : scratch.d.make_readonly.value = caseval;
1802 78 : scratch.d.make_readonly.isnull = casenull;
1803 78 : ExprEvalPushStep(state, &scratch);
1804 : /* restore normal settings of scratch fields */
1805 78 : scratch.resvalue = resv;
1806 78 : 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 298756 : foreach(lc, caseExpr->args)
1817 : {
1818 192024 : 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 192024 : save_innermost_caseval = state->innermost_caseval;
1834 192024 : save_innermost_casenull = state->innermost_casenull;
1835 192024 : state->innermost_caseval = caseval;
1836 192024 : state->innermost_casenull = casenull;
1837 :
1838 : /* evaluate condition into CASE's result variables */
1839 192024 : ExecInitExprRec(when->expr, state, resv, resnull);
1840 :
1841 192024 : state->innermost_caseval = save_innermost_caseval;
1842 192024 : state->innermost_casenull = save_innermost_casenull;
1843 :
1844 : /* If WHEN result isn't true, jump to next CASE arm */
1845 192024 : scratch.opcode = EEOP_JUMP_IF_NOT_TRUE;
1846 192024 : scratch.d.jump.jumpdone = -1; /* computed later */
1847 192024 : ExprEvalPushStep(state, &scratch);
1848 192024 : 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 192024 : ExecInitExprRec(when->result, state, resv, resnull);
1855 :
1856 : /* Emit JUMP step to jump to end of CASE's code */
1857 192024 : scratch.opcode = EEOP_JUMP;
1858 192024 : scratch.d.jump.jumpdone = -1; /* computed later */
1859 192024 : 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 192024 : adjust_jumps = lappend_int(adjust_jumps,
1866 192024 : 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 192024 : 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 106732 : ExecInitExprRec(caseExpr->defresult, state,
1880 : resv, resnull);
1881 :
1882 : /* adjust jump targets */
1883 298756 : foreach(lc, adjust_jumps)
1884 : {
1885 192024 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
1886 :
1887 : Assert(as->opcode == EEOP_JUMP);
1888 : Assert(as->d.jump.jumpdone == -1);
1889 192024 : as->d.jump.jumpdone = state->steps_len;
1890 : }
1891 :
1892 106732 : break;
1893 : }
1894 :
1895 26204 : 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 26204 : if (state->innermost_caseval == NULL)
1907 1498 : scratch.opcode = EEOP_CASE_TESTVAL_EXT;
1908 : else
1909 : {
1910 24706 : scratch.opcode = EEOP_CASE_TESTVAL;
1911 24706 : scratch.d.casetest.value = state->innermost_caseval;
1912 24706 : scratch.d.casetest.isnull = state->innermost_casenull;
1913 : }
1914 26204 : ExprEvalPushStep(state, &scratch);
1915 26204 : break;
1916 : }
1917 :
1918 29256 : case T_ArrayExpr:
1919 : {
1920 29256 : ArrayExpr *arrayexpr = (ArrayExpr *) node;
1921 29256 : 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 29256 : scratch.opcode = EEOP_ARRAYEXPR;
1931 29256 : scratch.d.arrayexpr.elemvalues =
1932 29256 : palloc_array(Datum, nelems);
1933 29256 : scratch.d.arrayexpr.elemnulls =
1934 29256 : palloc_array(bool, nelems);
1935 29256 : scratch.d.arrayexpr.nelems = nelems;
1936 :
1937 : /* fill remaining fields of step */
1938 29256 : scratch.d.arrayexpr.multidims = arrayexpr->multidims;
1939 29256 : scratch.d.arrayexpr.elemtype = arrayexpr->element_typeid;
1940 :
1941 : /* do one-time catalog lookup for type info */
1942 29256 : 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 29256 : elemoff = 0;
1949 109452 : foreach(lc, arrayexpr->elements)
1950 : {
1951 80196 : Expr *e = (Expr *) lfirst(lc);
1952 :
1953 80196 : ExecInitExprRec(e, state,
1954 80196 : &scratch.d.arrayexpr.elemvalues[elemoff],
1955 80196 : &scratch.d.arrayexpr.elemnulls[elemoff]);
1956 80196 : elemoff++;
1957 : }
1958 :
1959 : /* and then collect all into an array */
1960 29256 : ExprEvalPushStep(state, &scratch);
1961 29256 : break;
1962 : }
1963 :
1964 5594 : case T_RowExpr:
1965 : {
1966 5594 : RowExpr *rowexpr = (RowExpr *) node;
1967 5594 : int nelems = list_length(rowexpr->args);
1968 : TupleDesc tupdesc;
1969 : int i;
1970 : ListCell *l;
1971 :
1972 : /* Build tupdesc to describe result tuples */
1973 5594 : if (rowexpr->row_typeid == RECORDOID)
1974 : {
1975 : /* generic record, use types of given expressions */
1976 2994 : tupdesc = ExecTypeFromExprList(rowexpr->args);
1977 : /* ... but adopt RowExpr's column aliases */
1978 2994 : ExecTypeSetColNames(tupdesc, rowexpr->colnames);
1979 : /* Bless the tupdesc so it can be looked up later */
1980 2994 : BlessTupleDesc(tupdesc);
1981 : }
1982 : else
1983 : {
1984 : /* it's been cast to a named type, use that */
1985 2600 : 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 5594 : 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 5594 : scratch.opcode = EEOP_ROW;
2004 5594 : scratch.d.row.tupdesc = tupdesc;
2005 :
2006 : /* space for the individual field datums */
2007 5594 : scratch.d.row.elemvalues =
2008 5594 : palloc_array(Datum, nelems);
2009 5594 : scratch.d.row.elemnulls =
2010 5594 : palloc_array(bool, nelems);
2011 : /* as explained above, make sure any extra columns are null */
2012 5594 : memset(scratch.d.row.elemnulls, true, sizeof(bool) * nelems);
2013 :
2014 : /* Set up evaluation, skipping any deleted columns */
2015 5594 : i = 0;
2016 20322 : foreach(l, rowexpr->args)
2017 : {
2018 14734 : Form_pg_attribute att = TupleDescAttr(tupdesc, i);
2019 14734 : Expr *e = (Expr *) lfirst(l);
2020 :
2021 14734 : 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 14716 : if (exprType((Node *) e) != att->atttypid)
2030 6 : 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 18 : e = (Expr *) makeNullConst(INT4OID, -1, InvalidOid);
2044 : }
2045 :
2046 : /* Evaluate column expr into appropriate workspace slot */
2047 14728 : ExecInitExprRec(e, state,
2048 14728 : &scratch.d.row.elemvalues[i],
2049 14728 : &scratch.d.row.elemnulls[i]);
2050 14728 : i++;
2051 : }
2052 :
2053 : /* And finally build the row value */
2054 5588 : ExprEvalPushStep(state, &scratch);
2055 5588 : break;
2056 : }
2057 :
2058 264 : case T_RowCompareExpr:
2059 : {
2060 264 : RowCompareExpr *rcexpr = (RowCompareExpr *) node;
2061 264 : int nopers = list_length(rcexpr->opnos);
2062 264 : 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 846 : 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 582 : Expr *left_expr = (Expr *) lfirst(l_left_expr);
2087 582 : Expr *right_expr = (Expr *) lfirst(l_right_expr);
2088 582 : Oid opno = lfirst_oid(l_opno);
2089 582 : Oid opfamily = lfirst_oid(l_opfamily);
2090 582 : 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 582 : get_op_opfamily_properties(opno, opfamily, false,
2099 : &strategy,
2100 : &lefttype,
2101 : &righttype);
2102 582 : proc = get_opfamily_proc(opfamily,
2103 : lefttype,
2104 : righttype,
2105 : BTORDER_PROC);
2106 582 : 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 582 : finfo = palloc0_object(FmgrInfo);
2112 582 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
2113 582 : fmgr_info(proc, finfo);
2114 582 : fmgr_info_set_expr((Node *) node, finfo);
2115 582 : 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 582 : ExecInitExprRec(left_expr, state,
2127 : &fcinfo->args[0].value, &fcinfo->args[0].isnull);
2128 582 : ExecInitExprRec(right_expr, state,
2129 : &fcinfo->args[1].value, &fcinfo->args[1].isnull);
2130 :
2131 582 : scratch.opcode = EEOP_ROWCOMPARE_STEP;
2132 582 : scratch.d.rowcompare_step.finfo = finfo;
2133 582 : scratch.d.rowcompare_step.fcinfo_data = fcinfo;
2134 582 : scratch.d.rowcompare_step.fn_addr = finfo->fn_addr;
2135 : /* jump targets filled below */
2136 582 : scratch.d.rowcompare_step.jumpnull = -1;
2137 582 : scratch.d.rowcompare_step.jumpdone = -1;
2138 :
2139 582 : ExprEvalPushStep(state, &scratch);
2140 582 : adjust_jumps = lappend_int(adjust_jumps,
2141 582 : 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 264 : 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 264 : scratch.opcode = EEOP_ROWCOMPARE_FINAL;
2158 264 : scratch.d.rowcompare_final.cmptype = rcexpr->cmptype;
2159 264 : ExprEvalPushStep(state, &scratch);
2160 :
2161 : /* adjust jump targets */
2162 846 : foreach(lc, adjust_jumps)
2163 : {
2164 582 : 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 582 : as->d.rowcompare_step.jumpdone = state->steps_len - 1;
2172 : /* jump to the following expression */
2173 582 : as->d.rowcompare_step.jumpnull = state->steps_len;
2174 : }
2175 :
2176 264 : break;
2177 : }
2178 :
2179 3766 : case T_CoalesceExpr:
2180 : {
2181 3766 : CoalesceExpr *coalesce = (CoalesceExpr *) node;
2182 3766 : 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 11310 : foreach(lc, coalesce->args)
2193 : {
2194 7544 : Expr *e = (Expr *) lfirst(lc);
2195 :
2196 : /* evaluate argument, directly into result datum */
2197 7544 : ExecInitExprRec(e, state, resv, resnull);
2198 :
2199 : /* if it's not null, skip to end of COALESCE expr */
2200 7544 : scratch.opcode = EEOP_JUMP_IF_NOT_NULL;
2201 7544 : scratch.d.jump.jumpdone = -1; /* adjust later */
2202 7544 : ExprEvalPushStep(state, &scratch);
2203 :
2204 7544 : adjust_jumps = lappend_int(adjust_jumps,
2205 7544 : 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 11310 : foreach(lc, adjust_jumps)
2216 : {
2217 7544 : 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 7544 : as->d.jump.jumpdone = state->steps_len;
2222 : }
2223 :
2224 3766 : break;
2225 : }
2226 :
2227 2464 : case T_MinMaxExpr:
2228 : {
2229 2464 : MinMaxExpr *minmaxexpr = (MinMaxExpr *) node;
2230 2464 : 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 2464 : typentry = lookup_type_cache(minmaxexpr->minmaxtype,
2239 : TYPECACHE_CMP_PROC);
2240 2464 : 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 2464 : finfo = palloc0_object(FmgrInfo);
2255 2464 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
2256 2464 : fmgr_info(typentry->cmp_proc, finfo);
2257 2464 : fmgr_info_set_expr((Node *) node, finfo);
2258 2464 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
2259 : minmaxexpr->inputcollid, NULL, NULL);
2260 :
2261 2464 : scratch.opcode = EEOP_MINMAX;
2262 : /* allocate space to store arguments */
2263 2464 : scratch.d.minmax.values = palloc_array(Datum, nelems);
2264 2464 : scratch.d.minmax.nulls = palloc_array(bool, nelems);
2265 2464 : scratch.d.minmax.nelems = nelems;
2266 :
2267 2464 : scratch.d.minmax.op = minmaxexpr->op;
2268 2464 : scratch.d.minmax.finfo = finfo;
2269 2464 : scratch.d.minmax.fcinfo_data = fcinfo;
2270 :
2271 : /* evaluate expressions into minmax->values/nulls */
2272 2464 : off = 0;
2273 7500 : foreach(lc, minmaxexpr->args)
2274 : {
2275 5036 : Expr *e = (Expr *) lfirst(lc);
2276 :
2277 5036 : ExecInitExprRec(e, state,
2278 5036 : &scratch.d.minmax.values[off],
2279 5036 : &scratch.d.minmax.nulls[off]);
2280 5036 : off++;
2281 : }
2282 :
2283 : /* and push the final comparison */
2284 2464 : ExprEvalPushStep(state, &scratch);
2285 2464 : break;
2286 : }
2287 :
2288 5368 : case T_SQLValueFunction:
2289 : {
2290 5368 : SQLValueFunction *svf = (SQLValueFunction *) node;
2291 :
2292 5368 : scratch.opcode = EEOP_SQLVALUEFUNCTION;
2293 5368 : scratch.d.sqlvaluefunction.svf = svf;
2294 :
2295 5368 : ExprEvalPushStep(state, &scratch);
2296 5368 : break;
2297 : }
2298 :
2299 702 : case T_XmlExpr:
2300 : {
2301 702 : XmlExpr *xexpr = (XmlExpr *) node;
2302 702 : int nnamed = list_length(xexpr->named_args);
2303 702 : int nargs = list_length(xexpr->args);
2304 : int off;
2305 : ListCell *arg;
2306 :
2307 702 : scratch.opcode = EEOP_XMLEXPR;
2308 702 : scratch.d.xmlexpr.xexpr = xexpr;
2309 :
2310 : /* allocate space for storing all the arguments */
2311 702 : if (nnamed)
2312 : {
2313 60 : scratch.d.xmlexpr.named_argvalue = palloc_array(Datum, nnamed);
2314 60 : scratch.d.xmlexpr.named_argnull = palloc_array(bool, nnamed);
2315 : }
2316 : else
2317 : {
2318 642 : scratch.d.xmlexpr.named_argvalue = NULL;
2319 642 : scratch.d.xmlexpr.named_argnull = NULL;
2320 : }
2321 :
2322 702 : if (nargs)
2323 : {
2324 618 : scratch.d.xmlexpr.argvalue = palloc_array(Datum, nargs);
2325 618 : scratch.d.xmlexpr.argnull = palloc_array(bool, nargs);
2326 : }
2327 : else
2328 : {
2329 84 : scratch.d.xmlexpr.argvalue = NULL;
2330 84 : scratch.d.xmlexpr.argnull = NULL;
2331 : }
2332 :
2333 : /* prepare argument execution */
2334 702 : off = 0;
2335 870 : foreach(arg, xexpr->named_args)
2336 : {
2337 168 : Expr *e = (Expr *) lfirst(arg);
2338 :
2339 168 : ExecInitExprRec(e, state,
2340 168 : &scratch.d.xmlexpr.named_argvalue[off],
2341 168 : &scratch.d.xmlexpr.named_argnull[off]);
2342 168 : off++;
2343 : }
2344 :
2345 702 : off = 0;
2346 1638 : foreach(arg, xexpr->args)
2347 : {
2348 936 : Expr *e = (Expr *) lfirst(arg);
2349 :
2350 936 : ExecInitExprRec(e, state,
2351 936 : &scratch.d.xmlexpr.argvalue[off],
2352 936 : &scratch.d.xmlexpr.argnull[off]);
2353 936 : off++;
2354 : }
2355 :
2356 : /* and evaluate the actual XML expression */
2357 702 : ExprEvalPushStep(state, &scratch);
2358 702 : break;
2359 : }
2360 :
2361 228 : case T_JsonValueExpr:
2362 : {
2363 228 : JsonValueExpr *jve = (JsonValueExpr *) node;
2364 :
2365 : Assert(jve->raw_expr != NULL);
2366 228 : ExecInitExprRec(jve->raw_expr, state, resv, resnull);
2367 : Assert(jve->formatted_expr != NULL);
2368 228 : ExecInitExprRec(jve->formatted_expr, state, resv, resnull);
2369 228 : break;
2370 : }
2371 :
2372 1366 : case T_JsonConstructorExpr:
2373 : {
2374 1366 : JsonConstructorExpr *ctor = (JsonConstructorExpr *) node;
2375 1366 : List *args = ctor->args;
2376 : ListCell *lc;
2377 1366 : int nargs = list_length(args);
2378 1366 : int argno = 0;
2379 :
2380 1366 : if (ctor->func)
2381 : {
2382 420 : ExecInitExprRec(ctor->func, state, resv, resnull);
2383 : }
2384 946 : else if ((ctor->type == JSCTOR_JSON_PARSE && !ctor->unique) ||
2385 824 : ctor->type == JSCTOR_JSON_SERIALIZE)
2386 : {
2387 : /* Use the value of the first argument as result */
2388 220 : ExecInitExprRec(linitial(args), state, resv, resnull);
2389 : }
2390 : else
2391 : {
2392 : JsonConstructorExprState *jcstate;
2393 :
2394 726 : jcstate = palloc0_object(JsonConstructorExprState);
2395 :
2396 726 : scratch.opcode = EEOP_JSON_CONSTRUCTOR;
2397 726 : scratch.d.json_constructor.jcstate = jcstate;
2398 :
2399 726 : jcstate->constructor = ctor;
2400 726 : jcstate->arg_values = palloc_array(Datum, nargs);
2401 726 : jcstate->arg_nulls = palloc_array(bool, nargs);
2402 726 : jcstate->arg_types = palloc_array(Oid, nargs);
2403 726 : jcstate->nargs = nargs;
2404 :
2405 2278 : foreach(lc, args)
2406 : {
2407 1552 : Expr *arg = (Expr *) lfirst(lc);
2408 :
2409 1552 : jcstate->arg_types[argno] = exprType((Node *) arg);
2410 :
2411 1552 : if (IsA(arg, Const))
2412 : {
2413 : /* Don't evaluate const arguments every round */
2414 1414 : Const *con = (Const *) arg;
2415 :
2416 1414 : jcstate->arg_values[argno] = con->constvalue;
2417 1414 : jcstate->arg_nulls[argno] = con->constisnull;
2418 : }
2419 : else
2420 : {
2421 138 : ExecInitExprRec(arg, state,
2422 138 : &jcstate->arg_values[argno],
2423 138 : &jcstate->arg_nulls[argno]);
2424 : }
2425 1552 : argno++;
2426 : }
2427 :
2428 : /* prepare type cache for datum_to_json[b]() */
2429 726 : if (ctor->type == JSCTOR_JSON_SCALAR)
2430 : {
2431 112 : bool is_jsonb =
2432 112 : ctor->returning->format->format_type == JS_FORMAT_JSONB;
2433 :
2434 112 : jcstate->arg_type_cache =
2435 112 : palloc(sizeof(*jcstate->arg_type_cache) * nargs);
2436 :
2437 224 : for (int i = 0; i < nargs; i++)
2438 : {
2439 : JsonTypeCategory category;
2440 : Oid outfuncid;
2441 112 : Oid typid = jcstate->arg_types[i];
2442 :
2443 112 : json_categorize_type(typid, is_jsonb,
2444 : &category, &outfuncid);
2445 :
2446 112 : jcstate->arg_type_cache[i].outfuncid = outfuncid;
2447 112 : jcstate->arg_type_cache[i].category = (int) category;
2448 : }
2449 : }
2450 :
2451 726 : ExprEvalPushStep(state, &scratch);
2452 : }
2453 :
2454 1366 : if (ctor->coercion)
2455 : {
2456 374 : Datum *innermost_caseval = state->innermost_caseval;
2457 374 : bool *innermost_isnull = state->innermost_casenull;
2458 :
2459 374 : state->innermost_caseval = resv;
2460 374 : state->innermost_casenull = resnull;
2461 :
2462 374 : ExecInitExprRec(ctor->coercion, state, resv, resnull);
2463 :
2464 374 : state->innermost_caseval = innermost_caseval;
2465 374 : state->innermost_casenull = innermost_isnull;
2466 : }
2467 : }
2468 1366 : break;
2469 :
2470 350 : case T_JsonIsPredicate:
2471 : {
2472 350 : JsonIsPredicate *pred = (JsonIsPredicate *) node;
2473 :
2474 350 : ExecInitExprRec((Expr *) pred->expr, state, resv, resnull);
2475 :
2476 350 : scratch.opcode = EEOP_IS_JSON;
2477 350 : scratch.d.is_json.pred = pred;
2478 :
2479 350 : ExprEvalPushStep(state, &scratch);
2480 350 : break;
2481 : }
2482 :
2483 2716 : case T_JsonExpr:
2484 : {
2485 2716 : 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 2716 : if (jsexpr->op == JSON_TABLE_OP)
2493 404 : ExecInitExprRec((Expr *) jsexpr->formatted_expr, state,
2494 : resv, resnull);
2495 : else
2496 2312 : ExecInitJsonExpr(jsexpr, state, resv, resnull, &scratch);
2497 2716 : break;
2498 : }
2499 :
2500 28842 : case T_NullTest:
2501 : {
2502 28842 : NullTest *ntest = (NullTest *) node;
2503 :
2504 28842 : if (ntest->nulltesttype == IS_NULL)
2505 : {
2506 7734 : if (ntest->argisrow)
2507 228 : scratch.opcode = EEOP_NULLTEST_ROWISNULL;
2508 : else
2509 7506 : scratch.opcode = EEOP_NULLTEST_ISNULL;
2510 : }
2511 21108 : else if (ntest->nulltesttype == IS_NOT_NULL)
2512 : {
2513 21108 : if (ntest->argisrow)
2514 244 : scratch.opcode = EEOP_NULLTEST_ROWISNOTNULL;
2515 : else
2516 20864 : 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 28842 : scratch.d.nulltest_row.rowcache.cacheptr = NULL;
2525 :
2526 : /* first evaluate argument into result variable */
2527 28842 : ExecInitExprRec(ntest->arg, state,
2528 : resv, resnull);
2529 :
2530 : /* then push the test of that argument */
2531 28842 : ExprEvalPushStep(state, &scratch);
2532 28842 : break;
2533 : }
2534 :
2535 1378 : case T_BooleanTest:
2536 : {
2537 1378 : 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 1378 : ExecInitExprRec(btest->arg, state, resv, resnull);
2546 :
2547 1378 : switch (btest->booltesttype)
2548 : {
2549 498 : case IS_TRUE:
2550 498 : scratch.opcode = EEOP_BOOLTEST_IS_TRUE;
2551 498 : break;
2552 398 : case IS_NOT_TRUE:
2553 398 : scratch.opcode = EEOP_BOOLTEST_IS_NOT_TRUE;
2554 398 : break;
2555 140 : case IS_FALSE:
2556 140 : scratch.opcode = EEOP_BOOLTEST_IS_FALSE;
2557 140 : break;
2558 170 : case IS_NOT_FALSE:
2559 170 : scratch.opcode = EEOP_BOOLTEST_IS_NOT_FALSE;
2560 170 : break;
2561 58 : case IS_UNKNOWN:
2562 : /* Same as scalar IS NULL test */
2563 58 : scratch.opcode = EEOP_NULLTEST_ISNULL;
2564 58 : break;
2565 114 : case IS_NOT_UNKNOWN:
2566 : /* Same as scalar IS NOT NULL test */
2567 114 : scratch.opcode = EEOP_NULLTEST_ISNOTNULL;
2568 114 : break;
2569 0 : default:
2570 0 : elog(ERROR, "unrecognized booltesttype: %d",
2571 : (int) btest->booltesttype);
2572 : }
2573 :
2574 1378 : ExprEvalPushStep(state, &scratch);
2575 1378 : break;
2576 : }
2577 :
2578 9820 : case T_CoerceToDomain:
2579 : {
2580 9820 : CoerceToDomain *ctest = (CoerceToDomain *) node;
2581 :
2582 9820 : ExecInitCoerceToDomain(&scratch, ctest, state,
2583 : resv, resnull);
2584 9820 : break;
2585 : }
2586 :
2587 13788 : 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 13788 : if (state->innermost_domainval == NULL)
2598 2772 : scratch.opcode = EEOP_DOMAIN_TESTVAL_EXT;
2599 : else
2600 : {
2601 11016 : scratch.opcode = EEOP_DOMAIN_TESTVAL;
2602 : /* we share instruction union variant with case testval */
2603 11016 : scratch.d.casetest.value = state->innermost_domainval;
2604 11016 : scratch.d.casetest.isnull = state->innermost_domainnull;
2605 : }
2606 13788 : ExprEvalPushStep(state, &scratch);
2607 13788 : break;
2608 : }
2609 :
2610 2 : case T_CurrentOfExpr:
2611 : {
2612 2 : scratch.opcode = EEOP_CURRENTOFEXPR;
2613 2 : ExprEvalPushStep(state, &scratch);
2614 2 : break;
2615 : }
2616 :
2617 540 : case T_NextValueExpr:
2618 : {
2619 540 : NextValueExpr *nve = (NextValueExpr *) node;
2620 :
2621 540 : scratch.opcode = EEOP_NEXTVALUEEXPR;
2622 540 : scratch.d.nextvalueexpr.seqid = nve->seqid;
2623 540 : scratch.d.nextvalueexpr.seqtypid = nve->typeId;
2624 :
2625 540 : ExprEvalPushStep(state, &scratch);
2626 540 : break;
2627 : }
2628 :
2629 408 : case T_ReturningExpr:
2630 : {
2631 408 : ReturningExpr *rexpr = (ReturningExpr *) node;
2632 : int retstep;
2633 :
2634 : /* Skip expression evaluation if OLD/NEW row doesn't exist */
2635 408 : scratch.opcode = EEOP_RETURNINGEXPR;
2636 408 : scratch.d.returningexpr.nullflag = rexpr->retold ?
2637 : EEO_FLAG_OLD_IS_NULL : EEO_FLAG_NEW_IS_NULL;
2638 408 : scratch.d.returningexpr.jumpdone = -1; /* set below */
2639 408 : ExprEvalPushStep(state, &scratch);
2640 408 : retstep = state->steps_len - 1;
2641 :
2642 : /* Steps to evaluate expression to return */
2643 408 : ExecInitExprRec(rexpr->retexpr, state, resv, resnull);
2644 :
2645 : /* Jump target used if OLD/NEW row doesn't exist */
2646 408 : state->steps[retstep].d.returningexpr.jumpdone = state->steps_len;
2647 :
2648 : /* Update ExprState flags */
2649 408 : if (rexpr->retold)
2650 204 : state->flags |= EEO_FLAG_HAS_OLD;
2651 : else
2652 204 : state->flags |= EEO_FLAG_HAS_NEW;
2653 :
2654 408 : break;
2655 : }
2656 :
2657 0 : default:
2658 0 : elog(ERROR, "unrecognized node type: %d",
2659 : (int) nodeTag(node));
2660 : break;
2661 : }
2662 5402196 : }
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 12440970 : ExprEvalPushStep(ExprState *es, const ExprEvalStep *s)
2672 : {
2673 12440970 : if (es->steps_alloc == 0)
2674 : {
2675 2503404 : es->steps_alloc = 16;
2676 2503404 : es->steps = palloc_array(ExprEvalStep, es->steps_alloc);
2677 : }
2678 9937566 : else if (es->steps_alloc == es->steps_len)
2679 : {
2680 96046 : es->steps_alloc *= 2;
2681 96046 : es->steps = repalloc(es->steps,
2682 96046 : sizeof(ExprEvalStep) * es->steps_alloc);
2683 : }
2684 :
2685 12440970 : memcpy(&es->steps[es->steps_len++], s, sizeof(ExprEvalStep));
2686 12440970 : }
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 1497224 : ExecInitFunc(ExprEvalStep *scratch, Expr *node, List *args, Oid funcid,
2698 : Oid inputcollid, ExprState *state)
2699 : {
2700 1497224 : 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 1497224 : aclresult = object_aclcheck(ProcedureRelationId, funcid, GetUserId(), ACL_EXECUTE);
2709 1497224 : if (aclresult != ACLCHECK_OK)
2710 86 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(funcid));
2711 1497138 : 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 1497138 : 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 1497138 : scratch->d.func.finfo = palloc0_object(FmgrInfo);
2729 1497138 : scratch->d.func.fcinfo_data = palloc0(SizeForFunctionCallInfo(nargs));
2730 1497138 : flinfo = scratch->d.func.finfo;
2731 1497138 : fcinfo = scratch->d.func.fcinfo_data;
2732 :
2733 : /* Set up the primary fmgr lookup information */
2734 1497138 : fmgr_info(funcid, flinfo);
2735 1497138 : fmgr_info_set_expr((Node *) node, flinfo);
2736 :
2737 : /* Initialize function call parameter structure too */
2738 1497138 : InitFunctionCallInfoData(*fcinfo, flinfo,
2739 : nargs, inputcollid, NULL, NULL);
2740 :
2741 : /* Keep extra copies of this info to save an indirection at runtime */
2742 1497138 : scratch->d.func.fn_addr = flinfo->fn_addr;
2743 1497138 : scratch->d.func.nargs = nargs;
2744 :
2745 : /* We only support non-set functions here */
2746 1497138 : 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 1497138 : argno = 0;
2756 4066440 : foreach(lc, args)
2757 : {
2758 2569302 : Expr *arg = (Expr *) lfirst(lc);
2759 :
2760 2569302 : if (IsA(arg, Const))
2761 : {
2762 : /*
2763 : * Don't evaluate const arguments every round; especially
2764 : * interesting for constants in comparisons.
2765 : */
2766 1028114 : Const *con = (Const *) arg;
2767 :
2768 1028114 : fcinfo->args[argno].value = con->constvalue;
2769 1028114 : fcinfo->args[argno].isnull = con->constisnull;
2770 : }
2771 : else
2772 : {
2773 1541188 : ExecInitExprRec(arg, state,
2774 : &fcinfo->args[argno].value,
2775 : &fcinfo->args[argno].isnull);
2776 : }
2777 2569302 : argno++;
2778 : }
2779 :
2780 : /* Insert appropriate opcode depending on strictness and stats level */
2781 1497138 : if (pgstat_track_functions <= flinfo->fn_stats)
2782 : {
2783 1496924 : if (flinfo->fn_strict && nargs > 0)
2784 : {
2785 : /* Choose nargs optimized implementation if available. */
2786 1341510 : if (nargs == 1)
2787 269336 : scratch->opcode = EEOP_FUNCEXPR_STRICT_1;
2788 1072174 : else if (nargs == 2)
2789 1035310 : scratch->opcode = EEOP_FUNCEXPR_STRICT_2;
2790 : else
2791 36864 : scratch->opcode = EEOP_FUNCEXPR_STRICT;
2792 : }
2793 : else
2794 155414 : scratch->opcode = EEOP_FUNCEXPR;
2795 : }
2796 : else
2797 : {
2798 214 : if (flinfo->fn_strict && nargs > 0)
2799 6 : scratch->opcode = EEOP_FUNCEXPR_STRICT_FUSAGE;
2800 : else
2801 208 : scratch->opcode = EEOP_FUNCEXPR_FUSAGE;
2802 : }
2803 1497138 : }
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 29730 : ExecInitSubPlanExpr(SubPlan *subplan,
2815 : ExprState *state,
2816 : Datum *resv, bool *resnull)
2817 : {
2818 29730 : ExprEvalStep scratch = {0};
2819 : SubPlanState *sstate;
2820 : ListCell *pvar;
2821 : ListCell *l;
2822 :
2823 29730 : 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 74870 : forboth(l, subplan->parParam, pvar, subplan->args)
2842 : {
2843 45140 : int paramid = lfirst_int(l);
2844 45140 : Expr *arg = (Expr *) lfirst(pvar);
2845 :
2846 45140 : ExecInitExprRec(arg, state, resv, resnull);
2847 :
2848 45140 : scratch.opcode = EEOP_PARAM_SET;
2849 45140 : scratch.resvalue = resv;
2850 45140 : scratch.resnull = resnull;
2851 45140 : scratch.d.param.paramid = paramid;
2852 : /* paramtype's not actually used, but we might as well fill it */
2853 45140 : scratch.d.param.paramtype = exprType((Node *) arg);
2854 45140 : ExprEvalPushStep(state, &scratch);
2855 : }
2856 :
2857 29730 : sstate = ExecInitSubPlan(subplan, state->parent);
2858 :
2859 : /* add SubPlanState nodes to state->parent->subPlan */
2860 29730 : state->parent->subPlan = lappend(state->parent->subPlan,
2861 : sstate);
2862 :
2863 29730 : scratch.opcode = EEOP_SUBPLAN;
2864 29730 : scratch.resvalue = resv;
2865 29730 : scratch.resnull = resnull;
2866 29730 : scratch.d.subplan.sstate = sstate;
2867 :
2868 29730 : ExprEvalPushStep(state, &scratch);
2869 29730 : }
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 2394870 : ExecCreateExprSetupSteps(ExprState *state, Node *node)
2877 : {
2878 2394870 : ExprSetupInfo info = {0, 0, 0, 0, 0, NIL};
2879 :
2880 : /* Prescan to find out what we need. */
2881 2394870 : expr_setup_walker(node, &info);
2882 :
2883 : /* And generate those steps. */
2884 2394864 : ExecPushExprSetupSteps(state, &info);
2885 2394864 : }
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 2466344 : ExecPushExprSetupSteps(ExprState *state, ExprSetupInfo *info)
2893 : {
2894 2466344 : ExprEvalStep scratch = {0};
2895 : ListCell *lc;
2896 :
2897 2466344 : scratch.resvalue = NULL;
2898 2466344 : 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 2466344 : if (info->last_inner > 0)
2905 : {
2906 193950 : scratch.opcode = EEOP_INNER_FETCHSOME;
2907 193950 : scratch.d.fetch.last_var = info->last_inner;
2908 193950 : scratch.d.fetch.fixed = false;
2909 193950 : scratch.d.fetch.kind = NULL;
2910 193950 : scratch.d.fetch.known_desc = NULL;
2911 193950 : if (ExecComputeSlotInfo(state, &scratch))
2912 176470 : ExprEvalPushStep(state, &scratch);
2913 : }
2914 2466344 : if (info->last_outer > 0)
2915 : {
2916 352874 : scratch.opcode = EEOP_OUTER_FETCHSOME;
2917 352874 : scratch.d.fetch.last_var = info->last_outer;
2918 352874 : scratch.d.fetch.fixed = false;
2919 352874 : scratch.d.fetch.kind = NULL;
2920 352874 : scratch.d.fetch.known_desc = NULL;
2921 352874 : if (ExecComputeSlotInfo(state, &scratch))
2922 195574 : ExprEvalPushStep(state, &scratch);
2923 : }
2924 2466344 : if (info->last_scan > 0)
2925 : {
2926 640358 : scratch.opcode = EEOP_SCAN_FETCHSOME;
2927 640358 : scratch.d.fetch.last_var = info->last_scan;
2928 640358 : scratch.d.fetch.fixed = false;
2929 640358 : scratch.d.fetch.kind = NULL;
2930 640358 : scratch.d.fetch.known_desc = NULL;
2931 640358 : if (ExecComputeSlotInfo(state, &scratch))
2932 596190 : ExprEvalPushStep(state, &scratch);
2933 : }
2934 2466344 : if (info->last_old > 0)
2935 : {
2936 346 : scratch.opcode = EEOP_OLD_FETCHSOME;
2937 346 : scratch.d.fetch.last_var = info->last_old;
2938 346 : scratch.d.fetch.fixed = false;
2939 346 : scratch.d.fetch.kind = NULL;
2940 346 : scratch.d.fetch.known_desc = NULL;
2941 346 : if (ExecComputeSlotInfo(state, &scratch))
2942 346 : ExprEvalPushStep(state, &scratch);
2943 : }
2944 2466344 : if (info->last_new > 0)
2945 : {
2946 348 : scratch.opcode = EEOP_NEW_FETCHSOME;
2947 348 : scratch.d.fetch.last_var = info->last_new;
2948 348 : scratch.d.fetch.fixed = false;
2949 348 : scratch.d.fetch.kind = NULL;
2950 348 : scratch.d.fetch.known_desc = NULL;
2951 348 : if (ExecComputeSlotInfo(state, &scratch))
2952 348 : 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 2466470 : foreach(lc, info->multiexpr_subplans)
2963 : {
2964 126 : 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 126 : ExecInitSubPlanExpr(subplan, state,
2970 : &state->resvalue, &state->resnull);
2971 : }
2972 2466344 : }
2973 :
2974 : /*
2975 : * expr_setup_walker: expression walker for ExecCreateExprSetupSteps
2976 : */
2977 : static bool
2978 11637474 : expr_setup_walker(Node *node, ExprSetupInfo *info)
2979 : {
2980 11637474 : if (node == NULL)
2981 453740 : return false;
2982 11183734 : if (IsA(node, Var))
2983 : {
2984 2585524 : Var *variable = (Var *) node;
2985 2585524 : AttrNumber attnum = variable->varattno;
2986 :
2987 2585524 : switch (variable->varno)
2988 : {
2989 366132 : case INNER_VAR:
2990 366132 : info->last_inner = Max(info->last_inner, attnum);
2991 366132 : break;
2992 :
2993 873996 : case OUTER_VAR:
2994 873996 : info->last_outer = Max(info->last_outer, attnum);
2995 873996 : break;
2996 :
2997 : /* INDEX_VAR is handled by default case */
2998 :
2999 1345396 : default:
3000 1345396 : switch (variable->varreturningtype)
3001 : {
3002 1342198 : case VAR_RETURNING_DEFAULT:
3003 1342198 : info->last_scan = Max(info->last_scan, attnum);
3004 1342198 : break;
3005 1598 : case VAR_RETURNING_OLD:
3006 1598 : info->last_old = Max(info->last_old, attnum);
3007 1598 : break;
3008 1600 : case VAR_RETURNING_NEW:
3009 1600 : info->last_new = Max(info->last_new, attnum);
3010 1600 : break;
3011 : }
3012 1345396 : break;
3013 : }
3014 2585524 : return false;
3015 : }
3016 :
3017 : /* Collect all MULTIEXPR SubPlans, too */
3018 8598210 : if (IsA(node, SubPlan))
3019 : {
3020 29730 : SubPlan *subplan = (SubPlan *) node;
3021 :
3022 29730 : if (subplan->subLinkType == MULTIEXPR_SUBLINK)
3023 126 : 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 8598210 : if (IsA(node, Aggref))
3034 60252 : return false;
3035 8537958 : if (IsA(node, WindowFunc))
3036 3602 : return false;
3037 8534356 : if (IsA(node, GroupingFunc))
3038 350 : return false;
3039 8534006 : 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 1241700 : ExecComputeSlotInfo(ExprState *state, ExprEvalStep *op)
3058 : {
3059 1241700 : PlanState *parent = state->parent;
3060 1241700 : TupleDesc desc = NULL;
3061 1241700 : const TupleTableSlotOps *tts_ops = NULL;
3062 1241700 : bool isfixed = false;
3063 1241700 : 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 1241700 : if (op->d.fetch.known_desc != NULL)
3072 : {
3073 53824 : desc = op->d.fetch.known_desc;
3074 53824 : tts_ops = op->d.fetch.kind;
3075 53824 : isfixed = op->d.fetch.kind != NULL;
3076 : }
3077 1187876 : else if (!parent)
3078 : {
3079 15160 : isfixed = false;
3080 : }
3081 1172716 : else if (opcode == EEOP_INNER_FETCHSOME)
3082 : {
3083 193838 : PlanState *is = innerPlanState(parent);
3084 :
3085 193838 : if (parent->inneropsset && !parent->inneropsfixed)
3086 : {
3087 0 : isfixed = false;
3088 : }
3089 193838 : else if (parent->inneropsset && parent->innerops)
3090 : {
3091 0 : isfixed = true;
3092 0 : tts_ops = parent->innerops;
3093 0 : desc = ExecGetResultType(is);
3094 : }
3095 193838 : else if (is)
3096 : {
3097 191236 : tts_ops = ExecGetResultSlotOps(is, &isfixed);
3098 191236 : desc = ExecGetResultType(is);
3099 : }
3100 : }
3101 978878 : else if (opcode == EEOP_OUTER_FETCHSOME)
3102 : {
3103 352660 : PlanState *os = outerPlanState(parent);
3104 :
3105 352660 : if (parent->outeropsset && !parent->outeropsfixed)
3106 : {
3107 1234 : isfixed = false;
3108 : }
3109 351426 : else if (parent->outeropsset && parent->outerops)
3110 : {
3111 45372 : isfixed = true;
3112 45372 : tts_ops = parent->outerops;
3113 45372 : desc = ExecGetResultType(os);
3114 : }
3115 306054 : else if (os)
3116 : {
3117 306042 : tts_ops = ExecGetResultSlotOps(os, &isfixed);
3118 306042 : desc = ExecGetResultType(os);
3119 : }
3120 : }
3121 626218 : else if (opcode == EEOP_SCAN_FETCHSOME ||
3122 348 : opcode == EEOP_OLD_FETCHSOME ||
3123 : opcode == EEOP_NEW_FETCHSOME)
3124 : {
3125 626218 : desc = parent->scandesc;
3126 :
3127 626218 : if (parent->scanops)
3128 602292 : tts_ops = parent->scanops;
3129 :
3130 626218 : if (parent->scanopsset)
3131 602292 : isfixed = parent->scanopsfixed;
3132 : }
3133 :
3134 1241700 : if (isfixed && desc != NULL && tts_ops != NULL)
3135 : {
3136 1170934 : op->d.fetch.fixed = true;
3137 1170934 : op->d.fetch.kind = tts_ops;
3138 1170934 : op->d.fetch.known_desc = desc;
3139 : }
3140 : else
3141 : {
3142 70766 : op->d.fetch.fixed = false;
3143 70766 : op->d.fetch.kind = NULL;
3144 70766 : op->d.fetch.known_desc = NULL;
3145 : }
3146 :
3147 : /* if the slot is known to always virtual we never need to deform */
3148 1241700 : if (op->d.fetch.fixed && op->d.fetch.kind == &TTSOpsVirtual)
3149 226502 : return false;
3150 :
3151 1015198 : 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 5072 : ExecInitWholeRowVar(ExprEvalStep *scratch, Var *variable, ExprState *state)
3160 : {
3161 5072 : PlanState *parent = state->parent;
3162 :
3163 : /* fill in all but the target */
3164 5072 : scratch->opcode = EEOP_WHOLEROW;
3165 5072 : scratch->d.wholerow.var = variable;
3166 5072 : scratch->d.wholerow.first = true;
3167 5072 : scratch->d.wholerow.slow = false;
3168 5072 : scratch->d.wholerow.tupdesc = NULL; /* filled at runtime */
3169 5072 : scratch->d.wholerow.junkFilter = NULL;
3170 :
3171 : /* update ExprState flags if Var refers to OLD/NEW */
3172 5072 : if (variable->varreturningtype == VAR_RETURNING_OLD)
3173 118 : state->flags |= EEO_FLAG_HAS_OLD;
3174 4954 : else if (variable->varreturningtype == VAR_RETURNING_NEW)
3175 118 : 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 5072 : if (parent)
3190 : {
3191 5022 : PlanState *subplan = NULL;
3192 :
3193 5022 : switch (nodeTag(parent))
3194 : {
3195 338 : case T_SubqueryScanState:
3196 338 : subplan = ((SubqueryScanState *) parent)->subplan;
3197 338 : break;
3198 172 : case T_CteScanState:
3199 172 : subplan = ((CteScanState *) parent)->cteplanstate;
3200 172 : break;
3201 4512 : default:
3202 4512 : break;
3203 : }
3204 :
3205 5022 : if (subplan)
3206 : {
3207 510 : bool junk_filter_needed = false;
3208 : ListCell *tlist;
3209 :
3210 : /* Detect whether subplan tlist actually has any junk columns */
3211 1568 : foreach(tlist, subplan->plan->targetlist)
3212 : {
3213 1070 : TargetEntry *tle = (TargetEntry *) lfirst(tlist);
3214 :
3215 1070 : if (tle->resjunk)
3216 : {
3217 12 : junk_filter_needed = true;
3218 12 : break;
3219 : }
3220 : }
3221 :
3222 : /* If so, build the junkfilter now */
3223 510 : if (junk_filter_needed)
3224 : {
3225 12 : scratch->d.wholerow.junkFilter =
3226 12 : ExecInitJunkFilter(subplan->plan->targetlist,
3227 : ExecInitExtraTupleSlot(parent->state, NULL,
3228 : &TTSOpsVirtual));
3229 : }
3230 : }
3231 : }
3232 5072 : }
3233 :
3234 : /*
3235 : * Prepare evaluation of a SubscriptingRef expression.
3236 : */
3237 : static void
3238 27936 : ExecInitSubscriptingRef(ExprEvalStep *scratch, SubscriptingRef *sbsref,
3239 : ExprState *state, Datum *resv, bool *resnull)
3240 : {
3241 27936 : bool isAssignment = (sbsref->refassgnexpr != NULL);
3242 27936 : int nupper = list_length(sbsref->refupperindexpr);
3243 27936 : int nlower = list_length(sbsref->reflowerindexpr);
3244 : const SubscriptRoutines *sbsroutines;
3245 : SubscriptingRefState *sbsrefstate;
3246 : SubscriptExecSteps methods;
3247 : char *ptr;
3248 27936 : List *adjust_jumps = NIL;
3249 : ListCell *lc;
3250 : int i;
3251 :
3252 : /* Look up the subscripting support methods */
3253 27936 : sbsroutines = getSubscriptingRoutines(sbsref->refcontainertype, NULL);
3254 27936 : 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 27936 : sbsrefstate = palloc0(MAXALIGN(sizeof(SubscriptingRefState)) +
3265 27936 : (nupper + nlower) * (sizeof(Datum) +
3266 : 2 * sizeof(bool)));
3267 :
3268 : /* Fill constant fields of SubscriptingRefState */
3269 27936 : sbsrefstate->isassignment = isAssignment;
3270 27936 : sbsrefstate->numupper = nupper;
3271 27936 : sbsrefstate->numlower = nlower;
3272 : /* Set up per-subscript arrays */
3273 27936 : ptr = ((char *) sbsrefstate) + MAXALIGN(sizeof(SubscriptingRefState));
3274 27936 : sbsrefstate->upperindex = (Datum *) ptr;
3275 27936 : ptr += nupper * sizeof(Datum);
3276 27936 : sbsrefstate->lowerindex = (Datum *) ptr;
3277 27936 : ptr += nlower * sizeof(Datum);
3278 27936 : sbsrefstate->upperprovided = (bool *) ptr;
3279 27936 : ptr += nupper * sizeof(bool);
3280 27936 : sbsrefstate->lowerprovided = (bool *) ptr;
3281 27936 : ptr += nlower * sizeof(bool);
3282 27936 : sbsrefstate->upperindexnull = (bool *) ptr;
3283 27936 : ptr += nupper * sizeof(bool);
3284 27936 : 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 27936 : memset(&methods, 0, sizeof(methods));
3294 27936 : 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 27936 : 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 27936 : if (!isAssignment && sbsroutines->fetch_strict)
3310 : {
3311 26616 : scratch->opcode = EEOP_JUMP_IF_NULL;
3312 26616 : scratch->d.jump.jumpdone = -1; /* adjust later */
3313 26616 : ExprEvalPushStep(state, scratch);
3314 26616 : adjust_jumps = lappend_int(adjust_jumps,
3315 26616 : state->steps_len - 1);
3316 : }
3317 :
3318 : /* Evaluate upper subscripts */
3319 27936 : i = 0;
3320 56462 : foreach(lc, sbsref->refupperindexpr)
3321 : {
3322 28526 : Expr *e = (Expr *) lfirst(lc);
3323 :
3324 : /* When slicing, individual subscript bounds can be omitted */
3325 28526 : if (!e)
3326 : {
3327 78 : sbsrefstate->upperprovided[i] = false;
3328 78 : sbsrefstate->upperindexnull[i] = true;
3329 : }
3330 : else
3331 : {
3332 28448 : sbsrefstate->upperprovided[i] = true;
3333 : /* Each subscript is evaluated into appropriate array entry */
3334 28448 : ExecInitExprRec(e, state,
3335 28448 : &sbsrefstate->upperindex[i],
3336 28448 : &sbsrefstate->upperindexnull[i]);
3337 : }
3338 28526 : i++;
3339 : }
3340 :
3341 : /* Evaluate lower subscripts similarly */
3342 27936 : i = 0;
3343 28542 : foreach(lc, sbsref->reflowerindexpr)
3344 : {
3345 606 : Expr *e = (Expr *) lfirst(lc);
3346 :
3347 : /* When slicing, individual subscript bounds can be omitted */
3348 606 : if (!e)
3349 : {
3350 78 : sbsrefstate->lowerprovided[i] = false;
3351 78 : sbsrefstate->lowerindexnull[i] = true;
3352 : }
3353 : else
3354 : {
3355 528 : sbsrefstate->lowerprovided[i] = true;
3356 : /* Each subscript is evaluated into appropriate array entry */
3357 528 : ExecInitExprRec(e, state,
3358 528 : &sbsrefstate->lowerindex[i],
3359 528 : &sbsrefstate->lowerindexnull[i]);
3360 : }
3361 606 : i++;
3362 : }
3363 :
3364 : /* SBSREF_SUBSCRIPTS checks and converts all the subscripts at once */
3365 27936 : if (methods.sbs_check_subscripts)
3366 : {
3367 27922 : scratch->opcode = EEOP_SBSREF_SUBSCRIPTS;
3368 27922 : scratch->d.sbsref_subscript.subscriptfunc = methods.sbs_check_subscripts;
3369 27922 : scratch->d.sbsref_subscript.state = sbsrefstate;
3370 27922 : scratch->d.sbsref_subscript.jumpdone = -1; /* adjust later */
3371 27922 : ExprEvalPushStep(state, scratch);
3372 27922 : adjust_jumps = lappend_int(adjust_jumps,
3373 27922 : state->steps_len - 1);
3374 : }
3375 :
3376 27936 : if (isAssignment)
3377 : {
3378 : Datum *save_innermost_caseval;
3379 : bool *save_innermost_casenull;
3380 :
3381 : /* Check for unimplemented methods */
3382 1320 : 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 1320 : if (isAssignmentIndirectionExpr(sbsref->refassgnexpr))
3403 : {
3404 186 : 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 186 : scratch->opcode = EEOP_SBSREF_OLD;
3410 186 : scratch->d.sbsref.subscriptfunc = methods.sbs_fetch_old;
3411 186 : scratch->d.sbsref.state = sbsrefstate;
3412 186 : ExprEvalPushStep(state, scratch);
3413 : }
3414 :
3415 : /* SBSREF_OLD puts extracted value into prevvalue/prevnull */
3416 1320 : save_innermost_caseval = state->innermost_caseval;
3417 1320 : save_innermost_casenull = state->innermost_casenull;
3418 1320 : state->innermost_caseval = &sbsrefstate->prevvalue;
3419 1320 : state->innermost_casenull = &sbsrefstate->prevnull;
3420 :
3421 : /* evaluate replacement value into replacevalue/replacenull */
3422 1320 : ExecInitExprRec(sbsref->refassgnexpr, state,
3423 : &sbsrefstate->replacevalue, &sbsrefstate->replacenull);
3424 :
3425 1320 : state->innermost_caseval = save_innermost_caseval;
3426 1320 : state->innermost_casenull = save_innermost_casenull;
3427 :
3428 : /* and perform the assignment */
3429 1320 : scratch->opcode = EEOP_SBSREF_ASSIGN;
3430 1320 : scratch->d.sbsref.subscriptfunc = methods.sbs_assign;
3431 1320 : scratch->d.sbsref.state = sbsrefstate;
3432 1320 : ExprEvalPushStep(state, scratch);
3433 : }
3434 : else
3435 : {
3436 : /* array fetch is much simpler */
3437 26616 : scratch->opcode = EEOP_SBSREF_FETCH;
3438 26616 : scratch->d.sbsref.subscriptfunc = methods.sbs_fetch;
3439 26616 : scratch->d.sbsref.state = sbsrefstate;
3440 26616 : ExprEvalPushStep(state, scratch);
3441 : }
3442 :
3443 : /* adjust jump targets */
3444 82474 : foreach(lc, adjust_jumps)
3445 : {
3446 54538 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
3447 :
3448 54538 : if (as->opcode == EEOP_SBSREF_SUBSCRIPTS)
3449 : {
3450 : Assert(as->d.sbsref_subscript.jumpdone == -1);
3451 27922 : 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 26616 : as->d.jump.jumpdone = state->steps_len;
3458 : }
3459 : }
3460 27936 : }
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 1404 : isAssignmentIndirectionExpr(Expr *expr)
3481 : {
3482 1404 : if (expr == NULL)
3483 0 : return false; /* just paranoia */
3484 1404 : if (IsA(expr, FieldStore))
3485 : {
3486 186 : FieldStore *fstore = (FieldStore *) expr;
3487 :
3488 186 : if (fstore->arg && IsA(fstore->arg, CaseTestExpr))
3489 186 : return true;
3490 : }
3491 1218 : else if (IsA(expr, SubscriptingRef))
3492 : {
3493 32 : SubscriptingRef *sbsRef = (SubscriptingRef *) expr;
3494 :
3495 32 : if (sbsRef->refexpr && IsA(sbsRef->refexpr, CaseTestExpr))
3496 0 : return true;
3497 : }
3498 1186 : else if (IsA(expr, CoerceToDomain))
3499 : {
3500 66 : CoerceToDomain *cd = (CoerceToDomain *) expr;
3501 :
3502 66 : return isAssignmentIndirectionExpr(cd->arg);
3503 : }
3504 1120 : else if (IsA(expr, RelabelType))
3505 : {
3506 18 : RelabelType *r = (RelabelType *) expr;
3507 :
3508 18 : return isAssignmentIndirectionExpr(r->arg);
3509 : }
3510 1134 : return false;
3511 : }
3512 :
3513 : /*
3514 : * Prepare evaluation of a CoerceToDomain expression.
3515 : */
3516 : static void
3517 9820 : ExecInitCoerceToDomain(ExprEvalStep *scratch, CoerceToDomain *ctest,
3518 : ExprState *state, Datum *resv, bool *resnull)
3519 : {
3520 : DomainConstraintRef *constraint_ref;
3521 9820 : Datum *domainval = NULL;
3522 9820 : bool *domainnull = NULL;
3523 : ListCell *l;
3524 :
3525 9820 : scratch->d.domaincheck.resulttype = ctest->resulttype;
3526 : /* we'll allocate workspace only if needed */
3527 9820 : scratch->d.domaincheck.checkvalue = NULL;
3528 9820 : scratch->d.domaincheck.checknull = NULL;
3529 9820 : 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 9820 : 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 9820 : constraint_ref = palloc_object(DomainConstraintRef);
3556 9820 : 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 20638 : foreach(l, constraint_ref->constraints)
3567 : {
3568 10818 : DomainConstraintState *con = (DomainConstraintState *) lfirst(l);
3569 : Datum *save_innermost_domainval;
3570 : bool *save_innermost_domainnull;
3571 :
3572 10818 : scratch->d.domaincheck.constraintname = con->name;
3573 :
3574 10818 : switch (con->constrainttype)
3575 : {
3576 396 : case DOM_CONSTRAINT_NOTNULL:
3577 396 : scratch->opcode = EEOP_DOMAIN_NOTNULL;
3578 396 : ExprEvalPushStep(state, scratch);
3579 396 : break;
3580 10422 : case DOM_CONSTRAINT_CHECK:
3581 : /* Allocate workspace for CHECK output if we didn't yet */
3582 10422 : if (scratch->d.domaincheck.checkvalue == NULL)
3583 : {
3584 9562 : scratch->d.domaincheck.checkvalue =
3585 9562 : palloc_object(Datum);
3586 9562 : scratch->d.domaincheck.checknull =
3587 9562 : palloc_object(bool);
3588 : }
3589 :
3590 : /*
3591 : * If first time through, determine where CoerceToDomainValue
3592 : * nodes should read from.
3593 : */
3594 10422 : 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 9562 : if (get_typlen(ctest->resulttype) == -1)
3601 : {
3602 3102 : ExprEvalStep scratch2 = {0};
3603 :
3604 : /* Yes, so make output workspace for MAKE_READONLY */
3605 3102 : domainval = palloc_object(Datum);
3606 3102 : domainnull = palloc_object(bool);
3607 :
3608 : /* Emit MAKE_READONLY */
3609 3102 : scratch2.opcode = EEOP_MAKE_READONLY;
3610 3102 : scratch2.resvalue = domainval;
3611 3102 : scratch2.resnull = domainnull;
3612 3102 : scratch2.d.make_readonly.value = resv;
3613 3102 : scratch2.d.make_readonly.isnull = resnull;
3614 3102 : ExprEvalPushStep(state, &scratch2);
3615 : }
3616 : else
3617 : {
3618 : /* No, so it's fine to read from resv/resnull */
3619 6460 : domainval = resv;
3620 6460 : 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 10422 : save_innermost_domainval = state->innermost_domainval;
3631 10422 : save_innermost_domainnull = state->innermost_domainnull;
3632 10422 : state->innermost_domainval = domainval;
3633 10422 : state->innermost_domainnull = domainnull;
3634 :
3635 : /* evaluate check expression value */
3636 10422 : ExecInitExprRec(con->check_expr, state,
3637 : scratch->d.domaincheck.checkvalue,
3638 : scratch->d.domaincheck.checknull);
3639 :
3640 10422 : state->innermost_domainval = save_innermost_domainval;
3641 10422 : state->innermost_domainnull = save_innermost_domainnull;
3642 :
3643 : /* now test result */
3644 10422 : scratch->opcode = EEOP_DOMAIN_CHECK;
3645 10422 : ExprEvalPushStep(state, scratch);
3646 :
3647 10422 : break;
3648 0 : default:
3649 0 : elog(ERROR, "unrecognized constraint type: %d",
3650 : (int) con->constrainttype);
3651 : break;
3652 : }
3653 : }
3654 9820 : }
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 54688 : ExecBuildAggTrans(AggState *aggstate, AggStatePerPhase phase,
3672 : bool doSort, bool doHash, bool nullcheck)
3673 : {
3674 54688 : ExprState *state = makeNode(ExprState);
3675 54688 : PlanState *parent = &aggstate->ss.ps;
3676 54688 : ExprEvalStep scratch = {0};
3677 54688 : bool isCombine = DO_AGGSPLIT_COMBINE(aggstate->aggsplit);
3678 54688 : ExprSetupInfo deform = {0, 0, 0, 0, 0, NIL};
3679 :
3680 54688 : state->expr = (Expr *) aggstate;
3681 54688 : state->parent = parent;
3682 :
3683 54688 : scratch.resvalue = &state->resvalue;
3684 54688 : 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 114734 : for (int transno = 0; transno < aggstate->numtrans; transno++)
3691 : {
3692 60046 : AggStatePerTrans pertrans = &aggstate->pertrans[transno];
3693 :
3694 60046 : expr_setup_walker((Node *) pertrans->aggref->aggdirectargs,
3695 : &deform);
3696 60046 : expr_setup_walker((Node *) pertrans->aggref->args,
3697 : &deform);
3698 60046 : expr_setup_walker((Node *) pertrans->aggref->aggorder,
3699 : &deform);
3700 60046 : expr_setup_walker((Node *) pertrans->aggref->aggdistinct,
3701 : &deform);
3702 60046 : expr_setup_walker((Node *) pertrans->aggref->aggfilter,
3703 : &deform);
3704 : }
3705 54688 : ExecPushExprSetupSteps(state, &deform);
3706 :
3707 : /*
3708 : * Emit instructions for each transition value / grouping set combination.
3709 : */
3710 114734 : for (int transno = 0; transno < aggstate->numtrans; transno++)
3711 : {
3712 60046 : AggStatePerTrans pertrans = &aggstate->pertrans[transno];
3713 60046 : FunctionCallInfo trans_fcinfo = pertrans->transfn_fcinfo;
3714 60046 : List *adjust_bailout = NIL;
3715 60046 : NullableDatum *strictargs = NULL;
3716 60046 : 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 60046 : if (pertrans->aggref->aggfilter && !isCombine)
3727 : {
3728 : /* evaluate filter expression */
3729 760 : ExecInitExprRec(pertrans->aggref->aggfilter, state,
3730 : &state->resvalue, &state->resnull);
3731 : /* and jump out if false */
3732 760 : scratch.opcode = EEOP_JUMP_IF_NOT_TRUE;
3733 760 : scratch.d.jump.jumpdone = -1; /* adjust later */
3734 760 : ExprEvalPushStep(state, &scratch);
3735 760 : adjust_bailout = lappend_int(adjust_bailout,
3736 760 : state->steps_len - 1);
3737 : }
3738 :
3739 : /*
3740 : * Evaluate arguments to aggregate/combine function.
3741 : */
3742 60046 : argno = 0;
3743 60046 : 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 2240 : strictargs = trans_fcinfo->args + 1;
3756 2240 : 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 2240 : if (!OidIsValid(pertrans->deserialfn_oid))
3763 : {
3764 : /*
3765 : * Start from 1, since the 0th arg will be the transition
3766 : * value
3767 : */
3768 2120 : ExecInitExprRec(source_tle->expr, state,
3769 2120 : &trans_fcinfo->args[argno + 1].value,
3770 2120 : &trans_fcinfo->args[argno + 1].isnull);
3771 : }
3772 : else
3773 : {
3774 120 : FunctionCallInfo ds_fcinfo = pertrans->deserialfn_fcinfo;
3775 :
3776 : /* evaluate argument */
3777 120 : 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 120 : ds_fcinfo->args[1].value = PointerGetDatum(NULL);
3783 120 : ds_fcinfo->args[1].isnull = false;
3784 :
3785 : /*
3786 : * Don't call a strict deserialization function with NULL
3787 : * input
3788 : */
3789 120 : if (pertrans->deserialfn.fn_strict)
3790 120 : scratch.opcode = EEOP_AGG_STRICT_DESERIALIZE;
3791 : else
3792 0 : scratch.opcode = EEOP_AGG_DESERIALIZE;
3793 :
3794 120 : scratch.d.agg_deserialize.fcinfo_data = ds_fcinfo;
3795 120 : scratch.d.agg_deserialize.jumpnull = -1; /* adjust later */
3796 120 : scratch.resvalue = &trans_fcinfo->args[argno + 1].value;
3797 120 : scratch.resnull = &trans_fcinfo->args[argno + 1].isnull;
3798 :
3799 120 : ExprEvalPushStep(state, &scratch);
3800 : /* don't add an adjustment unless the function is strict */
3801 120 : if (pertrans->deserialfn.fn_strict)
3802 120 : adjust_bailout = lappend_int(adjust_bailout,
3803 120 : state->steps_len - 1);
3804 :
3805 : /* restore normal settings of scratch fields */
3806 120 : scratch.resvalue = &state->resvalue;
3807 120 : scratch.resnull = &state->resnull;
3808 : }
3809 2240 : argno++;
3810 :
3811 : Assert(pertrans->numInputs == argno);
3812 : }
3813 57806 : 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 57510 : strictargs = trans_fcinfo->args + 1;
3823 :
3824 97956 : foreach(arg, pertrans->aggref->args)
3825 : {
3826 41964 : 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 41964 : if (argno == pertrans->numTransInputs)
3833 1518 : break;
3834 :
3835 : /*
3836 : * Start from 1, since the 0th arg will be the transition
3837 : * value
3838 : */
3839 40446 : ExecInitExprRec(source_tle->expr, state,
3840 40446 : &trans_fcinfo->args[argno + 1].value,
3841 40446 : &trans_fcinfo->args[argno + 1].isnull);
3842 40446 : argno++;
3843 : }
3844 : Assert(pertrans->numTransInputs == argno);
3845 : }
3846 296 : 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 248 : TargetEntry *source_tle =
3853 248 : (TargetEntry *) linitial(pertrans->aggref->args);
3854 :
3855 : Assert(list_length(pertrans->aggref->args) == 1);
3856 :
3857 248 : ExecInitExprRec(source_tle->expr, state,
3858 : &state->resvalue,
3859 : &state->resnull);
3860 248 : strictnulls = &state->resnull;
3861 248 : 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 48 : Datum *values = pertrans->sortslot->tts_values;
3872 48 : bool *nulls = pertrans->sortslot->tts_isnull;
3873 : ListCell *arg;
3874 :
3875 48 : strictnulls = nulls;
3876 :
3877 168 : foreach(arg, pertrans->aggref->args)
3878 : {
3879 120 : TargetEntry *source_tle = (TargetEntry *) lfirst(arg);
3880 :
3881 120 : ExecInitExprRec(source_tle->expr, state,
3882 120 : &values[argno], &nulls[argno]);
3883 120 : 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 60046 : if (trans_fcinfo->flinfo->fn_strict && pertrans->numTransInputs > 0)
3894 : {
3895 11252 : if (strictnulls)
3896 162 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_NULLS;
3897 11090 : else if (strictargs && pertrans->numTransInputs == 1)
3898 10862 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_ARGS_1;
3899 : else
3900 228 : scratch.opcode = EEOP_AGG_STRICT_INPUT_CHECK_ARGS;
3901 11252 : scratch.d.agg_strict_input_check.nulls = strictnulls;
3902 11252 : scratch.d.agg_strict_input_check.args = strictargs;
3903 11252 : scratch.d.agg_strict_input_check.jumpnull = -1; /* adjust later */
3904 11252 : scratch.d.agg_strict_input_check.nargs = pertrans->numTransInputs;
3905 11252 : ExprEvalPushStep(state, &scratch);
3906 11252 : adjust_bailout = lappend_int(adjust_bailout,
3907 11252 : state->steps_len - 1);
3908 : }
3909 :
3910 : /* Handle DISTINCT aggregates which have pre-sorted input */
3911 60046 : if (pertrans->numDistinctCols > 0 && !pertrans->aggsortrequired)
3912 : {
3913 436 : if (pertrans->numDistinctCols > 1)
3914 102 : scratch.opcode = EEOP_AGG_PRESORTED_DISTINCT_MULTI;
3915 : else
3916 334 : scratch.opcode = EEOP_AGG_PRESORTED_DISTINCT_SINGLE;
3917 :
3918 436 : scratch.d.agg_presorted_distinctcheck.pertrans = pertrans;
3919 436 : scratch.d.agg_presorted_distinctcheck.jumpdistinct = -1; /* adjust later */
3920 436 : ExprEvalPushStep(state, &scratch);
3921 436 : adjust_bailout = lappend_int(adjust_bailout,
3922 436 : 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 60046 : if (doSort)
3931 : {
3932 51916 : int processGroupingSets = Max(phase->numsets, 1);
3933 51916 : int setoff = 0;
3934 :
3935 104978 : for (int setno = 0; setno < processGroupingSets; setno++)
3936 : {
3937 53062 : ExecBuildAggTransCall(state, aggstate, &scratch, trans_fcinfo,
3938 : pertrans, transno, setno, setoff, false,
3939 : nullcheck);
3940 53062 : setoff++;
3941 : }
3942 : }
3943 :
3944 60046 : if (doHash)
3945 : {
3946 8504 : int numHashes = aggstate->num_hashes;
3947 : int setoff;
3948 :
3949 : /* in MIXED mode, there'll be preceding transition values */
3950 8504 : if (aggstate->aggstrategy != AGG_HASHED)
3951 398 : setoff = aggstate->maxsets;
3952 : else
3953 8106 : setoff = 0;
3954 :
3955 18218 : for (int setno = 0; setno < numHashes; setno++)
3956 : {
3957 9714 : ExecBuildAggTransCall(state, aggstate, &scratch, trans_fcinfo,
3958 : pertrans, transno, setno, setoff, true,
3959 : nullcheck);
3960 9714 : setoff++;
3961 : }
3962 : }
3963 :
3964 : /* adjust early bail out jump target(s) */
3965 72614 : foreach(bail, adjust_bailout)
3966 : {
3967 12568 : ExprEvalStep *as = &state->steps[lfirst_int(bail)];
3968 :
3969 12568 : if (as->opcode == EEOP_JUMP_IF_NOT_TRUE)
3970 : {
3971 : Assert(as->d.jump.jumpdone == -1);
3972 760 : as->d.jump.jumpdone = state->steps_len;
3973 : }
3974 11808 : else if (as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_ARGS ||
3975 11580 : as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_ARGS_1 ||
3976 718 : as->opcode == EEOP_AGG_STRICT_INPUT_CHECK_NULLS)
3977 : {
3978 : Assert(as->d.agg_strict_input_check.jumpnull == -1);
3979 11252 : as->d.agg_strict_input_check.jumpnull = state->steps_len;
3980 : }
3981 556 : else if (as->opcode == EEOP_AGG_STRICT_DESERIALIZE)
3982 : {
3983 : Assert(as->d.agg_deserialize.jumpnull == -1);
3984 120 : as->d.agg_deserialize.jumpnull = state->steps_len;
3985 : }
3986 436 : else if (as->opcode == EEOP_AGG_PRESORTED_DISTINCT_SINGLE ||
3987 102 : as->opcode == EEOP_AGG_PRESORTED_DISTINCT_MULTI)
3988 : {
3989 : Assert(as->d.agg_presorted_distinctcheck.jumpdistinct == -1);
3990 436 : as->d.agg_presorted_distinctcheck.jumpdistinct = state->steps_len;
3991 : }
3992 : else
3993 : Assert(false);
3994 : }
3995 : }
3996 :
3997 54688 : scratch.resvalue = NULL;
3998 54688 : scratch.resnull = NULL;
3999 54688 : scratch.opcode = EEOP_DONE_NO_RETURN;
4000 54688 : ExprEvalPushStep(state, &scratch);
4001 :
4002 54688 : ExecReadyExpr(state);
4003 :
4004 54688 : 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 62776 : 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 62776 : int adjust_jumpnull = -1;
4021 :
4022 62776 : if (ishash)
4023 9714 : aggcontext = aggstate->hashcontext;
4024 : else
4025 53062 : aggcontext = aggstate->aggcontexts[setno];
4026 :
4027 : /* add check for NULL pointer? */
4028 62776 : if (nullcheck)
4029 : {
4030 420 : scratch->opcode = EEOP_AGG_PLAIN_PERGROUP_NULLCHECK;
4031 420 : scratch->d.agg_plain_pergroup_nullcheck.setoff = setoff;
4032 : /* adjust later */
4033 420 : scratch->d.agg_plain_pergroup_nullcheck.jumpnull = -1;
4034 420 : ExprEvalPushStep(state, scratch);
4035 420 : 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 62776 : if (!pertrans->aggsortrequired)
4073 : {
4074 62432 : if (pertrans->transtypeByVal)
4075 : {
4076 58282 : if (fcinfo->flinfo->fn_strict &&
4077 31326 : pertrans->initValueIsNull)
4078 5260 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_INIT_STRICT_BYVAL;
4079 53022 : else if (fcinfo->flinfo->fn_strict)
4080 26066 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_STRICT_BYVAL;
4081 : else
4082 26956 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_BYVAL;
4083 : }
4084 : else
4085 : {
4086 4150 : if (fcinfo->flinfo->fn_strict &&
4087 3778 : pertrans->initValueIsNull)
4088 1086 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_INIT_STRICT_BYREF;
4089 3064 : else if (fcinfo->flinfo->fn_strict)
4090 2692 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_STRICT_BYREF;
4091 : else
4092 372 : scratch->opcode = EEOP_AGG_PLAIN_TRANS_BYREF;
4093 : }
4094 : }
4095 344 : else if (pertrans->numInputs == 1)
4096 284 : scratch->opcode = EEOP_AGG_ORDERED_TRANS_DATUM;
4097 : else
4098 60 : scratch->opcode = EEOP_AGG_ORDERED_TRANS_TUPLE;
4099 :
4100 62776 : scratch->d.agg_trans.pertrans = pertrans;
4101 62776 : scratch->d.agg_trans.setno = setno;
4102 62776 : scratch->d.agg_trans.setoff = setoff;
4103 62776 : scratch->d.agg_trans.transno = transno;
4104 62776 : scratch->d.agg_trans.aggcontext = aggcontext;
4105 62776 : ExprEvalPushStep(state, scratch);
4106 :
4107 : /* fix up jumpnull */
4108 62776 : if (adjust_jumpnull != -1)
4109 : {
4110 420 : 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 420 : as->d.agg_plain_pergroup_nullcheck.jumpnull = state->steps_len;
4115 : }
4116 62776 : }
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 8588 : ExecBuildHash32FromAttrs(TupleDesc desc, const TupleTableSlotOps *ops,
4136 : FmgrInfo *hashfunctions, Oid *collations,
4137 : int numCols, AttrNumber *keyColIdx,
4138 : PlanState *parent, uint32 init_value)
4139 : {
4140 8588 : ExprState *state = makeNode(ExprState);
4141 8588 : ExprEvalStep scratch = {0};
4142 8588 : NullableDatum *iresult = NULL;
4143 : intptr_t opcode;
4144 8588 : AttrNumber last_attnum = 0;
4145 :
4146 : Assert(numCols >= 0);
4147 :
4148 8588 : 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 8588 : if ((int64) numCols + (init_value != 0) > 1)
4156 3486 : iresult = palloc_object(NullableDatum);
4157 :
4158 : /* find the highest attnum so we deform the tuple to that point */
4159 22136 : for (int i = 0; i < numCols; i++)
4160 13548 : last_attnum = Max(last_attnum, keyColIdx[i]);
4161 :
4162 8588 : scratch.opcode = EEOP_INNER_FETCHSOME;
4163 8588 : scratch.d.fetch.last_var = last_attnum;
4164 8588 : scratch.d.fetch.fixed = false;
4165 8588 : scratch.d.fetch.kind = ops;
4166 8588 : scratch.d.fetch.known_desc = desc;
4167 8588 : if (ExecComputeSlotInfo(state, &scratch))
4168 5812 : ExprEvalPushStep(state, &scratch);
4169 :
4170 8588 : 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 7756 : 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 832 : scratch.opcode = EEOP_HASHDATUM_SET_INITVAL;
4187 832 : scratch.d.hashdatum_initvalue.init_value = UInt32GetDatum(init_value);
4188 832 : scratch.resvalue = numCols > 0 ? &iresult->value : &state->resvalue;
4189 832 : scratch.resnull = numCols > 0 ? &iresult->isnull : &state->resnull;
4190 :
4191 832 : 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 832 : opcode = EEOP_HASHDATUM_NEXT32;
4198 : }
4199 :
4200 22136 : for (int i = 0; i < numCols; i++)
4201 : {
4202 : FmgrInfo *finfo;
4203 : FunctionCallInfo fcinfo;
4204 13548 : Oid inputcollid = collations[i];
4205 13548 : AttrNumber attnum = keyColIdx[i] - 1;
4206 :
4207 13548 : finfo = &hashfunctions[i];
4208 13548 : fcinfo = palloc0(SizeForFunctionCallInfo(1));
4209 :
4210 : /* Initialize function call parameter structure too */
4211 13548 : 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 13548 : scratch.opcode = EEOP_INNER_VAR;
4218 13548 : scratch.resvalue = &fcinfo->args[0].value;
4219 13548 : scratch.resnull = &fcinfo->args[0].isnull;
4220 13548 : scratch.d.var.attnum = attnum;
4221 13548 : scratch.d.var.vartype = TupleDescAttr(desc, attnum)->atttypid;
4222 13548 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4223 :
4224 13548 : ExprEvalPushStep(state, &scratch);
4225 :
4226 : /* Call the hash function */
4227 13548 : scratch.opcode = opcode;
4228 :
4229 13548 : if (i == numCols - 1)
4230 : {
4231 : /*
4232 : * The result for hashing the final column is stored in the
4233 : * ExprState.
4234 : */
4235 8588 : scratch.resvalue = &state->resvalue;
4236 8588 : scratch.resnull = &state->resnull;
4237 : }
4238 : else
4239 : {
4240 : Assert(iresult != NULL);
4241 :
4242 : /* intermediate values are stored in an intermediate result */
4243 4960 : scratch.resvalue = &iresult->value;
4244 4960 : 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 13548 : scratch.d.hashdatum.iresult = iresult;
4252 :
4253 13548 : scratch.d.hashdatum.finfo = finfo;
4254 13548 : scratch.d.hashdatum.fcinfo_data = fcinfo;
4255 13548 : scratch.d.hashdatum.fn_addr = finfo->fn_addr;
4256 13548 : scratch.d.hashdatum.jumpdone = -1;
4257 :
4258 13548 : ExprEvalPushStep(state, &scratch);
4259 :
4260 : /* subsequent attnums must be combined with the previous */
4261 13548 : opcode = EEOP_HASHDATUM_NEXT32;
4262 : }
4263 :
4264 8588 : scratch.resvalue = NULL;
4265 8588 : scratch.resnull = NULL;
4266 8588 : scratch.opcode = EEOP_DONE_RETURN;
4267 8588 : ExprEvalPushStep(state, &scratch);
4268 :
4269 8588 : ExecReadyExpr(state);
4270 :
4271 8588 : 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 72056 : 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 72056 : ExprState *state = makeNode(ExprState);
4300 72056 : ExprEvalStep scratch = {0};
4301 72056 : NullableDatum *iresult = NULL;
4302 72056 : List *adjust_jumps = NIL;
4303 : ListCell *lc;
4304 : ListCell *lc2;
4305 : intptr_t strict_opcode;
4306 : intptr_t opcode;
4307 72056 : int num_exprs = list_length(hash_exprs);
4308 :
4309 : Assert(num_exprs == list_length(collations));
4310 :
4311 72056 : state->parent = parent;
4312 :
4313 : /* Insert setup steps as needed. */
4314 72056 : 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 72056 : if ((int64) num_exprs + (init_value != 0) > 1)
4322 6488 : iresult = palloc_object(NullableDatum);
4323 :
4324 72056 : 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 72056 : strict_opcode = EEOP_HASHDATUM_FIRST_STRICT;
4332 72056 : 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 150768 : forboth(lc, hash_exprs, lc2, collations)
4357 : {
4358 78712 : Expr *expr = (Expr *) lfirst(lc);
4359 : FmgrInfo *finfo;
4360 : FunctionCallInfo fcinfo;
4361 78712 : int i = foreach_current_index(lc);
4362 : Oid funcid;
4363 78712 : Oid inputcollid = lfirst_oid(lc2);
4364 :
4365 78712 : funcid = hashfunc_oids[i];
4366 :
4367 : /* Allocate hash function lookup data. */
4368 78712 : finfo = palloc0_object(FmgrInfo);
4369 78712 : fcinfo = palloc0(SizeForFunctionCallInfo(1));
4370 :
4371 78712 : 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 78712 : ExecInitExprRec(expr,
4378 : state,
4379 : &fcinfo->args[0].value,
4380 : &fcinfo->args[0].isnull);
4381 :
4382 78712 : if (i == num_exprs - 1)
4383 : {
4384 : /* the result for hashing the final expr is stored in the state */
4385 72056 : scratch.resvalue = &state->resvalue;
4386 72056 : scratch.resnull = &state->resnull;
4387 : }
4388 : else
4389 : {
4390 : Assert(iresult != NULL);
4391 :
4392 : /* intermediate values are stored in an intermediate result */
4393 6656 : scratch.resvalue = &iresult->value;
4394 6656 : 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 78712 : scratch.d.hashdatum.iresult = iresult;
4402 :
4403 : /* Initialize function call parameter structure too */
4404 78712 : InitFunctionCallInfoData(*fcinfo, finfo, 1, inputcollid, NULL, NULL);
4405 :
4406 78712 : scratch.d.hashdatum.finfo = finfo;
4407 78712 : scratch.d.hashdatum.fcinfo_data = fcinfo;
4408 78712 : scratch.d.hashdatum.fn_addr = finfo->fn_addr;
4409 :
4410 78712 : scratch.opcode = opstrict[i] && !keep_nulls ? strict_opcode : opcode;
4411 78712 : scratch.d.hashdatum.jumpdone = -1;
4412 :
4413 78712 : ExprEvalPushStep(state, &scratch);
4414 78712 : 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 78712 : strict_opcode = EEOP_HASHDATUM_NEXT32_STRICT;
4421 78712 : opcode = EEOP_HASHDATUM_NEXT32;
4422 : }
4423 :
4424 : /* adjust jump targets */
4425 150768 : foreach(lc, adjust_jumps)
4426 : {
4427 78712 : 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 78712 : as->d.hashdatum.jumpdone = state->steps_len;
4435 : }
4436 :
4437 72056 : scratch.resvalue = NULL;
4438 72056 : scratch.resnull = NULL;
4439 72056 : scratch.opcode = EEOP_DONE_RETURN;
4440 72056 : ExprEvalPushStep(state, &scratch);
4441 :
4442 72056 : ExecReadyExpr(state);
4443 :
4444 72056 : 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 20616 : 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 20616 : ExprState *state = makeNode(ExprState);
4468 20616 : ExprEvalStep scratch = {0};
4469 20616 : int maxatt = -1;
4470 20616 : 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 20616 : if (numCols == 0)
4478 0 : return NULL;
4479 :
4480 20616 : state->expr = NULL;
4481 20616 : state->flags = EEO_FLAG_IS_QUAL;
4482 20616 : state->parent = parent;
4483 :
4484 20616 : scratch.resvalue = &state->resvalue;
4485 20616 : scratch.resnull = &state->resnull;
4486 :
4487 : /* compute max needed attribute */
4488 54852 : for (int natt = 0; natt < numCols; natt++)
4489 : {
4490 34236 : int attno = keyColIdx[natt];
4491 :
4492 34236 : if (attno > maxatt)
4493 33860 : maxatt = attno;
4494 : }
4495 : Assert(maxatt >= 0);
4496 :
4497 : /* push deform steps */
4498 20616 : scratch.opcode = EEOP_INNER_FETCHSOME;
4499 20616 : scratch.d.fetch.last_var = maxatt;
4500 20616 : scratch.d.fetch.fixed = false;
4501 20616 : scratch.d.fetch.known_desc = ldesc;
4502 20616 : scratch.d.fetch.kind = lops;
4503 20616 : if (ExecComputeSlotInfo(state, &scratch))
4504 17840 : ExprEvalPushStep(state, &scratch);
4505 :
4506 20616 : scratch.opcode = EEOP_OUTER_FETCHSOME;
4507 20616 : scratch.d.fetch.last_var = maxatt;
4508 20616 : scratch.d.fetch.fixed = false;
4509 20616 : scratch.d.fetch.known_desc = rdesc;
4510 20616 : scratch.d.fetch.kind = rops;
4511 20616 : if (ExecComputeSlotInfo(state, &scratch))
4512 20616 : 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 54852 : for (int natt = numCols; --natt >= 0;)
4519 : {
4520 34236 : int attno = keyColIdx[natt];
4521 34236 : Form_pg_attribute latt = TupleDescAttr(ldesc, attno - 1);
4522 34236 : Form_pg_attribute ratt = TupleDescAttr(rdesc, attno - 1);
4523 34236 : Oid foid = eqfunctions[natt];
4524 34236 : Oid collid = collations[natt];
4525 : FmgrInfo *finfo;
4526 : FunctionCallInfo fcinfo;
4527 : AclResult aclresult;
4528 :
4529 : /* Check permission to call function */
4530 34236 : aclresult = object_aclcheck(ProcedureRelationId, foid, GetUserId(), ACL_EXECUTE);
4531 34236 : if (aclresult != ACLCHECK_OK)
4532 0 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(foid));
4533 :
4534 34236 : InvokeFunctionExecuteHook(foid);
4535 :
4536 : /* Set up the primary fmgr lookup information */
4537 34236 : finfo = palloc0_object(FmgrInfo);
4538 34236 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
4539 34236 : fmgr_info(foid, finfo);
4540 34236 : fmgr_info_set_expr(NULL, finfo);
4541 34236 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
4542 : collid, NULL, NULL);
4543 :
4544 : /* left arg */
4545 34236 : scratch.opcode = EEOP_INNER_VAR;
4546 34236 : scratch.d.var.attnum = attno - 1;
4547 34236 : scratch.d.var.vartype = latt->atttypid;
4548 34236 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4549 34236 : scratch.resvalue = &fcinfo->args[0].value;
4550 34236 : scratch.resnull = &fcinfo->args[0].isnull;
4551 34236 : ExprEvalPushStep(state, &scratch);
4552 :
4553 : /* right arg */
4554 34236 : scratch.opcode = EEOP_OUTER_VAR;
4555 34236 : scratch.d.var.attnum = attno - 1;
4556 34236 : scratch.d.var.vartype = ratt->atttypid;
4557 34236 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4558 34236 : scratch.resvalue = &fcinfo->args[1].value;
4559 34236 : scratch.resnull = &fcinfo->args[1].isnull;
4560 34236 : ExprEvalPushStep(state, &scratch);
4561 :
4562 : /* evaluate distinctness */
4563 34236 : scratch.opcode = EEOP_NOT_DISTINCT;
4564 34236 : scratch.d.func.finfo = finfo;
4565 34236 : scratch.d.func.fcinfo_data = fcinfo;
4566 34236 : scratch.d.func.fn_addr = finfo->fn_addr;
4567 34236 : scratch.d.func.nargs = 2;
4568 34236 : scratch.resvalue = &state->resvalue;
4569 34236 : scratch.resnull = &state->resnull;
4570 34236 : ExprEvalPushStep(state, &scratch);
4571 :
4572 : /* then emit EEOP_QUAL to detect if result is false (or null) */
4573 34236 : scratch.opcode = EEOP_QUAL;
4574 34236 : scratch.d.qualexpr.jumpdone = -1;
4575 34236 : scratch.resvalue = &state->resvalue;
4576 34236 : scratch.resnull = &state->resnull;
4577 34236 : ExprEvalPushStep(state, &scratch);
4578 34236 : adjust_jumps = lappend_int(adjust_jumps,
4579 34236 : state->steps_len - 1);
4580 : }
4581 :
4582 : /* adjust jump targets */
4583 54852 : foreach(lc, adjust_jumps)
4584 : {
4585 34236 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4586 :
4587 : Assert(as->opcode == EEOP_QUAL);
4588 : Assert(as->d.qualexpr.jumpdone == -1);
4589 34236 : as->d.qualexpr.jumpdone = state->steps_len;
4590 : }
4591 :
4592 20616 : scratch.resvalue = NULL;
4593 20616 : scratch.resnull = NULL;
4594 20616 : scratch.opcode = EEOP_DONE_RETURN;
4595 20616 : ExprEvalPushStep(state, &scratch);
4596 :
4597 20616 : ExecReadyExpr(state);
4598 :
4599 20616 : 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 2002 : 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 2002 : ExprState *state = makeNode(ExprState);
4627 2002 : ExprEvalStep scratch = {0};
4628 2002 : int maxatt = list_length(param_exprs);
4629 2002 : List *adjust_jumps = NIL;
4630 : ListCell *lc;
4631 :
4632 2002 : state->expr = NULL;
4633 2002 : state->flags = EEO_FLAG_IS_QUAL;
4634 2002 : state->parent = parent;
4635 :
4636 2002 : scratch.resvalue = &state->resvalue;
4637 2002 : scratch.resnull = &state->resnull;
4638 :
4639 : /* push deform steps */
4640 2002 : scratch.opcode = EEOP_INNER_FETCHSOME;
4641 2002 : scratch.d.fetch.last_var = maxatt;
4642 2002 : scratch.d.fetch.fixed = false;
4643 2002 : scratch.d.fetch.known_desc = desc;
4644 2002 : scratch.d.fetch.kind = lops;
4645 2002 : if (ExecComputeSlotInfo(state, &scratch))
4646 2002 : ExprEvalPushStep(state, &scratch);
4647 :
4648 2002 : scratch.opcode = EEOP_OUTER_FETCHSOME;
4649 2002 : scratch.d.fetch.last_var = maxatt;
4650 2002 : scratch.d.fetch.fixed = false;
4651 2002 : scratch.d.fetch.known_desc = desc;
4652 2002 : scratch.d.fetch.kind = rops;
4653 2002 : if (ExecComputeSlotInfo(state, &scratch))
4654 0 : ExprEvalPushStep(state, &scratch);
4655 :
4656 4068 : for (int attno = 0; attno < maxatt; attno++)
4657 : {
4658 2066 : Form_pg_attribute att = TupleDescAttr(desc, attno);
4659 2066 : Oid foid = eqfunctions[attno];
4660 2066 : Oid collid = collations[attno];
4661 : FmgrInfo *finfo;
4662 : FunctionCallInfo fcinfo;
4663 : AclResult aclresult;
4664 :
4665 : /* Check permission to call function */
4666 2066 : aclresult = object_aclcheck(ProcedureRelationId, foid, GetUserId(), ACL_EXECUTE);
4667 2066 : if (aclresult != ACLCHECK_OK)
4668 0 : aclcheck_error(aclresult, OBJECT_FUNCTION, get_func_name(foid));
4669 :
4670 2066 : InvokeFunctionExecuteHook(foid);
4671 :
4672 : /* Set up the primary fmgr lookup information */
4673 2066 : finfo = palloc0_object(FmgrInfo);
4674 2066 : fcinfo = palloc0(SizeForFunctionCallInfo(2));
4675 2066 : fmgr_info(foid, finfo);
4676 2066 : fmgr_info_set_expr(NULL, finfo);
4677 2066 : InitFunctionCallInfoData(*fcinfo, finfo, 2,
4678 : collid, NULL, NULL);
4679 :
4680 : /* left arg */
4681 2066 : scratch.opcode = EEOP_INNER_VAR;
4682 2066 : scratch.d.var.attnum = attno;
4683 2066 : scratch.d.var.vartype = att->atttypid;
4684 2066 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4685 2066 : scratch.resvalue = &fcinfo->args[0].value;
4686 2066 : scratch.resnull = &fcinfo->args[0].isnull;
4687 2066 : ExprEvalPushStep(state, &scratch);
4688 :
4689 : /* right arg */
4690 2066 : scratch.opcode = EEOP_OUTER_VAR;
4691 2066 : scratch.d.var.attnum = attno;
4692 2066 : scratch.d.var.vartype = att->atttypid;
4693 2066 : scratch.d.var.varreturningtype = VAR_RETURNING_DEFAULT;
4694 2066 : scratch.resvalue = &fcinfo->args[1].value;
4695 2066 : scratch.resnull = &fcinfo->args[1].isnull;
4696 2066 : ExprEvalPushStep(state, &scratch);
4697 :
4698 : /* evaluate distinctness */
4699 2066 : scratch.opcode = EEOP_NOT_DISTINCT;
4700 2066 : scratch.d.func.finfo = finfo;
4701 2066 : scratch.d.func.fcinfo_data = fcinfo;
4702 2066 : scratch.d.func.fn_addr = finfo->fn_addr;
4703 2066 : scratch.d.func.nargs = 2;
4704 2066 : scratch.resvalue = &state->resvalue;
4705 2066 : scratch.resnull = &state->resnull;
4706 2066 : ExprEvalPushStep(state, &scratch);
4707 :
4708 : /* then emit EEOP_QUAL to detect if result is false (or null) */
4709 2066 : scratch.opcode = EEOP_QUAL;
4710 2066 : scratch.d.qualexpr.jumpdone = -1;
4711 2066 : scratch.resvalue = &state->resvalue;
4712 2066 : scratch.resnull = &state->resnull;
4713 2066 : ExprEvalPushStep(state, &scratch);
4714 2066 : adjust_jumps = lappend_int(adjust_jumps,
4715 2066 : state->steps_len - 1);
4716 : }
4717 :
4718 : /* adjust jump targets */
4719 4068 : foreach(lc, adjust_jumps)
4720 : {
4721 2066 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4722 :
4723 : Assert(as->opcode == EEOP_QUAL);
4724 : Assert(as->d.qualexpr.jumpdone == -1);
4725 2066 : as->d.qualexpr.jumpdone = state->steps_len;
4726 : }
4727 :
4728 2002 : scratch.resvalue = NULL;
4729 2002 : scratch.resnull = NULL;
4730 2002 : scratch.opcode = EEOP_DONE_RETURN;
4731 2002 : ExprEvalPushStep(state, &scratch);
4732 :
4733 2002 : ExecReadyExpr(state);
4734 :
4735 2002 : return state;
4736 : }
4737 :
4738 : /*
4739 : * Push steps to evaluate a JsonExpr and its various subsidiary expressions.
4740 : */
4741 : static void
4742 2312 : ExecInitJsonExpr(JsonExpr *jsexpr, ExprState *state,
4743 : Datum *resv, bool *resnull,
4744 : ExprEvalStep *scratch)
4745 : {
4746 2312 : JsonExprState *jsestate = palloc0_object(JsonExprState);
4747 : ListCell *argexprlc;
4748 : ListCell *argnamelc;
4749 2312 : List *jumps_return_null = NIL;
4750 2312 : List *jumps_to_end = NIL;
4751 : ListCell *lc;
4752 : ErrorSaveContext *escontext;
4753 2312 : bool returning_domain =
4754 2312 : get_typtype(jsexpr->returning->typid) == TYPTYPE_DOMAIN;
4755 :
4756 : Assert(jsexpr->on_error != NULL);
4757 :
4758 2312 : jsestate->jsexpr = jsexpr;
4759 :
4760 : /*
4761 : * Evaluate formatted_expr storing the result into
4762 : * jsestate->formatted_expr.
4763 : */
4764 2312 : 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 2312 : jumps_return_null = lappend_int(jumps_return_null, state->steps_len);
4770 2312 : scratch->opcode = EEOP_JUMP_IF_NULL;
4771 2312 : scratch->resnull = &jsestate->formatted_expr.isnull;
4772 2312 : scratch->d.jump.jumpdone = -1; /* set below */
4773 2312 : ExprEvalPushStep(state, scratch);
4774 :
4775 : /*
4776 : * Evaluate pathspec expression storing the result into
4777 : * jsestate->pathspec.
4778 : */
4779 2312 : 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 2312 : jumps_return_null = lappend_int(jumps_return_null, state->steps_len);
4785 2312 : scratch->opcode = EEOP_JUMP_IF_NULL;
4786 2312 : scratch->resnull = &jsestate->pathspec.isnull;
4787 2312 : scratch->d.jump.jumpdone = -1; /* set below */
4788 2312 : ExprEvalPushStep(state, scratch);
4789 :
4790 : /* Steps to compute PASSING args. */
4791 2312 : jsestate->args = NIL;
4792 3218 : forboth(argexprlc, jsexpr->passing_values,
4793 : argnamelc, jsexpr->passing_names)
4794 : {
4795 906 : Expr *argexpr = (Expr *) lfirst(argexprlc);
4796 906 : String *argname = lfirst_node(String, argnamelc);
4797 906 : JsonPathVariable *var = palloc_object(JsonPathVariable);
4798 :
4799 906 : var->name = argname->sval;
4800 906 : var->namelen = strlen(var->name);
4801 906 : var->typid = exprType((Node *) argexpr);
4802 906 : var->typmod = exprTypmod((Node *) argexpr);
4803 :
4804 906 : ExecInitExprRec(argexpr, state, &var->value, &var->isnull);
4805 :
4806 906 : jsestate->args = lappend(jsestate->args, var);
4807 : }
4808 :
4809 : /* Step for jsonpath evaluation; see ExecEvalJsonExprPath(). */
4810 2312 : scratch->opcode = EEOP_JSONEXPR_PATH;
4811 2312 : scratch->resvalue = resv;
4812 2312 : scratch->resnull = resnull;
4813 2312 : scratch->d.jsonexpr.jsestate = jsestate;
4814 2312 : 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 6936 : foreach(lc, jumps_return_null)
4822 : {
4823 4624 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
4824 :
4825 4624 : as->d.jump.jumpdone = state->steps_len;
4826 : }
4827 2312 : scratch->opcode = EEOP_CONST;
4828 2312 : scratch->resvalue = resv;
4829 2312 : scratch->resnull = resnull;
4830 2312 : scratch->d.constval.value = (Datum) 0;
4831 2312 : scratch->d.constval.isnull = true;
4832 2312 : ExprEvalPushStep(state, scratch);
4833 :
4834 4624 : escontext = jsexpr->on_error->btype != JSON_BEHAVIOR_ERROR ?
4835 2312 : &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 2312 : 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 2312 : jsestate->jump_eval_coercion = -1;
4849 2312 : if (jsexpr->use_json_coercion)
4850 : {
4851 888 : jsestate->jump_eval_coercion = state->steps_len;
4852 :
4853 888 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
4854 888 : jsexpr->omit_quotes,
4855 888 : jsexpr->op == JSON_EXISTS_OP,
4856 : resv, resnull);
4857 : }
4858 1424 : 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 650 : getTypeInputInfo(jsexpr->returning->typid, &typinput, &typioparam);
4871 650 : finfo = palloc0_object(FmgrInfo);
4872 650 : fcinfo = palloc0(SizeForFunctionCallInfo(3));
4873 650 : fmgr_info(typinput, finfo);
4874 650 : fmgr_info_set_expr((Node *) jsexpr->returning, finfo);
4875 650 : 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 650 : fcinfo->args[1].value = ObjectIdGetDatum(typioparam);
4882 650 : fcinfo->args[1].isnull = false;
4883 650 : fcinfo->args[2].value = Int32GetDatum(jsexpr->returning->typmod);
4884 650 : fcinfo->args[2].isnull = false;
4885 650 : fcinfo->context = (Node *) escontext;
4886 :
4887 650 : 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 2312 : if (jsestate->jump_eval_coercion >= 0 && escontext != NULL)
4896 : {
4897 666 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
4898 666 : scratch->d.jsonexpr.jsestate = jsestate;
4899 666 : ExprEvalPushStep(state, scratch);
4900 : }
4901 :
4902 2312 : 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 2312 : if (jsexpr->on_error->btype != JSON_BEHAVIOR_ERROR &&
4917 1886 : (!(IsA(jsexpr->on_error->expr, Const) &&
4918 1838 : ((Const *) jsexpr->on_error->expr)->constisnull) ||
4919 : returning_domain))
4920 : {
4921 : ErrorSaveContext *saved_escontext;
4922 :
4923 594 : jsestate->jump_error = state->steps_len;
4924 :
4925 : /* JUMP to end if false, that is, skip the ON ERROR expression. */
4926 594 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4927 594 : scratch->opcode = EEOP_JUMP_IF_NOT_TRUE;
4928 594 : scratch->resvalue = &jsestate->error.value;
4929 594 : scratch->resnull = &jsestate->error.isnull;
4930 594 : scratch->d.jump.jumpdone = -1; /* set below */
4931 594 : 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 594 : saved_escontext = state->escontext;
4938 594 : state->escontext = escontext;
4939 594 : ExecInitExprRec((Expr *) jsexpr->on_error->expr,
4940 : state, resv, resnull);
4941 594 : state->escontext = saved_escontext;
4942 :
4943 : /* Step to coerce the ON ERROR expression if needed */
4944 594 : if (jsexpr->on_error->coerce)
4945 174 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
4946 174 : 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 594 : if (jsexpr->on_error->coerce ||
4954 420 : IsA(jsexpr->on_error->expr, CoerceViaIO) ||
4955 420 : IsA(jsexpr->on_error->expr, CoerceToDomain))
4956 : {
4957 222 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
4958 222 : scratch->resvalue = resv;
4959 222 : scratch->resnull = resnull;
4960 222 : scratch->d.jsonexpr.jsestate = jsestate;
4961 222 : ExprEvalPushStep(state, scratch);
4962 : }
4963 :
4964 : /* JUMP to end to skip the ON EMPTY steps added below. */
4965 594 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4966 594 : scratch->opcode = EEOP_JUMP;
4967 594 : scratch->d.jump.jumpdone = -1;
4968 594 : 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 2312 : if (jsexpr->on_empty != NULL &&
4979 1988 : jsexpr->on_empty->btype != JSON_BEHAVIOR_ERROR &&
4980 1922 : (!(IsA(jsexpr->on_empty->expr, Const) &&
4981 1868 : ((Const *) jsexpr->on_empty->expr)->constisnull) ||
4982 : returning_domain))
4983 : {
4984 : ErrorSaveContext *saved_escontext;
4985 :
4986 384 : jsestate->jump_empty = state->steps_len;
4987 :
4988 : /* JUMP to end if false, that is, skip the ON EMPTY expression. */
4989 384 : jumps_to_end = lappend_int(jumps_to_end, state->steps_len);
4990 384 : scratch->opcode = EEOP_JUMP_IF_NOT_TRUE;
4991 384 : scratch->resvalue = &jsestate->empty.value;
4992 384 : scratch->resnull = &jsestate->empty.isnull;
4993 384 : scratch->d.jump.jumpdone = -1; /* set below */
4994 384 : 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 384 : saved_escontext = state->escontext;
5001 384 : state->escontext = escontext;
5002 384 : ExecInitExprRec((Expr *) jsexpr->on_empty->expr,
5003 : state, resv, resnull);
5004 384 : state->escontext = saved_escontext;
5005 :
5006 : /* Step to coerce the ON EMPTY expression if needed */
5007 384 : if (jsexpr->on_empty->coerce)
5008 174 : ExecInitJsonCoercion(state, jsexpr->returning, escontext,
5009 174 : 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 384 : if (jsexpr->on_empty->coerce ||
5017 210 : IsA(jsexpr->on_empty->expr, CoerceViaIO) ||
5018 210 : IsA(jsexpr->on_empty->expr, CoerceToDomain))
5019 : {
5020 :
5021 228 : scratch->opcode = EEOP_JSONEXPR_COERCION_FINISH;
5022 228 : scratch->resvalue = resv;
5023 228 : scratch->resnull = resnull;
5024 228 : scratch->d.jsonexpr.jsestate = jsestate;
5025 228 : ExprEvalPushStep(state, scratch);
5026 : }
5027 : }
5028 :
5029 3884 : foreach(lc, jumps_to_end)
5030 : {
5031 1572 : ExprEvalStep *as = &state->steps[lfirst_int(lc)];
5032 :
5033 1572 : as->d.jump.jumpdone = state->steps_len;
5034 : }
5035 :
5036 2312 : jsestate->jump_end = state->steps_len;
5037 2312 : }
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 1236 : ExecInitJsonCoercion(ExprState *state, JsonReturning *returning,
5045 : ErrorSaveContext *escontext, bool omit_quotes,
5046 : bool exists_coerce,
5047 : Datum *resv, bool *resnull)
5048 : {
5049 1236 : ExprEvalStep scratch = {0};
5050 :
5051 : /* For json_populate_type() */
5052 1236 : scratch.opcode = EEOP_JSONEXPR_COERCION;
5053 1236 : scratch.resvalue = resv;
5054 1236 : scratch.resnull = resnull;
5055 1236 : scratch.d.jsonexpr_coercion.targettype = returning->typid;
5056 1236 : scratch.d.jsonexpr_coercion.targettypmod = returning->typmod;
5057 1236 : scratch.d.jsonexpr_coercion.json_coercion_cache = NULL;
5058 1236 : scratch.d.jsonexpr_coercion.escontext = escontext;
5059 1236 : scratch.d.jsonexpr_coercion.omit_quotes = omit_quotes;
5060 1236 : scratch.d.jsonexpr_coercion.exists_coerce = exists_coerce;
5061 1356 : scratch.d.jsonexpr_coercion.exists_cast_to_int = exists_coerce &&
5062 120 : getBaseType(returning->typid) == INT4OID;
5063 1356 : scratch.d.jsonexpr_coercion.exists_check_domain = exists_coerce &&
5064 120 : DomainHasConstraints(returning->typid);
5065 1236 : ExprEvalPushStep(state, &scratch);
5066 1236 : }
|
