Coverage Report

Created: 2025-11-13 06:07

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/dropbear/libtommath/bn_mp_sqr.c
Line
Count
Source
1
#include "tommath_private.h"
2
#ifdef BN_MP_SQR_C
3
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
4
/* SPDX-License-Identifier: Unlicense */
5
6
/* computes b = a*a */
7
mp_err mp_sqr(const mp_int *a, mp_int *b)
8
851k
{
9
851k
   mp_err err;
10
851k
   if (MP_HAS(S_MP_TOOM_SQR) && /* use Toom-Cook? */
11
0
       (a->used >= MP_TOOM_SQR_CUTOFF)) {
12
0
      err = s_mp_toom_sqr(a, b);
13
851k
   } else if (MP_HAS(S_MP_KARATSUBA_SQR) &&  /* Karatsuba? */
14
0
              (a->used >= MP_KARATSUBA_SQR_CUTOFF)) {
15
0
      err = s_mp_karatsuba_sqr(a, b);
16
851k
   } else if (MP_HAS(S_MP_SQR_FAST) && /* can we use the fast comba multiplier? */
17
851k
              (((a->used * 2) + 1) < MP_WARRAY) &&
18
851k
              (a->used < (MP_MAXFAST / 2))) {
19
851k
      err = s_mp_sqr_fast(a, b);
20
851k
   } else if (MP_HAS(S_MP_SQR)) {
21
268
      err = s_mp_sqr(a, b);
22
268
   } else {
23
0
      err = MP_VAL;
24
0
   }
25
851k
   b->sign = MP_ZPOS;
26
851k
   return err;
27
851k
}
28
#endif