2 * Copyright (C) 2012-2014 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include "RegExpMatchesArray.h"
29 #include "ButterflyInlines.h"
30 #include "JSCInlines.h"
34 JSArray* createRegExpMatchesArray(ExecState* exec, JSString* input, RegExp* regExp, MatchResult result)
38 JSArray* array = JSArray::tryCreateUninitialized(vm, exec->lexicalGlobalObject()->arrayStructureForIndexingTypeDuringAllocation(ContiguousShape), regExp->numSubpatterns() + 1);
39 RELEASE_ASSERT(array);
41 SamplingRegion samplingRegion("Reifying substring properties");
43 array->initializeIndex(vm, 0, jsSubstring(exec, input, result.start, result.end - result.start), ContiguousShape);
45 if (unsigned numSubpatterns = regExp->numSubpatterns()) {
46 Vector<int, 32> subpatternResults;
47 int position = regExp->match(vm, input->value(exec), result.start, subpatternResults);
48 ASSERT_UNUSED(position, position >= 0 && static_cast<size_t>(position) == result.start);
49 ASSERT(result.start == static_cast<size_t>(subpatternResults[0]));
50 ASSERT(result.end == static_cast<size_t>(subpatternResults[1]));
52 for (unsigned i = 1; i <= numSubpatterns; ++i) {
53 int start = subpatternResults[2 * i];
55 array->initializeIndex(vm, i, jsSubstring(exec, input, start, subpatternResults[2 * i + 1] - start), ContiguousShape);
57 array->initializeIndex(vm, i, jsUndefined(), ContiguousShape);
61 array->putDirect(vm, vm.propertyNames->index, jsNumber(result.start));
62 array->putDirect(vm, vm.propertyNames->input, input);