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 797 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
808 } | 808 } |
809 } | 809 } |
810 | 810 |
811 | 811 |
812 void IncrementalMarking::Abort() { | 812 void IncrementalMarking::Abort() { |
813 if (IsStopped()) return; | 813 if (IsStopped()) return; |
814 if (FLAG_trace_incremental_marking) { | 814 if (FLAG_trace_incremental_marking) { |
815 PrintF("[IncrementalMarking] Aborting.\n"); | 815 PrintF("[IncrementalMarking] Aborting.\n"); |
816 } | 816 } |
817 heap_->new_space()->LowerInlineAllocationLimit(0); | 817 heap_->new_space()->LowerInlineAllocationLimit(0); |
| 818 heap_->mark_compact_collector()->ClearArrayBuffersOnAbort(); |
818 IncrementalMarking::set_should_hurry(false); | 819 IncrementalMarking::set_should_hurry(false); |
819 ResetStepCounters(); | 820 ResetStepCounters(); |
820 if (IsMarking()) { | 821 if (IsMarking()) { |
821 PatchIncrementalMarkingRecordWriteStubs(heap_, | 822 PatchIncrementalMarkingRecordWriteStubs(heap_, |
822 RecordWriteStub::STORE_BUFFER_ONLY); | 823 RecordWriteStub::STORE_BUFFER_ONLY); |
823 DeactivateIncrementalWriteBarrier(); | 824 DeactivateIncrementalWriteBarrier(); |
824 | 825 |
825 if (is_compacting_) { | 826 if (is_compacting_) { |
826 LargeObjectIterator it(heap_->lo_space()); | 827 LargeObjectIterator it(heap_->lo_space()); |
827 for (HeapObject* obj = it.Next(); obj != NULL; obj = it.Next()) { | 828 for (HeapObject* obj = it.Next(); obj != NULL; obj = it.Next()) { |
(...skipping 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1023 bytes_scanned_ = 0; | 1024 bytes_scanned_ = 0; |
1024 write_barriers_invoked_since_last_step_ = 0; | 1025 write_barriers_invoked_since_last_step_ = 0; |
1025 } | 1026 } |
1026 | 1027 |
1027 | 1028 |
1028 int64_t IncrementalMarking::SpaceLeftInOldSpace() { | 1029 int64_t IncrementalMarking::SpaceLeftInOldSpace() { |
1029 return heap_->MaxOldGenerationSize() - heap_->PromotedSpaceSizeOfObjects(); | 1030 return heap_->MaxOldGenerationSize() - heap_->PromotedSpaceSizeOfObjects(); |
1030 } | 1031 } |
1031 | 1032 |
1032 } } // namespace v8::internal | 1033 } } // namespace v8::internal |
OLD | NEW |