Google Git
Sign in
cobalt / cobalt / b15365272e6489fad522fda39eabf582f874017d / . / src / third_party / mozjs / js / src / jsstr.cpp
blob: 3cc8cf543e37884230978ed28ba444e1933abaa6 [file] [log] [blame]
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/*
* 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 "jsstr.h"
#include "mozilla/Attributes.h"
#include "mozilla/CheckedInt.h"
#include "mozilla/FloatingPoint.h"
#include "mozilla/PodOperations.h"
#include <stdlib.h>
#include <string.h>
#include "jstypes.h"
#include "jsutil.h"
#include "jsprf.h"
#include "jsapi.h"
#include "jsarray.h"
#include "jsatom.h"
#include "jsbool.h"
#include "jscntxt.h"
#include "jsgc.h"
#include "jsnum.h"
#include "jsobj.h"
#include "jsopcode.h"
#include "jsversion.h"
#include "builtin/RegExp.h"
#include "vm/GlobalObject.h"
#include "vm/Interpreter.h"
#include "vm/NumericConversions.h"
#include "vm/RegExpObject.h"
#include "vm/ScopeObject.h"
#include "vm/Shape.h"
#include "vm/StringBuffer.h"
#include "jsinferinlines.h"
#include "jsstrinlines.h"
#include "jsautooplen.h" // generated headers last
#include "vm/Interpreter-inl.h"
#include "vm/RegExpObject-inl.h"
#include "vm/RegExpStatics-inl.h"
#include "vm/StringObject-inl.h"
#include "vm/String-inl.h"
#include "nb/memory_scope.h"
using namespace js;
using namespace js::gc;
using namespace js::types;
using namespace js::unicode;
using mozilla::CheckedInt;
using mozilla::IsNaN;
using mozilla::IsNegativeZero;
using mozilla::PodCopy;
using mozilla::PodEqual;
typedef Handle<JSLinearString*> HandleLinearString;
static JSLinearString *
ArgToRootedString(JSContext *cx, CallArgs &args, unsigned argno)
{
TRACK_MEMORY_SCOPE("Javascript");
if (argno >= args.length())
return cx->names().undefined;
JSString *str = ToString<CanGC>(cx, args.handleAt(argno));
if (!str)
return NULL;
args[argno] = StringValue(str);
return str->ensureLinear(cx);
}
/*
* Forward declarations for URI encode/decode and helper routines
*/
static JSBool
str_decodeURI(JSContext *cx, unsigned argc, Value *vp);
static JSBool
str_decodeURI_Component(JSContext *cx, unsigned argc, Value *vp);
static JSBool
str_encodeURI(JSContext *cx, unsigned argc, Value *vp);
static JSBool
str_encodeURI_Component(JSContext *cx, unsigned argc, Value *vp);
static const uint32_t INVALID_UTF8 = UINT32_MAX;
static const uint32_t REPLACE_UTF8 = 0xFFFD;
static uint32_t
Utf8ToOneUcs4Char(const uint8_t *utf8Buffer, int utf8Length);
/*
* Global string methods
*/
/* ES5 B.2.1 */
static JSBool
str_escape(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
const char digits[] = {'0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
JSLinearString *str = ArgToRootedString(cx, args, 0);
if (!str)
return false;
size_t length = str->length();
const jschar *chars = str->chars();
static const uint8_t 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
size_t count = 0;
for (size_t 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 false;
}
}
if (newlength >= ~(size_t)0 / sizeof(jschar)) {
js_ReportAllocationOverflow(cx);
return false;
}
jschar *newchars = cx->pod_malloc<jschar>(newlength + 1);
if (!newchars)
return 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<CanGC>(cx, newchars, newlength);
if (!retstr) {
js_free(newchars);
return false;
}
args.rval().setString(retstr);
return true;
}
static inline bool
Unhex4(const jschar *chars, jschar *result)
{
jschar a = chars[0],
b = chars[1],
c = chars[2],
d = chars[3];
if (!(JS7_ISHEX(a) && JS7_ISHEX(b) && JS7_ISHEX(c) && JS7_ISHEX(d)))
return false;
*result = (((((JS7_UNHEX(a) << 4) + JS7_UNHEX(b)) << 4) + JS7_UNHEX(c)) << 4) + JS7_UNHEX(d);
return true;
}
static inline bool
Unhex2(const jschar *chars, jschar *result)
{
jschar a = chars[0],
b = chars[1];
if (!(JS7_ISHEX(a) && JS7_ISHEX(b)))
return false;
*result = (JS7_UNHEX(a) << 4) + JS7_UNHEX(b);
return true;
}
/* ES5 B.2.2 */
static JSBool
str_unescape(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
/* Step 1. */
JSLinearString *str = ArgToRootedString(cx, args, 0);
if (!str)
return false;
/*
* NB: use signed integers for length/index to allow simple length
* comparisons without unsigned-underflow hazards.
*/
JS_STATIC_ASSERT(JSString::MAX_LENGTH <= INT_MAX);
/* Step 2. */
int length = str->length();
const jschar *chars = str->chars();
/* Step 3. */
StringBuffer sb(cx);
/*
* Note that the spec algorithm has been optimized to avoid building
* a string in the case where no escapes are present.
*/
/* Step 4. */
int k = 0;
bool building = false;
while (true) {
/* Step 5. */
if (k == length) {
JSLinearString *result;
if (building) {
result = sb.finishString();
if (!result)
return false;
} else {
result = str;
}
args.rval().setString(result);
return true;
}
/* Step 6. */
jschar c = chars[k];
/* Step 7. */
if (c != '%')
goto step_18;
/* Step 8. */
if (k > length - 6)
goto step_14;
/* Step 9. */
if (chars[k + 1] != 'u')
goto step_14;
#define ENSURE_BUILDING \
JS_BEGIN_MACRO \
if (!building) { \
building = true; \
if (!sb.reserve(length)) \
return false; \
sb.infallibleAppend(chars, chars + k); \
} \
JS_END_MACRO
/* Step 10-13. */
if (Unhex4(&chars[k + 2], &c)) {
ENSURE_BUILDING;
k += 5;
goto step_18;
}
step_14:
/* Step 14. */
if (k > length - 3)
goto step_18;
/* Step 15-17. */
if (Unhex2(&chars[k + 1], &c)) {
ENSURE_BUILDING;
k += 2;
}
step_18:
if (building)
sb.infallibleAppend(c);
/* Step 19. */
k += 1;
}
#undef ENSURE_BUILDING
}
#if JS_HAS_UNEVAL
static JSBool
str_uneval(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
JSString *str = ValueToSource(cx, args.get(0));
if (!str)
return false;
args.rval().setString(str);
return true;
}
#endif
static const 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
};
const jschar js_empty_ucstr[] = {0};
const JSSubString js_EmptySubString = {0, js_empty_ucstr};
static const unsigned STRING_ELEMENT_ATTRS = JSPROP_ENUMERATE | JSPROP_READONLY | JSPROP_PERMANENT;
static JSBool
str_enumerate(JSContext *cx, HandleObject obj)
{
RootedString str(cx, obj->as<StringObject>().unbox());
RootedValue value(cx);
for (size_t i = 0, length = str->length(); i < length; i++) {
JSString *str1 = js_NewDependentString(cx, str, i, 1);
if (!str1)
return false;
value.setString(str1);
if (!JSObject::defineElement(cx, obj, i, value,
JS_PropertyStub, JS_StrictPropertyStub,
STRING_ELEMENT_ATTRS))
{
return false;
}
}
return true;
}
static JSBool
str_resolve(JSContext *cx, HandleObject obj, HandleId id, unsigned flags,
MutableHandleObject objp)
{
TRACK_MEMORY_SCOPE("Javascript");
if (!JSID_IS_INT(id))
return true;
RootedString str(cx, obj->as<StringObject>().unbox());
int32_t slot = JSID_TO_INT(id);
if ((size_t)slot < str->length()) {
JSString *str1 = cx->runtime()->staticStrings.getUnitStringForElement(cx, str, size_t(slot));
if (!str1)
return false;
RootedValue value(cx, StringValue(str1));
if (!JSObject::defineElement(cx, obj, uint32_t(slot), value, NULL, NULL,
STRING_ELEMENT_ATTRS))
{
return false;
}
objp.set(obj);
}
return true;
}
Class StringObject::class_ = {
js_String_str,
JSCLASS_HAS_RESERVED_SLOTS(StringObject::RESERVED_SLOTS) |
JSCLASS_NEW_RESOLVE | JSCLASS_HAS_CACHED_PROTO(JSProto_String),
JS_PropertyStub, /* addProperty */
JS_DeletePropertyStub, /* delProperty */
JS_PropertyStub, /* getProperty */
JS_StrictPropertyStub, /* setProperty */
str_enumerate,
(JSResolveOp)str_resolve,
JS_ConvertStub
};
/*
* Returns a JSString * for the |this| value associated with 'call', 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, CallReceiver call)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_CHECK_RECURSION(cx, return NULL);
if (call.thisv().isString())
return call.thisv().toString();
if (call.thisv().isObject()) {
RootedObject obj(cx, &call.thisv().toObject());
if (obj->is<StringObject>()) {
Rooted<jsid> id(cx, NameToId(cx->names().toString));
if (ClassMethodIsNative(cx, obj, &StringObject::class_, id, js_str_toString)) {
JSString *str = obj->as<StringObject>().unbox();
call.setThis(StringValue(str));
return str;
}
}
} else if (call.thisv().isNullOrUndefined()) {
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_CANT_CONVERT_TO,
call.thisv().isNull() ? "null" : "undefined", "object");
return NULL;
}
JSString *str = ToStringSlow<CanGC>(cx, call.thisv());
if (!str)
return NULL;
call.setThis(StringValue(str));
return str;
}
JS_ALWAYS_INLINE bool
IsString(const Value &v)
{
return v.isString() || (v.isObject() && v.toObject().is<StringObject>());
}
#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, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
str = js_QuoteString(cx, str, '"');
if (!str)
return false;
args.rval().setString(str);
return true;
}
JS_ALWAYS_INLINE bool
str_toSource_impl(JSContext *cx, CallArgs args)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_ASSERT(IsString(args.thisv()));
Rooted<JSString*> str(cx, ToString<CanGC>(cx, args.thisv()));
if (!str)
return false;
str = js_QuoteString(cx, str, '"');
if (!str)
return false;
StringBuffer sb(cx);
if (!sb.append("(new String(") || !sb.append(str) || !sb.append("))"))
return false;
str = sb.finishString();
if (!str)
return false;
args.rval().setString(str);
return true;
}
JSBool
str_toSource(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
return CallNonGenericMethod<IsString, str_toSource_impl>(cx, args);
}
#endif /* JS_HAS_TOSOURCE */
JS_ALWAYS_INLINE bool
str_toString_impl(JSContext *cx, CallArgs args)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_ASSERT(IsString(args.thisv()));
args.rval().setString(args.thisv().isString()
? args.thisv().toString()
: args.thisv().toObject().as<StringObject>().unbox());
return true;
}
JSBool
js_str_toString(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
return CallNonGenericMethod<IsString, str_toString_impl>(cx, args);
}
/*
* Java-like string native methods.
*/
JS_ALWAYS_INLINE bool
ValueToIntegerRange(JSContext *cx, const Value &v, int32_t *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_t(d);
}
return true;
}
static JSString *
DoSubstr(JSContext *cx, JSString *str, size_t begin, size_t len)
{
TRACK_MEMORY_SCOPE("Javascript");
/*
* Optimization for one level deep ropes.
* This is common for the following pattern:
*
* while() {
* text = text.substr(0, x) + "bla" + text.substr(x)
* test.charCodeAt(x + 1)
* }
*/
if (str->isRope()) {
JSRope *rope = &str->asRope();
/* Substring is totally in leftChild of rope. */
if (begin + len <= rope->leftChild()->length()) {
str = rope->leftChild();
return js_NewDependentString(cx, str, begin, len);
}
/* Substring is totally in rightChild of rope. */
if (begin >= rope->leftChild()->length()) {
str = rope->rightChild();
begin -= rope->leftChild()->length();
return js_NewDependentString(cx, str, begin, len);
}
/*
* Requested substring is partly in the left and partly in right child.
* Create a rope of substrings for both childs.
*/
JS_ASSERT (begin < rope->leftChild()->length() &&
begin + len > rope->leftChild()->length());
size_t lhsLength = rope->leftChild()->length() - begin;
size_t rhsLength = begin + len - rope->leftChild()->length();
Rooted<JSRope *> ropeRoot(cx, rope);
RootedString lhs(cx, js_NewDependentString(cx, ropeRoot->leftChild(),
begin, lhsLength));
if (!lhs)
return NULL;
RootedString rhs(cx, js_NewDependentString(cx, ropeRoot->rightChild(), 0, rhsLength));
if (!rhs)
return NULL;
return JSRope::new_<CanGC>(cx, lhs, rhs, len);
}
return js_NewDependentString(cx, str, begin, len);
}
static JSBool
str_substring(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
JSString *str = ThisToStringForStringProto(cx, args);
if (!str)
return false;
int32_t length, begin, end;
if (args.length() > 0) {
end = length = int32_t(str->length());
if (args[0].isInt32()) {
begin = args[0].toInt32();
} else {
RootedString strRoot(cx, str);
if (!ValueToIntegerRange(cx, args[0], &begin))
return false;
str = strRoot;
}
if (begin < 0)
begin = 0;
else if (begin > length)
begin = length;
if (args.hasDefined(1)) {
if (args[1].isInt32()) {
end = args[1].toInt32();
} else {
RootedString strRoot(cx, str);
if (!ValueToIntegerRange(cx, args[1], &end))
return false;
str = strRoot;
}
if (end > length) {
end = length;
} else {
if (end < 0)
end = 0;
if (end < begin) {
int32_t tmp = begin;
begin = end;
end = tmp;
}
}
}
str = DoSubstr(cx, str, size_t(begin), size_t(end - begin));
if (!str)
return false;
}
args.rval().setString(str);
return true;
}
JSString* JS_FASTCALL
js_toLowerCase(JSContext *cx, JSString *str)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t n = str->length();
const jschar *s = str->getChars(cx);
if (!s)
return NULL;
jschar *news = cx->pod_malloc<jschar>(n + 1);
if (!news)
return NULL;
for (size_t i = 0; i < n; i++)
news[i] = unicode::ToLowerCase(s[i]);
news[n] = 0;
str = js_NewString<CanGC>(cx, news, n);
if (!str) {
js_free(news);
return NULL;
}
return str;
}
static inline bool
ToLowerCaseHelper(JSContext *cx, CallReceiver call)
{
RootedString str(cx, ThisToStringForStringProto(cx, call));
if (!str)
return false;
str = js_toLowerCase(cx, str);
if (!str)
return false;
call.rval().setString(str);
return true;
}
static JSBool
str_toLowerCase(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
return ToLowerCaseHelper(cx, CallArgsFromVp(argc, vp));
}
static JSBool
str_toLocaleLowerCase(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
/*
* Forcefully ignore the first (or any) argument and return toLowerCase(),
* ECMA has reserved that argument, presumably for defining the locale.
*/
if (cx->runtime()->localeCallbacks && cx->runtime()->localeCallbacks->localeToLowerCase) {
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
RootedValue result(cx);
if (!cx->runtime()->localeCallbacks->localeToLowerCase(cx, str, &result))
return false;
args.rval().set(result);
return true;
}
return ToLowerCaseHelper(cx, args);
}
JSString* JS_FASTCALL
js_toUpperCase(JSContext *cx, JSString *str)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t n = str->length();
const jschar *s = str->getChars(cx);
if (!s)
return NULL;
jschar *news = cx->pod_malloc<jschar>(n + 1);
if (!news)
return NULL;
for (size_t i = 0; i < n; i++)
news[i] = unicode::ToUpperCase(s[i]);
news[n] = 0;
str = js_NewString<CanGC>(cx, news, n);
if (!str) {
js_free(news);
return NULL;
}
return str;
}
static JSBool
ToUpperCaseHelper(JSContext *cx, CallReceiver call)
{
RootedString str(cx, ThisToStringForStringProto(cx, call));
if (!str)
return false;
str = js_toUpperCase(cx, str);
if (!str)
return false;
call.rval().setString(str);
return true;
}
static JSBool
str_toUpperCase(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
return ToUpperCaseHelper(cx, CallArgsFromVp(argc, vp));
}
static JSBool
str_toLocaleUpperCase(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
/*
* Forcefully ignore the first (or any) argument and return toUpperCase(),
* ECMA has reserved that argument, presumably for defining the locale.
*/
if (cx->runtime()->localeCallbacks && cx->runtime()->localeCallbacks->localeToUpperCase) {
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
RootedValue result(cx);
if (!cx->runtime()->localeCallbacks->localeToUpperCase(cx, str, &result))
return false;
args.rval().set(result);
return true;
}
return ToUpperCaseHelper(cx, args);
}
#if !ENABLE_INTL_API
static JSBool
str_localeCompare(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
RootedString thatStr(cx, ToString<CanGC>(cx, args.handleOrUndefinedAt(0)));
if (!thatStr)
return false;
if (cx->runtime()->localeCallbacks && cx->runtime()->localeCallbacks->localeCompare) {
RootedValue result(cx);
if (!cx->runtime()->localeCallbacks->localeCompare(cx, str, thatStr, &result))
return false;
args.rval().set(result);
return true;
}
int32_t result;
if (!CompareStrings(cx, str, thatStr, &result))
return false;
args.rval().setInt32(result);
return true;
}
#endif
JSBool
js_str_charAt(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx);
size_t i;
if (args.thisv().isString() && args.length() != 0 && args[0].isInt32()) {
str = args.thisv().toString();
i = size_t(args[0].toInt32());
if (i >= str->length())
goto out_of_range;
} else {
str = ThisToStringForStringProto(cx, args);
if (!str)
return false;
double d = 0.0;
if (args.length() > 0 && !ToInteger(cx, args[0], &d))
return false;
if (d < 0 || str->length() <= d)
goto out_of_range;
i = size_t(d);
}
str = cx->runtime()->staticStrings.getUnitStringForElement(cx, str, i);
if (!str)
return false;
args.rval().setString(str);
return true;
out_of_range:
args.rval().setString(cx->runtime()->emptyString);
return true;
}
JSBool
js_str_charCodeAt(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx);
size_t i;
if (args.thisv().isString() && args.length() != 0 && args[0].isInt32()) {
str = args.thisv().toString();
i = size_t(args[0].toInt32());
if (i >= str->length())
goto out_of_range;
} else {
str = ThisToStringForStringProto(cx, args);
if (!str)
return false;
double d = 0.0;
if (args.length() > 0 && !ToInteger(cx, args[0], &d))
return false;
if (d < 0 || str->length() <= d)
goto out_of_range;
i = size_t(d);
}
jschar c;
if (!str->getChar(cx, i, &c))
return false;
args.rval().setInt32(c);
return true;
out_of_range:
args.rval().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 uint32_t sBMHCharSetSize = 256; /* ISO-Latin-1 */
static const uint32_t sBMHPatLenMax = 255; /* skip table element is uint8_t */
static const int sBMHBadPattern = -2; /* return value if pat is not ISO-Latin-1 */
int
js_BoyerMooreHorspool(const jschar *text, uint32_t textlen,
const jschar *pat, uint32_t patlen)
{
uint8_t skip[sBMHCharSetSize];
JS_ASSERT(0 < patlen && patlen <= sBMHPatLenMax);
for (uint32_t i = 0; i < sBMHCharSetSize; i++)
skip[i] = (uint8_t)patlen;
uint32_t m = patlen - 1;
for (uint32_t i = 0; i < m; i++) {
jschar c = pat[i];
if (c >= sBMHCharSetSize)
return sBMHBadPattern;
skip[c] = (uint8_t)(m - i);
}
jschar c;
for (uint32_t k = m;
k < textlen;
k += ((c = text[k]) >= sBMHCharSetSize) ? patlen : skip[c]) {
for (uint32_t i = k, j = m; ; i--, j--) {
if (text[i] != pat[j])
break;
if (j == 0)
return static_cast<int>(i); /* safe: max string size */
}
}
return -1;
}
struct MemCmp {
typedef uint32_t Extent;
static JS_ALWAYS_INLINE Extent computeExtent(const jschar *, uint32_t 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, uint32_t 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 int
UnrolledMatch(const jschar *text, uint32_t textlen, const jschar *pat, uint32_t 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_t 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 int
StringMatch(const jschar *text, uint32_t textlen,
const jschar *pat, uint32_t 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) {
int 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;
bool
js::StringHasPattern(const jschar *text, uint32_t textlen,
const jschar *pat, uint32_t patlen)
{
return StringMatch(text, textlen, pat, patlen) != -1;
}
/*
* RopeMatch takes the text to search and the pattern 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, uint32_t patlen, int *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. */
int pos = 0;
for (JSLinearString **outerp = strs.begin(); outerp != strs.end(); ++outerp) {
/* Try to find a match within 'outer'. */
JSLinearString *outer = *outerp;
const jschar *chars = outer->chars();
size_t len = outer->length();
int matchResult = StringMatch(chars, len, pat, patlen);
if (matchResult != -1) {
/* Matched! */
*match = pos + matchResult;
return true;
}
/* Try to find a match starting in 'outer' and running into other nodes. */
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;
JSLinearString **innerp = outerp;
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;
}
/* ES6 20121026 draft 15.5.4.24. */
static JSBool
str_contains(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
// Steps 1, 2, and 3
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
// Steps 4 and 5
Rooted<JSLinearString*> searchStr(cx, ArgToRootedString(cx, args, 0));
if (!searchStr)
return false;
// Steps 6 and 7
uint32_t pos = 0;
if (args.hasDefined(1)) {
if (args[1].isInt32()) {
int i = args[1].toInt32();
pos = (i < 0) ? 0U : uint32_t(i);
} else {
double d;
if (!ToInteger(cx, args[1], &d))
return false;
pos = uint32_t(Min(Max(d, 0.0), double(UINT32_MAX)));
}
}
// Step 8
uint32_t textLen = str->length();
const jschar *textChars = str->getChars(cx);
if (!textChars)
return false;
// Step 9
uint32_t start = Min(Max(pos, 0U), textLen);
// Step 10
uint32_t searchLen = searchStr->length();
const jschar *searchChars = searchStr->chars();
// Step 11
textChars += start;
textLen -= start;
int match = StringMatch(textChars, textLen, searchChars, searchLen);
args.rval().setBoolean(match != -1);
return true;
}
/* ES6 20120927 draft 15.5.4.7. */
static JSBool
str_indexOf(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
// Steps 1, 2, and 3
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
// Steps 4 and 5
Rooted<JSLinearString*> searchStr(cx, ArgToRootedString(cx, args, 0));
if (!searchStr)
return false;
// Steps 6 and 7
uint32_t pos = 0;
if (args.hasDefined(1)) {
if (args[1].isInt32()) {
int i = args[1].toInt32();
pos = (i < 0) ? 0U : uint32_t(i);
} else {
double d;
if (!ToInteger(cx, args[1], &d))
return false;
pos = uint32_t(Min(Max(d, 0.0), double(UINT32_MAX)));
}
}
// Step 8
uint32_t textLen = str->length();
const jschar *textChars = str->getChars(cx);
if (!textChars)
return false;
// Step 9
uint32_t start = Min(Max(pos, 0U), textLen);
// Step 10
uint32_t searchLen = searchStr->length();
const jschar *searchChars = searchStr->chars();
// Step 11
textChars += start;
textLen -= start;
int match = StringMatch(textChars, textLen, searchChars, searchLen);
args.rval().setInt32((match == -1) ? -1 : start + match);
return true;
}
static JSBool
str_lastIndexOf(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString textstr(cx, ThisToStringForStringProto(cx, args));
if (!textstr)
return false;
size_t textlen = textstr->length();
Rooted<JSLinearString*> patstr(cx, ArgToRootedString(cx, args, 0));
if (!patstr)
return false;
size_t patlen = patstr->length();
int i = textlen - patlen; // Start searching here
if (i < 0) {
args.rval().setInt32(-1);
return true;
}
if (args.length() > 1) {
if (args[1].isInt32()) {
int j = args[1].toInt32();
if (j <= 0)
i = 0;
else if (j < i)
i = j;
} else {
double d;
if (!ToNumber(cx, args[1], &d))
return false;
if (!IsNaN(d)) {
d = ToInteger(d);
if (d <= 0)
i = 0;
else if (d < i)
i = (int)d;
}
}
}
if (patlen == 0) {
args.rval().setInt32(i);
return true;
}
const jschar *text = textstr->getChars(cx);
if (!text)
return false;
const jschar *pat = patstr->chars();
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;
}
args.rval().setInt32(t - text);
return true;
}
break_continue:;
}
args.rval().setInt32(-1);
return true;
}
/* ES6 20120927 draft 15.5.4.22. */
static JSBool
str_startsWith(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
// Steps 1, 2, and 3
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
// Steps 4 and 5
Rooted<JSLinearString*> searchStr(cx, ArgToRootedString(cx, args, 0));
if (!searchStr)
return false;
// Steps 6 and 7
uint32_t pos = 0;
if (args.hasDefined(1)) {
if (args[1].isInt32()) {
int i = args[1].toInt32();
pos = (i < 0) ? 0U : uint32_t(i);
} else {
double d;
if (!ToInteger(cx, args[1], &d))
return false;
pos = uint32_t(Min(Max(d, 0.0), double(UINT32_MAX)));
}
}
// Step 8
uint32_t textLen = str->length();
const jschar *textChars = str->getChars(cx);
if (!textChars)
return false;
// Step 9
uint32_t start = Min(Max(pos, 0U), textLen);
// Step 10
uint32_t searchLen = searchStr->length();
const jschar *searchChars = searchStr->chars();
// Step 11
if (searchLen + start < searchLen || searchLen + start > textLen) {
args.rval().setBoolean(false);
return true;
}
// Steps 12 and 13
args.rval().setBoolean(PodEqual(textChars + start, searchChars, searchLen));
return true;
}
/* ES6 20120708 draft 15.5.4.23. */
static JSBool
str_endsWith(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
// Steps 1, 2, and 3
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
// Steps 4 and 5
Rooted<JSLinearString *> searchStr(cx, ArgToRootedString(cx, args, 0));
if (!searchStr)
return false;
// Step 6
uint32_t textLen = str->length();
// Steps 7 and 8
uint32_t pos = textLen;
if (args.hasDefined(1)) {
if (args[1].isInt32()) {
int i = args[1].toInt32();
pos = (i < 0) ? 0U : uint32_t(i);
} else {
double d;
if (!ToInteger(cx, args[1], &d))
return false;
pos = uint32_t(Min(Max(d, 0.0), double(UINT32_MAX)));
}
}
// Step 6
const jschar *textChars = str->getChars(cx);
if (!textChars)
return false;
// Step 9
uint32_t end = Min(Max(pos, 0U), textLen);
// Step 10
uint32_t searchLen = searchStr->length();
const jschar *searchChars = searchStr->chars();
// Step 12
if (searchLen > end) {
args.rval().setBoolean(false);
return true;
}
// Step 11
uint32_t start = end - searchLen;
// Steps 13 and 14
args.rval().setBoolean(PodEqual(textChars + start, searchChars, searchLen));
return true;
}
static JSBool
js_TrimString(JSContext *cx, Value *vp, JSBool trimLeft, JSBool trimRight)
{
TRACK_MEMORY_SCOPE("Javascript");
CallReceiver call = CallReceiverFromVp(vp);
RootedString str(cx, ThisToStringForStringProto(cx, call));
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;
call.rval().setString(str);
return true;
}
static JSBool
str_trim(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
return js_TrimString(cx, vp, JS_TRUE, JS_TRUE);
}
static JSBool
str_trimLeft(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
return js_TrimString(cx, vp, JS_TRUE, JS_FALSE);
}
static JSBool
str_trimRight(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
return js_TrimString(cx, vp, JS_FALSE, JS_TRUE);
}
/*
* Perl-inspired string functions.
*/
/* Result of a successfully performed flat match. */
class FlatMatch
{
RootedAtom patstr;
const jschar *pat;
size_t patlen;
int32_t match_;
friend class StringRegExpGuard;
public:
FlatMatch(JSContext *cx) : patstr(cx) {}
JSLinearString *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_t match() const { return match_; }
};
static inline bool
IsRegExpMetaChar(jschar c)
{
switch (c) {
/* Taken from the PatternCharacter production in 15.10.1. */
case '^': case '$': case '\\': case '.': case '*': case '+':
case '?': case '(': case ')': case '[': case ']': case '{':
case '}': case '|':
return true;
default:
return false;
}
}
static inline bool
HasRegExpMetaChars(const jschar *chars, size_t length)
{
for (size_t i = 0; i < length; ++i) {
if (IsRegExpMetaChar(chars[i]))
return true;
}
return false;
}
/*
* StringRegExpGuard factors logic out of String regexp operations.
*
* |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 StringRegExpGuard
{
StringRegExpGuard(const StringRegExpGuard &) MOZ_DELETE;
void operator=(const StringRegExpGuard &) MOZ_DELETE;
RegExpGuard re_;
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 JSAtom *
flattenPattern(JSContext *cx, JSAtom *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 (IsRegExpMetaChar(*it)) {
if (!sb.append(ESCAPE_CHAR) || !sb.append(*it))
return NULL;
} else {
if (!sb.append(*it))
return NULL;
}
}
return sb.finishAtom();
}
public:
StringRegExpGuard(JSContext *cx)
: re_(cx), fm(cx)
{ }
/* init must succeed in order to call tryFlatMatch or normalizeRegExp. */
bool init(JSContext *cx, CallArgs args, bool convertVoid = false)
{
if (args.length() != 0 && IsObjectWithClass(args[0], ESClass_RegExp, cx)) {
RootedObject obj(cx, &args[0].toObject());
if (!RegExpToShared(cx, obj, &re_))
return false;
} else {
if (convertVoid && !args.hasDefined(0)) {
fm.patstr = cx->runtime()->emptyString;
return true;
}
JSString *arg = ArgToRootedString(cx, args, 0);
if (!arg)
return false;
fm.patstr = AtomizeString<CanGC>(cx, arg);
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.
*
* |checkMetaChars| looks 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, unsigned optarg, unsigned argc,
bool checkMetaChars = true)
{
if (re_.initialized())
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 || HasRegExpMetaChars(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. */
bool normalizeRegExp(JSContext *cx, bool flat, unsigned optarg, CallArgs args)
{
if (re_.initialized())
return true;
/* Build RegExp from pattern string. */
RootedString opt(cx);
if (optarg < args.length()) {
opt = ToString<CanGC>(cx, args.handleAt(optarg));
if (!opt)
return false;
} else {
opt = NULL;
}
Rooted<JSAtom *> patstr(cx);
if (flat) {
patstr = flattenPattern(cx, fm.patstr);
if (!patstr)
return false;
} else {
patstr = fm.patstr;
}
JS_ASSERT(patstr);
return cx->compartment()->regExps.get(cx, patstr, opt, &re_);
}
RegExpShared &regExp() { return *re_; }
};
static bool
DoMatchLocal(JSContext *cx, CallArgs args, RegExpStatics *res, Handle<JSLinearString*> input,
RegExpShared &re)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t charsLen = input->length();
const jschar *chars = input->chars();
size_t i = 0;
ScopedMatchPairs matches(&cx->tempLifoAlloc());
RegExpRunStatus status = re.execute(cx, chars, charsLen, &i, matches);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success_NotFound) {
args.rval().setNull();
return true;
}
res->updateFromMatchPairs(cx, input, matches);
RootedValue rval(cx);
if (!CreateRegExpMatchResult(cx, input, chars, charsLen, matches, &rval))
return false;
args.rval().set(rval);
return true;
}
static bool
DoMatchGlobal(JSContext *cx, CallArgs args, RegExpStatics *res, Handle<JSLinearString*> input,
RegExpShared &re)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t charsLen = input->length();
const jschar *chars = input->chars();
AutoValueVector elements(cx);
MatchPair match;
size_t i = 0; /* Index used for iterating through the string. */
size_t lastMatch = 0; /* Index of last successful match. */
/* Accumulate results for each match. */
while (i <= charsLen) {
if (!JS_CHECK_OPERATION_LIMIT(cx))
return false;
size_t i_orig = i;
RegExpRunStatus status = re.executeMatchOnly(cx, chars, charsLen, &i, match);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success_NotFound)
break;
lastMatch = i_orig;
/* Extract the matched substring, root it, and remember it for later. */
JSLinearString *str = js_NewDependentString(cx, input, match.start, match.length());
if (!str)
return false;
if (!elements.append(StringValue(str)))
return false;
if (match.isEmpty())
++i;
}
/* If unmatched, return null. */
if (elements.empty()) {
args.rval().setNull();
return true;
}
/* The last successful match updates the RegExpStatics. */
res->updateLazily(cx, input, &re, lastMatch);
/* Copy the rooted vector into the array object. */
JSObject *array = NewDenseCopiedArray(cx, elements.length(), elements.begin());
if (!array)
return false;
args.rval().setObject(*array);
return true;
}
static bool
BuildFlatMatchArray(JSContext *cx, HandleString textstr, const FlatMatch &fm, CallArgs *args)
{
TRACK_MEMORY_SCOPE("Javascript");
if (fm.match() < 0) {
args->rval().setNull();
return true;
}
/* For this non-global match, produce a RegExp.exec-style array. */
RootedObject obj(cx, NewDenseEmptyArray(cx));
if (!obj)
return false;
RootedValue patternVal(cx, StringValue(fm.pattern()));
RootedValue matchVal(cx, Int32Value(fm.match()));
RootedValue textVal(cx, StringValue(textstr));
if (!JSObject::defineElement(cx, obj, 0, patternVal) ||
!JSObject::defineProperty(cx, obj, cx->names().index, matchVal) ||
!JSObject::defineProperty(cx, obj, cx->names().input, textVal))
{
return false;
}
args->rval().setObject(*obj);
return true;
}
JSBool
js::str_match(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
StringRegExpGuard g(cx);
if (!g.init(cx, args, true))
return false;
if (const FlatMatch *fm = g.tryFlatMatch(cx, str, 1, args.length()))
return BuildFlatMatchArray(cx, str, *fm, &args);
/* Return if there was an error in tryFlatMatch. */
if (cx->isExceptionPending())
return false;
if (!g.normalizeRegExp(cx, false, 1, args))
return false;
RegExpStatics *res = cx->regExpStatics();
Rooted<JSLinearString*> linearStr(cx, str->ensureLinear(cx));
if (!linearStr)
return false;
if (g.regExp().global())
return DoMatchGlobal(cx, args, res, linearStr, g.regExp());
return DoMatchLocal(cx, args, res, linearStr, g.regExp());
}
JSBool
js::str_search(JSContext *cx, unsigned argc, Value *vp)
{
CallArgs args = CallArgsFromVp(argc, vp);
RootedString str(cx, ThisToStringForStringProto(cx, args));
if (!str)
return false;
StringRegExpGuard g(cx);
if (!g.init(cx, args, true))
return false;
if (const FlatMatch *fm = g.tryFlatMatch(cx, str, 1, args.length())) {
args.rval().setInt32(fm->match());
return true;
}
if (cx->isExceptionPending()) /* from tryFlatMatch */
return false;
if (!g.normalizeRegExp(cx, false, 1, args))
return false;
Rooted<JSLinearString*> linearStr(cx, str->ensureLinear(cx));
if (!linearStr)
return false;
const jschar *chars = linearStr->chars();
size_t length = linearStr->length();
RegExpStatics *res = cx->regExpStatics();
/* Per ECMAv5 15.5.4.12 (5) The last index property is ignored and left unchanged. */
size_t i = 0;
MatchPair match;
RegExpRunStatus status = g.regExp().executeMatchOnly(cx, chars, length, &i, match);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success)
res->updateLazily(cx, linearStr, &g.regExp(), 0);
JS_ASSERT_IF(status == RegExpRunStatus_Success_NotFound, match.start == -1);
args.rval().setInt32(match.start);
return true;
}
struct ReplaceData
{
ReplaceData(JSContext *cx)
: str(cx), g(cx), lambda(cx), elembase(cx), repstr(cx),
dollarRoot(cx, &dollar), dollarEndRoot(cx, &dollarEnd),
fig(cx, NullValue()), sb(cx)
{}
RootedString str; /* 'this' parameter object as a string */
StringRegExpGuard g; /* regexp parameter object and private data */
RootedObject lambda; /* replacement function object or null */
RootedObject elembase; /* object for function(a){return b[a]} replace */
Rooted<JSLinearString*> repstr; /* replacement string */
const jschar *dollar; /* null or pointer to first $ in repstr */
const jschar *dollarEnd; /* limit pointer for js_strchr_limit */
SkipRoot dollarRoot; /* XXX prevent dollar from being relocated */
SkipRoot dollarEndRoot; /* ditto */
int leftIndex; /* left context index in str->chars */
JSSubString dollarStr; /* for "$$" InterpretDollar result */
bool calledBack; /* record whether callback has been called */
FastInvokeGuard fig; /* used for lambda calls, also holds arguments */
StringBuffer sb; /* buffer built during DoMatch */
};
static bool
ReplaceRegExp(JSContext *cx, RegExpStatics *res, ReplaceData &rdata);
static bool
DoMatchForReplaceLocal(JSContext *cx, RegExpStatics *res, Handle<JSLinearString*> linearStr,
RegExpShared &re, ReplaceData &rdata)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t charsLen = linearStr->length();
size_t i = 0;
ScopedMatchPairs matches(&cx->tempLifoAlloc());
RegExpRunStatus status = re.execute(cx, linearStr->chars(), charsLen, &i, matches);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success_NotFound)
return true;
res->updateFromMatchPairs(cx, linearStr, matches);
return ReplaceRegExp(cx, res, rdata);
}
static bool
DoMatchForReplaceGlobal(JSContext *cx, RegExpStatics *res, Handle<JSLinearString*> linearStr,
RegExpShared &re, ReplaceData &rdata)
{
TRACK_MEMORY_SCOPE("Javascript");
size_t charsLen = linearStr->length();
ScopedMatchPairs matches(&cx->tempLifoAlloc());
for (size_t count = 0, i = 0; i <= charsLen; ++count) {
if (!JS_CHECK_OPERATION_LIMIT(cx))
return false;
RegExpRunStatus status = re.execute(cx, linearStr->chars(), charsLen, &i, matches);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success_NotFound)
break;
res->updateFromMatchPairs(cx, linearStr, matches);
if (!ReplaceRegExp(cx, res, rdata))
return false;
if (!res->matched())
++i;
}
return true;
}
static bool
InterpretDollar(RegExpStatics *res, const jschar *dp, const jschar *ep,
ReplaceData &rdata, JSSubString *out, size_t *skip)
{
TRACK_MEMORY_SCOPE("Javascript");
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 */
unsigned num = JS7_UNDEC(dc);
if (num > res->getMatches().parenCount())
return false;
const jschar *cp = dp + 2;
if (cp < ep && (dc = *cp, JS7_ISDEC(dc))) {
unsigned tmp = 10 * num + JS7_UNDEC(dc);
if (tmp <= res->getMatches().parenCount()) {
cp++;
num = tmp;
}
}
if (num == 0)
return false;
*skip = cp - dp;
JS_ASSERT(num <= res->getMatches().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)
{
TRACK_MEMORY_SCOPE("Javascript");
if (rdata.elembase) {
/*
* 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(!rdata.elembase->getOps()->lookupProperty);
JS_ASSERT(!rdata.elembase->getOps()->getProperty);
RootedValue match(cx);
if (!res->createLastMatch(cx, &match))
return false;
JSString *str = match.toString();
JSAtom *atom;
if (str->isAtom()) {
atom = &str->asAtom();
} else {
atom = AtomizeString<CanGC>(cx, str);
if (!atom)
return false;
}
RootedValue v(cx);
if (HasDataProperty(cx, rdata.elembase, AtomToId(atom), v.address()) && v.isString()) {
rdata.repstr = v.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;
}
if (rdata.lambda) {
RootedObject lambda(cx, rdata.lambda);
PreserveRegExpStatics staticsGuard(cx, 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.
*/
unsigned p = res->getMatches().parenCount();
unsigned argc = 1 + p + 2;
InvokeArgs &args = rdata.fig.args();
if (!args.init(argc))
return false;
args.setCallee(ObjectValue(*lambda));
args.setThis(UndefinedValue());
/* Push $&, $1, $2, ... */
unsigned argi = 0;
if (!res->createLastMatch(cx, args.handleAt(argi++)))
return false;
for (size_t i = 0; i < res->getMatches().parenCount(); ++i) {
if (!res->createParen(cx, i + 1, args.handleAt(argi++)))
return false;
}
/* Push match index and input string. */
args[argi++].setInt32(res->getMatches()[0].start);
args[argi].setString(rdata.str);
if (!rdata.fig.invoke(cx))
return false;
/* root repstr: rdata is on the stack, so scanned by conservative gc. */
JSString *repstr = ToString<CanGC>(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;
CheckedInt<uint32_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(res, dp, ep, rdata, &sub, &skip)) {
if (sub.length > skip)
replen += sub.length - skip;
else
replen -= skip - sub.length;
dp += skip;
} else {
dp++;
}
}
if (!replen.isValid()) {
js_ReportAllocationOverflow(cx);
return false;
}
*sizep = replen.value();
return true;
}
/*
* Precondition: |rdata.sb| already has necessary growth space reserved (as
* derived from FindReplaceLength).
*/
static void
DoReplace(RegExpStatics *res, ReplaceData &rdata)
{
TRACK_MEMORY_SCOPE("Javascript");
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(res, dp, ep, rdata, &sub, &skip)) {
len = sub.length;
rdata.sb.infallibleAppend(sub.chars, len);
cp += skip;
dp += skip;
} else {
dp++;
}
}
rdata.sb.infallibleAppend(cp, repstr->length() - (cp - bp));
}
static bool
ReplaceRegExp(JSContext *cx, RegExpStatics *res, ReplaceData &rdata)
{
TRACK_MEMORY_SCOPE("Javascript");
const MatchPair &match = res->getMatches()[0];
JS_ASSERT(!match.isUndefined());
JS_ASSERT(match.limit >= match.start && match.limit >= 0);
rdata.calledBack = true;
size_t leftoff = rdata.leftIndex;
size_t leftlen = match.start - leftoff;
rdata.leftIndex = match.limit;
size_t replen = 0; /* silence 'unused' warning */
if (!FindReplaceLength(cx, res, rdata, &replen))
return false;
CheckedInt<uint32_t> newlen(rdata.sb.length());
newlen += leftlen;
newlen += replen;
if (!newlen.isValid()) {
js_ReportAllocationOverflow(cx);
return false;
}
if (!rdata.sb.reserve(newlen.value()))
return false;
JSLinearString &str = rdata.str->asLinear(); /* flattened for regexp */
const jschar *left = str.chars() + leftoff;
rdata.sb.infallibleAppend(left, leftlen); /* skipped-over portion of the search value */
DoReplace(res, rdata);
return true;
}
static bool
BuildFlatReplacement(JSContext *cx, HandleString textstr, HandleString repstr,
const FlatMatch &fm, CallArgs *args)
{
TRACK_MEMORY_SCOPE("Javascript");
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()) {
RootedString str(cx, 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.
*/
RootedString leftSide(cx, 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) {
RootedString rightSide(cx, 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 {
RootedString leftSide(cx, js_NewDependentString(cx, textstr, 0, match));
if (!leftSide)
return false;
RootedString rightSide(cx);
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;
}
}
args->rval().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, CallArgs *args)
{
TRACK_MEMORY_SCOPE("Javascript");
Rooted<JSLinearString*> textstr(cx, textstrArg->ensureLinear(cx));
if (!textstr)
return false;
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. */
}
RootedString leftSide(cx, js_NewDependentString(cx, textstr, 0, matchStart));
ENSURE(leftSide);
RootedString newReplace(cx, newReplaceChars.finishString());
ENSURE(newReplace);
JS_ASSERT(textstr->length() >= matchLimit);
RootedString rightSide(cx, 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
args->rval().setString(builder.result());
return true;
}
struct StringRange
{
size_t start;
size_t length;
StringRange(size_t s, size_t l)
: start(s), length(l)
{ }
};
static inline JSShortString *
FlattenSubstrings(JSContext *cx, const jschar *chars,
const StringRange *ranges, size_t rangesLen, size_t outputLen)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_ASSERT(JSShortString::lengthFits(outputLen));
JSShortString *str = js_NewGCShortString<CanGC>(cx);
if (!str)
return NULL;
jschar *buf = str->init(outputLen);
size_t pos = 0;
for (size_t i = 0; i < rangesLen; i++) {
PodCopy(buf + pos, chars + ranges[i].start, ranges[i].length);
pos += ranges[i].length;
}
JS_ASSERT(pos == outputLen);
buf[outputLen] = 0;
return str;
}
static JSString *
AppendSubstrings(JSContext *cx, Handle<JSStableString*> stableStr,
const StringRange *ranges, size_t rangesLen)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_ASSERT(rangesLen);
/* For single substrings, construct a dependent string. */
if (rangesLen == 1)
return js_NewDependentString(cx, stableStr, ranges[0].start, ranges[0].length);
const jschar *chars = stableStr->getChars(cx);
if (!chars)
return NULL;
/* Collect substrings into a rope */
size_t i = 0;
RopeBuilder rope(cx);
RootedString part(cx, NULL);
while (i < rangesLen) {
/* Find maximum range that fits in JSShortString */
size_t substrLen = 0;
size_t end = i;
for (; end < rangesLen; end++) {
if (substrLen + ranges[end].length > JSShortString::MAX_SHORT_LENGTH)
break;
substrLen += ranges[end].length;
}
if (i == end) {
/* Not even one range fits JSShortString, use DependentString */
const StringRange &sr = ranges[i++];
part = js_NewDependentString(cx, stableStr, sr.start, sr.length);
} else {
/* Copy the ranges (linearly) into a JSShortString */
part = FlattenSubstrings(cx, chars, ranges + i, end - i, substrLen);
i = end;
}
if (!part)
return NULL;
/* Appending to the rope permanently roots the substring. */
rope.append(part);
}
return rope.result();
}
static bool
str_replace_regexp_remove(JSContext *cx, CallArgs args, HandleString str, RegExpShared &re)
{
TRACK_MEMORY_SCOPE("Javascript");
Rooted<JSStableString*> stableStr(cx, str->ensureStable(cx));
if (!stableStr)
return false;
Vector<StringRange, 16, SystemAllocPolicy> ranges;
StableCharPtr chars = stableStr->chars();
size_t charsLen = stableStr->length();
MatchPair match;
size_t startIndex = 0; /* Index used for iterating through the string. */
size_t lastIndex = 0; /* Index after last successful match. */
size_t lazyIndex = 0; /* Index before last successful match. */
/* Accumulate StringRanges for unmatched substrings. */
while (startIndex <= charsLen) {
if (!JS_CHECK_OPERATION_LIMIT(cx))
return false;
RegExpRunStatus status = re.executeMatchOnly(cx, chars.get(), charsLen, &startIndex, match);
if (status == RegExpRunStatus_Error)
return false;
if (status == RegExpRunStatus_Success_NotFound)
break;
/* Include the latest unmatched substring. */
if (size_t(match.start) > lastIndex) {
if (!ranges.append(StringRange(lastIndex, match.start - lastIndex)))
return false;
}
lazyIndex = lastIndex;
lastIndex = startIndex;
if (match.isEmpty())
startIndex++;
/* Non-global removal executes at most once. */
if (!re.global())
break;
}
/* If unmatched, return the input string. */
if (!lastIndex) {
if (startIndex > 0)
cx->regExpStatics()->updateLazily(cx, stableStr, &re, lazyIndex);
args.rval().setString(str);
return true;
}
/* The last successful match updates the RegExpStatics. */
cx->regExpStatics()->updateLazily(cx, stableStr, &re, lazyIndex);
/* Include any remaining part of the string. */
if (lastIndex < charsLen) {
if (!ranges.append(StringRange(lastIndex, charsLen - lastIndex)))
return false;
}
/* Handle the empty string before calling .begin(). */
if (ranges.empty()) {
args.rval().setString(cx->runtime()->emptyString);
return true;
}
JSString *result = AppendSubstrings(cx, stableStr, ranges.begin(), ranges.length());
if (!result)
return false;
args.rval().setString(result);
return true;
}
static inline bool
str_replace_regexp(JSContext *cx, CallArgs args, ReplaceData &rdata)
{
TRACK_MEMORY_SCOPE("Javascript");
if (!rdata.g.normalizeRegExp(cx, true, 2, args))
return false;
rdata.leftIndex = 0;
rdata.calledBack = false;
RegExpStatics *res = cx->regExpStatics();
RegExpShared &re = rdata.g.regExp();
/* Optimize removal. */
if (rdata.repstr && rdata.repstr->length() == 0) {
JS_ASSERT(!rdata.lambda && !rdata.elembase && !rdata.dollar);
return str_replace_regexp_remove(cx, args, rdata.str, re);
}
Rooted<JSLinearString*> linearStr(cx, rdata.str->ensureLinear(cx));
if (!linearStr)
return false;
if (re.global()) {
if (!DoMatchForReplaceGlobal(cx, res, linearStr, re, rdata))
return false;
} else {
if (!DoMatchForReplaceLocal(cx, res, linearStr, re, rdata))
return false;
}
if (!rdata.calledBack) {
/* Didn't match, so the string is unmodified. */
args.rval().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;
args.rval().setString(retstr);
return true;
}
static inline bool
str_replace_flat_lambda(JSContext *cx, CallArgs outerArgs, ReplaceData &rdata, const FlatMatch &fm)
{
TRACK_MEMORY_SCOPE("Javascript");
JS_ASSERT(fm.match() >= 0);
RootedString matchStr(cx, js_NewDependentString(cx, rdata.str, fm.match(), fm.patternLength()));
if (!matchStr)
return false;
/* lambda(matchStr, matchStart, textstr) */
static const uint32_t lambdaArgc = 3;
if (!rdata.fig.args().init(lambdaArgc))
return false;
CallArgs &args = rdata.fig.args();
args.setCallee(ObjectValue(*rdata.lambda));
args.setThis(UndefinedValue());
Value *sp = args.array();
sp[0].setString(matchStr);
sp[1].setInt32(fm.match());
sp[2].setString(rdata.str);
if (!rdata.fig.invoke(cx))
return false;
RootedString repstr(cx, ToString<CanGC>(cx, args.rval()));
if (!repstr)
return false;
RootedString leftSide(cx, js_NewDependentString(cx, rdata.str, 0, fm.match()));
if (!leftSide)
return false;
size_t matchLimit = fm.match() + fm.patternLength();
RootedString rightSide(cx, 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;
}
outerArgs.rval().setString(builder.result());
return true;
}
static const uint32_t ReplaceOptArg = 2;
/*
* 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.
*/
static bool
LambdaIsGetElem(JSContext *cx, JSObject &lambda, MutableHandleObject pobj)
{
TRACK_MEMORY_SCOPE("Javascript");
if (!lambda.is<JSFunction>())
return true;
JSFunction *fun = &lambda.as<JSFunction>();
if (!fun->isInterpreted())
return true;
JSScript *script = fun->getOrCreateScript(cx);
if (!script)
return false;
jsbytecode *pc = script->code;
/*
* JSOP_GETALIASEDVAR tells us exactly where to find the base object 'b'.
* Rule out the (unlikely) possibility of a heavyweight function since it
* would make our scope walk off by 1.
*/
if (JSOp(*pc) != JSOP_GETALIASEDVAR || fun->isHeavyweight())
return true;
ScopeCoordinate sc(pc);
ScopeObject *scope = &fun->environment()->as<ScopeObject>();
for (unsigned i = 0; i < sc.hops; ++i)
scope = &scope->enclosingScope().as<ScopeObject>();
Value b = scope->aliasedVar(sc);
pc += JSOP_GETALIASEDVAR_LENGTH;
/* Look for 'a' to be the lambda's first argument. */
if (JSOp(*pc) != JSOP_GETARG || GET_SLOTNO(pc) != 0)
return true;
pc += JSOP_GETARG_LENGTH;
/* 'b[a]' */
if (JSOp(*pc) != JSOP_GETELEM)
return true;
pc += JSOP_GETELEM_LENGTH;
/* 'return b[a]' */
if (JSOp(*pc) != JSOP_RETURN)
return true;
/* 'b' must behave like a normal object. */
if (!b.isObject())
return true;
JSObject &bobj = b.toObject();
Class *clasp = bobj.getClass();
if (!clasp->isNative() || clasp->ops.lookupProperty || clasp->ops.getProperty)
return true;
pobj.set(&bobj);
return true;
}
JSBool
js::str_replace(JSContext *cx, unsigned argc, Value *vp)
{
TRACK_MEMORY_SCOPE("Javascript");
CallArgs args = CallArgsFromVp(argc, vp);
ReplaceData rdata(cx);
rdata.str = ThisToStringForStringProto(cx, args);
if (!rdata.str)
return false;
if (!rdata.g.init(cx, args))
return false;
/* Extract replacement string/function. */
if (args.length() >= ReplaceOptArg && js_IsCallable(args[1])) {
rdata.lambda = &args[1].toObject();
rdata.elembase = NULL;
rdata.repstr = NULL;
rdata.dollar = rdata.dollarEnd = NULL;
if (!LambdaIsGetElem(cx, *rdata.lambda, &rdata.elembase))
return false;
} else {
rdata.lambda = NUL