| /* |
| * Copyright (C) 1999-2000 Harri Porten (porten@kde.org) |
| * Copyright (C) 2003, 2007, 2008 Apple Inc. All Rights Reserved. |
| * |
| * 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 "RegExpConstructor.lut.h" |
| |
| #include "ArrayPrototype.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 { |
| |
| ASSERT_CLASS_FITS_IN_CELL(RegExpConstructor); |
| |
| const ClassInfo RegExpConstructor::info = { "Function", &InternalFunction::info, 0, ExecState::regExpConstructorTable }; |
| |
| /* Source for RegExpConstructor.lut.h |
| @begin regExpConstructorTable |
| input RegExpConstructor::Input None |
| $_ RegExpConstructor::Input DontEnum |
| multiline RegExpConstructor::Multiline None |
| $* RegExpConstructor::Multiline DontEnum |
| lastMatch RegExpConstructor::LastMatch DontDelete|ReadOnly |
| $& RegExpConstructor::LastMatch DontDelete|ReadOnly|DontEnum |
| lastParen RegExpConstructor::LastParen DontDelete|ReadOnly |
| $+ RegExpConstructor::LastParen DontDelete|ReadOnly|DontEnum |
| leftContext RegExpConstructor::LeftContext DontDelete|ReadOnly |
| $` RegExpConstructor::LeftContext DontDelete|ReadOnly|DontEnum |
| rightContext RegExpConstructor::RightContext DontDelete|ReadOnly |
| $' RegExpConstructor::RightContext DontDelete|ReadOnly|DontEnum |
| $1 RegExpConstructor::Dollar1 DontDelete|ReadOnly |
| $2 RegExpConstructor::Dollar2 DontDelete|ReadOnly |
| $3 RegExpConstructor::Dollar3 DontDelete|ReadOnly |
| $4 RegExpConstructor::Dollar4 DontDelete|ReadOnly |
| $5 RegExpConstructor::Dollar5 DontDelete|ReadOnly |
| $6 RegExpConstructor::Dollar6 DontDelete|ReadOnly |
| $7 RegExpConstructor::Dollar7 DontDelete|ReadOnly |
| $8 RegExpConstructor::Dollar8 DontDelete|ReadOnly |
| $9 RegExpConstructor::Dollar9 DontDelete|ReadOnly |
| @end |
| */ |
| |
| struct RegExpConstructorPrivate { |
| // Global search cache / settings |
| RegExpConstructorPrivate() |
| : lastNumSubPatterns(0) |
| , multiline(false) |
| { |
| } |
| |
| UString input; |
| UString lastInput; |
| OwnArrayPtr<int> lastOvector; |
| unsigned lastNumSubPatterns : 31; |
| bool multiline : 1; |
| }; |
| |
| RegExpConstructor::RegExpConstructor(ExecState* exec, PassRefPtr<StructureID> structure, RegExpPrototype* regExpPrototype) |
| : InternalFunction(exec, structure, Identifier(exec, "RegExp")) |
| , d(new RegExpConstructorPrivate) |
| { |
| // ECMA 15.10.5.1 RegExp.prototype |
| putDirect(exec->propertyNames().prototype, regExpPrototype, DontEnum | DontDelete | ReadOnly); |
| |
| // no. of arguments for constructor |
| putDirect(exec->propertyNames().length, jsNumber(exec, 2), ReadOnly | DontDelete | DontEnum); |
| } |
| |
| /* |
| To facilitate result caching, exec(), test(), match(), search(), and replace() dipatch regular |
| expression matching through the performMatch function. We use cached results to calculate, |
| e.g., RegExp.lastMatch and RegExp.leftParen. |
| */ |
| void RegExpConstructor::performMatch(RegExp* r, const UString& s, int startOffset, int& position, int& length, int** ovector) |
| { |
| OwnArrayPtr<int> tmpOvector; |
| position = r->match(s, startOffset, &tmpOvector); |
| |
| if (ovector) |
| *ovector = tmpOvector.get(); |
| |
| if (position != -1) { |
| ASSERT(tmpOvector); |
| |
| length = tmpOvector[1] - tmpOvector[0]; |
| |
| d->input = s; |
| d->lastInput = s; |
| d->lastOvector.set(tmpOvector.release()); |
| d->lastNumSubPatterns = r->numSubpatterns(); |
| } |
| } |
| |
| 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.set(new int[offsetVectorSize]); |
| memcpy(d->lastOvector.get(), data->lastOvector.get(), offsetVectorSize * sizeof(int)); |
| // d->multiline is not needed, and remains uninitialized |
| |
| setLazyCreationData(d); |
| } |
| |
| RegExpMatchesArray::~RegExpMatchesArray() |
| { |
| delete static_cast<RegExpConstructorPrivate*>(lazyCreationData()); |
| } |
| |
| void RegExpMatchesArray::fillArrayInstance(ExecState* exec) |
| { |
| RegExpConstructorPrivate* d = static_cast<RegExpConstructorPrivate*>(lazyCreationData()); |
| 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)); |
| } |
| |
| 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; |
| setLazyCreationData(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 && 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); |
| 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) |
| return jsSubstring(exec, d->lastInput, 0, d->lastOvector[0]); |
| return jsEmptyString(exec); |
| } |
| |
| JSValue* RegExpConstructor::getRightContext(ExecState* exec) const |
| { |
| if (d->lastOvector) |
| 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); |
| } |
| |
| JSValue* RegExpConstructor::getValueProperty(ExecState* exec, int token) const |
| { |
| switch (token) { |
| case Dollar1: |
| return getBackref(exec, 1); |
| case Dollar2: |
| return getBackref(exec, 2); |
| case Dollar3: |
| return getBackref(exec, 3); |
| case Dollar4: |
| return getBackref(exec, 4); |
| case Dollar5: |
| return getBackref(exec, 5); |
| case Dollar6: |
| return getBackref(exec, 6); |
| case Dollar7: |
| return getBackref(exec, 7); |
| case Dollar8: |
| return getBackref(exec, 8); |
| case Dollar9: |
| return getBackref(exec, 9); |
| case Input: |
| return jsString(exec, d->input); |
| case Multiline: |
| return jsBoolean(d->multiline); |
| case LastMatch: |
| return getBackref(exec, 0); |
| case LastParen: |
| return getLastParen(exec); |
| case LeftContext: |
| return getLeftContext(exec); |
| case RightContext: |
| return getRightContext(exec); |
| default: |
| ASSERT_NOT_REACHED(); |
| } |
| |
| return jsEmptyString(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 RegExpConstructor::putValueProperty(ExecState* exec, int token, JSValue* value) |
| { |
| switch (token) { |
| case Input: |
| d->input = value->toString(exec); |
| break; |
| case Multiline: |
| d->multiline = value->toBoolean(exec); |
| break; |
| default: |
| ASSERT_NOT_REACHED(); |
| } |
| } |
| |
| // ECMA 15.10.4 |
| JSObject* constructRegExp(ExecState* exec, const ArgList& args) |
| { |
| JSValue* arg0 = args.at(exec, 0); |
| JSValue* arg1 = args.at(exec, 1); |
| |
| if (arg0->isObject(&RegExpObject::info)) { |
| if (!arg1->isUndefined()) |
| return throwError(exec, TypeError, "Cannot supply flags when constructing one RegExp from another."); |
| return static_cast<JSObject*>(arg0); |
| } |
| |
| UString pattern = arg0->isUndefined() ? UString("") : arg0->toString(exec); |
| UString flags = arg1->isUndefined() ? UString("") : arg1->toString(exec); |
| |
| RefPtr<RegExp> regExp = RegExp::create(exec, pattern, flags); |
| if (!regExp->isValid()) |
| return throwError(exec, SyntaxError, UString("Invalid regular expression: ").append(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* callRegExpConstructor(ExecState* exec, JSObject*, JSValue*, const ArgList& args) |
| { |
| return constructRegExp(exec, args); |
| } |
| |
| CallType RegExpConstructor::getCallData(CallData& callData) |
| { |
| callData.native.function = callRegExpConstructor; |
| return CallTypeHost; |
| } |
| |
| 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; |
| } |
| |
| } // namespace JSC |