Skip to content

V
V8
Commit bbc2a73f authored by erik.corry@gmail.com's avatar erik.corry@gmail.com
Browse files
Options

Remove JSCRE 

Review URL: http://codereview.chromium.org/21504

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@1355 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 57dfd336
Hide whitespace changes
Inline Side-by-side
Showing with 21 additions and 9879 deletions
LICENSE
View file @ bbc2a73f
......@@ -2,13 +2,9 @@ This license applies to all parts of V8 that are not externally
maintained libraries. The externally maintained libraries used by V8
are:
- Jscre, located under third_party/jscre. This code is copyrighted
by the University of Cambridge and Apple Inc. and released under a
2-clause BSD license.
- PCRE test suite, located in test/mjsunit/regexp-pcre.js. This is
based on the test suite from PCRE-7.3, which is copyrighted by the
University of Cambridge and Google, Inc. The copyright notive and
University of Cambridge and Google, Inc. The copyright notice and
license are embedded in regexp-pcre.js.
- Dtoa, located under third_party/dtoa. This code is copyrighted by
......
SConstruct
View file @ bbc2a73f
......@@ -167,25 +167,6 @@ MKSNAPSHOT_EXTRA_FLAGS = {
}
JSCRE_EXTRA_FLAGS = {
'gcc': {
'all': {
'CPPDEFINES': ['SUPPORT_UTF8', 'NO_RECURSE', 'SUPPORT_UCP'],
'WARNINGFLAGS': ['-w']
},
},
'msvc': {
'all': {
'CPPDEFINES': ['SUPPORT_UTF8', 'NO_RECURSE', 'SUPPORT_UCP'],
'WARNINGFLAGS': ['/W3', '/WX', '/wd4355', '/wd4800']
},
'library:shared': {
'CPPDEFINES': ['BUILDING_V8_SHARED']
}
}
}
DTOA_EXTRA_FLAGS = {
'gcc': {
'all': {
......@@ -564,7 +545,6 @@ def BuildSpecific(env, mode, env_overrides):
library_flags = context.AddRelevantFlags(os.environ, LIBRARY_FLAGS)
v8_flags = context.AddRelevantFlags(library_flags, V8_EXTRA_FLAGS)
mksnapshot_flags = context.AddRelevantFlags(library_flags, MKSNAPSHOT_EXTRA_FLAGS)
jscre_flags = context.AddRelevantFlags(library_flags, JSCRE_EXTRA_FLAGS)
dtoa_flags = context.AddRelevantFlags(library_flags, DTOA_EXTRA_FLAGS)
cctest_flags = context.AddRelevantFlags(v8_flags, CCTEST_EXTRA_FLAGS)
sample_flags = context.AddRelevantFlags(os.environ, SAMPLE_FLAGS)
......@@ -573,7 +553,6 @@ def BuildSpecific(env, mode, env_overrides):
context.flags = {
'v8': v8_flags,
'mksnapshot': mksnapshot_flags,
'jscre': jscre_flags,
'dtoa': dtoa_flags,
'cctest': cctest_flags,
'sample': sample_flags,
......
src/SConscript
View file @ bbc2a73f
......@@ -97,15 +97,6 @@ regexp-delay.js
'''.split()
JSCRE_FILES = '''
pcre_compile.cpp
pcre_exec.cpp
pcre_tables.cpp
pcre_ucp_searchfuncs.cpp
pcre_xclass.cpp
'''.split()
def Abort(message):
print message
sys.exit(1)
......@@ -133,12 +124,6 @@ def ConfigureObjectFiles():
libraries_src, libraries_empty_src = env.JS2C(['libraries.cc', 'libraries-empty.cc'], library_files, TYPE='CORE')
libraries_obj = context.ConfigureObject(env, libraries_src, CPPPATH=['.'])
# Build JSCRE.
jscre_env = env.Copy()
jscre_env.Replace(**context.flags['jscre'])
jscre_files = [join('third_party', 'jscre', s) for s in JSCRE_FILES]
jscre_obj = context.ConfigureObject(jscre_env, jscre_files)
# Build dtoa.
dtoa_env = env.Copy()
dtoa_env.Replace(**context.flags['dtoa'])
......@@ -146,7 +131,7 @@ def ConfigureObjectFiles():
dtoa_obj = context.ConfigureObject(dtoa_env, dtoa_files)
source_objs = context.ConfigureObject(env, source_files)
non_snapshot_files = [jscre_obj, dtoa_obj, source_objs]
non_snapshot_files = [dtoa_obj, source_objs]
# Create snapshot if necessary.
empty_snapshot_obj = context.ConfigureObject(env, 'snapshot-empty.cc')
......
src/flag-definitions.h
View file @ bbc2a73f
......@@ -199,11 +199,10 @@ DEFINE_bool(usage_computation, true, "compute variable usage counts")
DEFINE_bool(preemption, false,
"activate a 100ms timer that switches between V8 threads")
// Irregexp
DEFINE_bool(irregexp, true, "new regular expression code")
DEFINE_bool(trace_regexps, false, "trace Irregexp execution")
DEFINE_bool(irregexp_native, true, "use native code Irregexp implementation (IA32 only)")
DEFINE_bool(irregexp_optimization, true, "generate optimized regexp code")
// Regexp
DEFINE_bool(trace_regexps, false, "trace regexp execution")
DEFINE_bool(regexp_native, true, "use native code regexp implementation (IA32 only)")
DEFINE_bool(regexp_optimization, true, "generate optimized regexp code")
// Testing flags test/cctest/test-{flags,api,serialization}.cc
DEFINE_bool(testing_bool_flag, true, "testing_bool_flag")
......@@ -296,10 +295,11 @@ DEFINE_bool(collect_heap_spill_statistics, false,
"report heap spill statistics along with heap_stats "
"(requires heap_stats)")
// irregexp
DEFINE_bool(trace_regexp_bytecodes, false, "trace Irregexp bytecode execution")
DEFINE_bool(trace_regexp_assembler, false,
"trace Irregexp macro assembler calls.")
// Regexp
DEFINE_bool(trace_regexp_bytecodes, false, "trace regexp bytecode execution")
DEFINE_bool(trace_regexp_assembler,
false,
"trace regexp macro assembler calls.")
//
// Logging and profiling only flags
......
src/jsregexp.cc
View file @ bbc2a73f
......@@ -51,44 +51,10 @@
#include "interpreter-irregexp.h"
// Including pcre.h undefines DEBUG to avoid getting debug output from
// the JSCRE implementation. Make sure to redefine it in debug mode
// after having included the header file.
#ifdef DEBUG
#include "third_party/jscre/pcre.h"
#define DEBUG
#else
#include "third_party/jscre/pcre.h"
#endif
namespace v8 { namespace internal {
static Failure* malloc_failure;
static void* JSREMalloc(size_t size) {
Object* obj = Heap::AllocateByteArray(size);
// If allocation failed, return a NULL pointer to JSRE, and jsRegExpCompile
// will return NULL to the caller, performs GC there.
// Also pass failure information to the caller.
if (obj->IsFailure()) {
malloc_failure = Failure::cast(obj);
return NULL;
}
// Note: object is unrooted, the caller of jsRegExpCompile must
// create a handle for the return value before doing heap allocation.
return reinterpret_cast<void*>(ByteArray::cast(obj)->GetDataStartAddress());
}
static void JSREFree(void* p) {
USE(p); // Do nothing, memory is garbage collected.
}
String* RegExpImpl::last_ascii_string_ = NULL;
String* RegExpImpl::two_byte_cached_string_ = NULL;
......@@ -272,10 +238,8 @@ Handle<Object> RegExpImpl::Compile(Handle<JSRegExp> re,
Vector<const uc16> atom_pattern = atom->data();
Handle<String> atom_string = Factory::NewStringFromTwoByte(atom_pattern);
result = AtomCompile(re, pattern, flags, atom_string);
} else if (FLAG_irregexp) {
result = IrregexpPrepare(re, pattern, flags);
} else {
result = JscrePrepare(re, pattern, flags);
result = IrregexpPrepare(re, pattern, flags);
}
Object* data = re->data();
if (data->IsFixedArray()) {
......@@ -301,8 +265,6 @@ Handle<Object> RegExpImpl::Exec(Handle<JSRegExp> regexp,
ASSERT(!result.is_null() || Top::has_pending_exception());
return result;
}
case JSRegExp::JSCRE:
return JscreExec(regexp, subject, index);
default:
UNREACHABLE();
return Handle<Object>::null();
......@@ -320,8 +282,6 @@ Handle<Object> RegExpImpl::ExecGlobal(Handle<JSRegExp> regexp,
ASSERT(!result.is_null() || Top::has_pending_exception());
return result;
}
case JSRegExp::JSCRE:
return JscreExecGlobal(regexp, subject);
default:
UNREACHABLE();
return Handle<Object>::null();
......@@ -391,259 +351,6 @@ Handle<Object> RegExpImpl::AtomExecGlobal(Handle<JSRegExp> re,
}
// JSCRE implementation.
int RegExpImpl::JscreNumberOfCaptures(Handle<JSRegExp> re) {
FixedArray* value = FixedArray::cast(re->DataAt(JSRegExp::kJscreDataIndex));
return Smi::cast(value->get(kJscreNumberOfCapturesIndex))->value();
}
ByteArray* RegExpImpl::JscreInternal(Handle<JSRegExp> re) {
FixedArray* value = FixedArray::cast(re->DataAt(JSRegExp::kJscreDataIndex));
return ByteArray::cast(value->get(kJscreInternalIndex));
}
Handle<Object>RegExpImpl::JscrePrepare(Handle<JSRegExp> re,
Handle<String> pattern,
JSRegExp::Flags flags) {
Handle<Object> value(Heap::undefined_value());
Factory::SetRegExpData(re, JSRegExp::JSCRE, pattern, flags, value);
return re;
}
static inline Object* JscreDoCompile(String* pattern,
JSRegExp::Flags flags,
unsigned* number_of_captures,
const char** error_message,
v8::jscre::JscreRegExp** code) {
v8::jscre::JSRegExpIgnoreCaseOption case_option = flags.is_ignore_case()
? v8::jscre::JSRegExpIgnoreCase
: v8::jscre::JSRegExpDoNotIgnoreCase;
v8::jscre::JSRegExpMultilineOption multiline_option = flags.is_multiline()
? v8::jscre::JSRegExpMultiline
: v8::jscre::JSRegExpSingleLine;
*error_message = NULL;
malloc_failure = Failure::Exception();
*code = v8::jscre::jsRegExpCompile(pattern->GetTwoByteData(),
pattern->length(),
case_option,
multiline_option,
number_of_captures,
error_message,
&JSREMalloc,
&JSREFree);
if (*code == NULL && (malloc_failure->IsRetryAfterGC() ||
malloc_failure->IsOutOfMemoryFailure())) {
return malloc_failure;
} else {
// It doesn't matter which object we return here, we just need to return
// a non-failure to indicate to the GC-retry code that there was no
// allocation failure.
return pattern;
}
}
static void JscreCompileWithRetryAfterGC(Handle<String> pattern,
JSRegExp::Flags flags,
unsigned* number_of_captures,
const char** error_message,
v8::jscre::JscreRegExp** code) {
CALL_HEAP_FUNCTION_VOID(JscreDoCompile(*pattern,
flags,
number_of_captures,
error_message,
code));
}
Handle<Object> RegExpImpl::JscreCompile(Handle<JSRegExp> re) {
ASSERT_EQ(re->TypeTag(), JSRegExp::JSCRE);
ASSERT(re->DataAt(JSRegExp::kJscreDataIndex)->IsUndefined());
Handle<String> pattern(re->Pattern());
JSRegExp::Flags flags = re->GetFlags();
Handle<String> two_byte_pattern = StringToTwoByte(pattern);
unsigned number_of_captures;
const char* error_message = NULL;
v8::jscre::JscreRegExp* code = NULL;
FlattenString(pattern);
JscreCompileWithRetryAfterGC(two_byte_pattern,
flags,
&number_of_captures,
&error_message,
&code);
if (code == NULL) {
// Throw an exception.
Handle<JSArray> array = Factory::NewJSArray(2);
SetElement(array, 0, pattern);
const char* message =
(error_message == NULL) ? "Unknown regexp error" : error_message;
SetElement(array, 1, Factory::NewStringFromUtf8(CStrVector(message)));
Handle<Object> regexp_err =
Factory::NewSyntaxError("malformed_regexp", array);
Top::Throw(*regexp_err);
return Handle<Object>();
}
// Convert the return address to a ByteArray pointer.
Handle<ByteArray> internal(
ByteArray::FromDataStartAddress(reinterpret_cast<Address>(code)));
Handle<FixedArray> value = Factory::NewFixedArray(kJscreDataLength);
value->set(kJscreNumberOfCapturesIndex, Smi::FromInt(number_of_captures));
value->set(kJscreInternalIndex, *internal);
Factory::SetRegExpData(re, JSRegExp::JSCRE, pattern, flags, value);
return re;
}
Handle<Object> RegExpImpl::JscreExec(Handle<JSRegExp> regexp,
Handle<String> subject,
Handle<Object> index) {
ASSERT_EQ(regexp->TypeTag(), JSRegExp::JSCRE);
if (regexp->DataAt(JSRegExp::kJscreDataIndex)->IsUndefined()) {
Handle<Object> compile_result = JscreCompile(regexp);
if (compile_result.is_null()) return compile_result;
}
ASSERT(regexp->DataAt(JSRegExp::kJscreDataIndex)->IsFixedArray());
int num_captures = JscreNumberOfCaptures(regexp);
OffsetsVector offsets((num_captures + 1) * 3);
int previous_index = static_cast<int>(DoubleToInteger(index->Number()));
Handle<String> subject16 = CachedStringToTwoByte(subject);
return JscreExecOnce(regexp,
num_captures,
subject,
previous_index,
subject16->GetTwoByteData(),
offsets.vector(),
offsets.length());
}
Handle<Object> RegExpImpl::JscreExecOnce(Handle<JSRegExp> regexp,
int num_captures,
Handle<String> subject,
int previous_index,
const uc16* two_byte_subject,
int* offsets_vector,
int offsets_vector_length) {
int rc;
{
AssertNoAllocation a;
ByteArray* internal = JscreInternal(regexp);
const v8::jscre::JscreRegExp* js_regexp =
reinterpret_cast<v8::jscre::JscreRegExp*>(
internal->GetDataStartAddress());
rc = v8::jscre::jsRegExpExecute(js_regexp,
two_byte_subject,
subject->length(),
previous_index,
offsets_vector,
offsets_vector_length);
}
// The KJS JavaScript engine returns null (ie, a failed match) when
// JSRE's internal match limit is exceeded. We duplicate that behavior here.
if (rc == v8::jscre::JSRegExpErrorNoMatch
|| rc == v8::jscre::JSRegExpErrorHitLimit) {
return Factory::null_value();
}
// Other JSRE errors:
if (rc < 0) {
// Throw an exception.
Handle<Object> code(Smi::FromInt(rc));
Handle<Object> args[2] = { Factory::LookupAsciiSymbol("jsre_exec"), code };
Handle<Object> regexp_err(
Factory::NewTypeError("jsre_error", HandleVector(args, 2)));
return Handle<Object>(Top::Throw(*regexp_err));
}
Handle<FixedArray> array = Factory::NewFixedArray(2 * (num_captures+1));
// The captures come in (start, end+1) pairs.
for (int i = 0; i < 2 * (num_captures+1); i += 2) {
array->set(i, Smi::FromInt(offsets_vector[i]));
array->set(i+1, Smi::FromInt(offsets_vector[i+1]));
}
return Factory::NewJSArrayWithElements(array);
}
Handle<Object> RegExpImpl::JscreExecGlobal(Handle<JSRegExp> regexp,
Handle<String> subject) {
ASSERT_EQ(regexp->TypeTag(), JSRegExp::JSCRE);
if (regexp->DataAt(JSRegExp::kJscreDataIndex)->IsUndefined()) {
Handle<Object> compile_result = JscreCompile(regexp);
if (compile_result.is_null()) return compile_result;
}
ASSERT(regexp->DataAt(JSRegExp::kJscreDataIndex)->IsFixedArray());
// Prepare space for the return values.
int num_captures = JscreNumberOfCaptures(regexp);
OffsetsVector offsets((num_captures + 1) * 3);
int previous_index = 0;
Handle<JSArray> result = Factory::NewJSArray(0);
int i = 0;
Handle<Object> matches;
Handle<String> subject16 = CachedStringToTwoByte(subject);
do {
if (previous_index > subject->length() || previous_index < 0) {
// Per ECMA-262 15.10.6.2, if the previous index is greater than the
// string length, there is no match.
matches = Factory::null_value();
} else {
matches = JscreExecOnce(regexp,
num_captures,
subject,
previous_index,
subject16->GetTwoByteData(),
offsets.vector(),
offsets.length());
if (matches->IsJSArray()) {
SetElement(result, i, matches);
i++;
previous_index = offsets.vector()[1];
if (offsets.vector()[0] == offsets.vector()[1]) {
previous_index++;
}
}
}
} while (matches->IsJSArray());
// If we exited the loop with an exception, throw it.
if (matches->IsNull()) {
// Exited loop normally.
return result;
} else {
// Exited loop with the exception in matches.
return matches;
}
}
// Irregexp implementation.
......@@ -2070,7 +1777,7 @@ RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler,
// We are being asked to make a non-generic version. Keep track of how many
// non-generic versions we generate so as not to overdo it.
trace_count_++;
if (FLAG_irregexp_optimization &&
if (FLAG_regexp_optimization &&
trace_count_ < kMaxCopiesCodeGenerated &&
compiler->recursion_depth() <= RegExpCompiler::kMaxRecursion) {
return CONTINUE;
......@@ -3237,7 +2944,7 @@ void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
if (not_at_start_) new_trace.set_at_start(Trace::FALSE);
alt_gen->expects_preload = preload_is_current;
bool generate_full_check_inline = false;
if (FLAG_irregexp_optimization &&
if (FLAG_regexp_optimization &&
try_to_emit_quick_check_for_alternative(i) &&
alternative.node()->EmitQuickCheck(compiler,
&new_trace,
......@@ -4038,7 +3745,7 @@ RegExpNode* RegExpQuantifier::ToNode(int min,
bool needs_capture_clearing = !capture_registers.is_empty();
if (body_can_be_empty) {
body_start_reg = compiler->AllocateRegister();
} else if (FLAG_irregexp_optimization && !needs_capture_clearing) {
} else if (FLAG_regexp_optimization && !needs_capture_clearing) {
// Only unroll if there are no captures and the body can't be
// empty.
if (min > 0 && min <= kMaxUnrolledMinMatches) {
......@@ -4930,7 +4637,7 @@ Handle<FixedArray> RegExpEngine::Compile(RegExpCompileData* data,
NodeInfo info = *node->info();
if (FLAG_irregexp_native) {
if (FLAG_regexp_native) {
#ifdef ARM
// Unimplemented, fall-through to bytecode implementation.
#else // IA32
......
src/jsregexp.h
View file @ bbc2a73f
......@@ -67,22 +67,12 @@ class RegExpImpl {
static Handle<Object> ExecGlobal(Handle<JSRegExp> regexp,
Handle<String> subject);
// Stores an uncompiled RegExp pattern in the JSRegExp object.
// It will be compiled by JSCRE when first executed.
static Handle<Object> JscrePrepare(Handle<JSRegExp> re,
Handle<String> pattern,
JSRegExp::Flags flags);
// Prepares a JSRegExp object with Irregexp-specific data.
static Handle<Object> IrregexpPrepare(Handle<JSRegExp> re,
Handle<String> pattern,
JSRegExp::Flags flags);
// Compile the pattern using JSCRE and store the result in the
// JSRegExp object.
static Handle<Object> JscreCompile(Handle<JSRegExp> re);
static Handle<Object> AtomCompile(Handle<JSRegExp> re,
Handle<String> pattern,
JSRegExp::Flags flags,
......@@ -94,23 +84,11 @@ class RegExpImpl {
static Handle<Object> AtomExecGlobal(Handle<JSRegExp> regexp,
Handle<String> subject);
static Handle<Object> JscreCompile(Handle<JSRegExp> re,
Handle<String> pattern,
JSRegExp::Flags flags);
// Execute a compiled JSCRE pattern.
static Handle<Object> JscreExec(Handle<JSRegExp> regexp,
Handle<String> subject,
Handle<Object> index);
// Execute an Irregexp bytecode pattern.
static Handle<Object> IrregexpExec(Handle<JSRegExp> regexp,
Handle<String> subject,
Handle<Object> index);
static Handle<Object> JscreExecGlobal(Handle<JSRegExp> regexp,
Handle<String> subject);
static Handle<Object> IrregexpExecGlobal(Handle<JSRegExp> regexp,
Handle<String> subject);
......@@ -129,31 +107,15 @@ class RegExpImpl {
static const int kIrregexpCodeIndex = 3;
static const int kIrregexpDataLength = 4;
static const int kJscreNumberOfCapturesIndex = 0;
static const int kJscreInternalIndex = 1;
static const int kJscreDataLength = 2;
private:
static String* last_ascii_string_;
static String* two_byte_cached_string_;
static int JscreNumberOfCaptures(Handle<JSRegExp> re);
static ByteArray* JscreInternal(Handle<JSRegExp> re);
static int IrregexpNumberOfCaptures(Handle<FixedArray> re);
static int IrregexpNumberOfRegisters(Handle<FixedArray> re);
static Handle<ByteArray> IrregexpByteCode(Handle<FixedArray> re);
static Handle<Code> IrregexpNativeCode(Handle<FixedArray> re);
// Call jsRegExpExecute once
static Handle<Object> JscreExecOnce(Handle<JSRegExp> regexp,
int num_captures,
Handle<String> subject,
int previous_index,
const uc16* utf8_subject,
int* ovector,
int ovector_length);
// On a successful match, the result is a JSArray containing
// captured positions. On a failure, the result is the null value.
// Returns an empty handle in case of an exception.
......
src/objects-debug.cc
View file @ bbc2a73f
......@@ -693,16 +693,10 @@ void JSRegExp::JSRegExpVerify() {
ASSERT(arr->get(JSRegExp::kAtomPatternIndex)->IsString());
break;
}
case JSRegExp::JSCRE: {
FixedArray* arr = FixedArray::cast(data());
Object* jscre_data = arr->get(JSRegExp::kJscreDataIndex);
ASSERT(jscre_data->IsFixedArray() || jscre_data->IsUndefined());
break;
}
case JSRegExp::IRREGEXP: {
FixedArray* arr = FixedArray::cast(data());
Object* jscre_data = arr->get(JSRegExp::kJscreDataIndex);
ASSERT(jscre_data->IsFixedArray());
Object* irregexp_data = arr->get(JSRegExp::kIrregexpDataIndex);
ASSERT(irregexp_data->IsFixedArray());
break;
}
default:
......
src/objects.h
View file @ bbc2a73f
......@@ -2943,11 +2943,10 @@ class JSRegExp: public JSObject {
public:
// Meaning of Type:
// NOT_COMPILED: Initial value. No data has been stored in the JSRegExp yet.
// JSCRE: A complex RegExp for JSCRE
// ATOM: A simple string to match against using an indexOf operation.
// IRREGEXP: Compiled with Irregexp.
// IRREGEXP_NATIVE: Compiled to native code with Irregexp.
enum Type { NOT_COMPILED, JSCRE, ATOM, IRREGEXP };
enum Type { NOT_COMPILED, ATOM, IRREGEXP };
enum Flag { NONE = 0, GLOBAL = 1, IGNORE_CASE = 2, MULTILINE = 4 };
class Flags {
......@@ -2981,10 +2980,9 @@ class JSRegExp: public JSObject {
static const int kTagIndex = 0;
static const int kSourceIndex = kTagIndex + 1;
static const int kFlagsIndex = kSourceIndex + 1;
// These three are the same since the same entry is shared for
// These two are the same since the same entry is shared for
// different purposes in different types of regexps.
static const int kAtomPatternIndex = kFlagsIndex + 1;
static const int kJscreDataIndex = kFlagsIndex + 1;
static const int kIrregexpDataIndex = kFlagsIndex + 1;
static const int kDataSize = kAtomPatternIndex + 1;
};
......
src/third_party/jscre/ASCIICType.h deleted 100644 → 0
View file @ 57dfd336
/*
* Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Apple Computer, Inc. ("Apple") nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef WTF_ASCIICType_h
#define WTF_ASCIICType_h
// The behavior of many of the functions in the <ctype.h> header is dependent
// on the current locale. But in the WebKit project, all uses of those functions
// are in code processing something that's not locale-specific. These equivalents
// for some of the <ctype.h> functions are named more explicitly, not dependent
// on the C library locale, and we should also optimize them as needed.
// All functions return false or leave the character unchanged if passed a character
// that is outside the range 0-7F. So they can be used on Unicode strings or
// characters if the intent is to do processing only if the character is ASCII.
inline bool isASCIIAlpha(char c) { return (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIAlpha(unsigned short c) { return (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIAlpha(int c) { return (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIAlphanumeric(char c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIAlphanumeric(unsigned short c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIAlphanumeric(int c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'z'; }
inline bool isASCIIDigit(char c) { return (c >= '0') & (c <= '9'); }
inline bool isASCIIDigit(unsigned short c) { return (c >= '0') & (c <= '9'); }
inline bool isASCIIDigit(int c) { return (c >= '0') & (c <= '9'); }
inline bool isASCIIHexDigit(char c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'f'; }
inline bool isASCIIHexDigit(unsigned short c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'f'; }
inline bool isASCIIHexDigit(int c) { return c >= '0' && c <= '9' || (c | 0x20) >= 'a' && (c | 0x20) <= 'f'; }
inline bool isASCIILower(char c) { return c >= 'a' && c <= 'z'; }
inline bool isASCIILower(unsigned short c) { return c >= 'a' && c <= 'z'; }
inline bool isASCIILower(int c) { return c >= 'a' && c <= 'z'; }
inline bool isASCIIUpper(char c) { return c >= 'A' && c <= 'Z'; }
inline bool isASCIIUpper(unsigned short c) { return c >= 'A' && c <= 'Z'; }
inline bool isASCIIUpper(int c) { return c >= 'A' && c <= 'Z'; }
/*
Statistics from a run of Apple's page load test for callers of isASCIISpace:
character count
--------- -----
non-spaces 689383
20 space 294720
0A \n 89059
09 \t 28320
0D \r 0
0C \f 0
0B \v 0
*/
inline bool isASCIISpace(char c) { return c <= ' ' && (c == ' ' || (c <= 0xD && c >= 0x9)); }
inline bool isASCIISpace(unsigned short c) { return c <= ' ' && (c == ' ' || (c <= 0xD && c >= 0x9)); }
inline bool isASCIISpace(int c) { return c <= ' ' && (c == ' ' || (c <= 0xD && c >= 0x9)); }
inline char toASCIILower(char c) { return c | ((c >= 'A' && c <= 'Z') << 5); }
inline unsigned short toASCIILower(unsigned short c) { return c | ((c >= 'A' && c <= 'Z') << 5); }
inline int toASCIILower(int c) { return c | ((c >= 'A' && c <= 'Z') << 5); }
inline char toASCIIUpper(char c) { return static_cast<char>(c & ~((c >= 'a' && c <= 'z') << 5)); }
inline unsigned short toASCIIUpper(unsigned short c) { return static_cast<unsigned short>(c & ~((c >= 'a' && c <= 'z') << 5)); }
inline int toASCIIUpper(int c) { return static_cast<int>(c & ~((c >= 'a' && c <= 'z') << 5)); }
inline int toASCIIHexValue(char c) { ASSERT(isASCIIHexDigit(c)); return c < 'A' ? c - '0' : (c - 'A' + 10) & 0xF; }
inline int toASCIIHexValue(unsigned short c) { ASSERT(isASCIIHexDigit(c)); return c < 'A' ? c - '0' : (c - 'A' + 10) & 0xF; }
inline int toASCIIHexValue(int c) { ASSERT(isASCIIHexDigit(c)); return c < 'A' ? c - '0' : (c - 'A' + 10) & 0xF; }
#endif
src/third_party/jscre/AUTHORS deleted 100644 → 0
View file @ 57dfd336
Originally written by: Philip Hazel
Email local part: ph10
Email domain: cam.ac.uk
University of Cambridge Computing Service,
Cambridge, England. Phone: +44 1223 334714.
Copyright (c) 1997-2005 University of Cambridge. All rights reserved.
Adapted for JavaScriptCore and WebKit by Apple Inc.
Copyright (c) 2005, 2006, 2007 Apple Inc. All rights reserved.
src/third_party/jscre/COPYING deleted 100644 → 0
View file @ 57dfd336
PCRE is a library of functions to support regular expressions whose syntax
and semantics are as close as possible to those of the Perl 5 language.
This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed.
Copyright (c) 1997-2005 University of Cambridge. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the name of Apple
Inc. nor the names of their contributors may be used to endorse or
promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
src/third_party/jscre/LICENSE deleted 100644 → 0
View file @ 57dfd336
-----------------------------------------------------------------------------
The following license text is extracted from the header of the file
ASCIICType.h and applies only to that file.
-----------------------------------------------------------------------------
Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Apple Computer, Inc. ("Apple") nor the names of
its contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
The following license text is from the file COPYING and applies to the other
source files in this directory.
-----------------------------------------------------------------------------
PCRE is a library of functions to support regular expressions whose syntax
and semantics are as close as possible to those of the Perl 5 language.
This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed.
Copyright (c) 1997-2005 University of Cambridge. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the name of Apple
Inc. nor the names of their contributors may be used to endorse or
promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
The following copyright lines are found in individual files other than
ASCIICType.h
-----------------------------------------------------------------------------
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
Copyright (C) 2002, 2004, 2006, 2007, 2008 Apple Inc. All rights reserved.
Copyright (C) 2007 Eric Seidel <eric@webkit.org>
Copyright (c) 1997-2005 University of Cambridge
Copyright (c) 1997-2005 University of Cambridge. All rights reserved.
Copyright (c) 1997-2006 University of Cambridge
Copyright (c) 2005, 2006, 2007 Apple Inc. All rights reserved.
src/third_party/jscre/config.h deleted 100644 → 0
View file @ 57dfd336
/* On Unix-like systems config.in is converted by "configure" into config.h.
Some other environments also support the use of "configure". PCRE is written in
Standard C, but there are a few non-standard things it can cope with, allowing
it to run on SunOS4 and other "close to standard" systems.
On a non-Unix-like system you should just copy this file into config.h, and set
up the macros the way you need them. You should normally change the definitions
of HAVE_STRERROR and HAVE_MEMMOVE to 1. Unfortunately, because of the way
autoconf works, these cannot be made the defaults. If your system has bcopy()
and not memmove(), change the definition of HAVE_BCOPY instead of HAVE_MEMMOVE.
If your system has neither bcopy() nor memmove(), leave them both as 0; an
emulation function will be used. */
/* If you are compiling for a system that uses EBCDIC instead of ASCII
character codes, define this macro as 1. On systems that can use "configure",
this can be done via --enable-ebcdic. */
#ifndef EBCDIC
#define EBCDIC 0
#endif
/* If you are compiling for a system other than a Unix-like system or Win32,
and it needs some magic to be inserted before the definition of a function that
is exported by the library, define this macro to contain the relevant magic. If
you do not define this macro, it defaults to "extern" for a C compiler and
"extern C" for a C++ compiler on non-Win32 systems. This macro apears at the
start of every exported function that is part of the external API. It does not
appear on functions that are "external" in the C sense, but which are internal
to the library. */
/* #define PCRE_DATA_SCOPE */
/* Define the following macro to empty if the "const" keyword does not work. */
#undef const
/* Define the following macro to "unsigned" if <stddef.h> does not define
size_t. */
#undef size_t
/* The following two definitions are mainly for the benefit of SunOS4, which
does not have the strerror() or memmove() functions that should be present in
all Standard C libraries. The macros HAVE_STRERROR and HAVE_MEMMOVE should
normally be defined with the value 1 for other systems, but unfortunately we
cannot make this the default because "configure" files generated by autoconf
will only change 0 to 1; they won't change 1 to 0 if the functions are not
found. */
#define HAVE_STRERROR 1
#define HAVE_MEMMOVE 1
/* There are some non-Unix-like systems that don't even have bcopy(). If this
macro is false, an emulation is used. If HAVE_MEMMOVE is set to 1, the value of
HAVE_BCOPY is not relevant. */
#define HAVE_BCOPY 0
/* The value of NEWLINE determines the newline character. The default is to
leave it up to the compiler, but some sites want to force a particular value.
On Unix-like systems, "configure" can be used to override this default. */
#ifndef NEWLINE
#define NEWLINE '\n'
#endif
/* The value of LINK_SIZE determines the number of bytes used to store links as
offsets within the compiled regex. The default is 2, which allows for compiled
patterns up to 64K long. This covers the vast majority of cases. However, PCRE
can also be compiled to use 3 or 4 bytes instead. This allows for longer
patterns in extreme cases. On systems that support it, "configure" can be used
to override this default. */
#ifndef LINK_SIZE
#define LINK_SIZE 2
#endif
/* When calling PCRE via the POSIX interface, additional working storage is
required for holding the pointers to capturing substrings because PCRE requires
three integers per substring, whereas the POSIX interface provides only two. If
the number of expected substrings is small, the wrapper function uses space on
the stack, because this is faster than using malloc() for each call. The
threshold above which the stack is no longer used is defined by POSIX_MALLOC_
THRESHOLD. On systems that support it, "configure" can be used to override this
default. */
#ifndef POSIX_MALLOC_THRESHOLD
#define POSIX_MALLOC_THRESHOLD 10
#endif
/* PCRE uses recursive function calls to handle backtracking while matching.
This can sometimes be a problem on systems that have stacks of limited size.
Define NO_RECURSE to get a version that doesn't use recursion in the match()
function; instead it creates its own stack by steam using pcre_recurse_malloc()
to obtain memory from the heap. For more detail, see the comments and other
stuff just above the match() function. On systems that support it, "configure"
can be used to set this in the Makefile (use --disable-stack-for-recursion). */
/* #define NO_RECURSE */
/* The value of MATCH_LIMIT determines the default number of times the internal
match() function can be called during a single execution of pcre_exec(). There
is a runtime interface for setting a different limit. The limit exists in order
to catch runaway regular expressions that take for ever to determine that they
do not match. The default is set very large so that it does not accidentally
catch legitimate cases. On systems that support it, "configure" can be used to
override this default default. */
#ifndef MATCH_LIMIT
#define MATCH_LIMIT 10000000
#endif
/* The above limit applies to all calls of match(), whether or not they
increase the recursion depth. In some environments it is desirable to limit the
depth of recursive calls of match() more strictly, in order to restrict the
maximum amount of stack (or heap, if NO_RECURSE is defined) that is used. The
value of MATCH_LIMIT_RECURSION applies only to recursive calls of match(). To
have any useful effect, it must be less than the value of MATCH_LIMIT. There is
a runtime method for setting a different limit. On systems that support it,
"configure" can be used to override this default default. */
#ifndef MATCH_LIMIT_RECURSION
#define MATCH_LIMIT_RECURSION MATCH_LIMIT
#endif
/* These three limits are parameterized just in case anybody ever wants to
change them. Care must be taken if they are increased, because they guard
against integer overflow caused by enormously large patterns. */
#ifndef MAX_NAME_SIZE
#define MAX_NAME_SIZE 32
#endif
#ifndef MAX_NAME_COUNT
#define MAX_NAME_COUNT 10000
#endif
#ifndef MAX_DUPLENGTH
#define MAX_DUPLENGTH 30000
#endif
/* End */
src/third_party/jscre/pcre.h deleted 100644 → 0
View file @ 57dfd336
/* This is the public header file for JavaScriptCore's variant of the PCRE
library. While this library started out as a copy of PCRE, many of the
features of PCRE have been removed. This library now supports only the
regular expression features required by the JavaScript language
specification, and has only the functions needed by JavaScriptCore and the
rest of WebKit.
Copyright (c) 1997-2005 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
// FIXME: This file needs to be renamed to JSRegExp.h; it's no longer PCRE.
#ifndef JSRegExp_h
#define JSRegExp_h
#include "../../../include/v8.h"
// JSCRE is very chatty in debug mode, so in order to keep it slient
// while still importing v8.h correctly (it contains #ifdef DEBUGs)
// we allow DEBUG to be set and undef it manually.
#undef DEBUG
namespace v8 { namespace jscre {
typedef uint16_t UChar;
struct JSRegExp;
typedef struct JSRegExp JscreRegExp;
enum JSRegExpIgnoreCaseOption { JSRegExpDoNotIgnoreCase, JSRegExpIgnoreCase };
enum JSRegExpMultilineOption { JSRegExpSingleLine, JSRegExpMultiline };
/* jsRegExpExecute error codes */
const int JSRegExpErrorNoMatch = -1;
const int JSRegExpErrorHitLimit = -2;
const int JSRegExpErrorNoMemory = -3;
const int JSRegExpErrorInternal = -4;
typedef void* malloc_t(size_t size);
typedef void free_t(void* address);
JSRegExp* jsRegExpCompile(const UChar* pattern, int patternLength,
JSRegExpIgnoreCaseOption, JSRegExpMultilineOption,
unsigned* numSubpatterns, const char** errorMessage,
malloc_t* allocate_function, free_t* free_function);
int jsRegExpExecute(const JSRegExp*,
const UChar* subject, int subjectLength, int startOffset,
int* offsetsVector, int offsetsVectorLength);
void jsRegExpFree(JSRegExp*);
} } // namespace v8::jscre
#endif
src/third_party/jscre/pcre_chartables.c deleted 100644 → 0
View file @ 57dfd336
/*************************************************
* Perl-Compatible Regular Expressions *
*************************************************/
/* This file is automatically written by the dftables auxiliary
program. If you edit it by hand, you might like to edit the Makefile to
prevent its ever being regenerated.
This file contains the default tables for characters with codes less than
128 (ASCII characters). These tables are used when no external tables are
passed to PCRE. */
const unsigned char kjs_pcre_default_tables[480] = {
/* This table is a lower casing table. */
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F,
0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27,
0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F,
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0x3E, 0x3F,
0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F,
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
0x78, 0x79, 0x7A, 0x5B, 0x5C, 0x5D, 0x5E, 0x5F,
0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F,
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
0x78, 0x79, 0x7A, 0x7B, 0x7C, 0x7D, 0x7E, 0x7F,
/* This table is a case flipping table. */
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F,
0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27,
0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F,
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0x3E, 0x3F,
0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F,
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
0x78, 0x79, 0x7A, 0x5B, 0x5C, 0x5D, 0x5E, 0x5F,
0x60, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47,
0x48, 0x49, 0x4A, 0x4B, 0x4C, 0x4D, 0x4E, 0x4F,
0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57,
0x58, 0x59, 0x5A, 0x7B, 0x7C, 0x7D, 0x7E, 0x7F,
/* This table contains bit maps for various character classes.
Each map is 32 bytes long and the bits run from the least
significant end of each byte. The classes are: space, digit, word. */
0x00, 0x3E, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFF, 0x03,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFF, 0x03,
0xFE, 0xFF, 0xFF, 0x87, 0xFE, 0xFF, 0xFF, 0x07,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
/* This table identifies various classes of character by individual bits:
0x01 white space character
0x08 hexadecimal digit
0x10 alphanumeric or '_'
*/
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0- 7 */
0x00, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00, /* 8- 15 */
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 16- 23 */
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 24- 31 */
0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* - ' */
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* ( - / */
0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, /* 0 - 7 */
0x18, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8 - ? */
0x00, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x10, /* @ - G */
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, /* H - O */
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, /* P - W */
0x10, 0x10, 0x10, 0x00, 0x00, 0x00, 0x00, 0x10, /* X - _ */
0x00, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x10, /* ` - g */
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, /* h - o */
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, /* p - w */
0x10, 0x10, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00}; /* x -127 */
/* End of chartables.c */
src/third_party/jscre/pcre_compile.cpp deleted 100644 → 0
View file @ 57dfd336
This source diff could not be displayed because it is too large. You can view the blob instead.
src/third_party/jscre/pcre_exec.cpp deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
Copyright (C) 2007 Eric Seidel <eric@webkit.org>
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/* This module contains jsRegExpExecute(), the externally visible function
that does pattern matching using an NFA algorithm, following the rules from
the JavaScript specification. There are also some supporting functions. */
#include "config.h"
#include "pcre_internal.h"
#include "ASCIICType.h"
#include <ctype.h>
#include <limits.h>
#include <string.h> /* for memcpy */
#ifdef __GNUC__
#define USE_COMPUTED_GOTO_FOR_MATCH_RECURSION
//#define USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
#endif
/* Avoid warnings on Windows. */
#undef min
#undef max
namespace v8 { namespace jscre {
#ifndef USE_COMPUTED_GOTO_FOR_MATCH_RECURSION
typedef int ReturnLocation;
#else
typedef void* ReturnLocation;
#endif
/* Structure for building a chain of data for holding the values of
the subject pointer at the start of each bracket, used to detect when
an empty string has been matched by a bracket to break infinite loops. */
struct BracketChainNode {
BracketChainNode* previousBracket;
const UChar* bracketStart;
};
struct MatchFrame {
ReturnLocation returnLocation;
struct MatchFrame* previousFrame;
/* Function arguments that may change */
struct {
const UChar* subjectPtr;
const unsigned char* instructionPtr;
int offsetTop;
BracketChainNode* bracketChain;
} args;
/* PCRE uses "fake" recursion built off of gotos, thus
stack-based local variables are not safe to use. Instead we have to
store local variables on the current MatchFrame. */
struct {
const unsigned char* data;
const unsigned char* startOfRepeatingBracket;
const UChar* subjectPtrAtStartOfInstruction; // Several instrutions stash away a subjectPtr here for later compare
const unsigned char* instructionPtrAtStartOfOnce;
int repeatOthercase;
int ctype;
int fc;
int fi;
int length;
int max;
int number;
int offset;
int saveOffset1;
int saveOffset2;
int saveOffset3;
BracketChainNode bracketChainNode;
} locals;
};
/* Structure for passing "static" information around between the functions
doing traditional NFA matching, so that they are thread-safe. */
struct MatchData {
int* offsetVector; /* Offset vector */
int offsetEnd; /* One past the end */
int offsetMax; /* The maximum usable for return data */
bool offsetOverflow; /* Set if too many extractions */
const UChar* startSubject; /* Start of the subject string */
const UChar* endSubject; /* End of the subject string */
const UChar* endMatchPtr; /* Subject position at end match */
int endOffsetTop; /* Highwater mark at end of match */
bool multiline;
bool ignoreCase;
};
/* The maximum remaining length of subject we are prepared to search for a
req_byte match. */
#define REQ_BYTE_MAX 1000
/* The below limit restricts the number of "recursive" match calls in order to
avoid spending exponential time on complex regular expressions. */
static const unsigned matchLimit = 100000;
#ifdef DEBUG
/*************************************************
* Debugging function to print chars *
*************************************************/
/* Print a sequence of chars in printable format, stopping at the end of the
subject if the requested.
Arguments:
p points to characters
length number to print
isSubject true if printing from within md.startSubject
md pointer to matching data block, if isSubject is true
*/
static void pchars(const UChar* p, int length, bool isSubject, const MatchData& md)
{
if (isSubject && length > md.endSubject - p)
length = md.endSubject - p;
while (length-- > 0) {
int c;
if (isprint(c = *(p++)))
printf("%c", c);
else if (c < 256)
printf("\\x%02x", c);
else
printf("\\x{%x}", c);
}
}
#endif
/*************************************************
* Match a back-reference *
*************************************************/
/* If a back reference hasn't been set, the length that is passed is greater
than the number of characters left in the string, so the match fails.
Arguments:
offset index into the offset vector
subjectPtr points into the subject
length length to be matched
md points to match data block
Returns: true if matched
*/
static bool matchRef(int offset, const UChar* subjectPtr, int length, const MatchData& md)
{
const UChar* p = md.startSubject + md.offsetVector[offset];
#ifdef DEBUG
if (subjectPtr >= md.endSubject)
printf("matching subject <null>");
else {
printf("matching subject ");
pchars(subjectPtr, length, true, md);
}
printf(" against backref ");
pchars(p, length, false, md);
printf("\n");
#endif
/* Always fail if not enough characters left */
if (length > md.endSubject - subjectPtr)
return false;
/* Separate the caselesss case for speed */
if (md.ignoreCase) {
while (length-- > 0) {
UChar c = *p++;
int othercase = kjs_pcre_ucp_othercase(c);
UChar d = *subjectPtr++;
if (c != d && othercase != d)
return false;
}
}
else {
while (length-- > 0)
if (*p++ != *subjectPtr++)
return false;
}
return true;
}
#ifndef USE_COMPUTED_GOTO_FOR_MATCH_RECURSION
/* Use numbered labels and switch statement at the bottom of the match function. */
#define RMATCH_WHERE(num) num
#define RRETURN_LABEL RRETURN_SWITCH
#else
/* Use GCC's computed goto extension. */
/* For one test case this is more than 40% faster than the switch statement.
We could avoid the use of the num argument entirely by using local labels,
but using it for the GCC case as well as the non-GCC case allows us to share
a bit more code and notice if we use conflicting numbers.*/
#define RMATCH_WHERE(num) &&RRETURN_##num
#define RRETURN_LABEL *stack.currentFrame->returnLocation
#endif
#define RECURSIVE_MATCH_COMMON(num) \
goto RECURSE;\
RRETURN_##num: \
stack.popCurrentFrame();
#define RECURSIVE_MATCH(num, ra, rb) \
do { \
stack.pushNewFrame((ra), (rb), RMATCH_WHERE(num)); \
RECURSIVE_MATCH_COMMON(num) \
} while (0)
#define RECURSIVE_MATCH_STARTNG_NEW_GROUP(num, ra, rb) \
do { \
stack.pushNewFrame((ra), (rb), RMATCH_WHERE(num)); \
startNewGroup(stack.currentFrame); \
RECURSIVE_MATCH_COMMON(num) \
} while (0)
#define RRETURN goto RRETURN_LABEL
#define RRETURN_NO_MATCH do { isMatch = false; RRETURN; } while (0)
/*************************************************
* Match from current position *
*************************************************/
/* On entry instructionPtr points to the first opcode, and subjectPtr to the first character
in the subject string, while substringStart holds the value of subjectPtr at the start of the
last bracketed group - used for breaking infinite loops matching zero-length
strings. This function is called recursively in many circumstances. Whenever it
returns a negative (error) response, the outer match() call must also return the
same response.
Arguments:
subjectPtr pointer in subject
instructionPtr position in code
offsetTop current top pointer
md pointer to "static" info for the match
Returns: 1 if matched ) these values are >= 0
0 if failed to match )
a negative error value if aborted by an error condition
(e.g. stopped by repeated call or recursion limit)
*/
static const unsigned FRAMES_ON_STACK = 16;
struct MatchStack {
MatchStack()
: framesEnd(frames + FRAMES_ON_STACK)
, currentFrame(frames)
, size(1) // match() creates accesses the first frame w/o calling pushNewFrame
{
ASSERT((sizeof(frames) / sizeof(frames[0])) == FRAMES_ON_STACK);
}
MatchFrame frames[FRAMES_ON_STACK];
MatchFrame* framesEnd;
MatchFrame* currentFrame;
unsigned size;
inline bool canUseStackBufferForNextFrame()
{
return size < FRAMES_ON_STACK;
}
inline MatchFrame* allocateNextFrame()
{
if (canUseStackBufferForNextFrame())
return currentFrame + 1;
return new MatchFrame;
}
inline void pushNewFrame(const unsigned char* instructionPtr, BracketChainNode* bracketChain, ReturnLocation returnLocation)
{
MatchFrame* newframe = allocateNextFrame();
newframe->previousFrame = currentFrame;
newframe->args.subjectPtr = currentFrame->args.subjectPtr;
newframe->args.offsetTop = currentFrame->args.offsetTop;
newframe->args.instructionPtr = instructionPtr;
newframe->args.bracketChain = bracketChain;
newframe->returnLocation = returnLocation;
size++;
currentFrame = newframe;
}
inline void popCurrentFrame()
{
MatchFrame* oldFrame = currentFrame;
currentFrame = currentFrame->previousFrame;
if (size > FRAMES_ON_STACK)
delete oldFrame;
size--;
}
void popAllFrames()
{
while (size)
popCurrentFrame();
}
};
static int matchError(int errorCode, MatchStack& stack)
{
stack.popAllFrames();
return errorCode;
}
/* Get the next UTF-8 character, not advancing the pointer, incrementing length
if there are extra bytes. This is called when we know we are in UTF-8 mode. */
static inline void getUTF8CharAndIncrementLength(int& c, const unsigned char* subjectPtr, int& len)
{
c = *subjectPtr;
if ((c & 0xc0) == 0xc0) {
int gcaa = kjs_pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */
int gcss = 6 * gcaa;
c = (c & kjs_pcre_utf8_table3[gcaa]) << gcss;
for (int gcii = 1; gcii <= gcaa; gcii++) {
gcss -= 6;
c |= (subjectPtr[gcii] & 0x3f) << gcss;
}
len += gcaa;
}
}
static inline void startNewGroup(MatchFrame* currentFrame)
{
/* At the start of a bracketed group, add the current subject pointer to the
stack of such pointers, to be re-instated at the end of the group when we hit
the closing ket. When match() is called in other circumstances, we don't add to
this stack. */
currentFrame->locals.bracketChainNode.previousBracket = currentFrame->args.bracketChain;
currentFrame->locals.bracketChainNode.bracketStart = currentFrame->args.subjectPtr;
currentFrame->args.bracketChain = &currentFrame->locals.bracketChainNode;
}
// FIXME: "minimize" means "not greedy", we should invert the callers to ask for "greedy" to be less confusing
static inline void repeatInformationFromInstructionOffset(short instructionOffset, bool& minimize, int& minimumRepeats, int& maximumRepeats)
{
// Instruction offsets are based off of OP_CRSTAR, OP_STAR, OP_TYPESTAR, OP_NOTSTAR
static const char minimumRepeatsFromInstructionOffset[] = { 0, 0, 1, 1, 0, 0 };
static const int maximumRepeatsFromInstructionOffset[] = { INT_MAX, INT_MAX, INT_MAX, INT_MAX, 1, 1 };
ASSERT(instructionOffset >= 0);
ASSERT(instructionOffset <= (OP_CRMINQUERY - OP_CRSTAR));
minimize = (instructionOffset & 1); // this assumes ordering: Instruction, MinimizeInstruction, Instruction2, MinimizeInstruction2
minimumRepeats = minimumRepeatsFromInstructionOffset[instructionOffset];
maximumRepeats = maximumRepeatsFromInstructionOffset[instructionOffset];
}
static int match(const UChar* subjectPtr, const unsigned char* instructionPtr, int offsetTop, MatchData& md)
{
bool isMatch = false;
int min;
bool minimize = false; /* Initialization not really needed, but some compilers think so. */
unsigned matchCount = 0;
MatchStack stack;
/* The opcode jump table. */
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
#define EMIT_JUMP_TABLE_ENTRY(opcode) &&LABEL_OP_##opcode,
static void* opcodeJumpTable[256] = { FOR_EACH_OPCODE(EMIT_JUMP_TABLE_ENTRY) };
#undef EMIT_JUMP_TABLE_ENTRY
#endif
/* One-time setup of the opcode jump table. */
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
for (int i = 255; !opcodeJumpTable[i]; i--)
opcodeJumpTable[i] = &&CAPTURING_BRACKET;
#endif
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_RECURSION
// Shark shows this as a hot line
// Using a static const here makes this line disappear, but makes later access hotter (not sure why)
stack.currentFrame->returnLocation = &&RETURN;
#else
stack.currentFrame->returnLocation = 0;
#endif
stack.currentFrame->args.subjectPtr = subjectPtr;
stack.currentFrame->args.instructionPtr = instructionPtr;
stack.currentFrame->args.offsetTop = offsetTop;
stack.currentFrame->args.bracketChain = 0;
startNewGroup(stack.currentFrame);
/* This is where control jumps back to to effect "recursion" */
RECURSE:
if (++matchCount > matchLimit)
return matchError(JSRegExpErrorHitLimit, stack);
/* Now start processing the operations. */
#ifndef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
while (true)
#endif
{
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
#define BEGIN_OPCODE(opcode) LABEL_OP_##opcode
#define NEXT_OPCODE goto *opcodeJumpTable[*stack.currentFrame->args.instructionPtr]
#else
#define BEGIN_OPCODE(opcode) case OP_##opcode
#define NEXT_OPCODE continue
#endif
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
NEXT_OPCODE;
#else
switch (*stack.currentFrame->args.instructionPtr)
#endif
{
/* Non-capturing bracket: optimized */
BEGIN_OPCODE(BRA):
NON_CAPTURING_BRACKET:
DPRINTF(("start bracket 0\n"));
do {
RECURSIVE_MATCH_STARTNG_NEW_GROUP(2, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
stack.currentFrame->args.instructionPtr += getLinkValue(stack.currentFrame->args.instructionPtr + 1);
} while (*stack.currentFrame->args.instructionPtr == OP_ALT);
DPRINTF(("bracket 0 failed\n"));
RRETURN;
/* Skip over large extraction number data if encountered. */
BEGIN_OPCODE(BRANUMBER):
stack.currentFrame->args.instructionPtr += 3;
NEXT_OPCODE;
/* End of the pattern. */
BEGIN_OPCODE(END):
md.endMatchPtr = stack.currentFrame->args.subjectPtr; /* Record where we ended */
md.endOffsetTop = stack.currentFrame->args.offsetTop; /* and how many extracts were taken */
isMatch = true;
RRETURN;
/* Assertion brackets. Check the alternative branches in turn - the
matching won't pass the KET for an assertion. If any one branch matches,
the assertion is true. Lookbehind assertions have an OP_REVERSE item at the
start of each branch to move the current point backwards, so the code at
this level is identical to the lookahead case. */
BEGIN_OPCODE(ASSERT):
do {
RECURSIVE_MATCH_STARTNG_NEW_GROUP(6, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, NULL);
if (isMatch)
break;
stack.currentFrame->args.instructionPtr += getLinkValue(stack.currentFrame->args.instructionPtr + 1);
} while (*stack.currentFrame->args.instructionPtr == OP_ALT);
if (*stack.currentFrame->args.instructionPtr == OP_KET)
RRETURN_NO_MATCH;
/* Continue from after the assertion, updating the offsets high water
mark, since extracts may have been taken during the assertion. */
advanceToEndOfBracket(stack.currentFrame->args.instructionPtr);
stack.currentFrame->args.instructionPtr += 1 + LINK_SIZE;
stack.currentFrame->args.offsetTop = md.endOffsetTop;
NEXT_OPCODE;
/* Negative assertion: all branches must fail to match */
BEGIN_OPCODE(ASSERT_NOT):
do {
RECURSIVE_MATCH_STARTNG_NEW_GROUP(7, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, NULL);
if (isMatch)
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr += getLinkValue(stack.currentFrame->args.instructionPtr + 1);
} while (*stack.currentFrame->args.instructionPtr == OP_ALT);
stack.currentFrame->args.instructionPtr += 1 + LINK_SIZE;
NEXT_OPCODE;
/* An alternation is the end of a branch; scan along to find the end of the
bracketed group and go to there. */
BEGIN_OPCODE(ALT):
advanceToEndOfBracket(stack.currentFrame->args.instructionPtr);
NEXT_OPCODE;
/* BRAZERO and BRAMINZERO occur just before a bracket group, indicating
that it may occur zero times. It may repeat infinitely, or not at all -
i.e. it could be ()* or ()? in the pattern. Brackets with fixed upper
repeat limits are compiled as a number of copies, with the optional ones
preceded by BRAZERO or BRAMINZERO. */
BEGIN_OPCODE(BRAZERO): {
stack.currentFrame->locals.startOfRepeatingBracket = stack.currentFrame->args.instructionPtr + 1;
RECURSIVE_MATCH_STARTNG_NEW_GROUP(14, stack.currentFrame->locals.startOfRepeatingBracket, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
advanceToEndOfBracket(stack.currentFrame->locals.startOfRepeatingBracket);
stack.currentFrame->args.instructionPtr = stack.currentFrame->locals.startOfRepeatingBracket + 1 + LINK_SIZE;
NEXT_OPCODE;
}
BEGIN_OPCODE(BRAMINZERO): {
stack.currentFrame->locals.startOfRepeatingBracket = stack.currentFrame->args.instructionPtr + 1;
advanceToEndOfBracket(stack.currentFrame->locals.startOfRepeatingBracket);
RECURSIVE_MATCH_STARTNG_NEW_GROUP(15, stack.currentFrame->locals.startOfRepeatingBracket + 1 + LINK_SIZE, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
}
/* End of a group, repeated or non-repeating. If we are at the end of
an assertion "group", stop matching and return 1, but record the
current high water mark for use by positive assertions. Do this also
for the "once" (not-backup up) groups. */
BEGIN_OPCODE(KET):
BEGIN_OPCODE(KETRMIN):
BEGIN_OPCODE(KETRMAX):
stack.currentFrame->locals.instructionPtrAtStartOfOnce = stack.currentFrame->args.instructionPtr - getLinkValue(stack.currentFrame->args.instructionPtr + 1);
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.bracketChain->bracketStart;
/* Back up the stack of bracket start pointers. */
stack.currentFrame->args.bracketChain = stack.currentFrame->args.bracketChain->previousBracket;
if (*stack.currentFrame->locals.instructionPtrAtStartOfOnce == OP_ASSERT || *stack.currentFrame->locals.instructionPtrAtStartOfOnce == OP_ASSERT_NOT) {
md.endOffsetTop = stack.currentFrame->args.offsetTop;
isMatch = true;
RRETURN;
}
/* In all other cases except a conditional group we have to check the
group number back at the start and if necessary complete handling an
extraction by setting the offsets and bumping the high water mark. */
stack.currentFrame->locals.number = *stack.currentFrame->locals.instructionPtrAtStartOfOnce - OP_BRA;
/* For extended extraction brackets (large number), we have to fish out
the number from a dummy opcode at the start. */
if (stack.currentFrame->locals.number > EXTRACT_BASIC_MAX)
stack.currentFrame->locals.number = get2ByteValue(stack.currentFrame->locals.instructionPtrAtStartOfOnce + 2 + LINK_SIZE);
stack.currentFrame->locals.offset = stack.currentFrame->locals.number << 1;
#ifdef DEBUG
printf("end bracket %d", stack.currentFrame->locals.number);
printf("\n");
#endif
/* Test for a numbered group. This includes groups called as a result
of recursion. Note that whole-pattern recursion is coded as a recurse
into group 0, so it won't be picked up here. Instead, we catch it when
the OP_END is reached. */
if (stack.currentFrame->locals.number > 0) {
if (stack.currentFrame->locals.offset >= md.offsetMax)
md.offsetOverflow = true;
else {
md.offsetVector[stack.currentFrame->locals.offset] =
md.offsetVector[md.offsetEnd - stack.currentFrame->locals.number];
md.offsetVector[stack.currentFrame->locals.offset+1] = stack.currentFrame->args.subjectPtr - md.startSubject;
if (stack.currentFrame->args.offsetTop <= stack.currentFrame->locals.offset)
stack.currentFrame->args.offsetTop = stack.currentFrame->locals.offset + 2;
}
}
/* For a non-repeating ket, just continue at this level. This also
happens for a repeating ket if no characters were matched in the group.
This is the forcible breaking of infinite loops as implemented in Perl
5.005. If there is an options reset, it will get obeyed in the normal
course of events. */
if (*stack.currentFrame->args.instructionPtr == OP_KET || stack.currentFrame->args.subjectPtr == stack.currentFrame->locals.subjectPtrAtStartOfInstruction) {
stack.currentFrame->args.instructionPtr += 1 + LINK_SIZE;
NEXT_OPCODE;
}
/* The repeating kets try the rest of the pattern or restart from the
preceding bracket, in the appropriate order. */
if (*stack.currentFrame->args.instructionPtr == OP_KETRMIN) {
RECURSIVE_MATCH(16, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
RECURSIVE_MATCH_STARTNG_NEW_GROUP(17, stack.currentFrame->locals.instructionPtrAtStartOfOnce, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
} else { /* OP_KETRMAX */
RECURSIVE_MATCH_STARTNG_NEW_GROUP(18, stack.currentFrame->locals.instructionPtrAtStartOfOnce, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
RECURSIVE_MATCH(19, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
}
RRETURN;
/* Start of subject. */
BEGIN_OPCODE(CIRC):
if (stack.currentFrame->args.subjectPtr != md.startSubject)
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
/* After internal newline if multiline. */
BEGIN_OPCODE(BOL):
if (stack.currentFrame->args.subjectPtr != md.startSubject && !isNewline(stack.currentFrame->args.subjectPtr[-1]))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
/* End of subject. */
BEGIN_OPCODE(DOLL):
if (stack.currentFrame->args.subjectPtr < md.endSubject)
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
/* Before internal newline if multiline. */
BEGIN_OPCODE(EOL):
if (stack.currentFrame->args.subjectPtr < md.endSubject && !isNewline(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
/* Word boundary assertions */
BEGIN_OPCODE(NOT_WORD_BOUNDARY):
BEGIN_OPCODE(WORD_BOUNDARY): {
bool currentCharIsWordChar = false;
bool previousCharIsWordChar = false;
if (stack.currentFrame->args.subjectPtr > md.startSubject)
previousCharIsWordChar = isWordChar(stack.currentFrame->args.subjectPtr[-1]);
if (stack.currentFrame->args.subjectPtr < md.endSubject)
currentCharIsWordChar = isWordChar(*stack.currentFrame->args.subjectPtr);
/* Now see if the situation is what we want */
bool wordBoundaryDesired = (*stack.currentFrame->args.instructionPtr++ == OP_WORD_BOUNDARY);
if (wordBoundaryDesired ? currentCharIsWordChar == previousCharIsWordChar : currentCharIsWordChar != previousCharIsWordChar)
RRETURN_NO_MATCH;
NEXT_OPCODE;
}
/* Match a single character type; inline for speed */
BEGIN_OPCODE(NOT_NEWLINE):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (isNewline(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(NOT_DIGIT):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (isASCIIDigit(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(DIGIT):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (!isASCIIDigit(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(NOT_WHITESPACE):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (isSpaceChar(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(WHITESPACE):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (!isSpaceChar(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(NOT_WORDCHAR):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (isWordChar(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
BEGIN_OPCODE(WORDCHAR):
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (!isWordChar(*stack.currentFrame->args.subjectPtr++))
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
NEXT_OPCODE;
/* Match a back reference, possibly repeatedly. Look past the end of the
item to see if there is repeat information following. The code is similar
to that for character classes, but repeated for efficiency. Then obey
similar code to character type repeats - written out again for speed.
However, if the referenced string is the empty string, always treat
it as matched, any number of times (otherwise there could be infinite
loops). */
BEGIN_OPCODE(REF):
stack.currentFrame->locals.offset = get2ByteValue(stack.currentFrame->args.instructionPtr + 1) << 1; /* Doubled ref number */
stack.currentFrame->args.instructionPtr += 3; /* Advance past item */
/* If the reference is unset, set the length to be longer than the amount
of subject left; this ensures that every attempt at a match fails. We
can't just fail here, because of the possibility of quantifiers with zero
minima. */
if (stack.currentFrame->locals.offset >= stack.currentFrame->args.offsetTop || md.offsetVector[stack.currentFrame->locals.offset] < 0)
stack.currentFrame->locals.length = 0;
else
stack.currentFrame->locals.length = md.offsetVector[stack.currentFrame->locals.offset+1] - md.offsetVector[stack.currentFrame->locals.offset];
/* Set up for repetition, or handle the non-repeated case */
switch (*stack.currentFrame->args.instructionPtr) {
case OP_CRSTAR:
case OP_CRMINSTAR:
case OP_CRPLUS:
case OP_CRMINPLUS:
case OP_CRQUERY:
case OP_CRMINQUERY:
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_CRSTAR, minimize, min, stack.currentFrame->locals.max);
break;
case OP_CRRANGE:
case OP_CRMINRANGE:
minimize = (*stack.currentFrame->args.instructionPtr == OP_CRMINRANGE);
min = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 3);
if (stack.currentFrame->locals.max == 0)
stack.currentFrame->locals.max = INT_MAX;
stack.currentFrame->args.instructionPtr += 5;
break;
default: /* No repeat follows */
if (!matchRef(stack.currentFrame->locals.offset, stack.currentFrame->args.subjectPtr, stack.currentFrame->locals.length, md))
RRETURN_NO_MATCH;
stack.currentFrame->args.subjectPtr += stack.currentFrame->locals.length;
NEXT_OPCODE;
}
/* If the length of the reference is zero, just continue with the
main loop. */
if (stack.currentFrame->locals.length == 0)
NEXT_OPCODE;
/* First, ensure the minimum number of matches are present. */
for (int i = 1; i <= min; i++) {
if (!matchRef(stack.currentFrame->locals.offset, stack.currentFrame->args.subjectPtr, stack.currentFrame->locals.length, md))
RRETURN_NO_MATCH;
stack.currentFrame->args.subjectPtr += stack.currentFrame->locals.length;
}
/* If min = max, continue at the same level without recursion.
They are not both allowed to be zero. */
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
/* If minimizing, keep trying and advancing the pointer */
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(20, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || !matchRef(stack.currentFrame->locals.offset, stack.currentFrame->args.subjectPtr, stack.currentFrame->locals.length, md))
RRETURN;
stack.currentFrame->args.subjectPtr += stack.currentFrame->locals.length;
}
/* Control never reaches here */
}
/* If maximizing, find the longest string and work backwards */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (!matchRef(stack.currentFrame->locals.offset, stack.currentFrame->args.subjectPtr, stack.currentFrame->locals.length, md))
break;
stack.currentFrame->args.subjectPtr += stack.currentFrame->locals.length;
}
while (stack.currentFrame->args.subjectPtr >= stack.currentFrame->locals.subjectPtrAtStartOfInstruction) {
RECURSIVE_MATCH(21, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
stack.currentFrame->args.subjectPtr -= stack.currentFrame->locals.length;
}
RRETURN_NO_MATCH;
}
/* Control never reaches here */
/* Match a bit-mapped character class, possibly repeatedly. This op code is
used when all the characters in the class have values in the range 0-255,
and either the matching is caseful, or the characters are in the range
0-127 when UTF-8 processing is enabled. The only difference between
OP_CLASS and OP_NCLASS occurs when a data character outside the range is
encountered.
First, look past the end of the item to see if there is repeat information
following. Then obey similar code to character type repeats - written out
again for speed. */
BEGIN_OPCODE(NCLASS):
BEGIN_OPCODE(CLASS):
stack.currentFrame->locals.data = stack.currentFrame->args.instructionPtr + 1; /* Save for matching */
stack.currentFrame->args.instructionPtr += 33; /* Advance past the item */
switch (*stack.currentFrame->args.instructionPtr) {
case OP_CRSTAR:
case OP_CRMINSTAR:
case OP_CRPLUS:
case OP_CRMINPLUS:
case OP_CRQUERY:
case OP_CRMINQUERY:
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_CRSTAR, minimize, min, stack.currentFrame->locals.max);
break;
case OP_CRRANGE:
case OP_CRMINRANGE:
minimize = (*stack.currentFrame->args.instructionPtr == OP_CRMINRANGE);
min = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 3);
if (stack.currentFrame->locals.max == 0)
stack.currentFrame->locals.max = INT_MAX;
stack.currentFrame->args.instructionPtr += 5;
break;
default: /* No repeat follows */
min = stack.currentFrame->locals.max = 1;
break;
}
/* First, ensure the minimum number of matches are present. */
for (int i = 1; i <= min; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
int c = *stack.currentFrame->args.subjectPtr++;
if (c > 255) {
if (stack.currentFrame->locals.data[-1] == OP_CLASS)
RRETURN_NO_MATCH;
} else {
if (!(stack.currentFrame->locals.data[c / 8] & (1 << (c & 7))))
RRETURN_NO_MATCH;
}
}
/* If max == min we can continue with the main loop without the
need to recurse. */
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
/* If minimizing, keep testing the rest of the expression and advancing
the pointer while it matches the class. */
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(22, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN;
int c = *stack.currentFrame->args.subjectPtr++;
if (c > 255) {
if (stack.currentFrame->locals.data[-1] == OP_CLASS)
RRETURN;
} else {
if ((stack.currentFrame->locals.data[c/8] & (1 << (c&7))) == 0)
RRETURN;
}
}
/* Control never reaches here */
}
/* If maximizing, find the longest possible run, then work backwards. */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (c > 255) {
if (stack.currentFrame->locals.data[-1] == OP_CLASS)
break;
} else {
if (!(stack.currentFrame->locals.data[c / 8] & (1 << (c & 7))))
break;
}
++stack.currentFrame->args.subjectPtr;
}
for (;;) {
RECURSIVE_MATCH(24, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->args.subjectPtr-- == stack.currentFrame->locals.subjectPtrAtStartOfInstruction)
break; /* Stop if tried at original pos */
}
RRETURN;
}
/* Control never reaches here */
/* Match an extended character class. */
BEGIN_OPCODE(XCLASS):
stack.currentFrame->locals.data = stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE; /* Save for matching */
stack.currentFrame->args.instructionPtr += getLinkValue(stack.currentFrame->args.instructionPtr + 1); /* Advance past the item */
switch (*stack.currentFrame->args.instructionPtr) {
case OP_CRSTAR:
case OP_CRMINSTAR:
case OP_CRPLUS:
case OP_CRMINPLUS:
case OP_CRQUERY:
case OP_CRMINQUERY:
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_CRSTAR, minimize, min, stack.currentFrame->locals.max);
break;
case OP_CRRANGE:
case OP_CRMINRANGE:
minimize = (*stack.currentFrame->args.instructionPtr == OP_CRMINRANGE);
min = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 3);
if (stack.currentFrame->locals.max == 0)
stack.currentFrame->locals.max = INT_MAX;
stack.currentFrame->args.instructionPtr += 5;
break;
default: /* No repeat follows */
min = stack.currentFrame->locals.max = 1;
}
/* First, ensure the minimum number of matches are present. */
for (int i = 1; i <= min; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
int c = *stack.currentFrame->args.subjectPtr++;
if (!kjs_pcre_xclass(c, stack.currentFrame->locals.data))
RRETURN_NO_MATCH;
}
/* If max == min we can continue with the main loop without the
need to recurse. */
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
/* If minimizing, keep testing the rest of the expression and advancing
the pointer while it matches the class. */
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(26, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN;
int c = *stack.currentFrame->args.subjectPtr++;
if (!kjs_pcre_xclass(c, stack.currentFrame->locals.data))
RRETURN;
}
/* Control never reaches here */
}
/* If maximizing, find the longest possible run, then work backwards. */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (!kjs_pcre_xclass(c, stack.currentFrame->locals.data))
break;
++stack.currentFrame->args.subjectPtr;
}
for(;;) {
RECURSIVE_MATCH(27, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->args.subjectPtr-- == stack.currentFrame->locals.subjectPtrAtStartOfInstruction)
break; /* Stop if tried at original pos */
}
RRETURN;
}
/* Control never reaches here */
/* Match a single character, casefully */
BEGIN_OPCODE(CHAR):
stack.currentFrame->locals.length = 1;
stack.currentFrame->args.instructionPtr++;
getUTF8CharAndIncrementLength(stack.currentFrame->locals.fc, stack.currentFrame->args.instructionPtr, stack.currentFrame->locals.length);
stack.currentFrame->args.instructionPtr += stack.currentFrame->locals.length;
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
if (stack.currentFrame->locals.fc != *stack.currentFrame->args.subjectPtr++)
RRETURN_NO_MATCH;
NEXT_OPCODE;
/* Match a single character, caselessly */
BEGIN_OPCODE(CHAR_IGNORING_CASE): {
stack.currentFrame->locals.length = 1;
stack.currentFrame->args.instructionPtr++;
getUTF8CharAndIncrementLength(stack.currentFrame->locals.fc, stack.currentFrame->args.instructionPtr, stack.currentFrame->locals.length);
stack.currentFrame->args.instructionPtr += stack.currentFrame->locals.length;
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
int dc = *stack.currentFrame->args.subjectPtr++;
if (stack.currentFrame->locals.fc != dc && kjs_pcre_ucp_othercase(stack.currentFrame->locals.fc) != dc)
RRETURN_NO_MATCH;
NEXT_OPCODE;
}
/* Match a single ASCII character. */
BEGIN_OPCODE(ASCII_CHAR):
if (md.endSubject == stack.currentFrame->args.subjectPtr)
RRETURN_NO_MATCH;
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->args.instructionPtr[1])
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
stack.currentFrame->args.instructionPtr += 2;
NEXT_OPCODE;
/* Match one of two cases of an ASCII letter. */
BEGIN_OPCODE(ASCII_LETTER_IGNORING_CASE):
if (md.endSubject == stack.currentFrame->args.subjectPtr)
RRETURN_NO_MATCH;
if ((*stack.currentFrame->args.subjectPtr | 0x20) != stack.currentFrame->args.instructionPtr[1])
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
stack.currentFrame->args.instructionPtr += 2;
NEXT_OPCODE;
/* Match a single character repeatedly; different opcodes share code. */
BEGIN_OPCODE(EXACT):
min = stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = false;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATCHAR;
BEGIN_OPCODE(UPTO):
BEGIN_OPCODE(MINUPTO):
min = 0;
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = *stack.currentFrame->args.instructionPtr == OP_MINUPTO;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATCHAR;
BEGIN_OPCODE(STAR):
BEGIN_OPCODE(MINSTAR):
BEGIN_OPCODE(PLUS):
BEGIN_OPCODE(MINPLUS):
BEGIN_OPCODE(QUERY):
BEGIN_OPCODE(MINQUERY):
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_STAR, minimize, min, stack.currentFrame->locals.max);
/* Common code for all repeated single-character matches. We can give
up quickly if there are fewer than the minimum number of characters left in
the subject. */
REPEATCHAR:
stack.currentFrame->locals.length = 1;
getUTF8CharAndIncrementLength(stack.currentFrame->locals.fc, stack.currentFrame->args.instructionPtr, stack.currentFrame->locals.length);
if (min * (stack.currentFrame->locals.fc > 0xFFFF ? 2 : 1) > md.endSubject - stack.currentFrame->args.subjectPtr)
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr += stack.currentFrame->locals.length;
if (stack.currentFrame->locals.fc <= 0xFFFF) {
int othercase = md.ignoreCase ? kjs_pcre_ucp_othercase(stack.currentFrame->locals.fc) : -1;
for (int i = 1; i <= min; i++) {
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc && *stack.currentFrame->args.subjectPtr != othercase)
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
if (minimize) {
stack.currentFrame->locals.repeatOthercase = othercase;
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(28, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN;
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc && *stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.repeatOthercase)
RRETURN;
++stack.currentFrame->args.subjectPtr;
}
/* Control never reaches here */
} else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc && *stack.currentFrame->args.subjectPtr != othercase)
break;
++stack.currentFrame->args.subjectPtr;
}
while (stack.currentFrame->args.subjectPtr >= stack.currentFrame->locals.subjectPtrAtStartOfInstruction) {
RECURSIVE_MATCH(29, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
--stack.currentFrame->args.subjectPtr;
}
RRETURN_NO_MATCH;
}
/* Control never reaches here */
} else {
/* No case on surrogate pairs, so no need to bother with "othercase". */
for (int i = 1; i <= min; i++) {
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc)
RRETURN_NO_MATCH;
stack.currentFrame->args.subjectPtr += 2;
}
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(30, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN;
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc)
RRETURN;
stack.currentFrame->args.subjectPtr += 2;
}
/* Control never reaches here */
} else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr > md.endSubject - 2)
break;
if (*stack.currentFrame->args.subjectPtr != stack.currentFrame->locals.fc)
break;
stack.currentFrame->args.subjectPtr += 2;
}
while (stack.currentFrame->args.subjectPtr >= stack.currentFrame->locals.subjectPtrAtStartOfInstruction) {
RECURSIVE_MATCH(31, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
stack.currentFrame->args.subjectPtr -= 2;
}
RRETURN_NO_MATCH;
}
/* Control never reaches here */
}
/* Control never reaches here */
/* Match a negated single one-byte character. */
BEGIN_OPCODE(NOT): {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN_NO_MATCH;
stack.currentFrame->args.instructionPtr++;
int c = *stack.currentFrame->args.subjectPtr++;
if (md.ignoreCase) {
if (c < 128)
c = toLowerCase(c);
if (toLowerCase(*stack.currentFrame->args.instructionPtr++) == c)
RRETURN_NO_MATCH;
} else {
if (*stack.currentFrame->args.instructionPtr++ == c)
RRETURN_NO_MATCH;
}
NEXT_OPCODE;
}
/* Match a negated single one-byte character repeatedly. This is almost a
repeat of the code for a repeated single character, but I haven't found a
nice way of commoning these up that doesn't require a test of the
positive/negative option for each character match. Maybe that wouldn't add
very much to the time taken, but character matching *is* what this is all
about... */
BEGIN_OPCODE(NOTEXACT):
min = stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = false;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATNOTCHAR;
BEGIN_OPCODE(NOTUPTO):
BEGIN_OPCODE(NOTMINUPTO):
min = 0;
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = *stack.currentFrame->args.instructionPtr == OP_NOTMINUPTO;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATNOTCHAR;
BEGIN_OPCODE(NOTSTAR):
BEGIN_OPCODE(NOTMINSTAR):
BEGIN_OPCODE(NOTPLUS):
BEGIN_OPCODE(NOTMINPLUS):
BEGIN_OPCODE(NOTQUERY):
BEGIN_OPCODE(NOTMINQUERY):
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_NOTSTAR, minimize, min, stack.currentFrame->locals.max);
/* Common code for all repeated single-byte matches. We can give up quickly
if there are fewer than the minimum number of bytes left in the
subject. */
REPEATNOTCHAR:
if (min > md.endSubject - stack.currentFrame->args.subjectPtr)
RRETURN_NO_MATCH;
stack.currentFrame->locals.fc = *stack.currentFrame->args.instructionPtr++;
/* The code is duplicated for the caseless and caseful cases, for speed,
since matching characters is likely to be quite common. First, ensure the
minimum number of matches are present. If min = max, continue at the same
level without recursing. Otherwise, if minimizing, keep trying the rest of
the expression and advancing one matching character if failing, up to the
maximum. Alternatively, if maximizing, find the maximum number of
characters and work backwards. */
DPRINTF(("negative matching %c{%d,%d}\n", stack.currentFrame->locals.fc, min, stack.currentFrame->locals.max));
if (md.ignoreCase) {
if (stack.currentFrame->locals.fc < 128)
stack.currentFrame->locals.fc = toLowerCase(stack.currentFrame->locals.fc);
for (int i = 1; i <= min; i++) {
int d = *stack.currentFrame->args.subjectPtr++;
if (d < 128)
d = toLowerCase(d);
if (stack.currentFrame->locals.fc == d)
RRETURN_NO_MATCH;
}
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(38, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
int d = *stack.currentFrame->args.subjectPtr++;
if (d < 128)
d = toLowerCase(d);
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject || stack.currentFrame->locals.fc == d)
RRETURN;
}
/* Control never reaches here */
}
/* Maximize case */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int d = *stack.currentFrame->args.subjectPtr;
if (d < 128)
d = toLowerCase(d);
if (stack.currentFrame->locals.fc == d)
break;
++stack.currentFrame->args.subjectPtr;
}
for (;;) {
RECURSIVE_MATCH(40, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->args.subjectPtr-- == stack.currentFrame->locals.subjectPtrAtStartOfInstruction)
break; /* Stop if tried at original pos */
}
RRETURN;
}
/* Control never reaches here */
}
/* Caseful comparisons */
else {
for (int i = 1; i <= min; i++) {
int d = *stack.currentFrame->args.subjectPtr++;
if (stack.currentFrame->locals.fc == d)
RRETURN_NO_MATCH;
}
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(42, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
int d = *stack.currentFrame->args.subjectPtr++;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject || stack.currentFrame->locals.fc == d)
RRETURN;
}
/* Control never reaches here */
}
/* Maximize case */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr;
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int d = *stack.currentFrame->args.subjectPtr;
if (stack.currentFrame->locals.fc == d)
break;
++stack.currentFrame->args.subjectPtr;
}
for (;;) {
RECURSIVE_MATCH(44, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->args.subjectPtr-- == stack.currentFrame->locals.subjectPtrAtStartOfInstruction)
break; /* Stop if tried at original pos */
}
RRETURN;
}
}
/* Control never reaches here */
/* Match a single character type repeatedly; several different opcodes
share code. This is very similar to the code for single characters, but we
repeat it in the interests of efficiency. */
BEGIN_OPCODE(TYPEEXACT):
min = stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = true;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATTYPE;
BEGIN_OPCODE(TYPEUPTO):
BEGIN_OPCODE(TYPEMINUPTO):
min = 0;
stack.currentFrame->locals.max = get2ByteValue(stack.currentFrame->args.instructionPtr + 1);
minimize = *stack.currentFrame->args.instructionPtr == OP_TYPEMINUPTO;
stack.currentFrame->args.instructionPtr += 3;
goto REPEATTYPE;
BEGIN_OPCODE(TYPESTAR):
BEGIN_OPCODE(TYPEMINSTAR):
BEGIN_OPCODE(TYPEPLUS):
BEGIN_OPCODE(TYPEMINPLUS):
BEGIN_OPCODE(TYPEQUERY):
BEGIN_OPCODE(TYPEMINQUERY):
repeatInformationFromInstructionOffset(*stack.currentFrame->args.instructionPtr++ - OP_TYPESTAR, minimize, min, stack.currentFrame->locals.max);
/* Common code for all repeated single character type matches. Note that
in UTF-8 mode, '.' matches a character of any length, but for the other
character types, the valid characters are all one-byte long. */
REPEATTYPE:
stack.currentFrame->locals.ctype = *stack.currentFrame->args.instructionPtr++; /* Code for the character type */
/* First, ensure the minimum number of matches are present. Use inline
code for maximizing the speed, and do the type test once at the start
(i.e. keep it out of the loop). Also we can test that there are at least
the minimum number of characters before we start. */
if (min > md.endSubject - stack.currentFrame->args.subjectPtr)
RRETURN_NO_MATCH;
if (min > 0) {
switch (stack.currentFrame->locals.ctype) {
case OP_NOT_NEWLINE:
for (int i = 1; i <= min; i++) {
if (isNewline(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_NOT_DIGIT:
for (int i = 1; i <= min; i++) {
if (isASCIIDigit(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_DIGIT:
for (int i = 1; i <= min; i++) {
if (!isASCIIDigit(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_NOT_WHITESPACE:
for (int i = 1; i <= min; i++) {
if (isSpaceChar(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_WHITESPACE:
for (int i = 1; i <= min; i++) {
if (!isSpaceChar(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_NOT_WORDCHAR:
for (int i = 1; i <= min; i++) {
if (isWordChar(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_WORDCHAR:
for (int i = 1; i <= min; i++) {
if (!isWordChar(*stack.currentFrame->args.subjectPtr))
RRETURN_NO_MATCH;
++stack.currentFrame->args.subjectPtr;
}
break;
default:
ASSERT_NOT_REACHED();
return matchError(JSRegExpErrorInternal, stack);
} /* End switch(stack.currentFrame->locals.ctype) */
}
/* If min = max, continue at the same level without recursing */
if (min == stack.currentFrame->locals.max)
NEXT_OPCODE;
/* If minimizing, we have to test the rest of the pattern before each
subsequent match. */
if (minimize) {
for (stack.currentFrame->locals.fi = min;; stack.currentFrame->locals.fi++) {
RECURSIVE_MATCH(48, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->locals.fi >= stack.currentFrame->locals.max || stack.currentFrame->args.subjectPtr >= md.endSubject)
RRETURN;
int c = *stack.currentFrame->args.subjectPtr++;
switch (stack.currentFrame->locals.ctype) {
case OP_NOT_NEWLINE:
if (isNewline(c))
RRETURN;
break;
case OP_NOT_DIGIT:
if (isASCIIDigit(c))
RRETURN;
break;
case OP_DIGIT:
if (!isASCIIDigit(c))
RRETURN;
break;
case OP_NOT_WHITESPACE:
if (isSpaceChar(c))
RRETURN;
break;
case OP_WHITESPACE:
if (!isSpaceChar(c))
RRETURN;
break;
case OP_NOT_WORDCHAR:
if (isWordChar(c))
RRETURN;
break;
case OP_WORDCHAR:
if (!isWordChar(c))
RRETURN;
break;
default:
ASSERT_NOT_REACHED();
return matchError(JSRegExpErrorInternal, stack);
}
}
/* Control never reaches here */
}
/* If maximizing it is worth using inline code for speed, doing the type
test once at the start (i.e. keep it out of the loop). */
else {
stack.currentFrame->locals.subjectPtrAtStartOfInstruction = stack.currentFrame->args.subjectPtr; /* Remember where we started */
switch (stack.currentFrame->locals.ctype) {
case OP_NOT_NEWLINE:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject || isNewline(*stack.currentFrame->args.subjectPtr))
break;
stack.currentFrame->args.subjectPtr++;
}
break;
case OP_NOT_DIGIT:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (isASCIIDigit(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_DIGIT:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (!isASCIIDigit(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_NOT_WHITESPACE:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (isSpaceChar(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_WHITESPACE:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (!isSpaceChar(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_NOT_WORDCHAR:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (isWordChar(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
case OP_WORDCHAR:
for (int i = min; i < stack.currentFrame->locals.max; i++) {
if (stack.currentFrame->args.subjectPtr >= md.endSubject)
break;
int c = *stack.currentFrame->args.subjectPtr;
if (!isWordChar(c))
break;
++stack.currentFrame->args.subjectPtr;
}
break;
default:
ASSERT_NOT_REACHED();
return matchError(JSRegExpErrorInternal, stack);
}
/* stack.currentFrame->args.subjectPtr is now past the end of the maximum run */
for (;;) {
RECURSIVE_MATCH(52, stack.currentFrame->args.instructionPtr, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
if (stack.currentFrame->args.subjectPtr-- == stack.currentFrame->locals.subjectPtrAtStartOfInstruction)
break; /* Stop if tried at original pos */
}
/* Get here if we can't make it match with any permitted repetitions */
RRETURN;
}
/* Control never reaches here */
BEGIN_OPCODE(CRMINPLUS):
BEGIN_OPCODE(CRMINQUERY):
BEGIN_OPCODE(CRMINRANGE):
BEGIN_OPCODE(CRMINSTAR):
BEGIN_OPCODE(CRPLUS):
BEGIN_OPCODE(CRQUERY):
BEGIN_OPCODE(CRRANGE):
BEGIN_OPCODE(CRSTAR):
ASSERT_NOT_REACHED();
return matchError(JSRegExpErrorInternal, stack);
#ifdef USE_COMPUTED_GOTO_FOR_MATCH_OPCODE_LOOP
CAPTURING_BRACKET:
#else
default:
#endif
/* Opening capturing bracket. If there is space in the offset vector, save
the current subject position in the working slot at the top of the vector. We
mustn't change the current values of the data slot, because they may be set
from a previous iteration of this group, and be referred to by a reference
inside the group.
If the bracket fails to match, we need to restore this value and also the
values of the final offsets, in case they were set by a previous iteration of
the same bracket.
If there isn't enough space in the offset vector, treat this as if it were a
non-capturing bracket. Don't worry about setting the flag for the error case
here; that is handled in the code for KET. */
ASSERT(*stack.currentFrame->args.instructionPtr > OP_BRA);
stack.currentFrame->locals.number = *stack.currentFrame->args.instructionPtr - OP_BRA;
/* For extended extraction brackets (large number), we have to fish out the
number from a dummy opcode at the start. */
if (stack.currentFrame->locals.number > EXTRACT_BASIC_MAX)
stack.currentFrame->locals.number = get2ByteValue(stack.currentFrame->args.instructionPtr + 2 + LINK_SIZE);
stack.currentFrame->locals.offset = stack.currentFrame->locals.number << 1;
#ifdef DEBUG
printf("start bracket %d subject=", stack.currentFrame->locals.number);
pchars(stack.currentFrame->args.subjectPtr, 16, true, md);
printf("\n");
#endif
if (stack.currentFrame->locals.offset < md.offsetMax) {
stack.currentFrame->locals.saveOffset1 = md.offsetVector[stack.currentFrame->locals.offset];
stack.currentFrame->locals.saveOffset2 = md.offsetVector[stack.currentFrame->locals.offset + 1];
stack.currentFrame->locals.saveOffset3 = md.offsetVector[md.offsetEnd - stack.currentFrame->locals.number];
DPRINTF(("saving %d %d %d\n", stack.currentFrame->locals.saveOffset1, stack.currentFrame->locals.saveOffset2, stack.currentFrame->locals.saveOffset3));
md.offsetVector[md.offsetEnd - stack.currentFrame->locals.number] = stack.currentFrame->args.subjectPtr - md.startSubject;
do {
RECURSIVE_MATCH_STARTNG_NEW_GROUP(1, stack.currentFrame->args.instructionPtr + 1 + LINK_SIZE, stack.currentFrame->args.bracketChain);
if (isMatch)
RRETURN;
stack.currentFrame->args.instructionPtr += getLinkValue(stack.currentFrame->args.instructionPtr + 1);
} while (*stack.currentFrame->args.instructionPtr == OP_ALT);
DPRINTF(("bracket %d failed\n", stack.currentFrame->locals.number));
md.offsetVector[stack.currentFrame->locals.offset] = stack.currentFrame->locals.saveOffset1;
md.offsetVector[stack.currentFrame->locals.offset + 1] = stack.currentFrame->locals.saveOffset2;
md.offsetVector[md.offsetEnd - stack.currentFrame->locals.number] = stack.currentFrame->locals.saveOffset3;
RRETURN;
}
/* Insufficient room for saving captured contents */
goto NON_CAPTURING_BRACKET;
}
/* Do not stick any code in here without much thought; it is assumed
that "continue" in the code above comes out to here to repeat the main
loop. */
} /* End of main loop */
ASSERT_NOT_REACHED();
#ifndef USE_COMPUTED_GOTO_FOR_MATCH_RECURSION
RRETURN_SWITCH:
switch (stack.currentFrame->returnLocation) {
case 0: goto RETURN;
case 1: goto RRETURN_1;
case 2: goto RRETURN_2;
case 6: goto RRETURN_6;
case 7: goto RRETURN_7;
case 14: goto RRETURN_14;
case 15: goto RRETURN_15;
case 16: goto RRETURN_16;
case 17: goto RRETURN_17;
case 18: goto RRETURN_18;
case 19: goto RRETURN_19;
case 20: goto RRETURN_20;
case 21: goto RRETURN_21;
case 22: goto RRETURN_22;
case 24: goto RRETURN_24;
case 26: goto RRETURN_26;
case 27: goto RRETURN_27;
case 28: goto RRETURN_28;
case 29: goto RRETURN_29;
case 30: goto RRETURN_30;
case 31: goto RRETURN_31;
case 38: goto RRETURN_38;
case 40: goto RRETURN_40;
case 42: goto RRETURN_42;
case 44: goto RRETURN_44;
case 48: goto RRETURN_48;
case 52: goto RRETURN_52;
}
ASSERT_NOT_REACHED();
return matchError(JSRegExpErrorInternal, stack);
#endif
RETURN:
return isMatch;
}
/*************************************************
* Execute a Regular Expression *
*************************************************/
/* This function applies a compiled re to a subject string and picks out
portions of the string if it matches. Two elements in the vector are set for
each substring: the offsets to the start and end of the substring.
Arguments:
re points to the compiled expression
extra_data points to extra data or is NULL
subject points to the subject string
length length of subject string (may contain binary zeros)
start_offset where to start in the subject string
options option bits
offsets points to a vector of ints to be filled in with offsets
offsetcount the number of elements in the vector
Returns: > 0 => success; value is the number of elements filled in
= 0 => success, but offsets is not big enough
-1 => failed to match
< -1 => some kind of unexpected problem
*/
static void tryFirstByteOptimization(const UChar*& subjectPtr, const UChar* endSubject, int first_byte, bool first_byte_caseless, bool useMultiLineFirstCharOptimization, const UChar* originalSubjectStart)
{
// If first_byte is set, try scanning to the first instance of that byte
// no need to try and match against any earlier part of the subject string.
if (first_byte >= 0) {
UChar first_char = first_byte;
if (first_byte_caseless)
while (subjectPtr < endSubject) {
int c = *subjectPtr;
if (c > 127)
break;
if (toLowerCase(c) == first_char)
break;
subjectPtr++;
}
else {
while (subjectPtr < endSubject && *subjectPtr != first_char)
subjectPtr++;
}
} else if (useMultiLineFirstCharOptimization) {
/* Or to just after \n for a multiline match if possible */
// I'm not sure why this != originalSubjectStart check is necessary -- ecs 11/18/07
if (subjectPtr > originalSubjectStart) {
while (subjectPtr < endSubject && !isNewline(subjectPtr[-1]))
subjectPtr++;
}
}
}
static bool tryRequiredByteOptimization(const UChar*& subjectPtr, const UChar* endSubject, int req_byte, int req_byte2, bool req_byte_caseless, bool hasFirstByte, const UChar*& reqBytePtr)
{
/* If req_byte is set, we know that that character must appear in the subject
for the match to succeed. If the first character is set, req_byte must be
later in the subject; otherwise the test starts at the match point. This
optimization can save a huge amount of backtracking in patterns with nested
unlimited repeats that aren't going to match. Writing separate code for
cased/caseless versions makes it go faster, as does using an autoincrement
and backing off on a match.
HOWEVER: when the subject string is very, very long, searching to its end can
take a long time, and give bad performance on quite ordinary patterns. This
showed up when somebody was matching /^C/ on a 32-megabyte string... so we
don't do this when the string is sufficiently long.
*/
if (req_byte >= 0 && endSubject - subjectPtr < REQ_BYTE_MAX) {
const UChar* p = subjectPtr + (hasFirstByte ? 1 : 0);
/* We don't need to repeat the search if we haven't yet reached the
place we found it at last time. */
if (p > reqBytePtr) {
if (req_byte_caseless) {
while (p < endSubject) {
int pp = *p++;
if (pp == req_byte || pp == req_byte2) {
p--;
break;
}
}
} else {
while (p < endSubject) {
if (*p++ == req_byte) {
p--;
break;
}
}
}
/* If we can't find the required character, break the matching loop */
if (p >= endSubject)
return true;
/* If we have found the required character, save the point where we
found it, so that we don't search again next time round the loop if
the start hasn't passed this character yet. */
reqBytePtr = p;
}
}
return false;
}
int jsRegExpExecute(const JSRegExp* re,
const UChar* subject, int length, int start_offset, int* offsets,
int offsetcount)
{
ASSERT(re);
ASSERT(subject);
ASSERT(offsetcount >= 0);
ASSERT(offsets || offsetcount == 0);
MatchData matchBlock;
matchBlock.startSubject = subject;
matchBlock.endSubject = matchBlock.startSubject + length;
const UChar* endSubject = matchBlock.endSubject;
matchBlock.multiline = (re->options & MatchAcrossMultipleLinesOption);
matchBlock.ignoreCase = (re->options & IgnoreCaseOption);
/* If the expression has got more back references than the offsets supplied can
hold, we get a temporary chunk of working store to use during the matching.
Otherwise, we can use the vector supplied, rounding down its size to a multiple
of 3. */
int ocount = offsetcount - (offsetcount % 3);
// FIXME: This is lame that we have to second-guess our caller here.
// The API should change to either fail-hard when we don't have enough offset space
// or that we shouldn't ask our callers to pre-allocate in the first place.
bool using_temporary_offsets = false;
if (re->top_backref > 0 && re->top_backref >= ocount/3) {
ocount = re->top_backref * 3 + 3;
matchBlock.offsetVector = new int[ocount];
if (!matchBlock.offsetVector)
return JSRegExpErrorNoMemory;
using_temporary_offsets = true;
} else
matchBlock.offsetVector = offsets;
matchBlock.offsetEnd = ocount;
matchBlock.offsetMax = (2*ocount)/3;
matchBlock.offsetOverflow = false;
/* Compute the minimum number of offsets that we need to reset each time. Doing
this makes a huge difference to execution time when there aren't many brackets
in the pattern. */
int resetcount = 2 + re->top_bracket * 2;
if (resetcount > offsetcount)
resetcount = ocount;
/* Reset the working variable associated with each extraction. These should
never be used unless previously set, but they get saved and restored, and so we
initialize them to avoid reading uninitialized locations. */
if (matchBlock.offsetVector) {
int* iptr = matchBlock.offsetVector + ocount;
int* iend = iptr - resetcount/2 + 1;
while (--iptr >= iend)
*iptr = -1;
}
/* Set up the first character to match, if available. The first_byte value is
never set for an anchored regular expression, but the anchoring may be forced
at run time, so we have to test for anchoring. The first char may be unset for
an unanchored pattern, of course. If there's no first char and the pattern was
studied, there may be a bitmap of possible first characters. */
bool first_byte_caseless = false;
int first_byte = -1;
if (re->options & UseFirstByteOptimizationOption) {
first_byte = re->first_byte & 255;
if ((first_byte_caseless = (re->first_byte & REQ_IGNORE_CASE)))
first_byte = toLowerCase(first_byte);
}
/* For anchored or unanchored matches, there may be a "last known required
character" set. */
bool req_byte_caseless = false;
int req_byte = -1;
int req_byte2 = -1;
if (re->options & UseRequiredByteOptimizationOption) {
req_byte = re->req_byte & 255; // FIXME: This optimization could be made to work for UTF16 chars as well...
req_byte_caseless = (re->req_byte & REQ_IGNORE_CASE);
req_byte2 = flipCase(req_byte);
}
/* Loop for handling unanchored repeated matching attempts; for anchored regexs
the loop runs just once. */
const UChar* startMatch = subject + start_offset;
const UChar* reqBytePtr = startMatch - 1;
bool useMultiLineFirstCharOptimization = re->options & UseMultiLineFirstByteOptimizationOption;
do {
/* Reset the maximum number of extractions we might see. */
if (matchBlock.offsetVector) {
int* iptr = matchBlock.offsetVector;
int* iend = iptr + resetcount;
while (iptr < iend)
*iptr++ = -1;
}
tryFirstByteOptimization(startMatch, endSubject, first_byte, first_byte_caseless, useMultiLineFirstCharOptimization, matchBlock.startSubject + start_offset);
if (tryRequiredByteOptimization(startMatch, endSubject, req_byte, req_byte2, req_byte_caseless, first_byte >= 0, reqBytePtr))
break;
/* When a match occurs, substrings will be set for all internal extractions;
we just need to set up the whole thing as substring 0 before returning. If
there were too many extractions, set the return code to zero. In the case
where we had to get some local store to hold offsets for backreferences, copy
those back references that we can. In this case there need not be overflow
if certain parts of the pattern were not used. */
/* The code starts after the JSRegExp block and the capture name table. */
const unsigned char* start_code = (const unsigned char*)(re + 1);
int returnCode = match(startMatch, start_code, 2, matchBlock);
/* When the result is no match, advance the pointer to the next character
and continue. */
if (returnCode == 0) {
startMatch++;
continue;
}
if (returnCode != 1) {
ASSERT(returnCode == JSRegExpErrorHitLimit || returnCode == JSRegExpErrorNoMemory);
DPRINTF((">>>> error: returning %d\n", returnCode));
return returnCode;
}
/* We have a match! Copy the offset information from temporary store if
necessary */
if (using_temporary_offsets) {
if (offsetcount >= 4) {
memcpy(offsets + 2, matchBlock.offsetVector + 2, (offsetcount - 2) * sizeof(int));
DPRINTF(("Copied offsets from temporary memory\n"));
}
if (matchBlock.endOffsetTop > offsetcount)
matchBlock.offsetOverflow = true;
DPRINTF(("Freeing temporary memory\n"));
delete [] matchBlock.offsetVector;
}
returnCode = matchBlock.offsetOverflow ? 0 : matchBlock.endOffsetTop / 2;
if (offsetcount < 2)
returnCode = 0;
else {
offsets[0] = startMatch - matchBlock.startSubject;
offsets[1] = matchBlock.endMatchPtr - matchBlock.startSubject;
}
DPRINTF((">>>> returning %d\n", returnCode));
return returnCode;
} while (!(re->options & IsAnchoredOption) && startMatch <= endSubject);
if (using_temporary_offsets) {
DPRINTF(("Freeing temporary memory\n"));
delete [] matchBlock.offsetVector;
}
DPRINTF((">>>> returning PCRE_ERROR_NOMATCH\n"));
return JSRegExpErrorNoMatch;
}
} } // namespace v8::jscre
src/third_party/jscre/pcre_internal.h deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/* This header contains definitions that are shared between the different
modules, but which are not relevant to the exported API. This includes some
functions whose names all begin with "_pcre_". */
#ifndef PCRE_INTERNAL_H
#define PCRE_INTERNAL_H
/* Bit definitions for entries in the pcre_ctypes table. */
#define ctype_space 0x01
#define ctype_xdigit 0x08
#define ctype_word 0x10 /* alphameric or '_' */
/* Offsets for the bitmap tables in pcre_cbits. Each table contains a set
of bits for a class map. Some classes are built by combining these tables. */
#define cbit_space 0 /* \s */
#define cbit_digit 32 /* \d */
#define cbit_word 64 /* \w */
#define cbit_length 96 /* Length of the cbits table */
/* Offsets of the various tables from the base tables pointer, and
total length. */
#define lcc_offset 0
#define fcc_offset 128
#define cbits_offset 256
#define ctypes_offset (cbits_offset + cbit_length)
#define tables_length (ctypes_offset + 128)
#ifndef DFTABLES
// TODO: Hook this up to something that checks assertions.
#define ASSERT(x) do { } while(0)
#define ASSERT_NOT_REACHED() do {} while(0)
#ifdef WIN32
#pragma warning(disable: 4232)
#pragma warning(disable: 4244)
#endif
#include "pcre.h"
/* The value of LINK_SIZE determines the number of bytes used to store links as
offsets within the compiled regex. The default is 2, which allows for compiled
patterns up to 64K long. */
#define LINK_SIZE 2
/* Define DEBUG to get debugging output on stdout. */
#if 0
#define DEBUG
#endif
/* Use a macro for debugging printing, 'cause that eliminates the use of #ifdef
inline, and there are *still* stupid compilers about that don't like indented
pre-processor statements, or at least there were when I first wrote this. After
all, it had only been about 10 years then... */
#ifdef DEBUG
#define DPRINTF(p) printf p
#else
#define DPRINTF(p) /*nothing*/
#endif
namespace v8 { namespace jscre {
/* PCRE keeps offsets in its compiled code as 2-byte quantities (always stored
in big-endian order) by default. These are used, for example, to link from the
start of a subpattern to its alternatives and its end. The use of 2 bytes per
offset limits the size of the compiled regex to around 64K, which is big enough
for almost everybody. However, I received a request for an even bigger limit.
For this reason, and also to make the code easier to maintain, the storing and
loading of offsets from the byte string is now handled by the functions that are
defined here. */
/* PCRE uses some other 2-byte quantities that do not change when the size of
offsets changes. There are used for repeat counts and for other things such as
capturing parenthesis numbers in back references. */
static inline void put2ByteValue(unsigned char* opcodePtr, int value)
{
ASSERT(value >= 0 && value <= 0xFFFF);
opcodePtr[0] = value >> 8;
opcodePtr[1] = value;
}
static inline int get2ByteValue(const unsigned char* opcodePtr)
{
return (opcodePtr[0] << 8) | opcodePtr[1];
}
static inline void put2ByteValueAndAdvance(unsigned char*& opcodePtr, int value)
{
put2ByteValue(opcodePtr, value);
opcodePtr += 2;
}
static inline void putLinkValueAllowZero(unsigned char* opcodePtr, int value)
{
put2ByteValue(opcodePtr, value);
}
static inline int getLinkValueAllowZero(const unsigned char* opcodePtr)
{
return get2ByteValue(opcodePtr);
}
#define MAX_PATTERN_SIZE (1 << 16)
static inline void putLinkValue(unsigned char* opcodePtr, int value)
{
ASSERT(value);
putLinkValueAllowZero(opcodePtr, value);
}
static inline int getLinkValue(const unsigned char* opcodePtr)
{
int value = getLinkValueAllowZero(opcodePtr);
ASSERT(value);
return value;
}
static inline void putLinkValueAndAdvance(unsigned char*& opcodePtr, int value)
{
putLinkValue(opcodePtr, value);
opcodePtr += LINK_SIZE;
}
static inline void putLinkValueAllowZeroAndAdvance(unsigned char*& opcodePtr, int value)
{
putLinkValueAllowZero(opcodePtr, value);
opcodePtr += LINK_SIZE;
}
// FIXME: These are really more of a "compiled regexp state" than "regexp options"
enum RegExpOptions {
UseFirstByteOptimizationOption = 0x40000000, /* first_byte is set */
UseRequiredByteOptimizationOption = 0x20000000, /* req_byte is set */
UseMultiLineFirstByteOptimizationOption = 0x10000000, /* start after \n for multiline */
IsAnchoredOption = 0x02000000, /* can't use partial with this regex */
IgnoreCaseOption = 0x00000001,
MatchAcrossMultipleLinesOption = 0x00000002
};
/* Flags added to firstbyte or reqbyte; a "non-literal" item is either a
variable-length repeat, or a anything other than literal characters. */
#define REQ_IGNORE_CASE 0x0100 /* indicates should ignore case */
#define REQ_VARY 0x0200 /* reqbyte followed non-literal item */
/* Miscellaneous definitions */
/* Flag bits and data types for the extended class (OP_XCLASS) for classes that
contain UTF-8 characters with values greater than 255. */
#define XCL_NOT 0x01 /* Flag: this is a negative class */
#define XCL_MAP 0x02 /* Flag: a 32-byte map is present */
#define XCL_END 0 /* Marks end of individual items */
#define XCL_SINGLE 1 /* Single item (one multibyte char) follows */
#define XCL_RANGE 2 /* A range (two multibyte chars) follows */
/* These are escaped items that aren't just an encoding of a particular data
value such as \n. They must have non-zero values, as check_escape() returns
their negation. Also, they must appear in the same order as in the opcode
definitions below, up to ESC_w. The final one must be
ESC_REF as subsequent values are used for \1, \2, \3, etc. There is are two
tests in the code for an escape > ESC_b and <= ESC_w to
detect the types that may be repeated. These are the types that consume
characters. If any new escapes are put in between that don't consume a
character, that code will have to change. */
enum { ESC_B = 1, ESC_b, ESC_D, ESC_d, ESC_S, ESC_s, ESC_W, ESC_w, ESC_REF };
/* Opcode table: OP_BRA must be last, as all values >= it are used for brackets
that extract substrings. Starting from 1 (i.e. after OP_END), the values up to
OP_EOD must correspond in order to the list of escapes immediately above.
Note that whenever this list is updated, the two macro definitions that follow
must also be updated to match. */
#define FOR_EACH_OPCODE(macro) \
macro(END) \
\
macro(NOT_WORD_BOUNDARY) \
macro(WORD_BOUNDARY) \
macro(NOT_DIGIT) \
macro(DIGIT) \
macro(NOT_WHITESPACE) \
macro(WHITESPACE) \
macro(NOT_WORDCHAR) \
macro(WORDCHAR) \
\
macro(NOT_NEWLINE) \
\
macro(CIRC) \
macro(DOLL) \
macro(BOL) \
macro(EOL) \
macro(CHAR) \
macro(CHAR_IGNORING_CASE) \
macro(ASCII_CHAR) \
macro(ASCII_LETTER_IGNORING_CASE) \
macro(NOT) \
\
macro(STAR) \
macro(MINSTAR) \
macro(PLUS) \
macro(MINPLUS) \
macro(QUERY) \
macro(MINQUERY) \
macro(UPTO) \
macro(MINUPTO) \
macro(EXACT) \
\
macro(NOTSTAR) \
macro(NOTMINSTAR) \
macro(NOTPLUS) \
macro(NOTMINPLUS) \
macro(NOTQUERY) \
macro(NOTMINQUERY) \
macro(NOTUPTO) \
macro(NOTMINUPTO) \
macro(NOTEXACT) \
\
macro(TYPESTAR) \
macro(TYPEMINSTAR) \
macro(TYPEPLUS) \
macro(TYPEMINPLUS) \
macro(TYPEQUERY) \
macro(TYPEMINQUERY) \
macro(TYPEUPTO) \
macro(TYPEMINUPTO) \
macro(TYPEEXACT) \
\
macro(CRSTAR) \
macro(CRMINSTAR) \
macro(CRPLUS) \
macro(CRMINPLUS) \
macro(CRQUERY) \
macro(CRMINQUERY) \
macro(CRRANGE) \
macro(CRMINRANGE) \
\
macro(CLASS) \
macro(NCLASS) \
macro(XCLASS) \
\
macro(REF) \
\
macro(ALT) \
macro(KET) \
macro(KETRMAX) \
macro(KETRMIN) \
\
macro(ASSERT) \
macro(ASSERT_NOT) \
\
macro(BRAZERO) \
macro(BRAMINZERO) \
macro(BRANUMBER) \
macro(BRA)
#define OPCODE_ENUM_VALUE(opcode) OP_##opcode,
enum { FOR_EACH_OPCODE(OPCODE_ENUM_VALUE) };
/* WARNING WARNING WARNING: There is an implicit assumption in pcre.c and
study.c that all opcodes are less than 128 in value. This makes handling UTF-8
character sequences easier. */
/* The highest extraction number before we have to start using additional
bytes. (Originally PCRE didn't have support for extraction counts higher than
this number.) The value is limited by the number of opcodes left after OP_BRA,
i.e. 255 - OP_BRA. We actually set it a bit lower to leave room for additional
opcodes. */
/* FIXME: Note that OP_BRA + 100 is > 128, so the two comments above
are in conflict! */
#define EXTRACT_BASIC_MAX 100
/* The index of names and the
code vector run on as long as necessary after the end. We store an explicit
offset to the name table so that if a regex is compiled on one host, saved, and
then run on another where the size of pointers is different, all might still
be well. For the case of compiled-on-4 and run-on-8, we include an extra
pointer that is always NULL.
*/
struct JSRegExp {
unsigned options;
unsigned short top_bracket;
unsigned short top_backref;
unsigned short first_byte;
unsigned short req_byte;
};
/* Internal shared data tables. These are tables that are used by more than one
of the exported public functions. They have to be "external" in the C sense,
but are not part of the PCRE public API. The data for these tables is in the
pcre_tables.c module. */
#define kjs_pcre_utf8_table1_size 6
extern const int kjs_pcre_utf8_table1[6];
extern const int kjs_pcre_utf8_table2[6];
extern const int kjs_pcre_utf8_table3[6];
extern const unsigned char kjs_pcre_utf8_table4[0x40];
extern const unsigned char kjs_pcre_default_tables[tables_length];
static inline unsigned char toLowerCase(unsigned char c)
{
static const unsigned char* lowerCaseChars = kjs_pcre_default_tables + lcc_offset;
return lowerCaseChars[c];
}
static inline unsigned char flipCase(unsigned char c)
{
static const unsigned char* flippedCaseChars = kjs_pcre_default_tables + fcc_offset;
return flippedCaseChars[c];
}
static inline unsigned char classBitmapForChar(unsigned char c)
{
static const unsigned char* charClassBitmaps = kjs_pcre_default_tables + cbits_offset;
return charClassBitmaps[c];
}
static inline unsigned char charTypeForChar(unsigned char c)
{
const unsigned char* charTypeMap = kjs_pcre_default_tables + ctypes_offset;
return charTypeMap[c];
}
static inline bool isWordChar(UChar c)
{
return c < 128 && (charTypeForChar(c) & ctype_word);
}
static inline bool isSpaceChar(UChar c)
{
return (c < 128 && (charTypeForChar(c) & ctype_space));
}
static inline bool isNewline(UChar nl)
{
return (nl == 0xA || nl == 0xD || nl == 0x2028 || nl == 0x2029);
}
static inline bool isBracketStartOpcode(unsigned char opcode)
{
if (opcode >= OP_BRA)
return true;
switch (opcode) {
case OP_ASSERT:
case OP_ASSERT_NOT:
return true;
default:
return false;
}
}
static inline void advanceToEndOfBracket(const unsigned char*& opcodePtr)
{
ASSERT(isBracketStartOpcode(*opcodePtr) || *opcodePtr == OP_ALT);
do
opcodePtr += getLinkValue(opcodePtr + 1);
while (*opcodePtr == OP_ALT);
}
/* Internal shared functions. These are functions that are used in more
that one of the source files. They have to have external linkage, but
but are not part of the public API and so not exported from the library. */
extern int kjs_pcre_ucp_othercase(unsigned);
extern bool kjs_pcre_xclass(int, const unsigned char*);
} } // namespace v8::jscre
#endif
#endif
/* End of pcre_internal.h */
src/third_party/jscre/pcre_tables.cpp deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/* This module contains some fixed tables that are used by more than one of the
PCRE code modules. */
#include "pcre_internal.h"
namespace v8 { namespace jscre {
/*************************************************
* Tables for UTF-8 support *
*************************************************/
/* These are the breakpoints for different numbers of bytes in a UTF-8
character. */
const int kjs_pcre_utf8_table1[6] =
{ 0x7f, 0x7ff, 0xffff, 0x1fffff, 0x3ffffff, 0x7fffffff};
/* These are the indicator bits and the mask for the data bits to set in the
first byte of a character, indexed by the number of additional bytes. */
const int kjs_pcre_utf8_table2[6] = { 0, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc};
const int kjs_pcre_utf8_table3[6] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
/* Table of the number of extra characters, indexed by the first character
masked with 0x3f. The highest number for a valid UTF-8 character is in fact
0x3d. */
const unsigned char kjs_pcre_utf8_table4[0x40] = {
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
#include "pcre_chartables.c"
} } // namespace v8::jscre
src/third_party/jscre/pcre_ucp_searchfuncs.cpp deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/* This module contains code for searching the table of Unicode character
properties. */
#include "pcre_internal.h"
#include "ucpinternal.h" /* Internal table details */
#include "ucptable.cpp" /* The table itself */
namespace v8 { namespace jscre {
/*************************************************
* Search table and return other case *
*************************************************/
/* If the given character is a letter, and there is another case for the
letter, return the other case. Otherwise, return -1.
Arguments:
c the character value
Returns: the other case or -1 if none
*/
int kjs_pcre_ucp_othercase(unsigned c)
{
int bot = 0;
int top = sizeof(ucp_table) / sizeof(cnode);
int mid;
/* The table is searched using a binary chop. You might think that using
intermediate variables to hold some of the common expressions would speed
things up, but tests with gcc 3.4.4 on Linux showed that, on the contrary, it
makes things a lot slower. */
for (;;) {
if (top <= bot)
return -1;
mid = (bot + top) >> 1;
if (c == (ucp_table[mid].f0 & f0_charmask))
break;
if (c < (ucp_table[mid].f0 & f0_charmask))
top = mid;
else {
if ((ucp_table[mid].f0 & f0_rangeflag) && (c <= (ucp_table[mid].f0 & f0_charmask) + (ucp_table[mid].f1 & f1_rangemask)))
break;
bot = mid + 1;
}
}
/* Found an entry in the table. Return -1 for a range entry. Otherwise return
the other case if there is one, else -1. */
if (ucp_table[mid].f0 & f0_rangeflag)
return -1;
int offset = ucp_table[mid].f1 & f1_casemask;
if (offset & f1_caseneg)
offset |= f1_caseneg;
return !offset ? -1 : c + offset;
}
} } // namespace v8::jscre
src/third_party/jscre/pcre_xclass.cpp deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/* This module contains an internal function that is used to match an extended
class (one that contains characters whose values are > 255). */
#include "pcre_internal.h"
namespace v8 { namespace jscre {
/*************************************************
* Match character against an XCLASS *
*************************************************/
/* This function is called to match a character against an extended class that
might contain values > 255.
Arguments:
c the character
data points to the flag byte of the XCLASS data
Returns: true if character matches, else false
*/
/* Get the next UTF-8 character, advancing the pointer. This is called when we
know we are in UTF-8 mode. */
static inline void getUTF8CharAndAdvancePointer(int& c, const unsigned char*& subjectPtr)
{
c = *subjectPtr++;
if ((c & 0xc0) == 0xc0) {
int gcaa = kjs_pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */
int gcss = 6 * gcaa;
c = (c & kjs_pcre_utf8_table3[gcaa]) << gcss;
while (gcaa-- > 0) {
gcss -= 6;
c |= (*subjectPtr++ & 0x3f) << gcss;
}
}
}
bool kjs_pcre_xclass(int c, const unsigned char* data)
{
bool negated = (*data & XCL_NOT);
/* Character values < 256 are matched against a bitmap, if one is present. If
not, we still carry on, because there may be ranges that start below 256 in the
additional data. */
if (c < 256) {
if ((*data & XCL_MAP) != 0 && (data[1 + c/8] & (1 << (c&7))) != 0)
return !negated; /* char found */
}
/* First skip the bit map if present. Then match against the list of Unicode
properties or large chars or ranges that end with a large char. We won't ever
encounter XCL_PROP or XCL_NOTPROP when UCP support is not compiled. */
if ((*data++ & XCL_MAP) != 0)
data += 32;
int t;
while ((t = *data++) != XCL_END) {
if (t == XCL_SINGLE) {
int x;
getUTF8CharAndAdvancePointer(x, data);
if (c == x)
return !negated;
}
else if (t == XCL_RANGE) {
int x, y;
getUTF8CharAndAdvancePointer(x, data);
getUTF8CharAndAdvancePointer(y, data);
if (c >= x && c <= y)
return !negated;
}
}
return negated; /* char did not match */
}
} } // namespace v8::jscre
src/third_party/jscre/ucpinternal.h deleted 100644 → 0
View file @ 57dfd336
/* This is JavaScriptCore's variant of the PCRE library. While this library
started out as a copy of PCRE, many of the features of PCRE have been
removed. This library now supports only the regular expression features
required by the JavaScript language specification, and has only the functions
needed by JavaScriptCore and the rest of WebKit.
Originally written by Philip Hazel
Copyright (c) 1997-2006 University of Cambridge
Copyright (C) 2002, 2004, 2006, 2007 Apple Inc. All rights reserved.
-----------------------------------------------------------------------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------------
*/
/*************************************************
* Unicode Property Table handler *
*************************************************/
/* Internal header file defining the layout of the bits in each pair of 32-bit
words that form a data item in the table. */
typedef struct cnode {
unsigned f0;
unsigned f1;
} cnode;
/* Things for the f0 field */
#define f0_scriptmask 0xff000000 /* Mask for script field */
#define f0_scriptshift 24 /* Shift for script value */
#define f0_rangeflag 0x00f00000 /* Flag for a range item */
#define f0_charmask 0x001fffff /* Mask for code point value */
/* Things for the f1 field */
#define f1_typemask 0xfc000000 /* Mask for char type field */
#define f1_typeshift 26 /* Shift for the type field */
#define f1_rangemask 0x0000ffff /* Mask for a range offset */
#define f1_casemask 0x0000ffff /* Mask for a case offset */
#define f1_caseneg 0xffff8000 /* Bits for negation */
/* The data consists of a vector of structures of type cnode. The two unsigned
32-bit integers are used as follows:
(f0) (1) The most significant byte holds the script number. The numbers are
defined by the enum in ucp.h.
(2) The 0x00800000 bit is set if this entry defines a range of characters.
It is not set if this entry defines a single character
(3) The 0x00600000 bits are spare.
(4) The 0x001fffff bits contain the code point. No Unicode code point will
ever be greater than 0x0010ffff, so this should be OK for ever.
(f1) (1) The 0xfc000000 bits contain the character type number. The numbers are
defined by an enum in ucp.h.
(2) The 0x03ff0000 bits are spare.
(3) The 0x0000ffff bits contain EITHER the unsigned offset to the top of
range if this entry defines a range, OR the *signed* offset to the
character's "other case" partner if this entry defines a single
character. There is no partner if the value is zero.
-------------------------------------------------------------------------------
| script (8) |.|.|.| codepoint (21) || type (6) |.|.| spare (8) | offset (16) |
-------------------------------------------------------------------------------
| | | | |
| | |-> spare | |-> spare
| | |
| |-> spare |-> spare
|
|-> range flag
The upper/lower casing information is set only for characters that come in
pairs. The non-one-to-one mappings in the Unicode data are ignored.
When searching the data, proceed as follows:
(1) Set up for a binary chop search.
(2) If the top is not greater than the bottom, the character is not in the
table. Its type must therefore be "Cn" ("Undefined").
(3) Find the middle vector element.
(4) Extract the code point and compare. If equal, we are done.
(5) If the test character is smaller, set the top to the current point, and
goto (2).
(6) If the current entry defines a range, compute the last character by adding
the offset, and see if the test character is within the range. If it is,
we are done.
(7) Otherwise, set the bottom to one element past the current point and goto
(2).
*/
/* End of ucpinternal.h */
src/third_party/jscre/ucptable.cpp deleted 100644 → 0
View file @ 57dfd336
/* This source module is automatically generated from the Unicode
property table. See ucpinternal.h for a description of the layout. */
static const cnode ucp_table[] = {
{ 0x09800000, 0x0000001f },
{ 0x09000020, 0x74000000 },
{ 0x09800021, 0x54000002 },
{ 0x09000024, 0x5c000000 },
{ 0x09800025, 0x54000002 },
{ 0x09000028, 0x58000000 },
{ 0x09000029, 0x48000000 },
{ 0x0900002a, 0x54000000 },
{ 0x0900002b, 0x64000000 },
{ 0x0900002c, 0x54000000 },
{ 0x0900002d, 0x44000000 },
{ 0x0980002e, 0x54000001 },
{ 0x09800030, 0x34000009 },
{ 0x0980003a, 0x54000001 },
{ 0x0980003c, 0x64000002 },
{ 0x0980003f, 0x54000001 },
{ 0x21000041, 0x24000020 },
{ 0x21000042, 0x24000020 },
{ 0x21000043, 0x24000020 },
{ 0x21000044, 0x24000020 },
{ 0x21000045, 0x24000020 },
{ 0x21000046, 0x24000020 },
{ 0x21000047, 0x24000020 },
{ 0x21000048, 0x24000020 },
{ 0x21000049, 0x24000020 },
{ 0x2100004a, 0x24000020 },
{ 0x2100004b, 0x24000020 },
{ 0x2100004c, 0x24000020 },
{ 0x2100004d, 0x24000020 },
{ 0x2100004e, 0x24000020 },
{ 0x2100004f, 0x24000020 },
{ 0x21000050, 0x24000020 },
{ 0x21000051, 0x24000020 },
{ 0x21000052, 0x24000020 },
{ 0x21000053, 0x24000020 },
{ 0x21000054, 0x24000020 },
{ 0x21000055, 0x24000020 },
{ 0x21000056, 0x24000020 },
{ 0x21000057, 0x24000020 },
{ 0x21000058, 0x24000020 },
{ 0x21000059, 0x24000020 },
{ 0x2100005a, 0x24000020 },
{ 0x0900005b, 0x58000000 },
{ 0x0900005c, 0x54000000 },
{ 0x0900005d, 0x48000000 },
{ 0x0900005e, 0x60000000 },
{ 0x0900005f, 0x40000000 },
{ 0x09000060, 0x60000000 },
{ 0x21000061, 0x1400ffe0 },
{ 0x21000062, 0x1400ffe0 },
{ 0x21000063, 0x1400ffe0 },
{ 0x21000064, 0x1400ffe0 },
{ 0x21000065, 0x1400ffe0 },
{ 0x21000066, 0x1400ffe0 },
{ 0x21000067, 0x1400ffe0 },
{ 0x21000068, 0x1400ffe0 },
{ 0x21000069, 0x1400ffe0 },
{ 0x2100006a, 0x1400ffe0 },
{ 0x2100006b, 0x1400ffe0 },
{ 0x2100006c, 0x1400ffe0 },
{ 0x2100006d, 0x1400ffe0 },
{ 0x2100006e, 0x1400ffe0 },
{ 0x2100006f, 0x1400ffe0 },
{ 0x21000070, 0x1400ffe0 },
{ 0x21000071, 0x1400ffe0 },
{ 0x21000072, 0x1400ffe0 },
{ 0x21000073, 0x1400ffe0 },
{ 0x21000074, 0x1400ffe0 },
{ 0x21000075, 0x1400ffe0 },
{ 0x21000076, 0x1400ffe0 },
{ 0x21000077, 0x1400ffe0 },
{ 0x21000078, 0x1400ffe0 },
{ 0x21000079, 0x1400ffe0 },
{ 0x2100007a, 0x1400ffe0 },
{ 0x0900007b, 0x58000000 },
{ 0x0900007c, 0x64000000 },
{ 0x0900007d, 0x48000000 },
{ 0x0900007e, 0x64000000 },
{ 0x0980007f, 0x00000020 },
{ 0x090000a0, 0x74000000 },
{ 0x090000a1, 0x54000000 },
{ 0x098000a2, 0x5c000003 },
{ 0x098000a6, 0x68000001 },
{ 0x090000a8, 0x60000000 },
{ 0x090000a9, 0x68000000 },
{ 0x210000aa, 0x14000000 },
{ 0x090000ab, 0x50000000 },
{ 0x090000ac, 0x64000000 },
{ 0x090000ad, 0x04000000 },
{ 0x090000ae, 0x68000000 },
{ 0x090000af, 0x60000000 },
{ 0x090000b0, 0x68000000 },
{ 0x090000b1, 0x64000000 },
{ 0x098000b2, 0x3c000001 },
{ 0x090000b4, 0x60000000 },
{ 0x090000b5, 0x140002e7 },
{ 0x090000b6, 0x68000000 },
{ 0x090000b7, 0x54000000 },
{ 0x090000b8, 0x60000000 },
{ 0x090000b9, 0x3c000000 },
{ 0x210000ba, 0x14000000 },
{ 0x090000bb, 0x4c000000 },
{ 0x098000bc, 0x3c000002 },
{ 0x090000bf, 0x54000000 },
{ 0x210000c0, 0x24000020 },
{ 0x210000c1, 0x24000020 },
{ 0x210000c2, 0x24000020 },
{ 0x210000c3, 0x24000020 },
{ 0x210000c4, 0x24000020 },
{ 0x210000c5, 0x24000020 },
{ 0x210000c6, 0x24000020 },
{ 0x210000c7, 0x24000020 },
{ 0x210000c8, 0x24000020 },
{ 0x210000c9, 0x24000020 },
{ 0x210000ca, 0x24000020 },
{ 0x210000cb, 0x24000020 },
{ 0x210000cc, 0x24000020 },
{ 0x210000cd, 0x24000020 },
{ 0x210000ce, 0x24000020 },
{ 0x210000cf, 0x24000020 },
{ 0x210000d0, 0x24000020 },
{ 0x210000d1, 0x24000020 },
{ 0x210000d2, 0x24000020 },
{ 0x210000d3, 0x24000020 },
{ 0x210000d4, 0x24000020 },
{ 0x210000d5, 0x24000020 },
{ 0x210000d6, 0x24000020 },
{ 0x090000d7, 0x64000000 },
{ 0x210000d8, 0x24000020 },
{ 0x210000d9, 0x24000020 },
{ 0x210000da, 0x24000020 },
{ 0x210000db, 0x24000020 },
{ 0x210000dc, 0x24000020 },
{ 0x210000dd, 0x24000020 },
{ 0x210000de, 0x24000020 },
{ 0x210000df, 0x14000000 },
{ 0x210000e0, 0x1400ffe0 },
{ 0x210000e1, 0x1400ffe0 },
{ 0x210000e2, 0x1400ffe0 },
{ 0x210000e3, 0x1400ffe0 },
{ 0x210000e4, 0x1400ffe0 },
{ 0x210000e5, 0x1400ffe0 },
{ 0x210000e6, 0x1400ffe0 },
{ 0x210000e7, 0x1400ffe0 },
{ 0x210000e8, 0x1400ffe0 },
{ 0x210000e9, 0x1400ffe0 },
{ 0x210000ea, 0x1400ffe0 },
{ 0x210000eb, 0x1400ffe0 },
{ 0x210000ec, 0x1400ffe0 },
{ 0x210000ed, 0x1400ffe0 },
{ 0x210000ee, 0x1400ffe0 },
{ 0x210000ef, 0x1400ffe0 },
{ 0x210000f0, 0x1400ffe0 },
{ 0x210000f1, 0x1400ffe0 },
{ 0x210000f2, 0x1400ffe0 },
{ 0x210000f3, 0x1400ffe0 },
{ 0x210000f4, 0x1400ffe0 },
{ 0x210000f5, 0x1400ffe0 },
{ 0x210000f6, 0x1400ffe0 },
{ 0x090000f7, 0x64000000 },
{ 0x210000f8, 0x1400ffe0 },
{ 0x210000f9, 0x1400ffe0 },
{ 0x210000fa, 0x1400ffe0 },
{ 0x210000fb, 0x1400ffe0 },
{ 0x210000fc, 0x1400ffe0 },
{ 0x210000fd, 0x1400ffe0 },
{ 0x210000fe, 0x1400ffe0 },
{ 0x210000ff, 0x14000079 },
{ 0x21000100, 0x24000001 },
{ 0x21000101, 0x1400ffff },
{ 0x21000102, 0x24000001 },
{ 0x21000103, 0x1400ffff },
{ 0x21000104, 0x24000001 },
{ 0x21000105, 0x1400ffff },
{ 0x21000106, 0x24000001 },
{ 0x21000107, 0x1400ffff },
{ 0x21000108, 0x24000001 },
{ 0x21000109, 0x1400ffff },
{ 0x2100010a, 0x24000001 },
{ 0x2100010b, 0x1400ffff },
{ 0x2100010c, 0x24000001 },
{ 0x2100010d, 0x1400ffff },
{ 0x2100010e, 0x24000001 },
{ 0x2100010f, 0x1400ffff },
{ 0x21000110, 0x24000001 },
{ 0x21000111, 0x1400ffff },
{ 0x21000112, 0x24000001 },
{ 0x21000113, 0x1400ffff },
{ 0x21000114, 0x24000001 },
{ 0x21000115, 0x1400ffff },
{ 0x21000116, 0x24000001 },
{ 0x21000117, 0x1400ffff },
{ 0x21000118, 0x24000001 },
{ 0x21000119, 0x1400ffff },
{ 0x2100011a, 0x24000001 },
{ 0x2100011b, 0x1400ffff },
{ 0x2100011c, 0x24000001 },
{ 0x2100011d, 0x1400ffff },
{ 0x2100011e, 0x24000001 },
{ 0x2100011f, 0x1400ffff },
{ 0x21000120, 0x24000001 },
{ 0x21000121, 0x1400ffff },
{ 0x21000122, 0x24000001 },
{ 0x21000123, 0x1400ffff },
{ 0x21000124, 0x24000001 },
{ 0x21000125, 0x1400ffff },
{ 0x21000126, 0x24000001 },
{ 0x21000127, 0x1400ffff },
{ 0x21000128, 0x24000001 },
{ 0x21000129, 0x1400ffff },
{ 0x2100012a, 0x24000001 },
{ 0x2100012b, 0x1400ffff },
{ 0x2100012c, 0x24000001 },
{ 0x2100012d, 0x1400ffff },
{ 0x2100012e, 0x24000001 },
{ 0x2100012f, 0x1400ffff },
{ 0x21000130, 0x2400ff39 },
{ 0x21000131, 0x1400ff18 },
{ 0x21000132, 0x24000001 },
{ 0x21000133, 0x1400ffff },
{ 0x21000134, 0x24000001 },
{ 0x21000135, 0x1400ffff },
{ 0x21000136, 0x24000001 },
{ 0x21000137, 0x1400ffff },
{ 0x21000138, 0x14000000 },
{ 0x21000139, 0x24000001 },
{ 0x2100013a, 0x1400ffff },
{ 0x2100013b, 0x24000001 },
{ 0x2100013c, 0x1400ffff },
{ 0x2100013d, 0x24000001 },
{ 0x2100013e, 0x1400ffff },
{ 0x2100013f, 0x24000001 },
{ 0x21000140, 0x1400ffff },
{ 0x21000141, 0x24000001 },
{ 0x21000142, 0x1400ffff },
{ 0x21000143, 0x24000001 },
{ 0x21000144, 0x1400ffff },
{ 0x21000145, 0x24000001 },
{ 0x21000146, 0x1400ffff },
{ 0x21000147, 0x24000001 },
{ 0x21000148, 0x1400ffff },
{ 0x21000149, 0x14000000 },
{ 0x2100014a, 0x24000001 },
{ 0x2100014b, 0x1400ffff },
{ 0x2100014c, 0x24000001 },
{ 0x2100014d, 0x1400ffff },
{ 0x2100014e, 0x24000001 },
{ 0x2100014f, 0x1400ffff },
{ 0x21000150, 0x24000001 },
{ 0x21000151, 0x1400ffff },
{ 0x21000152, 0x24000001 },
{ 0x21000153, 0x1400ffff },
{ 0x21000154, 0x24000001 },
{ 0x21000155, 0x1400ffff },
{ 0x21000156, 0x24000001 },
{ 0x21000157, 0x1400ffff },
{ 0x21000158, 0x24000001 },
{ 0x21000159, 0x1400ffff },
{ 0x2100015a, 0x24000001 },
{ 0x2100015b, 0x1400ffff },
{ 0x2100015c, 0x24000001 },
{ 0x2100015d, 0x1400ffff },
{ 0x2100015e, 0x24000001 },
{ 0x2100015f, 0x1400ffff },
{ 0x21000160, 0x24000001 },
{ 0x21000161, 0x1400ffff },
{ 0x21000162, 0x24000001 },
{ 0x21000163, 0x1400ffff },
{ 0x21000164, 0x24000001 },
{ 0x21000165, 0x1400ffff },
{ 0x21000166, 0x24000001 },
{ 0x21000167, 0x1400ffff },
{ 0x21000168, 0x24000001 },
{ 0x21000169, 0x1400ffff },
{ 0x2100016a, 0x24000001 },
{ 0x2100016b, 0x1400ffff },
{ 0x2100016c, 0x24000001 },
{ 0x2100016d, 0x1400ffff },
{ 0x2100016e, 0x24000001 },
{ 0x2100016f, 0x1400ffff },
{ 0x21000170, 0x24000001 },
{ 0x21000171, 0x1400ffff },
{ 0x21000172, 0x24000001 },
{ 0x21000173, 0x1400ffff },
{ 0x21000174, 0x24000001 },
{ 0x21000175, 0x1400ffff },
{ 0x21000176, 0x24000001 },
{ 0x21000177, 0x1400ffff },
{ 0x21000178, 0x2400ff87 },
{ 0x21000179, 0x24000001 },
{ 0x2100017a, 0x1400ffff },
{ 0x2100017b, 0x24000001 },
{ 0x2100017c, 0x1400ffff },
{ 0x2100017d, 0x24000001 },
{ 0x2100017e, 0x1400ffff },
{ 0x2100017f, 0x1400fed4 },
{ 0x21000180, 0x14000000 },
{ 0x21000181, 0x240000d2 },
{ 0x21000182, 0x24000001 },
{ 0x21000183, 0x1400ffff },
{ 0x21000184, 0x24000001 },
{ 0x21000185, 0x1400ffff },
{ 0x21000186, 0x240000ce },
{ 0x21000187, 0x24000001 },
{ 0x21000188, 0x1400ffff },
{ 0x21000189, 0x240000cd },
{ 0x2100018a, 0x240000cd },
{ 0x2100018b, 0x24000001 },
{ 0x2100018c, 0x1400ffff },
{ 0x2100018d, 0x14000000 },
{ 0x2100018e, 0x2400004f },
{ 0x2100018f, 0x240000ca },
{ 0x21000190, 0x240000cb },
{ 0x21000191, 0x24000001 },
{ 0x21000192, 0x1400ffff },
{ 0x21000193, 0x240000cd },
{ 0x21000194, 0x240000cf },
{ 0x21000195, 0x14000061 },
{ 0x21000196, 0x240000d3 },
{ 0x21000197, 0x240000d1 },
{ 0x21000198, 0x24000001 },
{ 0x21000199, 0x1400ffff },
{ 0x2100019a, 0x140000a3 },
{ 0x2100019b, 0x14000000 },
{ 0x2100019c, 0x240000d3 },
{ 0x2100019d, 0x240000d5 },
{ 0x2100019e, 0x14000082 },
{ 0x2100019f, 0x240000d6 },
{ 0x210001a0, 0x24000001 },
{ 0x210001a1, 0x1400ffff },
{ 0x210001a2, 0x24000001 },
{ 0x210001a3, 0x1400ffff },
{ 0x210001a4, 0x24000001 },
{ 0x210001a5, 0x1400ffff },
{ 0x210001a6, 0x240000da },
{ 0x210001a7, 0x24000001 },
{ 0x210001a8, 0x1400ffff },
{ 0x210001a9, 0x240000da },
{ 0x218001aa, 0x14000001 },
{ 0x210001ac, 0x24000001 },
{ 0x210001ad, 0x1400ffff },
{ 0x210001ae, 0x240000da },
{ 0x210001af, 0x24000001 },
{ 0x210001b0, 0x1400ffff },
{ 0x210001b1, 0x240000d9 },
{ 0x210001b2, 0x240000d9 },
{ 0x210001b3, 0x24000001 },
{ 0x210001b4, 0x1400ffff },
{ 0x210001b5, 0x24000001 },
{ 0x210001b6, 0x1400ffff },
{ 0x210001b7, 0x240000db },
{ 0x210001b8, 0x24000001 },
{ 0x210001b9, 0x1400ffff },
{ 0x210001ba, 0x14000000 },
{ 0x210001bb, 0x1c000000 },
{ 0x210001bc, 0x24000001 },
{ 0x210001bd, 0x1400ffff },
{ 0x210001be, 0x14000000 },
{ 0x210001bf, 0x14000038 },
{ 0x218001c0, 0x1c000003 },
{ 0x210001c4, 0x24000002 },
{ 0x210001c5, 0x2000ffff },
{ 0x210001c6, 0x1400fffe },
{ 0x210001c7, 0x24000002 },
{ 0x210001c8, 0x2000ffff },
{ 0x210001c9, 0x1400fffe },
{ 0x210001ca, 0x24000002 },
{ 0x210001cb, 0x2000ffff },
{ 0x210001cc, 0x1400fffe },
{ 0x210001cd, 0x24000001 },
{ 0x210001ce, 0x1400ffff },
{ 0x210001cf, 0x24000001 },
{ 0x210001d0, 0x1400ffff },
{ 0x210001d1, 0x24000001 },
{ 0x210001d2, 0x1400ffff },
{ 0x210001d3, 0x24000001 },
{ 0x210001d4, 0x1400ffff },
{ 0x210001d5, 0x24000001 },
{ 0x210001d6, 0x1400ffff },
{ 0x210001d7, 0x24000001 },
{ 0x210001d8, 0x1400ffff },
{ 0x210001d9, 0x24000001 },
{ 0x210001da, 0x1400ffff },
{ 0x210001db, 0x24000001 },
{ 0x210001dc, 0x1400ffff },
{ 0x210001dd, 0x1400ffb1 },
{ 0x210001de, 0x24000001 },
{ 0x210001df, 0x1400ffff },
{ 0x210001e0, 0x24000001 },
{ 0x210001e1, 0x1400ffff },
{ 0x210001e2, 0x24000001 },
{ 0x210001e3, 0x1400ffff },
{ 0x210001e4, 0x24000001 },
{ 0x210001e5, 0x1400ffff },
{ 0x210001e6, 0x24000001 },
{ 0x210001e7, 0x1400ffff },
{ 0x210001e8, 0x24000001 },
{ 0x210001e9, 0x1400ffff },
{ 0x210001ea, 0x24000001 },
{ 0x210001eb, 0x1400ffff },
{ 0x210001ec, 0x24000001 },
{ 0x210001ed, 0x1400ffff },
{ 0x210001ee, 0x24000001 },
{ 0x210001ef, 0x1400ffff },
{ 0x210001f0, 0x14000000 },
{ 0x210001f1, 0x24000002 },
{ 0x210001f2, 0x2000ffff },
{ 0x210001f3, 0x1400fffe },
{ 0x210001f4, 0x24000001 },
{ 0x210001f5, 0x1400ffff },
{ 0x210001f6, 0x2400ff9f },
{ 0x210001f7, 0x2400ffc8 },
{ 0x210001f8, 0x24000001 },
{ 0x210001f9, 0x1400ffff },
{ 0x210001fa, 0x24000001 },
{ 0x210001fb, 0x1400ffff },
{ 0x210001fc, 0x24000001 },
{ 0x210001fd, 0x1400ffff },
{ 0x210001fe, 0x24000001 },
{ 0x210001ff, 0x1400ffff },
{ 0x21000200, 0x24000001 },
{ 0x21000201, 0x1400ffff },
{ 0x21000202, 0x24000001 },
{ 0x21000203, 0x1400ffff },
{ 0x21000204, 0x24000001 },
{ 0x21000205, 0x1400ffff },
{ 0x21000206, 0x24000001 },
{ 0x21000207, 0x1400ffff },
{ 0x21000208, 0x24000001 },
{ 0x21000209, 0x1400ffff },
{ 0x2100020a, 0x24000001 },
{ 0x2100020b, 0x1400ffff },
{ 0x2100020c, 0x24000001 },
{ 0x2100020d, 0x1400ffff },
{ 0x2100020e, 0x24000001 },
{ 0x2100020f, 0x1400ffff },
{ 0x21000210, 0x24000001 },
{ 0x21000211, 0x1400ffff },
{ 0x21000212, 0x24000001 },
{ 0x21000213, 0x1400ffff },
{ 0x21000214, 0x24000001 },
{ 0x21000215, 0x1400ffff },
{ 0x21000216, 0x24000001 },
{ 0x21000217, 0x1400ffff },
{ 0x21000218, 0x24000001 },
{ 0x21000219, 0x1400ffff },
{ 0x2100021a, 0x24000001 },
{ 0x2100021b, 0x1400ffff },
{ 0x2100021c, 0x24000001 },
{ 0x2100021d, 0x1400ffff },
{ 0x2100021e, 0x24000001 },
{ 0x2100021f, 0x1400ffff },
{ 0x21000220, 0x2400ff7e },
{ 0x21000221, 0x14000000 },
{ 0x21000222, 0x24000001 },
{ 0x21000223, 0x1400ffff },
{ 0x21000224, 0x24000001 },
{ 0x21000225, 0x1400ffff },
{ 0x21000226, 0x24000001 },
{ 0x21000227, 0x1400ffff },
{ 0x21000228, 0x24000001 },
{ 0x21000229, 0x1400ffff },
{ 0x2100022a, 0x24000001 },
{ 0x2100022b, 0x1400ffff },
{ 0x2100022c, 0x24000001 },
{ 0x2100022d, 0x1400ffff },
{ 0x2100022e, 0x24000001 },
{ 0x2100022f, 0x1400ffff },
{ 0x21000230, 0x24000001 },
{ 0x21000231, 0x1400ffff },
{ 0x21000232, 0x24000001 },
{ 0x21000233, 0x1400ffff },
{ 0x21800234, 0x14000005 },
{ 0x2100023a, 0x24000000 },
{ 0x2100023b, 0x24000001 },
{ 0x2100023c, 0x1400ffff },
{ 0x2100023d, 0x2400ff5d },
{ 0x2100023e, 0x24000000 },
{ 0x2180023f, 0x14000001 },
{ 0x21000241, 0x24000053 },
{ 0x21800250, 0x14000002 },
{ 0x21000253, 0x1400ff2e },
{ 0x21000254, 0x1400ff32 },
{ 0x21000255, 0x14000000 },
{ 0x21000256, 0x1400ff33 },
{ 0x21000257, 0x1400ff33 },
{ 0x21000258, 0x14000000 },
{ 0x21000259, 0x1400ff36 },
{ 0x2100025a, 0x14000000 },
{ 0x2100025b, 0x1400ff35 },
{ 0x2180025c, 0x14000003 },
{ 0x21000260, 0x1400ff33 },
{ 0x21800261, 0x14000001 },
{ 0x21000263, 0x1400ff31 },
{ 0x21800264, 0x14000003 },
{ 0x21000268, 0x1400ff2f },
{ 0x21000269, 0x1400ff2d },
{ 0x2180026a, 0x14000004 },
{ 0x2100026f, 0x1400ff2d },
{ 0x21800270, 0x14000001 },
{ 0x21000272, 0x1400ff2b },
{ 0x21800273, 0x14000001 },
{ 0x21000275, 0x1400ff2a },
{ 0x21800276, 0x14000009 },
{ 0x21000280, 0x1400ff26 },
{ 0x21800281, 0x14000001 },
{ 0x21000283, 0x1400ff26 },
{ 0x21800284, 0x14000003 },
{ 0x21000288, 0x1400ff26 },
{ 0x21000289, 0x14000000 },
{ 0x2100028a, 0x1400ff27 },
{ 0x2100028b, 0x1400ff27 },
{ 0x2180028c, 0x14000005 },
{ 0x21000292, 0x1400ff25 },
{ 0x21000293, 0x14000000 },
{ 0x21000294, 0x1400ffad },
{ 0x21800295, 0x1400001a },
{ 0x218002b0, 0x18000011 },
{ 0x098002c2, 0x60000003 },
{ 0x098002c6, 0x1800000b },
{ 0x098002d2, 0x6000000d },
{ 0x218002e0, 0x18000004 },
{ 0x098002e5, 0x60000008 },
{ 0x090002ee, 0x18000000 },
{ 0x098002ef, 0x60000010 },
{ 0x1b800300, 0x30000044 },
{ 0x1b000345, 0x30000054 },
{ 0x1b800346, 0x30000029 },
{ 0x13800374, 0x60000001 },
{ 0x1300037a, 0x18000000 },
{ 0x0900037e, 0x54000000 },
{ 0x13800384, 0x60000001 },
{ 0x13000386, 0x24000026 },
{ 0x09000387, 0x54000000 },
{ 0x13000388, 0x24000025 },
{ 0x13000389, 0x24000025 },
{ 0x1300038a, 0x24000025 },
{ 0x1300038c, 0x24000040 },
{ 0x1300038e, 0x2400003f },
{ 0x1300038f, 0x2400003f },
{ 0x13000390, 0x14000000 },
{ 0x13000391, 0x24000020 },
{ 0x13000392, 0x24000020 },
{ 0x13000393, 0x24000020 },
{ 0x13000394, 0x24000020 },
{ 0x13000395, 0x24000020 },
{ 0x13000396, 0x24000020 },
{ 0x13000397, 0x24000020 },
{ 0x13000398, 0x24000020 },
{ 0x13000399, 0x24000020 },
{ 0x1300039a, 0x24000020 },
{ 0x1300039b, 0x24000020 },
{ 0x1300039c, 0x24000020 },
{ 0x1300039d, 0x24000020 },
{ 0x1300039e, 0x24000020 },
{ 0x1300039f, 0x24000020 },
{ 0x130003a0, 0x24000020 },
{ 0x130003a1, 0x24000020 },
{ 0x130003a3, 0x24000020 },
{ 0x130003a4, 0x24000020 },
{ 0x130003a5, 0x24000020 },
{ 0x130003a6, 0x24000020 },
{ 0x130003a7, 0x24000020 },
{ 0x130003a8, 0x24000020 },
{ 0x130003a9, 0x24000020 },
{ 0x130003aa, 0x24000020 },
{ 0x130003ab, 0x24000020 },
{ 0x130003ac, 0x1400ffda },
{ 0x130003ad, 0x1400ffdb },
{ 0x130003ae, 0x1400ffdb },
{ 0x130003af, 0x1400ffdb },
{ 0x130003b0, 0x14000000 },
{ 0x130003b1, 0x1400ffe0 },
{ 0x130003b2, 0x1400ffe0 },
{ 0x130003b3, 0x1400ffe0 },
{ 0x130003b4, 0x1400ffe0 },
{ 0x130003b5, 0x1400ffe0 },
{ 0x130003b6, 0x1400ffe0 },
{ 0x130003b7, 0x1400ffe0 },
{ 0x130003b8, 0x1400ffe0 },
{ 0x130003b9, 0x1400ffe0 },
{ 0x130003ba, 0x1400ffe0 },
{ 0x130003bb, 0x1400ffe0 },
{ 0x130003bc, 0x1400ffe0 },
{ 0x130003bd, 0x1400ffe0 },
{ 0x130003be, 0x1400ffe0 },
{ 0x130003bf, 0x1400ffe0 },
{ 0x130003c0, 0x1400ffe0 },
{ 0x130003c1, 0x1400ffe0 },
{ 0x130003c2, 0x1400ffe1 },
{ 0x130003c3, 0x1400ffe0 },
{ 0x130003c4, 0x1400ffe0 },
{ 0x130003c5, 0x1400ffe0 },
{ 0x130003c6, 0x1400ffe0 },
{ 0x130003c7, 0x1400ffe0 },
{ 0x130003c8, 0x1400ffe0 },
{ 0x130003c9, 0x1400ffe0 },
{ 0x130003ca, 0x1400ffe0 },
{ 0x130003cb, 0x1400ffe0 },
{ 0x130003cc, 0x1400ffc0 },
{ 0x130003cd, 0x1400ffc1 },
{ 0x130003ce, 0x1400ffc1 },
{ 0x130003d0, 0x1400ffc2 },
{ 0x130003d1, 0x1400ffc7 },
{ 0x138003d2, 0x24000002 },
{ 0x130003d5, 0x1400ffd1 },
{ 0x130003d6, 0x1400ffca },
{ 0x130003d7, 0x14000000 },
{ 0x130003d8, 0x24000001 },
{ 0x130003d9, 0x1400ffff },
{ 0x130003da, 0x24000001 },
{ 0x130003db, 0x1400ffff },
{ 0x130003dc, 0x24000001 },
{ 0x130003dd, 0x1400ffff },
{ 0x130003de, 0x24000001 },
{ 0x130003df, 0x1400ffff },
{ 0x130003e0, 0x24000001 },
{ 0x130003e1, 0x1400ffff },
{ 0x0a0003e2, 0x24000001 },
{ 0x0a0003e3, 0x1400ffff },
{ 0x0a0003e4, 0x24000001 },
{ 0x0a0003e5, 0x1400ffff },
{ 0x0a0003e6, 0x24000001 },
{ 0x0a0003e7, 0x1400ffff },
{ 0x0a0003e8, 0x24000001 },
{ 0x0a0003e9, 0x1400ffff },
{ 0x0a0003ea, 0x24000001 },
{ 0x0a0003eb, 0x1400ffff },
{ 0x0a0003ec, 0x24000001 },
{ 0x0a0003ed, 0x1400ffff },
{ 0x0a0003ee, 0x24000001 },
{ 0x0a0003ef, 0x1400ffff },
{ 0x130003f0, 0x1400ffaa },
{ 0x130003f1, 0x1400ffb0 },
{ 0x130003f2, 0x14000007 },
{ 0x130003f3, 0x14000000 },
{ 0x130003f4, 0x2400ffc4 },
{ 0x130003f5, 0x1400ffa0 },
{ 0x130003f6, 0x64000000 },
{ 0x130003f7, 0x24000001 },
{ 0x130003f8, 0x1400ffff },
{ 0x130003f9, 0x2400fff9 },
{ 0x130003fa, 0x24000001 },
{ 0x130003fb, 0x1400ffff },
{ 0x130003fc, 0x14000000 },
{ 0x138003fd, 0x24000002 },
{ 0x0c000400, 0x24000050 },
{ 0x0c000401, 0x24000050 },
{ 0x0c000402, 0x24000050 },
{ 0x0c000403, 0x24000050 },
{ 0x0c000404, 0x24000050 },
{ 0x0c000405, 0x24000050 },
{ 0x0c000406, 0x24000050 },
{ 0x0c000407, 0x24000050 },
{ 0x0c000408, 0x24000050 },
{ 0x0c000409, 0x24000050 },
{ 0x0c00040a, 0x24000050 },
{ 0x0c00040b, 0x24000050 },
{ 0x0c00040c, 0x24000050 },
{ 0x0c00040d, 0x24000050 },
{ 0x0c00040e, 0x24000050 },
{ 0x0c00040f, 0x24000050 },
{ 0x0c000410, 0x24000020 },
{ 0x0c000411, 0x24000020 },
{ 0x0c000412, 0x24000020 },
{ 0x0c000413, 0x24000020 },
{ 0x0c000414, 0x24000020 },
{ 0x0c000415, 0x24000020 },
{ 0x0c000416, 0x24000020 },
{ 0x0c000417, 0x24000020 },
{ 0x0c000418, 0x24000020 },
{ 0x0c000419, 0x24000020 },
{ 0x0c00041a, 0x24000020 },
{ 0x0c00041b, 0x24000020 },
{ 0x0c00041c, 0x24000020 },
{ 0x0c00041d, 0x24000020 },
{ 0x0c00041e, 0x24000020 },
{ 0x0c00041f, 0x24000020 },
{ 0x0c000420, 0x24000020 },
{ 0x0c000421, 0x24000020 },
{ 0x0c000422, 0x24000020 },
{ 0x0c000423, 0x24000020 },
{ 0x0c000424, 0x24000020 },
{ 0x0c000425, 0x24000020 },
{ 0x0c000426, 0x24000020 },
{ 0x0c000427, 0x24000020 },
{ 0x0c000428, 0x24000020 },
{ 0x0c000429, 0x24000020 },
{ 0x0c00042a, 0x24000020 },
{ 0x0c00042b, 0x24000020 },
{ 0x0c00042c, 0x24000020 },
{ 0x0c00042d, 0x24000020 },
{ 0x0c00042e, 0x24000020 },
{ 0x0c00042f, 0x24000020 },
{ 0x0c000430, 0x1400ffe0 },
{ 0x0c000431, 0x1400ffe0 },
{ 0x0c000432, 0x1400ffe0 },
{ 0x0c000433, 0x1400ffe0 },
{ 0x0c000434, 0x1400ffe0 },
{ 0x0c000435, 0x1400ffe0 },
{ 0x0c000436, 0x1400ffe0 },
{ 0x0c000437, 0x1400ffe0 },
{ 0x0c000438, 0x1400ffe0 },
{ 0x0c000439, 0x1400ffe0 },
{ 0x0c00043a, 0x1400ffe0 },
{ 0x0c00043b, 0x1400ffe0 },
{ 0x0c00043c, 0x1400ffe0 },
{ 0x0c00043d, 0x1400ffe0 },
{ 0x0c00043e, 0x1400ffe0 },
{ 0x0c00043f, 0x1400ffe0 },
{ 0x0c000440, 0x1400ffe0 },
{ 0x0c000441, 0x1400ffe0 },
{ 0x0c000442, 0x1400ffe0 },
{ 0x0c000443, 0x1400ffe0 },
{ 0x0c000444, 0x1400ffe0 },
{ 0x0c000445, 0x1400ffe0 },
{ 0x0c000446, 0x1400ffe0 },
{ 0x0c000447, 0x1400ffe0 },
{ 0x0c000448, 0x1400ffe0 },
{ 0x0c000449, 0x1400ffe0 },
{ 0x0c00044a, 0x1400ffe0 },
{ 0x0c00044b, 0x1400ffe0 },
{ 0x0c00044c, 0x1400ffe0 },
{ 0x0c00044d, 0x1400ffe0 },
{ 0x0c00044e, 0x1400ffe0 },
{ 0x0c00044f, 0x1400ffe0 },
{ 0x0c000450, 0x1400ffb0 },
{ 0x0c000451, 0x1400ffb0 },
{ 0x0c000452, 0x1400ffb0 },
{ 0x0c000453, 0x1400ffb0 },
{ 0x0c000454, 0x1400ffb0 },
{ 0x0c000455, 0x1400ffb0 },
{ 0x0c000456, 0x1400ffb0 },
{ 0x0c000457, 0x1400ffb0 },
{ 0x0c000458, 0x1400ffb0 },
{ 0x0c000459, 0x1400ffb0 },
{ 0x0c00045a, 0x1400ffb0 },
{ 0x0c00045b, 0x1400ffb0 },
{ 0x0c00045c, 0x1400ffb0 },
{ 0x0c00045d, 0x1400ffb0 },
{ 0x0c00045e, 0x1400ffb0 },
{ 0x0c00045f, 0x1400ffb0 },
{ 0x0c000460, 0x24000001 },
{ 0x0c000461, 0x1400ffff },
{ 0x0c000462, 0x24000001 },
{ 0x0c000463, 0x1400ffff },
{ 0x0c000464, 0x24000001 },
{ 0x0c000465, 0x1400ffff },
{ 0x0c000466, 0x24000001 },
{ 0x0c000467, 0x1400ffff },
{ 0x0c000468, 0x24000001 },
{ 0x0c000469, 0x1400ffff },
{ 0x0c00046a, 0x24000001 },
{ 0x0c00046b, 0x1400ffff },
{ 0x0c00046c, 0x24000001 },
{ 0x0c00046d, 0x1400ffff },
{ 0x0c00046e, 0x24000001 },
{ 0x0c00046f, 0x1400ffff },
{ 0x0c000470, 0x24000001 },
{ 0x0c000471, 0x1400ffff },
{ 0x0c000472, 0x24000001 },
{ 0x0c000473, 0x1400ffff },
{ 0x0c000474, 0x24000001 },
{ 0x0c000475, 0x1400ffff },
{ 0x0c000476, 0x24000001 },
{ 0x0c000477, 0x1400ffff },
{ 0x0c000478, 0x24000001 },
{ 0x0c000479, 0x1400ffff },
{ 0x0c00047a, 0x24000001 },
{ 0x0c00047b, 0x1400ffff },
{ 0x0c00047c, 0x24000001 },
{ 0x0c00047d, 0x1400ffff },
{ 0x0c00047e, 0x24000001 },
{ 0x0c00047f, 0x1400ffff },
{ 0x0c000480, 0x24000001 },
{ 0x0c000481, 0x1400ffff },
{ 0x0c000482, 0x68000000 },
{ 0x0c800483, 0x30000003 },
{ 0x0c800488, 0x2c000001 },
{ 0x0c00048a, 0x24000001 },
{ 0x0c00048b, 0x1400ffff },
{ 0x0c00048c, 0x24000001 },
{ 0x0c00048d, 0x1400ffff },
{ 0x0c00048e, 0x24000001 },
{ 0x0c00048f, 0x1400ffff },
{ 0x0c000490, 0x24000001 },
{ 0x0c000491, 0x1400ffff },
{ 0x0c000492, 0x24000001 },
{ 0x0c000493, 0x1400ffff },
{ 0x0c000494, 0x24000001 },
{ 0x0c000495, 0x1400ffff },
{ 0x0c000496, 0x24000001 },
{ 0x0c000497, 0x1400ffff },
{ 0x0c000498, 0x24000001 },
{ 0x0c000499, 0x1400ffff },
{ 0x0c00049a, 0x24000001 },
{ 0x0c00049b, 0x1400ffff },
{ 0x0c00049c, 0x24000001 },
{ 0x0c00049d, 0x1400ffff },
{ 0x0c00049e, 0x24000001 },
{ 0x0c00049f, 0x1400ffff },
{ 0x0c0004a0, 0x24000001 },
{ 0x0c0004a1, 0x1400ffff },
{ 0x0c0004a2, 0x24000001 },
{ 0x0c0004a3, 0x1400ffff },
{ 0x0c0004a4, 0x24000001 },
{ 0x0c0004a5, 0x1400ffff },
{ 0x0c0004a6, 0x24000001 },
{ 0x0c0004a7, 0x1400ffff },
{ 0x0c0004a8, 0x24000001 },
{ 0x0c0004a9, 0x1400ffff },
{ 0x0c0004aa, 0x24000001 },
{ 0x0c0004ab, 0x1400ffff },
{ 0x0c0004ac, 0x24000001 },
{ 0x0c0004ad, 0x1400ffff },
{ 0x0c0004ae, 0x24000001 },
{ 0x0c0004af, 0x1400ffff },
{ 0x0c0004b0, 0x24000001 },
{ 0x0c0004b1, 0x1400ffff },
{ 0x0c0004b2, 0x24000001 },
{ 0x0c0004b3, 0x1400ffff },
{ 0x0c0004b4, 0x24000001 },
{ 0x0c0004b5, 0x1400ffff },
{ 0x0c0004b6, 0x24000001 },
{ 0x0c0004b7, 0x1400ffff },
{ 0x0c0004b8, 0x24000001 },
{ 0x0c0004b9, 0x1400ffff },
{ 0x0c0004ba, 0x24000001 },
{ 0x0c0004bb, 0x1400ffff },
{ 0x0c0004bc, 0x24000001 },
{ 0x0c0004bd, 0x1400ffff },
{ 0x0c0004be, 0x24000001 },
{ 0x0c0004bf, 0x1400ffff },
{ 0x0c0004c0, 0x24000000 },
{ 0x0c0004c1, 0x24000001 },
{ 0x0c0004c2, 0x1400ffff },
{ 0x0c0004c3, 0x24000001 },
{ 0x0c0004c4, 0x1400ffff },
{ 0x0c0004c5, 0x24000001 },
{ 0x0c0004c6, 0x1400ffff },
{ 0x0c0004c7, 0x24000001 },
{ 0x0c0004c8, 0x1400ffff },
{ 0x0c0004c9, 0x24000001 },
{ 0x0c0004ca, 0x1400ffff },
{ 0x0c0004cb, 0x24000001 },
{ 0x0c0004cc, 0x1400ffff },
{ 0x0c0004cd, 0x24000001 },
{ 0x0c0004ce, 0x1400ffff },
{ 0x0c0004d0, 0x24000001 },
{ 0x0c0004d1, 0x1400ffff },
{ 0x0c0004d2, 0x24000001 },
{ 0x0c0004d3, 0x1400ffff },
{ 0x0c0004d4, 0x24000001 },
{ 0x0c0004d5, 0x1400ffff },
{ 0x0c0004d6, 0x24000001 },
{ 0x0c0004d7, 0x1400ffff },
{ 0x0c0004d8, 0x24000001 },
{ 0x0c0004d9, 0x1400ffff },
{ 0x0c0004da, 0x24000001 },
{ 0x0c0004db, 0x1400ffff },
{ 0x0c0004dc, 0x24000001 },
{ 0x0c0004dd, 0x1400ffff },
{ 0x0c0004de, 0x24000001 },
{ 0x0c0004df, 0x1400ffff },
{ 0x0c0004e0, 0x24000001 },
{ 0x0c0004e1, 0x1400ffff },
{ 0x0c0004e2, 0x24000001 },
{ 0x0c0004e3, 0x1400ffff },
{ 0x0c0004e4, 0x24000001 },
{ 0x0c0004e5, 0x1400ffff },
{ 0x0c0004e6, 0x24000001 },
{ 0x0c0004e7, 0x1400ffff },
{ 0x0c0004e8, 0x24000001 },
{ 0x0c0004e9, 0x1400ffff },
{ 0x0c0004ea, 0x24000001 },
{ 0x0c0004eb, 0x1400ffff },
{ 0x0c0004ec, 0x24000001 },
{ 0x0c0004ed, 0x1400ffff },
{ 0x0c0004ee, 0x24000001 },
{ 0x0c0004ef, 0x1400ffff },
{ 0x0c0004f0, 0x24000001 },
{ 0x0c0004f1, 0x1400ffff },
{ 0x0c0004f2, 0x24000001 },
{ 0x0c0004f3, 0x1400ffff },
{ 0x0c0004f4, 0x24000001 },
{ 0x0c0004f5, 0x1400ffff },
{ 0x0c0004f6, 0x24000001 },
{ 0x0c0004f7, 0x1400ffff },
{ 0x0c0004f8, 0x24000001 },
{ 0x0c0004f9, 0x1400ffff },
{ 0x0c000500, 0x24000001 },
{ 0x0c000501, 0x1400ffff },
{ 0x0c000502, 0x24000001 },
{ 0x0c000503, 0x1400ffff },
{ 0x0c000504, 0x24000001 },
{ 0x0c000505, 0x1400ffff },
{ 0x0c000506, 0x24000001 },
{ 0x0c000507, 0x1400ffff },
{ 0x0c000508, 0x24000001 },
{ 0x0c000509, 0x1400ffff },
{ 0x0c00050a, 0x24000001 },
{ 0x0c00050b, 0x1400ffff },
{ 0x0c00050c, 0x24000001 },
{ 0x0c00050d, 0x1400ffff },
{ 0x0c00050e, 0x24000001 },
{ 0x0c00050f, 0x1400ffff },
{ 0x01000531, 0x24000030 },
{ 0x01000532, 0x24000030 },
{ 0x01000533, 0x24000030 },
{ 0x01000534, 0x24000030 },
{ 0x01000535, 0x24000030 },
{ 0x01000536, 0x24000030 },
{ 0x01000537, 0x24000030 },
{ 0x01000538, 0x24000030 },
{ 0x01000539, 0x24000030 },
{ 0x0100053a, 0x24000030 },
{ 0x0100053b, 0x24000030 },
{ 0x0100053c, 0x24000030 },
{ 0x0100053d, 0x24000030 },
{ 0x0100053e, 0x24000030 },
{ 0x0100053f, 0x24000030 },
{ 0x01000540, 0x24000030 },
{ 0x01000541, 0x24000030 },
{ 0x01000542, 0x24000030 },
{ 0x01000543, 0x24000030 },
{ 0x01000544, 0x24000030 },
{ 0x01000545, 0x24000030 },
{ 0x01000546, 0x24000030 },
{ 0x01000547, 0x24000030 },
{ 0x01000548, 0x24000030 },
{ 0x01000549, 0x24000030 },
{ 0x0100054a, 0x24000030 },
{ 0x0100054b, 0x24000030 },
{ 0x0100054c, 0x24000030 },
{ 0x0100054d, 0x24000030 },
{ 0x0100054e, 0x24000030 },
{ 0x0100054f, 0x24000030 },
{ 0x01000550, 0x24000030 },
{ 0x01000551, 0x24000030 },
{ 0x01000552, 0x24000030 },
{ 0x01000553, 0x24000030 },
{ 0x01000554, 0x24000030 },
{ 0x01000555, 0x24000030 },
{ 0x01000556, 0x24000030 },
{ 0x01000559, 0x18000000 },
{ 0x0180055a, 0x54000005 },
{ 0x01000561, 0x1400ffd0 },
{ 0x01000562, 0x1400ffd0 },
{ 0x01000563, 0x1400ffd0 },
{ 0x01000564, 0x1400ffd0 },
{ 0x01000565, 0x1400ffd0 },
{ 0x01000566, 0x1400ffd0 },
{ 0x01000567, 0x1400ffd0 },
{ 0x01000568, 0x1400ffd0 },
{ 0x01000569, 0x1400ffd0 },
{ 0x0100056a, 0x1400ffd0 },
{ 0x0100056b, 0x1400ffd0 },
{ 0x0100056c, 0x1400ffd0 },
{ 0x0100056d, 0x1400ffd0 },
{ 0x0100056e, 0x1400ffd0 },
{ 0x0100056f, 0x1400ffd0 },
{ 0x01000570, 0x1400ffd0 },
{ 0x01000571, 0x1400ffd0 },
{ 0x01000572, 0x1400ffd0 },
{ 0x01000573, 0x1400ffd0 },
{ 0x01000574, 0x1400ffd0 },
{ 0x01000575, 0x1400ffd0 },
{ 0x01000576, 0x1400ffd0 },
{ 0x01000577, 0x1400ffd0 },
{ 0x01000578, 0x1400ffd0 },
{ 0x01000579, 0x1400ffd0 },
{ 0x0100057a, 0x1400ffd0 },
{ 0x0100057b, 0x1400ffd0 },
{ 0x0100057c, 0x1400ffd0 },
{ 0x0100057d, 0x1400ffd0 },
{ 0x0100057e, 0x1400ffd0 },
{ 0x0100057f, 0x1400ffd0 },
{ 0x01000580, 0x1400ffd0 },
{ 0x01000581, 0x1400ffd0 },
{ 0x01000582, 0x1400ffd0 },
{ 0x01000583, 0x1400ffd0 },
{ 0x01000584, 0x1400ffd0 },
{ 0x01000585, 0x1400ffd0 },
{ 0x01000586, 0x1400ffd0 },
{ 0x01000587, 0x14000000 },
{ 0x09000589, 0x54000000 },
{ 0x0100058a, 0x44000000 },
{ 0x19800591, 0x30000028 },
{ 0x198005bb, 0x30000002 },
{ 0x190005be, 0x54000000 },
{ 0x190005bf, 0x30000000 },
{ 0x190005c0, 0x54000000 },
{ 0x198005c1, 0x30000001 },
{ 0x190005c3, 0x54000000 },
{ 0x198005c4, 0x30000001 },
{ 0x190005c6, 0x54000000 },
{ 0x190005c7, 0x30000000 },
{ 0x198005d0, 0x1c00001a },
{ 0x198005f0, 0x1c000002 },
{ 0x198005f3, 0x54000001 },
{ 0x09800600, 0x04000003 },
{ 0x0000060b, 0x5c000000 },
{ 0x0980060c, 0x54000001 },
{ 0x0080060e, 0x68000001 },
{ 0x00800610, 0x30000005 },
{ 0x0900061b, 0x54000000 },
{ 0x0080061e, 0x54000001 },
{ 0x00800621, 0x1c000019 },
{ 0x09000640, 0x18000000 },
{ 0x00800641, 0x1c000009 },
{ 0x1b80064b, 0x30000013 },
{ 0x09800660, 0x34000009 },
{ 0x0080066a, 0x54000003 },
{ 0x0080066e, 0x1c000001 },
{ 0x1b000670, 0x30000000 },
{ 0x00800671, 0x1c000062 },
{ 0x000006d4, 0x54000000 },
{ 0x000006d5, 0x1c000000 },
{ 0x008006d6, 0x30000006 },
{ 0x090006dd, 0x04000000 },
{ 0x000006de, 0x2c000000 },
{ 0x008006df, 0x30000005 },
{ 0x008006e5, 0x18000001 },
{ 0x008006e7, 0x30000001 },
{ 0x000006e9, 0x68000000 },
{ 0x008006ea, 0x30000003 },
{ 0x008006ee, 0x1c000001 },
{ 0x008006f0, 0x34000009 },
{ 0x008006fa, 0x1c000002 },
{ 0x008006fd, 0x68000001 },
{ 0x000006ff, 0x1c000000 },
{ 0x31800700, 0x5400000d },
{ 0x3100070f, 0x04000000 },
{ 0x31000710, 0x1c000000 },
{ 0x31000711, 0x30000000 },
{ 0x31800712, 0x1c00001d },
{ 0x31800730, 0x3000001a },
{ 0x3180074d, 0x1c000020 },
{ 0x37800780, 0x1c000025 },
{ 0x378007a6, 0x3000000a },
{ 0x370007b1, 0x1c000000 },
{ 0x0e800901, 0x30000001 },
{ 0x0e000903, 0x28000000 },
{ 0x0e800904, 0x1c000035 },
{ 0x0e00093c, 0x30000000 },
{ 0x0e00093d, 0x1c000000 },
{ 0x0e80093e, 0x28000002 },
{ 0x0e800941, 0x30000007 },
{ 0x0e800949, 0x28000003 },
{ 0x0e00094d, 0x30000000 },
{ 0x0e000950, 0x1c000000 },
{ 0x0e800951, 0x30000003 },
{ 0x0e800958, 0x1c000009 },
{ 0x0e800962, 0x30000001 },
{ 0x09800964, 0x54000001 },
{ 0x0e800966, 0x34000009 },
{ 0x09000970, 0x54000000 },
{ 0x0e00097d, 0x1c000000 },
{ 0x02000981, 0x30000000 },
{ 0x02800982, 0x28000001 },
{ 0x02800985, 0x1c000007 },
{ 0x0280098f, 0x1c000001 },
{ 0x02800993, 0x1c000015 },
{ 0x028009aa, 0x1c000006 },
{ 0x020009b2, 0x1c000000 },
{ 0x028009b6, 0x1c000003 },
{ 0x020009bc, 0x30000000 },
{ 0x020009bd, 0x1c000000 },
{ 0x028009be, 0x28000002 },
{ 0x028009c1, 0x30000003 },
{ 0x028009c7, 0x28000001 },
{ 0x028009cb, 0x28000001 },
{ 0x020009cd, 0x30000000 },
{ 0x020009ce, 0x1c000000 },
{ 0x020009d7, 0x28000000 },
{ 0x028009dc, 0x1c000001 },
{ 0x028009df, 0x1c000002 },
{ 0x028009e2, 0x30000001 },
{ 0x028009e6, 0x34000009 },
{ 0x028009f0, 0x1c000001 },
{ 0x028009f2, 0x5c000001 },
{ 0x028009f4, 0x3c000005 },
{ 0x020009fa, 0x68000000 },
{ 0x15800a01, 0x30000001 },
{ 0x15000a03, 0x28000000 },
{ 0x15800a05, 0x1c000005 },
{ 0x15800a0f, 0x1c000001 },
{ 0x15800a13, 0x1c000015 },
{ 0x15800a2a, 0x1c000006 },
{ 0x15800a32, 0x1c000001 },
{ 0x15800a35, 0x1c000001 },
{ 0x15800a38, 0x1c000001 },
{ 0x15000a3c, 0x30000000 },
{ 0x15800a3e, 0x28000002 },
{ 0x15800a41, 0x30000001 },
{ 0x15800a47, 0x30000001 },
{ 0x15800a4b, 0x30000002 },
{ 0x15800a59, 0x1c000003 },
{ 0x15000a5e, 0x1c000000 },
{ 0x15800a66, 0x34000009 },
{ 0x15800a70, 0x30000001 },
{ 0x15800a72, 0x1c000002 },
{ 0x14800a81, 0x30000001 },
{ 0x14000a83, 0x28000000 },
{ 0x14800a85, 0x1c000008 },
{ 0x14800a8f, 0x1c000002 },
{ 0x14800a93, 0x1c000015 },
{ 0x14800aaa, 0x1c000006 },
{ 0x14800ab2, 0x1c000001 },
{ 0x14800ab5, 0x1c000004 },
{ 0x14000abc, 0x30000000 },
{ 0x14000abd, 0x1c000000 },
{ 0x14800abe, 0x28000002 },
{ 0x14800ac1, 0x30000004 },
{ 0x14800ac7, 0x30000001 },
{ 0x14000ac9, 0x28000000 },
{ 0x14800acb, 0x28000001 },
{ 0x14000acd, 0x30000000 },
{ 0x14000ad0, 0x1c000000 },
{ 0x14800ae0, 0x1c000001 },
{ 0x14800ae2, 0x30000001 },
{ 0x14800ae6, 0x34000009 },
{ 0x14000af1, 0x5c000000 },
{ 0x2b000b01, 0x30000000 },
{ 0x2b800b02, 0x28000001 },
{ 0x2b800b05, 0x1c000007 },
{ 0x2b800b0f, 0x1c000001 },
{ 0x2b800b13, 0x1c000015 },
{ 0x2b800b2a, 0x1c000006 },
{ 0x2b800b32, 0x1c000001 },
{ 0x2b800b35, 0x1c000004 },
{ 0x2b000b3c, 0x30000000 },
{ 0x2b000b3d, 0x1c000000 },
{ 0x2b000b3e, 0x28000000 },
{ 0x2b000b3f, 0x30000000 },
{ 0x2b000b40, 0x28000000 },
{ 0x2b800b41, 0x30000002 },
{ 0x2b800b47, 0x28000001 },
{ 0x2b800b4b, 0x28000001 },
{ 0x2b000b4d, 0x30000000 },
{ 0x2b000b56, 0x30000000 },
{ 0x2b000b57, 0x28000000 },
{ 0x2b800b5c, 0x1c000001 },
{ 0x2b800b5f, 0x1c000002 },
{ 0x2b800b66, 0x34000009 },
{ 0x2b000b70, 0x68000000 },
{ 0x2b000b71, 0x1c000000 },
{ 0x35000b82, 0x30000000 },
{ 0x35000b83, 0x1c000000 },
{ 0x35800b85, 0x1c000005 },
{ 0x35800b8e, 0x1c000002 },
{ 0x35800b92, 0x1c000003 },
{ 0x35800b99, 0x1c000001 },
{ 0x35000b9c, 0x1c000000 },
{ 0x35800b9e, 0x1c000001 },
{ 0x35800ba3, 0x1c000001 },
{ 0x35800ba8, 0x1c000002 },
{ 0x35800bae, 0x1c00000b },
{ 0x35800bbe, 0x28000001 },
{ 0x35000bc0, 0x30000000 },
{ 0x35800bc1, 0x28000001 },
{ 0x35800bc6, 0x28000002 },
{ 0x35800bca, 0x28000002 },
{ 0x35000bcd, 0x30000000 },
{ 0x35000bd7, 0x28000000 },
{ 0x35800be6, 0x34000009 },
{ 0x35800bf0, 0x3c000002 },
{ 0x35800bf3, 0x68000005 },
{ 0x35000bf9, 0x5c000000 },
{ 0x35000bfa, 0x68000000 },
{ 0x36800c01, 0x28000002 },
{ 0x36800c05, 0x1c000007 },
{ 0x36800c0e, 0x1c000002 },
{ 0x36800c12, 0x1c000016 },
{ 0x36800c2a, 0x1c000009 },
{ 0x36800c35, 0x1c000004 },
{ 0x36800c3e, 0x30000002 },
{ 0x36800c41, 0x28000003 },
{ 0x36800c46, 0x30000002 },
{ 0x36800c4a, 0x30000003 },
{ 0x36800c55, 0x30000001 },
{ 0x36800c60, 0x1c000001 },
{ 0x36800c66, 0x34000009 },
{ 0x1c800c82, 0x28000001 },
{ 0x1c800c85, 0x1c000007 },
{ 0x1c800c8e, 0x1c000002 },
{ 0x1c800c92, 0x1c000016 },
{ 0x1c800caa, 0x1c000009 },
{ 0x1c800cb5, 0x1c000004 },
{ 0x1c000cbc, 0x30000000 },
{ 0x1c000cbd, 0x1c000000 },
{ 0x1c000cbe, 0x28000000 },
{ 0x1c000cbf, 0x30000000 },
{ 0x1c800cc0, 0x28000004 },
{ 0x1c000cc6, 0x30000000 },
{ 0x1c800cc7, 0x28000001 },
{ 0x1c800cca, 0x28000001 },
{ 0x1c800ccc, 0x30000001 },
{ 0x1c800cd5, 0x28000001 },
{ 0x1c000cde, 0x1c000000 },
{ 0x1c800ce0, 0x1c000001 },
{ 0x1c800ce6, 0x34000009 },
{ 0x24800d02, 0x28000001 },
{ 0x24800d05, 0x1c000007 },
{ 0x24800d0e, 0x1c000002 },
{ 0x24800d12, 0x1c000016 },
{ 0x24800d2a, 0x1c00000f },
{ 0x24800d3e, 0x28000002 },
{ 0x24800d41, 0x30000002 },
{ 0x24800d46, 0x28000002 },
{ 0x24800d4a, 0x28000002 },
{ 0x24000d4d, 0x30000000 },
{ 0x24000d57, 0x28000000 },
{ 0x24800d60, 0x1c000001 },
{ 0x24800d66, 0x34000009 },
{ 0x2f800d82, 0x28000001 },
{ 0x2f800d85, 0x1c000011 },
{ 0x2f800d9a, 0x1c000017 },
{ 0x2f800db3, 0x1c000008 },
{ 0x2f000dbd, 0x1c000000 },
{ 0x2f800dc0, 0x1c000006 },
{ 0x2f000dca, 0x30000000 },
{ 0x2f800dcf, 0x28000002 },
{ 0x2f800dd2, 0x30000002 },
{ 0x2f000dd6, 0x30000000 },
{ 0x2f800dd8, 0x28000007 },
{ 0x2f800df2, 0x28000001 },
{ 0x2f000df4, 0x54000000 },
{ 0x38800e01, 0x1c00002f },
{ 0x38000e31, 0x30000000 },
{ 0x38800e32, 0x1c000001 },
{ 0x38800e34, 0x30000006 },
{ 0x09000e3f, 0x5c000000 },
{ 0x38800e40, 0x1c000005 },
{ 0x38000e46, 0x18000000 },
{ 0x38800e47, 0x30000007 },
{ 0x38000e4f, 0x54000000 },
{ 0x38800e50, 0x34000009 },
{ 0x38800e5a, 0x54000001 },
{ 0x20800e81, 0x1c000001 },
{ 0x20000e84, 0x1c000000 },
{ 0x20800e87, 0x1c000001 },
{ 0x20000e8a, 0x1c000000 },
{ 0x20000e8d, 0x1c000000 },
{ 0x20800e94, 0x1c000003 },
{ 0x20800e99, 0x1c000006 },
{ 0x20800ea1, 0x1c000002 },
{ 0x20000ea5, 0x1c000000 },
{ 0x20000ea7, 0x1c000000 },
{ 0x20800eaa, 0x1c000001 },
{ 0x20800ead, 0x1c000003 },
{ 0x20000eb1, 0x30000000 },
{ 0x20800eb2, 0x1c000001 },
{ 0x20800eb4, 0x30000005 },
{ 0x20800ebb, 0x30000001 },
{ 0x20000ebd, 0x1c000000 },
{ 0x20800ec0, 0x1c000004 },
{ 0x20000ec6, 0x18000000 },
{ 0x20800ec8, 0x30000005 },
{ 0x20800ed0, 0x34000009 },
{ 0x20800edc, 0x1c000001 },
{ 0x39000f00, 0x1c000000 },
{ 0x39800f01, 0x68000002 },
{ 0x39800f04, 0x5400000e },
{ 0x39800f13, 0x68000004 },
{ 0x39800f18, 0x30000001 },
{ 0x39800f1a, 0x68000005 },
{ 0x39800f20, 0x34000009 },
{ 0x39800f2a, 0x3c000009 },
{ 0x39000f34, 0x68000000 },
{ 0x39000f35, 0x30000000 },
{ 0x39000f36, 0x68000000 },
{ 0x39000f37, 0x30000000 },
{ 0x39000f38, 0x68000000 },
{ 0x39000f39, 0x30000000 },
{ 0x39000f3a, 0x58000000 },
{ 0x39000f3b, 0x48000000 },
{ 0x39000f3c, 0x58000000 },
{ 0x39000f3d, 0x48000000 },
{ 0x39800f3e, 0x28000001 },
{ 0x39800f40, 0x1c000007 },
{ 0x39800f49, 0x1c000021 },
{ 0x39800f71, 0x3000000d },
{ 0x39000f7f, 0x28000000 },
{ 0x39800f80, 0x30000004 },
{ 0x39000f85, 0x54000000 },
{ 0x39800f86, 0x30000001 },
{ 0x39800f88, 0x1c000003 },
{ 0x39800f90, 0x30000007 },
{ 0x39800f99, 0x30000023 },
{ 0x39800fbe, 0x68000007 },
{ 0x39000fc6, 0x30000000 },
{ 0x39800fc7, 0x68000005 },
{ 0x39000fcf, 0x68000000 },
{ 0x39800fd0, 0x54000001 },
{ 0x26801000, 0x1c000021 },
{ 0x26801023, 0x1c000004 },
{ 0x26801029, 0x1c000001 },
{ 0x2600102c, 0x28000000 },
{ 0x2680102d, 0x30000003 },
{ 0x26001031, 0x28000000 },
{ 0x26001032, 0x30000000 },
{ 0x26801036, 0x30000001 },
{ 0x26001038, 0x28000000 },
{ 0x26001039, 0x30000000 },
{ 0x26801040, 0x34000009 },
{ 0x2680104a, 0x54000005 },
{ 0x26801050, 0x1c000005 },
{ 0x26801056, 0x28000001 },
{ 0x26801058, 0x30000001 },
{ 0x100010a0, 0x24001c60 },
{ 0x100010a1, 0x24001c60 },
{ 0x100010a2, 0x24001c60 },
{ 0x100010a3, 0x24001c60 },
{ 0x100010a4, 0x24001c60 },
{ 0x100010a5, 0x24001c60 },
{ 0x100010a6, 0x24001c60 },
{ 0x100010a7, 0x24001c60 },
{ 0x100010a8, 0x24001c60 },
{ 0x100010a9, 0x24001c60 },
{ 0x100010aa, 0x24001c60 },
{ 0x100010ab, 0x24001c60 },
{ 0x100010ac, 0x24001c60 },
{ 0x100010ad, 0x24001c60 },
{ 0x100010ae, 0x24001c60 },
{ 0x100010af, 0x24001c60 },
{ 0x100010b0, 0x24001c60 },
{ 0x100010b1, 0x24001c60 },
{ 0x100010b2, 0x24001c60 },
{ 0x100010b3, 0x24001c60 },
{ 0x100010b4, 0x24001c60 },
{ 0x100010b5, 0x24001c60 },
{ 0x100010b6, 0x24001c60 },
{ 0x100010b7, 0x24001c60 },
{ 0x100010b8, 0x24001c60 },
{ 0x100010b9, 0x24001c60 },
{ 0x100010ba, 0x24001c60 },
{ 0x100010bb, 0x24001c60 },
{ 0x100010bc, 0x24001c60 },
{ 0x100010bd, 0x24001c60 },
{ 0x100010be, 0x24001c60 },
{ 0x100010bf, 0x24001c60 },
{ 0x100010c0, 0x24001c60 },
{ 0x100010c1, 0x24001c60 },
{ 0x100010c2, 0x24001c60 },
{ 0x100010c3, 0x24001c60 },
{ 0x100010c4, 0x24001c60 },
{ 0x100010c5, 0x24001c60 },
{ 0x108010d0, 0x1c00002a },
{ 0x090010fb, 0x54000000 },
{ 0x100010fc, 0x18000000 },
{ 0x17801100, 0x1c000059 },
{ 0x1780115f, 0x1c000043 },
{ 0x178011a8, 0x1c000051 },
{ 0x0f801200, 0x1c000048 },
{ 0x0f80124a, 0x1c000003 },
{ 0x0f801250, 0x1c000006 },
{ 0x0f001258, 0x1c000000 },
{ 0x0f80125a, 0x1c000003 },
{ 0x0f801260, 0x1c000028 },
{ 0x0f80128a, 0x1c000003 },
{ 0x0f801290, 0x1c000020 },
{ 0x0f8012b2, 0x1c000003 },
{ 0x0f8012b8, 0x1c000006 },
{ 0x0f0012c0, 0x1c000000 },
{ 0x0f8012c2, 0x1c000003 },
{ 0x0f8012c8, 0x1c00000e },
{ 0x0f8012d8, 0x1c000038 },
{ 0x0f801312, 0x1c000003 },
{ 0x0f801318, 0x1c000042 },
{ 0x0f00135f, 0x30000000 },
{ 0x0f001360, 0x68000000 },
{ 0x0f801361, 0x54000007 },
{ 0x0f801369, 0x3c000013 },
{ 0x0f801380, 0x1c00000f },
{ 0x0f801390, 0x68000009 },
{ 0x088013a0, 0x1c000054 },
{ 0x07801401, 0x1c00026b },
{ 0x0780166d, 0x54000001 },
{ 0x0780166f, 0x1c000007 },
{ 0x28001680, 0x74000000 },
{ 0x28801681, 0x1c000019 },
{ 0x2800169b, 0x58000000 },
{ 0x2800169c, 0x48000000 },
{ 0x2d8016a0, 0x1c00004a },
{ 0x098016eb, 0x54000002 },
{ 0x2d8016ee, 0x38000002 },
{ 0x32801700, 0x1c00000c },
{ 0x3280170e, 0x1c000003 },
{ 0x32801712, 0x30000002 },
{ 0x18801720, 0x1c000011 },
{ 0x18801732, 0x30000002 },
{ 0x09801735, 0x54000001 },
{ 0x06801740, 0x1c000011 },
{ 0x06801752, 0x30000001 },
{ 0x33801760, 0x1c00000c },
{ 0x3380176e, 0x1c000002 },
{ 0x33801772, 0x30000001 },
{ 0x1f801780, 0x1c000033 },
{ 0x1f8017b4, 0x04000001 },
{ 0x1f0017b6, 0x28000000 },
{ 0x1f8017b7, 0x30000006 },
{ 0x1f8017be, 0x28000007 },
{ 0x1f0017c6, 0x30000000 },
{ 0x1f8017c7, 0x28000001 },
{ 0x1f8017c9, 0x3000000a },
{ 0x1f8017d4, 0x54000002 },
{ 0x1f0017d7, 0x18000000 },
{ 0x1f8017d8, 0x54000002 },
{ 0x1f0017db, 0x5c000000 },
{ 0x1f0017dc, 0x1c000000 },
{ 0x1f0017dd, 0x30000000 },
{ 0x1f8017e0, 0x34000009 },
{ 0x1f8017f0, 0x3c000009 },
{ 0x25801800, 0x54000005 },
{ 0x25001806, 0x44000000 },
{ 0x25801807, 0x54000003 },
{ 0x2580180b, 0x30000002 },
{ 0x2500180e, 0x74000000 },
{ 0x25801810, 0x34000009 },
{ 0x25801820, 0x1c000022 },
{ 0x25001843, 0x18000000 },
{ 0x25801844, 0x1c000033 },
{ 0x25801880, 0x1c000028 },
{ 0x250018a9, 0x30000000 },
{ 0x22801900, 0x1c00001c },
{ 0x22801920, 0x30000002 },
{ 0x22801923, 0x28000003 },
{ 0x22801927, 0x30000001 },
{ 0x22801929, 0x28000002 },
{ 0x22801930, 0x28000001 },
{ 0x22001932, 0x30000000 },
{ 0x22801933, 0x28000005 },
{ 0x22801939, 0x30000002 },
{ 0x22001940, 0x68000000 },
{ 0x22801944, 0x54000001 },
{ 0x22801946, 0x34000009 },
{ 0x34801950, 0x1c00001d },
{ 0x34801970, 0x1c000004 },
{ 0x27801980, 0x1c000029 },
{ 0x278019b0, 0x28000010 },
{ 0x278019c1, 0x1c000006 },
{ 0x278019c8, 0x28000001 },
{ 0x278019d0, 0x34000009 },
{ 0x278019de, 0x54000001 },
{ 0x1f8019e0, 0x6800001f },
{ 0x05801a00, 0x1c000016 },
{ 0x05801a17, 0x30000001 },
{ 0x05801a19, 0x28000002 },
{ 0x05801a1e, 0x54000001 },
{ 0x21801d00, 0x1400002b },
{ 0x21801d2c, 0x18000035 },
{ 0x21801d62, 0x14000015 },
{ 0x0c001d78, 0x18000000 },
{ 0x21801d79, 0x14000021 },
{ 0x21801d9b, 0x18000024 },
{ 0x1b801dc0, 0x30000003 },
{ 0x21001e00, 0x24000001 },
{ 0x21001e01, 0x1400ffff },
{ 0x21001e02, 0x24000001 },
{ 0x21001e03, 0x1400ffff },
{ 0x21001e04, 0x24000001 },
{ 0x21001e05, 0x1400ffff },
{ 0x21001e06, 0x24000001 },
{ 0x21001e07, 0x1400ffff },
{ 0x21001e08, 0x24000001 },
{ 0x21001e09, 0x1400ffff },
{ 0x21001e0a, 0x24000001 },
{ 0x21001e0b, 0x1400ffff },
{ 0x21001e0c, 0x24000001 },
{ 0x21001e0d, 0x1400ffff },
{ 0x21001e0e, 0x24000001 },
{ 0x21001e0f, 0x1400ffff },
{ 0x21001e10, 0x24000001 },
{ 0x21001e11, 0x1400ffff },
{ 0x21001e12, 0x24000001 },
{ 0x21001e13, 0x1400ffff },
{ 0x21001e14, 0x24000001 },
{ 0x21001e15, 0x1400ffff },
{ 0x21001e16, 0x24000001 },
{ 0x21001e17, 0x1400ffff },
{ 0x21001e18, 0x24000001 },
{ 0x21001e19, 0x1400ffff },
{ 0x21001e1a, 0x24000001 },
{ 0x21001e1b, 0x1400ffff },
{ 0x21001e1c, 0x24000001 },
{ 0x21001e1d, 0x1400ffff },
{ 0x21001e1e, 0x24000001 },
{ 0x21001e1f, 0x1400ffff },
{ 0x21001e20, 0x24000001 },
{ 0x21001e21, 0x1400ffff },
{ 0x21001e22, 0x24000001 },
{ 0x21001e23, 0x1400ffff },
{ 0x21001e24, 0x24000001 },
{ 0x21001e25, 0x1400ffff },
{ 0x21001e26, 0x24000001 },
{ 0x21001e27, 0x1400ffff },
{ 0x21001e28, 0x24000001 },
{ 0x21001e29, 0x1400ffff },
{ 0x21001e2a, 0x24000001 },
{ 0x21001e2b, 0x1400ffff },
{ 0x21001e2c, 0x24000001 },
{ 0x21001e2d, 0x1400ffff },
{ 0x21001e2e, 0x24000001 },
{ 0x21001e2f, 0x1400ffff },
{ 0x21001e30, 0x24000001 },
{ 0x21001e31, 0x1400ffff },
{ 0x21001e32, 0x24000001 },
{ 0x21001e33, 0x1400ffff },
{ 0x21001e34, 0x24000001 },
{ 0x21001e35, 0x1400ffff },
{ 0x21001e36, 0x24000001 },
{ 0x21001e37, 0x1400ffff },
{ 0x21001e38, 0x24000001 },
{ 0x21001e39, 0x1400ffff },
{ 0x21001e3a, 0x24000001 },
{ 0x21001e3b, 0x1400ffff },
{ 0x21001e3c, 0x24000001 },
{ 0x21001e3d, 0x1400ffff },
{ 0x21001e3e, 0x24000001 },
{ 0x21001e3f, 0x1400ffff },
{ 0x21001e40, 0x24000001 },
{ 0x21001e41, 0x1400ffff },
{ 0x21001e42, 0x24000001 },
{ 0x21001e43, 0x1400ffff },
{ 0x21001e44, 0x24000001 },
{ 0x21001e45, 0x1400ffff },
{ 0x21001e46, 0x24000001 },
{ 0x21001e47, 0x1400ffff },
{ 0x21001e48, 0x24000001 },
{ 0x21001e49, 0x1400ffff },
{ 0x21001e4a, 0x24000001 },
{ 0x21001e4b, 0x1400ffff },
{ 0x21001e4c, 0x24000001 },
{ 0x21001e4d, 0x1400ffff },
{ 0x21001e4e, 0x24000001 },
{ 0x21001e4f, 0x1400ffff },
{ 0x21001e50, 0x24000001 },
{ 0x21001e51, 0x1400ffff },
{ 0x21001e52, 0x24000001 },
{ 0x21001e53, 0x1400ffff },
{ 0x21001e54, 0x24000001 },
{ 0x21001e55, 0x1400ffff },
{ 0x21001e56, 0x24000001 },
{ 0x21001e57, 0x1400ffff },
{ 0x21001e58, 0x24000001 },
{ 0x21001e59, 0x1400ffff },
{ 0x21001e5a, 0x24000001 },
{ 0x21001e5b, 0x1400ffff },
{ 0x21001e5c, 0x24000001 },
{ 0x21001e5d, 0x1400ffff },
{ 0x21001e5e, 0x24000001 },
{ 0x21001e5f, 0x1400ffff },
{ 0x21001e60, 0x24000001 },
{ 0x21001e61, 0x1400ffff },
{ 0x21001e62, 0x24000001 },
{ 0x21001e63, 0x1400ffff },
{ 0x21001e64, 0x24000001 },
{ 0x21001e65, 0x1400ffff },
{ 0x21001e66, 0x24000001 },
{ 0x21001e67, 0x1400ffff },
{ 0x21001e68, 0x24000001 },
{ 0x21001e69, 0x1400ffff },
{ 0x21001e6a, 0x24000001 },
{ 0x21001e6b, 0x1400ffff },
{ 0x21001e6c, 0x24000001 },
{ 0x21001e6d, 0x1400ffff },
{ 0x21001e6e, 0x24000001 },
{ 0x21001e6f, 0x1400ffff },
{ 0x21001e70, 0x24000001 },
{ 0x21001e71, 0x1400ffff },
{ 0x21001e72, 0x24000001 },
{ 0x21001e73, 0x1400ffff },
{ 0x21001e74, 0x24000001 },
{ 0x21001e75, 0x1400ffff },
{ 0x21001e76, 0x24000001 },
{ 0x21001e77, 0x1400ffff },
{ 0x21001e78, 0x24000001 },
{ 0x21001e79, 0x1400ffff },
{ 0x21001e7a, 0x24000001 },
{ 0x21001e7b, 0x1400ffff },
{ 0x21001e7c, 0x24000001 },
{ 0x21001e7d, 0x1400ffff },
{ 0x21001e7e, 0x24000001 },
{ 0x21001e7f, 0x1400ffff },
{ 0x21001e80, 0x24000001 },
{ 0x21001e81, 0x1400ffff },
{ 0x21001e82, 0x24000001 },
{ 0x21001e83, 0x1400ffff },
{ 0x21001e84, 0x24000001 },
{ 0x21001e85, 0x1400ffff },
{ 0x21001e86, 0x24000001 },
{ 0x21001e87, 0x1400ffff },
{ 0x21001e88, 0x24000001 },
{ 0x21001e89, 0x1400ffff },
{ 0x21001e8a, 0x24000001 },
{ 0x21001e8b, 0x1400ffff },
{ 0x21001e8c, 0x24000001 },
{ 0x21001e8d, 0x1400ffff },
{ 0x21001e8e, 0x24000001 },
{ 0x21001e8f, 0x1400ffff },
{ 0x21001e90, 0x24000001 },
{ 0x21001e91, 0x1400ffff },
{ 0x21001e92, 0x24000001 },
{ 0x21001e93, 0x1400ffff },
{ 0x21001e94, 0x24000001 },
{ 0x21001e95, 0x1400ffff },
{ 0x21801e96, 0x14000004 },
{ 0x21001e9b, 0x1400ffc5 },
{ 0x21001ea0, 0x24000001 },
{ 0x21001ea1, 0x1400ffff },
{ 0x21001ea2, 0x24000001 },
{ 0x21001ea3, 0x1400ffff },
{ 0x21001ea4, 0x24000001 },
{ 0x21001ea5, 0x1400ffff },
{ 0x21001ea6, 0x24000001 },
{ 0x21001ea7, 0x1400ffff },
{ 0x21001ea8, 0x24000001 },
{ 0x21001ea9, 0x1400ffff },
{ 0x21001eaa, 0x24000001 },
{ 0x21001eab, 0x1400ffff },
{ 0x21001eac, 0x24000001 },
{ 0x21001ead, 0x1400ffff },
{ 0x21001eae, 0x24000001 },
{ 0x21001eaf, 0x1400ffff },
{ 0x21001eb0, 0x24000001 },
{ 0x21001eb1, 0x1400ffff },
{ 0x21001eb2, 0x24000001 },
{ 0x21001eb3, 0x1400ffff },
{ 0x21001eb4, 0x24000001 },
{ 0x21001eb5, 0x1400ffff },
{ 0x21001eb6, 0x24000001 },
{ 0x21001eb7, 0x1400ffff },
{ 0x21001eb8, 0x24000001 },
{ 0x21001eb9, 0x1400ffff },
{ 0x21001eba, 0x24000001 },
{ 0x21001ebb, 0x1400ffff },
{ 0x21001ebc, 0x24000001 },
{ 0x21001ebd, 0x1400ffff },
{ 0x21001ebe, 0x24000001 },
{ 0x21001ebf, 0x1400ffff },
{ 0x21001ec0, 0x24000001 },
{ 0x21001ec1, 0x1400ffff },
{ 0x21001ec2, 0x24000001 },
{ 0x21001ec3, 0x1400ffff },
{ 0x21001ec4, 0x24000001 },
{ 0x21001ec5, 0x1400ffff },
{ 0x21001ec6, 0x24000001 },
{ 0x21001ec7, 0x1400ffff },
{ 0x21001ec8, 0x24000001 },
{ 0x21001ec9, 0x1400ffff },
{ 0x21001eca, 0x24000001 },
{ 0x21001ecb, 0x1400ffff },
{ 0x21001ecc, 0x24000001 },
{ 0x21001ecd, 0x1400ffff },
{ 0x21001ece, 0x24000001 },
{ 0x21001ecf, 0x1400ffff },
{ 0x21001ed0, 0x24000001 },
{ 0x21001ed1, 0x1400ffff },
{ 0x21001ed2, 0x24000001 },
{ 0x21001ed3, 0x1400ffff },
{ 0x21001ed4, 0x24000001 },
{ 0x21001ed5, 0x1400ffff },
{ 0x21001ed6, 0x24000001 },
{ 0x21001ed7, 0x1400ffff },
{ 0x21001ed8, 0x24000001 },
{ 0x21001ed9, 0x1400ffff },
{ 0x21001eda, 0x24000001 },
{ 0x21001edb, 0x1400ffff },
{ 0x21001edc, 0x24000001 },
{ 0x21001edd, 0x1400ffff },
{ 0x21001ede, 0x24000001 },
{ 0x21001edf, 0x1400ffff },
{ 0x21001ee0, 0x24000001 },
{ 0x21001ee1, 0x1400ffff },
{ 0x21001ee2, 0x24000001 },
{ 0x21001ee3, 0x1400ffff },
{ 0x21001ee4, 0x24000001 },
{ 0x21001ee5, 0x1400ffff },
{ 0x21001ee6, 0x24000001 },
{ 0x21001ee7, 0x1400ffff },
{ 0x21001ee8, 0x24000001 },
{ 0x21001ee9, 0x1400ffff },
{ 0x21001eea, 0x24000001 },
{ 0x21001eeb, 0x1400ffff },
{ 0x21001eec, 0x24000001 },
{ 0x21001eed, 0x1400ffff },
{ 0x21001eee, 0x24000001 },
{ 0x21001eef, 0x1400ffff },
{ 0x21001ef0, 0x24000001 },
{ 0x21001ef1, 0x1400ffff },
{ 0x21001ef2, 0x24000001 },
{ 0x21001ef3, 0x1400ffff },
{ 0x21001ef4, 0x24000001 },
{ 0x21001ef5, 0x1400ffff },
{ 0x21001ef6, 0x24000001 },
{ 0x21001ef7, 0x1400ffff },
{ 0x21001ef8, 0x24000001 },
{ 0x21001ef9, 0x1400ffff },
{ 0x13001f00, 0x14000008 },
{ 0x13001f01, 0x14000008 },
{ 0x13001f02, 0x14000008 },
{ 0x13001f03, 0x14000008 },
{ 0x13001f04, 0x14000008 },
{ 0x13001f05, 0x14000008 },
{ 0x13001f06, 0x14000008 },
{ 0x13001f07, 0x14000008 },
{ 0x13001f08, 0x2400fff8 },
{ 0x13001f09, 0x2400fff8 },
{ 0x13001f0a, 0x2400fff8 },
{ 0x13001f0b, 0x2400fff8 },
{ 0x13001f0c, 0x2400fff8 },
{ 0x13001f0d, 0x2400fff8 },
{ 0x13001f0e, 0x2400fff8 },
{ 0x13001f0f, 0x2400fff8 },
{ 0x13001f10, 0x14000008 },
{ 0x13001f11, 0x14000008 },
{ 0x13001f12, 0x14000008 },
{ 0x13001f13, 0x14000008 },
{ 0x13001f14, 0x14000008 },
{ 0x13001f15, 0x14000008 },
{ 0x13001f18, 0x2400fff8 },
{ 0x13001f19, 0x2400fff8 },
{ 0x13001f1a, 0x2400fff8 },
{ 0x13001f1b, 0x2400fff8 },
{ 0x13001f1c, 0x2400fff8 },
{ 0x13001f1d, 0x2400fff8 },
{ 0x13001f20, 0x14000008 },
{ 0x13001f21, 0x14000008 },
{ 0x13001f22, 0x14000008 },
{ 0x13001f23, 0x14000008 },
{ 0x13001f24, 0x14000008 },
{ 0x13001f25, 0x14000008 },
{ 0x13001f26, 0x14000008 },
{ 0x13001f27, 0x14000008 },
{ 0x13001f28, 0x2400fff8 },
{ 0x13001f29, 0x2400fff8 },
{ 0x13001f2a, 0x2400fff8 },
{ 0x13001f2b, 0x2400fff8 },
{ 0x13001f2c, 0x2400fff8 },
{ 0x13001f2d, 0x2400fff8 },
{ 0x13001f2e, 0x2400fff8 },
{ 0x13001f2f, 0x2400fff8 },
{ 0x13001f30, 0x14000008 },
{ 0x13001f31, 0x14000008 },
{ 0x13001f32, 0x14000008 },
{ 0x13001f33, 0x14000008 },
{ 0x13001f34, 0x14000008 },
{ 0x13001f35, 0x14000008 },
{ 0x13001f36, 0x14000008 },
{ 0x13001f37, 0x14000008 },
{ 0x13001f38, 0x2400fff8 },
{ 0x13001f39, 0x2400fff8 },
{ 0x13001f3a, 0x2400fff8 },
{ 0x13001f3b, 0x2400fff8 },
{ 0x13001f3c, 0x2400fff8 },
{ 0x13001f3d, 0x2400fff8 },
{ 0x13001f3e, 0x2400fff8 },
{ 0x13001f3f, 0x2400fff8 },
{ 0x13001f40, 0x14000008 },
{ 0x13001f41, 0x14000008 },
{ 0x13001f42, 0x14000008 },
{ 0x13001f43, 0x14000008 },
{ 0x13001f44, 0x14000008 },
{ 0x13001f45, 0x14000008 },
{ 0x13001f48, 0x2400fff8 },
{ 0x13001f49, 0x2400fff8 },
{ 0x13001f4a, 0x2400fff8 },
{ 0x13001f4b, 0x2400fff8 },
{ 0x13001f4c, 0x2400fff8 },
{ 0x13001f4d, 0x2400fff8 },
{ 0x13001f50, 0x14000000 },
{ 0x13001f51, 0x14000008 },
{ 0x13001f52, 0x14000000 },
{ 0x13001f53, 0x14000008 },
{ 0x13001f54, 0x14000000 },
{ 0x13001f55, 0x14000008 },
{ 0x13001f56, 0x14000000 },
{ 0x13001f57, 0x14000008 },
{ 0x13001f59, 0x2400fff8 },
{ 0x13001f5b, 0x2400fff8 },
{ 0x13001f5d, 0x2400fff8 },
{ 0x13001f5f, 0x2400fff8 },
{ 0x13001f60, 0x14000008 },
{ 0x13001f61, 0x14000008 },
{ 0x13001f62, 0x14000008 },
{ 0x13001f63, 0x14000008 },
{ 0x13001f64, 0x14000008 },
{ 0x13001f65, 0x14000008 },
{ 0x13001f66, 0x14000008 },
{ 0x13001f67, 0x14000008 },
{ 0x13001f68, 0x2400fff8 },
{ 0x13001f69, 0x2400fff8 },
{ 0x13001f6a, 0x2400fff8 },
{ 0x13001f6b, 0x2400fff8 },
{ 0x13001f6c, 0x2400fff8 },
{ 0x13001f6d, 0x2400fff8 },
{ 0x13001f6e, 0x2400fff8 },
{ 0x13001f6f, 0x2400fff8 },
{ 0x13001f70, 0x1400004a },
{ 0x13001f71, 0x1400004a },
{ 0x13001f72, 0x14000056 },
{ 0x13001f73, 0x14000056 },
{ 0x13001f74, 0x14000056 },
{ 0x13001f75, 0x14000056 },
{ 0x13001f76, 0x14000064 },
{ 0x13001f77, 0x14000064 },
{ 0x13001f78, 0x14000080 },
{ 0x13001f79, 0x14000080 },
{ 0x13001f7a, 0x14000070 },
{ 0x13001f7b, 0x14000070 },
{ 0x13001f7c, 0x1400007e },
{ 0x13001f7d, 0x1400007e },
{ 0x13001f80, 0x14000008 },
{ 0x13001f81, 0x14000008 },
{ 0x13001f82, 0x14000008 },
{ 0x13001f83, 0x14000008 },
{ 0x13001f84, 0x14000008 },
{ 0x13001f85, 0x14000008 },
{ 0x13001f86, 0x14000008 },
{ 0x13001f87, 0x14000008 },
{ 0x13001f88, 0x2000fff8 },
{ 0x13001f89, 0x2000fff8 },
{ 0x13001f8a, 0x2000fff8 },
{ 0x13001f8b, 0x2000fff8 },
{ 0x13001f8c, 0x2000fff8 },
{ 0x13001f8d, 0x2000fff8 },
{ 0x13001f8e, 0x2000fff8 },
{ 0x13001f8f, 0x2000fff8 },
{ 0x13001f90, 0x14000008 },
{ 0x13001f91, 0x14000008 },
{ 0x13001f92, 0x14000008 },
{ 0x13001f93, 0x14000008 },
{ 0x13001f94, 0x14000008 },
{ 0x13001f95, 0x14000008 },
{ 0x13001f96, 0x14000008 },
{ 0x13001f97, 0x14000008 },
{ 0x13001f98, 0x2000fff8 },
{ 0x13001f99, 0x2000fff8 },
{ 0x13001f9a, 0x2000fff8 },
{ 0x13001f9b, 0x2000fff8 },
{ 0x13001f9c, 0x2000fff8 },
{ 0x13001f9d, 0x2000fff8 },
{ 0x13001f9e, 0x2000fff8 },
{ 0x13001f9f, 0x2000fff8 },
{ 0x13001fa0, 0x14000008 },
{ 0x13001fa1, 0x14000008 },
{ 0x13001fa2, 0x14000008 },
{ 0x13001fa3, 0x14000008 },
{ 0x13001fa4, 0x14000008 },
{ 0x13001fa5, 0x14000008 },
{ 0x13001fa6, 0x14000008 },
{ 0x13001fa7, 0x14000008 },
{ 0x13001fa8, 0x2000fff8 },
{ 0x13001fa9, 0x2000fff8 },
{ 0x13001faa, 0x2000fff8 },
{ 0x13001fab, 0x2000fff8 },
{ 0x13001fac, 0x2000fff8 },
{ 0x13001fad, 0x2000fff8 },
{ 0x13001fae, 0x2000fff8 },
{ 0x13001faf, 0x2000fff8 },
{ 0x13001fb0, 0x14000008 },
{ 0x13001fb1, 0x14000008 },
{ 0x13001fb2, 0x14000000 },
{ 0x13001fb3, 0x14000009 },
{ 0x13001fb4, 0x14000000 },
{ 0x13801fb6, 0x14000001 },
{ 0x13001fb8, 0x2400fff8 },
{ 0x13001fb9, 0x2400fff8 },
{ 0x13001fba, 0x2400ffb6 },
{ 0x13001fbb, 0x2400ffb6 },
{ 0x13001fbc, 0x2000fff7 },
{ 0x13001fbd, 0x60000000 },
{ 0x13001fbe, 0x1400e3db },
{ 0x13801fbf, 0x60000002 },
{ 0x13001fc2, 0x14000000 },
{ 0x13001fc3, 0x14000009 },
{ 0x13001fc4, 0x14000000 },
{ 0x13801fc6, 0x14000001 },
{ 0x13001fc8, 0x2400ffaa },
{ 0x13001fc9, 0x2400ffaa },
{ 0x13001fca, 0x2400ffaa },
{ 0x13001fcb, 0x2400ffaa },
{ 0x13001fcc, 0x2000fff7 },
{ 0x13801fcd, 0x60000002 },
{ 0x13001fd0, 0x14000008 },
{ 0x13001fd1, 0x14000008 },
{ 0x13801fd2, 0x14000001 },
{ 0x13801fd6, 0x14000001 },
{ 0x13001fd8, 0x2400fff8 },
{ 0x13001fd9, 0x2400fff8 },
{ 0x13001fda, 0x2400ff9c },
{ 0x13001fdb, 0x2400ff9c },
{ 0x13801fdd, 0x60000002 },
{ 0x13001fe0, 0x14000008 },
{ 0x13001fe1, 0x14000008 },
{ 0x13801fe2, 0x14000002 },
{ 0x13001fe5, 0x14000007 },
{ 0x13801fe6, 0x14000001 },
{ 0x13001fe8, 0x2400fff8 },
{ 0x13001fe9, 0x2400fff8 },
{ 0x13001fea, 0x2400ff90 },
{ 0x13001feb, 0x2400ff90 },
{ 0x13001fec, 0x2400fff9 },
{ 0x13801fed, 0x60000002 },
{ 0x13001ff2, 0x14000000 },
{ 0x13001ff3, 0x14000009 },
{ 0x13001ff4, 0x14000000 },
{ 0x13801ff6, 0x14000001 },
{ 0x13001ff8, 0x2400ff80 },
{ 0x13001ff9, 0x2400ff80 },
{ 0x13001ffa, 0x2400ff82 },
{ 0x13001ffb, 0x2400ff82 },
{ 0x13001ffc, 0x2000fff7 },
{ 0x13801ffd, 0x60000001 },
{ 0x09802000, 0x7400000a },
{ 0x0980200b, 0x04000004 },
{ 0x09802010, 0x44000005 },
{ 0x09802016, 0x54000001 },
{ 0x09002018, 0x50000000 },
{ 0x09002019, 0x4c000000 },
{ 0x0900201a, 0x58000000 },
{ 0x0980201b, 0x50000001 },
{ 0x0900201d, 0x4c000000 },
{ 0x0900201e, 0x58000000 },
{ 0x0900201f, 0x50000000 },
{ 0x09802020, 0x54000007 },
{ 0x09002028, 0x6c000000 },
{ 0x09002029, 0x70000000 },
{ 0x0980202a, 0x04000004 },
{ 0x0900202f, 0x74000000 },
{ 0x09802030, 0x54000008 },
{ 0x09002039, 0x50000000 },
{ 0x0900203a, 0x4c000000 },
{ 0x0980203b, 0x54000003 },
{ 0x0980203f, 0x40000001 },
{ 0x09802041, 0x54000002 },
{ 0x09002044, 0x64000000 },
{ 0x09002045, 0x58000000 },
{ 0x09002046, 0x48000000 },
{ 0x09802047, 0x5400000a },
{ 0x09002052, 0x64000000 },
{ 0x09002053, 0x54000000 },
{ 0x09002054, 0x40000000 },
{ 0x09802055, 0x54000009 },
{ 0x0900205f, 0x74000000 },
{ 0x09802060, 0x04000003 },
{ 0x0980206a, 0x04000005 },
{ 0x09002070, 0x3c000000 },
{ 0x21002071, 0x14000000 },
{ 0x09802074, 0x3c000005 },
{ 0x0980207a, 0x64000002 },
{ 0x0900207d, 0x58000000 },
{ 0x0900207e, 0x48000000 },
{ 0x2100207f, 0x14000000 },
{ 0x09802080, 0x3c000009 },
{ 0x0980208a, 0x64000002 },
{ 0x0900208d, 0x58000000 },
{ 0x0900208e, 0x48000000 },
{ 0x21802090, 0x18000004 },
{ 0x098020a0, 0x5c000015 },
{ 0x1b8020d0, 0x3000000c },
{ 0x1b8020dd, 0x2c000003 },
{ 0x1b0020e1, 0x30000000 },
{ 0x1b8020e2, 0x2c000002 },
{ 0x1b8020e5, 0x30000006 },
{ 0x09802100, 0x68000001 },
{ 0x09002102, 0x24000000 },
{ 0x09802103, 0x68000003 },
{ 0x09002107, 0x24000000 },
{ 0x09802108, 0x68000001 },
{ 0x0900210a, 0x14000000 },
{ 0x0980210b, 0x24000002 },
{ 0x0980210e, 0x14000001 },
{ 0x09802110, 0x24000002 },
{ 0x09002113, 0x14000000 },
{ 0x09002114, 0x68000000 },
{ 0x09002115, 0x24000000 },
{ 0x09802116, 0x68000002 },
{ 0x09802119, 0x24000004 },
{ 0x0980211e, 0x68000005 },
{ 0x09002124, 0x24000000 },
{ 0x09002125, 0x68000000 },
{ 0x13002126, 0x2400e2a3 },
{ 0x09002127, 0x68000000 },
{ 0x09002128, 0x24000000 },
{ 0x09002129, 0x68000000 },
{ 0x2100212a, 0x2400df41 },
{ 0x2100212b, 0x2400dfba },
{ 0x0980212c, 0x24000001 },
{ 0x0900212e, 0x68000000 },
{ 0x0900212f, 0x14000000 },
{ 0x09802130, 0x24000001 },
{ 0x09002132, 0x68000000 },
{ 0x09002133, 0x24000000 },
{ 0x09002134, 0x14000000 },
{ 0x09802135, 0x1c000003 },
{ 0x09002139, 0x14000000 },
{ 0x0980213a, 0x68000001 },
{ 0x0980213c, 0x14000001 },
{ 0x0980213e, 0x24000001 },
{ 0x09802140, 0x64000004 },
{ 0x09002145, 0x24000000 },
{ 0x09802146, 0x14000003 },
{ 0x0900214a, 0x68000000 },
{ 0x0900214b, 0x64000000 },
{ 0x0900214c, 0x68000000 },
{ 0x09802153, 0x3c00000c },
{ 0x09002160, 0x38000010 },
{ 0x09002161, 0x38000010 },
{ 0x09002162, 0x38000010 },
{ 0x09002163, 0x38000010 },
{ 0x09002164, 0x38000010 },
{ 0x09002165, 0x38000010 },
{ 0x09002166, 0x38000010 },
{ 0x09002167, 0x38000010 },
{ 0x09002168, 0x38000010 },
{ 0x09002169, 0x38000010 },
{ 0x0900216a, 0x38000010 },
{ 0x0900216b, 0x38000010 },
{ 0x0900216c, 0x38000010 },
{ 0x0900216d, 0x38000010 },
{ 0x0900216e, 0x38000010 },
{ 0x0900216f, 0x38000010 },
{ 0x09002170, 0x3800fff0 },
{ 0x09002171, 0x3800fff0 },
{ 0x09002172, 0x3800fff0 },
{ 0x09002173, 0x3800fff0 },
{ 0x09002174, 0x3800fff0 },
{ 0x09002175, 0x3800fff0 },
{ 0x09002176, 0x3800fff0 },
{ 0x09002177, 0x3800fff0 },
{ 0x09002178, 0x3800fff0 },
{ 0x09002179, 0x3800fff0 },
{ 0x0900217a, 0x3800fff0 },
{ 0x0900217b, 0x3800fff0 },
{ 0x0900217c, 0x3800fff0 },
{ 0x0900217d, 0x3800fff0 },
{ 0x0900217e, 0x3800fff0 },
{ 0x0900217f, 0x3800fff0 },
{ 0x09802180, 0x38000003 },
{ 0x09802190, 0x64000004 },
{ 0x09802195, 0x68000004 },
{ 0x0980219a, 0x64000001 },
{ 0x0980219c, 0x68000003 },
{ 0x090021a0, 0x64000000 },
{ 0x098021a1, 0x68000001 },
{ 0x090021a3, 0x64000000 },
{ 0x098021a4, 0x68000001 },
{ 0x090021a6, 0x64000000 },
{ 0x098021a7, 0x68000006 },
{ 0x090021ae, 0x64000000 },
{ 0x098021af, 0x6800001e },
{ 0x098021ce, 0x64000001 },
{ 0x098021d0, 0x68000001 },
{ 0x090021d2, 0x64000000 },
{ 0x090021d3, 0x68000000 },
{ 0x090021d4, 0x64000000 },
{ 0x098021d5, 0x6800001e },
{ 0x098021f4, 0x6400010b },
{ 0x09802300, 0x68000007 },
{ 0x09802308, 0x64000003 },
{ 0x0980230c, 0x68000013 },
{ 0x09802320, 0x64000001 },
{ 0x09802322, 0x68000006 },
{ 0x09002329, 0x58000000 },
{ 0x0900232a, 0x48000000 },
{ 0x0980232b, 0x68000050 },
{ 0x0900237c, 0x64000000 },
{ 0x0980237d, 0x6800001d },
{ 0x0980239b, 0x64000018 },
{ 0x090023b4, 0x58000000 },
{ 0x090023b5, 0x48000000 },
{ 0x090023b6, 0x54000000 },
{ 0x098023b7, 0x68000024 },
{ 0x09802400, 0x68000026 },
{ 0x09802440, 0x6800000a },
{ 0x09802460, 0x3c00003b },
{ 0x0980249c, 0x68000019 },
{ 0x090024b6, 0x6800001a },
{ 0x090024b7, 0x6800001a },
{ 0x090024b8, 0x6800001a },
{ 0x090024b9, 0x6800001a },
{ 0x090024ba, 0x6800001a },
{ 0x090024bb, 0x6800001a },
{ 0x090024bc, 0x6800001a },
{ 0x090024bd, 0x6800001a },
{ 0x090024be, 0x6800001a },
{ 0x090024bf, 0x6800001a },
{ 0x090024c0, 0x6800001a },
{ 0x090024c1, 0x6800001a },
{ 0x090024c2, 0x6800001a },
{ 0x090024c3, 0x6800001a },
{ 0x090024c4, 0x6800001a },
{ 0x090024c5, 0x6800001a },
{ 0x090024c6, 0x6800001a },
{ 0x090024c7, 0x6800001a },
{ 0x090024c8, 0x6800001a },
{ 0x090024c9, 0x6800001a },
{ 0x090024ca, 0x6800001a },
{ 0x090024cb, 0x6800001a },
{ 0x090024cc, 0x6800001a },
{ 0x090024cd, 0x6800001a },
{ 0x090024ce, 0x6800001a },
{ 0x090024cf, 0x6800001a },
{ 0x090024d0, 0x6800ffe6 },
{ 0x090024d1, 0x6800ffe6 },
{ 0x090024d2, 0x6800ffe6 },
{ 0x090024d3, 0x6800ffe6 },
{ 0x090024d4, 0x6800ffe6 },
{ 0x090024d5, 0x6800ffe6 },
{ 0x090024d6, 0x6800ffe6 },
{ 0x090024d7, 0x6800ffe6 },
{ 0x090024d8, 0x6800ffe6 },
{ 0x090024d9, 0x6800ffe6 },
{ 0x090024da, 0x6800ffe6 },
{ 0x090024db, 0x6800ffe6 },
{ 0x090024dc, 0x6800ffe6 },
{ 0x090024dd, 0x6800ffe6 },
{ 0x090024de, 0x6800ffe6 },
{ 0x090024df, 0x6800ffe6 },
{ 0x090024e0, 0x6800ffe6 },
{ 0x090024e1, 0x6800ffe6 },
{ 0x090024e2, 0x6800ffe6 },
{ 0x090024e3, 0x6800ffe6 },
{ 0x090024e4, 0x6800ffe6 },
{ 0x090024e5, 0x6800ffe6 },
{ 0x090024e6, 0x6800ffe6 },
{ 0x090024e7, 0x6800ffe6 },
{ 0x090024e8, 0x6800ffe6 },
{ 0x090024e9, 0x6800ffe6 },
{ 0x098024ea, 0x3c000015 },
{ 0x09802500, 0x680000b6 },
{ 0x090025b7, 0x64000000 },
{ 0x098025b8, 0x68000008 },
{ 0x090025c1, 0x64000000 },
{ 0x098025c2, 0x68000035 },
{ 0x098025f8, 0x64000007 },
{ 0x09802600, 0x6800006e },
{ 0x0900266f, 0x64000000 },
{ 0x09802670, 0x6800002c },
{ 0x098026a0, 0x68000011 },
{ 0x09802701, 0x68000003 },
{ 0x09802706, 0x68000003 },
{ 0x0980270c, 0x6800001b },
{ 0x09802729, 0x68000022 },
{ 0x0900274d, 0x68000000 },
{ 0x0980274f, 0x68000003 },
{ 0x09002756, 0x68000000 },
{ 0x09802758, 0x68000006 },
{ 0x09802761, 0x68000006 },
{ 0x09002768, 0x58000000 },
{ 0x09002769, 0x48000000 },
{ 0x0900276a, 0x58000000 },
{ 0x0900276b, 0x48000000 },
{ 0x0900276c, 0x58000000 },
{ 0x0900276d, 0x48000000 },
{ 0x0900276e, 0x58000000 },
{ 0x0900276f, 0x48000000 },
{ 0x09002770, 0x58000000 },
{ 0x09002771, 0x48000000 },
{ 0x09002772, 0x58000000 },
{ 0x09002773, 0x48000000 },
{ 0x09002774, 0x58000000 },
{ 0x09002775, 0x48000000 },
{ 0x09802776, 0x3c00001d },
{ 0x09002794, 0x68000000 },
{ 0x09802798, 0x68000017 },
{ 0x098027b1, 0x6800000d },
{ 0x098027c0, 0x64000004 },
{ 0x090027c5, 0x58000000 },
{ 0x090027c6, 0x48000000 },
{ 0x098027d0, 0x64000015 },
{ 0x090027e6, 0x58000000 },
{ 0x090027e7, 0x48000000 },
{ 0x090027e8, 0x58000000 },
{ 0x090027e9, 0x48000000 },
{ 0x090027ea, 0x58000000 },
{ 0x090027eb, 0x48000000 },
{ 0x098027f0, 0x6400000f },
{ 0x04802800, 0x680000ff },
{ 0x09802900, 0x64000082 },
{ 0x09002983, 0x58000000 },
{ 0x09002984, 0x48000000 },
{ 0x09002985, 0x58000000 },
{ 0x09002986, 0x48000000 },
{ 0x09002987, 0x58000000 },
{ 0x09002988, 0x48000000 },
{ 0x09002989, 0x58000000 },
{ 0x0900298a, 0x48000000 },
{ 0x0900298b, 0x58000000 },
{ 0x0900298c, 0x48000000 },
{ 0x0900298d, 0x58000000 },
{ 0x0900298e, 0x48000000 },
{ 0x0900298f, 0x58000000 },
{ 0x09002990, 0x48000000 },
{ 0x09002991, 0x58000000 },
{ 0x09002992, 0x48000000 },
{ 0x09002993, 0x58000000 },
{ 0x09002994, 0x48000000 },
{ 0x09002995, 0x58000000 },
{ 0x09002996, 0x48000000 },
{ 0x09002997, 0x58000000 },
{ 0x09002998, 0x48000000 },
{ 0x09802999, 0x6400003e },
{ 0x090029d8, 0x58000000 },
{ 0x090029d9, 0x48000000 },
{ 0x090029da, 0x58000000 },
{ 0x090029db, 0x48000000 },
{ 0x098029dc, 0x6400001f },
{ 0x090029fc, 0x58000000 },
{ 0x090029fd, 0x48000000 },
{ 0x098029fe, 0x64000101 },
{ 0x09802b00, 0x68000013 },
{ 0x11002c00, 0x24000030 },
{ 0x11002c01, 0x24000030 },
{ 0x11002c02, 0x24000030 },
{ 0x11002c03, 0x24000030 },
{ 0x11002c04, 0x24000030 },
{ 0x11002c05, 0x24000030 },
{ 0x11002c06, 0x24000030 },
{ 0x11002c07, 0x24000030 },
{ 0x11002c08, 0x24000030 },
{ 0x11002c09, 0x24000030 },
{ 0x11002c0a, 0x24000030 },
{ 0x11002c0b, 0x24000030 },
{ 0x11002c0c, 0x24000030 },
{ 0x11002c0d, 0x24000030 },
{ 0x11002c0e, 0x24000030 },
{ 0x11002c0f, 0x24000030 },
{ 0x11002c10, 0x24000030 },
{ 0x11002c11, 0x24000030 },
{ 0x11002c12, 0x24000030 },
{ 0x11002c13, 0x24000030 },
{ 0x11002c14, 0x24000030 },
{ 0x11002c15, 0x24000030 },
{ 0x11002c16, 0x24000030 },
{ 0x11002c17, 0x24000030 },
{ 0x11002c18, 0x24000030 },
{ 0x11002c19, 0x24000030 },
{ 0x11002c1a, 0x24000030 },
{ 0x11002c1b, 0x24000030 },
{ 0x11002c1c, 0x24000030 },
{ 0x11002c1d, 0x24000030 },
{ 0x11002c1e, 0x24000030 },
{ 0x11002c1f, 0x24000030 },
{ 0x11002c20, 0x24000030 },
{ 0x11002c21, 0x24000030 },
{ 0x11002c22, 0x24000030 },
{ 0x11002c23, 0x24000030 },
{ 0x11002c24, 0x24000030 },
{ 0x11002c25, 0x24000030 },
{ 0x11002c26, 0x24000030 },
{ 0x11002c27, 0x24000030 },
{ 0x11002c28, 0x24000030 },
{ 0x11002c29, 0x24000030 },
{ 0x11002c2a, 0x24000030 },
{ 0x11002c2b, 0x24000030 },
{ 0x11002c2c, 0x24000030 },
{ 0x11002c2d, 0x24000030 },
{ 0x11002c2e, 0x24000030 },
{ 0x11002c30, 0x1400ffd0 },
{ 0x11002c31, 0x1400ffd0 },
{ 0x11002c32, 0x1400ffd0 },
{ 0x11002c33, 0x1400ffd0 },
{ 0x11002c34, 0x1400ffd0 },
{ 0x11002c35, 0x1400ffd0 },
{ 0x11002c36, 0x1400ffd0 },
{ 0x11002c37, 0x1400ffd0 },
{ 0x11002c38, 0x1400ffd0 },
{ 0x11002c39, 0x1400ffd0 },
{ 0x11002c3a, 0x1400ffd0 },
{ 0x11002c3b, 0x1400ffd0 },
{ 0x11002c3c, 0x1400ffd0 },
{ 0x11002c3d, 0x1400ffd0 },
{ 0x11002c3e, 0x1400ffd0 },
{ 0x11002c3f, 0x1400ffd0 },
{ 0x11002c40, 0x1400ffd0 },
{ 0x11002c41, 0x1400ffd0 },
{ 0x11002c42, 0x1400ffd0 },
{ 0x11002c43, 0x1400ffd0 },
{ 0x11002c44, 0x1400ffd0 },
{ 0x11002c45, 0x1400ffd0 },
{ 0x11002c46, 0x1400ffd0 },
{ 0x11002c47, 0x1400ffd0 },
{ 0x11002c48, 0x1400ffd0 },
{ 0x11002c49, 0x1400ffd0 },
{ 0x11002c4a, 0x1400ffd0 },
{ 0x11002c4b, 0x1400ffd0 },
{ 0x11002c4c, 0x1400ffd0 },
{ 0x11002c4d, 0x1400ffd0 },
{ 0x11002c4e, 0x1400ffd0 },
{ 0x11002c4f, 0x1400ffd0 },
{ 0x11002c50, 0x1400ffd0 },
{ 0x11002c51, 0x1400ffd0 },
{ 0x11002c52, 0x1400ffd0 },
{ 0x11002c53, 0x1400ffd0 },
{ 0x11002c54, 0x1400ffd0 },
{ 0x11002c55, 0x1400ffd0 },
{ 0x11002c56, 0x1400ffd0 },
{ 0x11002c57, 0x1400ffd0 },
{ 0x11002c58, 0x1400ffd0 },
{ 0x11002c59, 0x1400ffd0 },
{ 0x11002c5a, 0x1400ffd0 },
{ 0x11002c5b, 0x1400ffd0 },
{ 0x11002c5c, 0x1400ffd0 },
{ 0x11002c5d, 0x1400ffd0 },
{ 0x11002c5e, 0x1400ffd0 },
{ 0x0a002c80, 0x24000001 },
{ 0x0a002c81, 0x1400ffff },
{ 0x0a002c82, 0x24000001 },
{ 0x0a002c83, 0x1400ffff },
{ 0x0a002c84, 0x24000001 },
{ 0x0a002c85, 0x1400ffff },
{ 0x0a002c86, 0x24000001 },
{ 0x0a002c87, 0x1400ffff },
{ 0x0a002c88, 0x24000001 },
{ 0x0a002c89, 0x1400ffff },
{ 0x0a002c8a, 0x24000001 },
{ 0x0a002c8b, 0x1400ffff },
{ 0x0a002c8c, 0x24000001 },
{ 0x0a002c8d, 0x1400ffff },
{ 0x0a002c8e, 0x24000001 },
{ 0x0a002c8f, 0x1400ffff },
{ 0x0a002c90, 0x24000001 },
{ 0x0a002c91, 0x1400ffff },
{ 0x0a002c92, 0x24000001 },
{ 0x0a002c93, 0x1400ffff },
{ 0x0a002c94, 0x24000001 },
{ 0x0a002c95, 0x1400ffff },
{ 0x0a002c96, 0x24000001 },
{ 0x0a002c97, 0x1400ffff },
{ 0x0a002c98, 0x24000001 },
{ 0x0a002c99, 0x1400ffff },
{ 0x0a002c9a, 0x24000001 },
{ 0x0a002c9b, 0x1400ffff },
{ 0x0a002c9c, 0x24000001 },
{ 0x0a002c9d, 0x1400ffff },
{ 0x0a002c9e, 0x24000001 },
{ 0x0a002c9f, 0x1400ffff },
{ 0x0a002ca0, 0x24000001 },
{ 0x0a002ca1, 0x1400ffff },
{ 0x0a002ca2, 0x24000001 },
{ 0x0a002ca3, 0x1400ffff },
{ 0x0a002ca4, 0x24000001 },
{ 0x0a002ca5, 0x1400ffff },
{ 0x0a002ca6, 0x24000001 },
{ 0x0a002ca7, 0x1400ffff },
{ 0x0a002ca8, 0x24000001 },
{ 0x0a002ca9, 0x1400ffff },
{ 0x0a002caa, 0x24000001 },
{ 0x0a002cab, 0x1400ffff },
{ 0x0a002cac, 0x24000001 },
{ 0x0a002cad, 0x1400ffff },
{ 0x0a002cae, 0x24000001 },
{ 0x0a002caf, 0x1400ffff },
{ 0x0a002cb0, 0x24000001 },
{ 0x0a002cb1, 0x1400ffff },
{ 0x0a002cb2, 0x24000001 },
{ 0x0a002cb3, 0x1400ffff },
{ 0x0a002cb4, 0x24000001 },
{ 0x0a002cb5, 0x1400ffff },
{ 0x0a002cb6, 0x24000001 },
{ 0x0a002cb7, 0x1400ffff },
{ 0x0a002cb8, 0x24000001 },
{ 0x0a002cb9, 0x1400ffff },
{ 0x0a002cba, 0x24000001 },
{ 0x0a002cbb, 0x1400ffff },
{ 0x0a002cbc, 0x24000001 },
{ 0x0a002cbd, 0x1400ffff },
{ 0x0a002cbe, 0x24000001 },
{ 0x0a002cbf, 0x1400ffff },
{ 0x0a002cc0, 0x24000001 },
{ 0x0a002cc1, 0x1400ffff },
{ 0x0a002cc2, 0x24000001 },
{ 0x0a002cc3, 0x1400ffff },
{ 0x0a002cc4, 0x24000001 },
{ 0x0a002cc5, 0x1400ffff },
{ 0x0a002cc6, 0x24000001 },
{ 0x0a002cc7, 0x1400ffff },
{ 0x0a002cc8, 0x24000001 },
{ 0x0a002cc9, 0x1400ffff },
{ 0x0a002cca, 0x24000001 },
{ 0x0a002ccb, 0x1400ffff },
{ 0x0a002ccc, 0x24000001 },
{ 0x0a002ccd, 0x1400ffff },
{ 0x0a002cce, 0x24000001 },
{ 0x0a002ccf, 0x1400ffff },
{ 0x0a002cd0, 0x24000001 },
{ 0x0a002cd1, 0x1400ffff },
{ 0x0a002cd2, 0x24000001 },
{ 0x0a002cd3, 0x1400ffff },
{ 0x0a002cd4, 0x24000001 },
{ 0x0a002cd5, 0x1400ffff },
{ 0x0a002cd6, 0x24000001 },
{ 0x0a002cd7, 0x1400ffff },
{ 0x0a002cd8, 0x24000001 },
{ 0x0a002cd9, 0x1400ffff },
{ 0x0a002cda, 0x24000001 },
{ 0x0a002cdb, 0x1400ffff },
{ 0x0a002cdc, 0x24000001 },
{ 0x0a002cdd, 0x1400ffff },
{ 0x0a002cde, 0x24000001 },
{ 0x0a002cdf, 0x1400ffff },
{ 0x0a002ce0, 0x24000001 },
{ 0x0a002ce1, 0x1400ffff },
{ 0x0a002ce2, 0x24000001 },
{ 0x0a002ce3, 0x1400ffff },
{ 0x0a002ce4, 0x14000000 },
{ 0x0a802ce5, 0x68000005 },
{ 0x0a802cf9, 0x54000003 },
{ 0x0a002cfd, 0x3c000000 },
{ 0x0a802cfe, 0x54000001 },
{ 0x10002d00, 0x1400e3a0 },
{ 0x10002d01, 0x1400e3a0 },
{ 0x10002d02, 0x1400e3a0 },
{ 0x10002d03, 0x1400e3a0 },
{ 0x10002d04, 0x1400e3a0 },
{ 0x10002d05, 0x1400e3a0 },
{ 0x10002d06, 0x1400e3a0 },
{ 0x10002d07, 0x1400e3a0 },
{ 0x10002d08, 0x1400e3a0 },
{ 0x10002d09, 0x1400e3a0 },
{ 0x10002d0a, 0x1400e3a0 },
{ 0x10002d0b, 0x1400e3a0 },
{ 0x10002d0c, 0x1400e3a0 },
{ 0x10002d0d, 0x1400e3a0 },
{ 0x10002d0e, 0x1400e3a0 },
{ 0x10002d0f, 0x1400e3a0 },
{ 0x10002d10, 0x1400e3a0 },
{ 0x10002d11, 0x1400e3a0 },
{ 0x10002d12, 0x1400e3a0 },
{ 0x10002d13, 0x1400e3a0 },
{ 0x10002d14, 0x1400e3a0 },
{ 0x10002d15, 0x1400e3a0 },
{ 0x10002d16, 0x1400e3a0 },
{ 0x10002d17, 0x1400e3a0 },
{ 0x10002d18, 0x1400e3a0 },
{ 0x10002d19, 0x1400e3a0 },
{ 0x10002d1a, 0x1400e3a0 },
{ 0x10002d1b, 0x1400e3a0 },
{ 0x10002d1c, 0x1400e3a0 },
{ 0x10002d1d, 0x1400e3a0 },
{ 0x10002d1e, 0x1400e3a0 },
{ 0x10002d1f, 0x1400e3a0 },
{ 0x10002d20, 0x1400e3a0 },
{ 0x10002d21, 0x1400e3a0 },
{ 0x10002d22, 0x1400e3a0 },
{ 0x10002d23, 0x1400e3a0 },
{ 0x10002d24, 0x1400e3a0 },
{ 0x10002d25, 0x1400e3a0 },
{ 0x3a802d30, 0x1c000035 },
{ 0x3a002d6f, 0x18000000 },
{ 0x0f802d80, 0x1c000016 },
{ 0x0f802da0, 0x1c000006 },
{ 0x0f802da8, 0x1c000006 },
{ 0x0f802db0, 0x1c000006 },
{ 0x0f802db8, 0x1c000006 },
{ 0x0f802dc0, 0x1c000006 },
{ 0x0f802dc8, 0x1c000006 },
{ 0x0f802dd0, 0x1c000006 },
{ 0x0f802dd8, 0x1c000006 },
{ 0x09802e00, 0x54000001 },
{ 0x09002e02, 0x50000000 },
{ 0x09002e03, 0x4c000000 },
{ 0x09002e04, 0x50000000 },
{ 0x09002e05, 0x4c000000 },
{ 0x09802e06, 0x54000002 },
{ 0x09002e09, 0x50000000 },
{ 0x09002e0a, 0x4c000000 },
{ 0x09002e0b, 0x54000000 },
{ 0x09002e0c, 0x50000000 },
{ 0x09002e0d, 0x4c000000 },
{ 0x09802e0e, 0x54000008 },
{ 0x09002e17, 0x44000000 },
{ 0x09002e1c, 0x50000000 },
{ 0x09002e1d, 0x4c000000 },
{ 0x16802e80, 0x68000019 },
{ 0x16802e9b, 0x68000058 },
{ 0x16802f00, 0x680000d5 },
{ 0x09802ff0, 0x6800000b },
{ 0x09003000, 0x74000000 },
{ 0x09803001, 0x54000002 },
{ 0x09003004, 0x68000000 },
{ 0x16003005, 0x18000000 },
{ 0x09003006, 0x1c000000 },
{ 0x16003007, 0x38000000 },
{ 0x09003008, 0x58000000 },
{ 0x09003009, 0x48000000 },
{ 0x0900300a, 0x58000000 },
{ 0x0900300b, 0x48000000 },
{ 0x0900300c, 0x58000000 },
{ 0x0900300d, 0x48000000 },
{ 0x0900300e, 0x58000000 },
{ 0x0900300f, 0x48000000 },
{ 0x09003010, 0x58000000 },
{ 0x09003011, 0x48000000 },
{ 0x09803012, 0x68000001 },
{ 0x09003014, 0x58000000 },
{ 0x09003015, 0x48000000 },
{ 0x09003016, 0x58000000 },
{ 0x09003017, 0x48000000 },
{ 0x09003018, 0x58000000 },
{ 0x09003019, 0x48000000 },
{ 0x0900301a, 0x58000000 },
{ 0x0900301b, 0x48000000 },
{ 0x0900301c, 0x44000000 },
{ 0x0900301d, 0x58000000 },
{ 0x0980301e, 0x48000001 },
{ 0x09003020, 0x68000000 },
{ 0x16803021, 0x38000008 },
{ 0x1b80302a, 0x30000005 },
{ 0x09003030, 0x44000000 },
{ 0x09803031, 0x18000004 },
{ 0x09803036, 0x68000001 },
{ 0x16803038, 0x38000002 },
{ 0x1600303b, 0x18000000 },
{ 0x0900303c, 0x1c000000 },
{ 0x0900303d, 0x54000000 },
{ 0x0980303e, 0x68000001 },
{ 0x1a803041, 0x1c000055 },
{ 0x1b803099, 0x30000001 },
{ 0x0980309b, 0x60000001 },
{ 0x1a80309d, 0x18000001 },
{ 0x1a00309f, 0x1c000000 },
{ 0x090030a0, 0x44000000 },
{ 0x1d8030a1, 0x1c000059 },
{ 0x090030fb, 0x54000000 },
{ 0x098030fc, 0x18000002 },
{ 0x1d0030ff, 0x1c000000 },
{ 0x03803105, 0x1c000027 },
{ 0x17803131, 0x1c00005d },
{ 0x09803190, 0x68000001 },
{ 0x09803192, 0x3c000003 },
{ 0x09803196, 0x68000009 },
{ 0x038031a0, 0x1c000017 },
{ 0x098031c0, 0x6800000f },
{ 0x1d8031f0, 0x1c00000f },
{ 0x17803200, 0x6800001e },
{ 0x09803220, 0x3c000009 },
{ 0x0980322a, 0x68000019 },
{ 0x09003250, 0x68000000 },
{ 0x09803251, 0x3c00000e },
{ 0x17803260, 0x6800001f },
{ 0x09803280, 0x3c000009 },
{ 0x0980328a, 0x68000026 },
{ 0x098032b1, 0x3c00000e },
{ 0x098032c0, 0x6800003e },
{ 0x09803300, 0x680000ff },
{ 0x16803400, 0x1c0019b5 },
{ 0x09804dc0, 0x6800003f },
{ 0x16804e00, 0x1c0051bb },
{ 0x3c80a000, 0x1c000014 },
{ 0x3c00a015, 0x18000000 },
{ 0x3c80a016, 0x1c000476 },
{ 0x3c80a490, 0x68000036 },
{ 0x0980a700, 0x60000016 },
{ 0x3080a800, 0x1c000001 },
{ 0x3000a802, 0x28000000 },
{ 0x3080a803, 0x1c000002 },
{ 0x3000a806, 0x30000000 },
{ 0x3080a807, 0x1c000003 },
{ 0x3000a80b, 0x30000000 },
{ 0x3080a80c, 0x1c000016 },
{ 0x3080a823, 0x28000001 },
{ 0x3080a825, 0x30000001 },
{ 0x3000a827, 0x28000000 },
{ 0x3080a828, 0x68000003 },
{ 0x1780ac00, 0x1c002ba3 },
{ 0x0980d800, 0x1000037f },
{ 0x0980db80, 0x1000007f },
{ 0x0980dc00, 0x100003ff },
{ 0x0980e000, 0x0c0018ff },
{ 0x1680f900, 0x1c00012d },
{ 0x1680fa30, 0x1c00003a },
{ 0x1680fa70, 0x1c000069 },
{ 0x2180fb00, 0x14000006 },
{ 0x0180fb13, 0x14000004 },
{ 0x1900fb1d, 0x1c000000 },
{ 0x1900fb1e, 0x30000000 },
{ 0x1980fb1f, 0x1c000009 },
{ 0x1900fb29, 0x64000000 },
{ 0x1980fb2a, 0x1c00000c },
{ 0x1980fb38, 0x1c000004 },
{ 0x1900fb3e, 0x1c000000 },
{ 0x1980fb40, 0x1c000001 },
{ 0x1980fb43, 0x1c000001 },
{ 0x1980fb46, 0x1c00006b },
{ 0x0080fbd3, 0x1c00016a },
{ 0x0900fd3e, 0x58000000 },
{ 0x0900fd3f, 0x48000000 },
{ 0x0080fd50, 0x1c00003f },
{ 0x0080fd92, 0x1c000035 },
{ 0x0080fdf0, 0x1c00000b },
{ 0x0000fdfc, 0x5c000000 },
{ 0x0900fdfd, 0x68000000 },
{ 0x1b80fe00, 0x3000000f },
{ 0x0980fe10, 0x54000006 },
{ 0x0900fe17, 0x58000000 },
{ 0x0900fe18, 0x48000000 },
{ 0x0900fe19, 0x54000000 },
{ 0x1b80fe20, 0x30000003 },
{ 0x0900fe30, 0x54000000 },
{ 0x0980fe31, 0x44000001 },
{ 0x0980fe33, 0x40000001 },
{ 0x0900fe35, 0x58000000 },
{ 0x0900fe36, 0x48000000 },
{ 0x0900fe37, 0x58000000 },
{ 0x0900fe38, 0x48000000 },
{ 0x0900fe39, 0x58000000 },
{ 0x0900fe3a, 0x48000000 },
{ 0x0900fe3b, 0x58000000 },
{ 0x0900fe3c, 0x48000000 },
{ 0x0900fe3d, 0x58000000 },
{ 0x0900fe3e, 0x48000000 },
{ 0x0900fe3f, 0x58000000 },
{ 0x0900fe40, 0x48000000 },
{ 0x0900fe41, 0x58000000 },
{ 0x0900fe42, 0x48000000 },
{ 0x0900fe43, 0x58000000 },
{ 0x0900fe44, 0x48000000 },
{ 0x0980fe45, 0x54000001 },
{ 0x0900fe47, 0x58000000 },
{ 0x0900fe48, 0x48000000 },
{ 0x0980fe49, 0x54000003 },
{ 0x0980fe4d, 0x40000002 },
{ 0x0980fe50, 0x54000002 },
{ 0x0980fe54, 0x54000003 },
{ 0x0900fe58, 0x44000000 },
{ 0x0900fe59, 0x58000000 },
{ 0x0900fe5a, 0x48000000 },
{ 0x0900fe5b, 0x58000000 },
{ 0x0900fe5c, 0x48000000 },
{ 0x0900fe5d, 0x58000000 },
{ 0x0900fe5e, 0x48000000 },
{ 0x0980fe5f, 0x54000002 },
{ 0x0900fe62, 0x64000000 },
{ 0x0900fe63, 0x44000000 },
{ 0x0980fe64, 0x64000002 },
{ 0x0900fe68, 0x54000000 },
{ 0x0900fe69, 0x5c000000 },
{ 0x0980fe6a, 0x54000001 },
{ 0x0080fe70, 0x1c000004 },
{ 0x0080fe76, 0x1c000086 },
{ 0x0900feff, 0x04000000 },
{ 0x0980ff01, 0x54000002 },
{ 0x0900ff04, 0x5c000000 },
{ 0x0980ff05, 0x54000002 },
{ 0x0900ff08, 0x58000000 },
{ 0x0900ff09, 0x48000000 },
{ 0x0900ff0a, 0x54000000 },
{ 0x0900ff0b, 0x64000000 },
{ 0x0900ff0c, 0x54000000 },
{ 0x0900ff0d, 0x44000000 },
{ 0x0980ff0e, 0x54000001 },
{ 0x0980ff10, 0x34000009 },
{ 0x0980ff1a, 0x54000001 },
{ 0x0980ff1c, 0x64000002 },
{ 0x0980ff1f, 0x54000001 },
{ 0x2100ff21, 0x24000020 },
{ 0x2100ff22, 0x24000020 },
{ 0x2100ff23, 0x24000020 },
{ 0x2100ff24, 0x24000020 },
{ 0x2100ff25, 0x24000020 },
{ 0x2100ff26, 0x24000020 },
{ 0x2100ff27, 0x24000020 },
{ 0x2100ff28, 0x24000020 },
{ 0x2100ff29, 0x24000020 },
{ 0x2100ff2a, 0x24000020 },
{ 0x2100ff2b, 0x24000020 },
{ 0x2100ff2c, 0x24000020 },
{ 0x2100ff2d, 0x24000020 },
{ 0x2100ff2e, 0x24000020 },
{ 0x2100ff2f, 0x24000020 },
{ 0x2100ff30, 0x24000020 },
{ 0x2100ff31, 0x24000020 },
{ 0x2100ff32, 0x24000020 },
{ 0x2100ff33, 0x24000020 },
{ 0x2100ff34, 0x24000020 },
{ 0x2100ff35, 0x24000020 },
{ 0x2100ff36, 0x24000020 },
{ 0x2100ff37, 0x24000020 },
{ 0x2100ff38, 0x24000020 },
{ 0x2100ff39, 0x24000020 },
{ 0x2100ff3a, 0x24000020 },
{ 0x0900ff3b, 0x58000000 },
{ 0x0900ff3c, 0x54000000 },
{ 0x0900ff3d, 0x48000000 },
{ 0x0900ff3e, 0x60000000 },
{ 0x0900ff3f, 0x40000000 },
{ 0x0900ff40, 0x60000000 },
{ 0x2100ff41, 0x1400ffe0 },
{ 0x2100ff42, 0x1400ffe0 },
{ 0x2100ff43, 0x1400ffe0 },
{ 0x2100ff44, 0x1400ffe0 },
{ 0x2100ff45, 0x1400ffe0 },
{ 0x2100ff46, 0x1400ffe0 },
{ 0x2100ff47, 0x1400ffe0 },
{ 0x2100ff48, 0x1400ffe0 },
{ 0x2100ff49, 0x1400ffe0 },
{ 0x2100ff4a, 0x1400ffe0 },
{ 0x2100ff4b, 0x1400ffe0 },
{ 0x2100ff4c, 0x1400ffe0 },
{ 0x2100ff4d, 0x1400ffe0 },
{ 0x2100ff4e, 0x1400ffe0 },
{ 0x2100ff4f, 0x1400ffe0 },
{ 0x2100ff50, 0x1400ffe0 },
{ 0x2100ff51, 0x1400ffe0 },
{ 0x2100ff52, 0x1400ffe0 },
{ 0x2100ff53, 0x1400ffe0 },
{ 0x2100ff54, 0x1400ffe0 },
{ 0x2100ff55, 0x1400ffe0 },
{ 0x2100ff56, 0x1400ffe0 },
{ 0x2100ff57, 0x1400ffe0 },
{ 0x2100ff58, 0x1400ffe0 },
{ 0x2100ff59, 0x1400ffe0 },
{ 0x2100ff5a, 0x1400ffe0 },
{ 0x0900ff5b, 0x58000000 },
{ 0x0900ff5c, 0x64000000 },
{ 0x0900ff5d, 0x48000000 },
{ 0x0900ff5e, 0x64000000 },
{ 0x0900ff5f, 0x58000000 },
{ 0x0900ff60, 0x48000000 },
{ 0x0900ff61, 0x54000000 },
{ 0x0900ff62, 0x58000000 },
{ 0x0900ff63, 0x48000000 },
{ 0x0980ff64, 0x54000001 },
{ 0x1d80ff66, 0x1c000009 },
{ 0x0900ff70, 0x18000000 },
{ 0x1d80ff71, 0x1c00002c },
{ 0x0980ff9e, 0x18000001 },
{ 0x1780ffa0, 0x1c00001e },
{ 0x1780ffc2, 0x1c000005 },
{ 0x1780ffca, 0x1c000005 },
{ 0x1780ffd2, 0x1c000005 },
{ 0x1780ffda, 0x1c000002 },
{ 0x0980ffe0, 0x5c000001 },
{ 0x0900ffe2, 0x64000000 },
{ 0x0900ffe3, 0x60000000 },
{ 0x0900ffe4, 0x68000000 },
{ 0x0980ffe5, 0x5c000001 },
{ 0x0900ffe8, 0x68000000 },
{ 0x0980ffe9, 0x64000003 },
{ 0x0980ffed, 0x68000001 },
{ 0x0980fff9, 0x04000002 },
{ 0x0980fffc, 0x68000001 },
{ 0x23810000, 0x1c00000b },
{ 0x2381000d, 0x1c000019 },
{ 0x23810028, 0x1c000012 },
{ 0x2381003c, 0x1c000001 },
{ 0x2381003f, 0x1c00000e },
{ 0x23810050, 0x1c00000d },
{ 0x23810080, 0x1c00007a },
{ 0x09810100, 0x54000001 },
{ 0x09010102, 0x68000000 },
{ 0x09810107, 0x3c00002c },
{ 0x09810137, 0x68000008 },
{ 0x13810140, 0x38000034 },
{ 0x13810175, 0x3c000003 },
{ 0x13810179, 0x68000010 },
{ 0x1301018a, 0x3c000000 },
{ 0x29810300, 0x1c00001e },
{ 0x29810320, 0x3c000003 },
{ 0x12810330, 0x1c000019 },
{ 0x1201034a, 0x38000000 },
{ 0x3b810380, 0x1c00001d },
{ 0x3b01039f, 0x54000000 },
{ 0x2a8103a0, 0x1c000023 },
{ 0x2a8103c8, 0x1c000007 },
{ 0x2a0103d0, 0x68000000 },
{ 0x2a8103d1, 0x38000004 },
{ 0x0d010400, 0x24000028 },
{ 0x0d010401, 0x24000028 },
{ 0x0d010402, 0x24000028 },
{ 0x0d010403, 0x24000028 },
{ 0x0d010404, 0x24000028 },
{ 0x0d010405, 0x24000028 },
{ 0x0d010406, 0x24000028 },
{ 0x0d010407, 0x24000028 },
{ 0x0d010408, 0x24000028 },
{ 0x0d010409, 0x24000028 },
{ 0x0d01040a, 0x24000028 },
{ 0x0d01040b, 0x24000028 },
{ 0x0d01040c, 0x24000028 },
{ 0x0d01040d, 0x24000028 },
{ 0x0d01040e, 0x24000028 },
{ 0x0d01040f, 0x24000028 },
{ 0x0d010410, 0x24000028 },
{ 0x0d010411, 0x24000028 },
{ 0x0d010412, 0x24000028 },
{ 0x0d010413, 0x24000028 },
{ 0x0d010414, 0x24000028 },
{ 0x0d010415, 0x24000028 },
{ 0x0d010416, 0x24000028 },
{ 0x0d010417, 0x24000028 },
{ 0x0d010418, 0x24000028 },
{ 0x0d010419, 0x24000028 },
{ 0x0d01041a, 0x24000028 },
{ 0x0d01041b, 0x24000028 },
{ 0x0d01041c, 0x24000028 },
{ 0x0d01041d, 0x24000028 },
{ 0x0d01041e, 0x24000028 },
{ 0x0d01041f, 0x24000028 },
{ 0x0d010420, 0x24000028 },
{ 0x0d010421, 0x24000028 },
{ 0x0d010422, 0x24000028 },
{ 0x0d010423, 0x24000028 },
{ 0x0d010424, 0x24000028 },
{ 0x0d010425, 0x24000028 },
{ 0x0d010426, 0x24000028 },
{ 0x0d010427, 0x24000028 },
{ 0x0d010428, 0x1400ffd8 },
{ 0x0d010429, 0x1400ffd8 },
{ 0x0d01042a, 0x1400ffd8 },
{ 0x0d01042b, 0x1400ffd8 },
{ 0x0d01042c, 0x1400ffd8 },
{ 0x0d01042d, 0x1400ffd8 },
{ 0x0d01042e, 0x1400ffd8 },
{ 0x0d01042f, 0x1400ffd8 },
{ 0x0d010430, 0x1400ffd8 },
{ 0x0d010431, 0x1400ffd8 },
{ 0x0d010432, 0x1400ffd8 },
{ 0x0d010433, 0x1400ffd8 },
{ 0x0d010434, 0x1400ffd8 },
{ 0x0d010435, 0x1400ffd8 },
{ 0x0d010436, 0x1400ffd8 },
{ 0x0d010437, 0x1400ffd8 },
{ 0x0d010438, 0x1400ffd8 },
{ 0x0d010439, 0x1400ffd8 },
{ 0x0d01043a, 0x1400ffd8 },
{ 0x0d01043b, 0x1400ffd8 },
{ 0x0d01043c, 0x1400ffd8 },
{ 0x0d01043d, 0x1400ffd8 },
{ 0x0d01043e, 0x1400ffd8 },
{ 0x0d01043f, 0x1400ffd8 },
{ 0x0d010440, 0x1400ffd8 },
{ 0x0d010441, 0x1400ffd8 },
{ 0x0d010442, 0x1400ffd8 },
{ 0x0d010443, 0x1400ffd8 },
{ 0x0d010444, 0x1400ffd8 },
{ 0x0d010445, 0x1400ffd8 },
{ 0x0d010446, 0x1400ffd8 },
{ 0x0d010447, 0x1400ffd8 },
{ 0x0d010448, 0x1400ffd8 },
{ 0x0d010449, 0x1400ffd8 },
{ 0x0d01044a, 0x1400ffd8 },
{ 0x0d01044b, 0x1400ffd8 },
{ 0x0d01044c, 0x1400ffd8 },
{ 0x0d01044d, 0x1400ffd8 },
{ 0x0d01044e, 0x1400ffd8 },
{ 0x0d01044f, 0x1400ffd8 },
{ 0x2e810450, 0x1c00004d },
{ 0x2c8104a0, 0x34000009 },
{ 0x0b810800, 0x1c000005 },
{ 0x0b010808, 0x1c000000 },
{ 0x0b81080a, 0x1c00002b },
{ 0x0b810837, 0x1c000001 },
{ 0x0b01083c, 0x1c000000 },
{ 0x0b01083f, 0x1c000000 },
{ 0x1e010a00, 0x1c000000 },
{ 0x1e810a01, 0x30000002 },
{ 0x1e810a05, 0x30000001 },
{ 0x1e810a0c, 0x30000003 },
{ 0x1e810a10, 0x1c000003 },
{ 0x1e810a15, 0x1c000002 },
{ 0x1e810a19, 0x1c00001a },
{ 0x1e810a38, 0x30000002 },
{ 0x1e010a3f, 0x30000000 },
{ 0x1e810a40, 0x3c000007 },
{ 0x1e810a50, 0x54000008 },
{ 0x0981d000, 0x680000f5 },
{ 0x0981d100, 0x68000026 },
{ 0x0981d12a, 0x6800003a },
{ 0x0981d165, 0x28000001 },
{ 0x1b81d167, 0x30000002 },
{ 0x0981d16a, 0x68000002 },
{ 0x0981d16d, 0x28000005 },
{ 0x0981d173, 0x04000007 },
{ 0x1b81d17b, 0x30000007 },
{ 0x0981d183, 0x68000001 },
{ 0x1b81d185, 0x30000006 },
{ 0x0981d18c, 0x6800001d },
{ 0x1b81d1aa, 0x30000003 },
{ 0x0981d1ae, 0x6800002f },
{ 0x1381d200, 0x68000041 },
{ 0x1381d242, 0x30000002 },
{ 0x1301d245, 0x68000000 },
{ 0x0981d300, 0x68000056 },
{ 0x0981d400, 0x24000019 },
{ 0x0981d41a, 0x14000019 },
{ 0x0981d434, 0x24000019 },
{ 0x0981d44e, 0x14000006 },
{ 0x0981d456, 0x14000011 },
{ 0x0981d468, 0x24000019 },
{ 0x0981d482, 0x14000019 },
{ 0x0901d49c, 0x24000000 },
{ 0x0981d49e, 0x24000001 },
{ 0x0901d4a2, 0x24000000 },
{ 0x0981d4a5, 0x24000001 },
{ 0x0981d4a9, 0x24000003 },
{ 0x0981d4ae, 0x24000007 },
{ 0x0981d4b6, 0x14000003 },
{ 0x0901d4bb, 0x14000000 },
{ 0x0981d4bd, 0x14000006 },
{ 0x0981d4c5, 0x1400000a },
{ 0x0981d4d0, 0x24000019 },
{ 0x0981d4ea, 0x14000019 },
{ 0x0981d504, 0x24000001 },
{ 0x0981d507, 0x24000003 },
{ 0x0981d50d, 0x24000007 },
{ 0x0981d516, 0x24000006 },
{ 0x0981d51e, 0x14000019 },
{ 0x0981d538, 0x24000001 },
{ 0x0981d53b, 0x24000003 },
{ 0x0981d540, 0x24000004 },
{ 0x0901d546, 0x24000000 },
{ 0x0981d54a, 0x24000006 },
{ 0x0981d552, 0x14000019 },
{ 0x0981d56c, 0x24000019 },
{ 0x0981d586, 0x14000019 },
{ 0x0981d5a0, 0x24000019 },
{ 0x0981d5ba, 0x14000019 },
{ 0x0981d5d4, 0x24000019 },
{ 0x0981d5ee, 0x14000019 },
{ 0x0981d608, 0x24000019 },
{ 0x0981d622, 0x14000019 },
{ 0x0981d63c, 0x24000019 },
{ 0x0981d656, 0x14000019 },
{ 0x0981d670, 0x24000019 },
{ 0x0981d68a, 0x1400001b },
{ 0x0981d6a8, 0x24000018 },
{ 0x0901d6c1, 0x64000000 },
{ 0x0981d6c2, 0x14000018 },
{ 0x0901d6db, 0x64000000 },
{ 0x0981d6dc, 0x14000005 },
{ 0x0981d6e2, 0x24000018 },
{ 0x0901d6fb, 0x64000000 },
{ 0x0981d6fc, 0x14000018 },
{ 0x0901d715, 0x64000000 },
{ 0x0981d716, 0x14000005 },
{ 0x0981d71c, 0x24000018 },
{ 0x0901d735, 0x64000000 },
{ 0x0981d736, 0x14000018 },
{ 0x0901d74f, 0x64000000 },
{ 0x0981d750, 0x14000005 },
{ 0x0981d756, 0x24000018 },
{ 0x0901d76f, 0x64000000 },
{ 0x0981d770, 0x14000018 },
{ 0x0901d789, 0x64000000 },
{ 0x0981d78a, 0x14000005 },
{ 0x0981d790, 0x24000018 },
{ 0x0901d7a9, 0x64000000 },
{ 0x0981d7aa, 0x14000018 },
{ 0x0901d7c3, 0x64000000 },
{ 0x0981d7c4, 0x14000005 },
{ 0x0981d7ce, 0x34000031 },
{ 0x16820000, 0x1c00a6d6 },
{ 0x1682f800, 0x1c00021d },
{ 0x090e0001, 0x04000000 },
{ 0x098e0020, 0x0400005f },
{ 0x1b8e0100, 0x300000ef },
{ 0x098f0000, 0x0c00fffd },
{ 0x09900000, 0x0c00fffd },
};
tools/v8.xcodeproj/project.pbxproj
View file @ bbc2a73f
......@@ -32,7 +32,6 @@
890A14020EE9C4B400E49346 /* regexp-macro-assembler-irregexp.cc in Sources */ = {isa = PBXBuildFile; fileRef = 89A15C750EE466D000B48DEB /* regexp-macro-assembler-irregexp.cc */; };
890A14030EE9C4B500E49346 /* regexp-macro-assembler-tracer.cc in Sources */ = {isa = PBXBuildFile; fileRef = 89A15C770EE466D000B48DEB /* regexp-macro-assembler-tracer.cc */; };
890A14040EE9C4B700E49346 /* regexp-macro-assembler.cc in Sources */ = {isa = PBXBuildFile; fileRef = 89A15C790EE466D000B48DEB /* regexp-macro-assembler.cc */; };
893988060F2A35FA007D5254 /* libjscre.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 897FF1BF0E719CB600D62E90 /* libjscre.a */; };
893988070F2A35FA007D5254 /* libv8.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 8970F2F00E719FB2006AE7B5 /* libv8.a */; };
8939880D0F2A362A007D5254 /* d8.cc in Sources */ = {isa = PBXBuildFile; fileRef = 89A15C920EE46A1700B48DEB /* d8.cc */; };
893988160F2A3688007D5254 /* d8-debug.cc in Sources */ = {isa = PBXBuildFile; fileRef = 893988150F2A3686007D5254 /* d8-debug.cc */; };
......@@ -44,7 +43,6 @@
89495E490E79FC23001F68C3 /* compilation-cache.cc in Sources */ = {isa = PBXBuildFile; fileRef = 89495E460E79FC23001F68C3 /* compilation-cache.cc */; };
896FD03A0E78D717003DFB6A /* libv8-arm.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 89F23C870E78D5B2006B2466 /* libv8-arm.a */; };
897F767F0E71B690007ACF34 /* shell.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1B50E719C0900D62E90 /* shell.cc */; };
897F76840E71B6B1007ACF34 /* libjscre.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 897FF1BF0E719CB600D62E90 /* libjscre.a */; };
897F76850E71B6B1007ACF34 /* libv8.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 8970F2F00E719FB2006AE7B5 /* libv8.a */; };
897FF1C40E719D6B00D62E90 /* pcre_compile.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EA0E719B3500D62E90 /* pcre_compile.cpp */; };
897FF1C50E719D6E00D62E90 /* pcre_exec.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EB0E719B3500D62E90 /* pcre_exec.cpp */; };
......@@ -184,7 +182,6 @@
89F23C810E78D5B2006B2466 /* variables.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF19F0E719B8F00D62E90 /* variables.cc */; };
89F23C820E78D5B2006B2466 /* zone.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1A20E719B8F00D62E90 /* zone.cc */; };
89F23C8E0E78D5B6006B2466 /* shell.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1B50E719C0900D62E90 /* shell.cc */; };
89F23C900E78D5B6006B2466 /* libjscre.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 897FF1BF0E719CB600D62E90 /* libjscre.a */; };
89F23C970E78D5E3006B2466 /* assembler-arm.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0FE0E719B8F00D62E90 /* assembler-arm.cc */; };
89F23C980E78D5E7006B2466 /* builtins-arm.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1090E719B8F00D62E90 /* builtins-arm.cc */; };
89F23C990E78D5E9006B2466 /* codegen-arm.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1140E719B8F00D62E90 /* codegen-arm.cc */; };
......@@ -212,20 +209,6 @@
remoteGlobalIDString = 897F76790E71B4CC007ACF34;
remoteInfo = v8_shell;
};
7BF8919A0E7309AD000BAF8A /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
proxyType = 1;
remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
remoteInfo = jscre;
};
893988000F2A35FA007D5254 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
proxyType = 1;
remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
remoteInfo = jscre;
};
893988020F2A35FA007D5254 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
......@@ -261,13 +244,6 @@
remoteGlobalIDString = 89F23C880E78D5B6006B2466;
remoteInfo = "v8_shell-arm";
};
897F76800E71B6AC007ACF34 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
proxyType = 1;
remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
remoteInfo = jscre;
};
897F76820E71B6AC007ACF34 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
......@@ -275,13 +251,6 @@
remoteGlobalIDString = 8970F2EF0E719FB2006AE7B5;
remoteInfo = v8;
};
89F23C8A0E78D5B6006B2466 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 8915B8680E719336009C4E19 /* Project object */;
proxyType = 1;
remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
remoteInfo = jscre;
};
/* End PBXContainerItemProxy section */
/* Begin PBXFileReference section */
......@@ -506,7 +475,6 @@
897FF1B50E719C0900D62E90 /* shell.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = shell.cc; sourceTree = "<group>"; };
897FF1B60E719C2300D62E90 /* js2c.py */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.python; path = js2c.py; sourceTree = "<group>"; };
897FF1B70E719C2E00D62E90 /* macros.py */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.python; name = macros.py; path = ../src/macros.py; sourceTree = "<group>"; };
897FF1BF0E719CB600D62E90 /* libjscre.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libjscre.a; sourceTree = BUILT_PRODUCTS_DIR; };
898BD20C0EF6CC850068B00A /* debug-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "debug-arm.cc"; sourceTree = "<group>"; };
898BD20D0EF6CC850068B00A /* debug-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "debug-ia32.cc"; sourceTree = "<group>"; };
89A15C630EE4661A00B48DEB /* bytecodes-irregexp.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "bytecodes-irregexp.h"; sourceTree = "<group>"; };
......@@ -539,7 +507,6 @@
isa = PBXFrameworksBuildPhase;
buildActionMask = 2147483647;
files = (
893988060F2A35FA007D5254 /* libjscre.a in Frameworks */,
893988070F2A35FA007D5254 /* libv8.a in Frameworks */,
);
runOnlyForDeploymentPostprocessing = 0;
......@@ -555,7 +522,6 @@
isa = PBXFrameworksBuildPhase;
buildActionMask = 2147483647;
files = (
897F76840E71B6B1007ACF34 /* libjscre.a in Frameworks */,
897F76850E71B6B1007ACF34 /* libv8.a in Frameworks */,
);
runOnlyForDeploymentPostprocessing = 0;
......@@ -578,7 +544,6 @@
isa = PBXFrameworksBuildPhase;
buildActionMask = 2147483647;
files = (
89F23C900E78D5B6006B2466 /* libjscre.a in Frameworks */,
896FD03A0E78D717003DFB6A /* libv8-arm.a in Frameworks */,
);
runOnlyForDeploymentPostprocessing = 0;
......@@ -855,7 +820,6 @@
isa = PBXGroup;
children = (
897FF0DF0E719B3400D62E90 /* dtoa */,
897FF0E20E719B3500D62E90 /* jscre */,
);
path = third_party;
sourceTree = "<group>";
......@@ -869,28 +833,6 @@
path = dtoa;
sourceTree = "<group>";
};
897FF0E20E719B3500D62E90 /* jscre */ = {
isa = PBXGroup;
children = (
897FF0E30E719B3500D62E90 /* ASCIICType.h */,
897FF0E40E719B3500D62E90 /* AUTHORS */,
897FF0E50E719B3500D62E90 /* config.h */,
897FF0E60E719B3500D62E90 /* COPYING */,
897FF0E70E719B3500D62E90 /* LICENSE */,
897FF0E80E719B3500D62E90 /* pcre.h */,
897FF0E90E719B3500D62E90 /* pcre_chartables.c */,
897FF0EA0E719B3500D62E90 /* pcre_compile.cpp */,
897FF0EB0E719B3500D62E90 /* pcre_exec.cpp */,
897FF0EC0E719B3500D62E90 /* pcre_internal.h */,
897FF0ED0E719B3500D62E90 /* pcre_tables.cpp */,
897FF0EE0E719B3500D62E90 /* pcre_ucp_searchfuncs.cpp */,
897FF0EF0E719B3500D62E90 /* pcre_xclass.cpp */,
897FF0F00E719B3500D62E90 /* ucpinternal.h */,
897FF0F10E719B3500D62E90 /* ucptable.cpp */,
);
path = jscre;
sourceTree = "<group>";
};
897FF1B30E719BCE00D62E90 /* samples */ = {
isa = PBXGroup;
children = (
......@@ -917,7 +859,6 @@
897FF1C00E719CB600D62E90 /* Products */ = {
isa = PBXGroup;
children = (
897FF1BF0E719CB600D62E90 /* libjscre.a */,
8970F2F00E719FB2006AE7B5 /* libv8.a */,
897F767A0E71B4CC007ACF34 /* v8_shell */,
89F23C870E78D5B2006B2466 /* libv8-arm.a */,
......@@ -993,22 +934,6 @@
productReference = 897F767A0E71B4CC007ACF34 /* v8_shell */;
productType = "com.apple.product-type.tool";
};
897FF1BE0E719CB600D62E90 /* jscre */ = {
isa = PBXNativeTarget;
buildConfigurationList = 897FF1C30E719CB600D62E90 /* Build configuration list for PBXNativeTarget "jscre" */;
buildPhases = (
897FF1BC0E719CB600D62E90 /* Sources */,
897FF1BD0E719CB600D62E90 /* Frameworks */,
);
buildRules = (
);
dependencies = (
);
name = jscre;
productName = jscre;
productReference = 897FF1BF0E719CB600D62E90 /* libjscre.a */;
productType = "com.apple.product-type.library.static";
};
89F23C3C0E78D5B2006B2466 /* v8-arm */ = {
isa = PBXNativeTarget;
buildConfigurationList = 89F23C840E78D5B2006B2466 /* Build configuration list for PBXNativeTarget "v8-arm" */;
......@@ -1058,7 +983,6 @@
projectRoot = ..;
targets = (
7BF891930E73098D000BAF8A /* All */,
897FF1BE0E719CB600D62E90 /* jscre */,
8970F2EF0E719FB2006AE7B5 /* v8 */,
897F76790E71B4CC007ACF34 /* v8_shell */,
893987FE0F2A35FA007D5254 /* d8_shell */,
......@@ -1329,16 +1253,6 @@
target = 897F76790E71B4CC007ACF34 /* v8_shell */;
targetProxy = 7BF891980E73099F000BAF8A /* PBXContainerItemProxy */;
};
7BF8919B0E7309AD000BAF8A /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 897FF1BE0E719CB600D62E90 /* jscre */;
targetProxy = 7BF8919A0E7309AD000BAF8A /* PBXContainerItemProxy */;
};
893987FF0F2A35FA007D5254 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 897FF1BE0E719CB600D62E90 /* jscre */;
targetProxy = 893988000F2A35FA007D5254 /* PBXContainerItemProxy */;
};
893988010F2A35FA007D5254 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 8970F2EF0E719FB2006AE7B5 /* v8 */;
......@@ -1364,21 +1278,11 @@
target = 89F23C880E78D5B6006B2466 /* v8_shell-arm */;
targetProxy = 896FD03F0E78D735003DFB6A /* PBXContainerItemProxy */;
};
897F76810E71B6AC007ACF34 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 897FF1BE0E719CB600D62E90 /* jscre */;
targetProxy = 897F76800E71B6AC007ACF34 /* PBXContainerItemProxy */;
};
897F76830E71B6AC007ACF34 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 8970F2EF0E719FB2006AE7B5 /* v8 */;
targetProxy = 897F76820E71B6AC007ACF34 /* PBXContainerItemProxy */;
};
89F23C890E78D5B6006B2466 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 897FF1BE0E719CB600D62E90 /* jscre */;
targetProxy = 89F23C8A0E78D5B6006B2466 /* PBXContainerItemProxy */;
};
/* End PBXTargetDependency section */
/* Begin XCBuildConfiguration section */
......@@ -1525,36 +1429,6 @@
};
name = Release;
};
897FF1C10E719CB600D62E90 /* Debug */ = {
isa = XCBuildConfiguration;
buildSettings = {
DEPLOYMENT_POSTPROCESSING = NO;
GCC_PREPROCESSOR_DEFINITIONS = (
"$(GCC_PREPROCESSOR_DEFINITIONS)",
SUPPORT_UTF8,
SUPPORT_UCP,
NO_RECURSE,
);
PRODUCT_NAME = jscre;
STRIP_STYLE = debugging;
};
name = Debug;
};
897FF1C20E719CB600D62E90 /* Release */ = {
isa = XCBuildConfiguration;
buildSettings = {
DEPLOYMENT_POSTPROCESSING = NO;
GCC_PREPROCESSOR_DEFINITIONS = (
"$(GCC_PREPROCESSOR_DEFINITIONS)",
SUPPORT_UTF8,
SUPPORT_UCP,
NO_RECURSE,
);
PRODUCT_NAME = jscre;
STRIP_STYLE = debugging;
};
name = Release;
};
89F23C850E78D5B2006B2466 /* Debug */ = {
isa = XCBuildConfiguration;
buildSettings = {
......@@ -1649,15 +1523,6 @@
defaultConfigurationIsVisible = 0;
defaultConfigurationName = Release;
};
897FF1C30E719CB600D62E90 /* Build configuration list for PBXNativeTarget "jscre" */ = {
isa = XCConfigurationList;
buildConfigurations = (
897FF1C10E719CB600D62E90 /* Debug */,
897FF1C20E719CB600D62E90 /* Release */,
);
defaultConfigurationIsVisible = 0;
defaultConfigurationName = Release;
};
89F23C840E78D5B2006B2466 /* Build configuration list for PBXNativeTarget "v8-arm" */ = {
isa = XCConfigurationList;
buildConfigurations = (
......
tools/visual_studio/README.txt
View file @ bbc2a73f
......@@ -8,8 +8,7 @@ be performed by Visual Studio.
v8_base.vcproj
--------------
Base V8 library containing all the V8 code but no JavaScript library code. This
includes third party code for regular expression handling (jscre) and
string/number convertions (dtoa).
includes third party code for string/number convertions (dtoa).
v8.vcproj
---------
......
tools/visual_studio/v8_base.vcproj
View file @ bbc2a73f
......@@ -121,114 +121,6 @@
<References>
</References>
<Files>
<Filter
Name="jscre"
>
<File
RelativePath="..\..\src\third_party\jscre\pcre_compile.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_exec.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_internal.h"
>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_tables.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_ucp_searchfuncs.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_xclass.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
</Filter>
<Filter
Name="dtoa"
>
......
tools/visual_studio/v8_base_arm.vcproj
View file @ bbc2a73f
......@@ -121,114 +121,6 @@
<References>
</References>
<Files>
<Filter
Name="jscre"
>
<File
RelativePath="..\..\src\third_party\jscre\pcre_compile.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_exec.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_internal.h"
>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_tables.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_ucp_searchfuncs.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
<File
RelativePath="..\..\src\third_party\jscre\pcre_xclass.cpp"
>
<FileConfiguration
Name="Debug|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
<FileConfiguration
Name="Release|Win32"
>
<Tool
Name="VCCLCompilerTool"
UndefinePreprocessorDefinitions="DEBUG"
/>
</FileConfiguration>
</File>
</Filter>
<Filter
Name="dtoa"
>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment