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 377 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
388 Counters::memory_allocated.Decrement(static_cast<int>(length)); | 388 Counters::memory_allocated.Decrement(static_cast<int>(length)); |
389 size_ -= static_cast<int>(length); | 389 size_ -= static_cast<int>(length); |
390 if (executable == EXECUTABLE) size_executable_ -= static_cast<int>(length); | 390 if (executable == EXECUTABLE) size_executable_ -= static_cast<int>(length); |
391 | 391 |
392 ASSERT(size_ >= 0); | 392 ASSERT(size_ >= 0); |
393 } | 393 } |
394 | 394 |
395 | 395 |
396 void MemoryAllocator::PerformAllocationCallback(ObjectSpace space, | 396 void MemoryAllocator::PerformAllocationCallback(ObjectSpace space, |
397 AllocationAction action, | 397 AllocationAction action, |
398 int size) { | 398 size_t size) { |
399 for (int i = 0; i < memory_allocation_callbacks_.length(); ++i) { | 399 for (int i = 0; i < memory_allocation_callbacks_.length(); ++i) { |
400 MemoryAllocationCallbackRegistration registration = | 400 MemoryAllocationCallbackRegistration registration = |
401 memory_allocation_callbacks_[i]; | 401 memory_allocation_callbacks_[i]; |
402 if ((registration.space & space) == space && | 402 if ((registration.space & space) == space && |
403 (registration.action & action) == action) | 403 (registration.action & action) == action) |
404 registration.callback(space, action, static_cast<int>(size)); | 404 registration.callback(space, action, static_cast<int>(size)); |
405 } | 405 } |
406 } | 406 } |
407 | 407 |
408 | 408 |
(...skipping 2623 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3032 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { | 3032 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { |
3033 if (obj->IsCode()) { | 3033 if (obj->IsCode()) { |
3034 Code* code = Code::cast(obj); | 3034 Code* code = Code::cast(obj); |
3035 code_kind_statistics[code->kind()] += code->Size(); | 3035 code_kind_statistics[code->kind()] += code->Size(); |
3036 } | 3036 } |
3037 } | 3037 } |
3038 } | 3038 } |
3039 #endif // DEBUG | 3039 #endif // DEBUG |
3040 | 3040 |
3041 } } // namespace v8::internal | 3041 } } // namespace v8::internal |
OLD | NEW |