Lines Matching defs:al
581 int top, al, bl;
587 al = a->top;
590 if ((al == 0) || (bl == 0)) {
594 top = al + bl;
606 i = al - bl;
608 if (al == 8) {
618 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {
623 j = BN_num_bits_word((BN_ULONG)al);
629 assert(j <= al || j <= bl);
635 if (al > j || bl > j) {
642 bn_mul_part_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
644 /* al <= j || bl <= j */
651 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
662 bn_mul_normal(rr->d, a->d, al, b->d, bl);
817 int max, al;
821 al = a->top;
822 if (al <= 0) {
835 max = 2 * al; /* Non-zero (from above) */
840 if (al == 4) {
842 } else if (al == 8) {
845 if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {
847 bn_sqr_normal(rr->d, a->d, al, t);
851 j = BN_num_bits_word((BN_ULONG)al);
854 if (al == j) {
858 bn_sqr_recursive(rr->d, a->d, al, tmp->d);
863 bn_sqr_normal(rr->d, a->d, al, tmp->d);
871 if (a->d[al - 1] == (a->d[al - 1] & BN_MASK2l)) {