mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-10 01:40:17 +01:00
140 lines
4.6 KiB
C++
140 lines
4.6 KiB
C++
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
||
|
/* ***** BEGIN LICENSE BLOCK *****
|
||
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
||
|
*
|
||
|
* The contents of this file are subject to the Mozilla Public License Version
|
||
|
* 1.1 (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.mozilla.org/MPL/
|
||
|
*
|
||
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
||
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
||
|
* for the specific language governing rights and limitations under the
|
||
|
* License.
|
||
|
*
|
||
|
* The Original Code is TransforMiiX XSLT processor code.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is
|
||
|
* The MITRE Corporation.
|
||
|
* Portions created by the Initial Developer are Copyright (C) 1999
|
||
|
* the Initial Developer. All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s):
|
||
|
* Keith Visco <kvisco@ziplink.net> (Original Author)
|
||
|
*
|
||
|
* Alternatively, the contents of this file may be used under the terms of
|
||
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
||
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
||
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
||
|
* of those above. If you wish to allow use of your version of this file only
|
||
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
||
|
* use your version of this file under the terms of the MPL, indicate your
|
||
|
* decision by deleting the provisions above and replace them with the notice
|
||
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
||
|
* the provisions above, a recipient may use your version of this file under
|
||
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
||
|
*
|
||
|
* ***** END LICENSE BLOCK ***** */
|
||
|
|
||
|
/**
|
||
|
* Represents a MultiplicativeExpr, an binary expression that
|
||
|
* performs a multiplicative operation between it's lvalue and rvalue:
|
||
|
* * : multiply
|
||
|
* mod : modulus
|
||
|
* div : divide
|
||
|
**/
|
||
|
|
||
|
#include "Expr.h"
|
||
|
#include "ExprResult.h"
|
||
|
#include <math.h>
|
||
|
#include "txIXPathContext.h"
|
||
|
|
||
|
/**
|
||
|
* Evaluates this Expr based on the given context node and processor state
|
||
|
* @param context the context node for evaluation of this Expr
|
||
|
* @param ps the ContextState containing the stack information needed
|
||
|
* for evaluation
|
||
|
* @return the result of the evaluation
|
||
|
**/
|
||
|
nsresult
|
||
|
MultiplicativeExpr::evaluate(txIEvalContext* aContext, txAExprResult** aResult)
|
||
|
{
|
||
|
*aResult = nsnull;
|
||
|
|
||
|
nsRefPtr<txAExprResult> exprRes;
|
||
|
nsresult rv = rightExpr->evaluate(aContext, getter_AddRefs(exprRes));
|
||
|
NS_ENSURE_SUCCESS(rv, rv);
|
||
|
|
||
|
double rightDbl = exprRes->numberValue();
|
||
|
|
||
|
rv = leftExpr->evaluate(aContext, getter_AddRefs(exprRes));
|
||
|
NS_ENSURE_SUCCESS(rv, rv);
|
||
|
|
||
|
double leftDbl = exprRes->numberValue();
|
||
|
double result = 0;
|
||
|
|
||
|
switch ( op ) {
|
||
|
case DIVIDE:
|
||
|
if (rightDbl == 0) {
|
||
|
#if defined(XP_WIN)
|
||
|
/* XXX MSVC miscompiles such that (NaN == 0) */
|
||
|
if (Double::isNaN(rightDbl))
|
||
|
result = Double::NaN;
|
||
|
else
|
||
|
#endif
|
||
|
if (leftDbl == 0 || Double::isNaN(leftDbl))
|
||
|
result = Double::NaN;
|
||
|
else if (Double::isNeg(leftDbl) ^ Double::isNeg(rightDbl))
|
||
|
result = Double::NEGATIVE_INFINITY;
|
||
|
else
|
||
|
result = Double::POSITIVE_INFINITY;
|
||
|
}
|
||
|
else
|
||
|
result = leftDbl / rightDbl;
|
||
|
break;
|
||
|
case MODULUS:
|
||
|
if (rightDbl == 0) {
|
||
|
result = Double::NaN;
|
||
|
}
|
||
|
else {
|
||
|
#if defined(XP_WIN)
|
||
|
/* Workaround MS fmod bug where 42 % (1/0) => NaN, not 42. */
|
||
|
if (!Double::isInfinite(leftDbl) && Double::isInfinite(rightDbl))
|
||
|
result = leftDbl;
|
||
|
else
|
||
|
#endif
|
||
|
result = fmod(leftDbl, rightDbl);
|
||
|
}
|
||
|
break;
|
||
|
default:
|
||
|
result = leftDbl * rightDbl;
|
||
|
break;
|
||
|
}
|
||
|
|
||
|
return aContext->recycler()->getNumberResult(result, aResult);
|
||
|
} //-- evaluate
|
||
|
|
||
|
#ifdef TX_TO_STRING
|
||
|
void
|
||
|
MultiplicativeExpr::toString(nsAString& str)
|
||
|
{
|
||
|
if ( leftExpr ) leftExpr->toString(str);
|
||
|
else str.AppendLiteral("null");
|
||
|
|
||
|
switch ( op ) {
|
||
|
case DIVIDE:
|
||
|
str.AppendLiteral(" div ");
|
||
|
break;
|
||
|
case MODULUS:
|
||
|
str.AppendLiteral(" mod ");
|
||
|
break;
|
||
|
default:
|
||
|
str.AppendLiteral(" * ");
|
||
|
break;
|
||
|
}
|
||
|
if ( rightExpr ) rightExpr->toString(str);
|
||
|
else str.AppendLiteral("null");
|
||
|
|
||
|
}
|
||
|
#endif
|