- Sort Score
- Result 10 results
- Languages All
Results 11 - 16 of 16 for ODOT (0.24 sec)
-
src/cmd/compile/internal/walk/builtin.go
b := stackTempAddr(&nif.Body, reflectdata.MapBucketType(t)) // h.buckets = b bsym := hmapType.Field(5).Sym // hmap.buckets see reflect.go:hmap na := ir.NewAssignStmt(base.Pos, ir.NewSelectorExpr(base.Pos, ir.ODOT, h, bsym), typecheck.ConvNop(b, types.Types[types.TUNSAFEPTR])) nif.Body.Append(na) appendWalkStmt(init, nif) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
splitnode = func(rn ir.Node) (ir.Node, ir.Node) { r := rn.(*ir.StructKeyExpr) if r.Sym().IsBlank() || isBlank { return ir.BlankNode, r.Value } ir.SetPos(r) return ir.NewSelectorExpr(base.Pos, ir.ODOT, var_, r.Sym()), r.Value } default: base.Fatalf("fixedlit bad op: %v", n.Op()) } for _, r := range n.List { a, value := splitnode(r) if a == ir.BlankNode && !staticinit.AnySideEffects(value) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:03:54 UTC 2023 - 19.5K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/subr.go
if s == nil { return n } switch path, ambig := dotpath(s, t, nil, false); { case path != nil: // rebuild elided dots for c := len(path) - 1; c >= 0; c-- { dot := ir.NewSelectorExpr(n.Pos(), ir.ODOT, n.X, path[c].field.Sym) dot.SetImplicit(true) dot.SetType(path[c].field.Type) n.X = dot } case ambig: base.Errorf("ambiguous selector %v", n) n.X = nil } return n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 05 19:45:58 UTC 2023 - 20.2K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/entity.go
"о": "\u043e", "⊝": "\u229d", "ő": "\u0151", "⨸": "\u2a38", "⊙": "\u2299", "⦼": "\u29bc", "œ": "\u0153", "⦿": "\u29bf",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 101K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
return nil } } // canSSA reports whether n is SSA-able. // n must be an ONAME (or an ODOT sequence with an ONAME base). func (s *state) canSSA(n ir.Node) bool { if base.Flag.N != 0 { return false } for { nn := n if nn.Op() == ir.ODOT { nn := nn.(*ir.SelectorExpr) n = nn.X continue } if nn.Op() == ir.OINDEX {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
case ir.OLEN, ir.OCAP: n := n.(*ir.UnaryExpr) l := o.safeExpr(n.X) if l == n.X { return n } a := ir.Copy(n).(*ir.UnaryExpr) a.X = l return typecheck.Expr(a) case ir.ODOT: n := n.(*ir.SelectorExpr) l := o.safeExpr(n.X) if l == n.X { return n } a := ir.Copy(n).(*ir.SelectorExpr) a.X = l return typecheck.Expr(a) case ir.ODOTPTR:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0)