From 3ba46e09f7538ca4a3173730a39898b07faaa85f Mon Sep 17 00:00:00 2001 From: Richard Gibson Date: Mon, 13 Feb 2023 11:24:37 -0800 Subject: [PATCH 1/3] Editorial: Add aliases for Agent Events Records when working with [[EventList]]s (#2947) --- spec.html | 18 ++++++++++++------ 1 file changed, 12 insertions(+), 6 deletions(-) diff --git a/spec.html b/spec.html index 43c97c4da3..ab340a3e6c 100644 --- a/spec.html +++ b/spec.html @@ -4502,7 +4502,8 @@

1. Let _db_ be a new Shared Data Block value consisting of _size_ bytes. If it is impossible to create such a Shared Data Block, throw a *RangeError* exception. 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _zero_ be « 0 ». 1. For each index _i_ of _db_, do 1. Append WriteSharedMemory { [[Order]]: ~Init~, [[NoTear]]: *true*, [[Block]]: _db_, [[ByteIndex]]: _i_, [[ElementSize]]: 1, [[Payload]]: _zero_ } to _eventList_. @@ -4531,7 +4532,8 @@

1. Repeat, while _count_ > 0, 1. If _fromBlock_ is a Shared Data Block, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _bytes_ be a List whose sole element is a nondeterministically chosen byte value. 1. NOTE: In implementations, _bytes_ is the result of a non-atomic read instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. Let _readEvent_ be ReadSharedMemory { [[Order]]: ~Unordered~, [[NoTear]]: *true*, [[Block]]: _fromBlock_, [[ByteIndex]]: _fromIndex_, [[ElementSize]]: 1 }. @@ -41218,7 +41220,8 @@

1. Let _elementSize_ be the Element Size value specified in for Element Type _type_. 1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. If _isTypedArray_ is *true* and IsNoTearConfiguration(_type_, _order_) is *true*, let _noTear_ be *true*; otherwise let _noTear_ be *false*. 1. Let _rawValue_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawValue_ is the result of a non-atomic or atomic read instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. @@ -41284,7 +41287,8 @@

1. Let _rawBytes_ be NumericToRawBytes(_type_, _value_, _isLittleEndian_). 1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. If _isTypedArray_ is *true* and IsNoTearConfiguration(_type_, _order_) is *true*, let _noTear_ be *true*; otherwise let _noTear_ be *false*. 1. Append WriteSharedMemory { [[Order]]: _order_, [[NoTear]]: _noTear_, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_, [[Payload]]: _rawBytes_ } to _eventList_. 1. Else, store the individual bytes of _rawBytes_ into _block_, starting at _block_[_byteIndex_]. @@ -41315,7 +41319,8 @@

1. Let _rawBytes_ be NumericToRawBytes(_type_, _value_, _isLittleEndian_). 1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawBytesRead_ is the result of a load-link, of a load-exclusive, or of an operand of a read-modify-write instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. Let _rmwEvent_ be ReadModifyWriteSharedMemory { [[Order]]: ~SeqCst~, [[NoTear]]: *true*, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_, [[Payload]]: _rawBytes_, [[ModifyOp]]: _op_ }. @@ -42378,7 +42383,8 @@

Atomics.compareExchange ( _typedArray_, _index_, _expectedValue_, _replaceme 1. Let _replacementBytes_ be NumericToRawBytes(_elementType_, _replacement_, _isLittleEndian_). 1. If IsSharedArrayBuffer(_buffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. - 1. Let _eventList_ be the [[EventList]] field of the element of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). + 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawBytesRead_ is the result of a load-link, of a load-exclusive, or of an operand of a read-modify-write instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. NOTE: The comparison of the expected value and the read value is performed outside of the read-modify-write modification function to avoid needlessly strong synchronization when the expected value is not equal to the read value. From fa1fb808bdbe1870a38d1876ea498d223d1965e6 Mon Sep 17 00:00:00 2001 From: Richard Gibson Date: Mon, 13 Feb 2023 11:24:40 -0800 Subject: [PATCH 2/3] Editorial: For clarity, alter _record_.[[Field]] rather than an alias of it (#2947) --- spec.html | 72 ++++++++++++++++++++++--------------------------------- 1 file changed, 29 insertions(+), 43 deletions(-) diff --git a/spec.html b/spec.html index ab340a3e6c..0c2fd1ce7f 100644 --- a/spec.html +++ b/spec.html @@ -4503,10 +4503,9 @@

1. Let _db_ be a new Shared Data Block value consisting of _size_ bytes. If it is impossible to create such a Shared Data Block, throw a *RangeError* exception. 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _zero_ be « 0 ». 1. For each index _i_ of _db_, do - 1. Append WriteSharedMemory { [[Order]]: ~Init~, [[NoTear]]: *true*, [[Block]]: _db_, [[ByteIndex]]: _i_, [[ElementSize]]: 1, [[Payload]]: _zero_ } to _eventList_. + 1. Append WriteSharedMemory { [[Order]]: ~Init~, [[NoTear]]: *true*, [[Block]]: _db_, [[ByteIndex]]: _i_, [[ElementSize]]: 1, [[Payload]]: _zero_ } to _eventsRecord_.[[EventList]]. 1. Return _db_. @@ -4533,14 +4532,13 @@

1. If _fromBlock_ is a Shared Data Block, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _bytes_ be a List whose sole element is a nondeterministically chosen byte value. 1. NOTE: In implementations, _bytes_ is the result of a non-atomic read instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. Let _readEvent_ be ReadSharedMemory { [[Order]]: ~Unordered~, [[NoTear]]: *true*, [[Block]]: _fromBlock_, [[ByteIndex]]: _fromIndex_, [[ElementSize]]: 1 }. - 1. Append _readEvent_ to _eventList_. + 1. Append _readEvent_ to _eventsRecord_.[[EventList]]. 1. Append Chosen Value Record { [[Event]]: _readEvent_, [[ChosenValue]]: _bytes_ } to _execution_.[[ChosenValues]]. 1. If _toBlock_ is a Shared Data Block, then - 1. Append WriteSharedMemory { [[Order]]: ~Unordered~, [[NoTear]]: *true*, [[Block]]: _toBlock_, [[ByteIndex]]: _toIndex_, [[ElementSize]]: 1, [[Payload]]: _bytes_ } to _eventList_. + 1. Append WriteSharedMemory { [[Order]]: ~Unordered~, [[NoTear]]: *true*, [[Block]]: _toBlock_, [[ByteIndex]]: _toIndex_, [[ElementSize]]: 1, [[Payload]]: _bytes_ } to _eventsRecord_.[[EventList]]. 1. Else, 1. Set _toBlock_[_toIndex_] to _bytes_[0]. 1. Else, @@ -10853,9 +10851,8 @@

1. Let _existingProp_ be ? HasOwnProperty(_globalObject_, _N_). 1. If _existingProp_ is *true*, then 1. Let _status_ be ? _ObjRec_.DeleteBinding(_N_). - 1. If _status_ is *true*, then - 1. Let _varNames_ be _envRec_.[[VarNames]]. - 1. If _varNames_ contains _N_, remove _N_ from _varNames_. + 1. If _status_ is *true* and _envRec_.[[VarNames]] contains _N_, then + 1. Remove _N_ from _envRec_.[[VarNames]]. 1. Return _status_. 1. Return *true*. @@ -11044,9 +11041,8 @@

1. If _hasProperty_ is *false* and _extensible_ is *true*, then 1. Perform ? _ObjRec_.CreateMutableBinding(_N_, _D_). 1. Perform ? _ObjRec_.InitializeBinding(_N_, *undefined*). - 1. Let _varDeclaredNames_ be _envRec_.[[VarNames]]. - 1. If _varDeclaredNames_ does not contain _N_, then - 1. Append _N_ to _varDeclaredNames_. + 1. If _envRec_.[[VarNames]] does not contain _N_, then + 1. Append _N_ to _envRec_.[[VarNames]]. 1. Return ~unused~. @@ -11076,9 +11072,8 @@

1. Let _desc_ be the PropertyDescriptor { [[Value]]: _V_ }. 1. Perform ? DefinePropertyOrThrow(_globalObject_, _N_, _desc_). 1. [id="step-createglobalfunctionbinding-set"] Perform ? Set(_globalObject_, _N_, _V_, *false*). - 1. Let _varDeclaredNames_ be _envRec_.[[VarNames]]. - 1. If _varDeclaredNames_ does not contain _N_, then - 1. Append _N_ to _varDeclaredNames_. + 1. If _envRec_.[[VarNames]] does not contain _N_, then + 1. Append _N_ to _envRec_.[[VarNames]]. 1. Return ~unused~. @@ -18501,7 +18496,7 @@

1. Perform ! SetIntegrityLevel(_rawObj_, ~frozen~). 1. Perform ! DefinePropertyOrThrow(_template_, *"raw"*, PropertyDescriptor { [[Value]]: _rawObj_, [[Writable]]: *false*, [[Enumerable]]: *false*, [[Configurable]]: *false* }). 1. Perform ! SetIntegrityLevel(_template_, ~frozen~). - 1. Append the Record { [[Site]]: _templateLiteral_, [[Array]]: _template_ } to _templateRegistry_. + 1. Append the Record { [[Site]]: _templateLiteral_, [[Array]]: _template_ } to _realm_.[[TemplateMap]]. 1. Return _template_. @@ -22063,22 +22058,20 @@

%ForInIteratorPrototype%.next ( )

1. Assert: _O_ is an Object. 1. Assert: _O_ has all of the internal slots of a For-In Iterator Instance (). 1. Let _object_ be _O_.[[Object]]. - 1. Let _visited_ be _O_.[[VisitedKeys]]. - 1. Let _remaining_ be _O_.[[RemainingKeys]]. 1. Repeat, 1. If _O_.[[ObjectWasVisited]] is *false*, then 1. Let _keys_ be ? _object_.[[OwnPropertyKeys]](). 1. For each element _key_ of _keys_, do 1. If _key_ is a String, then - 1. Append _key_ to _remaining_. + 1. Append _key_ to _O_.[[RemainingKeys]]. 1. Set _O_.[[ObjectWasVisited]] to *true*. - 1. Repeat, while _remaining_ is not empty, - 1. Let _r_ be the first element of _remaining_. - 1. Remove the first element from _remaining_. - 1. If there does not exist an element _v_ of _visited_ such that SameValue(_r_, _v_) is *true*, then + 1. Repeat, while _O_.[[RemainingKeys]] is not empty, + 1. Let _r_ be the first element of _O_.[[RemainingKeys]]. + 1. Remove the first element from _O_.[[RemainingKeys]]. + 1. If there does not exist an element _v_ of _O_.[[VisitedKeys]] such that SameValue(_r_, _v_) is *true*, then 1. Let _desc_ be ? _object_.[[GetOwnProperty]](_r_). 1. If _desc_ is not *undefined*, then - 1. Append _r_ to _visited_. + 1. Append _r_ to _O_.[[VisitedKeys]]. 1. If _desc_.[[Enumerable]] is *true*, return CreateIterResultObject(_r_, *false*). 1. Set _object_ to ? _object_.[[GetPrototypeOf]](). 1. Set _O_.[[Object]] to _object_. @@ -40315,7 +40308,7 @@

Map.prototype.set ( _key_, _value_ )

1. Return _M_. 1. If _key_ is *-0*𝔽, set _key_ to *+0*𝔽. 1. Let _p_ be the Record { [[Key]]: _key_, [[Value]]: _value_ }. - 1. Append _p_ to _entries_. + 1. Append _p_ to _M_.[[MapData]]. 1. Return _M_. @@ -40509,7 +40502,7 @@

Set.prototype.add ( _value_ )

1. If _e_ is not ~empty~ and SameValueZero(_e_, _value_) is *true*, then 1. Return _S_. 1. If _value_ is *-0*𝔽, set _value_ to *+0*𝔽. - 1. Append _value_ to _entries_. + 1. Append _value_ to _S_.[[SetData]]. 1. Return _S_. @@ -40850,7 +40843,7 @@

WeakMap.prototype.set ( _key_, _value_ )

1. Set _p_.[[Value]] to _value_. 1. Return _M_. 1. Let _p_ be the Record { [[Key]]: _key_, [[Value]]: _value_ }. - 1. Append _p_ to _entries_. + 1. Append _p_ to _M_.[[WeakMapData]]. 1. Return _M_. @@ -40945,7 +40938,7 @@

WeakSet.prototype.add ( _value_ )

1. For each element _e_ of _entries_, do 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, then 1. Return _S_. - 1. Append _value_ to _entries_. + 1. Append _value_ to _S_.[[WeakSetData]]. 1. Return _S_. @@ -41221,12 +41214,11 @@

1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. If _isTypedArray_ is *true* and IsNoTearConfiguration(_type_, _order_) is *true*, let _noTear_ be *true*; otherwise let _noTear_ be *false*. 1. Let _rawValue_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawValue_ is the result of a non-atomic or atomic read instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. Let _readEvent_ be ReadSharedMemory { [[Order]]: _order_, [[NoTear]]: _noTear_, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_ }. - 1. Append _readEvent_ to _eventList_. + 1. Append _readEvent_ to _eventsRecord_.[[EventList]]. 1. Append Chosen Value Record { [[Event]]: _readEvent_, [[ChosenValue]]: _rawValue_ } to _execution_.[[ChosenValues]]. 1. Else, let _rawValue_ be a List whose elements are bytes from _block_ at indices in the interval from _byteIndex_ (inclusive) to _byteIndex_ + _elementSize_ (exclusive). 1. Assert: The number of elements in _rawValue_ is _elementSize_. @@ -41288,9 +41280,8 @@

1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. If _isTypedArray_ is *true* and IsNoTearConfiguration(_type_, _order_) is *true*, let _noTear_ be *true*; otherwise let _noTear_ be *false*. - 1. Append WriteSharedMemory { [[Order]]: _order_, [[NoTear]]: _noTear_, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_, [[Payload]]: _rawBytes_ } to _eventList_. + 1. Append WriteSharedMemory { [[Order]]: _order_, [[NoTear]]: _noTear_, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_, [[Payload]]: _rawBytes_ } to _eventsRecord_.[[EventList]]. 1. Else, store the individual bytes of _rawBytes_ into _block_, starting at _block_[_byteIndex_]. 1. Return ~unused~. @@ -41320,11 +41311,10 @@

1. If IsSharedArrayBuffer(_arrayBuffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawBytesRead_ is the result of a load-link, of a load-exclusive, or of an operand of a read-modify-write instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. Let _rmwEvent_ be ReadModifyWriteSharedMemory { [[Order]]: ~SeqCst~, [[NoTear]]: *true*, [[Block]]: _block_, [[ByteIndex]]: _byteIndex_, [[ElementSize]]: _elementSize_, [[Payload]]: _rawBytes_, [[ModifyOp]]: _op_ }. - 1. Append _rmwEvent_ to _eventList_. + 1. Append _rmwEvent_ to _eventsRecord_.[[EventList]]. 1. Append Chosen Value Record { [[Event]]: _rmwEvent_, [[ChosenValue]]: _rawBytesRead_ } to _execution_.[[ChosenValues]]. 1. Else, 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are the sequence of _elementSize_ bytes starting with _block_[_byteIndex_]. @@ -42125,9 +42115,8 @@

1. NOTE: A _WL_ whose critical section has been entered at least once has a Synchronize event set by LeaveCriticalSection. 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record in _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _entererEventList_ be _eventsRecord_.[[EventList]]. 1. Let _enterEvent_ be a new Synchronize event. - 1. Append _enterEvent_ to _entererEventList_. + 1. Append _enterEvent_ to _eventsRecord_.[[EventList]]. 1. Let _leaveEvent_ be the Synchronize event in _WL_. 1. Append (_leaveEvent_, _enterEvent_) to _eventsRecord_.[[AgentSynchronizesWith]]. 1. Return ~unused~. @@ -42147,9 +42136,8 @@

1. Assert: The surrounding agent is in the critical section for _WL_. 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record in _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _leaverEventList_ be _eventsRecord_.[[EventList]]. 1. Let _leaveEvent_ be a new Synchronize event. - 1. Append _leaveEvent_ to _leaverEventList_. + 1. Append _leaveEvent_ to _eventsRecord_.[[EventList]]. 1. Set the Synchronize event in _WL_ to _leaveEvent_. 1. Leave the critical section for _WL_. 1. Return ~unused~. @@ -42384,7 +42372,6 @@

Atomics.compareExchange ( _typedArray_, _index_, _expectedValue_, _replaceme 1. If IsSharedArrayBuffer(_buffer_) is *true*, then 1. Let _execution_ be the [[CandidateExecution]] field of the surrounding agent's Agent Record. 1. Let _eventsRecord_ be the Agent Events Record of _execution_.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier(). - 1. Let _eventList_ be _eventsRecord_.[[EventList]]. 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are nondeterministically chosen byte values. 1. NOTE: In implementations, _rawBytesRead_ is the result of a load-link, of a load-exclusive, or of an operand of a read-modify-write instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency. 1. NOTE: The comparison of the expected value and the read value is performed outside of the read-modify-write modification function to avoid needlessly strong synchronization when the expected value is not equal to the read value. @@ -42394,7 +42381,7 @@

Atomics.compareExchange ( _typedArray_, _index_, _expectedValue_, _replaceme 1. Let _event_ be ReadModifyWriteSharedMemory { [[Order]]: ~SeqCst~, [[NoTear]]: *true*, [[Block]]: _block_, [[ByteIndex]]: _indexedPosition_, [[ElementSize]]: _elementSize_, [[Payload]]: _replacementBytes_, [[ModifyOp]]: _second_ }. 1. Else, 1. Let _event_ be ReadSharedMemory { [[Order]]: ~SeqCst~, [[NoTear]]: *true*, [[Block]]: _block_, [[ByteIndex]]: _indexedPosition_, [[ElementSize]]: _elementSize_ }. - 1. Append _event_ to _eventList_. + 1. Append _event_ to _eventsRecord_.[[EventList]]. 1. Append Chosen Value Record { [[Event]]: _event_, [[ChosenValue]]: _rawBytesRead_ } to _execution_.[[ChosenValues]]. 1. Else, 1. Let _rawBytesRead_ be a List of length _elementSize_ whose elements are the sequence of _elementSize_ bytes starting with _block_[_indexedPosition_]. @@ -45655,10 +45642,9 @@

- 1. Let _queue_ be _generator_.[[AsyncGeneratorQueue]]. - 1. Assert: _queue_ is not empty. - 1. Let _next_ be the first element of _queue_. - 1. Remove the first element from _queue_. + 1. Assert: _generator_.[[AsyncGeneratorQueue]] is not empty. + 1. Let _next_ be the first element of _generator_.[[AsyncGeneratorQueue]]. + 1. Remove the first element from _generator_.[[AsyncGeneratorQueue]]. 1. Let _promiseCapability_ be _next_.[[Capability]]. 1. Let _value_ be _completion_.[[Value]]. 1. If _completion_.[[Type]] is ~throw~, then From 6aa7ba8c977fe6c46a553d11e8dabe1c9014cac4 Mon Sep 17 00:00:00 2001 From: Richard Gibson Date: Mon, 13 Feb 2023 11:24:42 -0800 Subject: [PATCH 3/3] Editorial: Remove _entries_ aliases (#2947) --- spec.html | 60 +++++++++++++++++++------------------------------------ 1 file changed, 21 insertions(+), 39 deletions(-) diff --git a/spec.html b/spec.html index 0c2fd1ce7f..70b9604a6b 100644 --- a/spec.html +++ b/spec.html @@ -40189,8 +40189,7 @@

Map.prototype.clear ( )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. Set _p_.[[Key]] to ~empty~. 1. Set _p_.[[Value]] to ~empty~. 1. Return *undefined*. @@ -40211,8 +40210,7 @@

Map.prototype.delete ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValueZero(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Key]] to ~empty~. 1. Set _p_.[[Value]] to ~empty~. @@ -40266,8 +40264,7 @@

Map.prototype.get ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValueZero(_p_.[[Key]], _key_) is *true*, return _p_.[[Value]]. 1. Return *undefined*. @@ -40279,8 +40276,7 @@

Map.prototype.has ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValueZero(_p_.[[Key]], _key_) is *true*, return *true*. 1. Return *false*. @@ -40301,8 +40297,7 @@

Map.prototype.set ( _key_, _value_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValueZero(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Value]] to _value_. 1. Return _M_. @@ -40319,9 +40314,8 @@

get Map.prototype.size

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[MapData]]). - 1. Let _entries_ be _M_.[[MapData]]. 1. Let _count_ be 0. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do 1. If _p_.[[Key]] is not ~empty~, set _count_ to _count_ + 1. 1. Return 𝔽(_count_). @@ -40497,8 +40491,7 @@

Set.prototype.add ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[SetData]]). - 1. Let _entries_ be _S_.[[SetData]]. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[SetData]], do 1. If _e_ is not ~empty~ and SameValueZero(_e_, _value_) is *true*, then 1. Return _S_. 1. If _value_ is *-0*𝔽, set _value_ to *+0*𝔽. @@ -40513,9 +40506,8 @@

Set.prototype.clear ( )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[SetData]]). - 1. Let _entries_ be _S_.[[SetData]]. - 1. For each element _e_ of _entries_, do - 1. Replace the element of _entries_ whose value is _e_ with an element whose value is ~empty~. + 1. For each element _e_ of _S_.[[SetData]], do + 1. Replace the element of _S_.[[SetData]] whose value is _e_ with an element whose value is ~empty~. 1. Return *undefined*. @@ -40534,10 +40526,9 @@

