Lines Matching refs:num
17 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, in bn_mul_add_words() argument
22 assert(num >= 0); in bn_mul_add_words()
23 if (num <= 0) in bn_mul_add_words()
27 while (num & ~3) { in bn_mul_add_words()
34 num -= 4; in bn_mul_add_words()
37 while (num) { in bn_mul_add_words()
41 num--; in bn_mul_add_words()
47 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w) in bn_mul_words() argument
51 assert(num >= 0); in bn_mul_words()
52 if (num <= 0) in bn_mul_words()
56 while (num & ~3) { in bn_mul_words()
63 num -= 4; in bn_mul_words()
66 while (num) { in bn_mul_words()
70 num--; in bn_mul_words()
103 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, in bn_mul_add_words() argument
109 assert(num >= 0); in bn_mul_add_words()
110 if (num <= 0) in bn_mul_add_words()
117 while (num & ~3) { in bn_mul_add_words()
124 num -= 4; in bn_mul_add_words()
127 while (num) { in bn_mul_add_words()
131 num--; in bn_mul_add_words()
136 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w) in bn_mul_words() argument
141 assert(num >= 0); in bn_mul_words()
142 if (num <= 0) in bn_mul_words()
149 while (num & ~3) { in bn_mul_words()
156 num -= 4; in bn_mul_words()
159 while (num) { in bn_mul_words()
163 num--; in bn_mul_words()
853 const BN_ULONG *np, const BN_ULONG *n0p, int num) in bn_mul_mont() argument
865 return bn_sqr_mont(rp, ap, np, n0p, num); in bn_mul_mont()
867 vp = tp = alloca((num + 2) * sizeof(BN_ULONG)); in bn_mul_mont()
876 for (j = 0; j < num; ++j) in bn_mul_mont()
879 for (j = 0; j < num; ++j) in bn_mul_mont()
883 tp[num] = c0; in bn_mul_mont()
884 tp[num + 1] = 0; in bn_mul_mont()
887 for (i = 0; i < num; i++) { in bn_mul_mont()
893 for (j = 0; j < num; ++j) in bn_mul_mont()
896 for (j = 0; j < num; ++j) in bn_mul_mont()
899 c1 = (tp[num] + c0) & BN_MASK2; in bn_mul_mont()
900 tp[num] = c1; in bn_mul_mont()
901 tp[num + 1] = (c1 < c0 ? 1 : 0); in bn_mul_mont()
913 for (j = 1; j < num; j++) { in bn_mul_mont()
922 c1 = (tp[num] + c0) & BN_MASK2; in bn_mul_mont()
923 tp[num - 1] = c1; in bn_mul_mont()
924 tp[num] = tp[num + 1] + (c1 < c0 ? 1 : 0); in bn_mul_mont()
927 if (tp[num] != 0 || tp[num - 1] >= np[num - 1]) { in bn_mul_mont()
928 c0 = bn_sub_words(rp, tp, np, num); in bn_mul_mont()
929 if (tp[num] != 0 || c0 == 0) { in bn_mul_mont()
930 for (i = 0; i < num + 2; i++) in bn_mul_mont()
935 for (i = 0; i < num; i++) in bn_mul_mont()
937 vp[num] = 0; in bn_mul_mont()
938 vp[num + 1] = 0; in bn_mul_mont()
948 const BN_ULONG *np, const BN_ULONG *n0, int num) in bn_mul_mont() argument
994 const BN_ULONG *np, const BN_ULONG *n0p, int num) in bn_mul_mont() argument
1000 vp = tp = alloca((num + 2) * sizeof(BN_ULONG)); in bn_mul_mont()
1002 for (i = 0; i <= num; i++) in bn_mul_mont()
1005 for (i = 0; i < num; i++) { in bn_mul_mont()
1006 c0 = bn_mul_add_words(tp, ap, num, bp[i]); in bn_mul_mont()
1007 c1 = (tp[num] + c0) & BN_MASK2; in bn_mul_mont()
1008 tp[num] = c1; in bn_mul_mont()
1009 tp[num + 1] = (c1 < c0 ? 1 : 0); in bn_mul_mont()
1011 c0 = bn_mul_add_words(tp, np, num, tp[0] * n0); in bn_mul_mont()
1012 c1 = (tp[num] + c0) & BN_MASK2; in bn_mul_mont()
1013 tp[num] = c1; in bn_mul_mont()
1014 tp[num + 1] += (c1 < c0 ? 1 : 0); in bn_mul_mont()
1015 for (j = 0; j <= num; j++) in bn_mul_mont()
1019 if (tp[num] != 0 || tp[num - 1] >= np[num - 1]) { in bn_mul_mont()
1020 c0 = bn_sub_words(rp, tp, np, num); in bn_mul_mont()
1021 if (tp[num] != 0 || c0 == 0) { in bn_mul_mont()
1022 for (i = 0; i < num + 2; i++) in bn_mul_mont()
1027 for (i = 0; i < num; i++) in bn_mul_mont()
1029 vp[num] = 0; in bn_mul_mont()
1030 vp[num + 1] = 0; in bn_mul_mont()
1035 const BN_ULONG *np, const BN_ULONG *n0, int num) in bn_mul_mont() argument
