aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDan Kortschak <dan@kortschak.io>2022-07-17 08:43:55 +0930
committerGopher Robot <gobot@golang.org>2022-07-19 20:07:59 +0000
commit176b63e7113b82c140a4ecb2620024526c2c42e3 (patch)
tree8d61114fa88009c0c89657a0f9faeced57de61cc
parent8e1e64c16a4d53c06ed4f2287fc11eeb5029ca1a (diff)
downloadgo-176b63e7113b82c140a4ecb2620024526c2c42e3.tar.gz
go-176b63e7113b82c140a4ecb2620024526c2c42e3.zip
crypto/internal/nistec,debug/gosym: fix typos
Change-Id: I228a23754656b41843573bd4217de4df46c9df36 Reviewed-on: https://go-review.googlesource.com/c/go/+/417954 Run-TryBot: Ian Lance Taylor <iant@google.com> TryBot-Result: Gopher Robot <gobot@golang.org> Reviewed-by: Jenny Rakoczy <jenny@golang.org> Reviewed-by: Ian Lance Taylor <iant@google.com> Auto-Submit: Ian Lance Taylor <iant@google.com>
-rw-r--r--src/crypto/internal/nistec/p224_sqrt.go2
-rw-r--r--src/debug/gosym/symtab.go2
2 files changed, 2 insertions, 2 deletions
diff --git a/src/crypto/internal/nistec/p224_sqrt.go b/src/crypto/internal/nistec/p224_sqrt.go
index ac4d761bf5..9a35cea6aa 100644
--- a/src/crypto/internal/nistec/p224_sqrt.go
+++ b/src/crypto/internal/nistec/p224_sqrt.go
@@ -19,7 +19,7 @@ var p224MinusOne = new(fiat.P224Element).Sub(
func p224SqrtCandidate(r, x *fiat.P224Element) {
// Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like
// for the other primes. Instead, implement a variation of Tonelli–Shanks.
- // The contant-time implementation is adapted from Thomas Pornin's ecGFp5.
+ // The constant-time implementation is adapted from Thomas Pornin's ecGFp5.
//
// https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385
diff --git a/src/debug/gosym/symtab.go b/src/debug/gosym/symtab.go
index 4e63f1cdf7..afc67198c3 100644
--- a/src/debug/gosym/symtab.go
+++ b/src/debug/gosym/symtab.go
@@ -86,7 +86,7 @@ func (s *Sym) ReceiverName() string {
// Find the first dot after pathend (or from the beginning, if there was
// no slash in name).
l := strings.Index(name[pathend:], ".")
- // Find the last dot after pathend (or the beginnng).
+ // Find the last dot after pathend (or the beginning).
r := strings.LastIndex(name[pathend:], ".")
if l == -1 || r == -1 || l == r {
// There is no receiver if we didn't find two distinct dots after pathend.