michael@0: /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
michael@0:  * vim: set ts=8 sts=4 et sw=4 tw=99:
michael@0:  *
michael@0:  * Copyright (C) 2009 Apple Inc. All rights reserved.
michael@0:  * Copyright (C) 2010 Peter Varga (pvarga@inf.u-szeged.hu), University of Szeged
michael@0:  * All rights reserved.
michael@0:  *
michael@0:  * Redistribution and use in source and binary forms, with or without
michael@0:  * modification, are permitted provided that the following conditions
michael@0:  * are met:
michael@0:  * 1. Redistributions of source code must retain the above copyright
michael@0:  *    notice, this list of conditions and the following disclaimer.
michael@0:  * 2. Redistributions in binary form must reproduce the above copyright
michael@0:  *    notice, this list of conditions and the following disclaimer in the
michael@0:  *    documentation and/or other materials provided with the distribution.
michael@0:  *
michael@0:  * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY
michael@0:  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
michael@0:  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL UNIVERSITY OF SZEGED OR
michael@0:  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
michael@0:  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
michael@0:  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
michael@0:  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
michael@0:  * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0:  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0:  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0:  */
michael@0: 
michael@0: #ifndef yarr_Yarr_h
michael@0: #define yarr_Yarr_h
michael@0: 
michael@0: #include <limits.h>
michael@0: #include "yarr/YarrInterpreter.h"
michael@0: #include "yarr/YarrPattern.h"
michael@0: 
michael@0: namespace JSC { namespace Yarr {
michael@0: 
michael@0: #define YarrStackSpaceForBackTrackInfoPatternCharacter 1 // Only for !fixed quantifiers.
michael@0: #define YarrStackSpaceForBackTrackInfoCharacterClass 1 // Only for !fixed quantifiers.
michael@0: #define YarrStackSpaceForBackTrackInfoBackReference 2
michael@0: #define YarrStackSpaceForBackTrackInfoAlternative 1 // One per alternative.
michael@0: #define YarrStackSpaceForBackTrackInfoParentheticalAssertion 1
michael@0: #define YarrStackSpaceForBackTrackInfoParenthesesOnce 1 // Only for !fixed quantifiers.
michael@0: #define YarrStackSpaceForBackTrackInfoParenthesesTerminal 1
michael@0: #define YarrStackSpaceForBackTrackInfoParentheses 2
michael@0: 
michael@0: static const unsigned quantifyInfinite = UINT_MAX;
michael@0: static const unsigned offsetNoMatch = (unsigned)-1;
michael@0: static const unsigned offsetError = (unsigned)-2;
michael@0: 
michael@0: // The below limit restricts the number of "recursive" match calls in order to
michael@0: // avoid spending exponential time on complex regular expressions.
michael@0: static const unsigned matchLimit = 2500000;
michael@0: 
michael@0: enum JSRegExpResult {
michael@0:     JSRegExpMatch = 1,
michael@0:     JSRegExpNoMatch = 0,
michael@0:     JSRegExpErrorNoMatch = -1,
michael@0:     JSRegExpErrorHitLimit = -2,
michael@0:     JSRegExpErrorNoMemory = -3,
michael@0:     JSRegExpErrorInternal = -4
michael@0: };
michael@0: 
michael@0: enum YarrCharSize {
michael@0:     Char8,
michael@0:     Char16
michael@0: };
michael@0: 
michael@0: } } // namespace JSC::Yarr
michael@0: 
michael@0: #endif /* yarr_Yarr_h */