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
|
/*
* This file is part of the KDE libraries
* Copyright (C) 1999-2001 Harri Porten (porten@kde.org)
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
* Copyright (C) 2003 Apple Computer, Inc.
*
* 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 "value.h"
#include <config-kjs.h>
#include "error_object.h"
#include "nodes.h"
#include "operations.h"
#include <stdio.h>
#include <string.h>
#include <wtf/MathExtras.h>
namespace KJS {
static const double D16 = 65536.0;
static const double D32 = 4294967296.0;
void *JSCell::operator new(size_t size)
{
return Collector::allocate(size);
}
bool JSCell::getUInt32(uint32_t&) const
{
return false;
}
bool JSCell::getTruncatedInt32(int32_t&) const
{
return false;
}
bool JSCell::getTruncatedUInt32(uint32_t&) const
{
return false;
}
// ECMA 9.4
double JSValue::toInteger(ExecState *exec) const
{
int32_t i;
if (getTruncatedInt32(i))
return i;
double d = toNumber(exec);
return isNaN(d) ? 0.0 : trunc(d);
}
double JSValue::toIntegerPreserveNaN(ExecState *exec) const
{
int32_t i;
if (getTruncatedInt32(i))
return i;
return trunc(toNumber(exec));
}
int32_t JSValue::toInt32SlowCase(double d, bool& ok)
{
ok = true;
if (d >= -D32 / 2 && d < D32 / 2)
return static_cast<int32_t>(d);
if (isNaN(d) || isInf(d)) {
ok = false;
return 0;
}
double d32 = fmod(trunc(d), D32);
if (d32 >= D32 / 2)
d32 -= D32;
else if (d32 < -D32 / 2)
d32 += D32;
return static_cast<int32_t>(d32);
}
int32_t JSValue::toInt32SlowCase(ExecState* exec, bool& ok) const
{
return JSValue::toInt32SlowCase(toNumber(exec), ok);
}
uint32_t JSValue::toUInt32SlowCase(double d, bool& ok)
{
ok = true;
if (d >= 0.0 && d < D32)
return static_cast<uint32_t>(d);
if (isNaN(d) || isInf(d)) {
ok = false;
return 0;
}
double d32 = fmod(trunc(d), D32);
if (d32 < 0)
d32 += D32;
return static_cast<uint32_t>(d32);
}
uint32_t JSValue::toUInt32SlowCase(ExecState* exec, bool& ok) const
{
return JSValue::toUInt32SlowCase(toNumber(exec), ok);
}
uint16_t JSValue::toUInt16(ExecState *exec) const
{
uint32_t i;
if (getUInt32(i))
return static_cast<uint16_t>(i);
return KJS::toUInt16(const_cast<JSValue*>(this)->toNumber(exec));
}
float JSValue::toFloat(ExecState* exec) const
{
return static_cast<float>(toNumber(exec));
}
bool JSCell::getNumber(double &numericValue) const
{
if (!isNumber())
return false;
numericValue = static_cast<const NumberImp *>(this)->value();
return true;
}
double JSCell::getNumber() const
{
return isNumber() ? static_cast<const NumberImp *>(this)->value() : NaN;
}
bool JSCell::getString(UString &stringValue) const
{
if (!isString())
return false;
stringValue = static_cast<const StringImp *>(this)->value();
return true;
}
UString JSCell::getString() const
{
return isString() ? static_cast<const StringImp *>(this)->value() : UString();
}
JSObject *JSCell::getObject()
{
return isObject() ? static_cast<JSObject *>(this) : 0;
}
const JSObject *JSCell::getObject() const
{
return isObject() ? static_cast<const JSObject *>(this) : 0;
}
bool JSCell::implementsCall() const
{
return false;
}
JSCell* jsString()
{
return new StringImp();
}
JSCell* jsString(const char* s)
{
return new StringImp(s, s ? strlen(s) : 0);
}
JSCell* jsString(const char* s, int len)
{
return new StringImp(s, len);
}
JSCell* jsString(const UString& s)
{
return s.isNull() ? new StringImp() : new StringImp(s);
}
JSCell* jsOwnedString(const UString& s)
{
return s.isNull() ? new StringImp(UString::empty, StringImp::HasOtherOwner) : new StringImp(s, StringImp::HasOtherOwner);
}
JSCell* jsString(ExecState* exec, const JSValue* value)
{
if (value->isString())
return jsString(static_cast<const StringImp*>(value)->value());
return jsString(value->toString(exec));
}
// This method includes a PIC branch to set up the NumberImp's vtable, so we quarantine
// it in a separate function to keep the normal case speedy.
JSValue *jsNumberCell(double d)
{
return new NumberImp(d);
}
JSValue* JSValue::getByIndex(ExecState* exec, unsigned propertyName) const
{
switch (type()) {
case StringType: {
UString s = static_cast<const StringImp*>(asCell())->value();
if (propertyName < static_cast<unsigned>(s.size())) {
return jsString(s.substr(propertyName, 1));
}
// fall through
}
default: {
JSObject* obj = toObject(exec);
PropertySlot slot;
if (obj->getPropertySlot(exec, propertyName, slot))
return slot.getValue(exec, obj, propertyName);
return jsUndefined();
}
}
}
} // namespace KJS
|