1
0
mirror of https://github.com/golang/go synced 2024-11-23 05:20:11 -07:00

all: fix misprints in comments

These were found by grepping the comments from the go code and feeding
the output to aspell.

Change-Id: Id734d6c8d1938ec3c36bd94a4dbbad577e3ad395
Reviewed-on: https://go-review.googlesource.com/10941
Reviewed-by: Aamir Khan <syst3m.w0rm@gmail.com>
Reviewed-by: Brad Fitzpatrick <bradfitz@golang.org>
This commit is contained in:
Ainar Garipov 2015-06-11 16:49:38 +03:00 committed by Brad Fitzpatrick
parent 15c8ab00e8
commit 7f9f70e5b6
47 changed files with 54 additions and 54 deletions

View File

@ -5971,7 +5971,7 @@ You can now check build status on various platforms at the Go Dashboard:
* runtime: add SetFinalizer * runtime: add SetFinalizer
* time: Sleep through interruptions (thanks Chris Wedgwood) * time: Sleep through interruptions (thanks Chris Wedgwood)
add RFC822 formats add RFC822 formats
experimental implemenation of Ticker using two goroutines for all tickers experimental implementation of Ticker using two goroutines for all tickers
* xml: allow underscores in XML element names (thanks Michael Hoisie) * xml: allow underscores in XML element names (thanks Michael Hoisie)
allow any scalar type in xml.Unmarshal allow any scalar type in xml.Unmarshal
</pre> </pre>

View File

@ -160,7 +160,7 @@ The GCC release schedule does not coincide with the Go release schedule, so some
The 4.8.0 version of GCC shipped in March, 2013 and includes a nearly-Go 1.1 version of <code>gccgo</code>. The 4.8.0 version of GCC shipped in March, 2013 and includes a nearly-Go 1.1 version of <code>gccgo</code>.
Its library is a little behind the release, but the biggest difference is that method values are not implemented. Its library is a little behind the release, but the biggest difference is that method values are not implemented.
Sometime around July 2013, we expect 4.8.2 of GCC to ship with a <code>gccgo</code> Sometime around July 2013, we expect 4.8.2 of GCC to ship with a <code>gccgo</code>
providing a complete Go 1.1 implementaiton. providing a complete Go 1.1 implementation.
</p> </p>
<h3 id="gc_flag">Command-line flag parsing</h3> <h3 id="gc_flag">Command-line flag parsing</h3>

View File

@ -736,7 +736,7 @@ func (p *Parser) registerNumber(name string) uint16 {
} }
// Note: There are two changes in the expression handling here // Note: There are two changes in the expression handling here
// compared to the old yacc/C implemenatations. Neither has // compared to the old yacc/C implementations. Neither has
// much practical consequence because the expressions we // much practical consequence because the expressions we
// see in assembly code are simple, but for the record: // see in assembly code are simple, but for the record:
// //

View File

