--- pgp/rsaref/source/digit.c	2018/04/24 16:40:41	1.1.1.1
+++ pgp/rsaref/source/digit.c	2018/04/24 16:41:40	1.1.1.2
@@ -1,107 +1,108 @@
-/* DIGIT.C - digit arithmetic routines
- */
-
-/* Copyright (C) RSA Laboratories, a division of RSA Data Security,
-      Inc., created 1991. All rights reserved.
- */
-
-#include "global.h"
-#include "rsaref.h"
-#include "nn.h"
-#include "digit.h"
-
-/* Computes a = b * c, where b and c are digits.
-
-   Lengths: a[2].
- */
-void NN_DigitMult (a, b, c)
-NN_DIGIT a[2], b, c;
-{
-  NN_DIGIT t, u;
-  NN_HALF_DIGIT bHigh, bLow, cHigh, cLow;
-
-  bHigh = (NN_HALF_DIGIT)HIGH_HALF (b);
-  bLow = (NN_HALF_DIGIT)LOW_HALF (b);
-  cHigh = (NN_HALF_DIGIT)HIGH_HALF (c);
-  cLow = (NN_HALF_DIGIT)LOW_HALF (c);
-
-  a[0] = (NN_DIGIT)bLow * (NN_DIGIT)cLow;
-  t = (NN_DIGIT)bLow * (NN_DIGIT)cHigh;
-  u = (NN_DIGIT)bHigh * (NN_DIGIT)cLow;
-  a[1] = (NN_DIGIT)bHigh * (NN_DIGIT)cHigh;
-  
-  if ((t += u) < u)
-    a[1] += TO_HIGH_HALF (1);
-  u = TO_HIGH_HALF (t);
-  
-  if ((a[0] += u) < u)
-    a[1]++;
-  a[1] += HIGH_HALF (t);
-}
-
-/* Sets a = b / c, where a and c are digits.
-
-   Lengths: b[2].
-   Assumes b[1] < c and HIGH_HALF (c) > 0. For efficiency, c should be
-   normalized.
- */
-void NN_DigitDiv (a, b, c)
-NN_DIGIT *a, b[2], c;
-{
-  NN_DIGIT t[2], u, v;
-  NN_HALF_DIGIT aHigh, aLow, cHigh, cLow;
-
-  cHigh = (NN_HALF_DIGIT)HIGH_HALF (c);
-  cLow = (NN_HALF_DIGIT)LOW_HALF (c);
-
-  t[0] = b[0];
-  t[1] = b[1];
-
-  /* Underestimate high half of quotient and subtract.
-   */
-  if (cHigh == MAX_NN_HALF_DIGIT)
-    aHigh = (NN_HALF_DIGIT)HIGH_HALF (t[1]);
-  else
-    aHigh = (NN_HALF_DIGIT)(t[1] / (cHigh + 1));
-  u = (NN_DIGIT)aHigh * (NN_DIGIT)cLow;
-  v = (NN_DIGIT)aHigh * (NN_DIGIT)cHigh;
-  if ((t[0] -= TO_HIGH_HALF (u)) > (MAX_NN_DIGIT - TO_HIGH_HALF (u)))
-    t[1]--;
-  t[1] -= HIGH_HALF (u);
-  t[1] -= v;
-
-  /* Correct estimate.
-   */
-  while ((t[1] > cHigh) ||
-         ((t[1] == cHigh) && (t[0] >= TO_HIGH_HALF (cLow)))) {
-    if ((t[0] -= TO_HIGH_HALF (cLow)) > MAX_NN_DIGIT - TO_HIGH_HALF (cLow))
-      t[1]--;
-    t[1] -= cHigh;
-    aHigh++;
-  }
-
-  /* Underestimate low half of quotient and subtract.
-   */
-  if (cHigh == MAX_NN_HALF_DIGIT)
-    aLow = (NN_HALF_DIGIT)LOW_HALF (t[1]);
-  else
-    aLow = 
-      (NN_HALF_DIGIT)((TO_HIGH_HALF (t[1]) + HIGH_HALF (t[0])) / (cHigh + 1));
-  u = (NN_DIGIT)aLow * (NN_DIGIT)cLow;
-  v = (NN_DIGIT)aLow * (NN_DIGIT)cHigh;
-  if ((t[0] -= u) > (MAX_NN_DIGIT - u))
-    t[1]--;
-  if ((t[0] -= TO_HIGH_HALF (v)) > (MAX_NN_DIGIT - TO_HIGH_HALF (v)))
-    t[1]--;
-  t[1] -= HIGH_HALF (v);
-
-  /* Correct estimate.
-   */
-  while ((t[1] > 0) || ((t[1] == 0) && t[0] >= c)) {
-    if ((t[0] -= c) > (MAX_NN_DIGIT - c))
-      t[1]--;
-    aLow++;
-  }
-  
-  *a = TO_HIGH_HALF (aHigh) + aLow;
-}
+/* DIGIT.C - digit arithmetic routines
+ */
+
+/* Copyright (C) 1991-2 RSA Laboratories, a division of RSA Data
+   Security, Inc. All rights reserved.
+ */
+
+#include "global.h"
+#include "rsaref.h"
+#include "nn.h"
+#include "digit.h"
+
+/* Computes a = b * c, where b and c are digits.
+
+   Lengths: a[2].
+ */
+void NN_DigitMult (a, b, c)
+NN_DIGIT a[2], b, c;
+{
+  NN_DIGIT t, u;
+  NN_HALF_DIGIT bHigh, bLow, cHigh, cLow;
+
+  bHigh = HIGH_HALF (b);
+  bLow = LOW_HALF (b);
+  cHigh = HIGH_HALF (c);
+  cLow = LOW_HALF (c);
+
+  a[0] = (NN_DIGIT)bLow * (NN_DIGIT)cLow;
+  t = (NN_DIGIT)bLow * (NN_DIGIT)cHigh;
+  u = (NN_DIGIT)bHigh * (NN_DIGIT)cLow;
+  a[1] = (NN_DIGIT)bHigh * (NN_DIGIT)cHigh;
+  
+  if ((t += u) < u)
+    a[1] += TO_HIGH_HALF (1);
+  u = TO_HIGH_HALF (t);
+  
+  if ((a[0] += u) < u)
+    a[1]++;
+  a[1] += HIGH_HALF (t);
+}
+
+/* Sets a = b / c, where a and c are digits.
+
+   Lengths: b[2].
+   Assumes b[1] < c and HIGH_HALF (c) > 0. For efficiency, c should be
+   normalized.
+ */
+void NN_DigitDiv (a, b, c)
+NN_DIGIT *a, b[2], c;
+{
+  NN_DIGIT t[2], u, v;
+  NN_HALF_DIGIT aHigh, aLow, cHigh, cLow;
+
+  cHigh = HIGH_HALF (c);
+  cLow = LOW_HALF (c);
+
+  t[0] = b[0];
+  t[1] = b[1];
+
+  /* Underestimate high half of quotient and subtract.
+   */
+  if (cHigh == MAX_NN_HALF_DIGIT)
+    aHigh = HIGH_HALF (t[1]);
+  else
+    aHigh = (NN_HALF_DIGIT)(t[1] / (cHigh + 1));
+  u = (NN_DIGIT)aHigh * (NN_DIGIT)cLow;
+  v = (NN_DIGIT)aHigh * (NN_DIGIT)cHigh;
+  if ((t[0] -= TO_HIGH_HALF (u)) > (MAX_NN_DIGIT - TO_HIGH_HALF (u)))
+    t[1]--;
+  t[1] -= HIGH_HALF (u);
+  t[1] -= v;
+
+  /* Correct estimate.
+   */
+  while ((t[1] > cHigh) ||
+         ((t[1] == cHigh) && (t[0] >= TO_HIGH_HALF (cLow)))) {
+    if ((t[0] -= TO_HIGH_HALF (cLow)) > MAX_NN_DIGIT - TO_HIGH_HALF (cLow))
+      t[1]--;
+    t[1] -= cHigh;
+    aHigh++;
+  }
+
+  /* Underestimate low half of quotient and subtract.
+   */
+  if (cHigh == MAX_NN_HALF_DIGIT)
+    aLow = LOW_HALF (t[1]);
+  else
+    aLow =
+      (NN_HALF_DIGIT)
+        ((NN_DIGIT)(TO_HIGH_HALF (t[1]) + HIGH_HALF (t[0])) / (cHigh + 1));
+  u = (NN_DIGIT)aLow * (NN_DIGIT)cLow;
+  v = (NN_DIGIT)aLow * (NN_DIGIT)cHigh;
+  if ((t[0] -= u) > (MAX_NN_DIGIT - u))
+    t[1]--;
+  if ((t[0] -= TO_HIGH_HALF (v)) > (MAX_NN_DIGIT - TO_HIGH_HALF (v)))
+    t[1]--;
+  t[1] -= HIGH_HALF (v);
+
+  /* Correct estimate.
+   */
+  while ((t[1] > 0) || ((t[1] == 0) && t[0] >= c)) {
+    if ((t[0] -= c) > (MAX_NN_DIGIT - c))
+      t[1]--;
+    aLow++;
+  }
+  
+  *a = TO_HIGH_HALF (aHigh) + aLow;
+}