- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for vSlots (0.43 sec)
-
src/cmd/compile/internal/ssa/debug.go
// The location of each known slot, indexed by SlotID. slots []VarLoc // The slots present in each register, indexed by register number. registers [][]SlotID } // reset fills state with the live variables from live. func (state *stateAtPC) reset(live abt.T) { slots, registers := state.slots, state.registers for i := range slots { slots[i] = VarLoc{} } for i := range registers {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K 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) -
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) -
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) -
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) -
src/cmd/compile/internal/liveness/plive.go
if n.OpenDeferSlot() { // Open-coded defer args slots must be live // everywhere in a function, since a panic can // occur (almost) anywhere. Because it is live // everywhere, it must be zeroed on entry. livedefer.Set(int32(i)) // It was already marked as Needzero when created. if !n.Needzero() { base.Fatalf("all pointer-containing defer arg slots should have Needzero set") } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
src/runtime/mfinal.go
for i := fb.cnt; i > 0; i-- { f := &fb.fin[i-1] var regs abi.RegArgs // The args may be passed in registers or on stack. Even for // the register case, we still need the spill slots. // TODO: revisit if we remove spill slots. // // Unfortunately because we can have an arbitrary // amount of returns and it would be complex to try and // figure out how many of those can get passed in registers,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 01:56:56 UTC 2024 - 19K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
// of keys to make iteration order deterministic. Names []*LocalSlot // Canonicalize root/top-level local slots, and canonicalize their pieces. // Because LocalSlot pieces refer to their parents with a pointer, this ensures that equivalent slots really are equal. CanonicalLocalSlots map[LocalSlot]*LocalSlot CanonicalLocalSplits map[LocalSlotSplitKey]*LocalSlot
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
src/sync/mutex.go
// does not own the mutex and competes with new arriving goroutines over // the ownership. New arriving goroutines have an advantage -- they are // already running on CPU and there can be lots of them, so a woken up // waiter has good chances of losing. In such case it is queued at front // of the wait queue. If a waiter fails to acquire the mutex for more than 1ms, // it switches mutex to the starvation mode. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 21:14:51 UTC 2024 - 8.4K bytes - Viewed (0)