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-10-07 21:21:43 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      461441 : OPTcandidatesImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
      23             : {
      24      461441 :         InstrPtr p;
      25      461441 :         str msg = MAL_SUCCEED;
      26             : 
      27      461441 :         if (!(ATOMIC_GET(&GDKdebug) & FORCEMITOMASK))
      28        2391 :                 goto wrapup;
      29             :         (void) cntxt;
      30             :         (void) stk;                                     /* to fool compilers */
      31    27716536 :         for (int i = 0; i < mb->stop; i++) {
      32    27257486 :                 p = getInstrPtr(mb, i);
      33    27257486 :                 if (p->token == ASSIGNsymbol) {
      34      141486 :                         for (int j = 0; j < p->retc && j + p->retc < p->argc; j++)
      35        8928 :                                 if (isVarCList(mb, getArg(p, p->retc + j)))
      36          54 :                                         setVarCList(mb, getArg(p, j));
      37             :                 }
      38    27257486 :                 if (getModuleId(p) == sqlRef) {
      39     3239530 :                         if (getFunctionId(p) == tidRef)
      40      259732 :                                 setVarCList(mb, getArg(p, 0));
      41     2979798 :                         else if (getFunctionId(p) == subdeltaRef)
      42       66326 :                                 setVarCList(mb, getArg(p, 0));
      43    24017956 :                 } else if (getModuleId(p) == algebraRef) {
      44     3517717 :                         if (getFunctionId(p) == selectRef
      45     3390172 :                                 || getFunctionId(p) == thetaselectRef)
      46      556099 :                                 setVarCList(mb, getArg(p, 0));
      47     2961618 :                         else if (getFunctionId(p) == likeselectRef)
      48        5801 :                                 setVarCList(mb, getArg(p, 0));
      49     2955817 :                         else if (getFunctionId(p) == intersectRef
      50     2947309 :                                          || getFunctionId(p) == differenceRef)
      51      118137 :                                 setVarCList(mb, getArg(p, 0));
      52     2837680 :                         else if (getFunctionId(p) == uniqueRef)
      53          65 :                                 setVarCList(mb, getArg(p, 0));
      54     2837615 :                         else if (getFunctionId(p) == firstnRef)
      55        1162 :                                 setVarCList(mb, getArg(p, 0));
      56     2836453 :                         else if (getFunctionId(p) == subsliceRef)
      57        1059 :                                 setVarCList(mb, getArg(p, 0));
      58     2835394 :                         else if (getFunctionId(p) == projectionRef
      59     1682952 :                                          && isVarCList(mb, getArg(p, p->retc + 0))
      60      968240 :                                          && isVarCList(mb, getArg(p, p->retc + 1)))
      61      156355 :                                 setVarCList(mb, getArg(p, 0));
      62    20500239 :                 } else if (getModuleId(p) == generatorRef) {
      63         418 :                         if (getFunctionId(p) == selectRef
      64         418 :                                 || getFunctionId(p) == thetaselectRef)
      65          29 :                                 setVarCList(mb, getArg(p, 0));
      66    20499821 :                 } else if (getModuleId(p) == sampleRef) {
      67          20 :                         if (getFunctionId(p) == subuniformRef)
      68          20 :                                 setVarCList(mb, getArg(p, 0));
      69    20499801 :                 } else if (getModuleId(p) == groupRef && p->retc > 1) {
      70       83398 :                         if (getFunctionId(p) == subgroupRef
      71       80394 :                                 || getFunctionId(p) == subgroupdoneRef
      72       60528 :                                 || getFunctionId(p) == groupRef
      73       40817 :                                 || getFunctionId(p) == groupdoneRef)
      74       83398 :                                 setVarCList(mb, getArg(p, 1));
      75    20416403 :                 } else if (getModuleId(p) == batRef) {
      76      729790 :                         if (getFunctionId(p) == mergecandRef
      77      615946 :                                 || getFunctionId(p) == intersectcandRef
      78      615946 :                                 || getFunctionId(p) == diffcandRef
      79      615946 :                                 || getFunctionId(p) == mirrorRef)
      80      184371 :                                 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      459050 : wrapup:
      93      461441 :         (void) pushInt(mb, pci, 1);
      94      461438 :         return msg;
      95             : }

Generated by: LCOV version 1.14