- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 196 for setsig (0.17 sec)
-
src/runtime/os_freebsd.go
} // See os_freebsd2.go, os_freebsd_amd64.go for setsig function //go:nosplit //go:nowritebarrierrec func setsigstack(i uint32) { var sa sigactiont sigaction(i, nil, &sa) if sa.sa_flags&_SA_ONSTACK != 0 { return } sa.sa_flags |= _SA_ONSTACK sigaction(i, &sa, nil) } //go:nosplit //go:nowritebarrierrec func getsig(i uint32) uintptr { var sa sigactiont
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 11.6K bytes - Viewed (0) -
src/runtime/os_darwin.go
sa.sa_flags = osa.sa_flags | _SA_ONSTACK sigaction(i, &sa, nil) } //go:nosplit //go:nowritebarrierrec func getsig(i uint32) uintptr { var sa usigactiont sigaction(i, nil, &sa) return *(*uintptr)(unsafe.Pointer(&sa.__sigaction_u)) } // setSignalstackSP sets the ss_sp field of a stackt. // //go:nosplit func setSignalstackSP(s *stackt, sp uintptr) { *(*uintptr)(unsafe.Pointer(&s.ss_sp)) = sp
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 11.9K bytes - Viewed (0) -
src/runtime/os3_solaris.go
return } sa.sa_flags |= _SA_ONSTACK sigaction(i, &sa, nil) } //go:nosplit //go:nowritebarrierrec func getsig(i uint32) uintptr { var sa sigactiont sigaction(i, nil, &sa) return *((*uintptr)(unsafe.Pointer(&sa._funcptr))) } // setSignalstackSP sets the ss_sp field of a stackt. // //go:nosplit func setSignalstackSP(s *stackt, sp uintptr) { *(*uintptr)(unsafe.Pointer(&s.ss_sp)) = sp
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 17.6K bytes - Viewed (0) -
src/runtime/os_linux.go
return } sa.sa_flags |= _SA_ONSTACK sigaction(i, &sa, nil) } //go:nosplit //go:nowritebarrierrec func getsig(i uint32) uintptr { var sa sigactiont sigaction(i, nil, &sa) return sa.sa_handler } // setSignalstackSP sets the ss_sp field of a stackt. // //go:nosplit func setSignalstackSP(s *stackt, sp uintptr) { *(*uintptr)(unsafe.Pointer(&s.ss_sp)) = sp }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 25.9K bytes - Viewed (0) -
test/typeparam/setsimp.go
Matthew Dempsky <******@****.***> 1646087539 -0800
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 187 bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/builtin.go
typs[141] = newSig(params(typs[60]), params(typs[20])) typs[142] = newSig(params(typs[26], typs[26]), params(typs[26])) typs[143] = newSig(nil, params(typs[5])) typs[144] = newSig(params(typs[5], typs[5]), nil) typs[145] = newSig(params(typs[5], typs[5], typs[5]), nil) typs[146] = newSig(params(typs[7], typs[1], typs[5]), nil) typs[147] = types.NewSlice(typs[7])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 21:08:03 UTC 2024 - 16.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
return CartesianSet.create(sets); } /** * Returns every possible list that can be formed by choosing one element from each of the given * sets in order; the "n-ary <a href="http://en.wikipedia.org/wiki/Cartesian_product">Cartesian * product</a>" of the sets. For example: * * <pre>{@code * Sets.cartesianProduct(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 77.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Sets.java
return CartesianSet.create(sets); } /** * Returns every possible list that can be formed by choosing one element from each of the given * sets in order; the "n-ary <a href="http://en.wikipedia.org/wiki/Cartesian_product">Cartesian * product</a>" of the sets. For example: * * <pre>{@code * Sets.cartesianProduct(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 78.8K bytes - Viewed (0) -
test/typeparam/sets.go
// The values will be in an indeterminate order. func (s _Set[Elem]) Values() []Elem { r := make([]Elem, 0, len(s.m)) for v := range s.m { r = append(r, v) } return r } // _Equal reports whether two sets contain the same elements. func _Equal[Elem comparable](s1, s2 _Set[Elem]) bool { if len(s1.m) != len(s2.m) { return false } for v1 := range s1.m { if !s2.Contains(v1) { return false } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 5.7K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat_test.go
N, _ := NewModulusFromBig(n) A := NewNat().setBig(a).ExpandFor(N) B := NewNat().setBig(b).ExpandFor(N) if A.Mul(B, N).IsZero() != 1 { t.Error("a * b mod (a * b) != 0") } i := new(big.Int).ModInverse(a, b) N, _ = NewModulusFromBig(b) A = NewNat().setBig(a).ExpandFor(N) I := NewNat().setBig(i).ExpandFor(N) one := NewNat().setBig(big.NewInt(1)).ExpandFor(N) if A.Mul(I, N).Equal(one) != 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 12 00:56:20 UTC 2024 - 11.6K bytes - Viewed (0)