![]()
#define biL (ciL << 3) ![]()
#define biH (ciL << 2) ![]()
memcpy( p, X->p, X->n * ciL );![]()
memcpy( p, X->p, i * ciL );![]()
memset( X->p + i, 0, ( X->n - i ) * ciL );![]()
memcpy( X->p, Y->p, i * ciL );![]()
memset( X->p, 0, X->n * ciL );![]()
( ( ( X )->p[( i ) / ciL] >> ( ( ( i ) % ciL ) * 8 ) ) & 0xff )![]()
X->p[j / ( 2 * ciL )] |= d << ( ( j % ( 2 * ciL ) ) << 2 );![]()
for( j = ciL; j > 0; j-- )![]()
for( i = 0; i < ciL; i++, x >>= 8 )![]()
tmp |= ( x & 0xFF ) << ( ( ciL - 1 - i ) << 3 );![]()
size_t const overhead = ( limbs * ciL ) - buflen;![]()
stored_bytes = X->n * ciL;![]()
memset( T->p, 0, T->n * ciL );![]()
memcpy( A->p, d, ( n + 1 ) * ciL );![]()
size_t const overhead = ( limbs * ciL ) - size;