Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(109)

Side by Side Diff: src/heap/mark-compact.cc

Issue 2314803002: [heap] Switch to 500k pages (Closed)
Patch Set: Fix test Created 4 years, 3 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « src/heap/heap.cc ('k') | src/heap/spaces.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2012 the V8 project authors. All rights reserved. 1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "src/heap/mark-compact.h" 5 #include "src/heap/mark-compact.h"
6 6
7 #include "src/base/atomicops.h" 7 #include "src/base/atomicops.h"
8 #include "src/base/bits.h" 8 #include "src/base/bits.h"
9 #include "src/base/sys-info.h" 9 #include "src/base/sys-info.h"
10 #include "src/code-stubs.h" 10 #include "src/code-stubs.h"
(...skipping 582 matching lines...) Expand 10 before | Expand all | Expand 10 after
593 return NULL; 593 return NULL;
594 } 594 }
595 595
596 596
597 void MarkCompactCollector::ComputeEvacuationHeuristics( 597 void MarkCompactCollector::ComputeEvacuationHeuristics(
598 int area_size, int* target_fragmentation_percent, 598 int area_size, int* target_fragmentation_percent,
599 int* max_evacuated_bytes) { 599 int* max_evacuated_bytes) {
600 // For memory reducing and optimize for memory mode we directly define both 600 // For memory reducing and optimize for memory mode we directly define both
601 // constants. 601 // constants.
602 const int kTargetFragmentationPercentForReduceMemory = 20; 602 const int kTargetFragmentationPercentForReduceMemory = 20;
603 const int kMaxEvacuatedBytesForReduceMemory = 12 * Page::kPageSize; 603 const int kMaxEvacuatedBytesForReduceMemory = 12 * MB;
604 const int kTargetFragmentationPercentForOptimizeMemory = 20; 604 const int kTargetFragmentationPercentForOptimizeMemory = 20;
605 const int kMaxEvacuatedBytesForOptimizeMemory = 6 * MB; 605 const int kMaxEvacuatedBytesForOptimizeMemory = 6 * MB;
606 606
607 // For regular mode (which is latency critical) we define less aggressive 607 // For regular mode (which is latency critical) we define less aggressive
608 // defaults to start and switch to a trace-based (using compaction speed) 608 // defaults to start and switch to a trace-based (using compaction speed)
609 // approach as soon as we have enough samples. 609 // approach as soon as we have enough samples.
610 const int kTargetFragmentationPercent = 70; 610 const int kTargetFragmentationPercent = 70;
611 const int kMaxEvacuatedBytes = 4 * Page::kPageSize; 611 const int kMaxEvacuatedBytes = 4 * MB;
612 // Time to take for a single area (=payload of page). Used as soon as there 612 // Time to take for a single area (=payload of page). Used as soon as there
613 // exist enough compaction speed samples. 613 // exist enough compaction speed samples.
614 const int kTargetMsPerArea = 1; 614 const float kTargetMsPerArea = .5;
615 615
616 if (heap()->ShouldReduceMemory()) { 616 if (heap()->ShouldReduceMemory()) {
617 *target_fragmentation_percent = kTargetFragmentationPercentForReduceMemory; 617 *target_fragmentation_percent = kTargetFragmentationPercentForReduceMemory;
618 *max_evacuated_bytes = kMaxEvacuatedBytesForReduceMemory; 618 *max_evacuated_bytes = kMaxEvacuatedBytesForReduceMemory;
619 } else if (heap()->ShouldOptimizeForMemoryUsage()) { 619 } else if (heap()->ShouldOptimizeForMemoryUsage()) {
620 *target_fragmentation_percent = 620 *target_fragmentation_percent =
621 kTargetFragmentationPercentForOptimizeMemory; 621 kTargetFragmentationPercentForOptimizeMemory;
622 *max_evacuated_bytes = kMaxEvacuatedBytesForOptimizeMemory; 622 *max_evacuated_bytes = kMaxEvacuatedBytesForOptimizeMemory;
623 } else { 623 } else {
624 const double estimated_compaction_speed = 624 const double estimated_compaction_speed =
(...skipping 2594 matching lines...) Expand 10 before | Expand all | Expand 10 after
3219 3219
3220 int MarkCompactCollector::NumberOfParallelCompactionTasks(int pages, 3220 int MarkCompactCollector::NumberOfParallelCompactionTasks(int pages,
3221 intptr_t live_bytes) { 3221 intptr_t live_bytes) {
3222 if (!FLAG_parallel_compaction) return 1; 3222 if (!FLAG_parallel_compaction) return 1;
3223 // Compute the number of needed tasks based on a target compaction time, the 3223 // Compute the number of needed tasks based on a target compaction time, the
3224 // profiled compaction speed and marked live memory. 3224 // profiled compaction speed and marked live memory.
3225 // 3225 //
3226 // The number of parallel compaction tasks is limited by: 3226 // The number of parallel compaction tasks is limited by:
3227 // - #evacuation pages 3227 // - #evacuation pages
3228 // - (#cores - 1) 3228 // - (#cores - 1)
3229 const double kTargetCompactionTimeInMs = 1; 3229 const double kTargetCompactionTimeInMs = .5;
3230 const int kNumSweepingTasks = 3; 3230 const int kNumSweepingTasks = 3;
3231 3231
3232 double compaction_speed = 3232 double compaction_speed =
3233 heap()->tracer()->CompactionSpeedInBytesPerMillisecond(); 3233 heap()->tracer()->CompactionSpeedInBytesPerMillisecond();
3234 3234
3235 const int available_cores = Max( 3235 const int available_cores = Max(
3236 1, static_cast<int>( 3236 1, static_cast<int>(
3237 V8::GetCurrentPlatform()->NumberOfAvailableBackgroundThreads()) - 3237 V8::GetCurrentPlatform()->NumberOfAvailableBackgroundThreads()) -
3238 kNumSweepingTasks - 1); 3238 kNumSweepingTasks - 1);
3239 int tasks; 3239 int tasks;
(...skipping 800 matching lines...) Expand 10 before | Expand all | Expand 10 after
4040 // The target is always in old space, we don't have to record the slot in 4040 // The target is always in old space, we don't have to record the slot in
4041 // the old-to-new remembered set. 4041 // the old-to-new remembered set.
4042 DCHECK(!heap()->InNewSpace(target)); 4042 DCHECK(!heap()->InNewSpace(target));
4043 RecordRelocSlot(host, &rinfo, target); 4043 RecordRelocSlot(host, &rinfo, target);
4044 } 4044 }
4045 } 4045 }
4046 } 4046 }
4047 4047
4048 } // namespace internal 4048 } // namespace internal
4049 } // namespace v8 4049 } // namespace v8
OLDNEW
« no previous file with comments | « src/heap/heap.cc ('k') | src/heap/spaces.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698