strepsirrhini/office-gobmx
9
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
office-gobmx/basic/source/comp/exprnode.cxx
Andrea Gelmini 2957be02c5 Fix typos 
Change-Id: I776c517ba87838c0c3391f79010a30fa7fe2abd3
Reviewed-on: https://gerrit.libreoffice.org/18939
Reviewed-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>
Tested-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>
2015-10-02 08:54:51 +00:00

452 lines
13 KiB
C++
Raw Blame History

/* -*- 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 <math.h>
#include <rtl/math.hxx>
#include "codegen.hxx"
#include "parser.hxx"
#include "expr.hxx"
SbiExprNode::SbiExprNode( SbiExprNode* l, SbiToken t, SbiExprNode* r ) :
pLeft(l),
pRight(r),
pWithParent(NULL),
eNodeType(SbxNODE),
eType(SbxVARIANT), // Nodes are always Variant
eTok(t),
bError(false)
{
}
SbiExprNode::SbiExprNode( double n, SbxDataType t ):
nVal(n),
pWithParent(NULL),
eNodeType(SbxNUMVAL),
eType(t),
eTok(NIL),
bError(false)
{
}
SbiExprNode::SbiExprNode( const OUString& rVal ):
aStrVal(rVal),
pWithParent(NULL),
eNodeType(SbxSTRVAL),
eType(SbxSTRING),
eTok(NIL),
bError(false)
{
}
SbiExprNode::SbiExprNode( const SbiSymDef& r, SbxDataType t, SbiExprList* l ) :
pWithParent(NULL),
eNodeType(SbxVARVAL),
eTok(NIL),
bError(false)
{
eType = ( t == SbxVARIANT ) ? r.GetType() : t;
aVar.pDef = const_cast<SbiSymDef*>(&r);
aVar.pPar = l;
aVar.pvMorePar = NULL;
aVar.pNext= NULL;
}
// #120061 TypeOf
SbiExprNode::SbiExprNode( SbiExprNode* l, sal_uInt16 nId ) :
nTypeStrId(nId),
pLeft(l),
pWithParent(NULL),
eNodeType(SbxTYPEOF),
eType(SbxBOOL),
eTok(NIL),
bError(false)
{
}
// new <type>
SbiExprNode::SbiExprNode( sal_uInt16 nId ) :
nTypeStrId(nId),
pWithParent(NULL),
eNodeType(SbxNEW),
eType(SbxOBJECT),
eTok(NIL),
bError(false)
{
}
SbiExprNode::SbiExprNode() :
pWithParent(NULL),
eNodeType(SbxDUMMY),
eType(SbxVARIANT),
eTok(NIL),
bError(false)
{
}
SbiExprNode::~SbiExprNode()
{
if( IsVariable() )
{
delete aVar.pPar;
delete aVar.pNext;
SbiExprListVector* pvMorePar = aVar.pvMorePar;
if( pvMorePar )
{
SbiExprListVector::iterator it;
for( it = pvMorePar->begin() ; it != pvMorePar->end() ; ++it )
delete *it;
delete pvMorePar;
}
}
}
SbiSymDef* SbiExprNode::GetVar()
{
if( eNodeType == SbxVARVAL )
return aVar.pDef;
else
return NULL;
}
SbiSymDef* SbiExprNode::GetRealVar()
{
SbiExprNode* p = GetRealNode();
if( p )
return p->GetVar();
else
return NULL;
}
// From 1995-12-18
SbiExprNode* SbiExprNode::GetRealNode()
{
if( eNodeType == SbxVARVAL )
{
SbiExprNode* p = this;
while( p->aVar.pNext )
p = p->aVar.pNext;
return p;
}
else
return NULL;
}
// This method transform the type, if it fits into the Integer range
bool SbiExprNode::IsIntConst()
{
if( eNodeType == SbxNUMVAL )
{
if( eType >= SbxINTEGER && eType <= SbxDOUBLE )
{
double n;
if( nVal >= SbxMININT && nVal <= SbxMAXINT && modf( nVal, &n ) == 0 )
{
nVal = (double) (short) nVal;
eType = SbxINTEGER;
return true;
}
}
}
return false;
}
bool SbiExprNode::IsNumber()
{
return eNodeType == SbxNUMVAL;
}
bool SbiExprNode::IsVariable()
{
return eNodeType == SbxVARVAL;
}
bool SbiExprNode::IsLvalue()
{
return IsVariable();
}
// Identify of the depth of a tree
short SbiExprNode::GetDepth()
{
if( IsOperand() ) return 0;
else
{
short d1 = pLeft->GetDepth();
short d2 = pRight->GetDepth();
return( (d1 < d2 ) ? d2 : d1 ) + 1;
}
}
// Adjustment of a tree:
// 1. Constant Folding
// 2. Type-Adjustment
// 3. Conversion of the operands into Strings
// 4. Lifting of the composite- and error-bits
void SbiExprNode::Optimize(SbiParser* pParser)
{
FoldConstants(pParser);
CollectBits();
}
// Lifting of the error-bits
void SbiExprNode::CollectBits()
{
if( pLeft )
{
pLeft->CollectBits();
bError = bError || pLeft->bError;
}
if( pRight )
{
pRight->CollectBits();
bError = bError || pRight->bError;
}
}
// If a twig can be converted, True will be returned. In this case
// the result is in the left twig.
void SbiExprNode::FoldConstants(SbiParser* pParser)
{
if( IsOperand() || eTok == LIKE ) return;
if( pLeft )
pLeft->FoldConstants(pParser);
if (pLeft && pRight)
{
pRight->FoldConstants(pParser);
if( pLeft->IsConstant() && pRight->IsConstant()
&& pLeft->eNodeType == pRight->eNodeType )
{
CollectBits();
if( eTok == CAT )
// CAT affiliate also two numbers!
eType = SbxSTRING;
if( pLeft->eType == SbxSTRING )
// No Type Mismatch!
eType = SbxSTRING;
if( eType == SbxSTRING )
{
OUString rl( pLeft->GetString() );
OUString rr( pRight->GetString() );
pLeft.reset();
pRight.reset();
if( eTok == PLUS || eTok == CAT )
{
eTok = CAT;
// Linking:
aStrVal = rl;
aStrVal += rr;
eType = SbxSTRING;
eNodeType = SbxSTRVAL;
}
else
{
eType = SbxDOUBLE;
eNodeType = SbxNUMVAL;
int eRes = rr.compareTo( rl );
switch( eTok )
{
case EQ:
nVal = ( eRes == 0 ) ? SbxTRUE : SbxFALSE;
break;
case NE:
nVal = ( eRes != 0 ) ? SbxTRUE : SbxFALSE;
break;
case LT:
nVal = ( eRes < 0 ) ? SbxTRUE : SbxFALSE;
break;
case GT:
nVal = ( eRes > 0 ) ? SbxTRUE : SbxFALSE;
break;
case LE:
nVal = ( eRes <= 0 ) ? SbxTRUE : SbxFALSE;
break;
case GE:
nVal = ( eRes >= 0 ) ? SbxTRUE : SbxFALSE;
break;
default:
pParser->Error( ERRCODE_BASIC_CONVERSION );
bError = true;
break;
}
}
}
else
{
double nl = pLeft->nVal;
double nr = pRight->nVal;
long ll = 0, lr = 0;
long llMod = 0, lrMod = 0;
if( ( eTok >= AND && eTok <= IMP )
|| eTok == IDIV || eTok == MOD )
{
// Integer operations
bool err = false;
if( nl > SbxMAXLNG ) err = true, nl = SbxMAXLNG;
else if( nl < SbxMINLNG ) err = true, nl = SbxMINLNG;
if( nr > SbxMAXLNG ) err = true, nr = SbxMAXLNG;
else if( nr < SbxMINLNG ) err = true, nr = SbxMINLNG;
ll = static_cast<long>(nl); lr = static_cast<long>(nr);
llMod = static_cast<long>(nl);
lrMod = static_cast<long>(nr);
if( err )
{
pParser->Error( ERRCODE_BASIC_MATH_OVERFLOW );
bError = true;
}
}
bool bBothInt = ( pLeft->eType < SbxSINGLE
&& pRight->eType < SbxSINGLE );
pLeft.reset();
pRight.reset();
nVal = 0;
eType = SbxDOUBLE;
eNodeType = SbxNUMVAL;
bool bCheckType = false;
switch( eTok )
{
case EXPON:
nVal = pow( nl, nr ); break;
case MUL:
bCheckType = true;
nVal = nl * nr; break;
case DIV:
if( !nr )
{
pParser->Error( ERRCODE_BASIC_ZERODIV ); nVal = HUGE_VAL;
bError = true;
} else nVal = nl / nr;
break;
case PLUS:
bCheckType = true;
nVal = nl + nr; break;
case MINUS:
bCheckType = true;
nVal = nl - nr; break;
case EQ:
nVal = ( nl == nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case NE:
nVal = ( nl != nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case LT:
nVal = ( nl < nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case GT:
nVal = ( nl > nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case LE:
nVal = ( nl <= nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case GE:
nVal = ( nl >= nr ) ? SbxTRUE : SbxFALSE;
eType = SbxINTEGER; break;
case IDIV:
if( !lr )
{
pParser->Error( ERRCODE_BASIC_ZERODIV ); nVal = HUGE_VAL;
bError = true;
} else nVal = ll / lr;
eType = SbxLONG; break;
case MOD:
if( !lr )
{
pParser->Error( ERRCODE_BASIC_ZERODIV ); nVal = HUGE_VAL;
bError = true;
} else nVal = llMod - lrMod * (llMod/lrMod);
eType = SbxLONG; break;
case AND:
nVal = (double) ( ll & lr ); eType = SbxLONG; break;
case OR:
nVal = (double) ( ll | lr ); eType = SbxLONG; break;
case XOR:
nVal = (double) ( ll ^ lr ); eType = SbxLONG; break;
case EQV:
nVal = (double) ( ~ll ^ lr ); eType = SbxLONG; break;
case IMP:
nVal = (double) ( ~ll | lr ); eType = SbxLONG; break;
default: break;
}
if( !::rtl::math::isFinite( nVal ) )
pParser->Error( ERRCODE_BASIC_MATH_OVERFLOW );
// Recover the data type to kill rounding error
if( bCheckType && bBothInt
&& nVal >= SbxMINLNG && nVal <= SbxMAXLNG )
{
// Decimal place away
long n = (long) nVal;
nVal = n;
eType = ( n >= SbxMININT && n <= SbxMAXINT )
? SbxINTEGER : SbxLONG;
}
}
}
}
else if (pLeft && pLeft->IsNumber())
{
nVal = pLeft->nVal;
pLeft.reset();
eType = SbxDOUBLE;
eNodeType = SbxNUMVAL;
switch( eTok )
{
case NEG:
nVal = -nVal; break;
case NOT: {
// Integer operation!
bool err = false;
if( nVal > SbxMAXLNG ) err = true, nVal = SbxMAXLNG;
else if( nVal < SbxMINLNG ) err = true, nVal = SbxMINLNG;
if( err )
{
pParser->Error( ERRCODE_BASIC_MATH_OVERFLOW );
bError = true;
}
nVal = (double) ~((long) nVal);
eType = SbxLONG;
} break;
default: break;
}
}
if( eNodeType == SbxNUMVAL )
{
// Potentially convolve in INTEGER (because of better opcode)?
if( eType == SbxSINGLE || eType == SbxDOUBLE )
{
double x;
if( nVal >= SbxMINLNG && nVal <= SbxMAXLNG
&& !modf( nVal, &x ) )
eType = SbxLONG;
}
if( eType == SbxLONG && nVal >= SbxMININT && nVal <= SbxMAXINT )
eType = SbxINTEGER;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
Reference in a new issue View git blame Copy permalink