Removed file/folder for ishmal

(bzr r478)

1 files changed, 0 insertions, 1058 deletions

diff --git a/src/dom/js/jsnum.c b/src/dom/js/jsnum.c
deleted file mode 100644
index 6f6963b69..000000000
--- a/src/dom/js/jsnum.c
+++ /dev/null
@@ -1,1058 +0,0 @@
-/* -*- Mode: C; tab-width: 8; 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 Mozilla Communicator client code, released
- * March 31, 1998.
- *
- * The Initial Developer of the Original Code is
- * Netscape Communications Corporation.
- * Portions created by the Initial Developer are Copyright (C) 1998
- * the Initial Developer. All Rights Reserved.
- *
- * Contributor(s):
- *   IBM Corp.
- *
- * Alternatively, the contents of this file may be used under the terms of
- * either of 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 ***** */
-
-/*
- * JS number type and wrapper class.
- */
-#include "jsstddef.h"
-#if defined(XP_WIN) || defined(XP_OS2)
-#include <float.h>
-#endif
-#include <math.h>
-#include <stdlib.h>
-#include <string.h>
-#include "jstypes.h"
-#include "jsutil.h" /* Added by JSIFY */
-#include "jsapi.h"
-#include "jsatom.h"
-#include "jscntxt.h"
-#include "jsconfig.h"
-#include "jsdtoa.h"
-#include "jsgc.h"
-#include "jsinterp.h"
-#include "jsnum.h"
-#include "jsobj.h"
-#include "jsopcode.h"
-#include "jsprf.h"
-#include "jsstr.h"
-
-static JSBool
-num_isNaN(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    jsdouble x;
-
-    if (!js_ValueToNumber(cx, argv[0], &x))
-	return JS_FALSE;
-    *rval = BOOLEAN_TO_JSVAL(JSDOUBLE_IS_NaN(x));
-    return JS_TRUE;
-}
-
-static JSBool
-num_isFinite(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    jsdouble x;
-
-    if (!js_ValueToNumber(cx, argv[0], &x))
-	return JS_FALSE;
-    *rval = BOOLEAN_TO_JSVAL(JSDOUBLE_IS_FINITE(x));
-    return JS_TRUE;
-}
-
-static JSBool
-num_parseFloat(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    JSString *str;
-    jsdouble d;
-    const jschar *bp, *ep;
-
-    str = js_ValueToString(cx, argv[0]);
-    if (!str)
-	return JS_FALSE;
-    /* XXXbe js_strtod shouldn't require NUL termination */
-    bp = js_UndependString(cx, str);
-    if (!bp)
-	return JS_FALSE;
-    if (!js_strtod(cx, bp, &ep, &d))
-	return JS_FALSE;
-    if (ep == bp) {
-	*rval = DOUBLE_TO_JSVAL(cx->runtime->jsNaN);
-	return JS_TRUE;
-    }
-    return js_NewNumberValue(cx, d, rval);
-}
-
-/* See ECMA 15.1.2.2. */
-static JSBool
-num_parseInt(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    JSString *str;
-    jsint radix;
-    jsdouble d;
-    const jschar *bp, *ep;
-
-    str = js_ValueToString(cx, argv[0]);
-    if (!str)
-	return JS_FALSE;
-
-    if (argc > 1) {
-	if (!js_ValueToECMAInt32(cx, argv[1], &radix))
-	    return JS_FALSE;
-    } else
-	radix = 0;
-
-    if (radix != 0 && (radix < 2 || radix > 36)) {
-	*rval = DOUBLE_TO_JSVAL(cx->runtime->jsNaN);
-	return JS_TRUE;
-    }
-    /* XXXbe js_strtointeger shouldn't require NUL termination */
-    bp = js_UndependString(cx, str);
-    if (!bp)
-	return JS_FALSE;
-    if (!js_strtointeger(cx, bp, &ep, radix, &d))
-	return JS_FALSE;
-    if (ep == bp) {
-	*rval = DOUBLE_TO_JSVAL(cx->runtime->jsNaN);
-	return JS_TRUE;
-    }
-    return js_NewNumberValue(cx, d, rval);
-}
-
-const char js_Infinity_str[]   = "Infinity";
-const char js_NaN_str[]        = "NaN";
-const char js_isNaN_str[]      = "isNaN";
-const char js_isFinite_str[]   = "isFinite";
-const char js_parseFloat_str[] = "parseFloat";
-const char js_parseInt_str[]   = "parseInt";
-
-static JSFunctionSpec number_functions[] = {
-    {"isNaN",           num_isNaN,              1,0,0},
-    {"isFinite",        num_isFinite,           1,0,0},
-    {"parseFloat",      num_parseFloat,         1,0,0},
-    {"parseInt",        num_parseInt,           2,0,0},
-    {0,0,0,0,0}
-};
-
-static JSClass number_class = {
-    "Number",
-    JSCLASS_HAS_PRIVATE,
-    JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
-    JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   JS_FinalizeStub,
-    JSCLASS_NO_OPTIONAL_MEMBERS
-};
-
-static JSBool
-Number(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    jsdouble d;
-    jsval v;
-
-    if (argc != 0) {
-	if (!js_ValueToNumber(cx, argv[0], &d))
-	    return JS_FALSE;
-    } else {
-	d = 0.0;
-    }
-    if (!js_NewNumberValue(cx, d, &v))
-	return JS_FALSE;
-    if (!(cx->fp->flags & JSFRAME_CONSTRUCTING)) {
-	*rval = v;
-	return JS_TRUE;
-    }
-    OBJ_SET_SLOT(cx, obj, JSSLOT_PRIVATE, v);
-    return JS_TRUE;
-}
-
-#if JS_HAS_TOSOURCE
-static JSBool
-num_toSource(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    jsval v;
-    jsdouble d;
-    char numBuf[DTOSTR_STANDARD_BUFFER_SIZE], *numStr;
-    char buf[64];
-    JSString *str;
-
-    if (!JS_InstanceOf(cx, obj, &number_class, argv))
-	return JS_FALSE;
-    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
-    JS_ASSERT(JSVAL_IS_NUMBER(v));
-    d = JSVAL_IS_INT(v) ? (jsdouble)JSVAL_TO_INT(v) : *JSVAL_TO_DOUBLE(v);
-    numStr = JS_dtostr(numBuf, sizeof numBuf, DTOSTR_STANDARD, 0, d);
-    if (!numStr) {
-	JS_ReportOutOfMemory(cx);
-	return JS_FALSE;
-    }
-    JS_snprintf(buf, sizeof buf, "(new %s(%s))", number_class.name, numStr);
-    str = JS_NewStringCopyZ(cx, buf);
-    if (!str)
-	return JS_FALSE;
-    *rval = STRING_TO_JSVAL(str);
-    return JS_TRUE;
-}
-#endif
-
-/* The buf must be big enough for MIN_INT to fit including '-' and '\0'. */
-static char *
-IntToString(jsint i, char *buf, size_t bufSize)
-{
-    char *cp;
-    jsuint u;
-    
-    u = (i < 0) ? -i : i;
-
-    cp = buf + bufSize; /* one past last buffer cell */
-    *--cp = '\0';       /* null terminate the string to be */
-    
-    /*
-     * Build the string from behind. We use multiply and subtraction
-     * instead of modulus because that's much faster.
-     */
-    do {
-        jsuint newu = u / 10;
-        *--cp = (char)(u - newu * 10) + '0';
-        u = newu;
-    } while (u != 0);
-    
-    if (i < 0)
-        *--cp = '-';
-
-    return cp;
-}
-
-static JSBool
-num_toString(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    jsval v;
-    jsdouble d;
-    jsint base;
-    JSString *str;
-
-    if (!JS_InstanceOf(cx, obj, &number_class, argv))
-	return JS_FALSE;
-    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
-    JS_ASSERT(JSVAL_IS_NUMBER(v));
-    d = JSVAL_IS_INT(v) ? (jsdouble)JSVAL_TO_INT(v) : *JSVAL_TO_DOUBLE(v);
-    base = 10;
-    if (argc != 0) {
-	if (!js_ValueToECMAInt32(cx, argv[0], &base))
-	    return JS_FALSE;
-	if (base < 2 || base > 36) {
-	    char numBuf[12];
-	    char *numStr = IntToString(base, numBuf, sizeof numBuf);
-	    JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_BAD_RADIX,
-	    			 numStr);
-	    return JS_FALSE;
-	}
-    }
-    if (base == 10)
-	str = js_NumberToString(cx, d);
-    else {
-	char *dStr = JS_dtobasestr(base, d);
-	if (!dStr) {
-	    JS_ReportOutOfMemory(cx);
-	    return JS_FALSE;
-	}
-	str = JS_NewStringCopyZ(cx, dStr);
-	free(dStr);
-    }
-    if (!str)
-	return JS_FALSE;
-    *rval = STRING_TO_JSVAL(str);
-    return JS_TRUE;
-}
-
-static JSBool
-num_toLocaleString(JSContext *cx, JSObject *obj, uintN argc,
-                   jsval *argv, jsval *rval)
-{
-/*
- *  For now, forcibly ignore the first (or any) argument and return toString().
- *  ECMA allows this, although it doesn't 'encourage it'.
- *  [The first argument is being reserved by ECMA and we don't want it confused
- *  with a radix]
- */
-    return num_toString(cx, obj, 0, argv, rval);
-}
-
-static JSBool
-num_valueOf(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    if (!JS_InstanceOf(cx, obj, &number_class, argv))
-	return JS_FALSE;
-    *rval = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
-    return JS_TRUE;
-}
-
-
-#if JS_HAS_NUMBER_FORMATS
-#define MAX_PRECISION 100
-
-static JSBool
-num_to(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval, JSDToStrMode zeroArgMode,
-       JSDToStrMode oneArgMode, jsint precisionMin, jsint precisionMax, jsint precisionOffset)
-{
-    jsval v;
-    jsdouble d, precision;
-    JSString *str;
-    char buf[DTOSTR_VARIABLE_BUFFER_SIZE(MAX_PRECISION+1)], *numStr; /* Use MAX_PRECISION+1 because precisionOffset can be 1 */
-
-    if (!JS_InstanceOf(cx, obj, &number_class, argv))
-	return JS_FALSE;
-    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
-    JS_ASSERT(JSVAL_IS_NUMBER(v));
-    d = JSVAL_IS_INT(v) ? (jsdouble)JSVAL_TO_INT(v) : *JSVAL_TO_DOUBLE(v);
-
-    if (JSVAL_IS_VOID(argv[0])) {
-	precision = 0.0;
-	oneArgMode = zeroArgMode;
-    } else {
-	if (!js_ValueToNumber(cx, argv[0], &precision))
-	    return JS_FALSE;
-	precision = js_DoubleToInteger(precision);
-        if (precision < precisionMin || precision > precisionMax) {
-            numStr = JS_dtostr(buf, sizeof buf, DTOSTR_STANDARD, 0, precision);
-            if (!numStr)
-                JS_ReportOutOfMemory(cx);
-            else
-                JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_PRECISION_RANGE, numStr);
-            return JS_FALSE;
-        }
-    }
-
-    numStr = JS_dtostr(buf, sizeof buf, oneArgMode, (jsint)precision + precisionOffset, d);
-    if (!numStr) {
-	JS_ReportOutOfMemory(cx);
-	return JS_FALSE;
-    }
-    str = JS_NewStringCopyZ(cx, numStr);
-    if (!str)
-	return JS_FALSE;
-    *rval = STRING_TO_JSVAL(str);
-    return JS_TRUE;
-}
-
-static JSBool
-num_toFixed(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    /* We allow a larger range of precision than ECMA requires; this is permitted by ECMA. */
-    return num_to(cx, obj, argc, argv, rval, DTOSTR_FIXED, DTOSTR_FIXED, -20, MAX_PRECISION, 0);
-}
-
-static JSBool
-num_toExponential(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    /* We allow a larger range of precision than ECMA requires; this is permitted by ECMA. */
-    return num_to(cx, obj, argc, argv, rval, DTOSTR_STANDARD_EXPONENTIAL, DTOSTR_EXPONENTIAL, 0, MAX_PRECISION, 1);
-}
-
-static JSBool
-num_toPrecision(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
-{
-    /* We allow a larger range of precision than ECMA requires; this is permitted by ECMA. */
-    return num_to(cx, obj, argc, argv, rval, DTOSTR_STANDARD, DTOSTR_PRECISION, 1, MAX_PRECISION, 0);
-}
-#endif /* JS_HAS_NUMBER_FORMATS */
-
-
-static JSFunctionSpec number_methods[] = {
-#if JS_HAS_TOSOURCE
-    {js_toSource_str,       num_toSource,       0,0,0},
-#endif
-    {js_toString_str,	    num_toString,       0,0,0},
-    {js_toLocaleString_str, num_toLocaleString, 0,0,0},
-    {js_valueOf_str,	    num_valueOf,        0,0,0},
-#if JS_HAS_NUMBER_FORMATS
-    {"toFixed",             num_toFixed,        1,0,0},
-    {"toExponential",       num_toExponential,  1,0,0},
-    {"toPrecision",         num_toPrecision,    1,0,0},
-#endif
-    {0,0,0,0,0}
-};
-
-/* NB: Keep this in synch with number_constants[]. */
-enum nc_slot {
-    NC_NaN,
-    NC_POSITIVE_INFINITY,
-    NC_NEGATIVE_INFINITY,
-    NC_MAX_VALUE,
-    NC_MIN_VALUE,
-    NC_LIMIT
-};
-
-/*
- * Some to most C compilers forbid spelling these at compile time, or barf
- * if you try, so all but MAX_VALUE are set up by js_InitRuntimeNumberState
- * using union jsdpun.
- */
-static JSConstDoubleSpec number_constants[] = {
-    {0,                         js_NaN_str,          0,{0,0,0}},
-    {0,                         "POSITIVE_INFINITY", 0,{0,0,0}},
-    {0,                         "NEGATIVE_INFINITY", 0,{0,0,0}},
-    {1.7976931348623157E+308,   "MAX_VALUE",         0,{0,0,0}},
-    {0,                         "MIN_VALUE",         0,{0,0,0}},
-    {0,0,0,{0,0,0}}
-};
-
-static jsdouble NaN;
-
-
-#if defined XP_WIN &&                                                         \
-    !defined __MWERKS__ &&                                                    \
-    (defined _M_IX86 ||                                                       \
-     (defined __GNUC__ && !defined __MINGW32__))
-
-/*
- * Set the exception mask to mask all exceptions and set the FPU precision
- * to 53 bit mantissa.
- * On Alpha platform this is handled via Compiler option.
- */
-#define FIX_FPU() _control87(MCW_EM | PC_53, MCW_EM | MCW_PC)
-
-#else
-
-#define FIX_FPU() ((void)0)
-
-#endif
-
-JSBool
-js_InitRuntimeNumberState(JSContext *cx)
-{
-    JSRuntime *rt;
-    jsdpun u;
-
-    rt = cx->runtime;
-    JS_ASSERT(!rt->jsNaN);
-
-    FIX_FPU();
-
-    u.s.hi = JSDOUBLE_HI32_EXPMASK | JSDOUBLE_HI32_MANTMASK;
-    u.s.lo = 0xffffffff;
-    number_constants[NC_NaN].dval = NaN = u.d;
-    rt->jsNaN = js_NewDouble(cx, NaN);
-    if (!rt->jsNaN || !js_LockGCThing(cx, rt->jsNaN))
-        return JS_FALSE;
-
-    u.s.hi = JSDOUBLE_HI32_EXPMASK;
-    u.s.lo = 0x00000000;
-    number_constants[NC_POSITIVE_INFINITY].dval = u.d;
-    rt->jsPositiveInfinity = js_NewDouble(cx, u.d);
-    if (!rt->jsPositiveInfinity ||
-        !js_LockGCThing(cx, rt->jsPositiveInfinity)) {
-        return JS_FALSE;
-    }
-
-    u.s.hi = JSDOUBLE_HI32_SIGNBIT | JSDOUBLE_HI32_EXPMASK;
-    u.s.lo = 0x00000000;
-    number_constants[NC_NEGATIVE_INFINITY].dval = u.d;
-    rt->jsNegativeInfinity = js_NewDouble(cx, u.d);
-    if (!rt->jsNegativeInfinity ||
-        !js_LockGCThing(cx, rt->jsNegativeInfinity)) {
-        return JS_FALSE;
-    }
-
-    u.s.hi = 0;
-    u.s.lo = 1;
-    number_constants[NC_MIN_VALUE].dval = u.d;
-
-    return JS_TRUE;
-}
-
-void
-js_FinishRuntimeNumberState(JSContext *cx)
-{
-    JSRuntime *rt = cx->runtime;
-
-    js_UnlockGCThingRT(rt, rt->jsNaN);
-    js_UnlockGCThingRT(rt, rt->jsNegativeInfinity);
-    js_UnlockGCThingRT(rt, rt->jsPositiveInfinity);
-
-    rt->jsNaN = NULL;
-    rt->jsNegativeInfinity = NULL;
-    rt->jsPositiveInfinity = NULL;
-}
-
-JSObject *
-js_InitNumberClass(JSContext *cx, JSObject *obj)
-{
-    JSObject *proto, *ctor;
-    JSRuntime *rt;
-
-    /* XXX must do at least once per new thread, so do it per JSContext... */
-    FIX_FPU();
-
-    if (!JS_DefineFunctions(cx, obj, number_functions))
-	return NULL;
-
-    proto = JS_InitClass(cx, obj, NULL, &number_class, Number, 1,
-			 NULL, number_methods, NULL, NULL);
-    if (!proto || !(ctor = JS_GetConstructor(cx, proto)))
-	return NULL;
-    OBJ_SET_SLOT(cx, proto, JSSLOT_PRIVATE, JSVAL_ZERO);
-    if (!JS_DefineConstDoubles(cx, ctor, number_constants))
-	return NULL;
-
-    /* ECMA 15.1.1.1 */
-    rt = cx->runtime;
-    if (!JS_DefineProperty(cx, obj, js_NaN_str, DOUBLE_TO_JSVAL(rt->jsNaN),
-			   NULL, NULL, JSPROP_PERMANENT)) {
-	return NULL;
-    }
-
-    /* ECMA 15.1.1.2 */
-    if (!JS_DefineProperty(cx, obj, js_Infinity_str,
-			   DOUBLE_TO_JSVAL(rt->jsPositiveInfinity),
-			   NULL, NULL, JSPROP_PERMANENT)) {
-	return NULL;
-    }
-    return proto;
-}
-
-jsdouble *
-js_NewDouble(JSContext *cx, jsdouble d)
-{
-    jsdouble *dp;
-
-    dp = (jsdouble *) js_AllocGCThing(cx, GCX_DOUBLE);
-    if (!dp)
-	return NULL;
-    *dp = d;
-    return dp;
-}
-
-void
-js_FinalizeDouble(JSContext *cx, jsdouble *dp)
-{
-    *dp = NaN;
-}
-
-JSBool
-js_NewDoubleValue(JSContext *cx, jsdouble d, jsval *rval)
-{
-    jsdouble *dp;
-
-    dp = js_NewDouble(cx, d);
-    if (!dp)
-	return JS_FALSE;
-    *rval = DOUBLE_TO_JSVAL(dp);
-    return JS_TRUE;
-}
-
-JSBool
-js_NewNumberValue(JSContext *cx, jsdouble d, jsval *rval)
-{
-    jsint i;
-    JSBool ok;
-
-    SET_FPU();
-
-    if (JSDOUBLE_IS_INT(d, i) && INT_FITS_IN_JSVAL(i)) {
-	*rval = INT_TO_JSVAL(i);
-        ok = JS_TRUE;
-    } else {
-        ok = js_NewDoubleValue(cx, d, rval);
-    }
-    
-    RESTORE_FPU();
-    return ok;
-}
-
-JSObject *
-js_NumberToObject(JSContext *cx, jsdouble d)
-{
-    JSObject *obj;
-    jsval v;
-
-    obj = js_NewObject(cx, &number_class, NULL, NULL);
-    if (!obj)
-	return NULL;
-    if (!js_NewNumberValue(cx, d, &v)) {
-	cx->newborn[GCX_OBJECT] = NULL;
-	return NULL;
-    }
-    OBJ_SET_SLOT(cx, obj, JSSLOT_PRIVATE, v);
-    return obj;
-}
-
-JSString *
-js_NumberToString(JSContext *cx, jsdouble d)
-{
-    jsint i;
-    char buf[DTOSTR_STANDARD_BUFFER_SIZE];
-    char *numStr;
-
-    if (JSDOUBLE_IS_INT(d, i))
-	numStr = IntToString(i, buf, sizeof buf);
-    else {
-	numStr = JS_dtostr(buf, sizeof buf, DTOSTR_STANDARD, 0, d);
-	if (!numStr) {
-	    JS_ReportOutOfMemory(cx);
-	    return NULL;
-	}
-    }
-    return JS_NewStringCopyZ(cx, numStr);
-}
-
-JSBool
-js_ValueToNumber(JSContext *cx, jsval v, jsdouble *dp)
-{
-    JSObject *obj;
-    JSString *str;
-    const jschar *bp, *ep;
-
-    if (JSVAL_IS_OBJECT(v)) {
-	obj = JSVAL_TO_OBJECT(v);
-	if (!obj) {
-	    *dp = 0;
-	    return JS_TRUE;
-	}
-	if (!OBJ_DEFAULT_VALUE(cx, obj, JSTYPE_NUMBER, &v))
-	    return JS_FALSE;
-    }
-    if (JSVAL_IS_INT(v)) {
-	*dp = (jsdouble)JSVAL_TO_INT(v);
-    } else if (JSVAL_IS_DOUBLE(v)) {
-	*dp = *JSVAL_TO_DOUBLE(v);
-    } else if (JSVAL_IS_STRING(v)) {
-	str = JSVAL_TO_STRING(v);
-	/*
-         * Note that ECMA doesn't treat a string beginning with a '0' as an
-         * octal number here.  This works because all such numbers will be
-         * interpreted as decimal by js_strtod and will never get passed to
-         * js_strtointeger (which would interpret them as octal).
-         */
-        /* XXXbe js_strtod shouldn't require NUL termination */
-        bp = js_UndependString(cx, str);
-        if (!bp)
-            return JS_FALSE;
-        if ((!js_strtod(cx, bp, &ep, dp) ||
-             js_SkipWhiteSpace(ep) != bp + str->length) &&
-	    (!js_strtointeger(cx, bp, &ep, 0, dp) ||
-             js_SkipWhiteSpace(ep) != bp + str->length)) {
-	    goto badstr;
-	}
-    } else if (JSVAL_IS_BOOLEAN(v)) {
-	*dp = JSVAL_TO_BOOLEAN(v) ? 1 : 0;
-    } else {
-#if JS_BUG_FALLIBLE_TONUM
-	str = js_DecompileValueGenerator(cx, JSDVG_SEARCH_STACK, v, NULL);
-badstr:
-	if (str) {
-	    JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_NAN,
-				 JS_GetStringBytes(str));
-
-	}
-	return JS_FALSE;
-#else
-badstr:
-	*dp = *cx->runtime->jsNaN;
-#endif
-    }
-    return JS_TRUE;
-}
-
-JSBool
-js_ValueToECMAInt32(JSContext *cx, jsval v, int32 *ip)
-{
-    jsdouble d;
-
-    if (!js_ValueToNumber(cx, v, &d))
-	return JS_FALSE;
-    return js_DoubleToECMAInt32(cx, d, ip);
-}
-
-JSBool
-js_DoubleToECMAInt32(JSContext *cx, jsdouble d, int32 *ip)
-{
-    jsdouble two32 = 4294967296.0;
-    jsdouble two31 = 2147483648.0;
-
-    if (!JSDOUBLE_IS_FINITE(d) || d == 0) {
-        *ip = 0;
-        return JS_TRUE;
-    }
-    d = fmod(d, two32);
-    d = (d >= 0) ? floor(d) : ceil(d) + two32;
-    if (d >= two31)
-        *ip = (int32)(d - two32);
-    else
-        *ip = (int32)d;
-    return JS_TRUE;
-}
-
-JSBool
-js_ValueToECMAUint32(JSContext *cx, jsval v, uint32 *ip)
-{
-    jsdouble d;
-
-    if (!js_ValueToNumber(cx, v, &d))
-	return JS_FALSE;
-    return js_DoubleToECMAUint32(cx, d, ip);
-}
-
-JSBool
-js_DoubleToECMAUint32(JSContext *cx, jsdouble d, uint32 *ip)
-{
-    JSBool neg;
-    jsdouble two32 = 4294967296.0;
-
-    if (!JSDOUBLE_IS_FINITE(d) || d == 0) {
-	*ip = 0;
-	return JS_TRUE;
-    }
-
-    neg = (d < 0);
-    d = floor(neg ? -d : d);
-    d = neg ? -d : d;
-
-    d = fmod(d, two32);
-
-    d = (d >= 0) ? d : d + two32;
-    *ip = (uint32)d;
-    return JS_TRUE;
-}
-
-JSBool
-js_ValueToInt32(JSContext *cx, jsval v, int32 *ip)
-{
-    jsdouble d;
-    JSString *str;
-
-    if (JSVAL_IS_INT(v)) {
-        *ip = JSVAL_TO_INT(v);
-        return JS_TRUE;
-    }
-    if (!js_ValueToNumber(cx, v, &d))
-	return JS_FALSE;
-    if (JSDOUBLE_IS_NaN(d) || d <= -2147483649.0 || 2147483648.0 <= d) {
-	str = js_DecompileValueGenerator(cx, JSDVG_SEARCH_STACK, v, NULL);
-	if (str) {
-	    JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
-				 JSMSG_CANT_CONVERT, JS_GetStringBytes(str));
-
-	}
-	return JS_FALSE;
-    }
-    *ip = (int32)floor(d + 0.5);     /* Round to nearest */
-    return JS_TRUE;
-}
-
-JSBool
-js_ValueToUint16(JSContext *cx, jsval v, uint16 *ip)
-{
-    jsdouble d;
-    jsuint i, m;
-    JSBool neg;
-
-    if (!js_ValueToNumber(cx, v, &d))
-	return JS_FALSE;
-    if (d == 0 || !JSDOUBLE_IS_FINITE(d)) {
-	*ip = 0;
-	return JS_TRUE;
-    }
-    i = (jsuint)d;
-    if ((jsdouble)i == d) {
-	*ip = (uint16)i;
-	return JS_TRUE;
-    }
-    neg = (d < 0);
-    d = floor(neg ? -d : d);
-    d = neg ? -d : d;
-    m = JS_BIT(16);
-    d = fmod(d, (double)m);
-    if (d < 0)
-	d += m;
-    *ip = (uint16) d;
-    return JS_TRUE;
-}
-
-jsdouble
-js_DoubleToInteger(jsdouble d)
-{
-    JSBool neg;
-
-    if (d == 0)
-	return d;
-    if (!JSDOUBLE_IS_FINITE(d)) {
-	if (JSDOUBLE_IS_NaN(d))
-	    return 0;
-	return d;
-    }
-    neg = (d < 0);
-    d = floor(neg ? -d : d);
-    return neg ? -d : d;
-}
-
-
-JSBool
-js_strtod(JSContext *cx, const jschar *s, const jschar **ep, jsdouble *dp)
-{
-    char cbuf[32];
-    size_t i;
-    char *cstr, *istr, *estr;
-    JSBool negative;
-    jsdouble d;
-    const jschar *s1 = js_SkipWhiteSpace(s);
-    size_t length = js_strlen(s1);
-
-    /* Use cbuf to avoid malloc */
-    if (length >= sizeof cbuf) {
-        cstr = (char *) JS_malloc(cx, length + 1);
-        if (!cstr)
-           return JS_FALSE;
-    } else {
-        cstr = cbuf;
-    }
-   
-    for (i = 0; i <= length; i++) {
-        if (s1[i] >> 8) {
-            cstr[i] = 0;
-            break;
-        }
-        cstr[i] = (char)s1[i];
-    }
-
-    istr = cstr;
-    if ((negative = (*istr == '-')) != 0 || *istr == '+')
-        istr++;
-    if (!strncmp(istr, js_Infinity_str, sizeof js_Infinity_str - 1)) {
-        d = *(negative ? cx->runtime->jsNegativeInfinity : cx->runtime->jsPositiveInfinity);
-        estr = istr + 8;
-    } else {
-        int err;
-        d = JS_strtod(cstr, &estr, &err);
-        if (err == JS_DTOA_ENOMEM) {
-            JS_ReportOutOfMemory(cx);
-            if (cstr != cbuf)
-                JS_free(cx, cstr);
-            return JS_FALSE;
-        }
-        if (err == JS_DTOA_ERANGE) {
-            if (d == HUGE_VAL)
-                d = *cx->runtime->jsPositiveInfinity;
-            else if (d == -HUGE_VAL)
-                d = *cx->runtime->jsNegativeInfinity;
-        }
-#ifdef HPUX
-        if (d == 0.0 && negative) {
-            /*
-             * "-0", "-1e-2000" come out as positive zero
-             * here on HPUX. Force a negative zero instead.
-             */
-            JSDOUBLE_HI32(d) = JSDOUBLE_HI32_SIGNBIT;
-            JSDOUBLE_LO32(d) = 0;
-        }
-#endif
-    }
-
-    i = estr - cstr;
-    if (cstr != cbuf)
-        JS_free(cx, cstr);
-    *ep = i ? s1 + i : s;
-    *dp = d;
-    return JS_TRUE;
-}
-
-struct BinaryDigitReader
-{
-    uintN base;                 /* Base of number; must be a power of 2 */
-    uintN digit;                /* Current digit value in radix given by base */
-    uintN digitMask;            /* Mask to extract the next bit from digit */
-    const jschar *digits;       /* Pointer to the remaining digits */
-    const jschar *end;          /* Pointer to first non-digit */
-};
-
-/* Return the next binary digit from the number or -1 if done */
-static intN GetNextBinaryDigit(struct BinaryDigitReader *bdr)
-{
-    intN bit;
-
-    if (bdr->digitMask == 0) {
-        uintN c;
-
-        if (bdr->digits == bdr->end)
-            return -1;
-
-        c = *bdr->digits++;
-        if ('0' <= c && c <= '9')
-            bdr->digit = c - '0';
-        else if ('a' <= c && c <= 'z')
-            bdr->digit = c - 'a' + 10;
-        else bdr->digit = c - 'A' + 10;
-        bdr->digitMask = bdr->base >> 1;
-    }
-    bit = (bdr->digit & bdr->digitMask) != 0;
-    bdr->digitMask >>= 1;
-    return bit;
-}
-
-JSBool
-js_strtointeger(JSContext *cx, const jschar *s, const jschar **ep, jsint base, jsdouble *dp)
-{
-    JSBool negative;
-    jsdouble value;
-    const jschar *start;
-    const jschar *s1 = js_SkipWhiteSpace(s);
-
-    if ((negative = (*s1 == '-')) != 0 || *s1 == '+')
-        s1++;
-
-    if (base == 0) {
-        /* No base supplied, or some base that evaluated to 0. */
-        if (*s1 == '0') {
-            /* It's either hex or octal; only increment char if str isn't '0' */
-            if (s1[1] == 'X' || s1[1] == 'x') { /* Hex */
-                s1 += 2;
-                base = 16;
-            } else {    /* Octal */
-                base = 8;
-            }
-        } else {
-            base = 10; /* Default to decimal. */
-        }
-    } else if (base == 16 && *s1 == '0' && (s1[1] == 'X' || s1[1] == 'x')) {
-        /* If base is 16, ignore hex prefix. */
-        s1 += 2;
-    }
-
-    /*
-     * Done with the preliminaries; find some prefix of the string that's
-     * a number in the given base.
-     */
-    start = s1; /* Mark - if string is empty, we return NaN. */
-    value = 0.0;
-    for (;;) {
-        uintN digit;
-        jschar c = *s1;
-        if ('0' <= c && c <= '9')
-            digit = c - '0';
-        else if ('a' <= c && c <= 'z')
-            digit = c - 'a' + 10;
-        else if ('A' <= c && c <= 'Z')
-            digit = c - 'A' + 10;
-        else
-            break;
-        if (digit >= (uintN)base)
-            break;
-        value = value * base + digit;
-        s1++;
-    }
-
-    if (value >= 9007199254740992.0) {
-        if (base == 10) {
-            /*
-             * If we're accumulating a decimal number and the number is >=
-             * 2^53, then the result from the repeated multiply-add above may
-             * be inaccurate.  Call JS_strtod to get the correct answer.
-             */
-            size_t i;
-            size_t length = s1 - start;
-            char *cstr = (char *) JS_malloc(cx, length + 1);
-            char *estr;
-            int err=0;
-
-            if (!cstr)
-                return JS_FALSE;
-            for (i = 0; i != length; i++)
-                cstr[i] = (char)start[i];
-            cstr[length] = 0;
-
-            value = JS_strtod(cstr, &estr, &err);
-            if (err == JS_DTOA_ENOMEM) {
-                JS_ReportOutOfMemory(cx);
-                JS_free(cx, cstr);
-                return JS_FALSE;
-            }
-            if (err == JS_DTOA_ERANGE && value == HUGE_VAL)
-                value = *cx->runtime->jsPositiveInfinity;
-            JS_free(cx, cstr);
-        } else if ((base & (base - 1)) == 0) {
-            /*
-             * The number may also be inaccurate for power-of-two bases.  This
-             * happens if the addition in value * base + digit causes a round-
-             * down to an even least significant mantissa bit when the first
-             * dropped bit is a one.  If any of the following digits in the
-             * number (which haven't been added in yet) are nonzero, then the
-             * correct action would have been to round up instead of down.  An
-             * example occurs when reading the number 0x1000000000000081, which
-             * rounds to 0x1000000000000000 instead of 0x1000000000000100.
-             */
-            struct BinaryDigitReader bdr;
-            intN bit, bit2;
-            intN j;
-
-            bdr.base = base;
-            bdr.digitMask = 0;
-            bdr.digits = start;
-            bdr.end = s1;
-            value = 0.0;
-
-            /* Skip leading zeros. */
-            do {
-                bit = GetNextBinaryDigit(&bdr);
-            } while (bit == 0);
-
-            if (bit == 1) {
-                /* Gather the 53 significant bits (including the leading 1) */
-                value = 1.0;
-                for (j = 52; j; j--) {
-                    bit = GetNextBinaryDigit(&bdr);
-                    if (bit < 0)
-                        goto done;
-                    value = value*2 + bit;
-                }
-                /* bit2 is the 54th bit (the first dropped from the mantissa) */
-                bit2 = GetNextBinaryDigit(&bdr);
-                if (bit2 >= 0) {
-                    jsdouble factor = 2.0;
-                    intN sticky = 0;  /* sticky is 1 if any bit beyond the 54th is 1 */
-                    intN bit3;
-
-                    while ((bit3 = GetNextBinaryDigit(&bdr)) >= 0) {
-                        sticky |= bit3;
-                        factor *= 2;
-                    }
-                    value += bit2 & (bit | sticky);
-                    value *= factor;
-                }
-              done:;
-            }
-        }
-    }
-    /* We don't worry about inaccurate numbers for any other base. */
-
-    if (s1 == start) {
-        *dp = 0.0;
-        *ep = s;
-    } else {
-        *dp = negative ? -value : value;
-        *ep = s1;
-    }
-    return JS_TRUE;
-}