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 165 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
176 intptr_t code_space_capacity; | 176 intptr_t code_space_capacity; |
177 heap_stats.code_space_capacity = &code_space_capacity; | 177 heap_stats.code_space_capacity = &code_space_capacity; |
178 intptr_t map_space_size; | 178 intptr_t map_space_size; |
179 heap_stats.map_space_size = &map_space_size; | 179 heap_stats.map_space_size = &map_space_size; |
180 intptr_t map_space_capacity; | 180 intptr_t map_space_capacity; |
181 heap_stats.map_space_capacity = &map_space_capacity; | 181 heap_stats.map_space_capacity = &map_space_capacity; |
182 intptr_t cell_space_size; | 182 intptr_t cell_space_size; |
183 heap_stats.cell_space_size = &cell_space_size; | 183 heap_stats.cell_space_size = &cell_space_size; |
184 intptr_t cell_space_capacity; | 184 intptr_t cell_space_capacity; |
185 heap_stats.cell_space_capacity = &cell_space_capacity; | 185 heap_stats.cell_space_capacity = &cell_space_capacity; |
| 186 intptr_t property_cell_space_size; |
| 187 heap_stats.property_cell_space_size = &property_cell_space_size; |
| 188 intptr_t property_cell_space_capacity; |
| 189 heap_stats.property_cell_space_capacity = &property_cell_space_capacity; |
186 intptr_t lo_space_size; | 190 intptr_t lo_space_size; |
187 heap_stats.lo_space_size = &lo_space_size; | 191 heap_stats.lo_space_size = &lo_space_size; |
188 int global_handle_count; | 192 int global_handle_count; |
189 heap_stats.global_handle_count = &global_handle_count; | 193 heap_stats.global_handle_count = &global_handle_count; |
190 int weak_global_handle_count; | 194 int weak_global_handle_count; |
191 heap_stats.weak_global_handle_count = &weak_global_handle_count; | 195 heap_stats.weak_global_handle_count = &weak_global_handle_count; |
192 int pending_global_handle_count; | 196 int pending_global_handle_count; |
193 heap_stats.pending_global_handle_count = &pending_global_handle_count; | 197 heap_stats.pending_global_handle_count = &pending_global_handle_count; |
194 int near_death_global_handle_count; | 198 int near_death_global_handle_count; |
195 heap_stats.near_death_global_handle_count = &near_death_global_handle_count; | 199 heap_stats.near_death_global_handle_count = &near_death_global_handle_count; |
(...skipping 7799 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7995 | 7999 |
7996 v->VisitPointers(blocks_.first(), first_block_limit_); | 8000 v->VisitPointers(blocks_.first(), first_block_limit_); |
7997 | 8001 |
7998 for (int i = 1; i < blocks_.length(); i++) { | 8002 for (int i = 1; i < blocks_.length(); i++) { |
7999 v->VisitPointers(blocks_[i], &blocks_[i][kHandleBlockSize]); | 8003 v->VisitPointers(blocks_[i], &blocks_[i][kHandleBlockSize]); |
8000 } | 8004 } |
8001 } | 8005 } |
8002 | 8006 |
8003 | 8007 |
8004 } } // namespace v8::internal | 8008 } } // namespace v8::internal |
OLD | NEW |