OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 | 5 |
6 #ifndef V8_BYTECODES_IRREGEXP_H_ | 6 #ifndef V8_REGEXP_BYTECODES_IRREGEXP_H_ |
7 #define V8_BYTECODES_IRREGEXP_H_ | 7 #define V8_REGEXP_BYTECODES_IRREGEXP_H_ |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 | 11 |
12 | 12 |
13 const int BYTECODE_MASK = 0xff; | 13 const int BYTECODE_MASK = 0xff; |
14 // The first argument is packed in with the byte code in one word, but so it | 14 // The first argument is packed in with the byte code in one word, but so it |
15 // has 24 bits, but it can be positive and negative so only use 23 bits for | 15 // has 24 bits, but it can be positive and negative so only use 23 bits for |
16 // positive values. | 16 // positive values. |
17 const unsigned int MAX_FIRST_ARG = 0x7fffffu; | 17 const unsigned int MAX_FIRST_ARG = 0x7fffffu; |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
71 static const int BC_##name = code; | 71 static const int BC_##name = code; |
72 BYTECODE_ITERATOR(DECLARE_BYTECODES) | 72 BYTECODE_ITERATOR(DECLARE_BYTECODES) |
73 #undef DECLARE_BYTECODES | 73 #undef DECLARE_BYTECODES |
74 | 74 |
75 #define DECLARE_BYTECODE_LENGTH(name, code, length) \ | 75 #define DECLARE_BYTECODE_LENGTH(name, code, length) \ |
76 static const int BC_##name##_LENGTH = length; | 76 static const int BC_##name##_LENGTH = length; |
77 BYTECODE_ITERATOR(DECLARE_BYTECODE_LENGTH) | 77 BYTECODE_ITERATOR(DECLARE_BYTECODE_LENGTH) |
78 #undef DECLARE_BYTECODE_LENGTH | 78 #undef DECLARE_BYTECODE_LENGTH |
79 } } | 79 } } |
80 | 80 |
81 #endif // V8_BYTECODES_IRREGEXP_H_ | 81 #endif // V8_REGEXP_BYTECODES_IRREGEXP_H_ |
OLD | NEW |