Lines Matching defs:snum
183 BIGNUM *tmp,wnum,*snum,*sdiv,*res;
226 snum=BN_CTX_get(ctx);
231 if (sdiv == NULL || res == NULL || tmp == NULL || snum == NULL)
239 if (!(BN_lshift(snum,num,norm_shift))) goto err;
240 snum->neg=0;
244 /* Since we don't know whether snum is larger than sdiv,
245 * we pad snum with enough zeroes without changing its
248 if (snum->top <= sdiv->top+1)
250 if (bn_wexpand(snum, sdiv->top + 2) == NULL) goto err;
251 for (i = snum->top; i < sdiv->top + 2; i++) snum->d[i] = 0;
252 snum->top = sdiv->top + 2;
256 if (bn_wexpand(snum, snum->top + 1) == NULL) goto err;
257 snum->d[snum->top] = 0;
258 snum->top ++;
263 num_n=snum->top;
265 /* Lets setup a 'window' into snum
269 wnum.d = &(snum->d[loop]);
272 wnum.dmax = snum->dmax - loop; /* so we don't step out of bounds */
279 /* pointer to the 'top' of snum */
280 wnump= &(snum->d[num_n-1]);
317 * snum and sdiv to calculate a BN_ULONG q such that
426 bn_correct_top(snum);
433 BN_rshift(rm,snum,norm_shift);
