- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for argRegs (0.12 sec)
-
src/runtime/mfinal.go
var ( frame unsafe.Pointer framecap uintptr argRegs int ) gp := getg() lock(&finlock) fing = gp unlock(&finlock) for { lock(&finlock) fb := finq finq = nil if fb == nil { gopark(finalizercommit, unsafe.Pointer(&finlock), waitReasonFinalizerWait, traceBlockSystemGoroutine, 1) continue } argRegs = intArgRegs unlock(&finlock) if raceenabled {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 01:56:56 UTC 2024 - 19K bytes - Viewed (0) -
src/syscall/js/js.go
// The arguments get mapped to JavaScript values according to the ValueOf function. func (v Value) Call(m string, args ...any) Value { argVals, argRefs := makeArgSlices(len(args)) storeArgs(args, argVals, argRefs) res, ok := valueCall(v.ref, m, argRefs) runtime.KeepAlive(v) runtime.KeepAlive(argVals) if !ok { if vType := v.Type(); !vType.isObject() { // check here to avoid overhead in success case
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 19 14:35:26 UTC 2024 - 19.5K bytes - Viewed (0) -
src/runtime/defs_linux_s390x.go
_SA_RESTORER = 0 ) type stackt struct { ss_sp *byte ss_flags int32 ss_size uintptr } type sigcontext struct { psw_mask uint64 psw_addr uint64 gregs [16]uint64 aregs [16]uint32 fpc uint32 fpregs [16]uint64 } type ucontext struct { uc_flags uint64 uc_link *ucontext uc_stack stackt uc_mcontext sigcontext uc_sigmask uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 19:05:10 UTC 2023 - 3.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/expand_calls.go
auxBase := b.NewValue2A(v.Pos, OpLocalAddr, types.NewPtr(auxType), aux.NameOfResult(i), x.sp, mem) auxOffset := int64(0) aRegs := aux.RegsOfResult(int64(j)) if a.Op == OpDereference { a.Op = OpLoad } var rc registerCursor var result *[]*Value if len(aRegs) > 0 { result = &allResults } else { if a.Op == OpLoad && a.Args[0].Op == OpLocalAddr { addr := a.Args[0]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 05:13:40 UTC 2023 - 31.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
@ElementTypesAreNonnullByDefault enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
@ElementTypesAreNonnullByDefault enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
src/syscall/js/js_test.go
{0, 1}, {2, 1}, {15, 1}, {16, 1}, // For greater than 16 arguments, we expect 3 alloction: // - makeValue: new(ref) // - makeArgSlices: argVals = make([]Value, size) // - makeArgSlices: argRefs = make([]ref, size) {17, 3}, {32, 3}, {42, 3}, } // TestCallAllocations ensures the correct allocation profile for Value.Call func TestCallAllocations(t *testing.T) { for _, test := range allocTests {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 19 14:35:26 UTC 2024 - 17.7K bytes - Viewed (0) -
src/math/big/natdiv.go
arrive at the idea of doing those exact calculations. Nowhere is it mentioned that this test extends the 2-by-1 guess into a 3-by-2 guess. The proof of the Good Guess Guarantee is only for the 2-by-1 guess and argues by contradiction, making it difficult to understand how modifications like adding another digit or adjusting the quotient range affects the overall bound.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
b.Values = b.Values[:0] idx := 0 // Clobber pointer slots in all dead variables at entry. if b == lv.f.Entry { for len(oldSched) > 0 && len(oldSched[0].Args) == 0 { // Skip argless ops. We need to skip at least // the lowered ClosurePtr op, because it // really wants to be first. This will also // skip ops like InitMem and SP, which are ok. b.Values = append(b.Values, oldSched[0])
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/cmd/compile/internal/ssa/regalloc.go
// to put it yet, so we leave it blockless for now. spill := s.f.newValueNoBlock(OpStoreReg, v.Type, v.Pos) // We also don't know what the spill's arg will be. // Leave it argless for now. s.setOrig(spill, v) vi.spill = spill vi.restoreMin = s.sdom[b.ID].entry vi.restoreMax = s.sdom[b.ID].exit return spill } // allocValToReg allocates v to a register selected from regMask and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0)