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 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
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 #ifndef V8_HEAP_H_ | 28 #ifndef V8_HEAP_H_ |
29 #define V8_HEAP_H_ | 29 #define V8_HEAP_H_ |
30 | 30 |
| 31 #include "zone-inl.h" |
| 32 |
31 namespace v8 { namespace internal { | 33 namespace v8 { namespace internal { |
32 | 34 |
33 // Defines all the roots in Heap. | 35 // Defines all the roots in Heap. |
34 #define STRONG_ROOT_LIST(V) \ | 36 #define STRONG_ROOT_LIST(V) \ |
35 V(Map, meta_map) \ | 37 V(Map, meta_map) \ |
36 V(Map, heap_number_map) \ | 38 V(Map, heap_number_map) \ |
37 V(Map, short_string_map) \ | 39 V(Map, short_string_map) \ |
38 V(Map, medium_string_map) \ | 40 V(Map, medium_string_map) \ |
39 V(Map, long_string_map) \ | 41 V(Map, long_string_map) \ |
40 V(Map, short_ascii_string_map) \ | 42 V(Map, short_ascii_string_map) \ |
(...skipping 522 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
563 // when shortening objects. | 565 // when shortening objects. |
564 static void CreateFillerObjectAt(Address addr, int size); | 566 static void CreateFillerObjectAt(Address addr, int size); |
565 | 567 |
566 // Makes a new native code object | 568 // Makes a new native code object |
567 // Returns Failure::RetryAfterGC(requested_bytes, space) if the allocation | 569 // Returns Failure::RetryAfterGC(requested_bytes, space) if the allocation |
568 // failed. On success, the pointer to the Code object is stored in the | 570 // failed. On success, the pointer to the Code object is stored in the |
569 // self_reference. This allows generated code to reference its own Code | 571 // self_reference. This allows generated code to reference its own Code |
570 // object by containing this pointer. | 572 // object by containing this pointer. |
571 // Please note this function does not perform a garbage collection. | 573 // Please note this function does not perform a garbage collection. |
572 static Object* CreateCode(const CodeDesc& desc, | 574 static Object* CreateCode(const CodeDesc& desc, |
573 ScopeInfo<>* sinfo, | 575 ZoneScopeInfo* sinfo, |
574 Code::Flags flags, | 576 Code::Flags flags, |
575 Handle<Object> self_reference); | 577 Handle<Object> self_reference); |
576 | 578 |
577 static Object* CopyCode(Code* code); | 579 static Object* CopyCode(Code* code); |
578 // Finds the symbol for string in the symbol table. | 580 // Finds the symbol for string in the symbol table. |
579 // If not found, a new symbol is added to the table and returned. | 581 // If not found, a new symbol is added to the table and returned. |
580 // Returns Failure::RetryAfterGC(requested_bytes, space) if allocation | 582 // Returns Failure::RetryAfterGC(requested_bytes, space) if allocation |
581 // failed. | 583 // failed. |
582 // Please note this function does not perform a garbage collection. | 584 // Please note this function does not perform a garbage collection. |
583 static Object* LookupSymbol(Vector<const char> str); | 585 static Object* LookupSymbol(Vector<const char> str); |
(...skipping 720 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1304 int marked_count_; | 1306 int marked_count_; |
1305 | 1307 |
1306 // The count from the end of the previous full GC. Will be zero if there | 1308 // The count from the end of the previous full GC. Will be zero if there |
1307 // was no previous full GC. | 1309 // was no previous full GC. |
1308 int previous_marked_count_; | 1310 int previous_marked_count_; |
1309 }; | 1311 }; |
1310 | 1312 |
1311 } } // namespace v8::internal | 1313 } } // namespace v8::internal |
1312 | 1314 |
1313 #endif // V8_HEAP_H_ | 1315 #endif // V8_HEAP_H_ |
OLD | NEW |