Lines Matching defs:al
781 /* Calculate (al-ah)*(bh-bl) */
832 * s0 == low(al*bl)
833 * s1 == low(ah*bh)+low((al-ah)*(bh-bl))+low(al*bl)+high(al*bl)
834 * We know s0 and s1 so the only unknown is high(al*bl)
835 * high(al*bl) == s1 - low(ah*bh+s0+(al-ah)*(bh-bl))
836 * high(al*bl) == s1 - (r[0]+l[0]+t[0])
863 * s[0] = low(al*bl)
864 * t[3] = high(al*bl)
869 * R[10] = al*bl
870 * R[21] = al*bl + ah*bh + (a[0]-a[1])*(b[1]-b[0])
940 int top, al, bl;
958 al = a->top;
961 if ((al == 0) || (bl == 0)) {
965 top = al + bl;
976 i = al - bl;
981 if (al == 4) {
989 if (al == 8) {
999 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {
1006 j = BN_num_bits_word((BN_ULONG)al);
1012 assert(j <= al || j <= bl);
1017 if (al > j || bl > j) {
1023 j, al - j, bl - j, t->d);
1024 } else { /* al <= j || bl <= j */
1030 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
1038 if (bn_wexpand(tmp_bn, al) == NULL)
1047 tmp_bn->d[al] = 0;
1048 al++;
1054 j = BN_num_bits_word((BN_ULONG)al);
1058 if (al == j) { /* exact multiple */
1063 bn_mul_recursive(rr->d, a->d, b->d, al, t->d);
1069 bn_mul_part_recursive(rr->d, a->d, b->d, al - j, j, t->d);
1080 bn_mul_normal(rr->d, a->d, al, b->d, bl);