Lines Matching refs:BN_ULONG
240 # define BN_UMULT_HIGH(a,b) (BN_ULONG)asm("umulh %a0,%a1,%v0",(a),(b))
243 register BN_ULONG ret; \
252 register BN_ULONG ret; \
261 register BN_ULONG ret,discard; \
288 #define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
289 #define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
295 BN_ULONG *ftl = &(a)->d[(a)->top-1]; \
327 BN_ULONG high,low,ret,tmp=(a); \
339 BN_ULONG high,low,ret,ta=(a); \
348 BN_ULONG tmp=(a); \
354 BN_ULONG high,low,ret,tmp=(a); \
367 BN_ULONG high,low,ret,ta=(a); \
377 BN_ULONG tmp=(a); \
397 BN_ULONG m,m1,lt,ht; \
405 m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS((BN_ULONG)1); \
415 BN_ULONG l,h,m; \
431 BN_ULONG l,h; \
447 BN_ULONG l,h; \
461 void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
462 void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
463 void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
464 void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp);
465 void bn_sqr_comba8(BN_ULONG *r,const BN_ULONG *a);
466 void bn_sqr_comba4(BN_ULONG *r,const BN_ULONG *a);
467 int bn_cmp_words(const BN_ULONG *a,const BN_ULONG *b,int n);
468 int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
470 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,
471 int dna,int dnb,BN_ULONG *t);
472 void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
473 int n,int tna,int tnb,BN_ULONG *t);
474 void bn_sqr_recursive(BN_ULONG *r,const BN_ULONG *a, int n2, BN_ULONG *t);
475 void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
476 void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,
477 BN_ULONG *t);
478 void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2,
479 BN_ULONG *t);
480 BN_ULONG bn_add_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,
482 BN_ULONG bn_sub_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,