Lines Matching refs:n
395 int n=n2/2,c1,c2; in bn_mul_recursive() local
396 int tna=n+dna, tnb=n+dnb; in bn_mul_recursive()
430 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna); in bn_mul_recursive()
431 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n); in bn_mul_recursive()
436 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_recursive()
437 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_recursive()
443 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_recursive()
444 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */ in bn_mul_recursive()
453 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */ in bn_mul_recursive()
454 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_recursive()
461 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); in bn_mul_recursive()
462 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); in bn_mul_recursive()
467 if (n == 4 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba4 could take in bn_mul_recursive()
471 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
476 bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n])); in bn_mul_recursive()
478 else if (n == 8 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba8 could in bn_mul_recursive()
483 bn_mul_comba8(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
488 bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n])); in bn_mul_recursive()
495 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p); in bn_mul_recursive()
498 bn_mul_recursive(r,a,b,n,0,0,p); in bn_mul_recursive()
499 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),n,dna,dnb,p); in bn_mul_recursive()
524 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2)); in bn_mul_recursive()
527 p= &(r[n+n2]); in bn_mul_recursive()
548 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n, in bn_mul_part_recursive() argument
551 int i,j,n2=n*2; in bn_mul_part_recursive()
557 tna, n, tnb, n); in bn_mul_part_recursive()
559 if (n < 8) in bn_mul_part_recursive()
561 bn_mul_normal(r,a,n+tna,b,n+tnb); in bn_mul_part_recursive()
566 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna); in bn_mul_part_recursive()
567 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n); in bn_mul_part_recursive()
572 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_part_recursive()
573 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_part_recursive()
579 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_part_recursive()
580 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */ in bn_mul_part_recursive()
589 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */ in bn_mul_part_recursive()
590 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_part_recursive()
597 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); in bn_mul_part_recursive()
598 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); in bn_mul_part_recursive()
604 if (n == 4) in bn_mul_part_recursive()
606 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_part_recursive()
608 bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn); in bn_mul_part_recursive()
613 if (n == 8) in bn_mul_part_recursive()
615 bn_mul_comba8(&(t[n2]),t,&(t[n])); in bn_mul_part_recursive()
617 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb); in bn_mul_part_recursive()
623 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p); in bn_mul_part_recursive()
624 bn_mul_recursive(r,a,b,n,0,0,p); in bn_mul_part_recursive()
625 i=n/2; in bn_mul_part_recursive()
634 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]), in bn_mul_part_recursive()
640 bn_mul_part_recursive(&(r[n2]),&(a[n]),&(b[n]), in bn_mul_part_recursive()
651 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb); in bn_mul_part_recursive()
661 &(a[n]),&(b[n]), in bn_mul_part_recursive()
668 &(a[n]),&(b[n]), in bn_mul_part_recursive()
699 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2)); in bn_mul_part_recursive()
702 p= &(r[n+n2]); in bn_mul_part_recursive()
727 int n=n2/2; in bn_mul_low_recursive() local
733 bn_mul_recursive(r,a,b,n,0,0,&(t[0])); in bn_mul_low_recursive()
734 if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL) in bn_mul_low_recursive()
736 bn_mul_low_recursive(&(t[0]),&(a[0]),&(b[n]),n,&(t[n2])); in bn_mul_low_recursive()
737 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n); in bn_mul_low_recursive()
738 bn_mul_low_recursive(&(t[0]),&(a[n]),&(b[0]),n,&(t[n2])); in bn_mul_low_recursive()
739 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n); in bn_mul_low_recursive()
743 bn_mul_low_normal(&(t[0]),&(a[0]),&(b[n]),n); in bn_mul_low_recursive()
744 bn_mul_low_normal(&(t[n]),&(a[n]),&(b[0]),n); in bn_mul_low_recursive()
745 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n); in bn_mul_low_recursive()
746 bn_add_words(&(r[n]),&(r[n]),&(t[n]),n); in bn_mul_low_recursive()
758 int i,n; in bn_mul_high() local
766 n=n2/2; in bn_mul_high()
770 c1=bn_cmp_words(&(a[0]),&(a[n]),n); in bn_mul_high()
771 c2=bn_cmp_words(&(b[n]),&(b[0]),n); in bn_mul_high()
775 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n); in bn_mul_high()
776 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n); in bn_mul_high()
782 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n); in bn_mul_high()
783 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n); in bn_mul_high()
792 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n); in bn_mul_high()
793 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n); in bn_mul_high()
800 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n); in bn_mul_high()
801 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n); in bn_mul_high()
809 if (n == 8) in bn_mul_high()
811 bn_mul_comba8(&(t[0]),&(r[0]),&(r[n])); in bn_mul_high()
812 bn_mul_comba8(r,&(a[n]),&(b[n])); in bn_mul_high()
817 bn_mul_recursive(&(t[0]),&(r[0]),&(r[n]),n,0,0,&(t[n2])); in bn_mul_high()
818 bn_mul_recursive(r,&(a[n]),&(b[n]),n,0,0,&(t[n2])); in bn_mul_high()
829 lp= &(t[n2+n]); in bn_mul_high()
830 c1=(int)(bn_add_words(lp,&(r[0]),&(l[0]),n)); in bn_mul_high()
839 neg=(int)(bn_sub_words(&(t[n2]),lp,&(t[0]),n)); in bn_mul_high()
842 bn_add_words(&(t[n2]),lp,&(t[0]),n); in bn_mul_high()
848 bn_sub_words(&(t[n2+n]),&(l[n]),&(t[n2]),n); in bn_mul_high()
852 lp= &(t[n2+n]); in bn_mul_high()
854 for (i=0; i<n; i++) in bn_mul_high()
874 c1= (int)(bn_add_words(lp,&(t[n2+n]),&(l[0]),n)); in bn_mul_high()
878 lp= &(t[n2+n]); in bn_mul_high()
881 c1+=(int)(bn_add_words(&(t[n2]),lp, &(r[0]),n)); in bn_mul_high()
883 c1-=(int)(bn_sub_words(&(t[n2]),&(t[n2]),&(t[0]),n)); in bn_mul_high()
885 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),&(t[0]),n)); in bn_mul_high()
887 c2 =(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n2+n]),n)); in bn_mul_high()
888 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(r[n]),n)); in bn_mul_high()
890 c2-=(int)(bn_sub_words(&(r[0]),&(r[0]),&(t[n]),n)); in bn_mul_high()
892 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n]),n)); in bn_mul_high()
918 i=n; in bn_mul_high()
1144 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n) in bn_mul_low_normal() argument
1147 fprintf(stderr," bn_mul_low_normal %d * %d\n",n,n); in bn_mul_low_normal()
1149 bn_mul_words(r,a,n,b[0]); in bn_mul_low_normal()
1153 if (--n <= 0) return; in bn_mul_low_normal()
1154 bn_mul_add_words(&(r[1]),a,n,b[1]); in bn_mul_low_normal()
1155 if (--n <= 0) return; in bn_mul_low_normal()
1156 bn_mul_add_words(&(r[2]),a,n,b[2]); in bn_mul_low_normal()
1157 if (--n <= 0) return; in bn_mul_low_normal()
1158 bn_mul_add_words(&(r[3]),a,n,b[3]); in bn_mul_low_normal()
1159 if (--n <= 0) return; in bn_mul_low_normal()
1160 bn_mul_add_words(&(r[4]),a,n,b[4]); in bn_mul_low_normal()