| 1 | /* |
| 2 | * Copyright (C) 2012-2017 Apple Inc. All rights reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 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. |
| 12 | * |
| 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. |
| 24 | */ |
| 25 | |
| 26 | #include "config.h" |
| 27 | #include "RegExpMatchesArray.h" |
| 28 | |
| 29 | namespace JSC { |
| 30 | |
| 31 | JSArray* createEmptyRegExpMatchesArray(JSGlobalObject* globalObject, JSString* input, RegExp* regExp) |
| 32 | { |
| 33 | VM& vm = globalObject->vm(); |
| 34 | JSArray* array; |
| 35 | |
| 36 | // FIXME: This should handle array allocation errors gracefully. |
| 37 | // https://bugs.webkit.org/show_bug.cgi?id=155144 |
| 38 | |
| 39 | GCDeferralContext deferralContext(vm.heap); |
| 40 | ObjectInitializationScope scope(vm); |
| 41 | |
| 42 | if (UNLIKELY(globalObject->isHavingABadTime())) { |
| 43 | array = JSArray::tryCreateUninitializedRestricted(scope, &deferralContext, globalObject->regExpMatchesArrayStructure(), regExp->numSubpatterns() + 1); |
| 44 | // FIXME: we should probably throw an out of memory error here, but |
| 45 | // when making this change we should check that all clients of this |
| 46 | // function will correctly handle an exception being thrown from here. |
| 47 | // https://bugs.webkit.org/show_bug.cgi?id=169786 |
| 48 | RELEASE_ASSERT(array); |
| 49 | |
| 50 | array->initializeIndexWithoutBarrier(scope, 0, jsEmptyString(&vm)); |
| 51 | |
| 52 | if (unsigned numSubpatterns = regExp->numSubpatterns()) { |
| 53 | for (unsigned i = 1; i <= numSubpatterns; ++i) |
| 54 | array->initializeIndexWithoutBarrier(scope, i, jsUndefined()); |
| 55 | } |
| 56 | } else { |
| 57 | ObjectInitializationScope scope(vm); |
| 58 | array = tryCreateUninitializedRegExpMatchesArray(scope, &deferralContext, globalObject->regExpMatchesArrayStructure(), regExp->numSubpatterns() + 1); |
| 59 | RELEASE_ASSERT(array); |
| 60 | |
| 61 | array->initializeIndexWithoutBarrier(scope, 0, jsEmptyString(&vm), ArrayWithContiguous); |
| 62 | |
| 63 | if (unsigned numSubpatterns = regExp->numSubpatterns()) { |
| 64 | for (unsigned i = 1; i <= numSubpatterns; ++i) |
| 65 | array->initializeIndexWithoutBarrier(scope, i, jsUndefined(), ArrayWithContiguous); |
| 66 | } |
| 67 | } |
| 68 | |
| 69 | array->putDirectWithoutBarrier(RegExpMatchesArrayIndexPropertyOffset, jsNumber(-1)); |
| 70 | array->putDirectWithoutBarrier(RegExpMatchesArrayInputPropertyOffset, input); |
| 71 | return array; |
| 72 | } |
| 73 | |
| 74 | enum class ShouldCreateGroups { No, Yes }; |
| 75 | |
| 76 | static Structure* createStructureImpl(VM& vm, JSGlobalObject* globalObject, IndexingType indexingType, ShouldCreateGroups shouldCreateGroups = ShouldCreateGroups::No) |
| 77 | { |
| 78 | Structure* structure = globalObject->arrayStructureForIndexingTypeDuringAllocation(indexingType); |
| 79 | PropertyOffset offset; |
| 80 | structure = Structure::addPropertyTransition(vm, structure, vm.propertyNames->index, 0, offset); |
| 81 | ASSERT(offset == RegExpMatchesArrayIndexPropertyOffset); |
| 82 | structure = Structure::addPropertyTransition(vm, structure, vm.propertyNames->input, 0, offset); |
| 83 | ASSERT(offset == RegExpMatchesArrayInputPropertyOffset); |
| 84 | switch (shouldCreateGroups) { |
| 85 | case ShouldCreateGroups::Yes: |
| 86 | structure = Structure::addPropertyTransition(vm, structure, vm.propertyNames->groups, 0, offset); |
| 87 | ASSERT(offset == RegExpMatchesArrayGroupsPropertyOffset); |
| 88 | break; |
| 89 | case ShouldCreateGroups::No: |
| 90 | break; |
| 91 | } |
| 92 | return structure; |
| 93 | } |
| 94 | |
| 95 | Structure* createRegExpMatchesArrayStructure(VM& vm, JSGlobalObject* globalObject) |
| 96 | { |
| 97 | return createStructureImpl(vm, globalObject, ArrayWithContiguous); |
| 98 | } |
| 99 | |
| 100 | Structure* createRegExpMatchesArraySlowPutStructure(VM& vm, JSGlobalObject* globalObject) |
| 101 | { |
| 102 | return createStructureImpl(vm, globalObject, ArrayWithSlowPutArrayStorage); |
| 103 | } |
| 104 | |
| 105 | Structure* createRegExpMatchesArrayWithGroupsStructure(VM& vm, JSGlobalObject* globalObject) |
| 106 | { |
| 107 | return createStructureImpl(vm, globalObject, ArrayWithContiguous, ShouldCreateGroups::Yes); |
| 108 | } |
| 109 | |
| 110 | Structure* createRegExpMatchesArrayWithGroupsSlowPutStructure(VM& vm, JSGlobalObject* globalObject) |
| 111 | { |
| 112 | return createStructureImpl(vm, globalObject, ArrayWithSlowPutArrayStorage, ShouldCreateGroups::Yes); |
| 113 | } |
| 114 | |
| 115 | } // namespace JSC |
| 116 | |