OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 #define LUMP_OF_MEMORY (2 * MB) | 74 #define LUMP_OF_MEMORY (2 * MB) |
75 code_range_size_(512*MB), | 75 code_range_size_(512*MB), |
76 #else | 76 #else |
77 #define LUMP_OF_MEMORY MB | 77 #define LUMP_OF_MEMORY MB |
78 code_range_size_(0), | 78 code_range_size_(0), |
79 #endif | 79 #endif |
80 reserved_semispace_size_(8 * Max(LUMP_OF_MEMORY, Page::kPageSize)), | 80 reserved_semispace_size_(8 * Max(LUMP_OF_MEMORY, Page::kPageSize)), |
81 max_semispace_size_(8 * Max(LUMP_OF_MEMORY, Page::kPageSize)), | 81 max_semispace_size_(8 * Max(LUMP_OF_MEMORY, Page::kPageSize)), |
82 initial_semispace_size_(Page::kPageSize), | 82 initial_semispace_size_(Page::kPageSize), |
83 max_old_generation_size_(700ul * LUMP_OF_MEMORY), | 83 max_old_generation_size_(700ul * LUMP_OF_MEMORY), |
84 max_executable_size_(128l * LUMP_OF_MEMORY), | 84 max_executable_size_(256l * LUMP_OF_MEMORY), |
85 | 85 |
86 // Variables set based on semispace_size_ and old_generation_size_ in | 86 // Variables set based on semispace_size_ and old_generation_size_ in |
87 // ConfigureHeap (survived_since_last_expansion_, external_allocation_limit_) | 87 // ConfigureHeap (survived_since_last_expansion_, external_allocation_limit_) |
88 // Will be 4 * reserved_semispace_size_ to ensure that young | 88 // Will be 4 * reserved_semispace_size_ to ensure that young |
89 // generation can be aligned to its size. | 89 // generation can be aligned to its size. |
90 survived_since_last_expansion_(0), | 90 survived_since_last_expansion_(0), |
91 sweep_generation_(0), | 91 sweep_generation_(0), |
92 always_allocate_scope_depth_(0), | 92 always_allocate_scope_depth_(0), |
93 linear_allocation_scope_depth_(0), | 93 linear_allocation_scope_depth_(0), |
94 contexts_disposed_(0), | 94 contexts_disposed_(0), |
(...skipping 6870 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6965 isolate_->heap()->store_buffer()->Compact(); | 6965 isolate_->heap()->store_buffer()->Compact(); |
6966 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED); | 6966 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED); |
6967 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) { | 6967 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) { |
6968 next = chunk->next_chunk(); | 6968 next = chunk->next_chunk(); |
6969 isolate_->memory_allocator()->Free(chunk); | 6969 isolate_->memory_allocator()->Free(chunk); |
6970 } | 6970 } |
6971 chunks_queued_for_free_ = NULL; | 6971 chunks_queued_for_free_ = NULL; |
6972 } | 6972 } |
6973 | 6973 |
6974 } } // namespace v8::internal | 6974 } } // namespace v8::internal |
OLD | NEW |