Line data Source code
1 : /*
2 : * SPDX-License-Identifier: MPL-2.0
3 : *
4 : * This Source Code Form is subject to the terms of the Mozilla Public
5 : * License, v. 2.0. If a copy of the MPL was not distributed with this
6 : * file, You can obtain one at http://mozilla.org/MPL/2.0/.
7 : *
8 : * Copyright 2024 MonetDB Foundation;
9 : * Copyright August 2008 - 2023 MonetDB B.V.;
10 : * Copyright 1997 - July 2008 CWI.
11 : */
12 :
13 : /* author: M Kersten
14 : * Post-optimization of projection lists.
15 : */
16 : #include "monetdb_config.h"
17 : #include "opt_deadcode.h"
18 : #include "opt_projectionpath.h"
19 :
20 : str
21 487573 : OPTprojectionpathImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk,
22 : InstrPtr pci)
23 : {
24 487573 : int i, j, k, actions = 0, maxprefixlength = 0;
25 487573 : int *pc = NULL;
26 487573 : InstrPtr p, q, r;
27 487573 : InstrPtr *old = 0;
28 487573 : int *varcnt = NULL; /* use count */
29 487573 : int limit, slimit;
30 487573 : str msg = MAL_SUCCEED;
31 :
32 487573 : (void) cntxt;
33 487573 : (void) stk;
34 487573 : if (mb->inlineProp)
35 0 : goto wrapupall;
36 :
37 17399695 : for (i = 0; i < mb->stop; i++) {
38 16972807 : p = getInstrPtr(mb, i);
39 16972807 : if (getModuleId(p) == algebraRef
40 302732 : && ((getFunctionId(p) == projectionRef && p->argc == 3)
41 242047 : || getFunctionId(p) == projectionpathRef)) {
42 : break;
43 : }
44 : }
45 487573 : if (i == mb->stop) {
46 426888 : goto wrapupall;
47 : }
48 :
49 60685 : limit = mb->stop;
50 60685 : slimit = mb->ssize;
51 60685 : old = mb->stmt;
52 60685 : if (newMalBlkStmt(mb, 2 * mb->stop) < 0)
53 0 : throw(MAL, "optimizer.projectionpath", SQLSTATE(HY013) MAL_MALLOC_FAIL);
54 :
55 : /* beware, new variables and instructions are introduced */
56 60685 : pc = (int *) GDKzalloc(sizeof(int) * mb->vtop * 2); /* to find last assignment */
57 60685 : varcnt = (int *) GDKzalloc(sizeof(int) * mb->vtop * 2);
58 60685 : if (pc == NULL || varcnt == NULL) {
59 0 : if (pc)
60 0 : GDKfree(pc);
61 0 : if (varcnt)
62 0 : GDKfree(varcnt);
63 0 : throw(MAL, "optimizer.projectionpath", SQLSTATE(HY013) MAL_MALLOC_FAIL);
64 : }
65 :
66 : /*
67 : * Count the variable re-use used as arguments first.
68 : * A pass operation is not a real re-use
69 : */
70 9617211 : for (i = 0; i < limit; i++) {
71 9556526 : p = old[i];
72 37552987 : for (j = p->retc; j < p->argc; j++)
73 27996461 : if (!(getModuleId(p) == languageRef && getFunctionId(p) == passRef))
74 27996461 : varcnt[getArg(p, j)]++;
75 : }
76 :
77 : /* assume a single pass over the plan, and only consider projection sequences
78 : * beware, we are only able to deal with projections without candidate lists. (argc=3)
79 : * We also should not change the type of the outcome, i.e. leaving the last argument untouched.
80 : */
81 9619811 : for (i = 0; i < limit; i++) {
82 9559127 : p = old[i];
83 9559127 : if (getModuleId(p) == algebraRef && getFunctionId(p) == projectionRef
84 3735420 : && p->argc == 3) {
85 : /*
86 : * Try to expand its argument list with what we have found so far.
87 : */
88 3735420 : int args = p->retc;
89 11206205 : for (j = p->retc; j < p->argc; j++) {
90 7470785 : if (pc[getArg(p, j)]
91 3138252 : && (r = getInstrPtr(mb, pc[getArg(p, j)])) != NULL
92 3138252 : && varcnt[getArg(p, j)] <= 1 && getModuleId(r) == algebraRef
93 2401525 : && (getFunctionId(r) == projectionRef
94 2082494 : || getFunctionId(r) == projectionpathRef))
95 2401525 : args += r->argc - r->retc;
96 : else
97 5069260 : args++;
98 : }
99 3735420 : if ((q = copyInstructionArgs(p, args)) == NULL) {
100 0 : msg = createException(MAL, "optimizer.projectionpath",
101 : SQLSTATE(HY013) MAL_MALLOC_FAIL);
102 0 : goto wrapupall;
103 : }
104 :
105 3735441 : q->argc = p->retc;
106 11206268 : for (j = p->retc; j < p->argc; j++) {
107 7470840 : if (pc[getArg(p, j)])
108 3138266 : r = getInstrPtr(mb, pc[getArg(p, j)]);
109 : else
110 : r = 0;
111 3138266 : if (r && varcnt[getArg(p, j)] > 1)
112 5069312 : r = 0;
113 :
114 : /* inject the complete sub-path */
115 :
116 7470840 : if (getFunctionId(p) == projectionRef) {
117 7470839 : if (r && getModuleId(r) == algebraRef
118 2401528 : && (getFunctionId(r) == projectionRef
119 2082494 : || getFunctionId(r) == projectionpathRef)) {
120 40040773 : for (k = r->retc; k < r->argc; k++)
121 37639246 : q = pushArgument(mb, q, getArg(r, k));
122 : } else
123 5069312 : q = pushArgument(mb, q, getArg(p, j));
124 : }
125 : }
126 3735428 : if (q->argc <= p->argc) {
127 : /* no change */
128 1342499 : freeInstruction(q);
129 1342509 : goto wrapup;
130 : }
131 : /*
132 : * Final type check and hardwire the result type, because that can not be inferred directly from the signature
133 : * We already know that all heads are void. Only the last element may have a non-oid type.
134 : */
135 40023572 : for (j = 1; j < q->argc - 1; j++)
136 37630643 : if (getBatType(getArgType(mb, q, j)) != TYPE_oid
137 37630643 : && getBatType(getArgType(mb, q, j)) != TYPE_void) {
138 : /* don't use the candidate list */
139 0 : freeInstruction(q);
140 0 : goto wrapup;
141 : }
142 :
143 : /* fix the type */
144 2392929 : setVarType(mb, getArg(q, 0),
145 : newBatType(getBatType(getArgType(mb, q, q->argc - 1))));
146 2392929 : if (getFunctionId(q) == projectionRef)
147 2392929 : setFunctionId(q, projectionpathRef);
148 2392932 : q->typeresolved = false;
149 :
150 2392932 : freeInstruction(p);
151 2392928 : p = q;
152 : /* keep track of the longest projection path */
153 2392928 : if (p->argc > maxprefixlength)
154 : maxprefixlength = p->argc;
155 2392928 : actions++;
156 : }
157 5823707 : wrapup:
158 9559144 : pushInstruction(mb, p);
159 29317481 : for (j = 0; j < p->retc; j++)
160 10199211 : if (getModuleId(p) == algebraRef
161 4815246 : && (getFunctionId(p) == projectionRef
162 3472763 : || getFunctionId(p) == projectionpathRef)) {
163 3735414 : pc[getArg(p, j)] = mb->stop - 1;
164 : }
165 : }
166 :
167 10615144 : for (; i < slimit; i++)
168 10554459 : if (old[i])
169 0 : pushInstruction(mb, old[i]);
170 :
171 : /* At this location there used to be commented out experimental code
172 : * to reuse common prefixes, but this was counter productive. This
173 : * comment is all that is left. */
174 :
175 : /* Defense line against incorrect plans */
176 60685 : if (actions > 0) {
177 33901 : msg = chkTypes(cntxt->usermodule, mb, FALSE);
178 33900 : if (!msg)
179 33900 : msg = chkFlow(mb);
180 33901 : if (!msg)
181 33901 : msg = chkDeclarations(mb);
182 : }
183 26784 : wrapupall:
184 : /* keep actions taken as a fake argument */
185 487573 : (void) pushInt(mb, pci, actions);
186 :
187 487573 : if (pc)
188 60685 : GDKfree(pc);
189 487573 : if (varcnt)
190 60685 : GDKfree(varcnt);
191 487573 : if (old)
192 60685 : GDKfree(old);
193 :
194 : return msg;
195 : }
|
