• Home
  • Raw
  • Download

Lines Matching refs:n2

393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,  in bn_mul_recursive()  argument
396 int n=n2/2,c1,c2; in bn_mul_recursive()
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb); in bn_mul_recursive()
406 if (n2 == 4) in bn_mul_recursive()
415 if (n2 == 8 && dna == 0 && dnb == 0) in bn_mul_recursive()
422 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) in bn_mul_recursive()
424 bn_mul_normal(r,a,n2+dna,b,n2+dnb); in bn_mul_recursive()
426 memset(&r[2*n2 + dna + dnb], 0, in bn_mul_recursive()
472 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
474 memset(&(t[n2]),0,8*sizeof(BN_ULONG)); in bn_mul_recursive()
477 bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n])); in bn_mul_recursive()
484 bn_mul_comba8(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
486 memset(&(t[n2]),0,16*sizeof(BN_ULONG)); in bn_mul_recursive()
489 bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n])); in bn_mul_recursive()
494 p= &(t[n2*2]); in bn_mul_recursive()
496 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p); in bn_mul_recursive()
498 memset(&(t[n2]),0,n2*sizeof(BN_ULONG)); in bn_mul_recursive()
500 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),n,dna,dnb,p); in bn_mul_recursive()
508 c1=(int)(bn_add_words(t,r,&(r[n2]),n2)); in bn_mul_recursive()
512 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2)); in bn_mul_recursive()
517 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2)); in bn_mul_recursive()
525 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2)); in bn_mul_recursive()
528 p= &(r[n+n2]); in bn_mul_recursive()
553 int i,j,n2=n*2; in bn_mul_part_recursive() local
605 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_part_recursive()
607 bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn); in bn_mul_part_recursive()
608 memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2)); in bn_mul_part_recursive()
614 bn_mul_comba8(&(t[n2]),t,&(t[n])); in bn_mul_part_recursive()
616 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb); in bn_mul_part_recursive()
617 memset(&(r[n2+tna+tnb]),0,sizeof(BN_ULONG)*(n2-tna-tnb)); in bn_mul_part_recursive()
621 p= &(t[n2*2]); in bn_mul_part_recursive()
622 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p); in bn_mul_part_recursive()
633 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]), in bn_mul_part_recursive()
635 memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2)); in bn_mul_part_recursive()
639 bn_mul_part_recursive(&(r[n2]),&(a[n]),&(b[n]), in bn_mul_part_recursive()
641 memset(&(r[n2+tna+tnb]),0, in bn_mul_part_recursive()
642 sizeof(BN_ULONG)*(n2-tna-tnb)); in bn_mul_part_recursive()
646 memset(&(r[n2]),0,sizeof(BN_ULONG)*n2); in bn_mul_part_recursive()
650 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb); in bn_mul_part_recursive()
662 bn_mul_part_recursive(&(r[n2]), in bn_mul_part_recursive()
669 bn_mul_recursive(&(r[n2]), in bn_mul_part_recursive()
684 c1=(int)(bn_add_words(t,r,&(r[n2]),n2)); in bn_mul_part_recursive()
688 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2)); in bn_mul_part_recursive()
693 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2)); in bn_mul_part_recursive()
701 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2)); in bn_mul_part_recursive()
704 p= &(r[n+n2]); in bn_mul_part_recursive()
726 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_low_recursive() argument
729 int n=n2/2; in bn_mul_low_recursive()
732 fprintf(stderr," bn_mul_low_recursive %d * %d\n",n2,n2); in bn_mul_low_recursive()
738 bn_mul_low_recursive(&(t[0]),&(a[0]),&(b[n]),n,&(t[n2])); in bn_mul_low_recursive()
740 bn_mul_low_recursive(&(t[0]),&(a[n]),&(b[0]),n,&(t[n2])); in bn_mul_low_recursive()
757 void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, in bn_mul_high() argument
766 fprintf(stderr," bn_mul_high %d * %d\n",n2,n2); in bn_mul_high()
768 n=n2/2; in bn_mul_high()
819 bn_mul_recursive(&(t[0]),&(r[0]),&(r[n]),n,0,0,&(t[n2])); in bn_mul_high()
820 bn_mul_recursive(r,&(a[n]),&(b[n]),n,0,0,&(t[n2])); in bn_mul_high()
831 lp= &(t[n2+n]); in bn_mul_high()
841 neg=(int)(bn_sub_words(&(t[n2]),lp,&(t[0]),n)); in bn_mul_high()
844 bn_add_words(&(t[n2]),lp,&(t[0]),n); in bn_mul_high()
850 bn_sub_words(&(t[n2+n]),&(l[n]),&(t[n2]),n); in bn_mul_high()
854 lp= &(t[n2+n]); in bn_mul_high()
855 mp= &(t[n2]); in bn_mul_high()
875 lp= &(t[n2]); in bn_mul_high()
876 c1= (int)(bn_add_words(lp,&(t[n2+n]),&(l[0]),n)); in bn_mul_high()
880 lp= &(t[n2+n]); in bn_mul_high()
883 c1+=(int)(bn_add_words(&(t[n2]),lp, &(r[0]),n)); in bn_mul_high()
885 c1-=(int)(bn_sub_words(&(t[n2]),&(t[n2]),&(t[0]),n)); in bn_mul_high()
887 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),&(t[0]),n)); in bn_mul_high()
889 c2 =(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n2+n]),n)); in bn_mul_high()