Allow NSS to be built with NO_NSPR_10_SUPPORT.

nss/lib/freebl/mpi/mpmontg.c

 /* This Source Code Form is subject to the terms of the Mozilla Public
  * License, v. 2.0. If a copy of the MPL was not distributed with this
  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
 
 /* This file implements moduluar exponentiation using Montgomery's
  * method for modular reduction.  This file implements the method
  * described as "Improvement 2" in the paper "A Cryptogrpahic Library for
  * the Motorola DSP56000" by Stephen R. Dusse' and Burton S. Kaliski Jr.
  * published in "Advances in Cryptology: Proceedings of EUROCRYPT '90"
  * "Lecture Notes in Computer Science" volume 473, 1991, pg 230-244,
@@ skipping 608 matching lines @@
  * in this current code the size of mp_weave_word must be four. The code that
  * makes this assumption explicity is called out. (on some platforms a write
  * of 4 bytes still requires a single read-modify-write operation.
  *
  * This function is takes the identical parameters as the function above, 
  * however it lays out the final array differently. Where the previous function
  * treats the mpi_int as an byte array, this function treats it as an array of
  * mp_digits where each digit is stored in big endian order.
  * 
  * since we need to interleave on a byte by byte basis, we need to collect 
- * several mpi structures together into a single uint32 before we write. We
- * also need to make sure the uint32 is arranged so that the first value of 
- * the first array winds up in b[0]. This means construction of that uint32
+ * several mpi structures together into a single PRUint32 before we write. We
+ * also need to make sure the PRUint32 is arranged so that the first value of
+ * the first array winds up in b[0]. This means construction of that PRUint32
  * is endian specific (even though the layout of the mp_digits in the array 
  * is always big endian).
  *
  * The final data is stored as follows :
  *
  * Our same logical array p array, m is sizeof(mp_digit),
  * N is still count and n is now b_size. If we define p[i].digit[j]0 as the 
  * most significant byte of the word p[i].digit[j], p[i].digit[j]1 as 
  * the next most significant byte of p[i].digit[j], ...  and p[i].digit[j]m-1
  * is the least significant byte. 
@@ skipping 522 matching lines @@
 
 CLEANUP:
   mp_clear(&montBase);
   mp_clear(&goodBase);
   /* Don't mp_clear mmm.N because it is merely a copy of modulus.
   ** Just zap it.
   */
   memset(&mmm, 0, sizeof mmm);
   return res;
 }