Commit 440f7d64 authored by Ville Skyttä's avatar Ville Skyttä Committed by Ian Lance Taylor

all: fix a bunch of misspellings

Change-Id: I5b909df0fd048cd66c5a27fca1b06466d3bcaac7
GitHub-Last-Rev: 778c5d21311abee09a5fbda2e4005a5fd4cc3f9f
GitHub-Pull-Request: golang/go#35624
Reviewed-on: https://go-review.googlesource.com/c/go/+/207421
Run-TryBot: Ian Lance Taylor <iant@golang.org>
TryBot-Result: Gobot Gobot <gobot@golang.org>
Reviewed-by: default avatarIan Lance Taylor <iant@golang.org>
parent d856e05d
...@@ -6307,7 +6307,7 @@ function define(className,opt_parentConstructor,opt_tagNS){if(typeof className== ...@@ -6307,7 +6307,7 @@ function define(className,opt_parentConstructor,opt_tagNS){if(typeof className==
className=className.toLowerCase();if(opt_parentConstructor&&!opt_parentConstructor.tagName){throw new Error('opt_parentConstructor was not '+'created by tr.ui.b.define');} className=className.toLowerCase();if(opt_parentConstructor&&!opt_parentConstructor.tagName){throw new Error('opt_parentConstructor was not '+'created by tr.ui.b.define');}
let tagName=className;let tagNS=undefined;if(opt_parentConstructor){if(opt_tagNS){throw new Error('Must not specify tagNS if parentConstructor is given');} let tagName=className;let tagNS=undefined;if(opt_parentConstructor){if(opt_tagNS){throw new Error('Must not specify tagNS if parentConstructor is given');}
let parent=opt_parentConstructor;while(parent&&parent.tagName){tagName=parent.tagName;tagNS=parent.tagNS;parent=parent.parentConstructor;}}else{tagNS=opt_tagNS;} let parent=opt_parentConstructor;while(parent&&parent.tagName){tagName=parent.tagName;tagNS=parent.tagNS;parent=parent.parentConstructor;}}else{tagNS=opt_tagNS;}
function f(){if(opt_parentConstructor&&f.prototype.__proto__!==opt_parentConstructor.prototype){throw new Error(className+' prototye\'s __proto__ field is messed up. '+'It MUST be the prototype of '+opt_parentConstructor.tagName);} function f(){if(opt_parentConstructor&&f.prototype.__proto__!==opt_parentConstructor.prototype){throw new Error(className+' prototype\'s __proto__ field is messed up. '+'It MUST be the prototype of '+opt_parentConstructor.tagName);}
let el;if(tagNS===undefined){el=tr.doc.createElement(tagName);}else{el=tr.doc.createElementNS(tagNS,tagName);} let el;if(tagNS===undefined){el=tr.doc.createElement(tagName);}else{el=tr.doc.createElementNS(tagNS,tagName);}
f.decorate.call(this,el,arguments);return el;} f.decorate.call(this,el,arguments);return el;}
f.decorate=function(el){el.__proto__=f.prototype;el.decorate.apply(el,arguments[1]);el.constructor=f;};f.className=className;f.tagName=tagName;f.tagNS=tagNS;f.parentConstructor=(opt_parentConstructor?opt_parentConstructor:undefined);f.toString=function(){if(!f.parentConstructor){return f.tagName;} f.decorate=function(el){el.__proto__=f.prototype;el.decorate.apply(el,arguments[1]);el.constructor=f;};f.className=className;f.tagName=tagName;f.tagNS=tagNS;f.parentConstructor=(opt_parentConstructor?opt_parentConstructor:undefined);f.toString=function(){if(!f.parentConstructor){return f.tagName;}
...@@ -127,7 +127,7 @@ const ( ...@@ -127,7 +127,7 @@ const (
) )
// untype returns the "pseudo" untyped type for a Ctype (import/export use only). // untype returns the "pseudo" untyped type for a Ctype (import/export use only).
// (we can't use an pre-initialized array because we must be sure all types are // (we can't use a pre-initialized array because we must be sure all types are
// set up) // set up)
func untype(ctype Ctype) *types.Type { func untype(ctype Ctype) *types.Type {
switch ctype { switch ctype {
......
...@@ -652,7 +652,7 @@ func (lv *Liveness) markUnsafePoints() { ...@@ -652,7 +652,7 @@ func (lv *Liveness) markUnsafePoints() {
lv.unsafePoints = bvalloc(int32(lv.f.NumValues())) lv.unsafePoints = bvalloc(int32(lv.f.NumValues()))
// Mark architecture-specific unsafe pointes. // Mark architecture-specific unsafe points.
for _, b := range lv.f.Blocks { for _, b := range lv.f.Blocks {
for _, v := range b.Values { for _, v := range b.Values {
if v.Op.UnsafePoint() { if v.Op.UnsafePoint() {
......
...@@ -101,7 +101,7 @@ func typecheckrangeExpr(n *Node) { ...@@ -101,7 +101,7 @@ func typecheckrangeExpr(n *Node) {
v2 = n.List.Second() v2 = n.List.Second()
} }
// this is not only a optimization but also a requirement in the spec. // this is not only an optimization but also a requirement in the spec.
// "if the second iteration variable is the blank identifier, the range // "if the second iteration variable is the blank identifier, the range
// clause is equivalent to the same clause with only the first variable // clause is equivalent to the same clause with only the first variable
// present." // present."
......
...@@ -223,7 +223,7 @@ func (b *Block) CopyControls(from *Block) { ...@@ -223,7 +223,7 @@ func (b *Block) CopyControls(from *Block) {
} }
// Reset sets the block to the provided kind and clears all the blocks control // Reset sets the block to the provided kind and clears all the blocks control
// and auxilliary values. Other properties of the block, such as its successors, // and auxiliary values. Other properties of the block, such as its successors,
// predecessors and values are left unmodified. // predecessors and values are left unmodified.
func (b *Block) Reset(kind BlockKind) { func (b *Block) Reset(kind BlockKind) {
b.Kind = kind b.Kind = kind
......
...@@ -359,7 +359,7 @@ ...@@ -359,7 +359,7 @@
(Geq32U x y) -> (GreaterEqualU (CMPW x y)) (Geq32U x y) -> (GreaterEqualU (CMPW x y))
(Geq64U x y) -> (GreaterEqualU (CMP x y)) (Geq64U x y) -> (GreaterEqualU (CMP x y))
// Optimize comparision between a floating-point value and 0.0 with "FCMP $(0.0), Fn" // Optimize comparison between a floating-point value and 0.0 with "FCMP $(0.0), Fn"
(FCMPS x (FMOVSconst [0])) -> (FCMPS0 x) (FCMPS x (FMOVSconst [0])) -> (FCMPS0 x)
(FCMPS (FMOVSconst [0]) x) -> (InvertFlags (FCMPS0 x)) (FCMPS (FMOVSconst [0]) x) -> (InvertFlags (FCMPS0 x))
(FCMPD x (FMOVDconst [0])) -> (FCMPD0 x) (FCMPD x (FMOVDconst [0])) -> (FCMPD0 x)
......
...@@ -1180,7 +1180,7 @@ ...@@ -1180,7 +1180,7 @@
// Divisibility checks x%c == 0 convert to multiply and rotate. // Divisibility checks x%c == 0 convert to multiply and rotate.
// Note, x%c == 0 is rewritten as x == c*(x/c) during the opt pass // Note, x%c == 0 is rewritten as x == c*(x/c) during the opt pass
// where (x/c) is peformed using multiplication with magic constants. // where (x/c) is performed using multiplication with magic constants.
// To rewrite x%c == 0 requires pattern matching the rewritten expression // To rewrite x%c == 0 requires pattern matching the rewritten expression
// and checking that the division by the same constant wasn't already calculated. // and checking that the division by the same constant wasn't already calculated.
// This check is made by counting uses of the magic constant multiplication. // This check is made by counting uses of the magic constant multiplication.
......
...@@ -294,7 +294,7 @@ func TestNilcheckKeepRemove(t *testing.T) { ...@@ -294,7 +294,7 @@ func TestNilcheckKeepRemove(t *testing.T) {
} }
} }
// TestNilcheckInFalseBranch tests that nil checks in the false branch of an nilcheck // TestNilcheckInFalseBranch tests that nil checks in the false branch of a nilcheck
// block are *not* removed. // block are *not* removed.
func TestNilcheckInFalseBranch(t *testing.T) { func TestNilcheckInFalseBranch(t *testing.T) {
c := testConfig(t) c := testConfig(t)
......
...@@ -1133,7 +1133,7 @@ func writelines(ctxt *Link, unit *sym.CompilationUnit, ls *sym.Symbol) { ...@@ -1133,7 +1133,7 @@ func writelines(ctxt *Link, unit *sym.CompilationUnit, ls *sym.Symbol) {
lastAddr = addr lastAddr = addr
// Output the line table. // Output the line table.
// TODO: Now that we have all the debug information in seperate // TODO: Now that we have all the debug information in separate
// symbols, it would make sense to use a rope, and concatenate them all // symbols, it would make sense to use a rope, and concatenate them all
// together rather then the append() below. This would allow us to have // together rather then the append() below. This would allow us to have
// the compiler emit the DW_LNE_set_address and a rope data structure // the compiler emit the DW_LNE_set_address and a rope data structure
......
...@@ -459,16 +459,16 @@ func readpesym(arch *sys.Arch, lookup func(string, int) *sym.Symbol, f *pe.File, ...@@ -459,16 +459,16 @@ func readpesym(arch *sys.Arch, lookup func(string, int) *sym.Symbol, f *pe.File,
case sys.AMD64: case sys.AMD64:
if name == "__imp___acrt_iob_func" { if name == "__imp___acrt_iob_func" {
// Do not rename __imp___acrt_iob_func into __acrt_iob_func, // Do not rename __imp___acrt_iob_func into __acrt_iob_func,
// becasue __imp___acrt_iob_func symbol is real // because __imp___acrt_iob_func symbol is real
// (see commit b295099 from git://git.code.sf.net/p/mingw-w64/mingw-w64 for detials). // (see commit b295099 from git://git.code.sf.net/p/mingw-w64/mingw-w64 for details).
} else { } else {
name = strings.TrimPrefix(name, "__imp_") // __imp_Name => Name name = strings.TrimPrefix(name, "__imp_") // __imp_Name => Name
} }
case sys.I386: case sys.I386:
if name == "__imp____acrt_iob_func" { if name == "__imp____acrt_iob_func" {
// Do not rename __imp____acrt_iob_func into ___acrt_iob_func, // Do not rename __imp____acrt_iob_func into ___acrt_iob_func,
// becasue __imp____acrt_iob_func symbol is real // because __imp____acrt_iob_func symbol is real
// (see commit b295099 from git://git.code.sf.net/p/mingw-w64/mingw-w64 for detials). // (see commit b295099 from git://git.code.sf.net/p/mingw-w64/mingw-w64 for details).
} else { } else {
name = strings.TrimPrefix(name, "__imp_") // __imp_Name => Name name = strings.TrimPrefix(name, "__imp_") // __imp_Name => Name
} }
......
...@@ -108,7 +108,7 @@ func TestSignAndVerifyWithBadPublicKey(t *testing.T) { ...@@ -108,7 +108,7 @@ func TestSignAndVerifyWithBadPublicKey(t *testing.T) {
} }
if Verify(&pub, []byte("testing"), fromHex("2"), fromHex("4")) { if Verify(&pub, []byte("testing"), fromHex("2"), fromHex("4")) {
t.Errorf("Verify unexpected success with non-existant mod inverse of Q") t.Errorf("Verify unexpected success with non-existent mod inverse of Q")
} }
} }
......
...@@ -85,7 +85,7 @@ func (p256Curve) ScalarMult(bigX, bigY *big.Int, scalar []byte) (x, y *big.Int) ...@@ -85,7 +85,7 @@ func (p256Curve) ScalarMult(bigX, bigY *big.Int, scalar []byte) (x, y *big.Int)
// Field elements are represented as nine, unsigned 32-bit words. // Field elements are represented as nine, unsigned 32-bit words.
// //
// The value of an field element is: // The value of a field element is:
// x[0] + (x[1] * 2**29) + (x[2] * 2**57) + ... + (x[8] * 2**228) // x[0] + (x[1] * 2**29) + (x[2] * 2**57) + ... + (x[8] * 2**228)
// //
// That is, each limb is alternately 29 or 28-bits wide in little-endian // That is, each limb is alternately 29 or 28-bits wide in little-endian
......
...@@ -241,7 +241,7 @@ func (hs *serverHandshakeState) processClientHello() error { ...@@ -241,7 +241,7 @@ func (hs *serverHandshakeState) processClientHello() error {
hs.ecdheOk = supportsECDHE(c.config, hs.clientHello.supportedCurves, hs.clientHello.supportedPoints) hs.ecdheOk = supportsECDHE(c.config, hs.clientHello.supportedCurves, hs.clientHello.supportedPoints)
if hs.ecdheOk { if hs.ecdheOk {
// Although omiting the ec_point_formats extension is permitted, some // Although omitting the ec_point_formats extension is permitted, some
// old OpenSSL version will refuse to handshake if not present. // old OpenSSL version will refuse to handshake if not present.
// //
// Per RFC 4492, section 5.1.2, implementations MUST support the // Per RFC 4492, section 5.1.2, implementations MUST support the
......
...@@ -274,7 +274,7 @@ func TestTLS12OnlyCipherSuites(t *testing.T) { ...@@ -274,7 +274,7 @@ func TestTLS12OnlyCipherSuites(t *testing.T) {
} }
func TestTLSPointFormats(t *testing.T) { func TestTLSPointFormats(t *testing.T) {
// Test that a Server returns the ec_point_format extention when ECC is // Test that a Server returns the ec_point_format extension when ECC is
// negotiated, and not returned on RSA handshake. // negotiated, and not returned on RSA handshake.
tests := []struct { tests := []struct {
name string name string
......
...@@ -818,6 +818,6 @@ func TestIssue10996(t *testing.T) { ...@@ -818,6 +818,6 @@ func TestIssue10996(t *testing.T) {
"0000") "0000")
_, err := NewFile(bytes.NewReader(data)) _, err := NewFile(bytes.NewReader(data))
if err == nil { if err == nil {
t.Fatalf("opening invalid ELF file unexpectedly suceeded") t.Fatalf("opening invalid ELF file unexpectedly succeeded")
} }
} }
...@@ -475,7 +475,7 @@ func readOptionalHeader(r io.ReadSeeker, sz uint16) (interface{}, error) { ...@@ -475,7 +475,7 @@ func readOptionalHeader(r io.ReadSeeker, sz uint16) (interface{}, error) {
var ( var (
oh32 OptionalHeader32 oh32 OptionalHeader32
// There can be 0 or more data directories. So the minimum size of optional // There can be 0 or more data directories. So the minimum size of optional
// header is calculated by substracting oh32.DataDirectory size from oh32 size. // header is calculated by subtracting oh32.DataDirectory size from oh32 size.
oh32MinSz = binary.Size(oh32) - binary.Size(oh32.DataDirectory) oh32MinSz = binary.Size(oh32) - binary.Size(oh32.DataDirectory)
) )
...@@ -529,7 +529,7 @@ func readOptionalHeader(r io.ReadSeeker, sz uint16) (interface{}, error) { ...@@ -529,7 +529,7 @@ func readOptionalHeader(r io.ReadSeeker, sz uint16) (interface{}, error) {
var ( var (
oh64 OptionalHeader64 oh64 OptionalHeader64
// There can be 0 or more data directories. So the minimum size of optional // There can be 0 or more data directories. So the minimum size of optional
// header is calculated by substracting oh64.DataDirectory size from oh64 size. // header is calculated by subtracting oh64.DataDirectory size from oh64 size.
oh64MinSz = binary.Size(oh64) - binary.Size(oh64.DataDirectory) oh64MinSz = binary.Size(oh64) - binary.Size(oh64.DataDirectory)
) )
......
...@@ -95,7 +95,7 @@ TEXT countbytebody<>(SB), NOSPLIT|NOFRAME, $0-0 ...@@ -95,7 +95,7 @@ TEXT countbytebody<>(SB), NOSPLIT|NOFRAME, $0-0
vxchunks: vxchunks:
// Load 0x01 into every byte element in the 16-byte mask vector. // Load 0x01 into every byte element in the 16-byte mask vector.
VREPIB $1, V_MASK // V_MASK = [16]byte{1, 1, ..., 1, 1} VREPIB $1, V_MASK // V_MASK = [16]byte{1, 1, ..., 1, 1}
VZERO V_CNT // intial uint128 count of 0 VZERO V_CNT // initial uint128 count of 0
vxloop: vxloop:
// Load input bytes in 16-byte chunks. // Load input bytes in 16-byte chunks.
......
...@@ -886,7 +886,7 @@ func (z nat) divRecursiveStep(u, v nat, depth int, tmp *nat, temps []*nat) { ...@@ -886,7 +886,7 @@ func (z nat) divRecursiveStep(u, v nat, depth int, tmp *nat, temps []*nat) {
// u = q̂ (v - v_l) + rh << s + u_l // u = q̂ (v - v_l) + rh << s + u_l
// After the above step, u contains a remainder: // After the above step, u contains a remainder:
// u = rh << s + u_l // u = rh << s + u_l
// and we need to substract q̂ v_l // and we need to subtract q̂ v_l
// //
// But it may be a bit too large, in which case q̂ needs to be smaller. // But it may be a bit too large, in which case q̂ needs to be smaller.
qhatv := tmp.make(3 * n) qhatv := tmp.make(3 * n)
......
...@@ -4352,7 +4352,7 @@ func TestCloseWrite(t *testing.T) { ...@@ -4352,7 +4352,7 @@ func TestCloseWrite(t *testing.T) {
// This verifies that a handler can Flush and then Hijack. // This verifies that a handler can Flush and then Hijack.
// //
// An similar test crashed once during development, but it was only // A similar test crashed once during development, but it was only
// testing this tangentially and temporarily until another TODO was // testing this tangentially and temporarily until another TODO was
// fixed. // fixed.
// //
......
...@@ -633,11 +633,11 @@ func chunked(te []string) bool { return len(te) > 0 && te[len(te)-1] == "chunked ...@@ -633,11 +633,11 @@ func chunked(te []string) bool { return len(te) > 0 && te[len(te)-1] == "chunked
// implicitlyChunked is a helper to check for implicity of chunked, because // implicitlyChunked is a helper to check for implicity of chunked, because
// RFC 7230 Section 3.3.1 says that the sender MUST apply chunked as the final // RFC 7230 Section 3.3.1 says that the sender MUST apply chunked as the final
// payload body to ensure that the message is framed for both the request // payload body to ensure that the message is framed for both the request
// and the body. Since "identity" is incompatabile with any other transformational // and the body. Since "identity" is incompatible with any other transformational
// encoding cannot co-exist, the presence of "identity" will cause implicitlyChunked // encoding cannot co-exist, the presence of "identity" will cause implicitlyChunked
// to return false. // to return false.
func implicitlyChunked(te []string) bool { func implicitlyChunked(te []string) bool {
if len(te) == 0 { // No transfer-encodings passed in, so not implicity chunked. if len(te) == 0 { // No transfer-encodings passed in, so not implicitly chunked.
return false return false
} }
for _, tei := range te { for _, tei := range te {
......
...@@ -89,7 +89,7 @@ const DefaultMaxIdleConnsPerHost = 2 ...@@ -89,7 +89,7 @@ const DefaultMaxIdleConnsPerHost = 2
// Request.GetBody defined. HTTP requests are considered idempotent if // Request.GetBody defined. HTTP requests are considered idempotent if
// they have HTTP methods GET, HEAD, OPTIONS, or TRACE; or if their // they have HTTP methods GET, HEAD, OPTIONS, or TRACE; or if their
// Header map contains an "Idempotency-Key" or "X-Idempotency-Key" // Header map contains an "Idempotency-Key" or "X-Idempotency-Key"
// entry. If the idempotency key value is an zero-length slice, the // entry. If the idempotency key value is a zero-length slice, the
// request is treated as idempotent but the header is not sent on the // request is treated as idempotent but the header is not sent on the
// wire. // wire.
type Transport struct { type Transport struct {
......
...@@ -3717,7 +3717,7 @@ func TestTransportRemovesH2ConnsAfterIdle(t *testing.T) { ...@@ -3717,7 +3717,7 @@ func TestTransportRemovesH2ConnsAfterIdle(t *testing.T) {
} }
} }
// This tests that an client requesting a content range won't also // This tests that a client requesting a content range won't also
// implicitly ask for gzip support. If they want that, they need to do it // implicitly ask for gzip support. If they want that, they need to do it
// on their own. // on their own.
// golang.org/issue/8923 // golang.org/issue/8923
......
...@@ -162,7 +162,7 @@ func ipToSockaddr(family int, ip IP, port int, zone string) (syscall.Sockaddr, e ...@@ -162,7 +162,7 @@ func ipToSockaddr(family int, ip IP, port int, zone string) (syscall.Sockaddr, e
// of IP node. // of IP node.
// //
// When the IP node supports IPv4-mapped IPv6 address, // When the IP node supports IPv4-mapped IPv6 address,
// we allow an listener to listen to the wildcard // we allow a listener to listen to the wildcard
// address of both IP addressing spaces by specifying // address of both IP addressing spaces by specifying
// IPv6 wildcard address. // IPv6 wildcard address.
if len(ip) == 0 || ip.Equal(IPv4zero) { if len(ip) == 0 || ip.Equal(IPv4zero) {
......
...@@ -375,7 +375,7 @@ func validRecs(r *syscall.DNSRecord, dnstype uint16, name string) []*syscall.DNS ...@@ -375,7 +375,7 @@ func validRecs(r *syscall.DNSRecord, dnstype uint16, name string) []*syscall.DNS
// returns the last CNAME in chain // returns the last CNAME in chain
func resolveCNAME(name *uint16, r *syscall.DNSRecord) *uint16 { func resolveCNAME(name *uint16, r *syscall.DNSRecord) *uint16 {
// limit cname resolving to 10 in case of a infinite CNAME loop // limit cname resolving to 10 in case of an infinite CNAME loop
Cname: Cname:
for cnameloop := 0; cnameloop < 10; cnameloop++ { for cnameloop := 0; cnameloop < 10; cnameloop++ {
for p := r; p != nil; p = p.Next { for p := r; p != nil; p = p.Next {
......
...@@ -8,7 +8,7 @@ ...@@ -8,7 +8,7 @@
Input to cgo -godefs Input to cgo -godefs
GOARCH=ppc64 go tool cgo -godefs defs_aix.go > defs_aix_ppc64_tmp.go GOARCH=ppc64 go tool cgo -godefs defs_aix.go > defs_aix_ppc64_tmp.go
This is only an helper to create defs_aix_ppc64.go This is only a helper to create defs_aix_ppc64.go
Go runtime functions require the "linux" name of fields (ss_sp, si_addr, etc) Go runtime functions require the "linux" name of fields (ss_sp, si_addr, etc)
However, AIX structures don't provide such names and must be modified. However, AIX structures don't provide such names and must be modified.
......
...@@ -88,7 +88,7 @@ func (e plainError) Error() string { ...@@ -88,7 +88,7 @@ func (e plainError) Error() string {
return string(e) return string(e)
} }
// An boundsError represents a an indexing or slicing operation gone wrong. // A boundsError represents an indexing or slicing operation gone wrong.
type boundsError struct { type boundsError struct {
x int64 x int64
y int y int
......
...@@ -521,7 +521,7 @@ func fillAligned(x uint64, m uint) uint64 { ...@@ -521,7 +521,7 @@ func fillAligned(x uint64, m uint) uint64 {
// "[It] works by first zeroing the high bits of the [8] // "[It] works by first zeroing the high bits of the [8]
// bytes in the word. Subsequently, it adds a number that // bytes in the word. Subsequently, it adds a number that
// will result in an overflow to the high bit of a byte if // will result in an overflow to the high bit of a byte if
// any of the low bits were initialy set. Next the high // any of the low bits were initially set. Next the high
// bits of the original word are ORed with these values; // bits of the original word are ORed with these values;
// thus, the high bit of a byte is set iff any bit in the // thus, the high bit of a byte is set iff any bit in the
// byte was set. Finally, we determine if any of these high // byte was set. Finally, we determine if any of these high
......
...@@ -1419,7 +1419,7 @@ func (h *mheap) freeSpanLocked(s *mspan, acctinuse, acctidle bool) { ...@@ -1419,7 +1419,7 @@ func (h *mheap) freeSpanLocked(s *mspan, acctinuse, acctidle bool) {
// unscav and adds it into scav before continuing. // unscav and adds it into scav before continuing.
func (h *mheap) scavengeAll() { func (h *mheap) scavengeAll() {
// Disallow malloc or panic while holding the heap lock. We do // Disallow malloc or panic while holding the heap lock. We do
// this here because this is an non-mallocgc entry-point to // this here because this is a non-mallocgc entry-point to
// the mheap API. // the mheap API.
gp := getg() gp := getg()
gp.m.mallocing++ gp.m.mallocing++
......
...@@ -112,7 +112,7 @@ func containsInlinedCall(f interface{}, maxBytes int) bool { ...@@ -112,7 +112,7 @@ func containsInlinedCall(f interface{}, maxBytes int) bool {
} }
// findInlinedCall returns the PC of an inlined function call within // findInlinedCall returns the PC of an inlined function call within
// the funtion body for the function f if any. // the function body for the function f if any.
func findInlinedCall(f interface{}, maxBytes int) (pc uint64, found bool) { func findInlinedCall(f interface{}, maxBytes int) (pc uint64, found bool) {
fFunc := runtime.FuncForPC(uintptr(funcPC(f))) fFunc := runtime.FuncForPC(uintptr(funcPC(f)))
if fFunc == nil || fFunc.Entry() == 0 { if fFunc == nil || fFunc.Entry() == 0 {
......
...@@ -16,7 +16,7 @@ type slice struct { ...@@ -16,7 +16,7 @@ type slice struct {
cap int cap int
} }
// An notInHeapSlice is a slice backed by go:notinheap memory. // A notInHeapSlice is a slice backed by go:notinheap memory.
type notInHeapSlice struct { type notInHeapSlice struct {
array *notInHeap array *notInHeap
len int len int
......
...@@ -627,7 +627,7 @@ func adjustframe(frame *stkframe, arg unsafe.Pointer) bool { ...@@ -627,7 +627,7 @@ func adjustframe(frame *stkframe, arg unsafe.Pointer) bool {
print(" adjusting ", funcname(f), " frame=[", hex(frame.sp), ",", hex(frame.fp), "] pc=", hex(frame.pc), " continpc=", hex(frame.continpc), "\n") print(" adjusting ", funcname(f), " frame=[", hex(frame.sp), ",", hex(frame.fp), "] pc=", hex(frame.pc), " continpc=", hex(frame.continpc), "\n")
} }
if f.funcID == funcID_systemstack_switch { if f.funcID == funcID_systemstack_switch {
// A special routine at the bottom of stack of a goroutine that does an systemstack call. // A special routine at the bottom of stack of a goroutine that does a systemstack call.
// We will allow it to be copied even though we don't // We will allow it to be copied even though we don't
// have full GC info for it (because it is written in asm). // have full GC info for it (because it is written in asm).
return true return true
......
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