1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
|
/*
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2003, 2007, 2008 Apple Inc. All Rights Reserved.
* Copyright (C) 2009 Torch Mobile, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#include "config.h"
#include "RegExpConstructor.h"
#include "ArrayPrototype.h"
#include "Error.h"
#include "JSArray.h"
#include "JSFunction.h"
#include "JSString.h"
#include "ObjectPrototype.h"
#include "RegExpMatchesArray.h"
#include "RegExpObject.h"
#include "RegExpPrototype.h"
#include "RegExp.h"
namespace JSC {
static JSValue regExpConstructorInput(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorMultiline(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorLastMatch(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorLastParen(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorLeftContext(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorRightContext(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar1(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar2(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar3(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar4(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar5(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar6(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar7(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar8(ExecState*, JSValue, const Identifier&);
static JSValue regExpConstructorDollar9(ExecState*, JSValue, const Identifier&);
static void setRegExpConstructorInput(ExecState*, JSObject*, JSValue);
static void setRegExpConstructorMultiline(ExecState*, JSObject*, JSValue);
} // namespace JSC
#include "RegExpConstructor.lut.h"
namespace JSC {
ASSERT_CLASS_FITS_IN_CELL(RegExpConstructor);
const ClassInfo RegExpConstructor::info = { "Function", &InternalFunction::info, 0, ExecState::regExpConstructorTable };
/* Source for RegExpConstructor.lut.h
@begin regExpConstructorTable
input regExpConstructorInput None
$_ regExpConstructorInput DontEnum
multiline regExpConstructorMultiline None
$* regExpConstructorMultiline DontEnum
lastMatch regExpConstructorLastMatch DontDelete|ReadOnly
$& regExpConstructorLastMatch DontDelete|ReadOnly|DontEnum
lastParen regExpConstructorLastParen DontDelete|ReadOnly
$+ regExpConstructorLastParen DontDelete|ReadOnly|DontEnum
leftContext regExpConstructorLeftContext DontDelete|ReadOnly
$` regExpConstructorLeftContext DontDelete|ReadOnly|DontEnum
rightContext regExpConstructorRightContext DontDelete|ReadOnly
$' regExpConstructorRightContext DontDelete|ReadOnly|DontEnum
$1 regExpConstructorDollar1 DontDelete|ReadOnly
$2 regExpConstructorDollar2 DontDelete|ReadOnly
$3 regExpConstructorDollar3 DontDelete|ReadOnly
$4 regExpConstructorDollar4 DontDelete|ReadOnly
$5 regExpConstructorDollar5 DontDelete|ReadOnly
$6 regExpConstructorDollar6 DontDelete|ReadOnly
$7 regExpConstructorDollar7 DontDelete|ReadOnly
$8 regExpConstructorDollar8 DontDelete|ReadOnly
$9 regExpConstructorDollar9 DontDelete|ReadOnly
@end
*/
RegExpConstructor::RegExpConstructor(ExecState* exec, NonNullPassRefPtr<Structure> structure, RegExpPrototype* regExpPrototype)
: InternalFunction(&exec->globalData(), structure, Identifier(exec, "RegExp"))
, d(new RegExpConstructorPrivate)
{
// ECMA 15.10.5.1 RegExp.prototype
putDirectWithoutTransition(exec->propertyNames().prototype, regExpPrototype, DontEnum | DontDelete | ReadOnly);
// no. of arguments for constructor
putDirectWithoutTransition(exec->propertyNames().length, jsNumber(exec, 2), ReadOnly | DontDelete | DontEnum);
}
RegExpMatchesArray::RegExpMatchesArray(ExecState* exec, RegExpConstructorPrivate* data)
: JSArray(exec->lexicalGlobalObject()->regExpMatchesArrayStructure(), data->lastNumSubPatterns + 1)
{
RegExpConstructorPrivate* d = new RegExpConstructorPrivate;
d->input = data->lastInput;
d->lastInput = data->lastInput;
d->lastNumSubPatterns = data->lastNumSubPatterns;
unsigned offsetVectorSize = (data->lastNumSubPatterns + 1) * 2; // only copying the result part of the vector
d->lastOvector().resize(offsetVectorSize);
memcpy(d->lastOvector().data(), data->lastOvector().data(), offsetVectorSize * sizeof(int));
// d->multiline is not needed, and remains uninitialized
setSubclassData(d);
}
RegExpMatchesArray::~RegExpMatchesArray()
{
delete static_cast<RegExpConstructorPrivate*>(subclassData());
}
void RegExpMatchesArray::fillArrayInstance(ExecState* exec)
{
RegExpConstructorPrivate* d = static_cast<RegExpConstructorPrivate*>(subclassData());
ASSERT(d);
unsigned lastNumSubpatterns = d->lastNumSubPatterns;
for (unsigned i = 0; i <= lastNumSubpatterns; ++i) {
int start = d->lastOvector()[2 * i];
if (start >= 0)
JSArray::put(exec, i, jsSubstring(exec, d->lastInput, start, d->lastOvector()[2 * i + 1] - start));
else
JSArray::put(exec, i, jsUndefined());
}
PutPropertySlot slot;
JSArray::put(exec, exec->propertyNames().index, jsNumber(exec, d->lastOvector()[0]), slot);
JSArray::put(exec, exec->propertyNames().input, jsString(exec, d->input), slot);
delete d;
setSubclassData(0);
}
JSObject* RegExpConstructor::arrayOfMatches(ExecState* exec) const
{
return new (exec) RegExpMatchesArray(exec, d.get());
}
JSValue RegExpConstructor::getBackref(ExecState* exec, unsigned i) const
{
if (!d->lastOvector().isEmpty() && i <= d->lastNumSubPatterns) {
int start = d->lastOvector()[2 * i];
if (start >= 0)
return jsSubstring(exec, d->lastInput, start, d->lastOvector()[2 * i + 1] - start);
}
return jsEmptyString(exec);
}
JSValue RegExpConstructor::getLastParen(ExecState* exec) const
{
unsigned i = d->lastNumSubPatterns;
if (i > 0) {
ASSERT(!d->lastOvector().isEmpty());
int start = d->lastOvector()[2 * i];
if (start >= 0)
return jsSubstring(exec, d->lastInput, start, d->lastOvector()[2 * i + 1] - start);
}
return jsEmptyString(exec);
}
JSValue RegExpConstructor::getLeftContext(ExecState* exec) const
{
if (!d->lastOvector().isEmpty())
return jsSubstring(exec, d->lastInput, 0, d->lastOvector()[0]);
return jsEmptyString(exec);
}
JSValue RegExpConstructor::getRightContext(ExecState* exec) const
{
if (!d->lastOvector().isEmpty())
return jsSubstring(exec, d->lastInput, d->lastOvector()[1], d->lastInput.size() - d->lastOvector()[1]);
return jsEmptyString(exec);
}
bool RegExpConstructor::getOwnPropertySlot(ExecState* exec, const Identifier& propertyName, PropertySlot& slot)
{
return getStaticValueSlot<RegExpConstructor, InternalFunction>(exec, ExecState::regExpConstructorTable(exec), this, propertyName, slot);
}
bool RegExpConstructor::getOwnPropertyDescriptor(ExecState* exec, const Identifier& propertyName, PropertyDescriptor& descriptor)
{
return getStaticValueDescriptor<RegExpConstructor, InternalFunction>(exec, ExecState::regExpConstructorTable(exec), this, propertyName, descriptor);
}
JSValue regExpConstructorDollar1(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 1);
}
JSValue regExpConstructorDollar2(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 2);
}
JSValue regExpConstructorDollar3(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 3);
}
JSValue regExpConstructorDollar4(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 4);
}
JSValue regExpConstructorDollar5(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 5);
}
JSValue regExpConstructorDollar6(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 6);
}
JSValue regExpConstructorDollar7(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 7);
}
JSValue regExpConstructorDollar8(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 8);
}
JSValue regExpConstructorDollar9(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 9);
}
JSValue regExpConstructorInput(ExecState* exec, JSValue slotBase, const Identifier&)
{
return jsString(exec, asRegExpConstructor(slotBase)->input());
}
JSValue regExpConstructorMultiline(ExecState*, JSValue slotBase, const Identifier&)
{
return jsBoolean(asRegExpConstructor(slotBase)->multiline());
}
JSValue regExpConstructorLastMatch(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getBackref(exec, 0);
}
JSValue regExpConstructorLastParen(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getLastParen(exec);
}
JSValue regExpConstructorLeftContext(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getLeftContext(exec);
}
JSValue regExpConstructorRightContext(ExecState* exec, JSValue slotBase, const Identifier&)
{
return asRegExpConstructor(slotBase)->getRightContext(exec);
}
void RegExpConstructor::put(ExecState* exec, const Identifier& propertyName, JSValue value, PutPropertySlot& slot)
{
lookupPut<RegExpConstructor, InternalFunction>(exec, propertyName, value, ExecState::regExpConstructorTable(exec), this, slot);
}
void setRegExpConstructorInput(ExecState* exec, JSObject* baseObject, JSValue value)
{
asRegExpConstructor(baseObject)->setInput(value.toString(exec));
}
void setRegExpConstructorMultiline(ExecState* exec, JSObject* baseObject, JSValue value)
{
asRegExpConstructor(baseObject)->setMultiline(value.toBoolean(exec));
}
// ECMA 15.10.4
JSObject* constructRegExp(ExecState* exec, const ArgList& args)
{
JSValue arg0 = args.at(0);
JSValue arg1 = args.at(1);
if (arg0.inherits(&RegExpObject::info)) {
if (!arg1.isUndefined())
return throwError(exec, TypeError, "Cannot supply flags when constructing one RegExp from another.");
return asObject(arg0);
}
UString pattern = arg0.isUndefined() ? UString("") : arg0.toString(exec);
UString flags = arg1.isUndefined() ? UString("") : arg1.toString(exec);
RefPtr<RegExp> regExp = RegExp::create(&exec->globalData(), pattern, flags);
if (!regExp->isValid())
return throwError(exec, SyntaxError, makeString("Invalid regular expression: ", regExp->errorMessage()));
return new (exec) RegExpObject(exec->lexicalGlobalObject()->regExpStructure(), regExp.release());
}
static JSObject* constructWithRegExpConstructor(ExecState* exec, JSObject*, const ArgList& args)
{
return constructRegExp(exec, args);
}
ConstructType RegExpConstructor::getConstructData(ConstructData& constructData)
{
constructData.native.function = constructWithRegExpConstructor;
return ConstructTypeHost;
}
// ECMA 15.10.3
static JSValue JSC_HOST_CALL callRegExpConstructor(ExecState* exec, JSObject*, JSValue, const ArgList& args)
{
return constructRegExp(exec, args);
}
CallType RegExpConstructor::getCallData(CallData& callData)
{
callData.native.function = callRegExpConstructor;
return CallTypeHost;
}
void RegExpConstructor::setInput(const UString& input)
{
d->input = input;
}
const UString& RegExpConstructor::input() const
{
// Can detect a distinct initial state that is invisible to JavaScript, by checking for null
// state (since jsString turns null strings to empty strings).
return d->input;
}
void RegExpConstructor::setMultiline(bool multiline)
{
d->multiline = multiline;
}
bool RegExpConstructor::multiline() const
{
return d->multiline;
}
} // namespace JSC
|