corrected comments

Author: czurnieden

bn_mp_n_root_ex.c

@@ -19,8 +19,7 @@
  * This algorithm uses Newton's approximation
  * x[i+1] = x[i] - f(x[i])/f'(x[i])
  * which will find the root in log(N) time where
- * each step involves a fair bit.  This is not meant to
- * find huge roots [square and cube, etc].
+ * each step involves a fair bit.
  */
 int mp_n_root_ex(const mp_int *a, mp_digit b, mp_int *c, int fast)
 {
@@ -52,13 +51,13 @@ int mp_n_root_ex(const mp_int *a, mp_digit b, mp_int *c, int fast)
    /* Compute seed: 2^(log_2(n)/b + 2)*/
    ilog2 = mp_count_bits(a);
 
-/*
-   GCC and clang do not understand the sizeof tests and complain,
-   icc (the Intel compiler) seems to understand, at least it doesn't complain.
-   2 of 3 say these macros are necessary, so there they are.
-*/
+   /*
+      GCC and clang do not understand the sizeof tests and complain,
+      icc (the Intel compiler) seems to understand, at least it doesn't complain.
+      2 of 3 say these macros are necessary, so there they are.
+   */
 #if ( !(defined MP_8BIT) && !(defined MP_16BIT) )
-   /* 
+   /*
        The type of mp_digit might be larger than an int.
        If "b" is larger than INT_MAX it is also larger than
        log_2(n) because the bit-length of the "n" is measured
@@ -89,7 +88,7 @@ int mp_n_root_ex(const mp_int *a, mp_digit b, mp_int *c, int fast)
    }
    /* Start value must be larger than root */
    ilog2 += 2;
-   if ((  res = mp_2expt(&t2,ilog2)) != MP_OKAY) {
+   if ((res = mp_2expt(&t2,ilog2)) != MP_OKAY) {
       goto LBL_T3;
    }
    do {
@@ -129,7 +128,7 @@ int mp_n_root_ex(const mp_int *a, mp_digit b, mp_int *c, int fast)
       if ((res = mp_sub(&t1, &t3, &t2)) != MP_OKAY) {
          goto LBL_T3;
       }
-      /* 
+      /*
           Number of rounds is at most log_2(root). If it is more it
           got stuck, so break out of the loop and do the rest manually.
        */
@@ -139,7 +138,7 @@ int mp_n_root_ex(const mp_int *a, mp_digit b, mp_int *c, int fast)
    }  while (mp_cmp(&t1, &t2) != MP_EQ);
 
    /* result can be off by a few so check */
-   /* Overshoot by one if root is smaller */
+   /* Loop beneath can overshoot by one if found root is smaller than actual root */
    for (;;) {
       if ((res = mp_expt_d_ex(&t1, b, &t2, fast)) != MP_OKAY) {
          goto LBL_T3;