kdelibs/kjs/operations.cpp
Ivailo Monev 39f1e04295 generic: add back khtml and kjs with some changes
Signed-off-by: Ivailo Monev <xakepa10@gmail.com>
2015-11-09 23:23:53 +02:00

287 lines
7.3 KiB
C++

// -*- c-basic-offset: 2 -*-
/*
* This file is part of the KDE libraries
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "operations.h"
#include <config-kjs.h>
#include "object.h"
#include "internal.h"
#include <math.h>
#include <stdio.h>
#include <wtf/MathExtras.h>
#if HAVE(IEEEFP_H)
#if HAVE(FUNC_ISINF) || HAVE(FUNC_FINITE)
#include <ieeefp.h>
#endif
#endif
#if HAVE(FLOAT_H)
#include <float.h>
#endif
namespace KJS {
#if !PLATFORM(DARWIN)
// FIXME: Should probably be inlined on non-Darwin platforms too, and controlled exclusively
// by HAVE macros rather than PLATFORM.
// FIXME: Merge with isnan in MathExtras.h and remove this one entirely.
bool isNaN(double d)
{
#if HAVE(FUNC_ISNAN)
return isnan(d) != 0;
#elif HAVE(FLOAT_H)
return _isnan(d) != 0;
#else
return !(d == d);
#endif
}
// FIXME: Merge with isinf in MathExtras.h and remove this one entirely.
bool isInf(double d)
{
// FIXME: should be HAVE(_FPCLASS)
#if PLATFORM(WIN_OS)
int fpClass = _fpclass(d);
return _FPCLASS_PINF == fpClass || _FPCLASS_NINF == fpClass;
#elif HAVE(FUNC_ISINF) && !PLATFORM(SOLARIS_OS)
return isinf(d);
#elif HAVE(FUNC_FINITE)
return finite(d) == 0 && d == d;
#elif HAVE(FUNC__FINITE)
return _finite(d) == 0 && d == d;
#else
return false;
#endif
}
bool isPosInf(double d)
{
// FIXME: should be HAVE(_FPCLASS)
#if PLATFORM(WIN_OS)
return _FPCLASS_PINF == _fpclass(d);
#elif HAVE(FUNC_ISINF) && !PLATFORM(SOLARIS_OS)
return (isinf(d) == 1);
#elif HAVE(FUNC_FINITE)
return !finite(d) && d == d; // ### can we distinguish between + and - ?
#elif HAVE(FUNC__FINITE)
return !_finite(d) && d == d; // ###
#else
return false;
#endif
}
bool isNegInf(double d)
{
// FIXME: should be HAVE(_FPCLASS)
#if PLATFORM(WIN_OS)
return _FPCLASS_NINF == _fpclass(d);
#elif HAVE(FUNC_ISINF) && !PLATFORM(SOLARIS_OS)
return (isinf(d) == -1);
#elif HAVE(FUNC_FINITE)
return finite(d) == 0 && d == d; // ###
#elif HAVE(FUNC__FINITE)
return _finite(d) == 0 && d == d; // ###
#else
return false;
#endif
}
#endif
// ECMA 11.9.3
bool equal(ExecState *exec, JSValue *v1, JSValue *v2)
{
JSType t1 = v1->type();
JSType t2 = v2->type();
if (t1 != t2) {
if (t1 == UndefinedType)
t1 = NullType;
if (t2 == UndefinedType)
t2 = NullType;
if (t1 == BooleanType)
t1 = NumberType;
if (t2 == BooleanType)
t2 = NumberType;
if (t1 == NumberType && t2 == StringType) {
// use toNumber
} else if (t1 == StringType && t2 == NumberType)
t1 = NumberType;
// use toNumber
else {
if ((t1 == StringType || t1 == NumberType) && t2 >= ObjectType)
return equal(exec, v1, v2->toPrimitive(exec));
if (t1 == NullType && t2 == ObjectType)
return static_cast<JSObject *>(v2)->masqueradeAsUndefined();
if (t1 >= ObjectType && (t2 == StringType || t2 == NumberType))
return equal(exec, v1->toPrimitive(exec), v2);
if (t1 == ObjectType && t2 == NullType)
return static_cast<JSObject *>(v1)->masqueradeAsUndefined();
if (t1 != t2)
return false;
}
}
if (t1 == UndefinedType || t1 == NullType)
return true;
if (t1 == NumberType) {
double d1 = v1->toNumber(exec);
double d2 = v2->toNumber(exec);
return d1 == d2;
}
if (t1 == StringType)
return v1->toString(exec) == v2->toString(exec);
if (t1 == BooleanType)
return v1->toBoolean(exec) == v2->toBoolean(exec);
// types are Object
return v1 == v2;
}
bool strictEqual(ExecState *exec, JSValue *v1, JSValue *v2)
{
JSType t1 = v1->type();
JSType t2 = v2->type();
if (t1 != t2)
return false;
if (t1 == UndefinedType || t1 == NullType)
return true;
if (t1 == NumberType) {
double n1 = v1->toNumber(exec);
double n2 = v2->toNumber(exec);
if (n1 == n2)
return true;
return false;
} else if (t1 == StringType)
return v1->toString(exec) == v2->toString(exec);
else if (t2 == BooleanType)
return v1->toBoolean(exec) == v2->toBoolean(exec);
if (v1 == v2)
return true;
/* TODO: joined objects */
return false;
}
int relation(ExecState *exec, JSValue *v1, JSValue *v2, bool leftFirst)
{
double n1;
double n2;
JSValue* p1;
JSValue* p2;
bool wasNotString1;
bool wasNotString2;
if (leftFirst) {
wasNotString1 = v1->getPrimitiveNumber(exec, n1, p1);
if (exec->hadException())
return -1;
wasNotString2 = v2->getPrimitiveNumber(exec, n2, p2);
} else {
wasNotString1 = v2->getPrimitiveNumber(exec, n2, p2);
if (exec->hadException())
return -1;
wasNotString2 = v1->getPrimitiveNumber(exec, n1, p1);
}
if (wasNotString1 || wasNotString2) {
if (n1 < n2)
return 1;
if (n1 >= n2)
return 0;
return -1; // must be NaN, so undefined
}
assert(p1->isString() && p2->isString());
return static_cast<const StringImp*>(p1)->value() < static_cast<const StringImp*>(p2)->value() ? 1 : 0;
}
//EMCA 9.12
bool sameValue(ExecState *exec, JSValue *v1, JSValue *v2)
{
JSType t1 = v1->type();
JSType t2 = v2->type();
if (t1 != t2)
return false;
if (t1 == UndefinedType || t1 == NullType)
return true;
if (t1 == NumberType) {
double n1 = v1->toNumber(exec);
double n2 = v2->toNumber(exec);
if (isNaN(n1) && isNaN(n2))
return true;
if (signbit(n1) != signbit(n2))
return false;
if (n1 == n2)
return true;
return false;
} else if (t1 == StringType)
return v1->toString(exec) == v2->toString(exec);
else if (t2 == BooleanType)
return v1->toBoolean(exec) == v2->toBoolean(exec);
if (v1 == v2)
return true;
/* TODO: joined objects */
return false;
}
int relation(ExecState *exec, JSValue *v1, double n2)
{
double n1;
JSValue* p1;
v1->getPrimitiveNumber(exec, n1, p1);
if (exec->hadException())
return -1;
if (n1 < n2)
return 1;
if (n1 >= n2)
return 0;
return -1; // must be NaN, so undefined
}
int maxInt(int d1, int d2)
{
return (d1 > d2) ? d1 : d2;
}
int minInt(int d1, int d2)
{
return (d1 < d2) ? d1 : d2;
}
}