RegExpCachedResult.h 3.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  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. #ifndef RegExpCachedResult_h
  26. #define RegExpCachedResult_h
  27. #include "RegExpObject.h"
  28. namespace JSC {
  29. class JSString;
  30. class RegExpMatchesArray;
  31. // RegExpCachedResult is used to track the cached results of the last
  32. // match, stores on the RegExp constructor (e.g. $&, $_, $1, $2 ...).
  33. // These values will be lazily generated on demand, so the cached result
  34. // may be in a lazy or reified state. A lazy state is indicated by a
  35. // value of m_result indicating a successful match, and a reified state
  36. // is indicated by setting m_result to MatchResult::failed().
  37. // Following a successful match, m_result, m_lastInput and m_lastRegExp
  38. // can be used to reify the results from the match, following reification
  39. // m_reifiedResult and m_reifiedInput hold the cached results.
  40. class RegExpCachedResult {
  41. public:
  42. RegExpCachedResult(VM& vm, JSObject* owner, RegExp* emptyRegExp)
  43. : m_result(0, 0)
  44. {
  45. m_lastInput.set(vm, owner, jsEmptyString(&vm));
  46. m_lastRegExp.set(vm, owner, emptyRegExp);
  47. }
  48. ALWAYS_INLINE void record(VM& vm, JSObject* owner, RegExp* regExp, JSString* input, MatchResult result)
  49. {
  50. m_lastRegExp.set(vm, owner, regExp);
  51. m_lastInput.set(vm, owner, input);
  52. m_result = result;
  53. }
  54. RegExpMatchesArray* lastResult(ExecState*, JSObject* owner);
  55. void setInput(ExecState*, JSObject* owner, JSString*);
  56. JSString* input()
  57. {
  58. // If m_result showas a match then we're in a lazy state, so m_lastInput
  59. // is the most recent value of the input property. If not then we have
  60. // reified, in which case m_reifiedInput will contain the correct value.
  61. return m_result ? m_lastInput.get() : m_reifiedInput.get();
  62. }
  63. void visitChildren(SlotVisitor&);
  64. private:
  65. MatchResult m_result;
  66. WriteBarrier<JSString> m_lastInput;
  67. WriteBarrier<RegExp> m_lastRegExp;
  68. WriteBarrier<RegExpMatchesArray> m_reifiedResult;
  69. WriteBarrier<JSString> m_reifiedInput;
  70. };
  71. } // namespace JSC
  72. #endif // RegExpCachedResult_h