| | 1 | /* |
| | 2 | * Copyright (C) 2012 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 "RegExpCachedResult.h" |
| | 28 | |
| | 29 | #include "JSCInlines.h" |
| | 30 | #include "RegExpMatchesArray.h" |
| | 31 | |
| | 32 | namespace JSC { |
| | 33 | |
| | 34 | void RegExpCachedResult::visitChildren(SlotVisitor& visitor) |
| | 35 | { |
| | 36 | visitor.append(&m_lastInput); |
| | 37 | visitor.append(&m_lastRegExp); |
| | 38 | visitor.append(&m_reifiedInput); |
| | 39 | visitor.append(&m_reifiedResult); |
| | 40 | visitor.append(&m_reifiedLeftContext); |
| | 41 | visitor.append(&m_reifiedRightContext); |
| | 42 | } |
| | 43 | |
| | 44 | JSArray* RegExpCachedResult::lastResult(ExecState* exec, JSObject* owner) |
| | 45 | { |
| | 46 | if (!m_reified) { |
| | 47 | m_reifiedInput.set(exec->vm(), owner, m_lastInput.get()); |
| | 48 | m_reifiedResult.set(exec->vm(), owner, createRegExpMatchesArray(exec, m_lastInput.get(), m_lastRegExp.get(), m_result)); |
| | 49 | m_reified = true; |
| | 50 | } |
| | 51 | return m_reifiedResult.get(); |
| | 52 | } |
| | 53 | |
| | 54 | JSString* RegExpCachedResult::leftContext(ExecState* exec, JSObject* owner) |
| | 55 | { |
| | 56 | // Make sure we're reified. |
| | 57 | lastResult(exec, owner); |
| | 58 | if (!m_reifiedLeftContext) |
| | 59 | m_reifiedLeftContext.set(exec->vm(), owner, m_result.start ? jsSubstring(exec, m_reifiedInput.get(), 0, m_result.start) : jsEmptyString(exec)); |
| | 60 | return m_reifiedLeftContext.get(); |
| | 61 | } |
| | 62 | |
| | 63 | JSString* RegExpCachedResult::rightContext(ExecState* exec, JSObject* owner) |
| | 64 | { |
| | 65 | // Make sure we're reified. |
| | 66 | lastResult(exec, owner); |
| | 67 | if (!m_reifiedRightContext) { |
| | 68 | unsigned length = m_reifiedInput->length(); |
| | 69 | m_reifiedRightContext.set(exec->vm(), owner, m_result.end != length ? jsSubstring(exec, m_reifiedInput.get(), m_result.end, length - m_result.end) : jsEmptyString(exec)); |
| | 70 | } |
| | 71 | return m_reifiedRightContext.get(); |
| | 72 | } |
| | 73 | |
| | 74 | void RegExpCachedResult::setInput(ExecState* exec, JSObject* owner, JSString* input) |
| | 75 | { |
| | 76 | // Make sure we're reified, otherwise m_reifiedInput will be ignored. |
| | 77 | lastResult(exec, owner); |
| | 78 | ASSERT(m_reified); |
| | 79 | m_reifiedInput.set(exec->vm(), owner, input); |
| | 80 | } |
| | 81 | |
| | 82 | } // namespace JSC |
projects / apple / javascriptcore.git / blame_incremental