// If the number is negative, we use an inversion mask to invert the
		// data bytes and treat the value as an unsigned number.
		var inv byte // 0x00 if positive or zero, 0xff if negative
		if b[0]&0x40 != 0 {
			inv = 0xff
		}

		var x uint64
		for i, c := range b {
			c ^= inv // Inverts c only if inv is 0xff, otherwise does nothing
			if i == 0 {
				c &= 0x7f // Ignore signal bit in first byte
			}
			if (x >> 56) > 0 {

`tf.sparse_reduce_sum_sparse`: `reduction_axes` becomes `axis` *
`tf.sparse_split`: `split_dim` becomes `axis` * `tf.listdiff` has been renamed
to `tf.setdiff1d` to match NumPy naming. * `tf.inv` has been renamed to be
`tf.reciprocal` (component-wise reciprocal) to avoid confusion with `np.inv`
which is matrix inversion * tf.round now uses banker's rounding (round to even)
semantics to match NumPy. * `tf.split` now takes arguments in a reversed order

#define P8_STXVB16X(VS,RA,RB) \ VPERM VS, VS, ESPERM, TMP2; \ STXVD2X TMP2, (RA+RB) # endif #else #define P8_LXVB16X(RA,RB,VT) \ LXVD2X (RA+RB), VT #define P8_STXVB16X(VS,RA,RB) \ STXVD2X VS, (RA+RB) #endif #define MASK_PTR R8 #define MASKV V0 #define INV V1 // The following macros are used for // the stitched implementation within // counterCryptASM. // Load the initial GCM counter value // in V30 and set up the counter increment // in V31 #define SETUP_COUNTER \ P8_LXVB16X(COUNTER, R0, V30); \ VSPLTISB...

#define P8_STXVB16X(VS,RA,RB) \ VPERM VS, VS, ESPERM, TMP2; \ STXVD2X TMP2, (RA+RB) # endif #else #define P8_LXVB16X(RA,RB,VT) \ LXVD2X (RA+RB), VT #define P8_STXVB16X(VS,RA,RB) \ STXVD2X VS, (RA+RB) #endif #define MASK_PTR R8 #define MASKV V0 #define INV V1 // The following macros are used for // the stitched implementation within // counterCryptASM. // Load the initial GCM counter value // in V30 and set up the counter increment // in V31 #define SETUP_COUNTER \ P8_LXVB16X(COUNTER, R0, V30); \ VSPLTISB...