| 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 842 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 853 : isolate_->counters()->gc_compactor()); | 853 : isolate_->counters()->gc_compactor()); |
| 854 next_gc_likely_to_collect_more = | 854 next_gc_likely_to_collect_more = |
| 855 PerformGarbageCollection(collector, &tracer, gc_callback_flags); | 855 PerformGarbageCollection(collector, &tracer, gc_callback_flags); |
| 856 } | 856 } |
| 857 | 857 |
| 858 GarbageCollectionEpilogue(); | 858 GarbageCollectionEpilogue(); |
| 859 } | 859 } |
| 860 | 860 |
| 861 // Start incremental marking for the next cycle. The heap snapshot | 861 // Start incremental marking for the next cycle. The heap snapshot |
| 862 // generator needs incremental marking to stay off after it aborted. | 862 // generator needs incremental marking to stay off after it aborted. |
| 863 if (!mark_compact_collector()->abort_incremental_marking() && | 863 if (incremental_marking()->IsStopped() && |
| 864 incremental_marking()->IsStopped() && | 864 (FLAG_always_incremental_marking || |
| 865 incremental_marking()->WorthActivating() && | 865 (!mark_compact_collector()->abort_incremental_marking() && |
| 866 NextGCIsLikelyToBeFull()) { | 866 incremental_marking()->WorthActivating() && |
| 867 NextGCIsLikelyToBeFull()))) { |
| 867 incremental_marking()->Start(); | 868 incremental_marking()->Start(); |
| 868 } | 869 } |
| 869 | 870 |
| 870 return next_gc_likely_to_collect_more; | 871 return next_gc_likely_to_collect_more; |
| 871 } | 872 } |
| 872 | 873 |
| 873 | 874 |
| 874 int Heap::NotifyContextDisposed() { | 875 int Heap::NotifyContextDisposed() { |
| 875 if (isolate()->concurrent_recompilation_enabled()) { | 876 if (isolate()->concurrent_recompilation_enabled()) { |
| 876 // Flush the queued recompilation tasks. | 877 // Flush the queued recompilation tasks. |
| (...skipping 6873 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 7750 static_cast<int>(object_sizes_last_time_[index])); | 7751 static_cast<int>(object_sizes_last_time_[index])); |
| 7751 CODE_AGE_LIST_COMPLETE(ADJUST_LAST_TIME_OBJECT_COUNT) | 7752 CODE_AGE_LIST_COMPLETE(ADJUST_LAST_TIME_OBJECT_COUNT) |
| 7752 #undef ADJUST_LAST_TIME_OBJECT_COUNT | 7753 #undef ADJUST_LAST_TIME_OBJECT_COUNT |
| 7753 | 7754 |
| 7754 OS::MemCopy(object_counts_last_time_, object_counts_, sizeof(object_counts_)); | 7755 OS::MemCopy(object_counts_last_time_, object_counts_, sizeof(object_counts_)); |
| 7755 OS::MemCopy(object_sizes_last_time_, object_sizes_, sizeof(object_sizes_)); | 7756 OS::MemCopy(object_sizes_last_time_, object_sizes_, sizeof(object_sizes_)); |
| 7756 ClearObjectStats(); | 7757 ClearObjectStats(); |
| 7757 } | 7758 } |
| 7758 | 7759 |
| 7759 } } // namespace v8::internal | 7760 } } // namespace v8::internal |
| OLD | NEW |