- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for Book (0.02 sec)
-
src/cmd/compile/internal/staticinit/sched.go
// returns nil. // // Currently, it outlines map assignment statements with large, // side-effect-free RHS expressions. func tryWrapGlobalInit(n ir.Node) *ir.Func { // Look for "X = ..." where X has map type. // FIXME: might also be worth trying to look for cases where // the LHS is of interface type but RHS is map type. if n.Op() != ir.OAS { return nil } as := n.(*ir.AssignStmt)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 17:16:14 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/covdata/metamerge.go
v, haveCounters := mm.pod.pmm[key] if haveCounters { counters = v.Counters } if pcombine { // If the merge is running in "combine programs" mode, then hash // the function and look it up in the package ftab to see if we've // encountered it before. If we haven't, then register it with the // meta-data builder. fnhash := encodemeta.HashFuncDesc(fd) gfidx, ok := mm.p.ftab[fnhash] if !ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 12 17:17:47 UTC 2024 - 12.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/infer.go
// untyped argument will never match a composite parameter type; the // only parameter type it can possibly match against is a *TypeParam. // Thus, for untyped arguments we only need to look at parameter types // that are single type parameters. // Also, untyped nils don't have a default type and can be ignored. // Finally, it's not possible to have an alias type denoting a type
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 13:54:20 UTC 2024 - 26.4K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/stmt.go
// as its definition, in which case it will call tcAssign. // in that case, do not call typecheck back, or it will cycle. // if the variable has a type (ntype) then typechecking // will not look at defn, so it is okay (and desirable, // so that the conversion below happens). checkLHS := func(i int, typ *types.Type) { if n := lhs[i]; typ != nil && ir.DeclaredBy(n, stmt) && n.Type() == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 15:10:54 UTC 2023 - 17.8K bytes - Viewed (0) -
src/cmd/compile/internal/inline/inlheur/scoring.go
// the CanInline call. This function returns the amount to relax the // budget initially (to allow for a large score adjustment); later on // in RevisitInlinability we'll look at each individual function to // demote it if needed. func BudgetExpansion(maxBudget int32) int32 { if base.Debug.InlBudgetSlack != 0 { return int32(base.Debug.InlBudgetSlack) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:42:52 UTC 2024 - 24.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
// If the source of a MoveWB is volatile (will be clobbered by a // function call), we need to copy it to a temporary location, as // marshaling the args of wbMove might clobber the value we're // trying to move. // Look for volatile source, copy it to temporary before we check // the write barrier flag. // It is unlikely to have more than one of them. Just do a linear // search instead of using a map. // See issue 15854.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/lookup.go
// search current depth for len(current) > 0 { var next []embeddedType // embedded types found at current depth // look for (pkg, name) in all types at current depth for _, e := range current { typ := e.typ // If we have a named type, we may have associated methods. // Look for those first. if named := asNamed(typ); named != nil { if alt := seen.lookup(named); alt != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 19.8K bytes - Viewed (0) -
src/cmd/cover/cover.go
hookWrite = func(cv string, which int, val string) string { return fmt.Sprintf("%sStoreUint32(&%s[%d], %s)", atomicPackagePrefix(), cv, which, val) } } // Generate the registration hook sequence for the function. This // sequence looks like // // counterVar[0] = <num_units> // counterVar[1] = pkgId // counterVar[2] = fnId // cv := f.fn.counterVar
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/predicates.go
func isValid(t Type) bool { return Unalias(t) != Typ[Invalid] } // The isX predicates below report whether t is an X. // If t is a type parameter the result is false; i.e., // these predicates don't look inside a type parameter. func isBoolean(t Type) bool { return isBasic(t, IsBoolean) } func isInteger(t Type) bool { return isBasic(t, IsInteger) } func isUnsigned(t Type) bool { return isBasic(t, IsUnsigned) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
for _, v := range b.Values { if n, ok := v.Aux.(*ir.Name); ok { switch n.Class { case ir.PPARAMOUT: if n.IsOutputParamInRegisters() && v.Op == ssa.OpVarDef { // ignore VarDef, look for "real" uses. // TODO: maybe do this for PAUTO as well? continue } fallthrough case ir.PPARAM, ir.PAUTO: n.SetUsed(true) } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0)