| 1 | /* |
|---|
| 2 | * Copyright (C) 2009 Apple Inc. All rights reserved. |
|---|
| 3 | * Copyright (C) 2010 Peter Varga (pvarga@inf.u-szeged.hu), University of Szeged |
|---|
| 4 | * All rights reserved. |
|---|
| 5 | * |
|---|
| 6 | * Redistribution and use in source and binary forms, with or without |
|---|
| 7 | * modification, are permitted provided that the following conditions |
|---|
| 8 | * are met: |
|---|
| 9 | * 1. Redistributions of source code must retain the above copyright |
|---|
| 10 | * notice, this list of conditions and the following disclaimer. |
|---|
| 11 | * 2. Redistributions in binary form must reproduce the above copyright |
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the |
|---|
| 13 | * documentation and/or other materials provided with the distribution. |
|---|
| 14 | * |
|---|
| 15 | * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY |
|---|
| 16 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|---|
| 17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
|---|
| 18 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR |
|---|
| 19 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
|---|
| 20 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|---|
| 21 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
|---|
| 22 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
|---|
| 23 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|---|
| 24 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|---|
| 25 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 26 | */ |
|---|
| 27 | |
|---|
| 28 | #pragma once |
|---|
| 29 | |
|---|
| 30 | #include <limits.h> |
|---|
| 31 | #include <limits> |
|---|
| 32 | #include "YarrErrorCode.h" |
|---|
| 33 | |
|---|
| 34 | namespace JSC { namespace Yarr { |
|---|
| 35 | |
|---|
| 36 | #define YarrStackSpaceForBackTrackInfoPatternCharacter 2 // Only for !fixed quantifiers. |
|---|
| 37 | #define YarrStackSpaceForBackTrackInfoCharacterClass 2 // Only for !fixed quantifiers. |
|---|
| 38 | #define YarrStackSpaceForBackTrackInfoBackReference 2 |
|---|
| 39 | #define YarrStackSpaceForBackTrackInfoAlternative 1 // One per alternative. |
|---|
| 40 | #define YarrStackSpaceForBackTrackInfoParentheticalAssertion 1 |
|---|
| 41 | #define YarrStackSpaceForBackTrackInfoParenthesesOnce 2 |
|---|
| 42 | #define YarrStackSpaceForBackTrackInfoParenthesesTerminal 1 |
|---|
| 43 | #define YarrStackSpaceForBackTrackInfoParentheses 4 |
|---|
| 44 | #define YarrStackSpaceForDotStarEnclosure 1 |
|---|
| 45 | |
|---|
| 46 | static const unsigned quantifyInfinite = UINT_MAX; |
|---|
| 47 | static const unsigned offsetNoMatch = std::numeric_limits<unsigned>::max(); |
|---|
| 48 | |
|---|
| 49 | // The below limit restricts the number of "recursive" match calls in order to |
|---|
| 50 | // avoid spending exponential time on complex regular expressions. |
|---|
| 51 | static const unsigned matchLimit = 1000000; |
|---|
| 52 | |
|---|
| 53 | enum JSRegExpResult { |
|---|
| 54 | JSRegExpMatch = 1, |
|---|
| 55 | JSRegExpNoMatch = 0, |
|---|
| 56 | JSRegExpErrorNoMatch = -1, |
|---|
| 57 | JSRegExpJITCodeFailure = -2, |
|---|
| 58 | JSRegExpErrorHitLimit = -3, |
|---|
| 59 | JSRegExpErrorNoMemory = -4, |
|---|
| 60 | JSRegExpErrorInternal = -5, |
|---|
| 61 | }; |
|---|
| 62 | |
|---|
| 63 | enum YarrCharSize { |
|---|
| 64 | Char8, |
|---|
| 65 | Char16 |
|---|
| 66 | }; |
|---|
| 67 | |
|---|
| 68 | enum class BuiltInCharacterClassID : unsigned { |
|---|
| 69 | DigitClassID, |
|---|
| 70 | SpaceClassID, |
|---|
| 71 | WordClassID, |
|---|
| 72 | DotClassID, |
|---|
| 73 | BaseUnicodePropertyID |
|---|
| 74 | }; |
|---|
| 75 | |
|---|
| 76 | struct BytecodePattern; |
|---|
| 77 | |
|---|
| 78 | } } // namespace JSC::Yarr |
|---|
| 79 | |
|---|
