LCOV - code coverage report
Current view: top level - monetdb5/optimizer - opt_candidates.c (source / functions) Hit Total Coverage
Test: coverage.info Lines: 57 57 100.0 %
Date: 2024-11-13 22:44:48 Functions: 1 1 100.0 %

          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             :  * Mark the production and use of candidate lists.
      15             :  */
      16             : 
      17             : #include "monetdb_config.h"
      18             : #include "mal_instruction.h"
      19             : #include "opt_candidates.h"
      20             : 
      21             : str
      22      413930 : OPTcandidatesImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
      23             : {
      24      413930 :         InstrPtr p;
      25      413930 :         str msg = MAL_SUCCEED;
      26             : 
      27      413930 :         if (!(ATOMIC_GET(&GDKdebug) & TESTINGMASK))
      28        2389 :                 goto wrapup;
      29             :         (void) cntxt;
      30             :         (void) stk;                                     /* to fool compilers */
      31    21080422 :         for (int i = 0; i < mb->stop; i++) {
      32    20668881 :                 p = getInstrPtr(mb, i);
      33    20668881 :                 if (p->token == ASSIGNsymbol) {
      34       85166 :                         for (int j = 0; j < p->retc && j + p->retc < p->argc; j++)
      35        6040 :                                 if (isVarCList(mb, getArg(p, p->retc + j)))
      36          54 :                                         setVarCList(mb, getArg(p, j));
      37             :                 }
      38    20668881 :                 if (getModuleId(p) == sqlRef) {
      39     1657072 :                         if (getFunctionId(p) == tidRef)
      40      185691 :                                 setVarCList(mb, getArg(p, 0));
      41     1471381 :                         else if (getFunctionId(p) == subdeltaRef)
      42       49104 :                                 setVarCList(mb, getArg(p, 0));
      43    19011809 :                 } else if (getModuleId(p) == algebraRef) {
      44     2180180 :                         if (getFunctionId(p) == selectRef
      45     2116600 :                                 || getFunctionId(p) == thetaselectRef)
      46      388770 :                                 setVarCList(mb, getArg(p, 0));
      47     1791410 :                         else if (getFunctionId(p) == likeselectRef)
      48        4140 :                                 setVarCList(mb, getArg(p, 0));
      49     1787270 :                         else if (getFunctionId(p) == intersectRef
      50     1781967 :                                          || getFunctionId(p) == differenceRef)
      51       89881 :                                 setVarCList(mb, getArg(p, 0));
      52     1697389 :                         else if (getFunctionId(p) == uniqueRef)
      53          65 :                                 setVarCList(mb, getArg(p, 0));
      54     1697324 :                         else if (getFunctionId(p) == firstnRef)
      55         811 :                                 setVarCList(mb, getArg(p, 0));
      56     1696513 :                         else if (getFunctionId(p) == subsliceRef)
      57        1072 :                                 setVarCList(mb, getArg(p, 0));
      58     1695441 :                         else if (getFunctionId(p) == projectionRef
      59     1009250 :                                          && isVarCList(mb, getArg(p, p->retc + 0))
      60      634060 :                                          && isVarCList(mb, getArg(p, p->retc + 1)))
      61      123616 :                                 setVarCList(mb, getArg(p, 0));
      62    16831629 :                 } else if (getModuleId(p) == generatorRef) {
      63         416 :                         if (getFunctionId(p) == selectRef
      64         416 :                                 || getFunctionId(p) == thetaselectRef)
      65          29 :                                 setVarCList(mb, getArg(p, 0));
      66    16831213 :                 } else if (getModuleId(p) == sampleRef) {
      67          21 :                         if (getFunctionId(p) == subuniformRef)
      68          21 :                                 setVarCList(mb, getArg(p, 0));
      69    16831192 :                 } else if (getModuleId(p) == groupRef && p->retc > 1) {
      70       52908 :                         if (getFunctionId(p) == subgroupRef
      71       50405 :                                 || getFunctionId(p) == subgroupdoneRef
      72       38750 :                                 || getFunctionId(p) == groupRef
      73       27250 :                                 || getFunctionId(p) == groupdoneRef)
      74       52908 :                                 setVarCList(mb, getArg(p, 1));
      75    16778284 :                 } else if (getModuleId(p) == batRef) {
      76      608860 :                         if (getFunctionId(p) == mergecandRef
      77      530381 :                                 || getFunctionId(p) == intersectcandRef
      78      530381 :                                 || getFunctionId(p) == diffcandRef
      79      530381 :                                 || getFunctionId(p) == mirrorRef)
      80      140085 :                                 setVarCList(mb, getArg(p, 0));
      81             :                 }
      82             :         }
      83             : 
      84             :         /* Defense line against incorrect plans */
      85             :         /* plan remains unaffected */
      86             :         // msg = chkTypes(cntxt->usermodule, mb, FALSE);
      87             :         // if( ms== MAL_SUCCEED)
      88             :         //      msg = chkFlow(mb);
      89             :         // if( ms== MAL_SUCCEED)
      90             :         //      msg = chkDeclarations(mb);
      91             :         /* keep actions taken as a fake argument */
      92      411541 : wrapup:
      93      413930 :         (void) pushInt(mb, pci, 1);
      94      413929 :         return msg;
      95             : }

Generated by: LCOV version 1.14