pkg syscall (freebsd-arm64), type Msghdr struct, Pad_cgo_1 [4]uint8
pkg syscall (freebsd-arm64), type RawSockaddr struct, Data [14]int8
pkg syscall (freebsd-arm64), type RawSockaddr struct, Family uint8
pkg syscall (freebsd-arm64), type RawSockaddr struct, Len uint8
pkg syscall (freebsd-arm64), type RawSockaddrAny struct, Pad [92]int8
pkg syscall (freebsd-arm64), type RawSockaddrDatalink struct

pkg syscall (freebsd-riscv64), type Statfs_t struct, Fstypename [16]int8 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Iosize uint64 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Mntfromname [1024]int8 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Mntonname [1024]int8 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Namemax uint32 #53466

* <KNOWN LACK OF SUPPORT ON SOME PLATFORM, SHOULD GO HERE>

### Major Features and Improvements

*   <IF RELEASE CONTAINS MULTIPLE FEATURES FROM SAME AREA, GROUP THEM TOGETHER>

* `tf.lite`
    * Adds int8 and int16x8 support for SQRT operator.
    * Adds int16x8 support for EQUAL and NOT_EQUAL operators.
    * Adds support for int2 type.
    * Adds support for int2/int4 in tfl.cast .

should be 1 pos += 1 continue } if window < width/2 { carry = 0 naf[pos] = int8(window) } else { carry = 1 naf[pos] = int8(window) - int8(width) } pos += w } return naf } func (s *Scalar) signedRadix16() [64]int8 { b := s.Bytes() if b[31] > 127 { panic("scalar has high bit set illegally") } var digits [64]int8 // Compute unsigned radix-16 digits: for i := 0; i < 32; i++ { digits[2*i] = int8(b[i] & 15) digits[2*i+1] = int8((b[i] >> 4) & 15) } // Recenter coefficients: for i := 0; i < 63; i++ { carry...

should be 1 pos += 1 continue } if window < width/2 { carry = 0 naf[pos] = int8(window) } else { carry = 1 naf[pos] = int8(window) - int8(width) } pos += w } return naf } func (s *Scalar) signedRadix16() [64]int8 { b := s.Bytes() if b[31] > 127 { panic("scalar has high bit set illegally") } var digits [64]int8 // Compute unsigned radix-16 digits: for i := 0; i < 32; i++ { digits[2*i] = int8(b[i] & 15) digits[2*i+1] = int8((b[i] >> 4) & 15) } // Recenter coefficients: for i := 0; i < 63; i++ { carry...