forked from nodejs/node
-
Notifications
You must be signed in to change notification settings - Fork 5
/
compilation-dependencies.cc
1399 lines (1201 loc) · 47.8 KB
/
compilation-dependencies.cc
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
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/compilation-dependencies.h"
#include "src/base/optional.h"
#include "src/execution/protectors.h"
#include "src/handles/handles-inl.h"
#include "src/objects/allocation-site-inl.h"
#include "src/objects/internal-index.h"
#include "src/objects/js-array-inl.h"
#include "src/objects/js-function-inl.h"
#include "src/objects/objects-inl.h"
namespace v8 {
namespace internal {
namespace compiler {
#define DEPENDENCY_LIST(V) \
V(ConsistentJSFunctionView) \
V(ConstantInDictionaryPrototypeChain) \
V(ElementsKind) \
V(FieldConstness) \
V(FieldRepresentation) \
V(FieldType) \
V(GlobalProperty) \
V(InitialMap) \
V(InitialMapInstanceSizePrediction) \
V(OwnConstantDataProperty) \
V(OwnConstantDictionaryProperty) \
V(OwnConstantElement) \
V(PretenureMode) \
V(Protector) \
V(PrototypeProperty) \
V(StableMap) \
V(Transition) \
V(ObjectSlotValue)
CompilationDependencies::CompilationDependencies(JSHeapBroker* broker,
Zone* zone)
: zone_(zone), broker_(broker), dependencies_(zone) {
broker->set_dependencies(this);
}
namespace {
enum CompilationDependencyKind {
#define V(Name) k##Name,
DEPENDENCY_LIST(V)
#undef V
};
#define V(Name) class Name##Dependency;
DEPENDENCY_LIST(V)
#undef V
const char* CompilationDependencyKindToString(CompilationDependencyKind kind) {
#define V(Name) #Name "Dependency",
static const char* const names[] = {DEPENDENCY_LIST(V)};
#undef V
return names[kind];
}
class PendingDependencies;
} // namespace
class CompilationDependency : public ZoneObject {
public:
explicit CompilationDependency(CompilationDependencyKind kind) : kind(kind) {}
virtual bool IsValid() const = 0;
virtual void PrepareInstall() const {}
virtual void Install(PendingDependencies* deps) const = 0;
#define V(Name) \
bool Is##Name() const { return kind == k##Name; } \
V8_ALLOW_UNUSED const Name##Dependency* As##Name() const;
DEPENDENCY_LIST(V)
#undef V
const char* ToString() const {
return CompilationDependencyKindToString(kind);
}
const CompilationDependencyKind kind;
private:
virtual size_t Hash() const = 0;
virtual bool Equals(const CompilationDependency* that) const = 0;
friend struct CompilationDependencies::CompilationDependencyHash;
friend struct CompilationDependencies::CompilationDependencyEqual;
};
size_t CompilationDependencies::CompilationDependencyHash::operator()(
const CompilationDependency* dep) const {
return base::hash_combine(dep->kind, dep->Hash());
}
bool CompilationDependencies::CompilationDependencyEqual::operator()(
const CompilationDependency* lhs, const CompilationDependency* rhs) const {
return lhs->kind == rhs->kind && lhs->Equals(rhs);
}
namespace {
// Dependencies can only be fully deduplicated immediately prior to
// installation (because PrepareInstall may create the object on which the dep
// will be installed). We gather and dedupe deps in this class, and install
// them from here.
class PendingDependencies final {
public:
explicit PendingDependencies(Zone* zone) : deps_(zone) {}
void Register(Handle<HeapObject> object,
DependentCode::DependencyGroup group) {
// Code, which are per-local Isolate, cannot depend on objects in the shared
// heap. Shared heap dependencies are designed to never invalidate
// assumptions. E.g., maps for shared structs do not have transitions or
// change the shape of their fields. See
// DependentCode::DeoptimizeDependencyGroups for corresponding DCHECK.
if (object->InSharedWritableHeap()) return;
deps_[object] |= group;
}
void InstallAll(Isolate* isolate, Handle<Code> code) {
if (V8_UNLIKELY(FLAG_predictable)) {
InstallAllPredictable(isolate, code);
return;
}
// With deduplication done we no longer rely on the object address for
// hashing.
AllowGarbageCollection yes_gc;
for (const auto& o_and_g : deps_) {
DependentCode::InstallDependency(isolate, code, o_and_g.first,
o_and_g.second);
}
}
void InstallAllPredictable(Isolate* isolate, Handle<Code> code) {
CHECK(FLAG_predictable);
// First, guarantee predictable iteration order.
using HandleAndGroup =
std::pair<Handle<HeapObject>, DependentCode::DependencyGroups>;
std::vector<HandleAndGroup> entries(deps_.begin(), deps_.end());
std::sort(entries.begin(), entries.end(),
[](const HandleAndGroup& lhs, const HandleAndGroup& rhs) {
return lhs.first->ptr() < rhs.first->ptr();
});
// With deduplication done we no longer rely on the object address for
// hashing.
AllowGarbageCollection yes_gc;
for (const auto& o_and_g : entries) {
DependentCode::InstallDependency(isolate, code, o_and_g.first,
o_and_g.second);
}
}
private:
struct HandleHash {
size_t operator()(const Handle<HeapObject>& x) const {
return static_cast<size_t>(x->ptr());
}
};
struct HandleEqual {
bool operator()(const Handle<HeapObject>& lhs,
const Handle<HeapObject>& rhs) const {
return lhs.is_identical_to(rhs);
}
};
ZoneUnorderedMap<Handle<HeapObject>, DependentCode::DependencyGroups,
HandleHash, HandleEqual>
deps_;
const DisallowGarbageCollection no_gc_;
};
class InitialMapDependency final : public CompilationDependency {
public:
InitialMapDependency(JSHeapBroker* broker, const JSFunctionRef& function,
const MapRef& initial_map)
: CompilationDependency(kInitialMap),
function_(function),
initial_map_(initial_map) {}
bool IsValid() const override {
Handle<JSFunction> function = function_.object();
return function->has_initial_map() &&
function->initial_map() == *initial_map_.object();
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(initial_map_.object(),
DependentCode::kInitialMapChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(function_), h(initial_map_));
}
bool Equals(const CompilationDependency* that) const override {
const InitialMapDependency* const zat = that->AsInitialMap();
return function_.equals(zat->function_) &&
initial_map_.equals(zat->initial_map_);
}
const JSFunctionRef function_;
const MapRef initial_map_;
};
class PrototypePropertyDependency final : public CompilationDependency {
public:
PrototypePropertyDependency(JSHeapBroker* broker,
const JSFunctionRef& function,
const ObjectRef& prototype)
: CompilationDependency(kPrototypeProperty),
function_(function),
prototype_(prototype) {
DCHECK(function_.has_instance_prototype(broker->dependencies()));
DCHECK(!function_.PrototypeRequiresRuntimeLookup(broker->dependencies()));
DCHECK(function_.instance_prototype(broker->dependencies())
.equals(prototype_));
}
bool IsValid() const override {
Handle<JSFunction> function = function_.object();
return function->has_prototype_slot() &&
function->has_instance_prototype() &&
!function->PrototypeRequiresRuntimeLookup() &&
function->instance_prototype() == *prototype_.object();
}
void PrepareInstall() const override {
SLOW_DCHECK(IsValid());
Handle<JSFunction> function = function_.object();
if (!function->has_initial_map()) JSFunction::EnsureHasInitialMap(function);
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
Handle<JSFunction> function = function_.object();
CHECK(function->has_initial_map());
Handle<Map> initial_map(function->initial_map(), function_.isolate());
deps->Register(initial_map, DependentCode::kInitialMapChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(function_), h(prototype_));
}
bool Equals(const CompilationDependency* that) const override {
const PrototypePropertyDependency* const zat = that->AsPrototypeProperty();
return function_.equals(zat->function_) &&
prototype_.equals(zat->prototype_);
}
const JSFunctionRef function_;
const ObjectRef prototype_;
};
class StableMapDependency final : public CompilationDependency {
public:
explicit StableMapDependency(const MapRef& map)
: CompilationDependency(kStableMap), map_(map) {}
bool IsValid() const override {
// TODO(v8:11670): Consider turn this back into a CHECK inside the
// constructor and DependOnStableMap, if possible in light of concurrent
// heap state modifications.
return !map_.object()->is_dictionary_map() && map_.object()->is_stable();
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(map_.object(), DependentCode::kPrototypeCheckGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(map_));
}
bool Equals(const CompilationDependency* that) const override {
const StableMapDependency* const zat = that->AsStableMap();
return map_.equals(zat->map_);
}
const MapRef map_;
};
class ConstantInDictionaryPrototypeChainDependency final
: public CompilationDependency {
public:
explicit ConstantInDictionaryPrototypeChainDependency(
const MapRef receiver_map, const NameRef property_name,
const ObjectRef constant, PropertyKind kind)
: CompilationDependency(kConstantInDictionaryPrototypeChain),
receiver_map_(receiver_map),
property_name_{property_name},
constant_{constant},
kind_{kind} {
DCHECK(V8_DICT_PROPERTY_CONST_TRACKING_BOOL);
}
// Checks that |constant_| is still the value of accessing |property_name_|
// starting at |receiver_map_|.
bool IsValid() const override { return !GetHolderIfValid().is_null(); }
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
Isolate* isolate = receiver_map_.isolate();
Handle<JSObject> holder = GetHolderIfValid().ToHandleChecked();
Handle<Map> map = receiver_map_.object();
while (map->prototype() != *holder) {
map = handle(map->prototype().map(), isolate);
DCHECK(map->IsJSObjectMap()); // Due to IsValid holding.
deps->Register(map, DependentCode::kPrototypeCheckGroup);
}
DCHECK(map->prototype().map().IsJSObjectMap()); // Due to IsValid holding.
deps->Register(handle(map->prototype().map(), isolate),
DependentCode::kPrototypeCheckGroup);
}
private:
// If the dependency is still valid, returns holder of the constant. Otherwise
// returns null.
// TODO(neis) Currently, invoking IsValid and then Install duplicates the call
// to GetHolderIfValid. Instead, consider letting IsValid change the state
// (and store the holder), or merge IsValid and Install.
MaybeHandle<JSObject> GetHolderIfValid() const {
DisallowGarbageCollection no_gc;
Isolate* isolate = receiver_map_.isolate();
Handle<Object> holder;
HeapObject prototype = receiver_map_.object()->prototype();
enum class ValidationResult { kFoundCorrect, kFoundIncorrect, kNotFound };
auto try_load = [&](auto dictionary) -> ValidationResult {
InternalIndex entry =
dictionary.FindEntry(isolate, property_name_.object());
if (entry.is_not_found()) {
return ValidationResult::kNotFound;
}
PropertyDetails details = dictionary.DetailsAt(entry);
if (details.constness() != PropertyConstness::kConst) {
return ValidationResult::kFoundIncorrect;
}
Object dictionary_value = dictionary.ValueAt(entry);
Object value;
// We must be able to detect the case that the property |property_name_|
// of |holder_| was originally a plain function |constant_| (when creating
// this dependency) and has since become an accessor whose getter is
// |constant_|. Therefore, we cannot just look at the property kind of
// |details|, because that reflects the current situation, not the one
// when creating this dependency.
if (details.kind() != kind_) {
return ValidationResult::kFoundIncorrect;
}
if (kind_ == PropertyKind::kAccessor) {
if (!dictionary_value.IsAccessorPair()) {
return ValidationResult::kFoundIncorrect;
}
// Only supporting loading at the moment, so we only ever want the
// getter.
value = AccessorPair::cast(dictionary_value)
.get(AccessorComponent::ACCESSOR_GETTER);
} else {
value = dictionary_value;
}
return value == *constant_.object() ? ValidationResult::kFoundCorrect
: ValidationResult::kFoundIncorrect;
};
while (prototype.IsJSObject()) {
// We only care about JSObjects because that's the only type of holder
// (and types of prototypes on the chain to the holder) that
// AccessInfoFactory::ComputePropertyAccessInfo allows.
JSObject object = JSObject::cast(prototype);
// We only support dictionary mode prototypes on the chain for this kind
// of dependency.
CHECK(!object.HasFastProperties());
ValidationResult result =
V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL
? try_load(object.property_dictionary_swiss())
: try_load(object.property_dictionary());
if (result == ValidationResult::kFoundCorrect) {
return handle(object, isolate);
} else if (result == ValidationResult::kFoundIncorrect) {
return MaybeHandle<JSObject>();
}
// In case of kNotFound, continue walking up the chain.
prototype = object.map().prototype();
}
return MaybeHandle<JSObject>();
}
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(receiver_map_), h(property_name_), h(constant_),
static_cast<int>(kind_));
}
bool Equals(const CompilationDependency* that) const override {
const ConstantInDictionaryPrototypeChainDependency* const zat =
that->AsConstantInDictionaryPrototypeChain();
return receiver_map_.equals(zat->receiver_map_) &&
property_name_.equals(zat->property_name_) &&
constant_.equals(zat->constant_) && kind_ == zat->kind_;
}
const MapRef receiver_map_;
const NameRef property_name_;
const ObjectRef constant_;
const PropertyKind kind_;
};
class OwnConstantDataPropertyDependency final : public CompilationDependency {
public:
OwnConstantDataPropertyDependency(JSHeapBroker* broker,
const JSObjectRef& holder,
const MapRef& map,
Representation representation,
FieldIndex index, const ObjectRef& value)
: CompilationDependency(kOwnConstantDataProperty),
broker_(broker),
holder_(holder),
map_(map),
representation_(representation),
index_(index),
value_(value) {}
bool IsValid() const override {
if (holder_.object()->map() != *map_.object()) {
TRACE_BROKER_MISSING(broker_,
"Map change detected in " << holder_.object());
return false;
}
DisallowGarbageCollection no_heap_allocation;
Object current_value = holder_.object()->RawFastPropertyAt(index_);
Object used_value = *value_.object();
if (representation_.IsDouble()) {
// Compare doubles by bit pattern.
if (!current_value.IsHeapNumber() || !used_value.IsHeapNumber() ||
HeapNumber::cast(current_value).value_as_bits(kRelaxedLoad) !=
HeapNumber::cast(used_value).value_as_bits(kRelaxedLoad)) {
TRACE_BROKER_MISSING(broker_,
"Constant Double property value changed in "
<< holder_.object() << " at FieldIndex "
<< index_.property_index());
return false;
}
} else if (current_value != used_value) {
TRACE_BROKER_MISSING(broker_, "Constant property value changed in "
<< holder_.object() << " at FieldIndex "
<< index_.property_index());
return false;
}
return true;
}
void Install(PendingDependencies* deps) const override {}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(holder_), h(map_), representation_.kind(),
index_.bit_field(), h(value_));
}
bool Equals(const CompilationDependency* that) const override {
const OwnConstantDataPropertyDependency* const zat =
that->AsOwnConstantDataProperty();
return holder_.equals(zat->holder_) && map_.equals(zat->map_) &&
representation_.Equals(zat->representation_) &&
index_ == zat->index_ && value_.equals(zat->value_);
}
JSHeapBroker* const broker_;
JSObjectRef const holder_;
MapRef const map_;
Representation const representation_;
FieldIndex const index_;
ObjectRef const value_;
};
class OwnConstantDictionaryPropertyDependency final
: public CompilationDependency {
public:
OwnConstantDictionaryPropertyDependency(JSHeapBroker* broker,
const JSObjectRef& holder,
InternalIndex index,
const ObjectRef& value)
: CompilationDependency(kOwnConstantDictionaryProperty),
broker_(broker),
holder_(holder),
map_(holder.map()),
index_(index),
value_(value) {
// We depend on map() being cached.
static_assert(ref_traits<JSObject>::ref_serialization_kind !=
RefSerializationKind::kNeverSerialized);
}
bool IsValid() const override {
if (holder_.object()->map() != *map_.object()) {
TRACE_BROKER_MISSING(broker_,
"Map change detected in " << holder_.object());
return false;
}
base::Optional<Object> maybe_value = JSObject::DictionaryPropertyAt(
holder_.object(), index_, broker_->isolate()->heap());
if (!maybe_value) {
TRACE_BROKER_MISSING(
broker_, holder_.object()
<< "has a value that might not safe to read at index "
<< index_.as_int());
return false;
}
if (*maybe_value != *value_.object()) {
TRACE_BROKER_MISSING(broker_, "Constant property value changed in "
<< holder_.object()
<< " at InternalIndex "
<< index_.as_int());
return false;
}
return true;
}
void Install(PendingDependencies* deps) const override {}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(holder_), h(map_), index_.raw_value(),
h(value_));
}
bool Equals(const CompilationDependency* that) const override {
const OwnConstantDictionaryPropertyDependency* const zat =
that->AsOwnConstantDictionaryProperty();
return holder_.equals(zat->holder_) && map_.equals(zat->map_) &&
index_ == zat->index_ && value_.equals(zat->value_);
}
JSHeapBroker* const broker_;
JSObjectRef const holder_;
MapRef const map_;
InternalIndex const index_;
ObjectRef const value_;
};
class ConsistentJSFunctionViewDependency final : public CompilationDependency {
public:
explicit ConsistentJSFunctionViewDependency(const JSFunctionRef& function)
: CompilationDependency(kConsistentJSFunctionView), function_(function) {}
bool IsValid() const override {
return function_.IsConsistentWithHeapState();
}
void Install(PendingDependencies* deps) const override {}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(function_));
}
bool Equals(const CompilationDependency* that) const override {
const ConsistentJSFunctionViewDependency* const zat =
that->AsConsistentJSFunctionView();
return function_.equals(zat->function_);
}
const JSFunctionRef function_;
};
class TransitionDependency final : public CompilationDependency {
public:
explicit TransitionDependency(const MapRef& map)
: CompilationDependency(kTransition), map_(map) {
DCHECK(map_.CanBeDeprecated());
}
bool IsValid() const override { return !map_.object()->is_deprecated(); }
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(map_.object(), DependentCode::kTransitionGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(map_));
}
bool Equals(const CompilationDependency* that) const override {
const TransitionDependency* const zat = that->AsTransition();
return map_.equals(zat->map_);
}
const MapRef map_;
};
class PretenureModeDependency final : public CompilationDependency {
public:
PretenureModeDependency(const AllocationSiteRef& site,
AllocationType allocation)
: CompilationDependency(kPretenureMode),
site_(site),
allocation_(allocation) {}
bool IsValid() const override {
return allocation_ == site_.object()->GetAllocationType();
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(site_.object(),
DependentCode::kAllocationSiteTenuringChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(site_), allocation_);
}
bool Equals(const CompilationDependency* that) const override {
const PretenureModeDependency* const zat = that->AsPretenureMode();
return site_.equals(zat->site_) && allocation_ == zat->allocation_;
}
const AllocationSiteRef site_;
const AllocationType allocation_;
};
class FieldRepresentationDependency final : public CompilationDependency {
public:
FieldRepresentationDependency(const MapRef& map, InternalIndex descriptor,
Representation representation)
: CompilationDependency(kFieldRepresentation),
map_(map),
descriptor_(descriptor),
representation_(representation) {}
bool IsValid() const override {
DisallowGarbageCollection no_heap_allocation;
if (map_.object()->is_deprecated()) return false;
return representation_.Equals(map_.object()
->instance_descriptors(map_.isolate())
.GetDetails(descriptor_)
.representation());
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
Isolate* isolate = map_.isolate();
Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
isolate);
CHECK(!owner->is_deprecated());
CHECK(representation_.Equals(owner->instance_descriptors(isolate)
.GetDetails(descriptor_)
.representation()));
deps->Register(owner, DependentCode::kFieldRepresentationGroup);
}
bool DependsOn(const Handle<Map>& receiver_map) const {
return map_.object().equals(receiver_map);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(map_), descriptor_.as_int(),
representation_.kind());
}
bool Equals(const CompilationDependency* that) const override {
const FieldRepresentationDependency* const zat =
that->AsFieldRepresentation();
return map_.equals(zat->map_) && descriptor_ == zat->descriptor_ &&
representation_.Equals(zat->representation_);
}
const MapRef map_;
const InternalIndex descriptor_;
const Representation representation_;
};
class FieldTypeDependency final : public CompilationDependency {
public:
FieldTypeDependency(const MapRef& map, InternalIndex descriptor,
const ObjectRef& type)
: CompilationDependency(kFieldType),
map_(map),
descriptor_(descriptor),
type_(type) {}
bool IsValid() const override {
DisallowGarbageCollection no_heap_allocation;
if (map_.object()->is_deprecated()) return false;
return *type_.object() == map_.object()
->instance_descriptors(map_.isolate())
.GetFieldType(descriptor_);
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
Isolate* isolate = map_.isolate();
Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
isolate);
CHECK(!owner->is_deprecated());
CHECK_EQ(*type_.object(),
owner->instance_descriptors(isolate).GetFieldType(descriptor_));
deps->Register(owner, DependentCode::kFieldTypeGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(map_), descriptor_.as_int(), h(type_));
}
bool Equals(const CompilationDependency* that) const override {
const FieldTypeDependency* const zat = that->AsFieldType();
return map_.equals(zat->map_) && descriptor_ == zat->descriptor_ &&
type_.equals(zat->type_);
}
const MapRef map_;
const InternalIndex descriptor_;
const ObjectRef type_;
};
class FieldConstnessDependency final : public CompilationDependency {
public:
FieldConstnessDependency(const MapRef& map, InternalIndex descriptor)
: CompilationDependency(kFieldConstness),
map_(map),
descriptor_(descriptor) {}
bool IsValid() const override {
DisallowGarbageCollection no_heap_allocation;
if (map_.object()->is_deprecated()) return false;
return PropertyConstness::kConst ==
map_.object()
->instance_descriptors(map_.isolate())
.GetDetails(descriptor_)
.constness();
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
Isolate* isolate = map_.isolate();
Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
isolate);
CHECK(!owner->is_deprecated());
CHECK_EQ(PropertyConstness::kConst, owner->instance_descriptors(isolate)
.GetDetails(descriptor_)
.constness());
deps->Register(owner, DependentCode::kFieldConstGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(map_), descriptor_.as_int());
}
bool Equals(const CompilationDependency* that) const override {
const FieldConstnessDependency* const zat = that->AsFieldConstness();
return map_.equals(zat->map_) && descriptor_ == zat->descriptor_;
}
const MapRef map_;
const InternalIndex descriptor_;
};
class GlobalPropertyDependency final : public CompilationDependency {
public:
GlobalPropertyDependency(const PropertyCellRef& cell, PropertyCellType type,
bool read_only)
: CompilationDependency(kGlobalProperty),
cell_(cell),
type_(type),
read_only_(read_only) {
DCHECK_EQ(type_, cell_.property_details().cell_type());
DCHECK_EQ(read_only_, cell_.property_details().IsReadOnly());
}
bool IsValid() const override {
Handle<PropertyCell> cell = cell_.object();
// The dependency is never valid if the cell is 'invalidated'. This is
// marked by setting the value to the hole.
if (cell->value() == *(cell_.isolate()->factory()->the_hole_value())) {
return false;
}
return type_ == cell->property_details().cell_type() &&
read_only_ == cell->property_details().IsReadOnly();
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(cell_.object(), DependentCode::kPropertyCellChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(cell_), static_cast<int>(type_), read_only_);
}
bool Equals(const CompilationDependency* that) const override {
const GlobalPropertyDependency* const zat = that->AsGlobalProperty();
return cell_.equals(zat->cell_) && type_ == zat->type_ &&
read_only_ == zat->read_only_;
}
const PropertyCellRef cell_;
const PropertyCellType type_;
const bool read_only_;
};
class ProtectorDependency final : public CompilationDependency {
public:
explicit ProtectorDependency(const PropertyCellRef& cell)
: CompilationDependency(kProtector), cell_(cell) {}
bool IsValid() const override {
Handle<PropertyCell> cell = cell_.object();
return cell->value() == Smi::FromInt(Protectors::kProtectorValid);
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(cell_.object(), DependentCode::kPropertyCellChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(cell_));
}
bool Equals(const CompilationDependency* that) const override {
const ProtectorDependency* const zat = that->AsProtector();
return cell_.equals(zat->cell_);
}
const PropertyCellRef cell_;
};
// Check that an object slot will not change during compilation.
class ObjectSlotValueDependency final : public CompilationDependency {
public:
explicit ObjectSlotValueDependency(const HeapObjectRef& object, int offset,
const ObjectRef& value)
: CompilationDependency(kObjectSlotValue),
object_(object.object()),
offset_(offset),
value_(value.object()) {}
bool IsValid() const override {
PtrComprCageBase cage_base = GetPtrComprCageBase(*object_);
Object current_value =
offset_ == HeapObject::kMapOffset
? object_->map()
: TaggedField<Object>::Relaxed_Load(cage_base, *object_, offset_);
return *value_ == current_value;
}
void Install(PendingDependencies* deps) const override {}
private:
size_t Hash() const override {
return base::hash_combine(object_.address(), offset_, value_.address());
}
bool Equals(const CompilationDependency* that) const override {
const ObjectSlotValueDependency* const zat = that->AsObjectSlotValue();
return object_->address() == zat->object_->address() &&
offset_ == zat->offset_ && value_.address() == zat->value_.address();
}
Handle<HeapObject> object_;
int offset_;
Handle<Object> value_;
};
class ElementsKindDependency final : public CompilationDependency {
public:
ElementsKindDependency(const AllocationSiteRef& site, ElementsKind kind)
: CompilationDependency(kElementsKind), site_(site), kind_(kind) {
DCHECK(AllocationSite::ShouldTrack(kind_));
}
bool IsValid() const override {
Handle<AllocationSite> site = site_.object();
ElementsKind kind =
site->PointsToLiteral()
? site->boilerplate(kAcquireLoad).map().elements_kind()
: site->GetElementsKind();
return kind_ == kind;
}
void Install(PendingDependencies* deps) const override {
SLOW_DCHECK(IsValid());
deps->Register(site_.object(),
DependentCode::kAllocationSiteTransitionChangedGroup);
}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(site_), static_cast<int>(kind_));
}
bool Equals(const CompilationDependency* that) const override {
const ElementsKindDependency* const zat = that->AsElementsKind();
return site_.equals(zat->site_) && kind_ == zat->kind_;
}
const AllocationSiteRef site_;
const ElementsKind kind_;
};
// Only valid if the holder can use direct reads, since validation uses
// GetOwnConstantElementFromHeap.
class OwnConstantElementDependency final : public CompilationDependency {
public:
OwnConstantElementDependency(const JSObjectRef& holder, uint32_t index,
const ObjectRef& element)
: CompilationDependency(kOwnConstantElement),
holder_(holder),
index_(index),
element_(element) {}
bool IsValid() const override {
DisallowGarbageCollection no_gc;
JSObject holder = *holder_.object();
base::Optional<Object> maybe_element =
holder_.GetOwnConstantElementFromHeap(holder.elements(),
holder.GetElementsKind(), index_);
if (!maybe_element.has_value()) return false;
return maybe_element.value() == *element_.object();
}
void Install(PendingDependencies* deps) const override {}
private:
size_t Hash() const override {
ObjectRef::Hash h;
return base::hash_combine(h(holder_), index_, h(element_));
}
bool Equals(const CompilationDependency* that) const override {
const OwnConstantElementDependency* const zat =
that->AsOwnConstantElement();
return holder_.equals(zat->holder_) && index_ == zat->index_ &&
element_.equals(zat->element_);
}
const JSObjectRef holder_;
const uint32_t index_;
const ObjectRef element_;
};
class InitialMapInstanceSizePredictionDependency final
: public CompilationDependency {
public:
InitialMapInstanceSizePredictionDependency(const JSFunctionRef& function,
int instance_size)
: CompilationDependency(kInitialMapInstanceSizePrediction),
function_(function),
instance_size_(instance_size) {}
bool IsValid() const override {
// The dependency is valid if the prediction is the same as the current
// slack tracking result.
if (!function_.object()->has_initial_map()) return false;
int instance_size = function_.object()->ComputeInstanceSizeWithMinSlack(
function_.isolate());
return instance_size == instance_size_;