HomeSort by relevance Sort by last modified time
    Searched refs:div_n (Results 1 - 2 of 2) sorted by null

  /external/openssl/crypto/bn/
bn_div.c 186 int num_n,div_n; local
262 div_n=sdiv->top;
264 loop=num_n-div_n;
270 wnum.top = div_n;
275 /* div_n=sdiv->top; */
276 d0=sdiv->d[div_n-1];
277 d1=(div_n == 1)?0:sdiv->d[div_n-2];
289 if (!bn_wexpand(tmp,(div_n+1))) goto err;
299 bn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);
    [all...]
  /external/dropbear/libtommath/demo/
demo.c 55 unsigned long expt_n, add_n, sub_n, mul_n, div_n, sqr_n, mul2d_n, div2d_n, local
388 sub_n = mul_n = div_n = sqr_n = mul2d_n = div2d_n = cnt = add_d_n =
429 add_n, sub_n, mul_n, div_n, sqr_n, mul2d_n, div2d_n, gcd_n, lcm_n,
553 ++div_n;
565 printf("div %lu %d, %d, failure!\n", div_n, mp_cmp(&c, &e),

Completed in 1103 milliseconds