OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 14 matching lines...) Expand all Loading... |
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 #ifndef V8_SPACES_H_ | 28 #ifndef V8_SPACES_H_ |
29 #define V8_SPACES_H_ | 29 #define V8_SPACES_H_ |
30 | 30 |
31 #include "allocation.h" | 31 #include "allocation.h" |
32 #include "hashmap.h" | 32 #include "hashmap.h" |
33 #include "list.h" | 33 #include "list.h" |
34 #include "log.h" | 34 #include "log.h" |
| 35 #include "v8utils.h" |
35 | 36 |
36 namespace v8 { | 37 namespace v8 { |
37 namespace internal { | 38 namespace internal { |
38 | 39 |
39 class Isolate; | 40 class Isolate; |
40 | 41 |
41 // ----------------------------------------------------------------------------- | 42 // ----------------------------------------------------------------------------- |
42 // Heap structures: | 43 // Heap structures: |
43 // | 44 // |
44 // A JS heap consists of a young generation, an old generation, and a large | 45 // A JS heap consists of a young generation, an old generation, and a large |
(...skipping 2828 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2873 } | 2874 } |
2874 // Must be small, since an iteration is used for lookup. | 2875 // Must be small, since an iteration is used for lookup. |
2875 static const int kMaxComments = 64; | 2876 static const int kMaxComments = 64; |
2876 }; | 2877 }; |
2877 #endif | 2878 #endif |
2878 | 2879 |
2879 | 2880 |
2880 } } // namespace v8::internal | 2881 } } // namespace v8::internal |
2881 | 2882 |
2882 #endif // V8_SPACES_H_ | 2883 #endif // V8_SPACES_H_ |
OLD | NEW |