- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 154 for perfunc (0.15 sec)
-
src/cmd/compile/internal/typecheck/dcl.go
funcStack = append(funcStack, ir.CurFunc) ir.CurFunc = fn } // FinishFuncBody restores ir.CurFunc to its state before the last // call to DeclFunc. func FinishFuncBody() { funcStack, ir.CurFunc = funcStack[:len(funcStack)-1], funcStack[len(funcStack)-1] } func CheckFuncStack() { if len(funcStack) != 0 { base.Fatalf("funcStack is non-empty: %v", len(funcStack)) } } // make a new Node off the books.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 13:15:50 UTC 2023 - 3.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
// TODO(khr): assign these temps in order phase so we can reuse them across multiple maplits? tmpkey := typecheck.TempAt(base.Pos, ir.CurFunc, m.Type().Key()) tmpelem := typecheck.TempAt(base.Pos, ir.CurFunc, m.Type().Elem()) for _, r := range entries { r := r.(*ir.KeyExpr) index, elem := r.Key, r.Value ir.SetPos(index)
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/ssagen/abi.go
n := ir.NewReturnStmt(base.Pos, nil) n.Results = []ir.Node{call} tail = n } fn.Body.Append(tail) typecheck.FinishFuncBody() ir.CurFunc = fn typecheck.Stmts(fn.Body) // Restore previous context. base.Pos = savepos ir.CurFunc = savedcurfn } // CreateWasmImportWrapper creates a wrapper for imported WASM functions to // adapt them to the Go calling convention. The body for this function is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 13.8K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
nl := typecheck.TempAt(base.Pos, ir.CurFunc, n.X.Type()) nr := typecheck.TempAt(base.Pos, ir.CurFunc, n.Y.Type()) var l []ir.Node l = append(l, ir.NewAssignStmt(base.Pos, nl, n.X)) l = append(l, ir.NewAssignStmt(base.Pos, nr, n.Y)) nfrm := ir.NewUnaryExpr(base.Pos, ir.OSPTR, nr) nto := ir.NewUnaryExpr(base.Pos, ir.OSPTR, nl) nlen := typecheck.TempAt(base.Pos, ir.CurFunc, types.Types[types.TINT]) // n = len(to)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
test/fixedbugs/issue56923.go
// license that can be found in the LICENSE file. package p type Eq[T any] interface { Eqv(a T, b T) bool } type EqFunc[T any] func(a, b T) bool func (r EqFunc[T]) Eqv(a, b T) bool { return r(a, b) } func New[T any](f func(a, b T) bool) Eq[T] { return EqFunc[T](f) } func Equal(a, b []byte) bool { return string(a) == string(b) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 496 bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/value/encrypt/envelope/kmsv2/cache.go
} if transformer == nil { panic("transformer must not be nil") } c.cache.Set(c.keyFunc(key), transformer, c.ttl) // Add metrics for cache size c.recordCacheSize(c.providerName, c.cache.Len()) } // keyFunc generates a string key by hashing the inputs. // This lowers the memory requirement of the cache. func (c *simpleCache) keyFunc(s []byte) string { h := c.hashPool.Get().(hash.Hash) h.Reset()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Aug 31 20:26:58 UTC 2023 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/select.go
// generate sel-struct base.Pos = sellineno selv := typecheck.TempAt(base.Pos, ir.CurFunc, types.NewArray(scasetype(), int64(ncas))) init = append(init, typecheck.Stmt(ir.NewAssignStmt(base.Pos, selv, nil))) // No initialization for order; runtime.selectgo is responsible for that. order := typecheck.TempAt(base.Pos, ir.CurFunc, types.NewArray(types.Types[types.TUINT16], 2*int64(ncas))) var pc0, pcs ir.Node
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 01:53:41 UTC 2023 - 7.8K bytes - Viewed (0) -
src/cmd/compile/internal/walk/temp.go
// allocated temporary variable of the given type. Statements to // zero-initialize tmp are appended to init. func stackTempAddr(init *ir.Nodes, typ *types.Type) *ir.AddrExpr { n := typecheck.TempAt(base.Pos, ir.CurFunc, typ) n.SetNonMergeable(true) return initStackTemp(init, n, nil) } // stackBufAddr returns the expression &tmp, where tmp is a newly // allocated temporary variable of type [len]elem. This variable is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 1.5K bytes - Viewed (0) -
pkg/proxy/iptables/number_generated_rules_test.go
} // test the function to mutate endpoint slices epsFunc := func(eps *discovery.EndpointSlice) { for i := range eps.Endpoints { nodeName := fmt.Sprintf("node-%d", i) eps.Endpoints[i].NodeName = &nodeName } } svcs, eps := generateServiceEndpoints(test.services, test.epPerService, epsFunc, svcFunc) if len(svcs) != test.services {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/stmt.go
case ir.ODEFER: n := n.(*ir.GoDeferStmt) ir.CurFunc.SetHasDefer(true) ir.CurFunc.NumDefers++ if ir.CurFunc.NumDefers > maxOpenDefers || n.DeferAt != nil { // Don't allow open-coded defers if there are more than // 8 defers in the function, since we use a single // byte to record active defers. // Also don't allow if we need to use deferprocat. ir.CurFunc.SetOpenCodedDeferDisallowed(true) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 06 15:42:30 UTC 2023 - 4.7K bytes - Viewed (0)