chore: bump chromium to 142.0.7444.175 (39-x-y) (#49003)
* chore: bump chromium in DEPS to 142.0.7444.175 * chore: update patches --------- Co-authored-by: electron-roller[bot] <84116207+electron-roller[bot]@users.noreply.github.com> Co-authored-by: John Kleinschmidt <jkleinsc@electronjs.org>
This commit is contained in:
parent
00646c9db6
commit
14565211f7
4 changed files with 2 additions and 305 deletions
2
DEPS
2
DEPS
|
|
@ -2,7 +2,7 @@ gclient_gn_args_from = 'src'
|
|||
|
||||
vars = {
|
||||
'chromium_version':
|
||||
'142.0.7444.162',
|
||||
'142.0.7444.175',
|
||||
'node_version':
|
||||
'v22.21.1',
|
||||
'nan_version':
|
||||
|
|
|
|||
|
|
@ -1,3 +1,2 @@
|
|||
chore_allow_customizing_microtask_policy_per_context.patch
|
||||
turboshaft_avoid_introducing_too_many_variables.patch
|
||||
preserve_field_repr_in_property_array_extension.patch
|
||||
|
|
|
|||
|
|
@ -1,302 +0,0 @@
|
|||
From 0000000000000000000000000000000000000000 Mon Sep 17 00:00:00 2001
|
||||
From: Leszek Swirski <leszeks@chromium.org>
|
||||
Date: Wed, 12 Nov 2025 16:46:01 +0100
|
||||
Subject: Preserve field repr in property array extension
|
||||
|
||||
Walk the descriptor array in lockstep with the property array when
|
||||
extending the latter.
|
||||
|
||||
Fixed: 460017370
|
||||
Change-Id: If0b4fc3c5f62fc0cc373588cbddc3c0a95c7225c
|
||||
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/7146166
|
||||
Commit-Queue: Leszek Swirski <leszeks@chromium.org>
|
||||
Reviewed-by: Nico Hartmann <nicohartmann@chromium.org>
|
||||
Reviewed-by: Igor Sheludko <ishell@chromium.org>
|
||||
Cr-Commit-Position: refs/heads/main@{#103674}
|
||||
|
||||
diff --git a/src/compiler/access-builder.cc b/src/compiler/access-builder.cc
|
||||
index c0bf470ada9443c63805b9e331bfdceb230929a8..8517527ecc2df89289cde05d7bc124f34133a838 100644
|
||||
--- a/src/compiler/access-builder.cc
|
||||
+++ b/src/compiler/access-builder.cc
|
||||
@@ -4,6 +4,8 @@
|
||||
|
||||
#include "src/compiler/access-builder.h"
|
||||
|
||||
+#include "src/codegen/machine-type.h"
|
||||
+#include "src/compiler/property-access-builder.h"
|
||||
#include "src/compiler/type-cache.h"
|
||||
#include "src/handles/handles-inl.h"
|
||||
#include "src/objects/arguments.h"
|
||||
@@ -1097,12 +1099,16 @@ FieldAccess AccessBuilder::ForFeedbackVectorSlot(int index) {
|
||||
}
|
||||
|
||||
// static
|
||||
-FieldAccess AccessBuilder::ForPropertyArraySlot(int index) {
|
||||
+FieldAccess AccessBuilder::ForPropertyArraySlot(int index,
|
||||
+ Representation representation) {
|
||||
int offset = PropertyArray::OffsetOfElementAt(index);
|
||||
- FieldAccess access = {kTaggedBase, offset,
|
||||
- Handle<Name>(), OptionalMapRef(),
|
||||
- Type::Any(), MachineType::AnyTagged(),
|
||||
- kFullWriteBarrier, "PropertyArraySlot"};
|
||||
+ MachineType machine_type =
|
||||
+ representation.IsHeapObject() || representation.IsDouble()
|
||||
+ ? MachineType::TaggedPointer()
|
||||
+ : MachineType::AnyTagged();
|
||||
+ FieldAccess access = {
|
||||
+ kTaggedBase, offset, Handle<Name>(), OptionalMapRef(),
|
||||
+ Type::Any(), machine_type, kFullWriteBarrier, "PropertyArraySlot"};
|
||||
return access;
|
||||
}
|
||||
|
||||
diff --git a/src/compiler/access-builder.h b/src/compiler/access-builder.h
|
||||
index 0363f0fc34593c8cb5dfda4c3b59a59664d689e3..b946fc58690cbe5b12903a832d0178c83a87416c 100644
|
||||
--- a/src/compiler/access-builder.h
|
||||
+++ b/src/compiler/access-builder.h
|
||||
@@ -11,6 +11,7 @@
|
||||
#include "src/compiler/write-barrier-kind.h"
|
||||
#include "src/objects/elements-kind.h"
|
||||
#include "src/objects/js-objects.h"
|
||||
+#include "src/objects/property-details.h"
|
||||
|
||||
namespace v8 {
|
||||
namespace internal {
|
||||
@@ -323,7 +324,8 @@ class V8_EXPORT_PRIVATE AccessBuilder final
|
||||
static FieldAccess ForFeedbackVectorSlot(int index);
|
||||
|
||||
// Provides access to PropertyArray slots.
|
||||
- static FieldAccess ForPropertyArraySlot(int index);
|
||||
+ static FieldAccess ForPropertyArraySlot(int index,
|
||||
+ Representation representation);
|
||||
|
||||
// Provides access to ScopeInfo flags.
|
||||
static FieldAccess ForScopeInfoFlags();
|
||||
diff --git a/src/compiler/js-native-context-specialization.cc b/src/compiler/js-native-context-specialization.cc
|
||||
index 60b4df5fbb6b762cee6609c5f0b3452e68e0fe64..697bb0526d465df96378ea3f81ad725f49fd3dec 100644
|
||||
--- a/src/compiler/js-native-context-specialization.cc
|
||||
+++ b/src/compiler/js-native-context-specialization.cc
|
||||
@@ -38,6 +38,7 @@
|
||||
#include "src/objects/elements-kind.h"
|
||||
#include "src/objects/feedback-vector.h"
|
||||
#include "src/objects/heap-number.h"
|
||||
+#include "src/objects/property-details.h"
|
||||
#include "src/objects/string.h"
|
||||
|
||||
namespace v8 {
|
||||
@@ -4231,25 +4232,59 @@ Node* JSNativeContextSpecialization::BuildExtendPropertiesBackingStore(
|
||||
// for intermediate states of chains of property additions. That makes
|
||||
// it unclear what the best approach is here.
|
||||
DCHECK_EQ(map.UnusedPropertyFields(), 0);
|
||||
- int length = map.NextFreePropertyIndex() - map.GetInObjectProperties();
|
||||
+ int in_object_length = map.GetInObjectProperties();
|
||||
+ int length = map.NextFreePropertyIndex() - in_object_length;
|
||||
// Under normal circumstances, NextFreePropertyIndex() will always be larger
|
||||
// than GetInObjectProperties(). However, an attacker able to corrupt heap
|
||||
// memory can break this invariant, in which case we'll get confused here,
|
||||
// potentially causing a sandbox violation. This CHECK defends against that.
|
||||
SBXCHECK_GE(length, 0);
|
||||
int new_length = length + JSObject::kFieldsAdded;
|
||||
+
|
||||
+ // Find the descriptor index corresponding to the first out-of-object
|
||||
+ // property.
|
||||
+ DescriptorArrayRef descs = map.instance_descriptors(broker());
|
||||
+ InternalIndex first_out_of_object_descriptor(in_object_length);
|
||||
+ InternalIndex number_of_descriptors(descs.object()->number_of_descriptors());
|
||||
+ for (InternalIndex i(in_object_length); i < number_of_descriptors; ++i) {
|
||||
+ PropertyDetails details = descs.GetPropertyDetails(i);
|
||||
+ // Skip over non-field properties.
|
||||
+ if (details.location() != PropertyLocation::kField) {
|
||||
+ continue;
|
||||
+ }
|
||||
+ // Skip over in-object fields.
|
||||
+ // TODO(leszeks): We could make this smarter, like a binary search.
|
||||
+ if (details.field_index() < in_object_length) {
|
||||
+ continue;
|
||||
+ }
|
||||
+ first_out_of_object_descriptor = i;
|
||||
+ break;
|
||||
+ }
|
||||
+
|
||||
// Collect the field values from the {properties}.
|
||||
- ZoneVector<Node*> values(zone());
|
||||
+ ZoneVector<std::pair<Node*, Representation>> values(zone());
|
||||
values.reserve(new_length);
|
||||
- for (int i = 0; i < length; ++i) {
|
||||
+
|
||||
+ // Walk the property descriptors alongside the property values, to make
|
||||
+ // sure to get and store them with the right machine type.
|
||||
+ InternalIndex descriptor = first_out_of_object_descriptor;
|
||||
+ for (int i = 0; i < length; ++i, ++descriptor) {
|
||||
+ PropertyDetails details = descs.GetPropertyDetails(descriptor);
|
||||
+ while (details.location() != PropertyLocation::kField) {
|
||||
+ ++descriptor;
|
||||
+ details = descs.GetPropertyDetails(descriptor);
|
||||
+ }
|
||||
+ DCHECK_EQ(i, details.field_index() - in_object_length);
|
||||
Node* value = effect = graph()->NewNode(
|
||||
- simplified()->LoadField(AccessBuilder::ForFixedArraySlot(i)),
|
||||
+ simplified()->LoadField(
|
||||
+ AccessBuilder::ForPropertyArraySlot(i, details.representation())),
|
||||
properties, effect, control);
|
||||
- values.push_back(value);
|
||||
+ values.push_back({value, details.representation()});
|
||||
}
|
||||
// Initialize the new fields to undefined.
|
||||
for (int i = 0; i < JSObject::kFieldsAdded; ++i) {
|
||||
- values.push_back(jsgraph()->UndefinedConstant());
|
||||
+ values.push_back(
|
||||
+ {jsgraph()->UndefinedConstant(), Representation::Tagged()});
|
||||
}
|
||||
|
||||
// Compute new length and hash.
|
||||
@@ -4287,7 +4322,8 @@ Node* JSNativeContextSpecialization::BuildExtendPropertiesBackingStore(
|
||||
a.Store(AccessBuilder::ForMap(), jsgraph()->PropertyArrayMapConstant());
|
||||
a.Store(AccessBuilder::ForPropertyArrayLengthAndHash(), new_length_and_hash);
|
||||
for (int i = 0; i < new_length; ++i) {
|
||||
- a.Store(AccessBuilder::ForFixedArraySlot(i), values[i]);
|
||||
+ a.Store(AccessBuilder::ForPropertyArraySlot(i, values[i].second),
|
||||
+ values[i].first);
|
||||
}
|
||||
return a.Finish();
|
||||
}
|
||||
diff --git a/src/compiler/turboshaft/turbolev-early-lowering-reducer-inl.h b/src/compiler/turboshaft/turbolev-early-lowering-reducer-inl.h
|
||||
index bf0832ecc67bec1a6da711b9bff7266ba3df7d51..a6452e7cfb9e7d7d6d222bd625d13dabe4f97cb7 100644
|
||||
--- a/src/compiler/turboshaft/turbolev-early-lowering-reducer-inl.h
|
||||
+++ b/src/compiler/turboshaft/turbolev-early-lowering-reducer-inl.h
|
||||
@@ -14,6 +14,7 @@
|
||||
#include "src/compiler/turboshaft/representations.h"
|
||||
#include "src/deoptimizer/deoptimize-reason.h"
|
||||
#include "src/objects/contexts.h"
|
||||
+#include "src/objects/descriptor-array-inl.h"
|
||||
#include "src/objects/instance-type-inl.h"
|
||||
|
||||
namespace v8::internal::compiler::turboshaft {
|
||||
@@ -323,8 +324,32 @@ class TurbolevEarlyLoweringReducer : public Next {
|
||||
}
|
||||
|
||||
V<PropertyArray> ExtendPropertiesBackingStore(
|
||||
- V<PropertyArray> old_property_array, V<JSObject> object, int old_length,
|
||||
+ V<PropertyArray> old_property_array, V<JSObject> object,
|
||||
+ const compiler::MapRef& old_map, int old_length,
|
||||
V<FrameState> frame_state, const FeedbackSource& feedback) {
|
||||
+ int in_object_length = old_map.GetInObjectProperties();
|
||||
+
|
||||
+ // Find the descriptor index corresponding to the first out-of-object
|
||||
+ // property.
|
||||
+ DescriptorArrayRef descs = old_map.instance_descriptors(broker_);
|
||||
+ InternalIndex first_out_of_object_descriptor(in_object_length);
|
||||
+ InternalIndex number_of_descriptors(
|
||||
+ descs.object()->number_of_descriptors());
|
||||
+ for (InternalIndex i(in_object_length); i < number_of_descriptors; ++i) {
|
||||
+ PropertyDetails details = descs.GetPropertyDetails(i);
|
||||
+ // Skip over non-field properties.
|
||||
+ if (details.location() != PropertyLocation::kField) {
|
||||
+ continue;
|
||||
+ }
|
||||
+ // Skip over in-object fields.
|
||||
+ // TODO(leszeks): We could make this smarter, like a binary search.
|
||||
+ if (details.field_index() < in_object_length) {
|
||||
+ continue;
|
||||
+ }
|
||||
+ first_out_of_object_descriptor = i;
|
||||
+ break;
|
||||
+ }
|
||||
+
|
||||
// Allocate new PropertyArray.
|
||||
int new_length = old_length + JSObject::kFieldsAdded;
|
||||
Uninitialized<PropertyArray> new_property_array =
|
||||
@@ -335,18 +360,28 @@ class TurbolevEarlyLoweringReducer : public Next {
|
||||
__ HeapConstant(factory_->property_array_map()));
|
||||
|
||||
// Copy existing properties over.
|
||||
- for (int i = 0; i < old_length; i++) {
|
||||
+ InternalIndex descriptor = first_out_of_object_descriptor;
|
||||
+ for (int i = 0; i < old_length; ++i, ++descriptor) {
|
||||
+ PropertyDetails details = descs.GetPropertyDetails(descriptor);
|
||||
+ while (details.location() != PropertyLocation::kField) {
|
||||
+ ++descriptor;
|
||||
+ details = descs.GetPropertyDetails(descriptor);
|
||||
+ }
|
||||
+ DCHECK_EQ(i, details.field_index() - in_object_length);
|
||||
+ Representation r = details.representation();
|
||||
+
|
||||
V<Object> old_value = __ template LoadField<Object>(
|
||||
- old_property_array, AccessBuilder::ForPropertyArraySlot(i));
|
||||
+ old_property_array, AccessBuilder::ForPropertyArraySlot(i, r));
|
||||
__ InitializeField(new_property_array,
|
||||
- AccessBuilder::ForPropertyArraySlot(i), old_value);
|
||||
+ AccessBuilder::ForPropertyArraySlot(i, r), old_value);
|
||||
}
|
||||
|
||||
// Initialize new properties to undefined.
|
||||
V<Undefined> undefined = __ HeapConstant(factory_->undefined_value());
|
||||
for (int i = 0; i < JSObject::kFieldsAdded; ++i) {
|
||||
__ InitializeField(new_property_array,
|
||||
- AccessBuilder::ForPropertyArraySlot(old_length + i),
|
||||
+ AccessBuilder::ForPropertyArraySlot(
|
||||
+ old_length + i, Representation::Tagged()),
|
||||
undefined);
|
||||
}
|
||||
|
||||
diff --git a/src/compiler/turboshaft/turbolev-graph-builder.cc b/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
index bcb461488899bcbf3a130845f39f0005bd34131e..d80362036da4c80e192ed489e3c66e8bfed271ba 100644
|
||||
--- a/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
+++ b/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
@@ -2760,10 +2760,11 @@ class GraphBuildingNodeProcessor {
|
||||
maglev::ProcessResult Process(maglev::ExtendPropertiesBackingStore* node,
|
||||
const maglev::ProcessingState& state) {
|
||||
GET_FRAME_STATE_MAYBE_ABORT(frame_state, node->eager_deopt_info());
|
||||
- SetMap(node, __ ExtendPropertiesBackingStore(
|
||||
- Map(node->property_array_input()),
|
||||
- Map(node->object_input()), node->old_length(), frame_state,
|
||||
- node->eager_deopt_info()->feedback_to_update()));
|
||||
+ SetMap(node,
|
||||
+ __ ExtendPropertiesBackingStore(
|
||||
+ Map(node->property_array_input()), Map(node->object_input()),
|
||||
+ node->old_map(), node->old_length(), frame_state,
|
||||
+ node->eager_deopt_info()->feedback_to_update()));
|
||||
return maglev::ProcessResult::kContinue;
|
||||
}
|
||||
|
||||
diff --git a/src/maglev/maglev-graph-builder.cc b/src/maglev/maglev-graph-builder.cc
|
||||
index a2cac0c5ded6806292d98218dcb6da0f7430f16b..4664ca78b4413da6a3d9d6cafa705d33f5c02ee2 100644
|
||||
--- a/src/maglev/maglev-graph-builder.cc
|
||||
+++ b/src/maglev/maglev-graph-builder.cc
|
||||
@@ -5253,7 +5253,7 @@ ReduceResult MaglevGraphBuilder::BuildExtendPropertiesBackingStore(
|
||||
// potentially causing a sandbox violation. This CHECK defends against that.
|
||||
SBXCHECK_GE(length, 0);
|
||||
return AddNewNode<ExtendPropertiesBackingStore>({property_array, receiver},
|
||||
- length);
|
||||
+ map, length);
|
||||
}
|
||||
|
||||
MaybeReduceResult MaglevGraphBuilder::TryBuildStoreField(
|
||||
diff --git a/src/maglev/maglev-ir.h b/src/maglev/maglev-ir.h
|
||||
index 9d5cf70429ed5513aa7cd23baf1a044acfc25feb..707d8fd56a367856a648dbe152e3d945416c70af 100644
|
||||
--- a/src/maglev/maglev-ir.h
|
||||
+++ b/src/maglev/maglev-ir.h
|
||||
@@ -9084,8 +9084,10 @@ class ExtendPropertiesBackingStore
|
||||
using Base = FixedInputValueNodeT<2, ExtendPropertiesBackingStore>;
|
||||
|
||||
public:
|
||||
- explicit ExtendPropertiesBackingStore(uint64_t bitfield, int old_length)
|
||||
- : Base(bitfield), old_length_(old_length) {}
|
||||
+ explicit ExtendPropertiesBackingStore(uint64_t bitfield,
|
||||
+ const compiler::MapRef& old_map,
|
||||
+ int old_length)
|
||||
+ : Base(bitfield), old_map_(old_map), old_length_(old_length) {}
|
||||
|
||||
static constexpr OpProperties kProperties =
|
||||
OpProperties::CanAllocate() | OpProperties::CanRead() |
|
||||
@@ -9105,9 +9107,11 @@ class ExtendPropertiesBackingStore
|
||||
void GenerateCode(MaglevAssembler*, const ProcessingState&);
|
||||
void PrintParams(std::ostream&) const;
|
||||
|
||||
+ const compiler::MapRef& old_map() const { return old_map_; }
|
||||
int old_length() const { return old_length_; }
|
||||
|
||||
private:
|
||||
+ const compiler::MapRef old_map_;
|
||||
const int old_length_;
|
||||
};
|
||||
|
||||
|
|
@ -325,7 +325,7 @@ index 181d298bfa27d21f013016b34a586078d12f8a58..92d6f7b36d4c5c0a64723f7d18427a62
|
|||
|
||||
#undef TRACE
|
||||
diff --git a/src/compiler/turboshaft/turbolev-graph-builder.cc b/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
index 9d1dafe2b0b733c88283b21eddb36c9827912eca..bcb461488899bcbf3a130845f39f0005bd34131e 100644
|
||||
index 3db187b8c48cc0c7168be039e7d90078c4df7bda..d80362036da4c80e192ed489e3c66e8bfed271ba 100644
|
||||
--- a/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
+++ b/src/compiler/turboshaft/turbolev-graph-builder.cc
|
||||
@@ -118,12 +118,7 @@ class BlockOriginTrackingReducer : public Next {
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue