mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
4479 lines
130 KiB
C++
4479 lines
130 KiB
C++
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
* vim: set ts=8 sw=4 et tw=99:
|
|
*
|
|
* ***** 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):
|
|
*
|
|
* 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 string type implementation.
|
|
*
|
|
* In order to avoid unnecessary js_LockGCThing/js_UnlockGCThing calls, these
|
|
* native methods store strings (possibly newborn) converted from their 'this'
|
|
* parameter and arguments on the stack: 'this' conversions at argv[-1], arg
|
|
* conversions at their index (argv[0], argv[1]). This is a legitimate method
|
|
* of rooting things that might lose their newborn root due to subsequent GC
|
|
* allocations in the same native method.
|
|
*/
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "jstypes.h"
|
|
#include "jsstdint.h"
|
|
#include "jsutil.h"
|
|
#include "jshash.h"
|
|
#include "jsprf.h"
|
|
#include "jsapi.h"
|
|
#include "jsarray.h"
|
|
#include "jsatom.h"
|
|
#include "jsbool.h"
|
|
#include "jsbuiltins.h"
|
|
#include "jscntxt.h"
|
|
#include "jsgc.h"
|
|
#include "jsinterp.h"
|
|
#include "jslock.h"
|
|
#include "jsnum.h"
|
|
#include "jsobj.h"
|
|
#include "jsopcode.h"
|
|
#include "jsprobes.h"
|
|
#include "jsregexp.h"
|
|
#include "jsscope.h"
|
|
#include "jsstaticcheck.h"
|
|
#include "jsstr.h"
|
|
#include "jsbit.h"
|
|
#include "jsvector.h"
|
|
#include "jsversion.h"
|
|
|
|
#include "jsinferinlines.h"
|
|
#include "jsinterpinlines.h"
|
|
#include "jsobjinlines.h"
|
|
#include "jsregexpinlines.h"
|
|
#include "jsautooplen.h" // generated headers last
|
|
|
|
#include "vm/GlobalObject.h"
|
|
#include "vm/StringObject-inl.h"
|
|
#include "vm/String-inl.h"
|
|
|
|
using namespace js;
|
|
using namespace js::gc;
|
|
using namespace js::types;
|
|
using namespace js::unicode;
|
|
|
|
#ifdef JS_TRACER
|
|
|
|
JSBool JS_FASTCALL
|
|
js_FlattenOnTrace(JSContext *cx, JSString* str)
|
|
{
|
|
return !!str->ensureLinear(cx);
|
|
}
|
|
JS_DEFINE_CALLINFO_2(extern, BOOL, js_FlattenOnTrace, CONTEXT, STRING, 0, nanojit::ACCSET_STORE_ANY)
|
|
|
|
#endif /* !JS_TRACER */
|
|
|
|
static JSLinearString *
|
|
ArgToRootedString(JSContext *cx, uintN argc, Value *vp, uintN arg)
|
|
{
|
|
if (arg >= argc)
|
|
return cx->runtime->atomState.typeAtoms[JSTYPE_VOID];
|
|
vp += 2 + arg;
|
|
|
|
if (!ToPrimitive(cx, JSTYPE_STRING, vp))
|
|
return NULL;
|
|
|
|
JSLinearString *str;
|
|
if (vp->isString()) {
|
|
str = vp->toString()->ensureLinear(cx);
|
|
} else if (vp->isBoolean()) {
|
|
str = cx->runtime->atomState.booleanAtoms[(int)vp->toBoolean()];
|
|
} else if (vp->isNull()) {
|
|
str = cx->runtime->atomState.nullAtom;
|
|
} else if (vp->isUndefined()) {
|
|
str = cx->runtime->atomState.typeAtoms[JSTYPE_VOID];
|
|
}
|
|
else {
|
|
str = NumberToString(cx, vp->toNumber());
|
|
if (!str)
|
|
return NULL;
|
|
vp->setString(str);
|
|
}
|
|
return str;
|
|
}
|
|
|
|
/*
|
|
* Forward declarations for URI encode/decode and helper routines
|
|
*/
|
|
static JSBool
|
|
str_decodeURI(JSContext *cx, uintN argc, Value *vp);
|
|
|
|
static JSBool
|
|
str_decodeURI_Component(JSContext *cx, uintN argc, Value *vp);
|
|
|
|
static JSBool
|
|
str_encodeURI(JSContext *cx, uintN argc, Value *vp);
|
|
|
|
static JSBool
|
|
str_encodeURI_Component(JSContext *cx, uintN argc, Value *vp);
|
|
|
|
static const uint32 INVALID_UTF8 = UINT32_MAX;
|
|
|
|
static uint32
|
|
Utf8ToOneUcs4Char(const uint8 *utf8Buffer, int utf8Length);
|
|
|
|
/*
|
|
* Global string methods
|
|
*/
|
|
|
|
|
|
/* ES5 B.2.1 */
|
|
static JSBool
|
|
str_escape(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
const char digits[] = {'0', '1', '2', '3', '4', '5', '6', '7',
|
|
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
|
|
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
|
|
size_t length = str->length();
|
|
const jschar *chars = str->chars();
|
|
|
|
static const uint8 shouldPassThrough[256] = {
|
|
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
0,0,0,0,0,0,0,0,0,0,1,1,0,1,1,1, /* !"#$%&'()*+,-./ */
|
|
1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0, /* 0123456789:;<=>? */
|
|
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, /* @ABCDEFGHIJKLMNO */
|
|
1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1, /* PQRSTUVWXYZ[\]^_ */
|
|
0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, /* `abcdefghijklmno */
|
|
1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0, /* pqrstuvwxyz{\}~ DEL */
|
|
};
|
|
|
|
/* In step 7, exactly 69 characters should pass through unencoded. */
|
|
#ifdef DEBUG
|
|
int count = 0;
|
|
for (uint i = 0; i < sizeof(shouldPassThrough); i++) {
|
|
if (shouldPassThrough[i]) {
|
|
count++;
|
|
}
|
|
}
|
|
JS_ASSERT(count == 69);
|
|
#endif
|
|
|
|
|
|
/* Take a first pass and see how big the result string will need to be. */
|
|
size_t newlength = length;
|
|
for (size_t i = 0; i < length; i++) {
|
|
jschar ch = chars[i];
|
|
if (ch < 128 && shouldPassThrough[ch])
|
|
continue;
|
|
|
|
/* The character will be encoded as %XX or %uXXXX. */
|
|
newlength += (ch < 256) ? 2 : 5;
|
|
|
|
/*
|
|
* This overflow test works because newlength is incremented by at
|
|
* most 5 on each iteration.
|
|
*/
|
|
if (newlength < length) {
|
|
js_ReportAllocationOverflow(cx);
|
|
return JS_FALSE;
|
|
}
|
|
}
|
|
|
|
if (newlength >= ~(size_t)0 / sizeof(jschar)) {
|
|
js_ReportAllocationOverflow(cx);
|
|
return JS_FALSE;
|
|
}
|
|
|
|
jschar *newchars = (jschar *) cx->malloc_((newlength + 1) * sizeof(jschar));
|
|
if (!newchars)
|
|
return JS_FALSE;
|
|
size_t i, ni;
|
|
for (i = 0, ni = 0; i < length; i++) {
|
|
jschar ch = chars[i];
|
|
if (ch < 128 && shouldPassThrough[ch]) {
|
|
newchars[ni++] = ch;
|
|
} else if (ch < 256) {
|
|
newchars[ni++] = '%';
|
|
newchars[ni++] = digits[ch >> 4];
|
|
newchars[ni++] = digits[ch & 0xF];
|
|
} else {
|
|
newchars[ni++] = '%';
|
|
newchars[ni++] = 'u';
|
|
newchars[ni++] = digits[ch >> 12];
|
|
newchars[ni++] = digits[(ch & 0xF00) >> 8];
|
|
newchars[ni++] = digits[(ch & 0xF0) >> 4];
|
|
newchars[ni++] = digits[ch & 0xF];
|
|
}
|
|
}
|
|
JS_ASSERT(ni == newlength);
|
|
newchars[newlength] = 0;
|
|
|
|
JSString *retstr = js_NewString(cx, newchars, newlength);
|
|
if (!retstr) {
|
|
cx->free_(newchars);
|
|
return JS_FALSE;
|
|
}
|
|
vp->setString(retstr);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
/* ES5 B.2.2 */
|
|
static JSBool
|
|
str_unescape(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return false;
|
|
|
|
size_t length = str->length();
|
|
const jschar *chars = str->chars();
|
|
|
|
/* Don't bother allocating less space for the new string. */
|
|
jschar *newchars = (jschar *) cx->malloc_((length + 1) * sizeof(jschar));
|
|
if (!newchars)
|
|
return false;
|
|
size_t ni = 0, i = 0;
|
|
while (i < length) {
|
|
jschar ch = chars[i++];
|
|
if (ch == '%') {
|
|
/* Incomplete escapes are interpreted as literal characters. */
|
|
if (i + 1 < length &&
|
|
JS7_ISHEX(chars[i]) && JS7_ISHEX(chars[i + 1]))
|
|
{
|
|
ch = JS7_UNHEX(chars[i]) * 16 + JS7_UNHEX(chars[i + 1]);
|
|
i += 2;
|
|
} else if (i + 4 < length && chars[i] == 'u' &&
|
|
JS7_ISHEX(chars[i + 1]) && JS7_ISHEX(chars[i + 2]) &&
|
|
JS7_ISHEX(chars[i + 3]) && JS7_ISHEX(chars[i + 4]))
|
|
{
|
|
ch = (((((JS7_UNHEX(chars[i + 1]) << 4)
|
|
+ JS7_UNHEX(chars[i + 2])) << 4)
|
|
+ JS7_UNHEX(chars[i + 3])) << 4)
|
|
+ JS7_UNHEX(chars[i + 4]);
|
|
i += 5;
|
|
}
|
|
}
|
|
newchars[ni++] = ch;
|
|
}
|
|
newchars[ni] = 0;
|
|
|
|
JSString *retstr = js_NewString(cx, newchars, ni);
|
|
if (!retstr) {
|
|
cx->free_(newchars);
|
|
return JS_FALSE;
|
|
}
|
|
vp->setString(retstr);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
#if JS_HAS_UNEVAL
|
|
static JSBool
|
|
str_uneval(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str;
|
|
|
|
str = js_ValueToSource(cx, argc != 0 ? vp[2] : UndefinedValue());
|
|
if (!str)
|
|
return JS_FALSE;
|
|
vp->setString(str);
|
|
return JS_TRUE;
|
|
}
|
|
#endif
|
|
|
|
const char js_escape_str[] = "escape";
|
|
const char js_unescape_str[] = "unescape";
|
|
#if JS_HAS_UNEVAL
|
|
const char js_uneval_str[] = "uneval";
|
|
#endif
|
|
const char js_decodeURI_str[] = "decodeURI";
|
|
const char js_encodeURI_str[] = "encodeURI";
|
|
const char js_decodeURIComponent_str[] = "decodeURIComponent";
|
|
const char js_encodeURIComponent_str[] = "encodeURIComponent";
|
|
|
|
static JSFunctionSpec string_functions[] = {
|
|
JS_FN(js_escape_str, str_escape, 1,0),
|
|
JS_FN(js_unescape_str, str_unescape, 1,0),
|
|
#if JS_HAS_UNEVAL
|
|
JS_FN(js_uneval_str, str_uneval, 1,0),
|
|
#endif
|
|
JS_FN(js_decodeURI_str, str_decodeURI, 1,0),
|
|
JS_FN(js_encodeURI_str, str_encodeURI, 1,0),
|
|
JS_FN(js_decodeURIComponent_str, str_decodeURI_Component, 1,0),
|
|
JS_FN(js_encodeURIComponent_str, str_encodeURI_Component, 1,0),
|
|
|
|
JS_FS_END
|
|
};
|
|
|
|
jschar js_empty_ucstr[] = {0};
|
|
JSSubString js_EmptySubString = {0, js_empty_ucstr};
|
|
|
|
#define STRING_ELEMENT_ATTRS (JSPROP_ENUMERATE|JSPROP_READONLY|JSPROP_PERMANENT)
|
|
|
|
static JSBool
|
|
str_enumerate(JSContext *cx, JSObject *obj)
|
|
{
|
|
JSString *str = obj->getPrimitiveThis().toString();
|
|
for (size_t i = 0, length = str->length(); i < length; i++) {
|
|
JSString *str1 = js_NewDependentString(cx, str, i, 1);
|
|
if (!str1)
|
|
return false;
|
|
if (!obj->defineProperty(cx, INT_TO_JSID(i), StringValue(str1),
|
|
PropertyStub, StrictPropertyStub,
|
|
STRING_ELEMENT_ATTRS)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_resolve(JSContext *cx, JSObject *obj, jsid id, uintN flags,
|
|
JSObject **objp)
|
|
{
|
|
if (!JSID_IS_INT(id))
|
|
return JS_TRUE;
|
|
|
|
JSString *str = obj->getPrimitiveThis().toString();
|
|
|
|
jsint slot = JSID_TO_INT(id);
|
|
if ((size_t)slot < str->length()) {
|
|
JSString *str1 = JSAtom::getUnitStringForElement(cx, str, size_t(slot));
|
|
if (!str1)
|
|
return JS_FALSE;
|
|
if (!obj->defineProperty(cx, id, StringValue(str1), NULL, NULL,
|
|
STRING_ELEMENT_ATTRS)) {
|
|
return JS_FALSE;
|
|
}
|
|
*objp = obj;
|
|
}
|
|
return JS_TRUE;
|
|
}
|
|
|
|
Class js::StringClass = {
|
|
js_String_str,
|
|
JSCLASS_HAS_RESERVED_SLOTS(StringObject::RESERVED_SLOTS) |
|
|
JSCLASS_NEW_RESOLVE | JSCLASS_HAS_CACHED_PROTO(JSProto_String),
|
|
PropertyStub, /* addProperty */
|
|
PropertyStub, /* delProperty */
|
|
PropertyStub, /* getProperty */
|
|
StrictPropertyStub, /* setProperty */
|
|
str_enumerate,
|
|
(JSResolveOp)str_resolve,
|
|
ConvertStub
|
|
};
|
|
|
|
/*
|
|
* Returns a JSString * for the |this| value associated with vp, or throws a
|
|
* TypeError if |this| is null or undefined. This algorithm is the same as
|
|
* calling CheckObjectCoercible(this), then returning ToString(this), as all
|
|
* String.prototype.* methods do (other than toString and valueOf).
|
|
*/
|
|
static JS_ALWAYS_INLINE JSString *
|
|
ThisToStringForStringProto(JSContext *cx, Value *vp)
|
|
{
|
|
JS_CHECK_RECURSION(cx, return NULL);
|
|
|
|
if (vp[1].isString())
|
|
return vp[1].toString();
|
|
|
|
if (vp[1].isObject()) {
|
|
JSObject *obj = &vp[1].toObject();
|
|
if (obj->isString() &&
|
|
ClassMethodIsNative(cx, obj,
|
|
&StringClass,
|
|
ATOM_TO_JSID(cx->runtime->atomState.toStringAtom),
|
|
js_str_toString))
|
|
{
|
|
vp[1] = obj->getPrimitiveThis();
|
|
return vp[1].toString();
|
|
}
|
|
} else if (vp[1].isNullOrUndefined()) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_CANT_CONVERT_TO,
|
|
vp[1].isNull() ? "null" : "undefined", "object");
|
|
return NULL;
|
|
}
|
|
|
|
JSString *str = js_ValueToString(cx, vp[1]);
|
|
if (!str)
|
|
return NULL;
|
|
vp[1].setString(str);
|
|
return str;
|
|
}
|
|
|
|
#if JS_HAS_TOSOURCE
|
|
|
|
/*
|
|
* String.prototype.quote is generic (as are most string methods), unlike
|
|
* toSource, toString, and valueOf.
|
|
*/
|
|
static JSBool
|
|
str_quote(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
str = js_QuoteString(cx, str, '"');
|
|
if (!str)
|
|
return false;
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_toSource(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str;
|
|
if (!GetPrimitiveThis(cx, vp, &str))
|
|
return false;
|
|
|
|
str = js_QuoteString(cx, str, '"');
|
|
if (!str)
|
|
return false;
|
|
|
|
char buf[16];
|
|
size_t j = JS_snprintf(buf, sizeof buf, "(new String(");
|
|
|
|
JS::Anchor<JSString *> anchor(str);
|
|
size_t k = str->length();
|
|
const jschar *s = str->getChars(cx);
|
|
if (!s)
|
|
return false;
|
|
|
|
size_t n = j + k + 2;
|
|
jschar *t = (jschar *) cx->malloc_((n + 1) * sizeof(jschar));
|
|
if (!t)
|
|
return false;
|
|
|
|
size_t i;
|
|
for (i = 0; i < j; i++)
|
|
t[i] = buf[i];
|
|
for (j = 0; j < k; i++, j++)
|
|
t[i] = s[j];
|
|
t[i++] = ')';
|
|
t[i++] = ')';
|
|
t[i] = 0;
|
|
|
|
str = js_NewString(cx, t, n);
|
|
if (!str) {
|
|
cx->free_(t);
|
|
return false;
|
|
}
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
#endif /* JS_HAS_TOSOURCE */
|
|
|
|
JSBool
|
|
js_str_toString(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str;
|
|
if (!GetPrimitiveThis(cx, vp, &str))
|
|
return false;
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Java-like string native methods.
|
|
*/
|
|
|
|
JS_ALWAYS_INLINE bool
|
|
ValueToIntegerRange(JSContext *cx, const Value &v, int32 *out)
|
|
{
|
|
if (v.isInt32()) {
|
|
*out = v.toInt32();
|
|
} else {
|
|
double d;
|
|
if (!ToInteger(cx, v, &d))
|
|
return false;
|
|
if (d > INT32_MAX)
|
|
*out = INT32_MAX;
|
|
else if (d < INT32_MIN)
|
|
*out = INT32_MIN;
|
|
else
|
|
*out = int32(d);
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_substring(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
int32 length, begin, end;
|
|
if (argc > 0) {
|
|
end = length = int32(str->length());
|
|
|
|
if (!ValueToIntegerRange(cx, vp[2], &begin))
|
|
return false;
|
|
|
|
if (begin < 0)
|
|
begin = 0;
|
|
else if (begin > length)
|
|
begin = length;
|
|
|
|
if (argc > 1 && !vp[3].isUndefined()) {
|
|
if (!ValueToIntegerRange(cx, vp[3], &end))
|
|
return false;
|
|
|
|
if (end > length) {
|
|
end = length;
|
|
} else {
|
|
if (end < 0)
|
|
end = 0;
|
|
if (end < begin) {
|
|
int32_t tmp = begin;
|
|
begin = end;
|
|
end = tmp;
|
|
}
|
|
}
|
|
}
|
|
|
|
str = js_NewDependentString(cx, str, size_t(begin), size_t(end - begin));
|
|
if (!str)
|
|
return false;
|
|
}
|
|
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
JSString* JS_FASTCALL
|
|
js_toLowerCase(JSContext *cx, JSString *str)
|
|
{
|
|
size_t n = str->length();
|
|
const jschar *s = str->getChars(cx);
|
|
if (!s)
|
|
return NULL;
|
|
|
|
jschar *news = (jschar *) cx->malloc_((n + 1) * sizeof(jschar));
|
|
if (!news)
|
|
return NULL;
|
|
for (size_t i = 0; i < n; i++)
|
|
news[i] = unicode::ToLowerCase(s[i]);
|
|
news[n] = 0;
|
|
str = js_NewString(cx, news, n);
|
|
if (!str) {
|
|
cx->free_(news);
|
|
return NULL;
|
|
}
|
|
return str;
|
|
}
|
|
|
|
static JSBool
|
|
str_toLowerCase(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
str = js_toLowerCase(cx, str);
|
|
if (!str)
|
|
return false;
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_toLocaleLowerCase(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
/*
|
|
* Forcefully ignore the first (or any) argument and return toLowerCase(),
|
|
* ECMA has reserved that argument, presumably for defining the locale.
|
|
*/
|
|
if (cx->localeCallbacks && cx->localeCallbacks->localeToLowerCase) {
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
return cx->localeCallbacks->localeToLowerCase(cx, str, Jsvalify(vp));
|
|
}
|
|
|
|
return str_toLowerCase(cx, 0, vp);
|
|
}
|
|
|
|
JSString* JS_FASTCALL
|
|
js_toUpperCase(JSContext *cx, JSString *str)
|
|
{
|
|
size_t n = str->length();
|
|
const jschar *s = str->getChars(cx);
|
|
if (!s)
|
|
return NULL;
|
|
jschar *news = (jschar *) cx->malloc_((n + 1) * sizeof(jschar));
|
|
if (!news)
|
|
return NULL;
|
|
for (size_t i = 0; i < n; i++)
|
|
news[i] = unicode::ToUpperCase(s[i]);
|
|
news[n] = 0;
|
|
str = js_NewString(cx, news, n);
|
|
if (!str) {
|
|
cx->free_(news);
|
|
return NULL;
|
|
}
|
|
return str;
|
|
}
|
|
|
|
static JSBool
|
|
str_toUpperCase(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
str = js_toUpperCase(cx, str);
|
|
if (!str)
|
|
return false;
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_toLocaleUpperCase(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
/*
|
|
* Forcefully ignore the first (or any) argument and return toUpperCase(),
|
|
* ECMA has reserved that argument, presumably for defining the locale.
|
|
*/
|
|
if (cx->localeCallbacks && cx->localeCallbacks->localeToUpperCase) {
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
return cx->localeCallbacks->localeToUpperCase(cx, str, Jsvalify(vp));
|
|
}
|
|
|
|
return str_toUpperCase(cx, 0, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_localeCompare(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
if (argc == 0) {
|
|
vp->setInt32(0);
|
|
} else {
|
|
JSString *thatStr = js_ValueToString(cx, vp[2]);
|
|
if (!thatStr)
|
|
return false;
|
|
if (cx->localeCallbacks && cx->localeCallbacks->localeCompare) {
|
|
vp[2].setString(thatStr);
|
|
return cx->localeCallbacks->localeCompare(cx, str, thatStr, Jsvalify(vp));
|
|
}
|
|
int32 result;
|
|
if (!CompareStrings(cx, str, thatStr, &result))
|
|
return false;
|
|
vp->setInt32(result);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
JSBool
|
|
js_str_charAt(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str;
|
|
jsint i;
|
|
if (vp[1].isString() && argc != 0 && vp[2].isInt32()) {
|
|
str = vp[1].toString();
|
|
i = vp[2].toInt32();
|
|
if ((size_t)i >= str->length())
|
|
goto out_of_range;
|
|
} else {
|
|
str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
double d = 0.0;
|
|
if (argc > 0 && !ToInteger(cx, vp[2], &d))
|
|
return false;
|
|
|
|
if (d < 0 || str->length() <= d)
|
|
goto out_of_range;
|
|
i = (jsint) d;
|
|
}
|
|
|
|
str = JSAtom::getUnitStringForElement(cx, str, size_t(i));
|
|
if (!str)
|
|
return false;
|
|
vp->setString(str);
|
|
return true;
|
|
|
|
out_of_range:
|
|
vp->setString(cx->runtime->emptyString);
|
|
return true;
|
|
}
|
|
|
|
JSBool
|
|
js_str_charCodeAt(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str;
|
|
jsint i;
|
|
if (vp[1].isString() && argc != 0 && vp[2].isInt32()) {
|
|
str = vp[1].toString();
|
|
i = vp[2].toInt32();
|
|
if ((size_t)i >= str->length())
|
|
goto out_of_range;
|
|
} else {
|
|
str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
double d = 0.0;
|
|
if (argc > 0 && !ToInteger(cx, vp[2], &d))
|
|
return false;
|
|
|
|
if (d < 0 || str->length() <= d)
|
|
goto out_of_range;
|
|
i = (jsint) d;
|
|
}
|
|
|
|
const jschar *chars;
|
|
chars = str->getChars(cx);
|
|
if (!chars)
|
|
return false;
|
|
|
|
vp->setInt32(chars[i]);
|
|
return true;
|
|
|
|
out_of_range:
|
|
vp->setDouble(js_NaN);
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Boyer-Moore-Horspool superlinear search for pat:patlen in text:textlen.
|
|
* The patlen argument must be positive and no greater than sBMHPatLenMax.
|
|
*
|
|
* Return the index of pat in text, or -1 if not found.
|
|
*/
|
|
static const jsuint sBMHCharSetSize = 256; /* ISO-Latin-1 */
|
|
static const jsuint sBMHPatLenMax = 255; /* skip table element is uint8 */
|
|
static const jsint sBMHBadPattern = -2; /* return value if pat is not ISO-Latin-1 */
|
|
|
|
jsint
|
|
js_BoyerMooreHorspool(const jschar *text, jsuint textlen,
|
|
const jschar *pat, jsuint patlen)
|
|
{
|
|
uint8 skip[sBMHCharSetSize];
|
|
|
|
JS_ASSERT(0 < patlen && patlen <= sBMHPatLenMax);
|
|
for (jsuint i = 0; i < sBMHCharSetSize; i++)
|
|
skip[i] = (uint8)patlen;
|
|
jsuint m = patlen - 1;
|
|
for (jsuint i = 0; i < m; i++) {
|
|
jschar c = pat[i];
|
|
if (c >= sBMHCharSetSize)
|
|
return sBMHBadPattern;
|
|
skip[c] = (uint8)(m - i);
|
|
}
|
|
jschar c;
|
|
for (jsuint k = m;
|
|
k < textlen;
|
|
k += ((c = text[k]) >= sBMHCharSetSize) ? patlen : skip[c]) {
|
|
for (jsuint i = k, j = m; ; i--, j--) {
|
|
if (text[i] != pat[j])
|
|
break;
|
|
if (j == 0)
|
|
return static_cast<jsint>(i); /* safe: max string size */
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
struct MemCmp {
|
|
typedef jsuint Extent;
|
|
static JS_ALWAYS_INLINE Extent computeExtent(const jschar *, jsuint patlen) {
|
|
return (patlen - 1) * sizeof(jschar);
|
|
}
|
|
static JS_ALWAYS_INLINE bool match(const jschar *p, const jschar *t, Extent extent) {
|
|
return memcmp(p, t, extent) == 0;
|
|
}
|
|
};
|
|
|
|
struct ManualCmp {
|
|
typedef const jschar *Extent;
|
|
static JS_ALWAYS_INLINE Extent computeExtent(const jschar *pat, jsuint patlen) {
|
|
return pat + patlen;
|
|
}
|
|
static JS_ALWAYS_INLINE bool match(const jschar *p, const jschar *t, Extent extent) {
|
|
for (; p != extent; ++p, ++t) {
|
|
if (*p != *t)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
};
|
|
|
|
template <class InnerMatch>
|
|
static jsint
|
|
UnrolledMatch(const jschar *text, jsuint textlen, const jschar *pat, jsuint patlen)
|
|
{
|
|
JS_ASSERT(patlen > 0 && textlen > 0);
|
|
const jschar *textend = text + textlen - (patlen - 1);
|
|
const jschar p0 = *pat;
|
|
const jschar *const patNext = pat + 1;
|
|
const typename InnerMatch::Extent extent = InnerMatch::computeExtent(pat, patlen);
|
|
uint8 fixup;
|
|
|
|
const jschar *t = text;
|
|
switch ((textend - t) & 7) {
|
|
case 0: if (*t++ == p0) { fixup = 8; goto match; }
|
|
case 7: if (*t++ == p0) { fixup = 7; goto match; }
|
|
case 6: if (*t++ == p0) { fixup = 6; goto match; }
|
|
case 5: if (*t++ == p0) { fixup = 5; goto match; }
|
|
case 4: if (*t++ == p0) { fixup = 4; goto match; }
|
|
case 3: if (*t++ == p0) { fixup = 3; goto match; }
|
|
case 2: if (*t++ == p0) { fixup = 2; goto match; }
|
|
case 1: if (*t++ == p0) { fixup = 1; goto match; }
|
|
}
|
|
while (t != textend) {
|
|
if (t[0] == p0) { t += 1; fixup = 8; goto match; }
|
|
if (t[1] == p0) { t += 2; fixup = 7; goto match; }
|
|
if (t[2] == p0) { t += 3; fixup = 6; goto match; }
|
|
if (t[3] == p0) { t += 4; fixup = 5; goto match; }
|
|
if (t[4] == p0) { t += 5; fixup = 4; goto match; }
|
|
if (t[5] == p0) { t += 6; fixup = 3; goto match; }
|
|
if (t[6] == p0) { t += 7; fixup = 2; goto match; }
|
|
if (t[7] == p0) { t += 8; fixup = 1; goto match; }
|
|
t += 8;
|
|
continue;
|
|
do {
|
|
if (*t++ == p0) {
|
|
match:
|
|
if (!InnerMatch::match(patNext, t, extent))
|
|
goto failed_match;
|
|
return t - text - 1;
|
|
}
|
|
failed_match:;
|
|
} while (--fixup > 0);
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
static JS_ALWAYS_INLINE jsint
|
|
StringMatch(const jschar *text, jsuint textlen,
|
|
const jschar *pat, jsuint patlen)
|
|
{
|
|
if (patlen == 0)
|
|
return 0;
|
|
if (textlen < patlen)
|
|
return -1;
|
|
|
|
#if defined(__i386__) || defined(_M_IX86) || defined(__i386)
|
|
/*
|
|
* Given enough registers, the unrolled loop below is faster than the
|
|
* following loop. 32-bit x86 does not have enough registers.
|
|
*/
|
|
if (patlen == 1) {
|
|
const jschar p0 = *pat;
|
|
for (const jschar *c = text, *end = text + textlen; c != end; ++c) {
|
|
if (*c == p0)
|
|
return c - text;
|
|
}
|
|
return -1;
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* If the text or pattern string is short, BMH will be more expensive than
|
|
* the basic linear scan due to initialization cost and a more complex loop
|
|
* body. While the correct threshold is input-dependent, we can make a few
|
|
* conservative observations:
|
|
* - When |textlen| is "big enough", the initialization time will be
|
|
* proportionally small, so the worst-case slowdown is minimized.
|
|
* - When |patlen| is "too small", even the best case for BMH will be
|
|
* slower than a simple scan for large |textlen| due to the more complex
|
|
* loop body of BMH.
|
|
* From this, the values for "big enough" and "too small" are determined
|
|
* empirically. See bug 526348.
|
|
*/
|
|
if (textlen >= 512 && patlen >= 11 && patlen <= sBMHPatLenMax) {
|
|
jsint index = js_BoyerMooreHorspool(text, textlen, pat, patlen);
|
|
if (index != sBMHBadPattern)
|
|
return index;
|
|
}
|
|
|
|
/*
|
|
* For big patterns with large potential overlap we want the SIMD-optimized
|
|
* speed of memcmp. For small patterns, a simple loop is faster.
|
|
*
|
|
* FIXME: Linux memcmp performance is sad and the manual loop is faster.
|
|
*/
|
|
return
|
|
#if !defined(__linux__)
|
|
patlen > 128 ? UnrolledMatch<MemCmp>(text, textlen, pat, patlen)
|
|
:
|
|
#endif
|
|
UnrolledMatch<ManualCmp>(text, textlen, pat, patlen);
|
|
}
|
|
|
|
static const size_t sRopeMatchThresholdRatioLog2 = 5;
|
|
|
|
/*
|
|
* RopeMatch takes the text to search, the patern to search for in the text.
|
|
* RopeMatch returns false on OOM and otherwise returns the match index through
|
|
* the 'match' outparam (-1 for not found).
|
|
*/
|
|
static bool
|
|
RopeMatch(JSContext *cx, JSString *textstr, const jschar *pat, jsuint patlen, jsint *match)
|
|
{
|
|
JS_ASSERT(textstr->isRope());
|
|
|
|
if (patlen == 0) {
|
|
*match = 0;
|
|
return true;
|
|
}
|
|
if (textstr->length() < patlen) {
|
|
*match = -1;
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* List of leaf nodes in the rope. If we run out of memory when trying to
|
|
* append to this list, we can still fall back to StringMatch, so use the
|
|
* system allocator so we don't report OOM in that case.
|
|
*/
|
|
Vector<JSLinearString *, 16, SystemAllocPolicy> strs;
|
|
|
|
/*
|
|
* We don't want to do rope matching if there is a poor node-to-char ratio,
|
|
* since this means spending a lot of time in the match loop below. We also
|
|
* need to build the list of leaf nodes. Do both here: iterate over the
|
|
* nodes so long as there are not too many.
|
|
*/
|
|
{
|
|
size_t textstrlen = textstr->length();
|
|
size_t threshold = textstrlen >> sRopeMatchThresholdRatioLog2;
|
|
StringSegmentRange r(cx);
|
|
if (!r.init(textstr))
|
|
return false;
|
|
while (!r.empty()) {
|
|
if (threshold-- == 0 || !strs.append(r.front())) {
|
|
const jschar *chars = textstr->getChars(cx);
|
|
if (!chars)
|
|
return false;
|
|
*match = StringMatch(chars, textstrlen, pat, patlen);
|
|
return true;
|
|
}
|
|
if (!r.popFront())
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* Absolute offset from the beginning of the logical string textstr. */
|
|
jsint pos = 0;
|
|
|
|
// TODO: consider branching to a simple loop if patlen == 1
|
|
|
|
for (JSLinearString **outerp = strs.begin(); outerp != strs.end(); ++outerp) {
|
|
/* First try to match without spanning two nodes. */
|
|
JSLinearString *outer = *outerp;
|
|
const jschar *chars = outer->chars();
|
|
size_t len = outer->length();
|
|
jsint matchResult = StringMatch(chars, len, pat, patlen);
|
|
if (matchResult != -1) {
|
|
*match = pos + matchResult;
|
|
return true;
|
|
}
|
|
|
|
/* Test the overlap. */
|
|
JSLinearString **innerp = outerp;
|
|
|
|
/*
|
|
* Start searching at the first place where StringMatch wouldn't have
|
|
* found the match.
|
|
*/
|
|
const jschar *const text = chars + (patlen > len ? 0 : len - patlen + 1);
|
|
const jschar *const textend = chars + len;
|
|
const jschar p0 = *pat;
|
|
const jschar *const p1 = pat + 1;
|
|
const jschar *const patend = pat + patlen;
|
|
for (const jschar *t = text; t != textend; ) {
|
|
if (*t++ != p0)
|
|
continue;
|
|
const jschar *ttend = textend;
|
|
for (const jschar *pp = p1, *tt = t; pp != patend; ++pp, ++tt) {
|
|
while (tt == ttend) {
|
|
if (++innerp == strs.end()) {
|
|
*match = -1;
|
|
return true;
|
|
}
|
|
JSLinearString *inner = *innerp;
|
|
tt = inner->chars();
|
|
ttend = tt + inner->length();
|
|
}
|
|
if (*pp != *tt)
|
|
goto break_continue;
|
|
}
|
|
|
|
/* Matched! */
|
|
*match = pos + (t - chars) - 1; /* -1 because of *t++ above */
|
|
return true;
|
|
|
|
break_continue:;
|
|
}
|
|
|
|
pos += len;
|
|
}
|
|
|
|
*match = -1;
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_indexOf(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
JSLinearString *patstr = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!patstr)
|
|
return false;
|
|
|
|
jsuint textlen = str->length();
|
|
const jschar *text = str->getChars(cx);
|
|
if (!text)
|
|
return false;
|
|
|
|
jsuint patlen = patstr->length();
|
|
const jschar *pat = patstr->chars();
|
|
|
|
jsuint start;
|
|
if (argc > 1) {
|
|
if (vp[3].isInt32()) {
|
|
jsint i = vp[3].toInt32();
|
|
if (i <= 0) {
|
|
start = 0;
|
|
} else if (jsuint(i) > textlen) {
|
|
start = textlen;
|
|
textlen = 0;
|
|
} else {
|
|
start = i;
|
|
text += start;
|
|
textlen -= start;
|
|
}
|
|
} else {
|
|
jsdouble d;
|
|
if (!ToInteger(cx, vp[3], &d))
|
|
return false;
|
|
if (d <= 0) {
|
|
start = 0;
|
|
} else if (d > textlen) {
|
|
start = textlen;
|
|
textlen = 0;
|
|
} else {
|
|
start = (jsint)d;
|
|
text += start;
|
|
textlen -= start;
|
|
}
|
|
}
|
|
} else {
|
|
start = 0;
|
|
}
|
|
|
|
jsint match = StringMatch(text, textlen, pat, patlen);
|
|
vp->setInt32((match == -1) ? -1 : start + match);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_lastIndexOf(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *textstr = ThisToStringForStringProto(cx, vp);
|
|
if (!textstr)
|
|
return false;
|
|
size_t textlen = textstr->length();
|
|
const jschar *text = textstr->getChars(cx);
|
|
if (!text)
|
|
return false;
|
|
|
|
JSLinearString *patstr = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!patstr)
|
|
return false;
|
|
|
|
size_t patlen = patstr->length();
|
|
const jschar *pat = patstr->chars();
|
|
|
|
jsint i = textlen - patlen; // Start searching here
|
|
if (i < 0) {
|
|
vp->setInt32(-1);
|
|
return true;
|
|
}
|
|
|
|
if (argc > 1) {
|
|
if (vp[3].isInt32()) {
|
|
jsint j = vp[3].toInt32();
|
|
if (j <= 0)
|
|
i = 0;
|
|
else if (j < i)
|
|
i = j;
|
|
} else {
|
|
double d;
|
|
if (!ToNumber(cx, vp[3], &d))
|
|
return false;
|
|
if (!JSDOUBLE_IS_NaN(d)) {
|
|
d = js_DoubleToInteger(d);
|
|
if (d <= 0)
|
|
i = 0;
|
|
else if (d < i)
|
|
i = (jsint)d;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (patlen == 0) {
|
|
vp->setInt32(i);
|
|
return true;
|
|
}
|
|
|
|
const jschar *t = text + i;
|
|
const jschar *textend = text - 1;
|
|
const jschar p0 = *pat;
|
|
const jschar *patNext = pat + 1;
|
|
const jschar *patEnd = pat + patlen;
|
|
|
|
for (; t != textend; --t) {
|
|
if (*t == p0) {
|
|
const jschar *t1 = t + 1;
|
|
for (const jschar *p1 = patNext; p1 != patEnd; ++p1, ++t1) {
|
|
if (*t1 != *p1)
|
|
goto break_continue;
|
|
}
|
|
vp->setInt32(t - text);
|
|
return true;
|
|
}
|
|
break_continue:;
|
|
}
|
|
|
|
vp->setInt32(-1);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
js_TrimString(JSContext *cx, Value *vp, JSBool trimLeft, JSBool trimRight)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
size_t length = str->length();
|
|
const jschar *chars = str->getChars(cx);
|
|
if (!chars)
|
|
return false;
|
|
|
|
size_t begin = 0;
|
|
size_t end = length;
|
|
|
|
if (trimLeft) {
|
|
while (begin < length && unicode::IsSpace(chars[begin]))
|
|
++begin;
|
|
}
|
|
|
|
if (trimRight) {
|
|
while (end > begin && unicode::IsSpace(chars[end - 1]))
|
|
--end;
|
|
}
|
|
|
|
str = js_NewDependentString(cx, str, begin, end - begin);
|
|
if (!str)
|
|
return false;
|
|
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_trim(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return js_TrimString(cx, vp, JS_TRUE, JS_TRUE);
|
|
}
|
|
|
|
static JSBool
|
|
str_trimLeft(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return js_TrimString(cx, vp, JS_TRUE, JS_FALSE);
|
|
}
|
|
|
|
static JSBool
|
|
str_trimRight(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return js_TrimString(cx, vp, JS_FALSE, JS_TRUE);
|
|
}
|
|
|
|
/*
|
|
* Perl-inspired string functions.
|
|
*/
|
|
|
|
/* Result of a successfully performed flat match. */
|
|
class FlatMatch
|
|
{
|
|
JSLinearString *patstr;
|
|
const jschar *pat;
|
|
size_t patlen;
|
|
int32 match_;
|
|
|
|
friend class RegExpGuard;
|
|
|
|
public:
|
|
FlatMatch() : patstr(NULL) {} /* Old GCC wants this initialization. */
|
|
JSString *pattern() const { return patstr; }
|
|
size_t patternLength() const { return patlen; }
|
|
|
|
/*
|
|
* Note: The match is -1 when the match is performed successfully,
|
|
* but no match is found.
|
|
*/
|
|
int32 match() const { return match_; }
|
|
};
|
|
|
|
/* A regexp and optional associated object. */
|
|
class RegExpPair
|
|
{
|
|
AutoRefCount<RegExp> re_;
|
|
JSObject *reobj_;
|
|
|
|
explicit RegExpPair(RegExpPair &);
|
|
|
|
public:
|
|
explicit RegExpPair(JSContext *cx) : re_(cx) {}
|
|
|
|
void reset(JSObject &obj) {
|
|
reobj_ = &obj;
|
|
RegExp *re = RegExp::extractFrom(reobj_);
|
|
JS_ASSERT(re);
|
|
re_.reset(NeedsIncRef<RegExp>(re));
|
|
}
|
|
|
|
void reset(AlreadyIncRefed<RegExp> re) {
|
|
reobj_ = NULL;
|
|
re_.reset(re);
|
|
}
|
|
|
|
/* Note: May be null. */
|
|
JSObject *reobj() const { return reobj_; }
|
|
bool hasRegExp() const { return !re_.null(); }
|
|
RegExp &re() const { JS_ASSERT(hasRegExp()); return *re_; }
|
|
};
|
|
|
|
/*
|
|
* RegExpGuard factors logic out of String regexp operations.
|
|
*
|
|
* @param optarg Indicates in which argument position RegExp
|
|
* flags will be found, if present. This is a Mozilla
|
|
* extension and not part of any ECMA spec.
|
|
*/
|
|
class RegExpGuard
|
|
{
|
|
RegExpGuard(const RegExpGuard &);
|
|
void operator=(const RegExpGuard &);
|
|
|
|
JSContext *cx;
|
|
RegExpPair rep;
|
|
FlatMatch fm;
|
|
|
|
/*
|
|
* Upper bound on the number of characters we are willing to potentially
|
|
* waste on searching for RegExp meta-characters.
|
|
*/
|
|
static const size_t MAX_FLAT_PAT_LEN = 256;
|
|
|
|
static JSString *flattenPattern(JSContext *cx, JSLinearString *patstr) {
|
|
StringBuffer sb(cx);
|
|
if (!sb.reserve(patstr->length()))
|
|
return NULL;
|
|
|
|
static const jschar ESCAPE_CHAR = '\\';
|
|
const jschar *chars = patstr->chars();
|
|
size_t len = patstr->length();
|
|
for (const jschar *it = chars; it != chars + len; ++it) {
|
|
if (RegExp::isMetaChar(*it)) {
|
|
if (!sb.append(ESCAPE_CHAR) || !sb.append(*it))
|
|
return NULL;
|
|
} else {
|
|
if (!sb.append(*it))
|
|
return NULL;
|
|
}
|
|
}
|
|
return sb.finishString();
|
|
}
|
|
|
|
public:
|
|
explicit RegExpGuard(JSContext *cx) : cx(cx), rep(cx) {}
|
|
~RegExpGuard() {}
|
|
|
|
/* init must succeed in order to call tryFlatMatch or normalizeRegExp. */
|
|
bool
|
|
init(uintN argc, Value *vp, bool convertVoid = false)
|
|
{
|
|
if (argc != 0 && VALUE_IS_REGEXP(cx, vp[2])) {
|
|
rep.reset(vp[2].toObject());
|
|
} else {
|
|
if (convertVoid && (argc == 0 || vp[2].isUndefined())) {
|
|
fm.patstr = cx->runtime->emptyString;
|
|
return true;
|
|
}
|
|
|
|
fm.patstr = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!fm.patstr)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Attempt to match |patstr| to |textstr|. A flags argument, metachars in the
|
|
* pattern string, or a lengthy pattern string can thwart this process.
|
|
*
|
|
* @param checkMetaChars Look for regexp metachars in the pattern string.
|
|
* @return Whether flat matching could be used.
|
|
*
|
|
* N.B. tryFlatMatch returns NULL on OOM, so the caller must check cx->isExceptionPending().
|
|
*/
|
|
const FlatMatch *
|
|
tryFlatMatch(JSContext *cx, JSString *textstr, uintN optarg, uintN argc,
|
|
bool checkMetaChars = true)
|
|
{
|
|
if (rep.hasRegExp())
|
|
return NULL;
|
|
|
|
fm.pat = fm.patstr->chars();
|
|
fm.patlen = fm.patstr->length();
|
|
|
|
if (optarg < argc)
|
|
return NULL;
|
|
|
|
if (checkMetaChars &&
|
|
(fm.patlen > MAX_FLAT_PAT_LEN || RegExp::hasMetaChars(fm.pat, fm.patlen))) {
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* textstr could be a rope, so we want to avoid flattening it for as
|
|
* long as possible.
|
|
*/
|
|
if (textstr->isRope()) {
|
|
if (!RopeMatch(cx, textstr, fm.pat, fm.patlen, &fm.match_))
|
|
return NULL;
|
|
} else {
|
|
const jschar *text = textstr->asLinear().chars();
|
|
size_t textlen = textstr->length();
|
|
fm.match_ = StringMatch(text, textlen, fm.pat, fm.patlen);
|
|
}
|
|
return &fm;
|
|
}
|
|
|
|
/* If the pattern is not already a regular expression, make it so. */
|
|
const RegExpPair *
|
|
normalizeRegExp(bool flat, uintN optarg, uintN argc, Value *vp)
|
|
{
|
|
if (rep.hasRegExp())
|
|
return &rep;
|
|
|
|
/* Build RegExp from pattern string. */
|
|
JSString *opt;
|
|
if (optarg < argc) {
|
|
opt = js_ValueToString(cx, vp[2 + optarg]);
|
|
if (!opt)
|
|
return NULL;
|
|
} else {
|
|
opt = NULL;
|
|
}
|
|
|
|
JSString *patstr;
|
|
if (flat) {
|
|
patstr = flattenPattern(cx, fm.patstr);
|
|
if (!patstr)
|
|
return NULL;
|
|
} else {
|
|
patstr = fm.patstr;
|
|
}
|
|
JS_ASSERT(patstr);
|
|
|
|
AlreadyIncRefed<RegExp> re = RegExp::createFlagged(cx, patstr, opt, NULL);
|
|
if (!re)
|
|
return NULL;
|
|
rep.reset(re);
|
|
return &rep;
|
|
}
|
|
|
|
#if DEBUG
|
|
bool hasRegExpPair() const { return rep.hasRegExp(); }
|
|
#endif
|
|
};
|
|
|
|
/* js_ExecuteRegExp indicates success in two ways, based on the 'test' flag. */
|
|
static JS_ALWAYS_INLINE bool
|
|
Matched(bool test, const Value &v)
|
|
{
|
|
return test ? v.isTrue() : !v.isNull();
|
|
}
|
|
|
|
typedef bool (*DoMatchCallback)(JSContext *cx, RegExpStatics *res, size_t count, void *data);
|
|
|
|
/*
|
|
* BitOR-ing these flags allows the DoMatch caller to control when how the
|
|
* RegExp engine is called and when callbacks are fired.
|
|
*/
|
|
enum MatchControlFlags {
|
|
TEST_GLOBAL_BIT = 0x1, /* use RegExp.test for global regexps */
|
|
TEST_SINGLE_BIT = 0x2, /* use RegExp.test for non-global regexps */
|
|
CALLBACK_ON_SINGLE_BIT = 0x4, /* fire callback on non-global match */
|
|
|
|
MATCH_ARGS = TEST_GLOBAL_BIT,
|
|
MATCHALL_ARGS = CALLBACK_ON_SINGLE_BIT,
|
|
REPLACE_ARGS = TEST_GLOBAL_BIT | TEST_SINGLE_BIT | CALLBACK_ON_SINGLE_BIT
|
|
};
|
|
|
|
/* Factor out looping and matching logic. */
|
|
static bool
|
|
DoMatch(JSContext *cx, RegExpStatics *res, JSString *str, const RegExpPair &rep,
|
|
DoMatchCallback callback, void *data, MatchControlFlags flags, Value *rval)
|
|
{
|
|
RegExp &re = rep.re();
|
|
if (re.global()) {
|
|
/* global matching ('g') */
|
|
bool testGlobal = flags & TEST_GLOBAL_BIT;
|
|
if (rep.reobj())
|
|
rep.reobj()->zeroRegExpLastIndex();
|
|
for (size_t count = 0, i = 0, length = str->length(); i <= length; ++count) {
|
|
if (!re.execute(cx, res, str, &i, testGlobal, rval))
|
|
return false;
|
|
if (!Matched(testGlobal, *rval))
|
|
break;
|
|
if (!callback(cx, res, count, data))
|
|
return false;
|
|
if (!res->matched())
|
|
++i;
|
|
}
|
|
} else {
|
|
/* single match */
|
|
bool testSingle = !!(flags & TEST_SINGLE_BIT),
|
|
callbackOnSingle = !!(flags & CALLBACK_ON_SINGLE_BIT);
|
|
size_t i = 0;
|
|
if (!re.execute(cx, res, str, &i, testSingle, rval))
|
|
return false;
|
|
if (callbackOnSingle && Matched(testSingle, *rval) && !callback(cx, res, 0, data))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static bool
|
|
BuildFlatMatchArray(JSContext *cx, JSString *textstr, const FlatMatch &fm, Value *vp)
|
|
{
|
|
if (fm.match() < 0) {
|
|
vp->setNull();
|
|
return true;
|
|
}
|
|
|
|
/* For this non-global match, produce a RegExp.exec-style array. */
|
|
JSObject *obj = NewSlowEmptyArray(cx);
|
|
if (!obj)
|
|
return false;
|
|
vp->setObject(*obj);
|
|
|
|
return obj->defineProperty(cx, INT_TO_JSID(0), StringValue(fm.pattern())) &&
|
|
obj->defineProperty(cx, ATOM_TO_JSID(cx->runtime->atomState.indexAtom),
|
|
Int32Value(fm.match())) &&
|
|
obj->defineProperty(cx, ATOM_TO_JSID(cx->runtime->atomState.inputAtom),
|
|
StringValue(textstr));
|
|
}
|
|
|
|
typedef JSObject **MatchArgType;
|
|
|
|
/*
|
|
* DoMatch will only callback on global matches, hence this function builds
|
|
* only the "array of matches" returned by match on global regexps.
|
|
*/
|
|
static bool
|
|
MatchCallback(JSContext *cx, RegExpStatics *res, size_t count, void *p)
|
|
{
|
|
JS_ASSERT(count <= JSID_INT_MAX); /* by max string length */
|
|
|
|
JSObject *&arrayobj = *static_cast<MatchArgType>(p);
|
|
if (!arrayobj) {
|
|
arrayobj = NewDenseEmptyArray(cx);
|
|
if (!arrayobj)
|
|
return false;
|
|
}
|
|
|
|
Value v;
|
|
return res->createLastMatch(cx, &v) &&
|
|
arrayobj->defineProperty(cx, INT_TO_JSID(count), v);
|
|
}
|
|
|
|
static JSBool
|
|
str_match(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
RegExpGuard g(cx);
|
|
if (!g.init(argc, vp, true))
|
|
return false;
|
|
if (const FlatMatch *fm = g.tryFlatMatch(cx, str, 1, argc))
|
|
return BuildFlatMatchArray(cx, str, *fm, vp);
|
|
if (cx->isExceptionPending()) /* from tryFlatMatch */
|
|
return false;
|
|
|
|
const RegExpPair *rep = g.normalizeRegExp(false, 1, argc, vp);
|
|
if (!rep)
|
|
return false;
|
|
|
|
AutoObjectRooter array(cx);
|
|
MatchArgType arg = array.addr();
|
|
RegExpStatics *res = cx->regExpStatics();
|
|
Value rval;
|
|
if (!DoMatch(cx, res, str, *rep, MatchCallback, arg, MATCH_ARGS, &rval))
|
|
return false;
|
|
|
|
if (rep->re().global())
|
|
vp->setObjectOrNull(array.object());
|
|
else
|
|
*vp = rval;
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_search(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
RegExpGuard g(cx);
|
|
if (!g.init(argc, vp, true))
|
|
return false;
|
|
if (const FlatMatch *fm = g.tryFlatMatch(cx, str, 1, argc)) {
|
|
vp->setInt32(fm->match());
|
|
return true;
|
|
}
|
|
if (cx->isExceptionPending()) /* from tryFlatMatch */
|
|
return false;
|
|
|
|
const RegExpPair *rep = g.normalizeRegExp(false, 1, argc, vp);
|
|
if (!rep)
|
|
return false;
|
|
|
|
RegExpStatics *res = cx->regExpStatics();
|
|
size_t i = 0;
|
|
if (!rep->re().execute(cx, res, str, &i, true, vp))
|
|
return false;
|
|
|
|
if (vp->isTrue())
|
|
vp->setInt32(res->matchStart());
|
|
else
|
|
vp->setInt32(-1);
|
|
return true;
|
|
}
|
|
|
|
struct ReplaceData
|
|
{
|
|
ReplaceData(JSContext *cx)
|
|
: g(cx), sb(cx)
|
|
{}
|
|
|
|
JSString *str; /* 'this' parameter object as a string */
|
|
RegExpGuard g; /* regexp parameter object and private data */
|
|
JSObject *lambda; /* replacement function object or null */
|
|
JSObject *elembase; /* object for function(a){return b[a]} replace */
|
|
JSLinearString *repstr; /* replacement string */
|
|
const jschar *dollar; /* null or pointer to first $ in repstr */
|
|
const jschar *dollarEnd; /* limit pointer for js_strchr_limit */
|
|
jsint leftIndex; /* left context index in str->chars */
|
|
JSSubString dollarStr; /* for "$$" InterpretDollar result */
|
|
bool calledBack; /* record whether callback has been called */
|
|
InvokeArgsGuard args; /* arguments for lambda call */
|
|
StringBuffer sb; /* buffer built during DoMatch */
|
|
};
|
|
|
|
static bool
|
|
InterpretDollar(JSContext *cx, RegExpStatics *res, const jschar *dp, const jschar *ep,
|
|
ReplaceData &rdata, JSSubString *out, size_t *skip)
|
|
{
|
|
JS_ASSERT(*dp == '$');
|
|
|
|
/* If there is only a dollar, bail now */
|
|
if (dp + 1 >= ep)
|
|
return false;
|
|
|
|
/* Interpret all Perl match-induced dollar variables. */
|
|
jschar dc = dp[1];
|
|
if (JS7_ISDEC(dc)) {
|
|
/* ECMA-262 Edition 3: 1-9 or 01-99 */
|
|
uintN num = JS7_UNDEC(dc);
|
|
if (num > res->parenCount())
|
|
return false;
|
|
|
|
const jschar *cp = dp + 2;
|
|
if (cp < ep && (dc = *cp, JS7_ISDEC(dc))) {
|
|
uintN tmp = 10 * num + JS7_UNDEC(dc);
|
|
if (tmp <= res->parenCount()) {
|
|
cp++;
|
|
num = tmp;
|
|
}
|
|
}
|
|
if (num == 0)
|
|
return false;
|
|
|
|
*skip = cp - dp;
|
|
|
|
JS_ASSERT(num <= res->parenCount());
|
|
|
|
/*
|
|
* Note: we index to get the paren with the (1-indexed) pair
|
|
* number, as opposed to a (0-indexed) paren number.
|
|
*/
|
|
res->getParen(num, out);
|
|
return true;
|
|
}
|
|
|
|
*skip = 2;
|
|
switch (dc) {
|
|
case '$':
|
|
rdata.dollarStr.chars = dp;
|
|
rdata.dollarStr.length = 1;
|
|
*out = rdata.dollarStr;
|
|
return true;
|
|
case '&':
|
|
res->getLastMatch(out);
|
|
return true;
|
|
case '+':
|
|
res->getLastParen(out);
|
|
return true;
|
|
case '`':
|
|
res->getLeftContext(out);
|
|
return true;
|
|
case '\'':
|
|
res->getRightContext(out);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
static bool
|
|
FindReplaceLength(JSContext *cx, RegExpStatics *res, ReplaceData &rdata, size_t *sizep)
|
|
{
|
|
JSObject *base = rdata.elembase;
|
|
if (base) {
|
|
/*
|
|
* The base object is used when replace was passed a lambda which looks like
|
|
* 'function(a) { return b[a]; }' for the base object b. b will not change
|
|
* in the course of the replace unless we end up making a scripted call due
|
|
* to accessing a scripted getter or a value with a scripted toString.
|
|
*/
|
|
JS_ASSERT(rdata.lambda);
|
|
JS_ASSERT(!base->getOps()->lookupProperty);
|
|
JS_ASSERT(!base->getOps()->getProperty);
|
|
|
|
Value match;
|
|
if (!res->createLastMatch(cx, &match))
|
|
return false;
|
|
JSString *str = match.toString();
|
|
|
|
JSAtom *atom;
|
|
if (str->isAtom()) {
|
|
atom = &str->asAtom();
|
|
} else {
|
|
atom = js_AtomizeString(cx, str);
|
|
if (!atom)
|
|
return false;
|
|
}
|
|
jsid id = ATOM_TO_JSID(atom);
|
|
|
|
JSObject *holder;
|
|
JSProperty *prop = NULL;
|
|
if (!LookupPropertyWithFlags(cx, base, id, JSRESOLVE_QUALIFIED, &holder, &prop))
|
|
return false;
|
|
|
|
/* Only handle the case where the property exists and is on this object. */
|
|
if (prop && holder == base) {
|
|
Shape *shape = (Shape *) prop;
|
|
if (shape->slot != SHAPE_INVALID_SLOT && shape->hasDefaultGetter()) {
|
|
Value value = base->getSlot(shape->slot);
|
|
if (value.isString()) {
|
|
rdata.repstr = value.toString()->ensureLinear(cx);
|
|
if (!rdata.repstr)
|
|
return false;
|
|
*sizep = rdata.repstr->length();
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Couldn't handle this property, fall through and despecialize to the
|
|
* general lambda case.
|
|
*/
|
|
rdata.elembase = NULL;
|
|
}
|
|
|
|
JSObject *lambda = rdata.lambda;
|
|
if (lambda) {
|
|
PreserveRegExpStatics staticsGuard(res);
|
|
if (!staticsGuard.init(cx))
|
|
return false;
|
|
|
|
/*
|
|
* In the lambda case, not only do we find the replacement string's
|
|
* length, we compute repstr and return it via rdata for use within
|
|
* DoReplace. The lambda is called with arguments ($&, $1, $2, ...,
|
|
* index, input), i.e., all the properties of a regexp match array.
|
|
* For $&, etc., we must create string jsvals from cx->regExpStatics.
|
|
* We grab up stack space to keep the newborn strings GC-rooted.
|
|
*/
|
|
uintN p = res->parenCount();
|
|
uintN argc = 1 + p + 2;
|
|
|
|
InvokeArgsGuard &args = rdata.args;
|
|
if (!args.pushed() && !cx->stack.pushInvokeArgs(cx, argc, &args))
|
|
return false;
|
|
|
|
args.calleeHasBeenReset();
|
|
args.calleev() = ObjectValue(*lambda);
|
|
args.thisv() = UndefinedValue();
|
|
|
|
/* Push $&, $1, $2, ... */
|
|
uintN argi = 0;
|
|
if (!res->createLastMatch(cx, &args[argi++]))
|
|
return false;
|
|
|
|
for (size_t i = 0; i < res->parenCount(); ++i) {
|
|
if (!res->createParen(cx, i + 1, &args[argi++]))
|
|
return false;
|
|
}
|
|
|
|
/* Push match index and input string. */
|
|
args[argi++].setInt32(res->matchStart());
|
|
args[argi].setString(rdata.str);
|
|
|
|
if (!Invoke(cx, args))
|
|
return false;
|
|
|
|
/* root repstr: rdata is on the stack, so scanned by conservative gc. */
|
|
JSString *repstr = ValueToString_TestForStringInline(cx, args.rval());
|
|
if (!repstr)
|
|
return false;
|
|
rdata.repstr = repstr->ensureLinear(cx);
|
|
if (!rdata.repstr)
|
|
return false;
|
|
*sizep = rdata.repstr->length();
|
|
return true;
|
|
}
|
|
|
|
JSString *repstr = rdata.repstr;
|
|
size_t replen = repstr->length();
|
|
for (const jschar *dp = rdata.dollar, *ep = rdata.dollarEnd; dp;
|
|
dp = js_strchr_limit(dp, '$', ep)) {
|
|
JSSubString sub;
|
|
size_t skip;
|
|
if (InterpretDollar(cx, res, dp, ep, rdata, &sub, &skip)) {
|
|
replen += sub.length - skip;
|
|
dp += skip;
|
|
} else {
|
|
dp++;
|
|
}
|
|
}
|
|
*sizep = replen;
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Precondition: |rdata.sb| already has necessary growth space reserved (as
|
|
* derived from FindReplaceLength).
|
|
*/
|
|
static void
|
|
DoReplace(JSContext *cx, RegExpStatics *res, ReplaceData &rdata)
|
|
{
|
|
JSLinearString *repstr = rdata.repstr;
|
|
const jschar *cp;
|
|
const jschar *bp = cp = repstr->chars();
|
|
|
|
const jschar *dp = rdata.dollar;
|
|
const jschar *ep = rdata.dollarEnd;
|
|
for (; dp; dp = js_strchr_limit(dp, '$', ep)) {
|
|
/* Move one of the constant portions of the replacement value. */
|
|
size_t len = dp - cp;
|
|
rdata.sb.infallibleAppend(cp, len);
|
|
cp = dp;
|
|
|
|
JSSubString sub;
|
|
size_t skip;
|
|
if (InterpretDollar(cx, res, dp, ep, rdata, &sub, &skip)) {
|
|
len = sub.length;
|
|
rdata.sb.infallibleAppend(sub.chars, len);
|
|
cp += skip;
|
|
dp += skip;
|
|
} else {
|
|
dp++;
|
|
}
|
|
}
|
|
JS_ALWAYS_TRUE(rdata.sb.append(cp, repstr->length() - (cp - bp)));
|
|
}
|
|
|
|
static bool
|
|
ReplaceRegExpCallback(JSContext *cx, RegExpStatics *res, size_t count, void *p)
|
|
{
|
|
ReplaceData &rdata = *static_cast<ReplaceData *>(p);
|
|
|
|
rdata.calledBack = true;
|
|
JSLinearString &str = rdata.str->asLinear(); /* flattened for regexp */
|
|
size_t leftoff = rdata.leftIndex;
|
|
const jschar *left = str.chars() + leftoff;
|
|
size_t leftlen = res->matchStart() - leftoff;
|
|
rdata.leftIndex = res->matchLimit();
|
|
|
|
size_t replen = 0; /* silence 'unused' warning */
|
|
if (!FindReplaceLength(cx, res, rdata, &replen))
|
|
return false;
|
|
|
|
size_t growth = leftlen + replen;
|
|
if (!rdata.sb.reserve(rdata.sb.length() + growth))
|
|
return false;
|
|
rdata.sb.infallibleAppend(left, leftlen); /* skipped-over portion of the search value */
|
|
DoReplace(cx, res, rdata);
|
|
return true;
|
|
}
|
|
|
|
static bool
|
|
BuildFlatReplacement(JSContext *cx, JSString *textstr, JSString *repstr,
|
|
const FlatMatch &fm, Value *vp)
|
|
{
|
|
RopeBuilder builder(cx);
|
|
size_t match = fm.match();
|
|
size_t matchEnd = match + fm.patternLength();
|
|
|
|
if (textstr->isRope()) {
|
|
/*
|
|
* If we are replacing over a rope, avoid flattening it by iterating
|
|
* through it, building a new rope.
|
|
*/
|
|
StringSegmentRange r(cx);
|
|
if (!r.init(textstr))
|
|
return false;
|
|
size_t pos = 0;
|
|
while (!r.empty()) {
|
|
JSString *str = r.front();
|
|
size_t len = str->length();
|
|
size_t strEnd = pos + len;
|
|
if (pos < matchEnd && strEnd > match) {
|
|
/*
|
|
* We need to special-case any part of the rope that overlaps
|
|
* with the replacement string.
|
|
*/
|
|
if (match >= pos) {
|
|
/*
|
|
* If this part of the rope overlaps with the left side of
|
|
* the pattern, then it must be the only one to overlap with
|
|
* the first character in the pattern, so we include the
|
|
* replacement string here.
|
|
*/
|
|
JSString *leftSide = js_NewDependentString(cx, str, 0, match - pos);
|
|
if (!leftSide ||
|
|
!builder.append(leftSide) ||
|
|
!builder.append(repstr)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* If str runs off the end of the matched string, append the
|
|
* last part of str.
|
|
*/
|
|
if (strEnd > matchEnd) {
|
|
JSString *rightSide = js_NewDependentString(cx, str, matchEnd - pos,
|
|
strEnd - matchEnd);
|
|
if (!rightSide || !builder.append(rightSide))
|
|
return false;
|
|
}
|
|
} else {
|
|
if (!builder.append(str))
|
|
return false;
|
|
}
|
|
pos += str->length();
|
|
if (!r.popFront())
|
|
return false;
|
|
}
|
|
} else {
|
|
JSString *leftSide = js_NewDependentString(cx, textstr, 0, match);
|
|
if (!leftSide)
|
|
return false;
|
|
JSString *rightSide = js_NewDependentString(cx, textstr, match + fm.patternLength(),
|
|
textstr->length() - match - fm.patternLength());
|
|
if (!rightSide ||
|
|
!builder.append(leftSide) ||
|
|
!builder.append(repstr) ||
|
|
!builder.append(rightSide)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
vp->setString(builder.result());
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Perform a linear-scan dollar substitution on the replacement text,
|
|
* constructing a result string that looks like:
|
|
*
|
|
* newstring = string[:matchStart] + dollarSub(replaceValue) + string[matchLimit:]
|
|
*/
|
|
static inline bool
|
|
BuildDollarReplacement(JSContext *cx, JSString *textstrArg, JSLinearString *repstr,
|
|
const jschar *firstDollar, const FlatMatch &fm, Value *vp)
|
|
{
|
|
JSLinearString *textstr = textstrArg->ensureLinear(cx);
|
|
if (!textstr)
|
|
return NULL;
|
|
|
|
JS_ASSERT(repstr->chars() <= firstDollar && firstDollar < repstr->chars() + repstr->length());
|
|
size_t matchStart = fm.match();
|
|
size_t matchLimit = matchStart + fm.patternLength();
|
|
|
|
/*
|
|
* Most probably:
|
|
*
|
|
* len(newstr) >= len(orig) - len(match) + len(replacement)
|
|
*
|
|
* Note that dollar vars _could_ make the resulting text smaller than this.
|
|
*/
|
|
StringBuffer newReplaceChars(cx);
|
|
if (!newReplaceChars.reserve(textstr->length() - fm.patternLength() + repstr->length()))
|
|
return false;
|
|
|
|
/* Move the pre-dollar chunk in bulk. */
|
|
newReplaceChars.infallibleAppend(repstr->chars(), firstDollar);
|
|
|
|
/* Move the rest char-by-char, interpreting dollars as we encounter them. */
|
|
#define ENSURE(__cond) if (!(__cond)) return false;
|
|
const jschar *repstrLimit = repstr->chars() + repstr->length();
|
|
for (const jschar *it = firstDollar; it < repstrLimit; ++it) {
|
|
if (*it != '$' || it == repstrLimit - 1) {
|
|
ENSURE(newReplaceChars.append(*it));
|
|
continue;
|
|
}
|
|
|
|
switch (*(it + 1)) {
|
|
case '$': /* Eat one of the dollars. */
|
|
ENSURE(newReplaceChars.append(*it));
|
|
break;
|
|
case '&':
|
|
ENSURE(newReplaceChars.append(textstr->chars() + matchStart,
|
|
textstr->chars() + matchLimit));
|
|
break;
|
|
case '`':
|
|
ENSURE(newReplaceChars.append(textstr->chars(), textstr->chars() + matchStart));
|
|
break;
|
|
case '\'':
|
|
ENSURE(newReplaceChars.append(textstr->chars() + matchLimit,
|
|
textstr->chars() + textstr->length()));
|
|
break;
|
|
default: /* The dollar we saw was not special (no matter what its mother told it). */
|
|
ENSURE(newReplaceChars.append(*it));
|
|
continue;
|
|
}
|
|
++it; /* We always eat an extra char in the above switch. */
|
|
}
|
|
|
|
JSString *leftSide = js_NewDependentString(cx, textstr, 0, matchStart);
|
|
ENSURE(leftSide);
|
|
|
|
JSString *newReplace = newReplaceChars.finishString();
|
|
ENSURE(newReplace);
|
|
|
|
JS_ASSERT(textstr->length() >= matchLimit);
|
|
JSString *rightSide = js_NewDependentString(cx, textstr, matchLimit,
|
|
textstr->length() - matchLimit);
|
|
ENSURE(rightSide);
|
|
|
|
RopeBuilder builder(cx);
|
|
ENSURE(builder.append(leftSide) &&
|
|
builder.append(newReplace) &&
|
|
builder.append(rightSide));
|
|
#undef ENSURE
|
|
|
|
vp->setString(builder.result());
|
|
return true;
|
|
}
|
|
|
|
static inline bool
|
|
str_replace_regexp(JSContext *cx, uintN argc, Value *vp, ReplaceData &rdata)
|
|
{
|
|
const RegExpPair *rep = rdata.g.normalizeRegExp(true, 2, argc, vp);
|
|
if (!rep)
|
|
return false;
|
|
|
|
rdata.leftIndex = 0;
|
|
rdata.calledBack = false;
|
|
|
|
RegExpStatics *res = cx->regExpStatics();
|
|
Value tmp;
|
|
if (!DoMatch(cx, res, rdata.str, *rep, ReplaceRegExpCallback, &rdata, REPLACE_ARGS, &tmp))
|
|
return false;
|
|
|
|
if (!rdata.calledBack) {
|
|
/* Didn't match, so the string is unmodified. */
|
|
vp->setString(rdata.str);
|
|
return true;
|
|
}
|
|
|
|
JSSubString sub;
|
|
res->getRightContext(&sub);
|
|
if (!rdata.sb.append(sub.chars, sub.length))
|
|
return false;
|
|
|
|
JSString *retstr = rdata.sb.finishString();
|
|
if (!retstr)
|
|
return false;
|
|
|
|
vp->setString(retstr);
|
|
return true;
|
|
}
|
|
|
|
static inline bool
|
|
str_replace_flat_lambda(JSContext *cx, uintN argc, Value *vp, ReplaceData &rdata,
|
|
const FlatMatch &fm)
|
|
{
|
|
JS_ASSERT(fm.match() >= 0);
|
|
|
|
JSString *matchStr = js_NewDependentString(cx, rdata.str, fm.match(), fm.patternLength());
|
|
if (!matchStr)
|
|
return false;
|
|
|
|
/* lambda(matchStr, matchStart, textstr) */
|
|
static const uint32 lambdaArgc = 3;
|
|
if (!cx->stack.pushInvokeArgs(cx, lambdaArgc, &rdata.args))
|
|
return false;
|
|
|
|
CallArgs &args = rdata.args;
|
|
args.calleev().setObject(*rdata.lambda);
|
|
args.thisv().setUndefined();
|
|
|
|
Value *sp = args.argv();
|
|
sp[0].setString(matchStr);
|
|
sp[1].setInt32(fm.match());
|
|
sp[2].setString(rdata.str);
|
|
|
|
if (!Invoke(cx, rdata.args))
|
|
return false;
|
|
|
|
JSString *repstr = js_ValueToString(cx, args.rval());
|
|
if (!repstr)
|
|
return false;
|
|
|
|
JSString *leftSide = js_NewDependentString(cx, rdata.str, 0, fm.match());
|
|
if (!leftSide)
|
|
return false;
|
|
|
|
size_t matchLimit = fm.match() + fm.patternLength();
|
|
JSString *rightSide = js_NewDependentString(cx, rdata.str, matchLimit,
|
|
rdata.str->length() - matchLimit);
|
|
if (!rightSide)
|
|
return false;
|
|
|
|
RopeBuilder builder(cx);
|
|
if (!(builder.append(leftSide) &&
|
|
builder.append(repstr) &&
|
|
builder.append(rightSide))) {
|
|
return false;
|
|
}
|
|
|
|
vp->setString(builder.result());
|
|
return true;
|
|
}
|
|
|
|
JSBool
|
|
js::str_replace(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
ReplaceData rdata(cx);
|
|
rdata.str = ThisToStringForStringProto(cx, vp);
|
|
if (!rdata.str)
|
|
return false;
|
|
static const uint32 optarg = 2;
|
|
|
|
if (!rdata.g.init(argc, vp))
|
|
return false;
|
|
|
|
/* Extract replacement string/function. */
|
|
if (argc >= optarg && js_IsCallable(vp[3])) {
|
|
rdata.lambda = &vp[3].toObject();
|
|
rdata.elembase = NULL;
|
|
rdata.repstr = NULL;
|
|
rdata.dollar = rdata.dollarEnd = NULL;
|
|
|
|
if (rdata.lambda->isFunction()) {
|
|
JSFunction *fun = rdata.lambda->getFunctionPrivate();
|
|
if (fun->isInterpreted()) {
|
|
/*
|
|
* Pattern match the script to check if it is is indexing into a
|
|
* particular object, e.g. 'function(a) { return b[a]; }'. Avoid
|
|
* calling the script in such cases, which are used by javascript
|
|
* packers (particularly the popular Dean Edwards packer) to efficiently
|
|
* encode large scripts. We only handle the code patterns generated
|
|
* by such packers here.
|
|
*/
|
|
JSScript *script = fun->script();
|
|
jsbytecode *pc = script->code;
|
|
|
|
Value table = UndefinedValue();
|
|
if (JSOp(*pc) == JSOP_GETFCSLOT) {
|
|
table = rdata.lambda->getFlatClosureUpvar(GET_UINT16(pc));
|
|
pc += JSOP_GETFCSLOT_LENGTH;
|
|
}
|
|
|
|
if (table.isObject() &&
|
|
JSOp(*pc) == JSOP_GETARG && GET_SLOTNO(pc) == 0 &&
|
|
JSOp(*(pc + JSOP_GETARG_LENGTH)) == JSOP_GETELEM &&
|
|
JSOp(*(pc + JSOP_GETARG_LENGTH + JSOP_GETELEM_LENGTH)) == JSOP_RETURN) {
|
|
Class *clasp = table.toObject().getClass();
|
|
if (clasp->isNative() &&
|
|
!clasp->ops.lookupProperty &&
|
|
!clasp->ops.getProperty) {
|
|
rdata.elembase = &table.toObject();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
rdata.lambda = NULL;
|
|
rdata.elembase = NULL;
|
|
rdata.repstr = ArgToRootedString(cx, argc, vp, 1);
|
|
if (!rdata.repstr)
|
|
return false;
|
|
|
|
/* We're about to store pointers into the middle of our string. */
|
|
JSFixedString *fixed = rdata.repstr->ensureFixed(cx);
|
|
if (!fixed)
|
|
return false;
|
|
rdata.dollarEnd = fixed->chars() + fixed->length();
|
|
rdata.dollar = js_strchr_limit(fixed->chars(), '$', rdata.dollarEnd);
|
|
}
|
|
|
|
/*
|
|
* Unlike its |String.prototype| brethren, |replace| doesn't convert
|
|
* its input to a regular expression. (Even if it contains metachars.)
|
|
*
|
|
* However, if the user invokes our (non-standard) |flags| argument
|
|
* extension then we revert to creating a regular expression. Note that
|
|
* this is observable behavior through the side-effect mutation of the
|
|
* |RegExp| statics.
|
|
*/
|
|
|
|
const FlatMatch *fm = rdata.g.tryFlatMatch(cx, rdata.str, optarg, argc, false);
|
|
if (!fm) {
|
|
if (cx->isExceptionPending()) /* oom in RopeMatch in tryFlatMatch */
|
|
return false;
|
|
JS_ASSERT_IF(!rdata.g.hasRegExpPair(), argc > optarg);
|
|
return str_replace_regexp(cx, argc, vp, rdata);
|
|
}
|
|
|
|
if (fm->match() < 0) {
|
|
vp->setString(rdata.str);
|
|
return true;
|
|
}
|
|
|
|
if (rdata.lambda)
|
|
return str_replace_flat_lambda(cx, argc, vp, rdata, *fm);
|
|
|
|
/*
|
|
* Note: we could optimize the text.length == pattern.length case if we wanted,
|
|
* even in the presence of dollar metachars.
|
|
*/
|
|
if (rdata.dollar)
|
|
return BuildDollarReplacement(cx, rdata.str, rdata.repstr, rdata.dollar, *fm, vp);
|
|
|
|
return BuildFlatReplacement(cx, rdata.str, rdata.repstr, *fm, vp);
|
|
}
|
|
|
|
class SplitMatchResult {
|
|
size_t endIndex_;
|
|
size_t length_;
|
|
|
|
public:
|
|
void setFailure() {
|
|
JS_STATIC_ASSERT(SIZE_MAX > JSString::MAX_LENGTH);
|
|
endIndex_ = SIZE_MAX;
|
|
}
|
|
bool isFailure() const {
|
|
return (endIndex_ == SIZE_MAX);
|
|
}
|
|
size_t endIndex() const {
|
|
JS_ASSERT(!isFailure());
|
|
return endIndex_;
|
|
}
|
|
size_t length() const {
|
|
JS_ASSERT(!isFailure());
|
|
return length_;
|
|
}
|
|
void setResult(size_t length, size_t endIndex) {
|
|
length_ = length;
|
|
endIndex_ = endIndex;
|
|
}
|
|
};
|
|
|
|
template<class Matcher>
|
|
static JSObject *
|
|
SplitHelper(JSContext *cx, JSLinearString *str, uint32 limit, Matcher splitMatch, TypeObject *type)
|
|
{
|
|
size_t strLength = str->length();
|
|
SplitMatchResult result;
|
|
|
|
/* Step 11. */
|
|
if (strLength == 0) {
|
|
if (!splitMatch(cx, str, 0, &result))
|
|
return NULL;
|
|
|
|
/*
|
|
* NB: Unlike in the non-empty string case, it's perfectly fine
|
|
* (indeed the spec requires it) if we match at the end of the
|
|
* string. Thus these cases should hold:
|
|
*
|
|
* var a = "".split("");
|
|
* assertEq(a.length, 0);
|
|
* var b = "".split(/.?/);
|
|
* assertEq(b.length, 0);
|
|
*/
|
|
if (!result.isFailure())
|
|
return NewDenseEmptyArray(cx);
|
|
|
|
Value v = StringValue(str);
|
|
return NewDenseCopiedArray(cx, 1, &v);
|
|
}
|
|
|
|
/* Step 12. */
|
|
size_t lastEndIndex = 0;
|
|
size_t index = 0;
|
|
|
|
/* Step 13. */
|
|
AutoValueVector splits(cx);
|
|
|
|
while (index < strLength) {
|
|
/* Step 13(a). */
|
|
if (!splitMatch(cx, str, index, &result))
|
|
return NULL;
|
|
|
|
/*
|
|
* Step 13(b).
|
|
*
|
|
* Our match algorithm differs from the spec in that it returns the
|
|
* next index at which a match happens. If no match happens we're
|
|
* done.
|
|
*
|
|
* But what if the match is at the end of the string (and the string is
|
|
* not empty)? Per 13(c)(ii) this shouldn't be a match, so we have to
|
|
* specially exclude it. Thus this case should hold:
|
|
*
|
|
* var a = "abc".split(/\b/);
|
|
* assertEq(a.length, 1);
|
|
* assertEq(a[0], "abc");
|
|
*/
|
|
if (result.isFailure())
|
|
break;
|
|
|
|
/* Step 13(c)(i). */
|
|
size_t sepLength = result.length();
|
|
size_t endIndex = result.endIndex();
|
|
if (sepLength == 0 && endIndex == strLength)
|
|
break;
|
|
|
|
/* Step 13(c)(ii). */
|
|
if (endIndex == lastEndIndex) {
|
|
index++;
|
|
continue;
|
|
}
|
|
|
|
/* Step 13(c)(iii). */
|
|
JS_ASSERT(lastEndIndex < endIndex);
|
|
JS_ASSERT(sepLength <= strLength);
|
|
JS_ASSERT(lastEndIndex + sepLength <= endIndex);
|
|
|
|
/* Steps 13(c)(iii)(1-3). */
|
|
size_t subLength = size_t(endIndex - sepLength - lastEndIndex);
|
|
JSString *sub = js_NewDependentString(cx, str, lastEndIndex, subLength);
|
|
if (!sub || !splits.append(StringValue(sub)))
|
|
return NULL;
|
|
|
|
/* Step 13(c)(iii)(4). */
|
|
if (splits.length() == limit)
|
|
return NewDenseCopiedArray(cx, splits.length(), splits.begin());
|
|
|
|
/* Step 13(c)(iii)(5). */
|
|
lastEndIndex = endIndex;
|
|
|
|
/* Step 13(c)(iii)(6-7). */
|
|
if (Matcher::returnsCaptures) {
|
|
RegExpStatics *res = cx->regExpStatics();
|
|
for (size_t i = 0; i < res->parenCount(); i++) {
|
|
/* Steps 13(c)(iii)(7)(a-c). */
|
|
if (res->pairIsPresent(i + 1)) {
|
|
JSSubString parsub;
|
|
res->getParen(i + 1, &parsub);
|
|
sub = js_NewStringCopyN(cx, parsub.chars, parsub.length);
|
|
if (!sub || !splits.append(StringValue(sub)))
|
|
return NULL;
|
|
} else {
|
|
/* Only string entries have been accounted for so far. */
|
|
AddTypeProperty(cx, type, NULL, UndefinedValue());
|
|
if (!splits.append(UndefinedValue()))
|
|
return NULL;
|
|
}
|
|
|
|
/* Step 13(c)(iii)(7)(d). */
|
|
if (splits.length() == limit)
|
|
return NewDenseCopiedArray(cx, splits.length(), splits.begin());
|
|
}
|
|
}
|
|
|
|
/* Step 13(c)(iii)(8). */
|
|
index = lastEndIndex;
|
|
}
|
|
|
|
/* Steps 14-15. */
|
|
JSString *sub = js_NewDependentString(cx, str, lastEndIndex, strLength - lastEndIndex);
|
|
if (!sub || !splits.append(StringValue(sub)))
|
|
return NULL;
|
|
|
|
/* Step 16. */
|
|
return NewDenseCopiedArray(cx, splits.length(), splits.begin());
|
|
}
|
|
|
|
/*
|
|
* The SplitMatch operation from ES5 15.5.4.14 is implemented using different
|
|
* matchers for regular expression and string separators.
|
|
*
|
|
* The algorithm differs from the spec in that the matchers return the next
|
|
* index at which a match happens.
|
|
*/
|
|
class SplitRegExpMatcher {
|
|
RegExpStatics *res;
|
|
RegExp *re;
|
|
|
|
public:
|
|
static const bool returnsCaptures = true;
|
|
SplitRegExpMatcher(RegExp *re, RegExpStatics *res) : res(res), re(re) {
|
|
}
|
|
|
|
inline bool operator()(JSContext *cx, JSLinearString *str, size_t index,
|
|
SplitMatchResult *result) {
|
|
Value rval
|
|
#ifdef __GNUC__ /* quell GCC overwarning */
|
|
= UndefinedValue()
|
|
#endif
|
|
;
|
|
if (!re->execute(cx, res, str, &index, true, &rval))
|
|
return false;
|
|
if (!rval.isTrue()) {
|
|
result->setFailure();
|
|
return true;
|
|
}
|
|
JSSubString sep;
|
|
res->getLastMatch(&sep);
|
|
|
|
result->setResult(sep.length, index);
|
|
return true;
|
|
}
|
|
};
|
|
|
|
class SplitStringMatcher {
|
|
const jschar *sepChars;
|
|
size_t sepLength;
|
|
|
|
public:
|
|
static const bool returnsCaptures = false;
|
|
SplitStringMatcher(JSLinearString *sep) {
|
|
sepChars = sep->chars();
|
|
sepLength = sep->length();
|
|
}
|
|
|
|
inline bool operator()(JSContext *cx, JSLinearString *str, size_t index,
|
|
SplitMatchResult *res) {
|
|
JS_ASSERT(index == 0 || index < str->length());
|
|
const jschar *chars = str->chars();
|
|
jsint match = StringMatch(chars + index, str->length() - index, sepChars, sepLength);
|
|
if (match == -1)
|
|
res->setFailure();
|
|
else
|
|
res->setResult(sepLength, index + match + sepLength);
|
|
return true;
|
|
}
|
|
};
|
|
|
|
/* ES5 15.5.4.14 */
|
|
static JSBool
|
|
str_split(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
/* Steps 1-2. */
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
TypeObject *type = GetTypeCallerInitObject(cx, JSProto_Array);
|
|
if (!type)
|
|
return false;
|
|
AddTypeProperty(cx, type, NULL, Type::StringType());
|
|
|
|
/* Step 5: Use the second argument as the split limit, if given. */
|
|
uint32 limit;
|
|
if (argc > 1 && !vp[3].isUndefined()) {
|
|
jsdouble d;
|
|
if (!ToNumber(cx, vp[3], &d))
|
|
return false;
|
|
limit = js_DoubleToECMAUint32(d);
|
|
} else {
|
|
limit = UINT32_MAX;
|
|
}
|
|
|
|
/* Step 8. */
|
|
RegExp *re = NULL;
|
|
JSLinearString *sepstr = NULL;
|
|
bool sepUndefined = (argc == 0 || vp[2].isUndefined());
|
|
if (!sepUndefined) {
|
|
if (VALUE_IS_REGEXP(cx, vp[2])) {
|
|
re = static_cast<RegExp *>(vp[2].toObject().getPrivate());
|
|
} else {
|
|
JSString *sep = js_ValueToString(cx, vp[2]);
|
|
if (!sep)
|
|
return false;
|
|
vp[2].setString(sep);
|
|
|
|
sepstr = sep->ensureLinear(cx);
|
|
if (!sepstr)
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* Step 9. */
|
|
if (limit == 0) {
|
|
JSObject *aobj = NewDenseEmptyArray(cx);
|
|
if (!aobj)
|
|
return false;
|
|
aobj->setType(type);
|
|
vp->setObject(*aobj);
|
|
return true;
|
|
}
|
|
|
|
/* Step 10. */
|
|
if (sepUndefined) {
|
|
Value v = StringValue(str);
|
|
JSObject *aobj = NewDenseCopiedArray(cx, 1, &v);
|
|
if (!aobj)
|
|
return false;
|
|
aobj->setType(type);
|
|
vp->setObject(*aobj);
|
|
return true;
|
|
}
|
|
JSLinearString *strlin = str->ensureLinear(cx);
|
|
if (!strlin)
|
|
return false;
|
|
|
|
/* Steps 11-15. */
|
|
JSObject *aobj;
|
|
if (re) {
|
|
aobj = SplitHelper(cx, strlin, limit, SplitRegExpMatcher(re, cx->regExpStatics()), type);
|
|
} else {
|
|
// NB: sepstr is anchored through its storage in vp[2].
|
|
aobj = SplitHelper(cx, strlin, limit, SplitStringMatcher(sepstr), type);
|
|
}
|
|
if (!aobj)
|
|
return false;
|
|
|
|
/* Step 16. */
|
|
aobj->setType(type);
|
|
vp->setObject(*aobj);
|
|
return true;
|
|
}
|
|
|
|
#if JS_HAS_PERL_SUBSTR
|
|
static JSBool
|
|
str_substr(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
int32 length, len, begin;
|
|
if (argc > 0) {
|
|
length = int32(str->length());
|
|
if (!ValueToIntegerRange(cx, vp[2], &begin))
|
|
return false;
|
|
|
|
if (begin >= length) {
|
|
str = cx->runtime->emptyString;
|
|
goto out;
|
|
}
|
|
if (begin < 0) {
|
|
begin += length; /* length + INT_MIN will always be less then 0 */
|
|
if (begin < 0)
|
|
begin = 0;
|
|
}
|
|
|
|
if (argc == 1 || vp[3].isUndefined()) {
|
|
len = length - begin;
|
|
} else {
|
|
if (!ValueToIntegerRange(cx, vp[3], &len))
|
|
return false;
|
|
|
|
if (len <= 0) {
|
|
str = cx->runtime->emptyString;
|
|
goto out;
|
|
}
|
|
|
|
if (uint32(length) < uint32(begin + len))
|
|
len = length - begin;
|
|
}
|
|
|
|
str = js_NewDependentString(cx, str, size_t(begin), size_t(len));
|
|
if (!str)
|
|
return false;
|
|
}
|
|
|
|
out:
|
|
vp->setString(str);
|
|
return true;
|
|
}
|
|
#endif /* JS_HAS_PERL_SUBSTR */
|
|
|
|
/*
|
|
* Python-esque sequence operations.
|
|
*/
|
|
static JSBool
|
|
str_concat(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
Value *argv = JS_ARGV(cx, vp);
|
|
for (uintN i = 0; i < argc; i++) {
|
|
JSString *str2 = js_ValueToString(cx, argv[i]);
|
|
if (!str2)
|
|
return false;
|
|
|
|
str = js_ConcatStrings(cx, str, str2);
|
|
if (!str)
|
|
return false;
|
|
}
|
|
|
|
JS_SET_RVAL(cx, vp, StringValue(str));
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_slice(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
if (argc == 1 && vp[1].isString() && vp[2].isInt32()) {
|
|
size_t begin, end, length;
|
|
|
|
JSString *str = vp[1].toString();
|
|
begin = vp[2].toInt32();
|
|
end = str->length();
|
|
if (begin <= end) {
|
|
length = end - begin;
|
|
if (length == 0) {
|
|
str = cx->runtime->emptyString;
|
|
} else {
|
|
str = (length == 1)
|
|
? JSAtom::getUnitStringForElement(cx, str, begin)
|
|
: js_NewDependentString(cx, str, begin, length);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
}
|
|
vp->setString(str);
|
|
return JS_TRUE;
|
|
}
|
|
}
|
|
|
|
JSString *str = ThisToStringForStringProto(cx, vp);
|
|
if (!str)
|
|
return false;
|
|
|
|
if (argc != 0) {
|
|
double begin, end, length;
|
|
|
|
if (!ToInteger(cx, vp[2], &begin))
|
|
return false;
|
|
length = str->length();
|
|
if (begin < 0) {
|
|
begin += length;
|
|
if (begin < 0)
|
|
begin = 0;
|
|
} else if (begin > length) {
|
|
begin = length;
|
|
}
|
|
|
|
if (argc == 1 || vp[3].isUndefined()) {
|
|
end = length;
|
|
} else {
|
|
if (!ToInteger(cx, vp[3], &end))
|
|
return false;
|
|
if (end < 0) {
|
|
end += length;
|
|
if (end < 0)
|
|
end = 0;
|
|
} else if (end > length) {
|
|
end = length;
|
|
}
|
|
if (end < begin)
|
|
end = begin;
|
|
}
|
|
|
|
str = js_NewDependentString(cx, str,
|
|
(size_t)begin,
|
|
(size_t)(end - begin));
|
|
if (!str)
|
|
return JS_FALSE;
|
|
}
|
|
vp->setString(str);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
#if JS_HAS_STR_HTML_HELPERS
|
|
/*
|
|
* HTML composition aids.
|
|
*/
|
|
static bool
|
|
tagify(JSContext *cx, const char *begin, JSLinearString *param, const char *end,
|
|
Value *vp)
|
|
{
|
|
JSString *thisstr = ThisToStringForStringProto(cx, vp);
|
|
if (!thisstr)
|
|
return false;
|
|
JSLinearString *str = thisstr->ensureLinear(cx);
|
|
if (!str)
|
|
return false;
|
|
|
|
if (!end)
|
|
end = begin;
|
|
|
|
size_t beglen = strlen(begin);
|
|
size_t taglen = 1 + beglen + 1; /* '<begin' + '>' */
|
|
size_t parlen = 0; /* Avoid warning. */
|
|
if (param) {
|
|
parlen = param->length();
|
|
taglen += 2 + parlen + 1; /* '="param"' */
|
|
}
|
|
size_t endlen = strlen(end);
|
|
taglen += str->length() + 2 + endlen + 1; /* 'str</end>' */
|
|
|
|
if (taglen >= ~(size_t)0 / sizeof(jschar)) {
|
|
js_ReportAllocationOverflow(cx);
|
|
return false;
|
|
}
|
|
|
|
jschar *tagbuf = (jschar *) cx->malloc_((taglen + 1) * sizeof(jschar));
|
|
if (!tagbuf)
|
|
return false;
|
|
|
|
size_t j = 0;
|
|
tagbuf[j++] = '<';
|
|
for (size_t i = 0; i < beglen; i++)
|
|
tagbuf[j++] = (jschar)begin[i];
|
|
if (param) {
|
|
tagbuf[j++] = '=';
|
|
tagbuf[j++] = '"';
|
|
js_strncpy(&tagbuf[j], param->chars(), parlen);
|
|
j += parlen;
|
|
tagbuf[j++] = '"';
|
|
}
|
|
tagbuf[j++] = '>';
|
|
|
|
js_strncpy(&tagbuf[j], str->chars(), str->length());
|
|
j += str->length();
|
|
tagbuf[j++] = '<';
|
|
tagbuf[j++] = '/';
|
|
for (size_t i = 0; i < endlen; i++)
|
|
tagbuf[j++] = (jschar)end[i];
|
|
tagbuf[j++] = '>';
|
|
JS_ASSERT(j == taglen);
|
|
tagbuf[j] = 0;
|
|
|
|
JSString *retstr = js_NewString(cx, tagbuf, taglen);
|
|
if (!retstr) {
|
|
Foreground::free_((char *)tagbuf);
|
|
return false;
|
|
}
|
|
vp->setString(retstr);
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
tagify_value(JSContext *cx, uintN argc, Value *vp,
|
|
const char *begin, const char *end)
|
|
{
|
|
JSLinearString *param = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!param)
|
|
return JS_FALSE;
|
|
return tagify(cx, begin, param, end, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_bold(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "b", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_italics(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "i", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_fixed(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "tt", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_fontsize(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify_value(cx, argc, vp, "font size", "font");
|
|
}
|
|
|
|
static JSBool
|
|
str_fontcolor(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify_value(cx, argc, vp, "font color", "font");
|
|
}
|
|
|
|
static JSBool
|
|
str_link(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify_value(cx, argc, vp, "a href", "a");
|
|
}
|
|
|
|
static JSBool
|
|
str_anchor(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify_value(cx, argc, vp, "a name", "a");
|
|
}
|
|
|
|
static JSBool
|
|
str_strike(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "strike", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_small(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "small", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_big(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "big", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_blink(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "blink", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_sup(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "sup", NULL, NULL, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_sub(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
return tagify(cx, "sub", NULL, NULL, vp);
|
|
}
|
|
#endif /* JS_HAS_STR_HTML_HELPERS */
|
|
|
|
#ifdef JS_TRACER
|
|
JSString* FASTCALL
|
|
js_String_getelem(JSContext* cx, JSString* str, int32 i)
|
|
{
|
|
if ((size_t)i >= str->length())
|
|
return NULL;
|
|
return JSAtom::getUnitStringForElement(cx, str, size_t(i));
|
|
}
|
|
#endif
|
|
|
|
JS_DEFINE_TRCINFO_1(str_concat,
|
|
(3, (extern, STRING_RETRY, js_ConcatStrings, CONTEXT, THIS_STRING, STRING,
|
|
1, nanojit::ACCSET_NONE)))
|
|
|
|
static JSFunctionSpec string_methods[] = {
|
|
#if JS_HAS_TOSOURCE
|
|
JS_FN("quote", str_quote, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN(js_toSource_str, str_toSource, 0,0),
|
|
#endif
|
|
|
|
/* Java-like methods. */
|
|
JS_FN(js_toString_str, js_str_toString, 0,0),
|
|
JS_FN(js_valueOf_str, js_str_toString, 0,0),
|
|
JS_FN("substring", str_substring, 2,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("toLowerCase", str_toLowerCase, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("toUpperCase", str_toUpperCase, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("charAt", js_str_charAt, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("charCodeAt", js_str_charCodeAt, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("indexOf", str_indexOf, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("lastIndexOf", str_lastIndexOf, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("trim", str_trim, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("trimLeft", str_trimLeft, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("trimRight", str_trimRight, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("toLocaleLowerCase", str_toLocaleLowerCase, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("toLocaleUpperCase", str_toLocaleUpperCase, 0,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("localeCompare", str_localeCompare, 1,JSFUN_GENERIC_NATIVE),
|
|
|
|
/* Perl-ish methods (search is actually Python-esque). */
|
|
JS_FN("match", str_match, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("search", str_search, 1,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("replace", str_replace, 2,JSFUN_GENERIC_NATIVE),
|
|
JS_FN("split", str_split, 2,JSFUN_GENERIC_NATIVE),
|
|
#if JS_HAS_PERL_SUBSTR
|
|
JS_FN("substr", str_substr, 2,JSFUN_GENERIC_NATIVE),
|
|
#endif
|
|
|
|
/* Python-esque sequence methods. */
|
|
JS_TN("concat", str_concat, 1,JSFUN_GENERIC_NATIVE, &str_concat_trcinfo),
|
|
JS_FN("slice", str_slice, 2,JSFUN_GENERIC_NATIVE),
|
|
|
|
/* HTML string methods. */
|
|
#if JS_HAS_STR_HTML_HELPERS
|
|
JS_FN("bold", str_bold, 0,0),
|
|
JS_FN("italics", str_italics, 0,0),
|
|
JS_FN("fixed", str_fixed, 0,0),
|
|
JS_FN("fontsize", str_fontsize, 1,0),
|
|
JS_FN("fontcolor", str_fontcolor, 1,0),
|
|
JS_FN("link", str_link, 1,0),
|
|
JS_FN("anchor", str_anchor, 1,0),
|
|
JS_FN("strike", str_strike, 0,0),
|
|
JS_FN("small", str_small, 0,0),
|
|
JS_FN("big", str_big, 0,0),
|
|
JS_FN("blink", str_blink, 0,0),
|
|
JS_FN("sup", str_sup, 0,0),
|
|
JS_FN("sub", str_sub, 0,0),
|
|
#endif
|
|
|
|
JS_FS_END
|
|
};
|
|
|
|
#ifdef JS_HAS_STATIC_STRINGS
|
|
|
|
/*
|
|
* Set up some tools to make it easier to generate large tables. After constant
|
|
* folding, for each n, Rn(0) is the comma-separated list R(0), R(1), ..., R(2^n-1).
|
|
* Similary, Rn(k) (for any k and n) generates the list R(k), R(k+1), ..., R(k+2^n-1).
|
|
* To use this, define R appropriately, then use Rn(0) (for some value of n), then
|
|
* undefine R.
|
|
*/
|
|
#define R2(n) R(n), R((n) + (1 << 0)), R((n) + (2 << 0)), R((n) + (3 << 0))
|
|
#define R4(n) R2(n), R2((n) + (1 << 2)), R2((n) + (2 << 2)), R2((n) + (3 << 2))
|
|
#define R6(n) R4(n), R4((n) + (1 << 4)), R4((n) + (2 << 4)), R4((n) + (3 << 4))
|
|
#define R8(n) R6(n), R6((n) + (1 << 6)), R6((n) + (2 << 6)), R6((n) + (3 << 6))
|
|
#define R10(n) R8(n), R8((n) + (1 << 8)), R8((n) + (2 << 8)), R8((n) + (3 << 8))
|
|
#define R12(n) R10(n), R10((n) + (1 << 10)), R10((n) + (2 << 10)), R10((n) + (3 << 10))
|
|
|
|
#define R3(n) R2(n), R2((n) + (1 << 2))
|
|
#define R7(n) R6(n), R6((n) + (1 << 6))
|
|
|
|
#define BUILD_LENGTH_AND_FLAGS(length, flags) \
|
|
(((length) << JSString::LENGTH_SHIFT) | (flags))
|
|
|
|
/*
|
|
* Declare unit strings. Pack the string data itself into the mInlineChars
|
|
* place in the header.
|
|
*/
|
|
#define R(c) { \
|
|
BUILD_LENGTH_AND_FLAGS(1, JSString::STATIC_ATOM_FLAGS), \
|
|
{ (jschar *)(uintptr_t(unitStaticTable + (c)) + \
|
|
offsetof(JSString::Data, inlineStorage)) }, \
|
|
{ {(c), 0x00} } }
|
|
|
|
/*
|
|
* For all the pragma pack usage in this file, the following logic applies:
|
|
* To apply: To reset:
|
|
* Sun CC: pack(#) / pack(0)
|
|
* IBM xlC: pack(#) / pack(pop)
|
|
* HP aCC: pack # / pack
|
|
* Others: pack(push, #) / pack(pop)
|
|
* The -Dlint case is explicitly excluded because GCC will error out when
|
|
* pack pragmas are used on unsupported platforms. If GCC is being used
|
|
* simply for error checking, these errors will be avoided.
|
|
*/
|
|
|
|
#if defined(__SUNPRO_CC) || defined(__xlC__)
|
|
#pragma pack(8)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack 8
|
|
#elif !defined(lint)
|
|
#pragma pack(push, 8)
|
|
#endif
|
|
|
|
const JSString::Data JSAtom::unitStaticTable[]
|
|
#if defined(__GNUC__) || defined(__xlC__)
|
|
__attribute__ ((aligned (8)))
|
|
#endif
|
|
= { R8(0) };
|
|
|
|
#if defined(__SUNPRO_CC)
|
|
#pragma pack(0)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack
|
|
#elif !defined(lint)
|
|
#pragma pack(pop)
|
|
#endif
|
|
|
|
#undef R
|
|
|
|
/*
|
|
* Declare length-2 strings. We only store strings where both characters are
|
|
* alphanumeric. The lower 10 short chars are the numerals, the next 26 are
|
|
* the lowercase letters, and the next 26 are the uppercase letters.
|
|
*/
|
|
#define TO_SMALL_CHAR(c) ((c) >= '0' && (c) <= '9' ? (c) - '0' : \
|
|
(c) >= 'a' && (c) <= 'z' ? (c) - 'a' + 10 : \
|
|
(c) >= 'A' && (c) <= 'Z' ? (c) - 'A' + 36 : \
|
|
JSAtom::INVALID_SMALL_CHAR)
|
|
|
|
#define R TO_SMALL_CHAR
|
|
|
|
const JSAtom::SmallChar JSAtom::toSmallChar[] = { R7(0) };
|
|
|
|
#undef R
|
|
|
|
/*
|
|
* This is used when we generate our table of short strings, so the compiler is
|
|
* happier if we use |c| as few times as possible.
|
|
*/
|
|
#define FROM_SMALL_CHAR(c) ((c) + ((c) < 10 ? '0' : \
|
|
(c) < 36 ? 'a' - 10 : \
|
|
'A' - 36))
|
|
#define R FROM_SMALL_CHAR
|
|
|
|
const jschar JSAtom::fromSmallChar[] = { R6(0) };
|
|
|
|
#undef R
|
|
|
|
/*
|
|
* For code-generation ease, length-2 strings are encoded as 12-bit int values,
|
|
* where the upper 6 bits is the first character and the lower 6 bits is the
|
|
* second character.
|
|
*/
|
|
#define R(c) { \
|
|
BUILD_LENGTH_AND_FLAGS(2, JSString::STATIC_ATOM_FLAGS), \
|
|
{ (jschar *)(uintptr_t(length2StaticTable + (c)) + \
|
|
offsetof(JSString::Data, inlineStorage)) }, \
|
|
{ {FROM_SMALL_CHAR((c) >> 6), FROM_SMALL_CHAR((c) & 0x3F), 0x00} } }
|
|
|
|
#if defined(__SUNPRO_CC) || defined(__xlC__)
|
|
#pragma pack(8)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack 8
|
|
#elif !defined(lint)
|
|
#pragma pack(push, 8)
|
|
#endif
|
|
|
|
const JSString::Data JSAtom::length2StaticTable[]
|
|
#if defined(__GNUC__) || defined(__xlC__)
|
|
__attribute__ ((aligned (8)))
|
|
#endif
|
|
= { R12(0) };
|
|
|
|
#if defined(__SUNPRO_CC)
|
|
#pragma pack(0)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack
|
|
#elif !defined(lint)
|
|
#pragma pack(pop)
|
|
#endif
|
|
|
|
#undef R
|
|
|
|
/*
|
|
* Declare int strings. Only int strings from 100 to 255 actually have to be
|
|
* generated, since the rest are either unit strings or length-2 strings. To
|
|
* avoid the runtime cost of figuring out where to look for the string for a
|
|
* particular integer, we precompute a table of JSString*s which refer to the
|
|
* correct location of the int string.
|
|
*/
|
|
#define R(c) { \
|
|
BUILD_LENGTH_AND_FLAGS(3, JSString::STATIC_ATOM_FLAGS), \
|
|
{ (jschar *)(uintptr_t(hundredStaticTable + ((c) - 100)) + \
|
|
offsetof(JSString::Data, inlineStorage)) }, \
|
|
{ {((c) / 100) + '0', ((c) / 10 % 10) + '0', ((c) % 10) + '0', 0x00} } }
|
|
|
|
|
|
JS_STATIC_ASSERT(100 + (1 << 7) + (1 << 4) + (1 << 3) + (1 << 2) == 256);
|
|
|
|
#if defined(__SUNPRO_CC) || defined(__xlC__)
|
|
#pragma pack(8)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack 8
|
|
#elif !defined(lint)
|
|
#pragma pack(push, 8)
|
|
#endif
|
|
|
|
const JSString::Data JSAtom::hundredStaticTable[]
|
|
#if defined(__GNUC__) || defined(__xlC__)
|
|
__attribute__ ((aligned (8)))
|
|
#endif
|
|
= { R7(100), /* 100 through 227 */
|
|
R4(100 + (1 << 7)), /* 228 through 243 */
|
|
R3(100 + (1 << 7) + (1 << 4)), /* 244 through 251 */
|
|
R2(100 + (1 << 7) + (1 << 4) + (1 << 3)) /* 252 through 255 */
|
|
};
|
|
|
|
#undef R
|
|
|
|
#define R(c) ((c) < 10 ? JSAtom::unitStaticTable + ((c) + '0') : \
|
|
(c) < 100 ? JSAtom::length2StaticTable + \
|
|
((size_t)TO_SMALL_CHAR(((c) / 10) + '0') << 6) + \
|
|
TO_SMALL_CHAR(((c) % 10) + '0') : \
|
|
JSAtom::hundredStaticTable + ((c) - 100))
|
|
|
|
const JSString::Data *const JSAtom::intStaticTable[] = { R8(0) };
|
|
|
|
#undef R
|
|
|
|
#if defined(__SUNPRO_CC)
|
|
#pragma pack(0)
|
|
#elif defined(__HP_aCC)
|
|
#pragma pack
|
|
#elif !defined(lint)
|
|
#pragma pack(pop)
|
|
#endif
|
|
|
|
#undef R2
|
|
#undef R4
|
|
#undef R6
|
|
#undef R8
|
|
#undef R10
|
|
#undef R12
|
|
|
|
#undef R3
|
|
#undef R7
|
|
|
|
#endif /* defined(JS_HAS_STATIC_STRINGS) */
|
|
|
|
JSBool
|
|
js_String(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
Value *argv = vp + 2;
|
|
|
|
JSString *str;
|
|
if (argc > 0) {
|
|
str = js_ValueToString(cx, argv[0]);
|
|
if (!str)
|
|
return false;
|
|
} else {
|
|
str = cx->runtime->emptyString;
|
|
}
|
|
|
|
if (IsConstructing(vp)) {
|
|
StringObject *strobj = StringObject::create(cx, str);
|
|
if (!strobj)
|
|
return false;
|
|
vp->setObject(*strobj);
|
|
} else {
|
|
vp->setString(str);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static JSBool
|
|
str_fromCharCode(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
Value *argv = JS_ARGV(cx, vp);
|
|
JS_ASSERT(argc <= StackSpace::ARGS_LENGTH_MAX);
|
|
if (argc == 1) {
|
|
uint16_t code;
|
|
if (!ValueToUint16(cx, argv[0], &code))
|
|
return JS_FALSE;
|
|
if (JSAtom::hasUnitStatic(code)) {
|
|
vp->setString(&JSAtom::unitStatic(code));
|
|
return JS_TRUE;
|
|
}
|
|
argv[0].setInt32(code);
|
|
}
|
|
jschar *chars = (jschar *) cx->malloc_((argc + 1) * sizeof(jschar));
|
|
if (!chars)
|
|
return JS_FALSE;
|
|
for (uintN i = 0; i < argc; i++) {
|
|
uint16_t code;
|
|
if (!ValueToUint16(cx, argv[i], &code)) {
|
|
cx->free_(chars);
|
|
return JS_FALSE;
|
|
}
|
|
chars[i] = (jschar)code;
|
|
}
|
|
chars[argc] = 0;
|
|
JSString *str = js_NewString(cx, chars, argc);
|
|
if (!str) {
|
|
cx->free_(chars);
|
|
return JS_FALSE;
|
|
}
|
|
vp->setString(str);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
#ifdef JS_TRACER
|
|
static JSString* FASTCALL
|
|
String_fromCharCode(JSContext* cx, int32 i)
|
|
{
|
|
JS_ASSERT(JS_ON_TRACE(cx));
|
|
jschar c = (jschar)i;
|
|
if (JSAtom::hasUnitStatic(c))
|
|
return &JSAtom::unitStatic(c);
|
|
return js_NewStringCopyN(cx, &c, 1);
|
|
}
|
|
#endif
|
|
|
|
JS_DEFINE_TRCINFO_1(str_fromCharCode,
|
|
(2, (static, STRING_RETRY, String_fromCharCode, CONTEXT, INT32, 1, nanojit::ACCSET_NONE)))
|
|
|
|
static JSFunctionSpec string_static_methods[] = {
|
|
JS_TN("fromCharCode", str_fromCharCode, 1, 0, &str_fromCharCode_trcinfo),
|
|
JS_FS_END
|
|
};
|
|
|
|
const Shape *
|
|
StringObject::assignInitialShape(JSContext *cx)
|
|
{
|
|
JS_ASSERT(!cx->compartment->initialStringShape);
|
|
JS_ASSERT(nativeEmpty());
|
|
|
|
return addDataProperty(cx, ATOM_TO_JSID(cx->runtime->atomState.lengthAtom),
|
|
LENGTH_SLOT, JSPROP_PERMANENT | JSPROP_READONLY);
|
|
}
|
|
|
|
JSObject *
|
|
js_InitStringClass(JSContext *cx, JSObject *obj)
|
|
{
|
|
JS_ASSERT(obj->isNative());
|
|
|
|
GlobalObject *global = obj->asGlobal();
|
|
|
|
JSObject *proto = global->createBlankPrototype(cx, &StringClass);
|
|
if (!proto || !proto->asString()->init(cx, cx->runtime->emptyString))
|
|
return NULL;
|
|
|
|
/* Now create the String function. */
|
|
JSFunction *ctor = global->createConstructor(cx, js_String, &StringClass,
|
|
CLASS_ATOM(cx, String), 1);
|
|
if (!ctor)
|
|
return NULL;
|
|
|
|
if (!LinkConstructorAndPrototype(cx, ctor, proto))
|
|
return NULL;
|
|
|
|
if (!DefinePropertiesAndBrand(cx, proto, NULL, string_methods) ||
|
|
!DefinePropertiesAndBrand(cx, ctor, NULL, string_static_methods))
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
/* Capture normal data properties pregenerated for String objects. */
|
|
TypeObject *type = proto->getNewType(cx);
|
|
if (!type)
|
|
return NULL;
|
|
AddTypeProperty(cx, type, "length", Type::Int32Type());
|
|
|
|
if (!DefineConstructorAndPrototype(cx, global, JSProto_String, ctor, proto))
|
|
return NULL;
|
|
|
|
/*
|
|
* Define escape/unescape, the URI encode/decode functions, and maybe
|
|
* uneval on the global object.
|
|
*/
|
|
if (!JS_DefineFunctions(cx, global, string_functions))
|
|
return NULL;
|
|
|
|
return proto;
|
|
}
|
|
|
|
JSFixedString *
|
|
js_NewString(JSContext *cx, jschar *chars, size_t length)
|
|
{
|
|
if (!CheckStringLength(cx, length))
|
|
return NULL;
|
|
|
|
JSFixedString *s = JSFixedString::new_(cx, chars, length);
|
|
Probes::createString(cx, s, length);
|
|
return s;
|
|
}
|
|
|
|
static JS_ALWAYS_INLINE JSFixedString *
|
|
NewShortString(JSContext *cx, const jschar *chars, size_t length)
|
|
{
|
|
/*
|
|
* Don't bother trying to find a static atom; measurement shows that not
|
|
* many get here (for one, Atomize is catching them).
|
|
*/
|
|
|
|
JS_ASSERT(JSShortString::lengthFits(length));
|
|
JSInlineString *str = JSInlineString::lengthFits(length)
|
|
? JSInlineString::new_(cx)
|
|
: JSShortString::new_(cx);
|
|
if (!str)
|
|
return NULL;
|
|
|
|
jschar *storage = str->init(length);
|
|
PodCopy(storage, chars, length);
|
|
storage[length] = 0;
|
|
Probes::createString(cx, str, length);
|
|
return str;
|
|
}
|
|
|
|
static JSInlineString *
|
|
NewShortString(JSContext *cx, const char *chars, size_t length)
|
|
{
|
|
JS_ASSERT(JSShortString::lengthFits(length));
|
|
JSInlineString *str = JSInlineString::lengthFits(length)
|
|
? JSInlineString::new_(cx)
|
|
: JSShortString::new_(cx);
|
|
if (!str)
|
|
return NULL;
|
|
|
|
jschar *storage = str->init(length);
|
|
if (js_CStringsAreUTF8) {
|
|
#ifdef DEBUG
|
|
size_t oldLength = length;
|
|
#endif
|
|
if (!InflateUTF8StringToBuffer(cx, chars, length, storage, &length))
|
|
return NULL;
|
|
JS_ASSERT(length <= oldLength);
|
|
storage[length] = 0;
|
|
str->resetLength(length);
|
|
} else {
|
|
size_t n = length;
|
|
jschar *p = storage;
|
|
while (n--)
|
|
*p++ = (unsigned char)*chars++;
|
|
*p = 0;
|
|
}
|
|
Probes::createString(cx, str, length);
|
|
return str;
|
|
}
|
|
|
|
jschar *
|
|
StringBuffer::extractWellSized()
|
|
{
|
|
size_t capacity = cb.capacity();
|
|
size_t length = cb.length();
|
|
|
|
jschar *buf = cb.extractRawBuffer();
|
|
if (!buf)
|
|
return NULL;
|
|
|
|
/* For medium/big buffers, avoid wasting more than 1/4 of the memory. */
|
|
JS_ASSERT(capacity >= length);
|
|
if (length > CharBuffer::sMaxInlineStorage &&
|
|
capacity - length > (length >> 2)) {
|
|
size_t bytes = sizeof(jschar) * (length + 1);
|
|
JSContext *cx = context();
|
|
jschar *tmp = (jschar *)cx->realloc_(buf, bytes);
|
|
if (!tmp) {
|
|
cx->free_(buf);
|
|
return NULL;
|
|
}
|
|
buf = tmp;
|
|
}
|
|
|
|
return buf;
|
|
}
|
|
|
|
JSFixedString *
|
|
StringBuffer::finishString()
|
|
{
|
|
JSContext *cx = context();
|
|
if (cb.empty())
|
|
return cx->runtime->atomState.emptyAtom;
|
|
|
|
size_t length = cb.length();
|
|
if (!checkLength(length))
|
|
return NULL;
|
|
|
|
JS_STATIC_ASSERT(JSShortString::MAX_SHORT_LENGTH < CharBuffer::InlineLength);
|
|
if (JSShortString::lengthFits(length))
|
|
return NewShortString(cx, cb.begin(), length);
|
|
|
|
if (!cb.append('\0'))
|
|
return NULL;
|
|
|
|
jschar *buf = extractWellSized();
|
|
if (!buf)
|
|
return NULL;
|
|
|
|
JSFixedString *str = js_NewString(cx, buf, length);
|
|
if (!str)
|
|
cx->free_(buf);
|
|
return str;
|
|
}
|
|
|
|
JSAtom *
|
|
StringBuffer::finishAtom()
|
|
{
|
|
JSContext *cx = context();
|
|
|
|
size_t length = cb.length();
|
|
if (length == 0)
|
|
return cx->runtime->atomState.emptyAtom;
|
|
|
|
JSAtom *atom = js_AtomizeChars(cx, cb.begin(), length);
|
|
cb.clear();
|
|
return atom;
|
|
}
|
|
|
|
JSLinearString *
|
|
js_NewDependentString(JSContext *cx, JSString *baseArg, size_t start, size_t length)
|
|
{
|
|
if (length == 0)
|
|
return cx->runtime->emptyString;
|
|
|
|
JSLinearString *base = baseArg->ensureLinear(cx);
|
|
if (!base)
|
|
return NULL;
|
|
|
|
if (start == 0 && length == base->length())
|
|
return base;
|
|
|
|
const jschar *chars = base->chars() + start;
|
|
|
|
if (JSLinearString *staticStr = JSAtom::lookupStatic(chars, length))
|
|
return staticStr;
|
|
|
|
JSLinearString *s = JSDependentString::new_(cx, base, chars, length);
|
|
Probes::createString(cx, s, length);
|
|
return s;
|
|
}
|
|
|
|
JSFixedString *
|
|
js_NewStringCopyN(JSContext *cx, const jschar *s, size_t n)
|
|
{
|
|
if (JSShortString::lengthFits(n))
|
|
return NewShortString(cx, s, n);
|
|
|
|
jschar *news = (jschar *) cx->malloc_((n + 1) * sizeof(jschar));
|
|
if (!news)
|
|
return NULL;
|
|
js_strncpy(news, s, n);
|
|
news[n] = 0;
|
|
JSFixedString *str = js_NewString(cx, news, n);
|
|
if (!str)
|
|
cx->free_(news);
|
|
return str;
|
|
}
|
|
|
|
JSFixedString *
|
|
js_NewStringCopyN(JSContext *cx, const char *s, size_t n)
|
|
{
|
|
if (JSShortString::lengthFits(n))
|
|
return NewShortString(cx, s, n);
|
|
|
|
jschar *chars = InflateString(cx, s, &n);
|
|
if (!chars)
|
|
return NULL;
|
|
JSFixedString *str = js_NewString(cx, chars, n);
|
|
if (!str)
|
|
cx->free_(chars);
|
|
return str;
|
|
}
|
|
|
|
JSFixedString *
|
|
js_NewStringCopyZ(JSContext *cx, const jschar *s)
|
|
{
|
|
size_t n = js_strlen(s);
|
|
if (JSShortString::lengthFits(n))
|
|
return NewShortString(cx, s, n);
|
|
|
|
size_t m = (n + 1) * sizeof(jschar);
|
|
jschar *news = (jschar *) cx->malloc_(m);
|
|
if (!news)
|
|
return NULL;
|
|
memcpy(news, s, m);
|
|
JSFixedString *str = js_NewString(cx, news, n);
|
|
if (!str)
|
|
cx->free_(news);
|
|
return str;
|
|
}
|
|
|
|
JSFixedString *
|
|
js_NewStringCopyZ(JSContext *cx, const char *s)
|
|
{
|
|
return js_NewStringCopyN(cx, s, strlen(s));
|
|
}
|
|
|
|
const char *
|
|
js_ValueToPrintable(JSContext *cx, const Value &v, JSAutoByteString *bytes, bool asSource)
|
|
{
|
|
JSString *str;
|
|
|
|
str = (asSource ? js_ValueToSource : js_ValueToString)(cx, v);
|
|
if (!str)
|
|
return NULL;
|
|
str = js_QuoteString(cx, str, 0);
|
|
if (!str)
|
|
return NULL;
|
|
return bytes->encode(cx, str);
|
|
}
|
|
|
|
JSString *
|
|
js_ValueToString(JSContext *cx, const Value &arg)
|
|
{
|
|
Value v = arg;
|
|
if (!ToPrimitive(cx, JSTYPE_STRING, &v))
|
|
return NULL;
|
|
|
|
JSString *str;
|
|
if (v.isString()) {
|
|
str = v.toString();
|
|
} else if (v.isInt32()) {
|
|
str = js_IntToString(cx, v.toInt32());
|
|
} else if (v.isDouble()) {
|
|
str = js_NumberToString(cx, v.toDouble());
|
|
} else if (v.isBoolean()) {
|
|
str = js_BooleanToString(cx, v.toBoolean());
|
|
} else if (v.isNull()) {
|
|
str = cx->runtime->atomState.nullAtom;
|
|
} else {
|
|
str = cx->runtime->atomState.typeAtoms[JSTYPE_VOID];
|
|
}
|
|
return str;
|
|
}
|
|
|
|
/* This function implements E-262-3 section 9.8, toString. */
|
|
bool
|
|
js::ValueToStringBufferSlow(JSContext *cx, const Value &arg, StringBuffer &sb)
|
|
{
|
|
Value v = arg;
|
|
if (!ToPrimitive(cx, JSTYPE_STRING, &v))
|
|
return false;
|
|
|
|
if (v.isString())
|
|
return sb.append(v.toString());
|
|
if (v.isNumber())
|
|
return NumberValueToStringBuffer(cx, v, sb);
|
|
if (v.isBoolean())
|
|
return BooleanToStringBuffer(cx, v.toBoolean(), sb);
|
|
if (v.isNull())
|
|
return sb.append(cx->runtime->atomState.nullAtom);
|
|
JS_ASSERT(v.isUndefined());
|
|
return sb.append(cx->runtime->atomState.typeAtoms[JSTYPE_VOID]);
|
|
}
|
|
|
|
JS_FRIEND_API(JSString *)
|
|
js_ValueToSource(JSContext *cx, const Value &v)
|
|
{
|
|
JS_CHECK_RECURSION(cx, return NULL);
|
|
|
|
if (v.isUndefined())
|
|
return cx->runtime->atomState.void0Atom;
|
|
if (v.isString())
|
|
return js_QuoteString(cx, v.toString(), '"');
|
|
if (v.isPrimitive()) {
|
|
/* Special case to preserve negative zero, _contra_ toString. */
|
|
if (v.isDouble() && JSDOUBLE_IS_NEGZERO(v.toDouble())) {
|
|
/* NB: _ucNstr rather than _ucstr to indicate non-terminated. */
|
|
static const jschar js_negzero_ucNstr[] = {'-', '0'};
|
|
|
|
return js_NewStringCopyN(cx, js_negzero_ucNstr, 2);
|
|
}
|
|
return js_ValueToString(cx, v);
|
|
}
|
|
|
|
Value rval = NullValue();
|
|
Value fval;
|
|
jsid id = ATOM_TO_JSID(cx->runtime->atomState.toSourceAtom);
|
|
if (!js_GetMethod(cx, &v.toObject(), id, JSGET_NO_METHOD_BARRIER, &fval))
|
|
return false;
|
|
if (js_IsCallable(fval)) {
|
|
if (!Invoke(cx, v, fval, 0, NULL, &rval))
|
|
return false;
|
|
}
|
|
|
|
return js_ValueToString(cx, rval);
|
|
}
|
|
|
|
namespace js {
|
|
|
|
bool
|
|
EqualStrings(JSContext *cx, JSString *str1, JSString *str2, JSBool *result)
|
|
{
|
|
if (str1 == str2) {
|
|
*result = true;
|
|
return true;
|
|
}
|
|
|
|
size_t length1 = str1->length();
|
|
if (length1 != str2->length()) {
|
|
*result = false;
|
|
return true;
|
|
}
|
|
|
|
JSLinearString *linear1 = str1->ensureLinear(cx);
|
|
if (!linear1)
|
|
return false;
|
|
JSLinearString *linear2 = str2->ensureLinear(cx);
|
|
if (!linear2)
|
|
return false;
|
|
|
|
*result = PodEqual(linear1->chars(), linear2->chars(), length1);
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
EqualStrings(JSLinearString *str1, JSLinearString *str2)
|
|
{
|
|
if (str1 == str2)
|
|
return true;
|
|
|
|
size_t length1 = str1->length();
|
|
if (length1 != str2->length())
|
|
return false;
|
|
|
|
return PodEqual(str1->chars(), str2->chars(), length1);
|
|
}
|
|
|
|
} /* namespace js */
|
|
|
|
JSBool JS_FASTCALL
|
|
js_EqualStringsOnTrace(JSContext *cx, JSString *str1, JSString *str2)
|
|
{
|
|
JSBool result;
|
|
return EqualStrings(cx, str1, str2, &result) ? result : JS_NEITHER;
|
|
}
|
|
JS_DEFINE_CALLINFO_3(extern, BOOL, js_EqualStringsOnTrace,
|
|
CONTEXT, STRING, STRING, 1, nanojit::ACCSET_NONE)
|
|
|
|
namespace js {
|
|
|
|
static bool
|
|
CompareStringsImpl(JSContext *cx, JSString *str1, JSString *str2, int32 *result)
|
|
{
|
|
JS_ASSERT(str1);
|
|
JS_ASSERT(str2);
|
|
|
|
if (str1 == str2) {
|
|
*result = 0;
|
|
return true;
|
|
}
|
|
|
|
size_t l1 = str1->length();
|
|
const jschar *s1 = str1->getChars(cx);
|
|
if (!s1)
|
|
return false;
|
|
|
|
size_t l2 = str2->length();
|
|
const jschar *s2 = str2->getChars(cx);
|
|
if (!s2)
|
|
return false;
|
|
|
|
size_t n = JS_MIN(l1, l2);
|
|
for (size_t i = 0; i < n; i++) {
|
|
if (int32 cmp = s1[i] - s2[i]) {
|
|
*result = cmp;
|
|
return true;
|
|
}
|
|
}
|
|
*result = (int32)(l1 - l2);
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
CompareStrings(JSContext *cx, JSString *str1, JSString *str2, int32 *result)
|
|
{
|
|
return CompareStringsImpl(cx, str1, str2, result);
|
|
}
|
|
|
|
} /* namespace js */
|
|
|
|
int32 JS_FASTCALL
|
|
js_CompareStringsOnTrace(JSContext *cx, JSString *str1, JSString *str2)
|
|
{
|
|
int32 result;
|
|
if (!CompareStringsImpl(cx, str1, str2, &result))
|
|
return INT32_MIN;
|
|
JS_ASSERT(result != INT32_MIN);
|
|
return result;
|
|
}
|
|
JS_DEFINE_CALLINFO_3(extern, INT32, js_CompareStringsOnTrace,
|
|
CONTEXT, STRING, STRING, 1, nanojit::ACCSET_NONE)
|
|
|
|
namespace js {
|
|
|
|
bool
|
|
StringEqualsAscii(JSLinearString *str, const char *asciiBytes)
|
|
{
|
|
size_t length = strlen(asciiBytes);
|
|
#ifdef DEBUG
|
|
for (size_t i = 0; i != length; ++i)
|
|
JS_ASSERT(unsigned(asciiBytes[i]) <= 127);
|
|
#endif
|
|
if (length != str->length())
|
|
return false;
|
|
const jschar *chars = str->chars();
|
|
for (size_t i = 0; i != length; ++i) {
|
|
if (unsigned(asciiBytes[i]) != unsigned(chars[i]))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
} /* namespacejs */
|
|
|
|
size_t
|
|
js_strlen(const jschar *s)
|
|
{
|
|
const jschar *t;
|
|
|
|
for (t = s; *t != 0; t++)
|
|
continue;
|
|
return (size_t)(t - s);
|
|
}
|
|
|
|
jschar *
|
|
js_strchr(const jschar *s, jschar c)
|
|
{
|
|
while (*s != 0) {
|
|
if (*s == c)
|
|
return (jschar *)s;
|
|
s++;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
jschar *
|
|
js_strchr_limit(const jschar *s, jschar c, const jschar *limit)
|
|
{
|
|
while (s < limit) {
|
|
if (*s == c)
|
|
return (jschar *)s;
|
|
s++;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
namespace js {
|
|
|
|
jschar *
|
|
InflateString(JSContext *cx, const char *bytes, size_t *lengthp, FlationCoding fc)
|
|
{
|
|
size_t nchars;
|
|
jschar *chars;
|
|
size_t nbytes = *lengthp;
|
|
|
|
if (js_CStringsAreUTF8 || fc == CESU8Encoding) {
|
|
if (!InflateUTF8StringToBuffer(cx, bytes, nbytes, NULL, &nchars, fc))
|
|
goto bad;
|
|
chars = (jschar *) cx->malloc_((nchars + 1) * sizeof (jschar));
|
|
if (!chars)
|
|
goto bad;
|
|
JS_ALWAYS_TRUE(InflateUTF8StringToBuffer(cx, bytes, nbytes, chars, &nchars, fc));
|
|
} else {
|
|
nchars = nbytes;
|
|
chars = (jschar *) cx->malloc_((nchars + 1) * sizeof(jschar));
|
|
if (!chars)
|
|
goto bad;
|
|
for (size_t i = 0; i < nchars; i++)
|
|
chars[i] = (unsigned char) bytes[i];
|
|
}
|
|
*lengthp = nchars;
|
|
chars[nchars] = 0;
|
|
return chars;
|
|
|
|
bad:
|
|
/*
|
|
* For compatibility with callers of JS_DecodeBytes we must zero lengthp
|
|
* on errors.
|
|
*/
|
|
*lengthp = 0;
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* May be called with null cx.
|
|
*/
|
|
char *
|
|
DeflateString(JSContext *cx, const jschar *chars, size_t nchars)
|
|
{
|
|
size_t nbytes, i;
|
|
char *bytes;
|
|
|
|
if (js_CStringsAreUTF8) {
|
|
nbytes = GetDeflatedStringLength(cx, chars, nchars);
|
|
if (nbytes == (size_t) -1)
|
|
return NULL;
|
|
bytes = (char *) (cx ? cx->malloc_(nbytes + 1) : OffTheBooks::malloc_(nbytes + 1));
|
|
if (!bytes)
|
|
return NULL;
|
|
JS_ALWAYS_TRUE(DeflateStringToBuffer(cx, chars, nchars, bytes, &nbytes));
|
|
} else {
|
|
nbytes = nchars;
|
|
bytes = (char *) (cx ? cx->malloc_(nbytes + 1) : OffTheBooks::malloc_(nbytes + 1));
|
|
if (!bytes)
|
|
return NULL;
|
|
for (i = 0; i < nbytes; i++)
|
|
bytes[i] = (char) chars[i];
|
|
}
|
|
bytes[nbytes] = 0;
|
|
return bytes;
|
|
}
|
|
|
|
size_t
|
|
GetDeflatedStringLength(JSContext *cx, const jschar *chars, size_t nchars)
|
|
{
|
|
if (!js_CStringsAreUTF8)
|
|
return nchars;
|
|
|
|
return GetDeflatedUTF8StringLength(cx, chars, nchars);
|
|
}
|
|
|
|
/*
|
|
* May be called with null cx through public API, see below.
|
|
*/
|
|
size_t
|
|
GetDeflatedUTF8StringLength(JSContext *cx, const jschar *chars,
|
|
size_t nchars, FlationCoding fc)
|
|
{
|
|
size_t nbytes;
|
|
const jschar *end;
|
|
uintN c, c2;
|
|
char buffer[10];
|
|
bool useCESU8 = fc == CESU8Encoding;
|
|
|
|
nbytes = nchars;
|
|
for (end = chars + nchars; chars != end; chars++) {
|
|
c = *chars;
|
|
if (c < 0x80)
|
|
continue;
|
|
if (0xD800 <= c && c <= 0xDFFF && !useCESU8) {
|
|
/* Surrogate pair. */
|
|
chars++;
|
|
|
|
/* nbytes sets 1 length since this is surrogate pair. */
|
|
nbytes--;
|
|
if (c >= 0xDC00 || chars == end)
|
|
goto bad_surrogate;
|
|
c2 = *chars;
|
|
if (c2 < 0xDC00 || c2 > 0xDFFF)
|
|
goto bad_surrogate;
|
|
c = ((c - 0xD800) << 10) + (c2 - 0xDC00) + 0x10000;
|
|
}
|
|
c >>= 11;
|
|
nbytes++;
|
|
while (c) {
|
|
c >>= 5;
|
|
nbytes++;
|
|
}
|
|
}
|
|
return nbytes;
|
|
|
|
bad_surrogate:
|
|
if (cx) {
|
|
JS_snprintf(buffer, 10, "0x%x", c);
|
|
JS_ReportErrorFlagsAndNumber(cx, JSREPORT_ERROR, js_GetErrorMessage,
|
|
NULL, JSMSG_BAD_SURROGATE_CHAR, buffer);
|
|
}
|
|
return (size_t) -1;
|
|
}
|
|
|
|
bool
|
|
DeflateStringToBuffer(JSContext *cx, const jschar *src, size_t srclen,
|
|
char *dst, size_t *dstlenp)
|
|
{
|
|
size_t dstlen, i;
|
|
|
|
dstlen = *dstlenp;
|
|
if (!js_CStringsAreUTF8) {
|
|
if (srclen > dstlen) {
|
|
for (i = 0; i < dstlen; i++)
|
|
dst[i] = (char) src[i];
|
|
if (cx) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BUFFER_TOO_SMALL);
|
|
}
|
|
return JS_FALSE;
|
|
}
|
|
for (i = 0; i < srclen; i++)
|
|
dst[i] = (char) src[i];
|
|
*dstlenp = srclen;
|
|
return JS_TRUE;
|
|
}
|
|
|
|
return DeflateStringToUTF8Buffer(cx, src, srclen, dst, dstlenp);
|
|
}
|
|
|
|
bool
|
|
DeflateStringToUTF8Buffer(JSContext *cx, const jschar *src, size_t srclen,
|
|
char *dst, size_t *dstlenp, FlationCoding fc)
|
|
{
|
|
size_t i, utf8Len;
|
|
jschar c, c2;
|
|
uint32 v;
|
|
uint8 utf8buf[6];
|
|
|
|
bool useCESU8 = fc == CESU8Encoding;
|
|
size_t dstlen = *dstlenp;
|
|
size_t origDstlen = dstlen;
|
|
|
|
while (srclen) {
|
|
c = *src++;
|
|
srclen--;
|
|
if ((c >= 0xDC00) && (c <= 0xDFFF) && !useCESU8)
|
|
goto badSurrogate;
|
|
if (c < 0xD800 || c > 0xDBFF || useCESU8) {
|
|
v = c;
|
|
} else {
|
|
if (srclen < 1)
|
|
goto badSurrogate;
|
|
c2 = *src;
|
|
if ((c2 < 0xDC00) || (c2 > 0xDFFF))
|
|
goto badSurrogate;
|
|
src++;
|
|
srclen--;
|
|
v = ((c - 0xD800) << 10) + (c2 - 0xDC00) + 0x10000;
|
|
}
|
|
if (v < 0x0080) {
|
|
/* no encoding necessary - performance hack */
|
|
if (dstlen == 0)
|
|
goto bufferTooSmall;
|
|
*dst++ = (char) v;
|
|
utf8Len = 1;
|
|
} else {
|
|
utf8Len = js_OneUcs4ToUtf8Char(utf8buf, v);
|
|
if (utf8Len > dstlen)
|
|
goto bufferTooSmall;
|
|
for (i = 0; i < utf8Len; i++)
|
|
*dst++ = (char) utf8buf[i];
|
|
}
|
|
dstlen -= utf8Len;
|
|
}
|
|
*dstlenp = (origDstlen - dstlen);
|
|
return JS_TRUE;
|
|
|
|
badSurrogate:
|
|
*dstlenp = (origDstlen - dstlen);
|
|
/* Delegate error reporting to the measurement function. */
|
|
if (cx)
|
|
GetDeflatedStringLength(cx, src - 1, srclen + 1);
|
|
return JS_FALSE;
|
|
|
|
bufferTooSmall:
|
|
*dstlenp = (origDstlen - dstlen);
|
|
if (cx) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BUFFER_TOO_SMALL);
|
|
}
|
|
return JS_FALSE;
|
|
}
|
|
|
|
bool
|
|
InflateStringToBuffer(JSContext *cx, const char *src, size_t srclen,
|
|
jschar *dst, size_t *dstlenp)
|
|
{
|
|
size_t dstlen, i;
|
|
|
|
if (js_CStringsAreUTF8)
|
|
return InflateUTF8StringToBuffer(cx, src, srclen, dst, dstlenp);
|
|
|
|
if (dst) {
|
|
dstlen = *dstlenp;
|
|
if (srclen > dstlen) {
|
|
for (i = 0; i < dstlen; i++)
|
|
dst[i] = (unsigned char) src[i];
|
|
if (cx) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BUFFER_TOO_SMALL);
|
|
}
|
|
return JS_FALSE;
|
|
}
|
|
for (i = 0; i < srclen; i++)
|
|
dst[i] = (unsigned char) src[i];
|
|
}
|
|
*dstlenp = srclen;
|
|
return JS_TRUE;
|
|
}
|
|
|
|
bool
|
|
InflateUTF8StringToBuffer(JSContext *cx, const char *src, size_t srclen,
|
|
jschar *dst, size_t *dstlenp, FlationCoding fc)
|
|
{
|
|
size_t dstlen, origDstlen, offset, j, n;
|
|
uint32 v;
|
|
|
|
dstlen = dst ? *dstlenp : (size_t) -1;
|
|
origDstlen = dstlen;
|
|
offset = 0;
|
|
bool useCESU8 = fc == CESU8Encoding;
|
|
|
|
while (srclen) {
|
|
v = (uint8) *src;
|
|
n = 1;
|
|
if (v & 0x80) {
|
|
while (v & (0x80 >> n))
|
|
n++;
|
|
if (n > srclen)
|
|
goto bufferTooSmall;
|
|
if (n == 1 || n > 4)
|
|
goto badCharacter;
|
|
for (j = 1; j < n; j++) {
|
|
if ((src[j] & 0xC0) != 0x80)
|
|
goto badCharacter;
|
|
}
|
|
v = Utf8ToOneUcs4Char((uint8 *)src, n);
|
|
if (v >= 0x10000 && !useCESU8) {
|
|
v -= 0x10000;
|
|
if (v > 0xFFFFF || dstlen < 2) {
|
|
*dstlenp = (origDstlen - dstlen);
|
|
if (cx) {
|
|
char buffer[10];
|
|
JS_snprintf(buffer, 10, "0x%x", v + 0x10000);
|
|
JS_ReportErrorFlagsAndNumber(cx,
|
|
JSREPORT_ERROR,
|
|
js_GetErrorMessage, NULL,
|
|
JSMSG_UTF8_CHAR_TOO_LARGE,
|
|
buffer);
|
|
}
|
|
return JS_FALSE;
|
|
}
|
|
if (dst) {
|
|
*dst++ = (jschar)((v >> 10) + 0xD800);
|
|
v = (jschar)((v & 0x3FF) + 0xDC00);
|
|
}
|
|
dstlen--;
|
|
}
|
|
}
|
|
if (!dstlen)
|
|
goto bufferTooSmall;
|
|
if (dst)
|
|
*dst++ = (jschar) v;
|
|
dstlen--;
|
|
offset += n;
|
|
src += n;
|
|
srclen -= n;
|
|
}
|
|
*dstlenp = (origDstlen - dstlen);
|
|
return JS_TRUE;
|
|
|
|
badCharacter:
|
|
*dstlenp = (origDstlen - dstlen);
|
|
if (cx) {
|
|
char buffer[10];
|
|
JS_snprintf(buffer, 10, "%d", offset);
|
|
JS_ReportErrorFlagsAndNumber(cx, JSREPORT_ERROR,
|
|
js_GetErrorMessage, NULL,
|
|
JSMSG_MALFORMED_UTF8_CHAR,
|
|
buffer);
|
|
}
|
|
return JS_FALSE;
|
|
|
|
bufferTooSmall:
|
|
*dstlenp = (origDstlen - dstlen);
|
|
if (cx) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BUFFER_TOO_SMALL);
|
|
}
|
|
return JS_FALSE;
|
|
}
|
|
|
|
} /* namepsace js */
|
|
|
|
const jschar js_uriReservedPlusPound_ucstr[] =
|
|
{';', '/', '?', ':', '@', '&', '=', '+', '$', ',', '#', 0};
|
|
const jschar js_uriUnescaped_ucstr[] =
|
|
{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
|
|
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
|
|
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
|
|
'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
|
|
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
|
|
'-', '_', '.', '!', '~', '*', '\'', '(', ')', 0};
|
|
|
|
#define ____ false
|
|
|
|
/*
|
|
* Identifier start chars:
|
|
* - 36: $
|
|
* - 65..90: A..Z
|
|
* - 95: _
|
|
* - 97..122: a..z
|
|
*/
|
|
const bool js_isidstart[] = {
|
|
/* 0 1 2 3 4 5 6 7 8 9 */
|
|
/* 0 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 1 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 2 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 3 */ ____, ____, ____, ____, ____, ____, true, ____, ____, ____,
|
|
/* 4 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 5 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 6 */ ____, ____, ____, ____, ____, true, true, true, true, true,
|
|
/* 7 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 8 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 9 */ true, ____, ____, ____, ____, true, ____, true, true, true,
|
|
/* 10 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 11 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 12 */ true, true, true, ____, ____, ____, ____, ____
|
|
};
|
|
|
|
/*
|
|
* Identifier chars:
|
|
* - 36: $
|
|
* - 48..57: 0..9
|
|
* - 65..90: A..Z
|
|
* - 95: _
|
|
* - 97..122: a..z
|
|
*/
|
|
const bool js_isident[] = {
|
|
/* 0 1 2 3 4 5 6 7 8 9 */
|
|
/* 0 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 1 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 2 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 3 */ ____, ____, ____, ____, ____, ____, true, ____, ____, ____,
|
|
/* 4 */ ____, ____, ____, ____, ____, ____, ____, ____, true, true,
|
|
/* 5 */ true, true, true, true, true, true, true, true, ____, ____,
|
|
/* 6 */ ____, ____, ____, ____, ____, true, true, true, true, true,
|
|
/* 7 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 8 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 9 */ true, ____, ____, ____, ____, true, ____, true, true, true,
|
|
/* 10 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 11 */ true, true, true, true, true, true, true, true, true, true,
|
|
/* 12 */ true, true, true, ____, ____, ____, ____, ____
|
|
};
|
|
|
|
/* Whitespace chars: '\t', '\n', '\v', '\f', '\r', ' '. */
|
|
const bool js_isspace[] = {
|
|
/* 0 1 2 3 4 5 6 7 8 9 */
|
|
/* 0 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, true,
|
|
/* 1 */ true, true, true, true, ____, ____, ____, ____, ____, ____,
|
|
/* 2 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 3 */ ____, ____, true, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 4 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 5 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 6 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 7 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 8 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 9 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 10 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 11 */ ____, ____, ____, ____, ____, ____, ____, ____, ____, ____,
|
|
/* 12 */ ____, ____, ____, ____, ____, ____, ____, ____
|
|
};
|
|
|
|
#undef ____
|
|
|
|
#define URI_CHUNK 64U
|
|
|
|
static inline bool
|
|
TransferBufferToString(JSContext *cx, StringBuffer &sb, Value *rval)
|
|
{
|
|
JSString *str = sb.finishString();
|
|
if (!str)
|
|
return false;
|
|
rval->setString(str);
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* ECMA 3, 15.1.3 URI Handling Function Properties
|
|
*
|
|
* The following are implementations of the algorithms
|
|
* given in the ECMA specification for the hidden functions
|
|
* 'Encode' and 'Decode'.
|
|
*/
|
|
static JSBool
|
|
Encode(JSContext *cx, JSString *str, const jschar *unescapedSet,
|
|
const jschar *unescapedSet2, Value *rval)
|
|
{
|
|
static const char HexDigits[] = "0123456789ABCDEF"; /* NB: uppercase */
|
|
|
|
size_t length = str->length();
|
|
const jschar *chars = str->getChars(cx);
|
|
if (!chars)
|
|
return JS_FALSE;
|
|
|
|
if (length == 0) {
|
|
rval->setString(cx->runtime->emptyString);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
StringBuffer sb(cx);
|
|
jschar hexBuf[4];
|
|
hexBuf[0] = '%';
|
|
hexBuf[3] = 0;
|
|
for (size_t k = 0; k < length; k++) {
|
|
jschar c = chars[k];
|
|
if (js_strchr(unescapedSet, c) ||
|
|
(unescapedSet2 && js_strchr(unescapedSet2, c))) {
|
|
if (!sb.append(c))
|
|
return JS_FALSE;
|
|
} else {
|
|
if ((c >= 0xDC00) && (c <= 0xDFFF)) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BAD_URI, NULL);
|
|
return JS_FALSE;
|
|
}
|
|
uint32 v;
|
|
if (c < 0xD800 || c > 0xDBFF) {
|
|
v = c;
|
|
} else {
|
|
k++;
|
|
if (k == length) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BAD_URI, NULL);
|
|
return JS_FALSE;
|
|
}
|
|
jschar c2 = chars[k];
|
|
if ((c2 < 0xDC00) || (c2 > 0xDFFF)) {
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
JSMSG_BAD_URI, NULL);
|
|
return JS_FALSE;
|
|
}
|
|
v = ((c - 0xD800) << 10) + (c2 - 0xDC00) + 0x10000;
|
|
}
|
|
uint8 utf8buf[4];
|
|
size_t L = js_OneUcs4ToUtf8Char(utf8buf, v);
|
|
for (size_t j = 0; j < L; j++) {
|
|
hexBuf[1] = HexDigits[utf8buf[j] >> 4];
|
|
hexBuf[2] = HexDigits[utf8buf[j] & 0xf];
|
|
if (!sb.append(hexBuf, 3))
|
|
return JS_FALSE;
|
|
}
|
|
}
|
|
}
|
|
|
|
return TransferBufferToString(cx, sb, rval);
|
|
}
|
|
|
|
static JSBool
|
|
Decode(JSContext *cx, JSString *str, const jschar *reservedSet, Value *rval)
|
|
{
|
|
size_t length = str->length();
|
|
const jschar *chars = str->getChars(cx);
|
|
if (!chars)
|
|
return JS_FALSE;
|
|
|
|
if (length == 0) {
|
|
rval->setString(cx->runtime->emptyString);
|
|
return JS_TRUE;
|
|
}
|
|
|
|
StringBuffer sb(cx);
|
|
for (size_t k = 0; k < length; k++) {
|
|
jschar c = chars[k];
|
|
if (c == '%') {
|
|
size_t start = k;
|
|
if ((k + 2) >= length)
|
|
goto report_bad_uri;
|
|
if (!JS7_ISHEX(chars[k+1]) || !JS7_ISHEX(chars[k+2]))
|
|
goto report_bad_uri;
|
|
jsuint B = JS7_UNHEX(chars[k+1]) * 16 + JS7_UNHEX(chars[k+2]);
|
|
k += 2;
|
|
if (!(B & 0x80)) {
|
|
c = (jschar)B;
|
|
} else {
|
|
intN n = 1;
|
|
while (B & (0x80 >> n))
|
|
n++;
|
|
if (n == 1 || n > 4)
|
|
goto report_bad_uri;
|
|
uint8 octets[4];
|
|
octets[0] = (uint8)B;
|
|
if (k + 3 * (n - 1) >= length)
|
|
goto report_bad_uri;
|
|
for (intN j = 1; j < n; j++) {
|
|
k++;
|
|
if (chars[k] != '%')
|
|
goto report_bad_uri;
|
|
if (!JS7_ISHEX(chars[k+1]) || !JS7_ISHEX(chars[k+2]))
|
|
goto report_bad_uri;
|
|
B = JS7_UNHEX(chars[k+1]) * 16 + JS7_UNHEX(chars[k+2]);
|
|
if ((B & 0xC0) != 0x80)
|
|
goto report_bad_uri;
|
|
k += 2;
|
|
octets[j] = (char)B;
|
|
}
|
|
uint32 v = Utf8ToOneUcs4Char(octets, n);
|
|
if (v >= 0x10000) {
|
|
v -= 0x10000;
|
|
if (v > 0xFFFFF)
|
|
goto report_bad_uri;
|
|
c = (jschar)((v & 0x3FF) + 0xDC00);
|
|
jschar H = (jschar)((v >> 10) + 0xD800);
|
|
if (!sb.append(H))
|
|
return JS_FALSE;
|
|
} else {
|
|
c = (jschar)v;
|
|
}
|
|
}
|
|
if (js_strchr(reservedSet, c)) {
|
|
if (!sb.append(chars + start, k - start + 1))
|
|
return JS_FALSE;
|
|
} else {
|
|
if (!sb.append(c))
|
|
return JS_FALSE;
|
|
}
|
|
} else {
|
|
if (!sb.append(c))
|
|
return JS_FALSE;
|
|
}
|
|
}
|
|
|
|
return TransferBufferToString(cx, sb, rval);
|
|
|
|
report_bad_uri:
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_BAD_URI);
|
|
/* FALL THROUGH */
|
|
|
|
return JS_FALSE;
|
|
}
|
|
|
|
static JSBool
|
|
str_decodeURI(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
return Decode(cx, str, js_uriReservedPlusPound_ucstr, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_decodeURI_Component(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
return Decode(cx, str, js_empty_ucstr, vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_encodeURI(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
return Encode(cx, str, js_uriReservedPlusPound_ucstr, js_uriUnescaped_ucstr,
|
|
vp);
|
|
}
|
|
|
|
static JSBool
|
|
str_encodeURI_Component(JSContext *cx, uintN argc, Value *vp)
|
|
{
|
|
JSLinearString *str = ArgToRootedString(cx, argc, vp, 0);
|
|
if (!str)
|
|
return JS_FALSE;
|
|
return Encode(cx, str, js_uriUnescaped_ucstr, NULL, vp);
|
|
}
|
|
|
|
/*
|
|
* Convert one UCS-4 char and write it into a UTF-8 buffer, which must be at
|
|
* least 4 bytes long. Return the number of UTF-8 bytes of data written.
|
|
*/
|
|
int
|
|
js_OneUcs4ToUtf8Char(uint8 *utf8Buffer, uint32 ucs4Char)
|
|
{
|
|
int utf8Length = 1;
|
|
|
|
JS_ASSERT(ucs4Char <= 0x10FFFF);
|
|
if (ucs4Char < 0x80) {
|
|
*utf8Buffer = (uint8)ucs4Char;
|
|
} else {
|
|
int i;
|
|
uint32 a = ucs4Char >> 11;
|
|
utf8Length = 2;
|
|
while (a) {
|
|
a >>= 5;
|
|
utf8Length++;
|
|
}
|
|
i = utf8Length;
|
|
while (--i) {
|
|
utf8Buffer[i] = (uint8)((ucs4Char & 0x3F) | 0x80);
|
|
ucs4Char >>= 6;
|
|
}
|
|
*utf8Buffer = (uint8)(0x100 - (1 << (8-utf8Length)) + ucs4Char);
|
|
}
|
|
return utf8Length;
|
|
}
|
|
|
|
/*
|
|
* Convert a utf8 character sequence into a UCS-4 character and return that
|
|
* character. It is assumed that the caller already checked that the sequence
|
|
* is valid.
|
|
*/
|
|
static uint32
|
|
Utf8ToOneUcs4Char(const uint8 *utf8Buffer, int utf8Length)
|
|
{
|
|
JS_ASSERT(1 <= utf8Length && utf8Length <= 4);
|
|
|
|
if (utf8Length == 1) {
|
|
JS_ASSERT(!(*utf8Buffer & 0x80));
|
|
return *utf8Buffer;
|
|
}
|
|
|
|
/* from Unicode 3.1, non-shortest form is illegal */
|
|
static const uint32 minucs4Table[] = { 0x80, 0x800, 0x10000 };
|
|
|
|
JS_ASSERT((*utf8Buffer & (0x100 - (1 << (7 - utf8Length)))) ==
|
|
(0x100 - (1 << (8 - utf8Length))));
|
|
uint32 ucs4Char = *utf8Buffer++ & ((1 << (7 - utf8Length)) - 1);
|
|
uint32 minucs4Char = minucs4Table[utf8Length - 2];
|
|
while (--utf8Length) {
|
|
JS_ASSERT((*utf8Buffer & 0xC0) == 0x80);
|
|
ucs4Char = (ucs4Char << 6) | (*utf8Buffer++ & 0x3F);
|
|
}
|
|
|
|
if (JS_UNLIKELY(ucs4Char < minucs4Char || (ucs4Char >= 0xD800 && ucs4Char <= 0xDFFF)))
|
|
return INVALID_UTF8;
|
|
|
|
return ucs4Char;
|
|
}
|
|
|
|
namespace js {
|
|
|
|
size_t
|
|
PutEscapedStringImpl(char *buffer, size_t bufferSize, FILE *fp, JSLinearString *str, uint32 quote)
|
|
{
|
|
enum {
|
|
STOP, FIRST_QUOTE, LAST_QUOTE, CHARS, ESCAPE_START, ESCAPE_MORE
|
|
} state;
|
|
|
|
JS_ASSERT(quote == 0 || quote == '\'' || quote == '"');
|
|
JS_ASSERT_IF(!buffer, bufferSize == 0);
|
|
JS_ASSERT_IF(fp, !buffer);
|
|
|
|
if (bufferSize == 0)
|
|
buffer = NULL;
|
|
else
|
|
bufferSize--;
|
|
|
|
const jschar *chars = str->chars();
|
|
const jschar *charsEnd = chars + str->length();
|
|
size_t n = 0;
|
|
state = FIRST_QUOTE;
|
|
uintN shift = 0;
|
|
uintN hex = 0;
|
|
uintN u = 0;
|
|
char c = 0; /* to quell GCC warnings */
|
|
|
|
for (;;) {
|
|
switch (state) {
|
|
case STOP:
|
|
goto stop;
|
|
case FIRST_QUOTE:
|
|
state = CHARS;
|
|
goto do_quote;
|
|
case LAST_QUOTE:
|
|
state = STOP;
|
|
do_quote:
|
|
if (quote == 0)
|
|
continue;
|
|
c = (char)quote;
|
|
break;
|
|
case CHARS:
|
|
if (chars == charsEnd) {
|
|
state = LAST_QUOTE;
|
|
continue;
|
|
}
|
|
u = *chars++;
|
|
if (u < ' ') {
|
|
if (u != 0) {
|
|
const char *escape = strchr(js_EscapeMap, (int)u);
|
|
if (escape) {
|
|
u = escape[1];
|
|
goto do_escape;
|
|
}
|
|
}
|
|
goto do_hex_escape;
|
|
}
|
|
if (u < 127) {
|
|
if (u == quote || u == '\\')
|
|
goto do_escape;
|
|
c = (char)u;
|
|
} else if (u < 0x100) {
|
|
goto do_hex_escape;
|
|
} else {
|
|
shift = 16;
|
|
hex = u;
|
|
u = 'u';
|
|
goto do_escape;
|
|
}
|
|
break;
|
|
do_hex_escape:
|
|
shift = 8;
|
|
hex = u;
|
|
u = 'x';
|
|
do_escape:
|
|
c = '\\';
|
|
state = ESCAPE_START;
|
|
break;
|
|
case ESCAPE_START:
|
|
JS_ASSERT(' ' <= u && u < 127);
|
|
c = (char)u;
|
|
state = ESCAPE_MORE;
|
|
break;
|
|
case ESCAPE_MORE:
|
|
if (shift == 0) {
|
|
state = CHARS;
|
|
continue;
|
|
}
|
|
shift -= 4;
|
|
u = 0xF & (hex >> shift);
|
|
c = (char)(u + (u < 10 ? '0' : 'A' - 10));
|
|
break;
|
|
}
|
|
if (buffer) {
|
|
JS_ASSERT(n <= bufferSize);
|
|
if (n != bufferSize) {
|
|
buffer[n] = c;
|
|
} else {
|
|
buffer[n] = '\0';
|
|
buffer = NULL;
|
|
}
|
|
} else if (fp) {
|
|
if (fputc(c, fp) < 0)
|
|
return size_t(-1);
|
|
}
|
|
n++;
|
|
}
|
|
stop:
|
|
if (buffer)
|
|
buffer[n] = '\0';
|
|
return n;
|
|
}
|
|
|
|
} /* namespace js */
|