Commit 5499034a authored by Martin Olsson's avatar Martin Olsson Committed by Ian Lance Taylor

all: fix a few spelling errors in source comments

R=golang-codereviews, dave, iant
CC=golang-codereviews
https://golang.org/cl/45750044
parent 3980aad4
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
// Flags: "%#O": print go syntax. (automatic unless fmtmode == FDbg) // Flags: "%#O": print go syntax. (automatic unless fmtmode == FDbg)
// //
// %J Node* Node details // %J Node* Node details
// Flags: "%hJ" supresses things not relevant until walk. // Flags: "%hJ" suppresses things not relevant until walk.
// //
// %V Val* Constant values // %V Val* Constant values
// //
......
...@@ -503,7 +503,7 @@ enum ...@@ -503,7 +503,7 @@ enum
OKEY, // The x:3 in t{x:3, y:4}, the 1:2 in a[1:2], the 2:20 in [3]int{2:20}, etc. OKEY, // The x:3 in t{x:3, y:4}, the 1:2 in a[1:2], the 2:20 in [3]int{2:20}, etc.
OPARAM, // The on-stack copy of a parameter or return value that escapes. OPARAM, // The on-stack copy of a parameter or return value that escapes.
OLEN, // len OLEN, // len
OMAKE, // make, typechecking may convert to a more specfic OMAKEXXX. OMAKE, // make, typechecking may convert to a more specific OMAKEXXX.
OMAKECHAN, // make(chan int) OMAKECHAN, // make(chan int)
OMAKEMAP, // make(map[string]int) OMAKEMAP, // make(map[string]int)
OMAKESLICE, // make([]int, 0) OMAKESLICE, // make([]int, 0)
...@@ -525,7 +525,7 @@ enum ...@@ -525,7 +525,7 @@ enum
OPRINTN, // println OPRINTN, // println
OPAREN, // (x) OPAREN, // (x)
OSEND, // c <- x OSEND, // c <- x
OSLICE, // v[1:2], typechecking may convert to a more specfic OSLICEXXX. OSLICE, // v[1:2], typechecking may convert to a more specific OSLICEXXX.
OSLICEARR, // a[1:2] OSLICEARR, // a[1:2]
OSLICESTR, // s[1:2] OSLICESTR, // s[1:2]
OSLICE3, // v[1:2:3], typechecking may convert to OSLICE3ARR. OSLICE3, // v[1:2:3], typechecking may convert to OSLICE3ARR.
......
...@@ -1234,7 +1234,7 @@ assignop(Type *src, Type *dst, char **why) ...@@ -1234,7 +1234,7 @@ assignop(Type *src, Type *dst, char **why)
if(implements(src, dst, &missing, &have, &ptr)) if(implements(src, dst, &missing, &have, &ptr))
return OCONVIFACE; return OCONVIFACE;
// we'll have complained about this method anyway, supress spurious messages. // we'll have complained about this method anyway, suppress spurious messages.
if(have && have->sym == missing->sym && (have->type->broke || missing->type->broke)) if(have && have->sym == missing->sym && (have->type->broke || missing->type->broke))
return OCONVIFACE; return OCONVIFACE;
......
...@@ -28,7 +28,7 @@ ...@@ -28,7 +28,7 @@
// //
// -n // -n
// an alias for -sort address (numeric), // an alias for -sort address (numeric),
// for compatiblity with other nm commands // for compatibility with other nm commands
// -size // -size
// print symbol size in decimal between address and type // print symbol size in decimal between address and type
// -sort {address,name,none} // -sort {address,name,none}
......
...@@ -1991,7 +1991,7 @@ if(0 /*debug['G']*/) print("%ux: %s: arm %d\n", (uint32)(p->pc), p->from.sym->na ...@@ -1991,7 +1991,7 @@ if(0 /*debug['G']*/) print("%ux: %s: arm %d\n", (uint32)(p->pc), p->from.sym->na
// This is supposed to be something that stops execution. // This is supposed to be something that stops execution.
// It's not supposed to be reached, ever, but if it is, we'd // It's not supposed to be reached, ever, but if it is, we'd
// like to be able to tell how we got there. Assemble as // like to be able to tell how we got there. Assemble as
// 0xf7fabcfd which is guranteed to raise undefined instruction // 0xf7fabcfd which is guaranteed to raise undefined instruction
// exception. // exception.
o1 = 0xf7fabcfd; o1 = 0xf7fabcfd;
break; break;
......
...@@ -569,7 +569,7 @@ func (db *DB) maybeOpenNewConnections() { ...@@ -569,7 +569,7 @@ func (db *DB) maybeOpenNewConnections() {
} }
} }
// Runs in a seperate goroutine, opens new connections when requested. // Runs in a separate goroutine, opens new connections when requested.
func (db *DB) connectionOpener() { func (db *DB) connectionOpener() {
for _ = range db.openerCh { for _ = range db.openerCh {
db.openNewConnection() db.openNewConnection()
......
...@@ -289,7 +289,7 @@ func StringsAreSorted(a []string) bool { return IsSorted(StringSlice(a)) } ...@@ -289,7 +289,7 @@ func StringsAreSorted(a []string) bool { return IsSorted(StringSlice(a)) }
// only logarithmic additional stack space. They perform well if compared // only logarithmic additional stack space. They perform well if compared
// experimentaly to other stable in-place sorting algorithms. // experimentaly to other stable in-place sorting algorithms.
// //
// Remarks on other algoritms evaluated: // Remarks on other algorithms evaluated:
// - GCC's 4.6.3 stable_sort with merge_without_buffer from libstdc++: // - GCC's 4.6.3 stable_sort with merge_without_buffer from libstdc++:
// Not faster. // Not faster.
// - GCC's __rotate for block rotations: Not faster. // - GCC's __rotate for block rotations: Not faster.
...@@ -349,7 +349,7 @@ func Stable(data Interface) { ...@@ -349,7 +349,7 @@ func Stable(data Interface) {
// The algorithm needs O((M+N)*log(M)) calls to data.Swap. // The algorithm needs O((M+N)*log(M)) calls to data.Swap.
// //
// The paper gives O((M+N)*log(M)) as the number of assignments assuming a // The paper gives O((M+N)*log(M)) as the number of assignments assuming a
// rotation algorithm wich uses O(M+N+gcd(M+N)) assignments. The argumentation // rotation algorithm which uses O(M+N+gcd(M+N)) assignments. The argumentation
// in the paper carries through for Swap operations, especially as the block // in the paper carries through for Swap operations, especially as the block
// swapping rotate uses only O(M+N) Swaps. // swapping rotate uses only O(M+N) Swaps.
func symMerge(data Interface, a, m, b int) { func symMerge(data Interface, a, m, b int) {
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
// Test division of variables. Generate many test cases, // Test division of variables. Generate many test cases,
// compute correct answer using shift and subtract, // compute correct answer using shift and subtract,
// and then compare against results from divison and // and then compare against results from division and
// modulus operators. // modulus operators.
// //
// Primarily useful for testing software div/mod. // Primarily useful for testing software div/mod.
......
...@@ -5,7 +5,7 @@ ...@@ -5,7 +5,7 @@
// license that can be found in the LICENSE file. // license that can be found in the LICENSE file.
// Logical operation on named boolean type returns the same type, // Logical operation on named boolean type returns the same type,
// supporting an implicit convertion to an interface type. This used // supporting an implicit conversion to an interface type. This used
// to crash gccgo. // to crash gccgo.
package p package p
......
...@@ -886,7 +886,7 @@ func checkShouldTest() { ...@@ -886,7 +886,7 @@ func checkShouldTest() {
// Build tags separated by a space are OR-ed together. // Build tags separated by a space are OR-ed together.
assertNot(shouldTest("// +build arm 386", "linux", "amd64")) assertNot(shouldTest("// +build arm 386", "linux", "amd64"))
// Build tags seperated by a comma are AND-ed together. // Build tags separated by a comma are AND-ed together.
assertNot(shouldTest("// +build !windows,!plan9", "windows", "amd64")) assertNot(shouldTest("// +build !windows,!plan9", "windows", "amd64"))
assertNot(shouldTest("// +build !windows,!plan9", "plan9", "386")) assertNot(shouldTest("// +build !windows,!plan9", "plan9", "386"))
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment