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             : /* (c) Martin Kersten
      14             :  */
      15             : #include "monetdb_config.h"
      16             : #include "opt_deadcode.h"
      17             : 
      18             : str
      19     1474012 : OPTdeadcodeImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk,
      20             :                                                   InstrPtr pci)
      21             : {
      22     1474012 :         int i, k, se, limit, slimit;
      23     1474012 :         InstrPtr p = 0, *old = NULL;
      24     1474012 :         int actions = 0;
      25     1474012 :         int *varused = 0;
      26     1474012 :         str msg = MAL_SUCCEED;
      27             : 
      28     1474012 :         (void) cntxt;
      29     1474012 :         (void) stk;                                     /* to fool compilers */
      30             : 
      31     1474012 :         if (mb->inlineProp)
      32           0 :                 goto wrapup;
      33             : 
      34     1474012 :         varused = GDKzalloc(mb->vtop * sizeof(int));
      35     1474015 :         if (varused == NULL)
      36           0 :                 goto wrapup;
      37             : 
      38     1474015 :         old = mb->stmt;
      39     1474015 :         limit = mb->stop;
      40     1474015 :         slimit = mb->ssize;
      41     1474015 :         if (newMalBlkStmt(mb, mb->ssize) < 0) {
      42           0 :                 GDKfree(varused);
      43           0 :                 throw(MAL, "optimizer.deadcode", SQLSTATE(HY013) MAL_MALLOC_FAIL);
      44             :         }
      45             :         //mnstr_printf(cntxt->fdout,"deadcode limit %d ssize %d vtop %d vsize %d\n", limit, (int)(mb->ssize), mb->vtop, (int)(mb->vsize));
      46             : 
      47             :         // Calculate the instructions in which a variable is used.
      48             :         // Variables can be used multiple times in an instruction.
      49    70260442 :         for (i = 1; i < limit; i++) {
      50    68786422 :                 p = old[i];
      51   241889900 :                 for (k = p->retc; k < p->argc; k++)
      52   173103478 :                         varused[getArg(p, k)]++;
      53    68786422 :                 if (blockCntrl(p))
      54       13274 :                         for (k = 0; k < p->retc; k++)
      55       10690 :                                 varused[getArg(p, k)]++;
      56             :         }
      57             : 
      58             :         // Consolidate the actual need for variables
      59    73225993 :         for (i = limit; i >= 0; i--) {
      60    71752017 :                 p = old[i];
      61    71752017 :                 if (p == 0)
      62     1474002 :                         continue;                       //left behind by others?
      63             : 
      64    70278015 :                 if (getModuleId(p) == batRef && isUpdateInstruction(p) && !p->barrier) {
      65             :                         /* bat.append and friends are intermediates that need not be retained
      66             :                          * unless they are not used outside of an update */
      67      628633 :                         if (varused[getArg(p, 1)] > 1)
      68         628 :                                 varused[getArg(p, 0)]++;        // force keeping it
      69    69649346 :                 } else if (hasSideEffects(mb, p, FALSE) || !isLinearFlow(p)
      70    22699689 :                                    || (p->retc == 1 && mb->unsafeProp)
      71    22627045 :                                    || p->barrier /* ==side-effect */ ) {
      72    47024653 :                         varused[getArg(p, 0)]++;        // force keeping it
      73    47024653 :                         continue;
      74             :                 }
      75             :                 // The results should be used somewhere
      76    23253318 :                 se = 0;
      77    47084291 :                 for (k = 0; k < p->retc; k++)
      78    23830973 :                         se += varused[getArg(p, k)] > 0;
      79             : 
      80             :                 // Reduce input variable count when garbage is detected
      81    23253318 :                 if (se == 0)
      82    50579580 :                         for (k = p->retc; k < p->argc; k++)
      83    43778050 :                                 varused[getArg(p, k)]--;
      84             :         }
      85             : 
      86             :         // Now we can simply copy the intructions and discard useless ones.
      87     1473976 :         pushInstruction(mb, old[0]);
      88    30891894 :         for (i = 1; i < limit; i++) {
      89    29417919 :                 if ((p = old[i]) != NULL) {
      90    29417958 :                         if (p->token == ENDsymbol) {
      91     1473983 :                                 pushInstruction(mb, p);
      92             :                                 // Also copy the optimizer trace information
      93    40869215 :                                 for (i++; i < limit; i++)
      94    39395237 :                                         if (old[i])
      95    39395237 :                                                 pushInstruction(mb, old[i]);
      96             :                                 break;
      97             :                         }
      98             :                         // Is the instruction still relevant?
      99             :                         se = 0;
     100    58232599 :                         for (k = 0; k < p->retc; k++)
     101    30288624 :                                 se += varused[getArg(p, k)] > 0;
     102             : 
     103    27943975 :                         if (se)
     104    22617447 :                                 pushInstruction(mb, p);
     105             :                         else {
     106     5326528 :                                 freeInstruction(p);
     107     5326559 :                                 actions++;
     108             :                         }
     109             :                 }
     110             :         }
     111             :         /* save the free instructions records for later */
     112   328022425 :         for (; i < slimit; i++)
     113   326548398 :                 if (old[i]) {
     114           0 :                         pushInstruction(mb, old[i]);
     115             :                 }
     116             :         /* Defense line against incorrect plans */
     117             :         /* we don't create or change existing structures */
     118             :         // no type change msg = chkTypes(cntxt->usermodule, mb, FALSE);
     119     1474027 :         if (actions > 0) {
     120      491118 :                 msg = chkFlow(mb);
     121      491115 :                 if (!msg)
     122      491115 :                         msg = chkDeclarations(mb);
     123             :         }
     124      982909 :   wrapup:
     125             :         /* keep actions taken as a fake argument */
     126     1474014 :         (void) pushInt(mb, pci, actions);
     127             : 
     128     1473997 :         if (old)
     129     1473997 :                 GDKfree(old);
     130     1474028 :         if (varused)
     131     1474028 :                 GDKfree(varused);
     132             :         return msg;
     133             : }