- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for slicelen (0.32 sec)
-
src/cmd/compile/internal/ssa/_gen/dec.rules
(Store dst (StringMake ptr len) mem) => (Store {typ.Int} (OffPtr <typ.IntPtr> [config.PtrSize] dst) len (Store {typ.BytePtr} dst ptr mem)) // slice ops (SlicePtr (SliceMake ptr _ _ )) => ptr (SliceLen (SliceMake _ len _)) => len (SliceCap (SliceMake _ _ cap)) => cap (SlicePtrUnchecked (SliceMake ptr _ _ )) => ptr (Load <t> ptr mem) && t.IsSlice() => (SliceMake (Load <t.Elem().PtrTo()> ptr mem)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 00:48:31 UTC 2023 - 6.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/generic.rules
// a more comprehensive set. (SliceLen (SliceMake _ (Const64 <t> [c]) _)) => (Const64 <t> [c]) (SliceCap (SliceMake _ _ (Const64 <t> [c]))) => (Const64 <t> [c]) (SliceLen (SliceMake _ (Const32 <t> [c]) _)) => (Const32 <t> [c]) (SliceCap (SliceMake _ _ (Const32 <t> [c]))) => (Const32 <t> [c]) (SlicePtr (SliceMake (SlicePtr x) _ _)) => (SlicePtr x) (SliceLen (SliceMake _ (SliceLen x) _)) => (SliceLen x)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 22:21:05 UTC 2024 - 135.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewritedec.go
v_0 := v.Args[0] b := v.Block config := b.Func.Config typ := &b.Func.Config.Types // match: (SliceLen (SliceMake _ len _)) // result: len for { if v_0.Op != OpSliceMake { break } len := v_0.Args[1] v.copyOf(len) return true } // match: (SliceLen x:(Load <t> ptr mem)) // cond: t.IsSlice() // result: @x.Block (Load <typ.Int> (OffPtr <typ.IntPtr> [config.PtrSize] ptr) mem)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 00:48:31 UTC 2023 - 24.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
// Slices {name: "SliceMake", argLength: 3}, // arg0=ptr, arg1=len, arg2=cap {name: "SlicePtr", argLength: 1, typ: "BytePtr"}, // ptr(arg0) {name: "SliceLen", argLength: 1}, // len(arg0) {name: "SliceCap", argLength: 1}, // cap(arg0) // SlicePtrUnchecked, like SlicePtr, extracts the pointer from a slice.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewritegeneric.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 18:24:47 UTC 2024 - 812.2K bytes - Viewed (0) -
src/runtime/mspanset.go
// Do we need to add a block? spineLen := b.spineLen.Load() var block *spanSetBlock retry: if top < spineLen { block = b.spine.Load().lookup(top).Load() } else { // Add a new block to the spine, potentially growing // the spine. lock(&b.spineLock) // spineLen cannot change until we release the lock, // but may have changed while we were waiting. spineLen = b.spineLen.Load() if top < spineLen {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
pkg/proxy/endpointslicecache.go
func (cache *EndpointSliceCache) esDataChanged(serviceKey types.NamespacedName, sliceKey string, esData *endpointSliceData) bool { if _, ok := cache.trackerByServiceMap[serviceKey]; ok { appliedData, appliedOk := cache.trackerByServiceMap[serviceKey].applied[sliceKey] pendingData, pendingOk := cache.trackerByServiceMap[serviceKey].pending[sliceKey] // If there's already a pending value, return whether or not this would
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 29 21:07:21 UTC 2024 - 11.7K bytes - Viewed (1) -
src/cmd/compile/internal/walk/complit.go
case ir.OSLICELIT: value := value.(*ir.CompLitExpr) if (kind == initKindStatic && ctxt == inNonInitFunction) || (kind == initKindDynamic && ctxt == inInitFunction) { var sinit ir.Nodes slicelit(ctxt, value, a, &sinit) if kind == initKindStatic { // When doing static initialization, init statements may contain dynamic // expression, which will be initialized later, causing liveness analysis
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/ssa/prove.go
// beginning of prove where we look for all len/cap ops. if v.Op == OpSliceLen && r< == 0 && ft.caps[v.Args[0].ID] != nil { // len(s) > w implies cap(s) > w // len(s) >= w implies cap(s) >= w // len(s) == w implies cap(s) >= w ft.update(parent, ft.caps[v.Args[0].ID], w, d, r|gt) } if w.Op == OpSliceLen && r> == 0 && ft.caps[w.Args[0].ID] != nil { // same, length on the RHS.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
pkg/proxy/endpointslicecache_test.go
tc.cache.checkoutChanges() } serviceKey, sliceKey, err := endpointSliceCacheKeys(tc.updatedSlice) if err != nil { t.Fatalf("Expected no error calling endpointSliceCacheKeys(): %v", err) } esData := &endpointSliceData{tc.updatedSlice, false} changed := tc.cache.esDataChanged(serviceKey, sliceKey, esData) if tc.expectChanged != changed {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 29 21:07:21 UTC 2024 - 24.9K bytes - Viewed (0)