pkg runtime (freebsd-riscv64-cgo), const GOOS = "freebsd" #53466
pkg runtime/cgo (freebsd-riscv64-cgo), func NewHandle(interface{}) Handle #53466
pkg runtime/cgo (freebsd-riscv64-cgo), method (Handle) Delete() #53466
pkg runtime/cgo (freebsd-riscv64-cgo), method (Handle) Value() interface{} #53466
pkg runtime/cgo (freebsd-riscv64-cgo), type Handle uintptr #53466
pkg runtime/cgo (freebsd-riscv64-cgo), type Incomplete struct #53466

Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....

Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....

pkg syscall (windows-386), func LoadSetFileCompletionNotificationModes() error
pkg syscall (windows-386), func NetGetJoinInformation(*uint16, **uint16, *uint32) error
pkg syscall (windows-386), func SetFileCompletionNotificationModes(Handle, uint8) error
pkg syscall (windows-386), func WSAEnumProtocols(*int32, *WSAProtocolInfo, *uint32) (int32, error)
pkg syscall (windows-386), type IpMaskString struct, String [16]uint8