-
Notifications
You must be signed in to change notification settings - Fork 54
/
Copy pathScheduling.cpp
778 lines (679 loc) · 25.5 KB
/
Scheduling.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "gc/Scheduling.h"
#include "mozilla/CheckedInt.h"
#include "mozilla/TimeStamp.h"
#include <algorithm>
#include "gc/RelocationOverlay.h"
#include "gc/ZoneAllocator.h"
#include "vm/MutexIDs.h"
using namespace js;
using namespace js::gc;
using mozilla::CheckedInt;
using mozilla::TimeDuration;
/*
* We may start to collect a zone before its trigger threshold is reached if
* GCRuntime::maybeGC() is called for that zone or we start collecting other
* zones. These eager threshold factors are not configurable.
*/
static constexpr float HighFrequencyEagerAllocTriggerFactor = 0.85f;
static constexpr float LowFrequencyEagerAllocTriggerFactor = 0.9f;
/*
* Don't allow heap growth factors to be set so low that eager collections could
* reduce the trigger threshold.
*/
static constexpr float MinHeapGrowthFactor =
1.0f / std::min(HighFrequencyEagerAllocTriggerFactor,
LowFrequencyEagerAllocTriggerFactor);
GCSchedulingTunables::GCSchedulingTunables()
: gcMaxBytes_(0),
gcMinNurseryBytes_(TuningDefaults::GCMinNurseryBytes),
gcMaxNurseryBytes_(JS::DefaultNurseryMaxBytes),
gcZoneAllocThresholdBase_(TuningDefaults::GCZoneAllocThresholdBase),
nonIncrementalFactor_(TuningDefaults::NonIncrementalFactor),
avoidInterruptFactor_(TuningDefaults::AvoidInterruptFactor),
zoneAllocDelayBytes_(TuningDefaults::ZoneAllocDelayBytes),
dynamicHeapGrowthEnabled_(TuningDefaults::DynamicHeapGrowthEnabled),
highFrequencyThreshold_(
TimeDuration::FromSeconds(TuningDefaults::HighFrequencyThreshold)),
highFrequencyLowLimitBytes_(TuningDefaults::HighFrequencyLowLimitBytes),
highFrequencyHighLimitBytes_(TuningDefaults::HighFrequencyHighLimitBytes),
highFrequencyHeapGrowthMax_(TuningDefaults::HighFrequencyHeapGrowthMax),
highFrequencyHeapGrowthMin_(TuningDefaults::HighFrequencyHeapGrowthMin),
lowFrequencyHeapGrowth_(TuningDefaults::LowFrequencyHeapGrowth),
dynamicMarkSliceEnabled_(TuningDefaults::DynamicMarkSliceEnabled),
minEmptyChunkCount_(TuningDefaults::MinEmptyChunkCount),
maxEmptyChunkCount_(TuningDefaults::MaxEmptyChunkCount),
nurseryFreeThresholdForIdleCollection_(
TuningDefaults::NurseryFreeThresholdForIdleCollection),
nurseryFreeThresholdForIdleCollectionFraction_(
TuningDefaults::NurseryFreeThresholdForIdleCollectionFraction),
pretenureThreshold_(TuningDefaults::PretenureThreshold),
pretenureGroupThreshold_(TuningDefaults::PretenureGroupThreshold),
minLastDitchGCPeriod_(
TimeDuration::FromSeconds(TuningDefaults::MinLastDitchGCPeriod)),
mallocThresholdBase_(TuningDefaults::MallocThresholdBase),
mallocGrowthFactor_(TuningDefaults::MallocGrowthFactor) {}
bool GCSchedulingTunables::setParameter(JSGCParamKey key, uint32_t value,
const AutoLockGC& lock) {
// Limit heap growth factor to one hundred times size of current heap.
const float MaxHeapGrowthFactor = 100;
const size_t MaxNurseryBytes = 128 * 1024 * 1024;
switch (key) {
case JSGC_MAX_BYTES:
gcMaxBytes_ = value;
break;
case JSGC_MIN_NURSERY_BYTES:
if (value > gcMaxNurseryBytes_ || value < ArenaSize ||
value >= MaxNurseryBytes) {
return false;
}
gcMinNurseryBytes_ = value;
break;
case JSGC_MAX_NURSERY_BYTES:
if (value < gcMinNurseryBytes_ || value >= MaxNurseryBytes) {
return false;
}
gcMaxNurseryBytes_ = value;
break;
case JSGC_HIGH_FREQUENCY_TIME_LIMIT:
highFrequencyThreshold_ = TimeDuration::FromMilliseconds(value);
break;
case JSGC_HIGH_FREQUENCY_LOW_LIMIT: {
CheckedInt<size_t> newLimit = CheckedInt<size_t>(value) * 1024 * 1024;
if (!newLimit.isValid()) {
return false;
}
setHighFrequencyLowLimit(newLimit.value());
break;
}
case JSGC_HIGH_FREQUENCY_HIGH_LIMIT: {
size_t newLimit = (size_t)value * 1024 * 1024;
if (newLimit == 0) {
return false;
}
setHighFrequencyHighLimit(newLimit);
break;
}
case JSGC_HIGH_FREQUENCY_HEAP_GROWTH_MAX: {
float newGrowth = value / 100.0f;
if (newGrowth < MinHeapGrowthFactor || newGrowth > MaxHeapGrowthFactor) {
return false;
}
setHighFrequencyHeapGrowthMax(newGrowth);
break;
}
case JSGC_HIGH_FREQUENCY_HEAP_GROWTH_MIN: {
float newGrowth = value / 100.0f;
if (newGrowth < MinHeapGrowthFactor || newGrowth > MaxHeapGrowthFactor) {
return false;
}
setHighFrequencyHeapGrowthMin(newGrowth);
break;
}
case JSGC_LOW_FREQUENCY_HEAP_GROWTH: {
float newGrowth = value / 100.0f;
if (newGrowth < MinHeapGrowthFactor || newGrowth > MaxHeapGrowthFactor) {
return false;
}
setLowFrequencyHeapGrowth(newGrowth);
break;
}
case JSGC_DYNAMIC_HEAP_GROWTH:
dynamicHeapGrowthEnabled_ = value != 0;
break;
case JSGC_DYNAMIC_MARK_SLICE:
dynamicMarkSliceEnabled_ = value != 0;
break;
case JSGC_ALLOCATION_THRESHOLD:
gcZoneAllocThresholdBase_ = value * 1024 * 1024;
break;
case JSGC_NON_INCREMENTAL_FACTOR: {
float newFactor = value / 100.0f;
if (newFactor < 1.0f) {
return false;
}
nonIncrementalFactor_ = newFactor;
break;
}
case JSGC_AVOID_INTERRUPT_FACTOR: {
float newFactor = value / 100.0f;
if (newFactor < 1.0f) {
return false;
}
avoidInterruptFactor_ = newFactor;
break;
}
case JSGC_MIN_EMPTY_CHUNK_COUNT:
setMinEmptyChunkCount(value);
break;
case JSGC_MAX_EMPTY_CHUNK_COUNT:
setMaxEmptyChunkCount(value);
break;
case JSGC_NURSERY_FREE_THRESHOLD_FOR_IDLE_COLLECTION:
if (value > gcMaxNurseryBytes()) {
value = gcMaxNurseryBytes();
}
nurseryFreeThresholdForIdleCollection_ = value;
break;
case JSGC_NURSERY_FREE_THRESHOLD_FOR_IDLE_COLLECTION_PERCENT:
if (value == 0 || value > 100) {
return false;
}
nurseryFreeThresholdForIdleCollectionFraction_ = value / 100.0f;
break;
case JSGC_PRETENURE_THRESHOLD: {
// 100 disables pretenuring
if (value == 0 || value > 100) {
return false;
}
pretenureThreshold_ = value / 100.0f;
break;
}
case JSGC_PRETENURE_GROUP_THRESHOLD:
if (value <= 0) {
return false;
}
pretenureGroupThreshold_ = value;
break;
case JSGC_MIN_LAST_DITCH_GC_PERIOD:
minLastDitchGCPeriod_ = TimeDuration::FromSeconds(value);
break;
case JSGC_ZONE_ALLOC_DELAY_KB:
zoneAllocDelayBytes_ = value * 1024;
break;
case JSGC_MALLOC_THRESHOLD_BASE:
mallocThresholdBase_ = value * 1024 * 1024;
break;
case JSGC_MALLOC_GROWTH_FACTOR: {
float newGrowth = value / 100.0f;
if (newGrowth < MinHeapGrowthFactor || newGrowth > MaxHeapGrowthFactor) {
return false;
}
mallocGrowthFactor_ = newGrowth;
break;
}
default:
MOZ_CRASH("Unknown GC parameter.");
}
return true;
}
void GCSchedulingTunables::setHighFrequencyLowLimit(size_t newLimit) {
highFrequencyLowLimitBytes_ = newLimit;
if (highFrequencyLowLimitBytes_ >= highFrequencyHighLimitBytes_) {
highFrequencyHighLimitBytes_ = highFrequencyLowLimitBytes_ + 1;
}
MOZ_ASSERT(highFrequencyHighLimitBytes_ > highFrequencyLowLimitBytes_);
}
void GCSchedulingTunables::setHighFrequencyHighLimit(size_t newLimit) {
highFrequencyHighLimitBytes_ = newLimit;
if (highFrequencyHighLimitBytes_ <= highFrequencyLowLimitBytes_) {
highFrequencyLowLimitBytes_ = highFrequencyHighLimitBytes_ - 1;
}
MOZ_ASSERT(highFrequencyHighLimitBytes_ > highFrequencyLowLimitBytes_);
}
void GCSchedulingTunables::setHighFrequencyHeapGrowthMin(float value) {
highFrequencyHeapGrowthMin_ = value;
if (highFrequencyHeapGrowthMin_ > highFrequencyHeapGrowthMax_) {
highFrequencyHeapGrowthMax_ = highFrequencyHeapGrowthMin_;
}
MOZ_ASSERT(highFrequencyHeapGrowthMin_ >= MinHeapGrowthFactor);
MOZ_ASSERT(highFrequencyHeapGrowthMin_ <= highFrequencyHeapGrowthMax_);
}
void GCSchedulingTunables::setHighFrequencyHeapGrowthMax(float value) {
highFrequencyHeapGrowthMax_ = value;
if (highFrequencyHeapGrowthMax_ < highFrequencyHeapGrowthMin_) {
highFrequencyHeapGrowthMin_ = highFrequencyHeapGrowthMax_;
}
MOZ_ASSERT(highFrequencyHeapGrowthMin_ >= MinHeapGrowthFactor);
MOZ_ASSERT(highFrequencyHeapGrowthMin_ <= highFrequencyHeapGrowthMax_);
}
void GCSchedulingTunables::setLowFrequencyHeapGrowth(float value) {
lowFrequencyHeapGrowth_ = value;
MOZ_ASSERT(lowFrequencyHeapGrowth_ >= MinHeapGrowthFactor);
}
void GCSchedulingTunables::setMinEmptyChunkCount(uint32_t value) {
minEmptyChunkCount_ = value;
if (minEmptyChunkCount_ > maxEmptyChunkCount_) {
maxEmptyChunkCount_ = minEmptyChunkCount_;
}
MOZ_ASSERT(maxEmptyChunkCount_ >= minEmptyChunkCount_);
}
void GCSchedulingTunables::setMaxEmptyChunkCount(uint32_t value) {
maxEmptyChunkCount_ = value;
if (minEmptyChunkCount_ > maxEmptyChunkCount_) {
minEmptyChunkCount_ = maxEmptyChunkCount_;
}
MOZ_ASSERT(maxEmptyChunkCount_ >= minEmptyChunkCount_);
}
void GCSchedulingTunables::resetParameter(JSGCParamKey key,
const AutoLockGC& lock) {
switch (key) {
case JSGC_MAX_BYTES:
gcMaxBytes_ = 0xffffffff;
break;
case JSGC_MIN_NURSERY_BYTES:
case JSGC_MAX_NURSERY_BYTES:
// Reset these togeather to maintain their min <= max invariant.
gcMinNurseryBytes_ = TuningDefaults::GCMinNurseryBytes;
gcMaxNurseryBytes_ = JS::DefaultNurseryMaxBytes;
break;
case JSGC_HIGH_FREQUENCY_TIME_LIMIT:
highFrequencyThreshold_ =
TimeDuration::FromSeconds(TuningDefaults::HighFrequencyThreshold);
break;
case JSGC_HIGH_FREQUENCY_LOW_LIMIT:
setHighFrequencyLowLimit(TuningDefaults::HighFrequencyLowLimitBytes);
break;
case JSGC_HIGH_FREQUENCY_HIGH_LIMIT:
setHighFrequencyHighLimit(TuningDefaults::HighFrequencyHighLimitBytes);
break;
case JSGC_HIGH_FREQUENCY_HEAP_GROWTH_MAX:
setHighFrequencyHeapGrowthMax(TuningDefaults::HighFrequencyHeapGrowthMax);
break;
case JSGC_HIGH_FREQUENCY_HEAP_GROWTH_MIN:
setHighFrequencyHeapGrowthMin(TuningDefaults::HighFrequencyHeapGrowthMin);
break;
case JSGC_LOW_FREQUENCY_HEAP_GROWTH:
setLowFrequencyHeapGrowth(TuningDefaults::LowFrequencyHeapGrowth);
break;
case JSGC_DYNAMIC_HEAP_GROWTH:
dynamicHeapGrowthEnabled_ = TuningDefaults::DynamicHeapGrowthEnabled;
break;
case JSGC_DYNAMIC_MARK_SLICE:
dynamicMarkSliceEnabled_ = TuningDefaults::DynamicMarkSliceEnabled;
break;
case JSGC_ALLOCATION_THRESHOLD:
gcZoneAllocThresholdBase_ = TuningDefaults::GCZoneAllocThresholdBase;
break;
case JSGC_NON_INCREMENTAL_FACTOR:
nonIncrementalFactor_ = TuningDefaults::NonIncrementalFactor;
break;
case JSGC_AVOID_INTERRUPT_FACTOR:
avoidInterruptFactor_ = TuningDefaults::AvoidInterruptFactor;
break;
case JSGC_MIN_EMPTY_CHUNK_COUNT:
setMinEmptyChunkCount(TuningDefaults::MinEmptyChunkCount);
break;
case JSGC_MAX_EMPTY_CHUNK_COUNT:
setMaxEmptyChunkCount(TuningDefaults::MaxEmptyChunkCount);
break;
case JSGC_NURSERY_FREE_THRESHOLD_FOR_IDLE_COLLECTION:
nurseryFreeThresholdForIdleCollection_ =
TuningDefaults::NurseryFreeThresholdForIdleCollection;
break;
case JSGC_NURSERY_FREE_THRESHOLD_FOR_IDLE_COLLECTION_PERCENT:
nurseryFreeThresholdForIdleCollectionFraction_ =
TuningDefaults::NurseryFreeThresholdForIdleCollectionFraction;
break;
case JSGC_PRETENURE_THRESHOLD:
pretenureThreshold_ = TuningDefaults::PretenureThreshold;
break;
case JSGC_PRETENURE_GROUP_THRESHOLD:
pretenureGroupThreshold_ = TuningDefaults::PretenureGroupThreshold;
break;
case JSGC_MIN_LAST_DITCH_GC_PERIOD:
minLastDitchGCPeriod_ =
TimeDuration::FromSeconds(TuningDefaults::MinLastDitchGCPeriod);
break;
case JSGC_MALLOC_THRESHOLD_BASE:
mallocThresholdBase_ = TuningDefaults::MallocThresholdBase;
break;
case JSGC_MALLOC_GROWTH_FACTOR:
mallocGrowthFactor_ = TuningDefaults::MallocGrowthFactor;
break;
default:
MOZ_CRASH("Unknown GC parameter.");
}
}
float HeapThreshold::eagerAllocTrigger(bool highFrequencyGC) const {
float eagerTriggerFactor = highFrequencyGC
? HighFrequencyEagerAllocTriggerFactor
: LowFrequencyEagerAllocTriggerFactor;
return eagerTriggerFactor * bytes();
}
/* static */
float GCHeapThreshold::computeZoneHeapGrowthFactorForHeapSize(
size_t lastBytes, const GCSchedulingTunables& tunables,
const GCSchedulingState& state) {
if (!tunables.isDynamicHeapGrowthEnabled()) {
return 3.0f;
}
// For small zones, our collection heuristics do not matter much: favor
// something simple in this case.
if (lastBytes < 1 * 1024 * 1024) {
return tunables.lowFrequencyHeapGrowth();
}
// If GC's are not triggering in rapid succession, use a lower threshold so
// that we will collect garbage sooner.
if (!state.inHighFrequencyGCMode()) {
return tunables.lowFrequencyHeapGrowth();
}
// The heap growth factor depends on the heap size after a GC and the GC
// frequency. For low frequency GCs (more than 1sec between GCs) we let
// the heap grow to 150%. For high frequency GCs we let the heap grow
// depending on the heap size:
// lastBytes < highFrequencyLowLimit: 300%
// lastBytes > highFrequencyHighLimit: 150%
// otherwise: linear interpolation between 300% and 150% based on lastBytes
float minRatio = tunables.highFrequencyHeapGrowthMin();
float maxRatio = tunables.highFrequencyHeapGrowthMax();
size_t lowLimit = tunables.highFrequencyLowLimitBytes();
size_t highLimit = tunables.highFrequencyHighLimitBytes();
MOZ_ASSERT(minRatio <= maxRatio);
MOZ_ASSERT(lowLimit < highLimit);
if (lastBytes <= lowLimit) {
return maxRatio;
}
if (lastBytes >= highLimit) {
return minRatio;
}
float factor = maxRatio - ((maxRatio - minRatio) *
((lastBytes - lowLimit) / (highLimit - lowLimit)));
MOZ_ASSERT(factor >= minRatio);
MOZ_ASSERT(factor <= maxRatio);
return factor;
}
/* static */
size_t GCHeapThreshold::computeZoneTriggerBytes(
float growthFactor, size_t lastBytes, JSGCInvocationKind gckind,
const GCSchedulingTunables& tunables, const AutoLockGC& lock) {
size_t baseMin = gckind == GC_SHRINK
? tunables.minEmptyChunkCount(lock) * ChunkSize
: tunables.gcZoneAllocThresholdBase();
size_t base = std::max(lastBytes, baseMin);
float trigger = float(base) * growthFactor;
float triggerMax =
float(tunables.gcMaxBytes()) / tunables.nonIncrementalFactor();
return size_t(std::min(triggerMax, trigger));
}
void GCHeapThreshold::updateAfterGC(size_t lastBytes, JSGCInvocationKind gckind,
const GCSchedulingTunables& tunables,
const GCSchedulingState& state,
bool isAtomsZone, const AutoLockGC& lock) {
float growthFactor =
computeZoneHeapGrowthFactorForHeapSize(lastBytes, tunables, state);
// Discourage collection of the atoms zone during page load as this can block
// off-thread parsing.
if (isAtomsZone && state.inPageLoad) {
growthFactor *= 1.5;
}
bytes_ =
computeZoneTriggerBytes(growthFactor, lastBytes, gckind, tunables, lock);
}
/* static */
size_t MallocHeapThreshold::computeZoneTriggerBytes(float growthFactor,
size_t lastBytes,
size_t baseBytes,
const AutoLockGC& lock) {
return size_t(float(std::max(lastBytes, baseBytes)) * growthFactor);
}
void MallocHeapThreshold::updateAfterGC(size_t lastBytes, size_t baseBytes,
float growthFactor,
const AutoLockGC& lock) {
bytes_ = computeZoneTriggerBytes(growthFactor, lastBytes, baseBytes, lock);
}
#ifdef DEBUG
void MemoryTracker::adopt(MemoryTracker& other) {
LockGuard<Mutex> lock(mutex);
AutoEnterOOMUnsafeRegion oomUnsafe;
for (auto r = other.gcMap.all(); !r.empty(); r.popFront()) {
if (!gcMap.put(r.front().key(), r.front().value())) {
oomUnsafe.crash("MemoryTracker::adopt");
}
}
other.gcMap.clear();
// There may still be ZoneAllocPolicies associated with the old zone since
// some are not destroyed until the zone itself dies. Instead check there is
// no memory associated with them and clear their zone pointer in debug builds
// to catch further memory association.
for (auto r = other.nonGCMap.all(); !r.empty(); r.popFront()) {
MOZ_ASSERT(r.front().value() == 0);
if (r.front().key().use() == MemoryUse::ZoneAllocPolicy) {
auto policy = static_cast<ZoneAllocPolicy*>(r.front().key().ptr());
policy->zone_ = nullptr;
}
}
other.nonGCMap.clear();
}
static const char* MemoryUseName(MemoryUse use) {
switch (use) {
# define DEFINE_CASE(Name) \
case MemoryUse::Name: \
return #Name;
JS_FOR_EACH_MEMORY_USE(DEFINE_CASE)
# undef DEFINE_CASE
}
MOZ_CRASH("Unknown memory use");
}
MemoryTracker::MemoryTracker() : mutex(mutexid::MemoryTracker) {}
void MemoryTracker::checkEmptyOnDestroy() {
bool ok = true;
if (!gcMap.empty()) {
ok = false;
fprintf(stderr, "Missing calls to JS::RemoveAssociatedMemory:\n");
for (auto r = gcMap.all(); !r.empty(); r.popFront()) {
fprintf(stderr, " %p 0x%zx %s\n", r.front().key().ptr(),
r.front().value(), MemoryUseName(r.front().key().use()));
}
}
if (!nonGCMap.empty()) {
ok = false;
fprintf(stderr, "Missing calls to Zone::decNonGCMemory:\n");
for (auto r = nonGCMap.all(); !r.empty(); r.popFront()) {
fprintf(stderr, " %p 0x%zx\n", r.front().key().ptr(), r.front().value());
}
}
MOZ_ASSERT(ok);
}
/* static */
inline bool MemoryTracker::isGCMemoryUse(MemoryUse use) {
// Most memory uses are for memory associated with GC things but some are for
// memory associated with non-GC thing pointers.
return !isNonGCMemoryUse(use);
}
/* static */
inline bool MemoryTracker::isNonGCMemoryUse(MemoryUse use) {
return use == MemoryUse::ZoneAllocPolicy;
}
/* static */
inline bool MemoryTracker::allowMultipleAssociations(MemoryUse use) {
// For most uses only one association is possible for each GC thing. Allow a
// one-to-many relationship only where necessary.
return isNonGCMemoryUse(use) || use == MemoryUse::RegExpSharedBytecode ||
use == MemoryUse::BreakpointSite || use == MemoryUse::Breakpoint ||
use == MemoryUse::ForOfPICStub || use == MemoryUse::ICUObject;
}
void MemoryTracker::trackGCMemory(Cell* cell, size_t nbytes, MemoryUse use) {
MOZ_ASSERT(cell->isTenured());
MOZ_ASSERT(isGCMemoryUse(use));
LockGuard<Mutex> lock(mutex);
Key<Cell> key{cell, use};
AutoEnterOOMUnsafeRegion oomUnsafe;
auto ptr = gcMap.lookupForAdd(key);
if (ptr) {
if (!allowMultipleAssociations(use)) {
MOZ_CRASH_UNSAFE_PRINTF("Association already present: %p 0x%zx %s", cell,
nbytes, MemoryUseName(use));
}
ptr->value() += nbytes;
return;
}
if (!gcMap.add(ptr, key, nbytes)) {
oomUnsafe.crash("MemoryTracker::trackGCMemory");
}
}
void MemoryTracker::untrackGCMemory(Cell* cell, size_t nbytes, MemoryUse use) {
MOZ_ASSERT(cell->isTenured());
LockGuard<Mutex> lock(mutex);
Key<Cell> key{cell, use};
auto ptr = gcMap.lookup(key);
if (!ptr) {
MOZ_CRASH_UNSAFE_PRINTF("Association not found: %p 0x%zx %s", cell, nbytes,
MemoryUseName(use));
}
if (!allowMultipleAssociations(use) && ptr->value() != nbytes) {
MOZ_CRASH_UNSAFE_PRINTF(
"Association for %p %s has different size: "
"expected 0x%zx but got 0x%zx",
cell, MemoryUseName(use), ptr->value(), nbytes);
}
if (nbytes > ptr->value()) {
MOZ_CRASH_UNSAFE_PRINTF(
"Association for %p %s size is too large: "
"expected at most 0x%zx but got 0x%zx",
cell, MemoryUseName(use), ptr->value(), nbytes);
}
ptr->value() -= nbytes;
if (ptr->value() == 0) {
gcMap.remove(ptr);
}
}
void MemoryTracker::swapGCMemory(Cell* a, Cell* b, MemoryUse use) {
MOZ_ASSERT(a->isTenured());
MOZ_ASSERT(b->isTenured());
Key<Cell> ka{a, use};
Key<Cell> kb{b, use};
LockGuard<Mutex> lock(mutex);
size_t sa = getAndRemoveEntry(ka, lock);
size_t sb = getAndRemoveEntry(kb, lock);
AutoEnterOOMUnsafeRegion oomUnsafe;
if ((sa && !gcMap.put(kb, sa)) || (sb && !gcMap.put(ka, sb))) {
oomUnsafe.crash("MemoryTracker::swapGCMemory");
}
}
size_t MemoryTracker::getAndRemoveEntry(const Key<Cell>& key,
LockGuard<Mutex>& lock) {
auto ptr = gcMap.lookup(key);
if (!ptr) {
return 0;
}
size_t size = ptr->value();
gcMap.remove(ptr);
return size;
}
void MemoryTracker::registerNonGCMemory(void* mem, MemoryUse use) {
LockGuard<Mutex> lock(mutex);
Key<void> key{mem, use};
auto ptr = nonGCMap.lookupForAdd(key);
if (ptr) {
MOZ_CRASH_UNSAFE_PRINTF("%s assocaition %p already registered",
MemoryUseName(use), mem);
}
AutoEnterOOMUnsafeRegion oomUnsafe;
if (!nonGCMap.add(ptr, key, 0)) {
oomUnsafe.crash("MemoryTracker::registerNonGCMemory");
}
}
void MemoryTracker::unregisterNonGCMemory(void* mem, MemoryUse use) {
LockGuard<Mutex> lock(mutex);
Key<void> key{mem, use};
auto ptr = nonGCMap.lookup(key);
if (!ptr) {
MOZ_CRASH_UNSAFE_PRINTF("%s association %p not found", MemoryUseName(use),
mem);
}
if (ptr->value() != 0) {
MOZ_CRASH_UNSAFE_PRINTF(
"%s association %p still has 0x%zx bytes associated",
MemoryUseName(use), mem, ptr->value());
}
nonGCMap.remove(ptr);
}
void MemoryTracker::moveNonGCMemory(void* dst, void* src, MemoryUse use) {
LockGuard<Mutex> lock(mutex);
Key<void> srcKey{src, use};
auto srcPtr = nonGCMap.lookup(srcKey);
if (!srcPtr) {
MOZ_CRASH_UNSAFE_PRINTF("%s association %p not found", MemoryUseName(use),
src);
}
size_t nbytes = srcPtr->value();
nonGCMap.remove(srcPtr);
Key<void> dstKey{dst, use};
auto dstPtr = nonGCMap.lookupForAdd(dstKey);
if (dstPtr) {
MOZ_CRASH_UNSAFE_PRINTF("%s %p already registered", MemoryUseName(use),
dst);
}
AutoEnterOOMUnsafeRegion oomUnsafe;
if (!nonGCMap.add(dstPtr, dstKey, nbytes)) {
oomUnsafe.crash("MemoryTracker::moveNonGCMemory");
}
}
void MemoryTracker::incNonGCMemory(void* mem, size_t nbytes, MemoryUse use) {
MOZ_ASSERT(isNonGCMemoryUse(use));
LockGuard<Mutex> lock(mutex);
Key<void> key{mem, use};
auto ptr = nonGCMap.lookup(key);
if (!ptr) {
MOZ_CRASH_UNSAFE_PRINTF("%s allocation %p not found", MemoryUseName(use),
mem);
}
ptr->value() += nbytes;
}
void MemoryTracker::decNonGCMemory(void* mem, size_t nbytes, MemoryUse use) {
MOZ_ASSERT(isNonGCMemoryUse(use));
LockGuard<Mutex> lock(mutex);
Key<void> key{mem, use};
auto ptr = nonGCMap.lookup(key);
if (!ptr) {
MOZ_CRASH_UNSAFE_PRINTF("%s allocation %p not found", MemoryUseName(use),
mem);
}
size_t& value = ptr->value();
if (nbytes > value) {
MOZ_CRASH_UNSAFE_PRINTF(
"%s allocation %p is too large: "
"expected at most 0x%zx but got 0x%zx bytes",
MemoryUseName(use), mem, value, nbytes);
}
value -= nbytes;
}
void MemoryTracker::fixupAfterMovingGC() {
// Update the table after we move GC things. We don't use MovableCellHasher
// because that would create a difference between debug and release builds.
for (GCMap::Enum e(gcMap); !e.empty(); e.popFront()) {
const auto& key = e.front().key();
Cell* cell = key.ptr();
if (cell->isForwarded()) {
cell = gc::RelocationOverlay::fromCell(cell)->forwardingAddress();
e.rekeyFront(Key<Cell>{cell, key.use()});
}
}
}
template <typename Ptr>
inline MemoryTracker::Key<Ptr>::Key(Ptr* ptr, MemoryUse use)
: ptr_(uint64_t(ptr)), use_(uint64_t(use)) {
# ifdef JS_64BIT
static_assert(sizeof(Key) == 8,
"MemoryTracker::Key should be packed into 8 bytes");
# endif
MOZ_ASSERT(this->ptr() == ptr);
MOZ_ASSERT(this->use() == use);
}
template <typename Ptr>
inline Ptr* MemoryTracker::Key<Ptr>::ptr() const {
return reinterpret_cast<Ptr*>(ptr_);
}
template <typename Ptr>
inline MemoryUse MemoryTracker::Key<Ptr>::use() const {
return static_cast<MemoryUse>(use_);
}
template <typename Ptr>
inline HashNumber MemoryTracker::Hasher<Ptr>::hash(const Lookup& l) {
return mozilla::HashGeneric(DefaultHasher<Ptr*>::hash(l.ptr()),
DefaultHasher<unsigned>::hash(unsigned(l.use())));
}
template <typename Ptr>
inline bool MemoryTracker::Hasher<Ptr>::match(const KeyT& k, const Lookup& l) {
return k.ptr() == l.ptr() && k.use() == l.use();
}
template <typename Ptr>
inline void MemoryTracker::Hasher<Ptr>::rekey(KeyT& k, const KeyT& newKey) {
k = newKey;
}
#endif // DEBUG