| 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 252 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 263 delete code_range_; // Frees all memory in the virtual memory range. | 263 delete code_range_; // Frees all memory in the virtual memory range. |
| 264 code_range_ = NULL; | 264 code_range_ = NULL; |
| 265 free_list_.Free(); | 265 free_list_.Free(); |
| 266 allocation_list_.Free(); | 266 allocation_list_.Free(); |
| 267 } | 267 } |
| 268 | 268 |
| 269 | 269 |
| 270 // ----------------------------------------------------------------------------- | 270 // ----------------------------------------------------------------------------- |
| 271 // MemoryAllocator | 271 // MemoryAllocator |
| 272 // | 272 // |
| 273 intptr_t MemoryAllocator::capacity_ = 0; | 273 intptr_t MemoryAllocator::capacity_ = 0; |
| 274 intptr_t MemoryAllocator::capacity_executable_ = 0; | 274 intptr_t MemoryAllocator::capacity_executable_ = 0; |
| 275 intptr_t MemoryAllocator::size_ = 0; | 275 intptr_t MemoryAllocator::size_ = 0; |
| 276 intptr_t MemoryAllocator::size_executable_ = 0; | 276 intptr_t MemoryAllocator::size_executable_ = 0; |
| 277 | 277 |
| 278 List<MemoryAllocator::MemoryAllocationCallbackRegistration> | 278 List<MemoryAllocator::MemoryAllocationCallbackRegistration> |
| 279 MemoryAllocator::memory_allocation_callbacks_; | 279 MemoryAllocator::memory_allocation_callbacks_; |
| 280 | 280 |
| 281 VirtualMemory* MemoryAllocator::initial_chunk_ = NULL; | 281 VirtualMemory* MemoryAllocator::initial_chunk_ = NULL; |
| 282 | 282 |
| 283 // 270 is an estimate based on the static default heap size of a pair of 256K | 283 // 270 is an estimate based on the static default heap size of a pair of 256K |
| 284 // semispaces and a 64M old generation. | 284 // semispaces and a 64M old generation. |
| 285 const int kEstimatedNumberOfChunks = 270; | 285 const int kEstimatedNumberOfChunks = 270; |
| (...skipping 2776 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3062 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { | 3062 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { |
| 3063 if (obj->IsCode()) { | 3063 if (obj->IsCode()) { |
| 3064 Code* code = Code::cast(obj); | 3064 Code* code = Code::cast(obj); |
| 3065 code_kind_statistics[code->kind()] += code->Size(); | 3065 code_kind_statistics[code->kind()] += code->Size(); |
| 3066 } | 3066 } |
| 3067 } | 3067 } |
| 3068 } | 3068 } |
| 3069 #endif // DEBUG | 3069 #endif // DEBUG |
| 3070 | 3070 |
| 3071 } } // namespace v8::internal | 3071 } } // namespace v8::internal |
| OLD | NEW |