- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for CalcSize (0.21 sec)
-
src/cmd/compile/internal/types/size.go
} // CalcSize calculates and stores the size, alignment, eq/hash algorithm, // and ptrBytes for t. // If CalcSizeDisabled is set, and the size/alignment // have not already been calculated, it calls Fatal. // This is used to prevent data races in the back end. func CalcSize(t *Type) { // Calling CalcSize when typecheck tracing enabled is not safe. // See issue #33658.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 15K bytes - Viewed (0) -
src/cmd/compile/internal/types/alg.go
base.Fatalf("ambiguous priority %s and %s", a, t.alg) } } // AlgType returns the AlgKind used for comparing and hashing Type t. func AlgType(t *Type) AlgKind { CalcSize(t) return t.alg } // TypeHasNoAlg reports whether t does not have any associated hash/eq // algorithms because t, or some component of t, is marked Noalg. func TypeHasNoAlg(t *Type) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 15:30:00 UTC 2024 - 2.4K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/expr.go
base.Errorf("invalid operation: %v (operator %v not defined on %s)", n, op, typekind(l.Type())) return l, r, nil } types.CalcSize(l.Type()) if r.Type().IsInterface() == l.Type().IsInterface() || l.Type().Size() >= 1<<16 { l = ir.NewConvExpr(base.Pos, aop, r.Type(), l) l.SetTypecheck(1) } t = r.Type() converted = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 23.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/walk.go
if base.Flag.W != 0 { s := fmt.Sprintf("after walk %v", ir.CurFunc.Sym()) ir.DumpList(s, ir.CurFunc.Body) } // Eagerly compute sizes of all variables for SSA. for _, n := range fn.Dcl { types.CalcSize(n.Type()) } } // walkRecv walks an ORECV node. func walkRecv(n *ir.UnaryExpr) ir.Node { if n.Typecheck() == 0 { base.Fatalf("missing typecheck: %+v", n) } init := ir.TakeInit(n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 20:56:00 UTC 2024 - 10.4K bytes - Viewed (0) -
src/regexp/syntax/parse.go
case OpCapture, OpStar: // star can be 1+ or 2+; assume 2 pessimistically size = 2 + p.calcSize(re.Sub[0], false) case OpPlus, OpQuest: size = 1 + p.calcSize(re.Sub[0], false) case OpConcat: for _, sub := range re.Sub { size += p.calcSize(sub, false) } case OpAlternate: for _, sub := range re.Sub { size += p.calcSize(sub, false) } if len(re.Sub) > 1 { size += int64(len(re.Sub)) - 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 13:59:01 UTC 2024 - 52.1K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
} func (t *Type) Size() int64 { if t.kind == TSSA { if t == TypeInt128 { return 16 } return 0 } CalcSize(t) return t.width } func (t *Type) Alignment() int64 { CalcSize(t) return int64(t.align) } func (t *Type) SimpleString() string { return t.kind.String() } // Cmp is a comparison between values a and b.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
continue } if mls != nil && mls.Subsumed(n) { continue } if !n.Used() { fn.DebugInfo.(*ssa.FuncDebug).OptDcl = fn.Dcl[i:] fn.Dcl = fn.Dcl[:i] break } types.CalcSize(n.Type()) w := n.Type().Size() if w >= types.MaxWidth || w < 0 { base.Fatalf("bad width") } if w == 0 && lastHasPtr { // Pad between a pointer-containing object and a zero-sized object.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/typecheck.go
// exactly. If dostrcmp is 2, it matches names with case folding. func Lookdot(n *ir.SelectorExpr, t *types.Type, dostrcmp int) *types.Field { s := n.Sel types.CalcSize(t) var f1 *types.Field if t.IsStruct() { f1 = Lookdot1(n, s, t, t.Fields(), dostrcmp) } else if t.IsInterface() { f1 = Lookdot1(n, s, t, t.AllMethods(), dostrcmp) } var f2 *types.Field
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 19:08:34 UTC 2024 - 30.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/value.go
nameOff := v.Aux.(*AuxNameOffset) return nameOff.Name, nameOff.Offset } // CanSSA reports whether values of type t can be represented as a Value. func CanSSA(t *types.Type) bool { types.CalcSize(t) if t.Size() > int64(4*types.PtrSize) { // 4*Widthptr is an arbitrary constant. We want it // to be at least 3*Widthptr so slices can be registerized. // Too big and we'll introduce too much register pressure.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:40:22 UTC 2024 - 16.7K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
} if n.Esc() == ir.EscNone { if t.Size() > ir.MaxImplicitStackVarSize { base.Fatalf("large ONEW with EscNone: %v", n) } return stackTempAddr(init, t) } types.CalcSize(t) n.MarkNonNil() return n } func walkMinMax(n *ir.CallExpr, init *ir.Nodes) ir.Node { init.Append(ir.TakeInit(n)...) walkExprList(n.Args, init) return n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0)