{"a☺b☻c☹d\xe2\x98�\xff�\xed\xa0\x80", 0xD800, -1}, // Surrogate pair
{"a☺b☻c☹d\xe2\x98�\xff�\xed\xa0\x80", utf8.MaxRune + 1, -1},
- // Test the cutover to to bytealg.Index when it is triggered in
+ // Test the cutover to bytealg.Index when it is triggered in
// the middle of rune that contains consecutive runs of equal bytes.
{"aaaaaKKKK\U000bc104", '\U000bc104', 17}, // cutover: (n + 16) / 8
{"aaaaaKKKK鄄", '鄄', 17},
// dictionary parameter. We could devirtualize this call if we
// could derive an appropriate dictionary argument.
//
- // TODO(mdempsky): If typ has has a promoted non-generic method,
+ // TODO(mdempsky): If typ has a promoted non-generic method,
// then that method won't require a dictionary argument. We could
// still devirtualize those calls.
//
}
// runtime.memhash_varlen does not look like a closure, but it uses
// runtime.getclosureptr to access data encoded by callers, which are
- // are generated by cmd/compile/internal/reflectdata.genhash.
+ // generated by cmd/compile/internal/reflectdata.genhash.
if callee.Sym().Pkg.Path == "runtime" && callee.Sym().Name == "memhash_varlen" {
if base.Debug.PGODebug >= 3 {
fmt.Printf("callee %s is a closure (runtime.memhash_varlen), skipping\n", ir.FuncName(callee))
// opposed to a new walk on every call).
type ReassignOracle struct {
fn *Func
- // maps candidate name to its defining assignment (or for
+ // maps candidate name to its defining assignment (or
// for params, defining func).
singleDef map[*Name]Node
}
}
// Kill method should be invoked on instruction at position p if instr
-// should be treated as as having a kill (lifetime end) for the
+// should be treated as having a kill (lifetime end) for the
// resource. See the example in the comment at the beginning of this
// file for an example. Note that if we see a kill at position K for a
// resource currently live since J, this will result in a lifetime
// given subrange of cands described by st and en (indices into our
// candidate var list), where the variables within this range have
// already been determined to be compatible with respect to type,
-// size, etc. Overlapping is done in a a greedy fashion: we select the
+// size, etc. Overlapping is done in a greedy fashion: we select the
// first element in the st->en range, then walk the rest of the
// elements adding in vars whose lifetimes don't overlap with the
// first element, then repeat the process until we run out of work.
// extract relation between its args. For example, if
// We learn v is false, and v is defined as a<b, then we learn a>=b.
if v.Type.IsBoolean() {
- // If we reach here, is is because we have a more restrictive
+ // If we reach here, it is because we have a more restrictive
// value for v than the default. The only two such values
// are constant true or constant false.
if lim.min != lim.max {
}
// collectRecv extracts the method receiver and its type parameters (if any) from rparam.
-// It declares the type parameters (but not the receiver) in the the current scope, and
+// It declares the type parameters (but not the receiver) in the current scope, and
// returns the receiver variable and its type parameter list (if any).
func (check *Checker) collectRecv(rparam *syntax.Field, scopePos syntax.Pos) (recv *Var, recvTParamsList *TypeParamList) {
// Unpack the receiver parameter which is of the form
// let any follow-on errors play out.
//
// TODO(gri) Consider recording when this happens and reporting
- // it as an error (but only if there were no other errors so to
+ // it as an error (but only if there were no other errors so
// to not have unnecessary follow-on errors).
if !ityp.complete {
return &topTypeSet
infos, infosErr := modload.ListModules(ctx, args, 0, *downloadReuse)
// There is a bit of a chicken-and-egg problem here: ideally we need to know
- // which Go version to switch to to download the requested modules, but if we
+ // which Go version to switch to download the requested modules, but if we
// haven't downloaded the module's go.mod file yet the GoVersion field of its
// info struct is not yet populated.
//
return rs, nil
}
// The root set has converged: every root going into this iteration was
- // already at its selected version, although we have have removed other
+ // already at its selected version, although we have removed other
// (redundant) roots for the same path.
break
}
// module in direct as a root.
func tidyUnprunedRoots(ctx context.Context, mainModule module.Version, old *Requirements, pkgs []*loadPkg) (*Requirements, error) {
var (
- // keep is a set of of modules that provide packages or are needed to
+ // keep is a set of modules that provide packages or are needed to
// disambiguate imports.
keep []module.Version
keptPath = map[string]bool{}
// in the extended module graph.
extendedRootPruning map[module.Version]modPruning
- // dqReason records whether and why each each encountered version is
+ // dqReason records whether and why each encountered version is
// disqualified in a pruned or unpruned context.
dqReason map[module.Version]perPruning[dqState]
// R_POWER_TLS marks an X-form instruction such as "ADD R3,R13,R4" as completing
// a sequence of GOT-relative relocations to compute a TLS address. This can be
- // used by the system linker to to rewrite the GOT-relative TLS relocation into a
+ // used by the system linker to rewrite the GOT-relative TLS relocation into a
// simpler thread-pointer relative relocation. See table 3.26 and 3.28 in the
// ppc64 elfv2 1.4 ABI on this transformation. Likewise, the second argument
// (usually called RB in X-form instructions) is assumed to be R13.
// Test is the main entrypoint that runs tests in the GOROOT/test directory.
//
-// Each .go file test case in GOROOT/test is registered as a subtest with a
+// Each .go file test case in GOROOT/test is registered as a subtest with
// a full name like "Test/fixedbugs/bug000.go" ('/'-separated relative path).
func Test(t *testing.T) {
if *target != "" {
// cleanTimeStamps resets the timestamps for the specified list of
// existing files to the Unix epoch (1970-01-01 00:00:00 +0000 UTC).
// We take this step in order to help preserve reproducible builds;
-// this seems to be primarily needed for external linking on on Darwin
+// this seems to be primarily needed for external linking on Darwin
// with later versions of xcode, which (unfortunately) seem to want to
// incorporate object file times into the final output file's build
// ID. See issue 64947 for the unpleasant details.
// Offset returns the offset for the given file position p.
//
// If p is before the file's start position (or if p is NoPos),
-// the result is 0; if p is past the file's end position, the
+// the result is 0; if p is past the file's end position,
// the result is the file size (see also go.dev/issue/57490).
//
// The following invariant, though not true for offset values
}
// collectRecv extracts the method receiver and its type parameters (if any) from rparam.
-// It declares the type parameters (but not the receiver) in the the current scope, and
+// It declares the type parameters (but not the receiver) in the current scope, and
// returns the receiver variable and its type parameter list (if any).
func (check *Checker) collectRecv(rparam *ast.Field, scopePos token.Pos) (recv *Var, recvTParamsList *TypeParamList) {
// Unpack the receiver parameter which is of the form
// let any follow-on errors play out.
//
// TODO(gri) Consider recording when this happens and reporting
- // it as an error (but only if there were no other errors so to
+ // it as an error (but only if there were no other errors so
// to not have unnecessary follow-on errors).
if !ityp.complete {
return &topTypeSet
}
}
-// loadBatch loads the next batch for pid and appends its contents to to events.
+// loadBatch loads the next batch for pid and appends its contents to events.
func (p *parser) loadBatch(pid int32, events []Event) ([]Event, error) {
offsets := p.batchOffsets[pid]
if len(offsets) == 0 {
return e.rangeStart <= ts && ts <= e.rangeEnd
}
-// OptionalEvent emits ev if it's within the time range of of the consumer, i.e.
+// OptionalEvent emits ev if it's within the time range of the consumer, i.e.
// the selected trace split range.
func (e *Emitter) OptionalEvent(ev *format.Event) {
e.c.ConsumeViewerEvent(ev, false)
{Repeat("𡋀", 64) + "𡌀", '𡌀', 256}, // test cutover
{Repeat("𡋀", 64), '𡌀', -1},
- // Test the cutover to to bytealg.IndexString when it is triggered in
+ // Test the cutover to bytealg.IndexString when it is triggered in
// the middle of rune that contains consecutive runs of equal bytes.
{"aaaaaKKKK\U000bc104", '\U000bc104', 17}, // cutover: (n + 16) / 8
{"aaaaaKKKK鄄", '鄄', 17},
// Rusage is a placeholder to allow compilation of the [os/exec] package
// because we need Go programs to be portable across platforms. WASI does
-// not have a mechanism to to spawn processes so there is no reason for an
+// not have a mechanism to spawn processes so there is no reason for an
// application to take a dependency on this type.
type Rusage struct {
Utime Timeval
// ProcAttr is a placeholder to allow compilation of the [os/exec] package
// because we need Go programs to be portable across platforms. WASI does
-// not have a mechanism to to spawn processes so there is no reason for an
+// not have a mechanism to spawn processes so there is no reason for an
// application to take a dependency on this type.
type ProcAttr struct {
Dir string