Lines Matching defs:ri
108 int al,nl,max,i,x,ri;
117 /* mont->ri is the size of mont->N in bits (rounded up
119 al=ri=mont->ri/BN_BITS2;
177 /* mont->ri will be a multiple of the word size and below code
178 * is kind of BN_rshift(ret,r,mont->ri) equivalent */
179 if (r->top <= ri)
185 al=r->top-ri;
189 if (bn_wexpand(ret,ri) == NULL) goto err;
190 x=0-(((al-ri)>>(sizeof(al)*8-1))&1);
191 ret->top=x=(ri&~x)|(al&x); /* min(ri,al) */
195 ap=&(r->d[ri]);
200 v=bn_sub_words(rp,ap,np,ri);
201 /* this ----------------^^ works even in al<ri case
205 /* if (al==ri && !v) || al>ri) nrp=rp; else nrp=ap; */
209 m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1); /* al<ri */
210 m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1); /* al>ri */
211 m1|=m2; /* (al!=ri) */
212 m1|=(0-(size_t)v); /* (al!=ri || v) */
213 m1&=~m2; /* (al!=ri || v) && !al>ri */
217 /* 'i<ri' is chosen to eliminate dependency on input data, even
218 * though it results in redundant copy in al<ri case. */
219 for (i=0,ri-=4; i<ri; i+=4)
232 for (ri+=4; i<ri; i++)
240 ap=&(r->d[ri]);
268 BN_mask_bits(t1,mont->ri);
271 BN_mask_bits(t2,mont->ri);
275 if (!BN_rshift(ret,t2,mont->ri)) goto err;
305 ctx->ri=0;
340 mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
369 mont->ri=BN_num_bits(&mont->N);
371 if (!BN_set_bit(R,mont->ri)) goto err; /* R = 2^ri */
375 if (!BN_lshift(Ri,Ri,mont->ri)) goto err; /* R*Ri */
384 if (!BN_set_bit(&(mont->RR),mont->ri*2)) goto err;
400 to->ri=from->ri;