1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <basic/sberrors.hxx>
#include <codegen.hxx>
#include <expr.hxx>
#include <parser.hxx>
// Transform table for token operators and opcodes
namespace {
struct OpTable {
SbiToken eTok; // Token
SbiOpcode eOp; // Opcode
};
}
const OpTable aOpTable [] = {
{ EXPON,SbiOpcode::EXP_ },
{ MUL, SbiOpcode::MUL_ },
{ DIV, SbiOpcode::DIV_ },
{ IDIV, SbiOpcode::IDIV_ },
{ MOD, SbiOpcode::MOD_ },
{ PLUS, SbiOpcode::PLUS_ },
{ MINUS,SbiOpcode::MINUS_ },
{ EQ, SbiOpcode::EQ_ },
{ NE, SbiOpcode::NE_ },
{ LE, SbiOpcode::LE_ },
{ GE, SbiOpcode::GE_ },
{ LT, SbiOpcode::LT_ },
{ GT, SbiOpcode::GT_ },
{ AND, SbiOpcode::AND_ },
{ OR, SbiOpcode::OR_ },
{ XOR, SbiOpcode::XOR_ },
{ EQV, SbiOpcode::EQV_ },
{ IMP, SbiOpcode::IMP_ },
{ NOT, SbiOpcode::NOT_ },
{ NEG, SbiOpcode::NEG_ },
{ CAT, SbiOpcode::CAT_ },
{ LIKE, SbiOpcode::LIKE_ },
{ IS, SbiOpcode::IS_ },
};
// Output of an element
void SbiExprNode::Gen( SbiCodeGen& rGen, RecursiveMode eRecMode )
{
sal_uInt16 nStringId;
if( IsConstant() )
{
switch( GetType() )
{
case SbxEMPTY:
rGen.Gen( SbiOpcode::EMPTY_ );
break;
case SbxSTRING:
nStringId = rGen.GetParser()->aGblStrings.Add( aStrVal );
rGen.Gen( SbiOpcode::SCONST_, nStringId );
break;
default:
// tdf#131296 - generate SbiOpcode::NUMBER_ instead of SbiOpcode::CONST_
// for SbxINTEGER and SbxLONG including their numeric value and its data type,
// which will be restored in SbiRuntime::StepLOADNC.
nStringId = rGen.GetParser()->aGblStrings.Add( nVal, eType );
rGen.Gen( SbiOpcode::NUMBER_, nStringId );
break;
}
}
else if( IsOperand() )
{
SbiExprNode* pWithParent_ = nullptr;
SbiOpcode eOp;
if( aVar.pDef->GetScope() == SbPARAM )
{
eOp = SbiOpcode::PARAM_;
if( aVar.pDef->GetPos() == 0 )
{
bool bTreatFunctionAsParam = true;
if( eRecMode == FORCE_CALL )
{
bTreatFunctionAsParam = false;
}
else if( eRecMode == UNDEFINED )
{
if( aVar.pPar && aVar.pPar->IsBracket() )
{
bTreatFunctionAsParam = false;
}
}
if( !bTreatFunctionAsParam )
{
eOp = aVar.pDef->IsGlobal() ? SbiOpcode::FIND_G_ : SbiOpcode::FIND_;
}
}
}
// special treatment for WITH
else if( (pWithParent_ = pWithParent) != nullptr )
{
eOp = SbiOpcode::ELEM_; // .-Term in WITH
}
else
{
eOp = ( aVar.pDef->GetScope() == SbRTL ) ? SbiOpcode::RTL_ :
(aVar.pDef->IsGlobal() ? SbiOpcode::FIND_G_ : SbiOpcode::FIND_);
}
if( eOp == SbiOpcode::FIND_ )
{
SbiProcDef* pProc = aVar.pDef->GetProcDef();
if ( rGen.GetParser()->bClassModule )
{
eOp = SbiOpcode::FIND_CM_;
}
else if ( aVar.pDef->IsStatic() || (pProc && pProc->IsStatic()) )
{
eOp = SbiOpcode::FIND_STATIC_;
}
}
if (pWithParent_ != nullptr)
pWithParent_->Gen(rGen);
for( SbiExprNode* p = this; p; p = p->aVar.pNext )
{
p->GenElement( rGen, eOp );
eOp = SbiOpcode::ELEM_;
}
}
else if( eNodeType == SbxTYPEOF )
{
pLeft->Gen(rGen);
rGen.Gen( SbiOpcode::TESTCLASS_, nTypeStrId );
}
else if( eNodeType == SbxNEW )
{
rGen.Gen( SbiOpcode::CREATE_, 0, nTypeStrId );
}
else
{
pLeft->Gen(rGen);
if( pRight )
{
pRight->Gen(rGen);
}
for (const OpTable& op : aOpTable)
{
if (op.eTok == eTok)
{
rGen.Gen(op.eOp);
break;
}
}
}
}
// Output of an operand element
void SbiExprNode::GenElement( SbiCodeGen& rGen, SbiOpcode eOp )
{
#ifdef DBG_UTIL
if ((eOp < SbiOpcode::RTL_ || eOp > SbiOpcode::CALLC_) && eOp != SbiOpcode::FIND_G_ && eOp != SbiOpcode::FIND_CM_ && eOp != SbiOpcode::FIND_STATIC_)
rGen.GetParser()->Error( ERRCODE_BASIC_INTERNAL_ERROR, u"Opcode"_ustr );
#endif
SbiSymDef* pDef = aVar.pDef;
// The ID is either the position or the String-ID
// If the bit Bit 0x8000 is set, the variable have
// a parameter list.
sal_uInt16 nId = ( eOp == SbiOpcode::PARAM_ ) ? pDef->GetPos() : pDef->GetId();
// Build a parameter list
if( aVar.pPar && aVar.pPar->GetSize() )
{
nId |= 0x8000;
aVar.pPar->Gen(rGen);
}
rGen.Gen( eOp, nId, sal::static_int_cast< sal_uInt16 >( GetType() ) );
if( aVar.pvMorePar )
{
for( auto& pExprList: *aVar.pvMorePar )
{
pExprList->Gen(rGen);
rGen.Gen( SbiOpcode::ARRAYACCESS_ );
}
}
}
// Create an Argv-Table
// The first element remain available for return value etc.
// See as well SbiProcDef::SbiProcDef() in symtbl.cxx
void SbiExprList::Gen(SbiCodeGen& rGen)
{
if( aData.empty() )
return;
rGen.Gen( SbiOpcode::ARGC_ );
// Type adjustment at DECLARE
for( auto& pExpr: aData )
{
pExpr->Gen();
if( !pExpr->GetName().isEmpty() )
{
// named arg
sal_uInt16 nSid = rGen.GetParser()->aGblStrings.Add( pExpr->GetName() );
rGen.Gen( SbiOpcode::ARGN_, nSid );
/* TODO: Check after Declare concept change
// From 1996-01-10: Type adjustment at named -> search suitable parameter
if( pProc )
{
// For the present: trigger an error
pParser->Error( ERRCODE_BASIC_NO_NAMED_ARGS );
// Later, if Named Args at DECLARE is possible
//for( sal_uInt16 i = 1 ; i < nParAnz ; i++ )
//{
// SbiSymDef* pDef = pPool->Get( i );
// const String& rName = pDef->GetName();
// if( rName.Len() )
// {
// if( pExpr->GetName().ICompare( rName )
// == COMPARE_EQUAL )
// {
// pParser->aGen.Gen( ARGTYP_, pDef->GetType() );
// break;
// }
// }
//}
}
*/
}
else
{
rGen.Gen( SbiOpcode::ARGV_ );
}
}
}
void SbiExpression::Gen( RecursiveMode eRecMode )
{
// special treatment for WITH
// If pExpr == .-term in With, approximately Gen for Basis-Object
pExpr->Gen( pParser->aGen, eRecMode );
if( bByVal )
{
pParser->aGen.Gen( SbiOpcode::BYVAL_ );
}
if( bBased )
{
sal_uInt16 uBase = pParser->nBase;
if( pParser->IsCompatible() )
{
uBase |= 0x8000; // #109275 Flag compatibility
}
pParser->aGen.Gen( SbiOpcode::BASED_, uBase );
pParser->aGen.Gen( SbiOpcode::ARGV_ );
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|