OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 13 matching lines...) Expand all Loading... |
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 #ifndef V8_HEAP_H_ | 28 #ifndef V8_HEAP_H_ |
29 #define V8_HEAP_H_ | 29 #define V8_HEAP_H_ |
30 | 30 |
31 #include <math.h> | 31 #include <math.h> |
32 | 32 |
33 #include "splay-tree-inl.h" | 33 #include "splay-tree-inl.h" |
34 #include "zone-inl.h" | 34 #include "v8-counters.h" |
35 | |
36 | 35 |
37 namespace v8 { | 36 namespace v8 { |
38 namespace internal { | 37 namespace internal { |
39 | 38 |
| 39 // Forward declarations. |
| 40 class ZoneScopeInfo; |
| 41 |
40 // Defines all the roots in Heap. | 42 // Defines all the roots in Heap. |
41 #define UNCONDITIONAL_STRONG_ROOT_LIST(V) \ | 43 #define UNCONDITIONAL_STRONG_ROOT_LIST(V) \ |
42 /* Put the byte array map early. We need it to be in place by the time */ \ | 44 /* Put the byte array map early. We need it to be in place by the time */ \ |
43 /* the deserializer hits the next page, since it wants to put a byte */ \ | 45 /* the deserializer hits the next page, since it wants to put a byte */ \ |
44 /* array in the unused space at the end of the page. */ \ | 46 /* array in the unused space at the end of the page. */ \ |
45 V(Map, byte_array_map, ByteArrayMap) \ | 47 V(Map, byte_array_map, ByteArrayMap) \ |
46 V(Map, one_pointer_filler_map, OnePointerFillerMap) \ | 48 V(Map, one_pointer_filler_map, OnePointerFillerMap) \ |
47 V(Map, two_pointer_filler_map, TwoPointerFillerMap) \ | 49 V(Map, two_pointer_filler_map, TwoPointerFillerMap) \ |
48 /* Cluster the most popular ones in a few cache lines here at the top. */ \ | 50 /* Cluster the most popular ones in a few cache lines here at the top. */ \ |
49 V(Smi, stack_limit, StackLimit) \ | 51 V(Smi, stack_limit, StackLimit) \ |
(...skipping 1686 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1736 | 1738 |
1737 // To speed up scavenge collections new space string are kept | 1739 // To speed up scavenge collections new space string are kept |
1738 // separate from old space strings. | 1740 // separate from old space strings. |
1739 static List<Object*> new_space_strings_; | 1741 static List<Object*> new_space_strings_; |
1740 static List<Object*> old_space_strings_; | 1742 static List<Object*> old_space_strings_; |
1741 }; | 1743 }; |
1742 | 1744 |
1743 } } // namespace v8::internal | 1745 } } // namespace v8::internal |
1744 | 1746 |
1745 #endif // V8_HEAP_H_ | 1747 #endif // V8_HEAP_H_ |
OLD | NEW |