runtime/maps: fix typo in group.go comment (instrinsified -> intrinsified)

Several comments refer to bitset as 'instrinsified', which is likely
a typo, because it refers to the output of the intrinsics implemented
with SIMD.

Change-Id: I00f26b8d8128592ee0e9dc8a1b1480c93a9542d6
GitHub-Last-Rev: 8a42367109
GitHub-Pull-Request: golang/go#74624
Reviewed-on: https://go-review.googlesource.com/c/go/+/688016
Reviewed-by: Keith Randall <khr@golang.org>
Auto-Submit: Keith Randall <khr@golang.org>
Reviewed-by: Cherry Mui <cherryyz@google.com>
LUCI-TryBot-Result: Go LUCI <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
Reviewed-by: Keith Randall <khr@google.com>
This commit is contained in:
dyma solovei 2025-07-15 12:21:38 +00:00 committed by Gopher Robot
parent d826bf4d74
commit 7dceabd3be

View file

@ -157,7 +157,7 @@ func (g ctrlGroup) matchH2(h uintptr) bitset {
// Portable implementation of matchH2. // Portable implementation of matchH2.
// //
// Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See // Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See
// note on bitset about the packed instrinsified return value. // note on bitset about the packed intrinsified return value.
func ctrlGroupMatchH2(g ctrlGroup, h uintptr) bitset { func ctrlGroupMatchH2(g ctrlGroup, h uintptr) bitset {
// NB: This generic matching routine produces false positive matches when // NB: This generic matching routine produces false positive matches when
// h is 2^N and the control bytes have a seq of 2^N followed by 2^N+1. For // h is 2^N and the control bytes have a seq of 2^N followed by 2^N+1. For
@ -179,7 +179,7 @@ func (g ctrlGroup) matchEmpty() bitset {
// Portable implementation of matchEmpty. // Portable implementation of matchEmpty.
// //
// Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See // Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See
// note on bitset about the packed instrinsified return value. // note on bitset about the packed intrinsified return value.
func ctrlGroupMatchEmpty(g ctrlGroup) bitset { func ctrlGroupMatchEmpty(g ctrlGroup) bitset {
// An empty slot is 1000 0000 // An empty slot is 1000 0000
// A deleted slot is 1111 1110 // A deleted slot is 1111 1110
@ -200,7 +200,7 @@ func (g ctrlGroup) matchEmptyOrDeleted() bitset {
// Portable implementation of matchEmptyOrDeleted. // Portable implementation of matchEmptyOrDeleted.
// //
// Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See // Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See
// note on bitset about the packed instrinsified return value. // note on bitset about the packed intrinsified return value.
func ctrlGroupMatchEmptyOrDeleted(g ctrlGroup) bitset { func ctrlGroupMatchEmptyOrDeleted(g ctrlGroup) bitset {
// An empty slot is 1000 0000 // An empty slot is 1000 0000
// A deleted slot is 1111 1110 // A deleted slot is 1111 1110
@ -219,7 +219,7 @@ func (g ctrlGroup) matchFull() bitset {
// Portable implementation of matchFull. // Portable implementation of matchFull.
// //
// Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See // Note: On AMD64, this is an intrinsic implemented with SIMD instructions. See
// note on bitset about the packed instrinsified return value. // note on bitset about the packed intrinsified return value.
func ctrlGroupMatchFull(g ctrlGroup) bitset { func ctrlGroupMatchFull(g ctrlGroup) bitset {
// An empty slot is 1000 0000 // An empty slot is 1000 0000
// A deleted slot is 1111 1110 // A deleted slot is 1111 1110