Set.prototype.delete ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[SetData]]). - 1. Let _entries_ be _S_.[[SetData]]. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[SetData]], do 1. If _e_ is not ~empty~ and SameValueZero(_e_, _value_) is *true*, then - 1. Replace the element of _entries_ whose value is _e_ with an element whose value is ~empty~. + 1. Replace the element of _S_.[[SetData]] whose value is _e_ with an element whose value is ~empty~. 1. Return *true*. 1. Return *false*. @@ -40593,8 +40584,7 @@

Set.prototype.has ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[SetData]]). - 1. Let _entries_ be _S_.[[SetData]]. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[SetData]], do 1. If _e_ is not ~empty~ and SameValueZero(_e_, _value_) is *true*, return *true*. 1. Return *false*. @@ -40614,9 +40604,8 @@

get Set.prototype.size

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[SetData]]). - 1. Let _entries_ be _S_.[[SetData]]. 1. Let _count_ be 0. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[SetData]], do 1. If _e_ is not ~empty~, set _count_ to _count_ + 1. 1. Return 𝔽(_count_). @@ -40788,9 +40777,8 @@

WeakMap.prototype.delete ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[WeakMapData]]). - 1. Let _entries_ be _M_.[[WeakMapData]]. 1. If _key_ is not an Object, return *false*. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[WeakMapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Key]] to ~empty~. 1. Set _p_.[[Value]] to ~empty~. @@ -40808,9 +40796,8 @@

