- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 371 for slots (0.04 sec)
-
src/cmd/compile/internal/ssa/debug.go
// Recompose any decomposed variables, and establish the canonical // IDs for each var and slot by filling out state.vars and state.slots. state.slots = state.slots[:0] state.vars = state.vars[:0] for i, slot := range f.Names { state.slots = append(state.slots, *slot) if ir.IsSynthetic(slot.N) { continue } topSlot := slot for topSlot.SplitOf != nil { topSlot = topSlot.SplitOf }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
slots := f.Cache.allocIntSlice(f.NumValues()) defer f.Cache.freeIntSlice(slots) for i := range slots { slots[i] = -1 } // Pick a stack slot for each value needing one. used := f.Cache.allocBoolSlice(f.NumValues()) defer f.Cache.freeBoolSlice(used) for _, b := range f.Blocks { for _, v := range b.Values { if !s.values[v.ID].needSlot { s.nNotNeed++ continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/decompose.go
for i := 0; i < n; i++ { if name.Type.FieldType(i).IsStruct() { slots = decomposeUserStructInto(f, fnames[i], slots) delete(f.NamedValues, *fnames[i]) } else if name.Type.FieldType(i).IsArray() { slots = decomposeUserArrayInto(f, fnames[i], slots) delete(f.NamedValues, *fnames[i]) } } return slots } func decomposeUserPhi(v *Value) { switch { case v.Type.IsStruct():
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 23 21:22:15 UTC 2022 - 13.4K bytes - Viewed (0) -
src/runtime/testdata/testwintls/main.c
#include <windows.h> int main(int argc, char **argv) { if (argc < 3) { return 1; } // Allocate more than 64 TLS indices // so the Go runtime doesn't find // enough space in the TEB TLS slots. for (int i = 0; i < 65; i++) { TlsAlloc(); } HMODULE hlib = LoadLibrary(argv[1]); if (hlib == NULL) { return 2; } FARPROC proc = GetProcAddress(hlib, argv[2]);
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 25 15:37:00 UTC 2023 - 692 bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
src/sync/poolqueue.go
// reading the value to take back ownership of this // slot. head-- ptrs2 := d.pack(head, tail) if d.headTail.CompareAndSwap(ptrs, ptrs2) { // We successfully took back slot. slot = &d.vals[head&uint32(len(d.vals)-1)] break } } val := *(*any)(unsafe.Pointer(slot)) if val == dequeueNil(nil) { val = nil } // Zero the slot. Unlike popTail, this isn't racing with
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 18:12:29 UTC 2024 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
doc/next/5-toolchain.md
In Go 1.23, overhead should be in the single digit percentages. <!-- https://go.dev/issue/62737 , https://golang.org/cl/576681, https://golang.org/cl/577615 --> The compiler in Go 1.23 can now overlap the stack frame slots of local variables accessed in disjoint regions of a function, which reduces stack usage for Go applications. <!-- https://go.dev/cl/577935 --> For 386 and amd64, the compiler will use information from PGO to align certain
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 17:18:10 UTC 2024 - 1.8K bytes - Viewed (0)