OLD | NEW |
1 // Copyright 2008-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2008-2009 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 11 matching lines...) Expand all Loading... |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 | 28 |
29 #ifndef V8_BYTECODES_IRREGEXP_H_ | 29 #ifndef V8_BYTECODES_IRREGEXP_H_ |
30 #define V8_BYTECODES_IRREGEXP_H_ | 30 #define V8_BYTECODES_IRREGEXP_H_ |
31 | 31 |
32 namespace v8 { namespace internal { | 32 namespace v8 { |
| 33 namespace internal { |
33 | 34 |
34 | 35 |
35 static const int BYTECODE_MASK = 0xff; | 36 static const int BYTECODE_MASK = 0xff; |
36 // The first argument is packed in with the byte code in one word, but so it | 37 // The first argument is packed in with the byte code in one word, but so it |
37 // has 24 bits, but it can be positive and negative so only use 23 bits for | 38 // has 24 bits, but it can be positive and negative so only use 23 bits for |
38 // positive values. | 39 // positive values. |
39 static const unsigned int MAX_FIRST_ARG = 0x7fffffu; | 40 static const unsigned int MAX_FIRST_ARG = 0x7fffffu; |
40 static const int BYTECODE_SHIFT = 8; | 41 static const int BYTECODE_SHIFT = 8; |
41 | 42 |
42 #define BYTECODE_ITERATOR(V) \ | 43 #define BYTECODE_ITERATOR(V) \ |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
94 BYTECODE_ITERATOR(DECLARE_BYTECODES) | 95 BYTECODE_ITERATOR(DECLARE_BYTECODES) |
95 #undef DECLARE_BYTECODES | 96 #undef DECLARE_BYTECODES |
96 | 97 |
97 #define DECLARE_BYTECODE_LENGTH(name, code, length) \ | 98 #define DECLARE_BYTECODE_LENGTH(name, code, length) \ |
98 static const int BC_##name##_LENGTH = length; | 99 static const int BC_##name##_LENGTH = length; |
99 BYTECODE_ITERATOR(DECLARE_BYTECODE_LENGTH) | 100 BYTECODE_ITERATOR(DECLARE_BYTECODE_LENGTH) |
100 #undef DECLARE_BYTECODE_LENGTH | 101 #undef DECLARE_BYTECODE_LENGTH |
101 } } | 102 } } |
102 | 103 |
103 #endif // V8_BYTECODES_IRREGEXP_H_ | 104 #endif // V8_BYTECODES_IRREGEXP_H_ |
OLD | NEW |