Lines Matching defs:al
584 int top, al, bl;
590 al = a->top;
593 if ((al == 0) || (bl == 0)) {
597 top = al + bl;
609 i = al - bl;
611 if (al == 8) {
621 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {
626 j = BN_num_bits_word((BN_ULONG)al);
632 assert(j <= al || j <= bl);
638 if (al > j || bl > j) {
645 bn_mul_part_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
647 /* al <= j || bl <= j */
654 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
665 bn_mul_normal(rr->d, a->d, al, b->d, bl);
820 int max, al;
824 al = a->top;
825 if (al <= 0) {
838 max = 2 * al; /* Non-zero (from above) */
843 if (al == 4) {
845 } else if (al == 8) {
848 if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {
850 bn_sqr_normal(rr->d, a->d, al, t);
854 j = BN_num_bits_word((BN_ULONG)al);
857 if (al == j) {
861 bn_sqr_recursive(rr->d, a->d, al, tmp->d);
866 bn_sqr_normal(rr->d, a->d, al, tmp->d);
874 if (a->d[al - 1] == (a->d[al - 1] & BN_MASK2l)) {