@ -772,7 +772,7 @@ func mkinlcall1(np **Node, fn *Node, isddd bool) {
inlgen++ inlgen++
body := inlsubstlist(fn.Func.Inl) body := inlsubstlist(fn.Func.Inl)
body = list(body, Nod(OGOTO, inlretlabel, nil)) // avoid 'not used' when function doesnt have return body = list(body, Nod(OGOTO, inlretlabel, nil)) // avoid 'not used' when function doesn't have return
body = list(body, Nod(OLABEL, inlretlabel, nil)) body = list(body, Nod(OLABEL, inlretlabel, nil))
typechecklist(body, Etop) typechecklist(body, Etop)

View File

@ -490,7 +490,7 @@ func orderstmt(n *Node, order *Order) {
case OASOP: case OASOP:
// Special: rewrite l op= r into l = l op r. // Special: rewrite l op= r into l = l op r.
// This simplies quite a few operations; // This simplifies quite a few operations;
// most important is that it lets us separate // most important is that it lets us separate
// out map read from map write when l is // out map read from map write when l is
// a map index expression. // a map index expression.

View File

@ -585,7 +585,7 @@ func progeffects(prog *obj.Prog, vars []*Node, uevar Bvec, varkill Bvec, avarini
// If the result had its address taken, it is being tracked // If the result had its address taken, it is being tracked
// by the avarinit code, which does not use uevar. // by the avarinit code, which does not use uevar.
// If we added it to uevar too, we'd not see any kill // If we added it to uevar too, we'd not see any kill
// and decide that the varible was live entry, which it is not. // and decide that the variable was live entry, which it is not.
// So only use uevar in the non-addrtaken case. // So only use uevar in the non-addrtaken case.
// The p->to.type == thearch.D_NONE limits the bvset to // The p->to.type == thearch.D_NONE limits the bvset to
// non-tail-call return instructions; see note above // non-tail-call return instructions; see note above

View File

@ -105,7 +105,7 @@ func lsort(l *Sig, f func(*Sig, *Sig) int) *Sig {
return l return l
} }
// Builds a type respresenting a Bucket structure for // Builds a type representing a Bucket structure for
// the given map type. This type is not visible to users - // the given map type. This type is not visible to users -
// we include only enough information to generate a correct GC // we include only enough information to generate a correct GC
// program for it. // program for it.
@ -1234,7 +1234,7 @@ ok:
// a package that imports the first one and does use *T pointers. // a package that imports the first one and does use *T pointers.
// The second module will end up defining type data for *T and a // The second module will end up defining type data for *T and a
// type.*T symbol pointing at it. It's important that calling // type.*T symbol pointing at it. It's important that calling
// .PtrTo() on the refect.Type for T returns this type data and // .PtrTo() on the reflect.Type for T returns this type data and
// not some synthesized object, so we need reflect to be able to // not some synthesized object, so we need reflect to be able to
// find it! // find it!
if !Ctxt.Flag_dynlink { if !Ctxt.Flag_dynlink {

View File

@ -2829,7 +2829,7 @@ func keydup(n *Node, hash map[uint32][]*Node) {
} }
evconst(n) evconst(n)
if n.Op != OLITERAL { if n.Op != OLITERAL {
return // we dont check variables return // we don't check variables
} }
var h uint32 var h uint32

View File

@ -2453,7 +2453,7 @@ func (tools gccgoToolchain) ld(b *builder, p *Package, out string, allactions []
apackagesSeen[a.p] = true apackagesSeen[a.p] = true
if a.p.fake && a.p.external { if a.p.fake && a.p.external {
// external _tests, if present must come before // external _tests, if present must come before
// internal _tests. Store these on a seperate list // internal _tests. Store these on a separate list
// and place them at the head after this loop. // and place them at the head after this loop.
xfiles = append(xfiles, a.target) xfiles = append(xfiles, a.target)
} else if a.p.fake { } else if a.p.fake {

View File

@ -503,7 +503,7 @@ func asmoutnacl(ctxt *obj.Link, origPC int32, p *obj.Prog, o *Optab, out []uint3
break break
} else { } else {
// if a load/store instruction takes more than 1 word to implement, then // if a load/store instruction takes more than 1 word to implement, then
// we need to seperate the instruction into two: // we need to separate the instruction into two:
// 1. explicitly load the address into R11. // 1. explicitly load the address into R11.
// 2. load/store from R11. // 2. load/store from R11.
// This won't handle .W/.P, so we should reject such code. // This won't handle .W/.P, so we should reject such code.

View File

@ -216,7 +216,7 @@ func writeInst(generate func(func([]byte))) (file string, f *os.File, size int,
var zeros = []byte{0, 0, 0, 0} var zeros = []byte{0, 0, 0, 0}
// pad pads the code sequenc with pops. // pad pads the code sequence with pops.
func pad(enc []byte) []byte { func pad(enc []byte) []byte {
if len(enc) < 4 { if len(enc) < 4 {
enc = append(enc[:len(enc):len(enc)], zeros[:4-len(enc)]...) enc = append(enc[:len(enc):len(enc)], zeros[:4-len(enc)]...)

View File

@ -225,7 +225,7 @@ var pops = []byte{
0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f, 0x5f,
} }
// pad pads the code sequenc with pops. // pad pads the code sequence with pops.
func pad(enc []byte) []byte { func pad(enc []byte) []byte {
return append(enc[:len(enc):len(enc)], pops...) return append(enc[:len(enc):len(enc)], pops...)
} }

View File

@ -179,7 +179,7 @@ func adddynrel(s *ld.LSym, r *ld.Reloc) {
ld.Adddynsym(ld.Ctxt, targ) ld.Adddynsym(ld.Ctxt, targ)
rel := ld.Linklookup(ld.Ctxt, ".rel", 0) rel := ld.Linklookup(ld.Ctxt, ".rel", 0)
ld.Addaddrplus(ld.Ctxt, rel, s, int64(r.Off)) ld.Addaddrplus(ld.Ctxt, rel, s, int64(r.Off))
ld.Adduint32(ld.Ctxt, rel, ld.ELF32_R_INFO(uint32(targ.Dynid), ld.R_ARM_GLOB_DAT)) // we need a nil + A dynmic reloc ld.Adduint32(ld.Ctxt, rel, ld.ELF32_R_INFO(uint32(targ.Dynid), ld.R_ARM_GLOB_DAT)) // we need a nil + A dynamic reloc
r.Type = obj.R_CONST // write r->add during relocsym r.Type = obj.R_CONST // write r->add during relocsym
r.Sym = nil r.Sym = nil
return return

View File

@ -126,7 +126,7 @@ func TestDisasmExtld(t *testing.T) {
case "arm64": case "arm64":
t.Skipf("skipping on %s, issue 10106", runtime.GOARCH) t.Skipf("skipping on %s, issue 10106", runtime.GOARCH)
} }
// TODO(jsing): Renable once openbsd/arm has external linking support. // TODO(jsing): Reenable once openbsd/arm has external linking support.
if runtime.GOOS == "openbsd" && runtime.GOARCH == "arm" { if runtime.GOOS == "openbsd" && runtime.GOARCH == "arm" {
t.Skip("skipping on openbsd/arm, no support for external linking, issue 10619") t.Skip("skipping on openbsd/arm, no support for external linking, issue 10619")
} }

View File

@ -162,7 +162,7 @@ var profileDecoder = []decoder{
pp.Location = append(pp.Location, x) pp.Location = append(pp.Location, x)
return decodeMessage(b, x) return decodeMessage(b, x)
}, },
// repeasted Function function = 5 // repeated Function function = 5
func(b *buffer, m message) error { func(b *buffer, m message) error {
x := new(Function) x := new(Function)
pp := m.(*Profile) pp := m.(*Profile)

View File

@ -17,7 +17,7 @@ var (
svgClose = regexp.MustCompile(`</svg>`) svgClose = regexp.MustCompile(`</svg>`)
) )
// Massage enhances the SVG output from DOT to provide bettern // Massage enhances the SVG output from DOT to provide better
// panning inside a web browser. It uses the SVGPan library, which is // panning inside a web browser. It uses the SVGPan library, which is
// included directly. // included directly.
func Massage(in bytes.Buffer) string { func Massage(in bytes.Buffer) string {

View File

@ -11,5 +11,5 @@
//go:generate yacc -o expr.go -p "expr" expr.y //go:generate yacc -o expr.go -p "expr" expr.y
// Expr is a simple expression evaluator that serves as a working example of // Expr is a simple expression evaluator that serves as a working example of
// how to use Go's yacc implemenation. // how to use Go's yacc implementation.
package main package main

View File

@ -129,7 +129,7 @@ type PrecomputedValues struct {
CRTValues []CRTValue CRTValues []CRTValue
} }
// CRTValue contains the precomputed chinese remainder theorem values. // CRTValue contains the precomputed Chinese remainder theorem values.
type CRTValue struct { type CRTValue struct {
Exp *big.Int // D mod (prime-1). Exp *big.Int // D mod (prime-1).
Coeff *big.Int // R·Coeff ≡ 1 mod Prime. Coeff *big.Int // R·Coeff ≡ 1 mod Prime.

View File

@ -46,7 +46,7 @@ func (ka rsaKeyAgreement) processClientKeyExchange(config *Config, cert *Certifi
if !ok { if !ok {
return nil, errors.New("tls: certificate private key does not implement crypto.Decrypter") return nil, errors.New("tls: certificate private key does not implement crypto.Decrypter")
} }
// Perform contant time RSA PKCS#1 v1.5 decryption // Perform constant time RSA PKCS#1 v1.5 decryption
preMasterSecret, err := priv.Decrypt(config.rand(), ciphertext, &rsa.PKCS1v15DecryptOptions{SessionKeyLen: 48}) preMasterSecret, err := priv.Decrypt(config.rand(), ciphertext, &rsa.PKCS1v15DecryptOptions{SessionKeyLen: 48})
if err != nil { if err != nil {
return nil, err return nil, err

View File

@ -282,7 +282,7 @@ const (
// into the "line" section. // into the "line" section.
ClassLinePtr ClassLinePtr
// ClassLocListPtr repersents values that are an int64 offset // ClassLocListPtr represents values that are an int64 offset
// into the "loclist" section. // into the "loclist" section.
ClassLocListPtr ClassLocListPtr

View File

@ -125,7 +125,7 @@ func (w *Writer) WriteAll(records [][]string) (err error) {
// CSV with quoted empty strings strictly less useful. // CSV with quoted empty strings strictly less useful.
// Not quoting the empty string also makes this package match the behavior // Not quoting the empty string also makes this package match the behavior
// of Microsoft Excel and Google Drive. // of Microsoft Excel and Google Drive.
// For Postgres, quote the data termating string `\.`. // For Postgres, quote the data terminating string `\.`.
func (w *Writer) fieldNeedsQuotes(field string) bool { func (w *Writer) fieldNeedsQuotes(field string) bool {
if field == "" { if field == "" {
return false return false

View File

@ -454,7 +454,7 @@ func postProcessTrace(events []*Event) error {
g.evStart = ev g.evStart = ev
p.g = ev.G p.g = ev.G
if g.evCreate != nil { if g.evCreate != nil {
// +1 because symblizer expects return pc. // +1 because symbolizer expects return pc.
ev.Stk = []*Frame{&Frame{PC: g.evCreate.Args[1] + 1}} ev.Stk = []*Frame{&Frame{PC: g.evCreate.Args[1] + 1}}
g.evCreate = nil g.evCreate = nil
} }
@ -701,7 +701,7 @@ const (
EvHeapAlloc = 33 // memstats.heap_alloc change [timestamp, heap_alloc] EvHeapAlloc = 33 // memstats.heap_alloc change [timestamp, heap_alloc]
EvNextGC = 34 // memstats.next_gc change [timestamp, next_gc] EvNextGC = 34 // memstats.next_gc change [timestamp, next_gc]
EvTimerGoroutine = 35 // denotes timer goroutine [timer goroutine id] EvTimerGoroutine = 35 // denotes timer goroutine [timer goroutine id]
EvFutileWakeup = 36 // denotes that the revious wakeup of this goroutine was futile [timestamp] EvFutileWakeup = 36 // denotes that the previous wakeup of this goroutine was futile [timestamp]
EvCount = 37 EvCount = 37
) )

View File

@ -156,7 +156,7 @@ var filePacketConnTests = []struct {
{net: "udp6", addr: "[::1]:0"}, {net: "udp6", addr: "[::1]:0"},
// TODO(mikioh,bradfitz): renable once 10730 is fixed // TODO(mikioh,bradfitz): reenable once 10730 is fixed
// {net: "ip4:icmp", addr: "127.0.0.1"}, // {net: "ip4:icmp", addr: "127.0.0.1"},
{net: "unixgram", addr: "@gotest3/net"}, {net: "unixgram", addr: "@gotest3/net"},

View File

@ -427,7 +427,7 @@ func TestJarCalls(t *testing.T) {
ts := httptest.NewServer(HandlerFunc(func(w ResponseWriter, r *Request) { ts := httptest.NewServer(HandlerFunc(func(w ResponseWriter, r *Request) {
pathSuffix := r.RequestURI[1:] pathSuffix := r.RequestURI[1:]
if r.RequestURI == "/nosetcookie" { if r.RequestURI == "/nosetcookie" {
return // dont set cookies for this path return // don't set cookies for this path
} }
SetCookie(w, &Cookie{Name: "name" + pathSuffix, Value: "val" + pathSuffix}) SetCookie(w, &Cookie{Name: "name" + pathSuffix, Value: "val" + pathSuffix})
if r.RequestURI == "/" { if r.RequestURI == "/" {

View File

@ -510,7 +510,7 @@ func TestStressSurpriseServerCloses(t *testing.T) {
// Do a bunch of traffic from different goroutines. Send to activityc // Do a bunch of traffic from different goroutines. Send to activityc
// after each request completes, regardless of whether it failed. // after each request completes, regardless of whether it failed.
// If these are too high, OS X exhausts its emphemeral ports // If these are too high, OS X exhausts its ephemeral ports
// and hangs waiting for them to transition TCP states. That's // and hangs waiting for them to transition TCP states. That's
// not what we want to test. TODO(bradfitz): use an io.Pipe // not what we want to test. TODO(bradfitz): use an io.Pipe
// dialer for this test instead? // dialer for this test instead?

View File

@ -68,7 +68,7 @@ func (sw *Switch) Closesocket(s syscall.Handle) (err error) {
return nil return nil
} }
// Conenct wraps syscall.Connect. // Connect wraps syscall.Connect.
func (sw *Switch) Connect(s syscall.Handle, sa syscall.Sockaddr) (err error) { func (sw *Switch) Connect(s syscall.Handle, sa syscall.Sockaddr) (err error) {
so := sw.sockso(s) so := sw.sockso(s)
if so == nil { if so == nil {
@ -97,7 +97,7 @@ func (sw *Switch) Connect(s syscall.Handle, sa syscall.Sockaddr) (err error) {
return nil return nil
} }
// ConenctEx wraps syscall.ConnectEx. // ConnectEx wraps syscall.ConnectEx.
func (sw *Switch) ConnectEx(s syscall.Handle, sa syscall.Sockaddr, b *byte, n uint32, nwr *uint32, o *syscall.Overlapped) (err error) { func (sw *Switch) ConnectEx(s syscall.Handle, sa syscall.Sockaddr, b *byte, n uint32, nwr *uint32, o *syscall.Overlapped) (err error) {
so := sw.sockso(s) so := sw.sockso(s)
if so == nil { if so == nil {

View File

@ -52,7 +52,7 @@ func socket(net string, family, sotype, proto int, ipv6only bool, laddr, raddr s
// following applications: // following applications:
// //
// - An endpoint holder that opens a passive stream // - An endpoint holder that opens a passive stream
// connenction, known as a stream listener // connection, known as a stream listener
// //
// - An endpoint holder that opens a destination-unspecific // - An endpoint holder that opens a destination-unspecific
// datagram connection, known as a datagram listener // datagram connection, known as a datagram listener

View File

@ -47,7 +47,7 @@ func ExampleURL_opaque() {
// Sending a literal '%' in an HTTP request's Path // Sending a literal '%' in an HTTP request's Path
req := &http.Request{ req := &http.Request{
Method: "GET", Method: "GET",
Host: "example.com", // takes precendence over URL.Host Host: "example.com", // takes precedence over URL.Host
URL: &url.URL{ URL: &url.URL{
Host: "ignored", Host: "ignored",
Scheme: "https", Scheme: "https",

View File

@ -422,7 +422,7 @@ var commandTests = []commandTest{
}, },
// tests commands, like `a.exe`, with c.Dir set // tests commands, like `a.exe`, with c.Dir set
{ {
// should not find a.exe in p, becasue LookPath(`a.exe`) will fail // should not find a.exe in p, because LookPath(`a.exe`) will fail
files: []string{`p\a.exe`}, files: []string{`p\a.exe`},
dir: `p`, dir: `p`,
arg0: `a.exe`, arg0: `a.exe`,

View File

@ -30,7 +30,7 @@ func TestLFStack(t *testing.T) {
stack := new(uint64) stack := new(uint64)
global = stack // force heap allocation global = stack // force heap allocation
// Need to keep additional referenfces to nodes, the stack is not all that type-safe. // Need to keep additional references to nodes, the stack is not all that type-safe.
var nodes []*MyNode var nodes []*MyNode
// Check the stack is initially empty. // Check the stack is initially empty.

View File

@ -355,7 +355,7 @@ func (h heapBits) setCheckmarked(size uintptr) {
// Callers should call heapBitsBulkBarrier immediately after // Callers should call heapBitsBulkBarrier immediately after
// calling memmove(p, src, size). This function is marked nosplit // calling memmove(p, src, size). This function is marked nosplit
// to avoid being preempted; the GC must not stop the goroutine // to avoid being preempted; the GC must not stop the goroutine
// betwen the memmove and the execution of the barriers. // between the memmove and the execution of the barriers.
// //
// The heap bitmap is not maintained for allocations containing // The heap bitmap is not maintained for allocations containing
// no pointers at all; any caller of heapBitsBulkBarrier must first // no pointers at all; any caller of heapBitsBulkBarrier must first

View File

@ -322,7 +322,7 @@ type gcControllerState struct {
fractionalMarkTime int64 fractionalMarkTime int64
// idleMarkTime is the nanoseconds spent in idle marking // idleMarkTime is the nanoseconds spent in idle marking
// during this cycle. This is udpated atomically throughout // during this cycle. This is updated atomically throughout
// the cycle. // the cycle.
idleMarkTime int64 idleMarkTime int64

View File

@ -954,7 +954,7 @@ func gcmarknewobject_m(obj, size uintptr) {
// stopped ensuring that any object encountered has their normal // stopped ensuring that any object encountered has their normal
// mark bit set. To do this we use an orthogonal bit // mark bit set. To do this we use an orthogonal bit
// pattern to indicate the object is marked. The following pattern // pattern to indicate the object is marked. The following pattern
// uses the upper two bits in the object's bounday nibble. // uses the upper two bits in the object's boundary nibble.
// 01: scalar not marked // 01: scalar not marked
// 10: pointer not marked // 10: pointer not marked
// 11: pointer marked // 11: pointer marked

View File

@ -308,7 +308,7 @@ func putfull(b *workbuf, entry int) {
// getpartialorempty tries to return a partially empty // getpartialorempty tries to return a partially empty
// and if none are available returns an empty one. // and if none are available returns an empty one.
// entry is used to provide a brief histoy of ownership // entry is used to provide a brief history of ownership
// using entry + xxx00000 to // using entry + xxx00000 to
// indicating that two line numbers in the call chain. // indicating that two line numbers in the call chain.
//go:nowritebarrier //go:nowritebarrier
@ -328,7 +328,7 @@ func getpartialorempty(entry int) *workbuf {
// putpartial puts empty buffers on the work.empty queue, // putpartial puts empty buffers on the work.empty queue,
// full buffers on the work.full queue and // full buffers on the work.full queue and
// others on the work.partial queue. // others on the work.partial queue.
// entry is used to provide a brief histoy of ownership // entry is used to provide a brief history of ownership
// using entry + xxx00000 to // using entry + xxx00000 to
// indicating that two call chain line numbers. // indicating that two call chain line numbers.
//go:nowritebarrier //go:nowritebarrier

View File

@ -58,7 +58,7 @@ type mheap struct {
cachealloc fixalloc // allocator for mcache* cachealloc fixalloc // allocator for mcache*
specialfinalizeralloc fixalloc // allocator for specialfinalizer* specialfinalizeralloc fixalloc // allocator for specialfinalizer*
specialprofilealloc fixalloc // allocator for specialprofile* specialprofilealloc fixalloc // allocator for specialprofile*
speciallock mutex // lock for sepcial record allocators. speciallock mutex // lock for special record allocators.
} }
var mheap_ mheap var mheap_ mheap

View File

@ -46,7 +46,7 @@ type pollDesc struct {
// in a lock-free way by all operations. // in a lock-free way by all operations.
// NOTE(dvyukov): the following code uses uintptr to store *g (rg/wg), // NOTE(dvyukov): the following code uses uintptr to store *g (rg/wg),
// that will blow up when GC starts moving objects. // that will blow up when GC starts moving objects.
lock mutex // protectes the following fields lock mutex // protects the following fields
fd uintptr fd uintptr
closing bool closing bool
seq uintptr // protects from stale timers and ready notifications seq uintptr // protects from stale timers and ready notifications

View File

@ -32,7 +32,7 @@ import "unsafe"
// Beside calling runtime·netpollopen, the networking code paths // Beside calling runtime·netpollopen, the networking code paths
// will call runtime·netpollarm each time goroutines are interested // will call runtime·netpollarm each time goroutines are interested
// in doing network I/O. Because now we know what kind of I/O we // in doing network I/O. Because now we know what kind of I/O we
// are interested in (reading/writting), we can call port_associate // are interested in (reading/writing), we can call port_associate
// passing the correct type of event set (POLLIN/POLLOUT). As we made // passing the correct type of event set (POLLIN/POLLOUT). As we made
// sure to have already associated the file descriptor with the port, // sure to have already associated the file descriptor with the port,
// when we now call port_associate, we will unblock the main poller // when we now call port_associate, we will unblock the main poller

View File

@ -411,7 +411,7 @@ func gopanic(e interface{}) {
// Mark defer as started, but keep on list, so that traceback // Mark defer as started, but keep on list, so that traceback
// can find and update the defer's argument frame if stack growth // can find and update the defer's argument frame if stack growth
// or a garbage collection hapens before reflectcall starts executing d.fn. // or a garbage collection happens before reflectcall starts executing d.fn.
d.started = true d.started = true
// Record the panic that is running the defer. // Record the panic that is running the defer.

View File

@ -1960,7 +1960,7 @@ func exitsyscall(dummy int32) {
var exitTicks int64 var exitTicks int64
if trace.enabled { if trace.enabled {
// Wait till traceGoSysBlock event is emited. // Wait till traceGoSysBlock event is emitted.
// This ensures consistency of the trace (the goroutine is started after it is blocked). // This ensures consistency of the trace (the goroutine is started after it is blocked).
for oldp != nil && oldp.syscalltick == _g_.m.syscalltick { for oldp != nil && oldp.syscalltick == _g_.m.syscalltick {
osyield() osyield()
@ -2047,7 +2047,7 @@ func exitsyscallfast() bool {
ok = exitsyscallfast_pidle() ok = exitsyscallfast_pidle()
if ok && trace.enabled { if ok && trace.enabled {
if oldp != nil { if oldp != nil {
// Wait till traceGoSysBlock event is emited. // Wait till traceGoSysBlock event is emitted.
// This ensures consistency of the trace (the goroutine is started after it is blocked). // This ensures consistency of the trace (the goroutine is started after it is blocked).
for oldp.syscalltick == _g_.m.syscalltick { for oldp.syscalltick == _g_.m.syscalltick {
osyield() osyield()
@ -2695,7 +2695,7 @@ func procresize(nprocs int32) *p {
traceProcStop(p) traceProcStop(p)
} }
} }
// move all runable goroutines to the global queue // move all runnable goroutines to the global queue
for p.runqhead != p.runqtail { for p.runqhead != p.runqtail {
// pop from tail of local queue // pop from tail of local queue
p.runqtail-- p.runqtail--

View File

@ -236,7 +236,7 @@ func TestRaceSelect4(t *testing.T) {
// there are two variables, access to one // there are two variables, access to one
// of them is synchronized, access to the other // of them is synchronized, access to the other
// is not. // is not.
// Select must (unconditionaly) choose the non-synchronized variable // Select must (unconditionally) choose the non-synchronized variable
// thus causing exactly one race. // thus causing exactly one race.
// Currently this test doesn't look like it accomplishes // Currently this test doesn't look like it accomplishes
// this goal. // this goal.

View File

@ -27,7 +27,7 @@ const (
// the following encode that the GC is scanning the stack and what to do when it is done // the following encode that the GC is scanning the stack and what to do when it is done
_Gscan = 0x1000 // atomicstatus&~Gscan = the non-scan state, _Gscan = 0x1000 // atomicstatus&~Gscan = the non-scan state,
// _Gscanidle = _Gscan + _Gidle, // Not used. Gidle only used with newly malloced gs // _Gscanidle = _Gscan + _Gidle, // Not used. Gidle only used with newly malloced gs
_Gscanrunnable = _Gscan + _Grunnable // 0x1001 When scanning complets make Grunnable (it is already on run queue) _Gscanrunnable = _Gscan + _Grunnable // 0x1001 When scanning completes make Grunnable (it is already on run queue)
_Gscanrunning = _Gscan + _Grunning // 0x1002 Used to tell preemption newstack routine to scan preempted stack. _Gscanrunning = _Gscan + _Grunning // 0x1002 Used to tell preemption newstack routine to scan preempted stack.
_Gscansyscall = _Gscan + _Gsyscall // 0x1003 When scanning completes make it Gsyscall _Gscansyscall = _Gscan + _Gsyscall // 0x1003 When scanning completes make it Gsyscall
_Gscanwaiting = _Gscan + _Gwaiting // 0x1004 When scanning completes make it Gwaiting _Gscanwaiting = _Gscan + _Gwaiting // 0x1004 When scanning completes make it Gwaiting
@ -237,7 +237,7 @@ type g struct {
preempt bool // preemption signal, duplicates stackguard0 = stackpreempt preempt bool // preemption signal, duplicates stackguard0 = stackpreempt
paniconfault bool // panic (instead of crash) on unexpected fault address paniconfault bool // panic (instead of crash) on unexpected fault address
preemptscan bool // preempted g does scan for gc preemptscan bool // preempted g does scan for gc
gcworkdone bool // debug: cleared at begining of gc work phase cycle, set by gcphasework, tested at end of cycle gcworkdone bool // debug: cleared at beginning of gc work phase cycle, set by gcphasework, tested at end of cycle
gcscanvalid bool // false at start of gc cycle, true if G has not run since last scan gcscanvalid bool // false at start of gc cycle, true if G has not run since last scan
throwsplit bool // must not split stack throwsplit bool // must not split stack
raceignore int8 // ignore race detection events raceignore int8 // ignore race detection events

View File

@ -83,7 +83,7 @@ func growslice(t *slicetype, old slice, n int) slice {
memmove(p, old.array, lenmem) memmove(p, old.array, lenmem)
memclr(add(p, lenmem), capmem-lenmem) memclr(add(p, lenmem), capmem-lenmem)
} else { } else {
// Note: can't use rawmem (which avoids zeroing of memory), because then GC can scan unitialized memory. // Note: can't use rawmem (which avoids zeroing of memory), because then GC can scan uninitialized memory.
p = newarray(et, uintptr(newcap)) p = newarray(et, uintptr(newcap))
if !writeBarrierEnabled { if !writeBarrierEnabled {
memmove(p, old.array, lenmem) memmove(p, old.array, lenmem)

View File

@ -3,7 +3,7 @@
// license that can be found in the LICENSE file. // license that can be found in the LICENSE file.
// A copy of Sqrt tests from the math package to test the // A copy of Sqrt tests from the math package to test the
// purely integer arithmetic implementaiton in sqrt.go. // purely integer arithmetic implementation in sqrt.go.
package runtime_test package runtime_test

View File

@ -322,7 +322,7 @@ ret:
// Enable exceptions again. // Enable exceptions again.
NACL_SYSCALL(SYS_exception_clear_flag) NACL_SYSCALL(SYS_exception_clear_flag)
// NaCl has abidcated its traditional operating system responsibility // NaCl has abdicated its traditional operating system responsibility
// and declined to implement 'sigreturn'. Instead the only way to return // and declined to implement 'sigreturn'. Instead the only way to return
// to the execution of our program is to restore the registers ourselves. // to the execution of our program is to restore the registers ourselves.
// Unfortunately, that is impossible to do with strict fidelity, because // Unfortunately, that is impossible to do with strict fidelity, because

View File

@ -55,7 +55,7 @@ func LoadDLL(name string) (dll *DLL, err error) {
return d, nil return d, nil
} }
// MustLoadDLL is like LoadDLL but panics if load operation failes. // MustLoadDLL is like LoadDLL but panics if load operation fails.
func MustLoadDLL(name string) *DLL { func MustLoadDLL(name string) *DLL {
d, e := LoadDLL(name) d, e := LoadDLL(name)
if e != nil { if e != nil {

View File

@ -627,7 +627,7 @@ func (src *Source) DLLs() []string {
return r return r
} }
// ParseFile adds adition file path to a source set src. // ParseFile adds additional file path to a source set src.
func (src *Source) ParseFile(path string) error { func (src *Source) ParseFile(path string) error {
file, err := os.Open(path) file, err := os.Open(path)
if err != nil { if err != nil {

View File

@ -58,7 +58,7 @@ func parseSockaddrLink(b []byte) (*SockaddrDatalink, error) {
// parseLinkLayerAddr parses b as a datalink socket address in // parseLinkLayerAddr parses b as a datalink socket address in
// conventional BSD kernel form. // conventional BSD kernel form.
func parseLinkLayerAddr(b []byte) (*SockaddrDatalink, int, error) { func parseLinkLayerAddr(b []byte) (*SockaddrDatalink, int, error) {
// The encoding looks like the follwoing: // The encoding looks like the following:
// +----------------------------+ // +----------------------------+
// | Type (1 octet) | // | Type (1 octet) |
// +----------------------------+ // +----------------------------+