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 : /*
14 : * This simple module unrolls the mat.pack into an incremental sequence.
15 : * This could speedup parallel processing and releases resources faster.
16 : */
17 : #include "monetdb_config.h"
18 : #include "opt_matpack.h"
19 :
20 : str
21 498164 : OPTmatpackImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk,
22 : InstrPtr pci)
23 : {
24 498164 : int v, i, j, limit, slimit;
25 498164 : InstrPtr p, q;
26 498164 : int actions = 0;
27 498164 : InstrPtr *old = NULL;
28 498164 : str msg = MAL_SUCCEED;
29 :
30 498164 : if (isOptimizerUsed(mb, pci, mergetableRef) <= 0) {
31 31975 : goto wrapup;
32 : }
33 :
34 : (void) cntxt;
35 : (void) stk; /* to fool compilers */
36 22491146 : for (i = 1; i < mb->stop; i++)
37 22056082 : if (getModuleId(getInstrPtr(mb, i)) == matRef
38 46572 : && getFunctionId(getInstrPtr(mb, i)) == packRef
39 33501 : && isaBatType(getArgType(mb, getInstrPtr(mb, i), 1)))
40 : break;
41 466201 : if (i == mb->stop)
42 435064 : goto wrapup;
43 :
44 31137 : old = mb->stmt;
45 31137 : limit = mb->stop;
46 31137 : slimit = mb->ssize;
47 31137 : if (newMalBlkStmt(mb, mb->stop) < 0)
48 0 : throw(MAL, "optimizer.matpack", SQLSTATE(HY013) MAL_MALLOC_FAIL);
49 :
50 8935266 : for (i = 0; mb->errors == NULL && i < limit; i++) {
51 8904129 : p = old[i];
52 8904129 : if (getModuleId(p) == matRef && getFunctionId(p) == packRef
53 160474 : && isaBatType(getArgType(mb, p, 1))) {
54 158348 : q = newInstruction(0, matRef, packIncrementRef);
55 158348 : if (q == NULL) {
56 0 : msg = createException(MAL, "optimizer.matpack",
57 : SQLSTATE(HY013) MAL_MALLOC_FAIL);
58 0 : break;
59 : }
60 158348 : if (setDestVar(q, newTmpVariable(mb, getArgType(mb, p, 1))) < 0) {
61 0 : freeInstruction(q);
62 0 : msg = createException(MAL, "optimizer.matpack",
63 : SQLSTATE(HY013) MAL_MALLOC_FAIL);
64 0 : break;
65 : }
66 158348 : q = pushArgument(mb, q, getArg(p, 1));
67 158348 : v = getArg(q, 0);
68 158348 : q = pushInt(mb, q, p->argc - p->retc);
69 158348 : pushInstruction(mb, q);
70 158348 : typeChecker(cntxt->usermodule, mb, q, mb->stop - 1, TRUE);
71 :
72 1377231 : for (j = 2; j < p->argc; j++) {
73 1060535 : q = newInstruction(0, matRef, packIncrementRef);
74 1060535 : if (q == NULL) {
75 0 : msg = createException(MAL, "optimizer.matpack",
76 : SQLSTATE(HY013) MAL_MALLOC_FAIL);
77 0 : break;
78 : }
79 1060535 : q = pushArgument(mb, q, v);
80 1060535 : q = pushArgument(mb, q, getArg(p, j));
81 1060535 : if (setDestVar(q, newTmpVariable(mb, getVarType(mb, v))) < 0) {
82 0 : freeInstruction(q);
83 0 : msg = createException(MAL, "optimizer.matpack",
84 : SQLSTATE(HY013) MAL_MALLOC_FAIL);
85 0 : break;
86 : }
87 1060535 : v = getArg(q, 0);
88 1060535 : pushInstruction(mb, q);
89 1060535 : typeChecker(cntxt->usermodule, mb, q, mb->stop - 1, TRUE);
90 : }
91 0 : if (msg)
92 : break;
93 158348 : getArg(q, 0) = getArg(p, 0);
94 158348 : freeInstruction(p);
95 158348 : actions++;
96 158348 : continue;
97 : }
98 8745781 : pushInstruction(mb, p);
99 8745781 : old[i] = NULL;
100 : }
101 23434720 : for (; i < slimit; i++)
102 23403583 : if (old[i])
103 0 : pushInstruction(mb, old[i]);
104 31137 : GDKfree(old);
105 :
106 : /* Defense line against incorrect plans */
107 31137 : if (msg == MAL_SUCCEED && actions > 0) {
108 31137 : msg = chkTypes(cntxt->usermodule, mb, FALSE);
109 31137 : if (!msg)
110 31137 : msg = chkFlow(mb);
111 31137 : if (!msg)
112 31137 : msg = chkDeclarations(mb);
113 : }
114 0 : wrapup:
115 : /* keep actions taken as a fake argument */
116 498176 : (void) pushInt(mb, pci, actions);
117 498176 : return msg;
118 : }
|