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_SPACES_H_ | 28 #ifndef V8_SPACES_H_ |
29 #define V8_SPACES_H_ | 29 #define V8_SPACES_H_ |
30 | 30 |
31 #include "list-inl.h" | 31 #include "list-inl.h" |
32 #include "log.h" | 32 #include "log.h" |
33 | 33 |
34 namespace v8 { namespace internal { | 34 namespace v8 { |
| 35 namespace internal { |
35 | 36 |
36 // ----------------------------------------------------------------------------- | 37 // ----------------------------------------------------------------------------- |
37 // Heap structures: | 38 // Heap structures: |
38 // | 39 // |
39 // A JS heap consists of a young generation, an old generation, and a large | 40 // A JS heap consists of a young generation, an old generation, and a large |
40 // object space. The young generation is divided into two semispaces. A | 41 // object space. The young generation is divided into two semispaces. A |
41 // scavenger implements Cheney's copying algorithm. The old generation is | 42 // scavenger implements Cheney's copying algorithm. The old generation is |
42 // separated into a map space and an old object space. The map space contains | 43 // separated into a map space and an old object space. The map space contains |
43 // all (and only) map objects, the rest of old objects go into the old space. | 44 // all (and only) map objects, the rest of old objects go into the old space. |
44 // The old generation is collected by a mark-sweep-compact collector. | 45 // The old generation is collected by a mark-sweep-compact collector. |
(...skipping 1684 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1729 | 1730 |
1730 private: | 1731 private: |
1731 LargeObjectChunk* current_; | 1732 LargeObjectChunk* current_; |
1732 HeapObjectCallback size_func_; | 1733 HeapObjectCallback size_func_; |
1733 }; | 1734 }; |
1734 | 1735 |
1735 | 1736 |
1736 } } // namespace v8::internal | 1737 } } // namespace v8::internal |
1737 | 1738 |
1738 #endif // V8_SPACES_H_ | 1739 #endif // V8_SPACES_H_ |
OLD | NEW |