WeakMap.prototype.get ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[WeakMapData]]). - 1. Let _entries_ be _M_.[[WeakMapData]]. 1. If _key_ is not an Object, return *undefined*. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[WeakMapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, return _p_.[[Value]]. 1. Return *undefined*. @@ -40822,9 +40809,8 @@

WeakMap.prototype.has ( _key_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[WeakMapData]]). - 1. Let _entries_ be _M_.[[WeakMapData]]. 1. If _key_ is not an Object, return *false*. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[WeakMapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, return *true*. 1. Return *false*. @@ -40836,9 +40822,8 @@

WeakMap.prototype.set ( _key_, _value_ )

1. Let _M_ be the *this* value. 1. Perform ? RequireInternalSlot(_M_, [[WeakMapData]]). - 1. Let _entries_ be _M_.[[WeakMapData]]. 1. If _key_ is not an Object, throw a *TypeError* exception. - 1. For each Record { [[Key]], [[Value]] } _p_ of _entries_, do + 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[WeakMapData]], do 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Value]] to _value_. 1. Return _M_. @@ -40934,8 +40919,7 @@

WeakSet.prototype.add ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[WeakSetData]]). 1. If _value_ is not an Object, throw a *TypeError* exception. - 1. Let _entries_ be _S_.[[WeakSetData]]. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[WeakSetData]], do 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, then 1. Return _S_. 1. Append _value_ to _S_.[[WeakSetData]]. @@ -40955,10 +40939,9 @@

WeakSet.prototype.delete ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[WeakSetData]]). 1. If _value_ is not an Object, return *false*. - 1. Let _entries_ be _S_.[[WeakSetData]]. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[WeakSetData]], do 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, then - 1. Replace the element of _entries_ whose value is _e_ with an element whose value is ~empty~. + 1. Replace the element of _S_.[[WeakSetData]] whose value is _e_ with an element whose value is ~empty~. 1. Return *true*. 1. Return *false*. @@ -40973,9 +40956,8 @@

WeakSet.prototype.has ( _value_ )

1. Let _S_ be the *this* value. 1. Perform ? RequireInternalSlot(_S_, [[WeakSetData]]). - 1. Let _entries_ be _S_.[[WeakSetData]]. 1. If _value_ is not an Object, return *false*. - 1. For each element _e_ of _entries_, do + 1. For each element _e_ of _S_.[[WeakSetData]], do 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, return *true*. 1. Return *false*.