Update NSPR to 4.12 and NSS to 3.23 on iOS

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 353 matching lines @@
   MP_DIGITS(&power2) = 0;
   for (i = 0; i < MAX_ODD_INTS; ++i) {
     MP_DIGITS(oddPowers + i) = 0;
   }
 
   MP_CHECKOK( mp_init_size(&accum1, 3 * nLen + 2) );
   MP_CHECKOK( mp_init_size(&accum2, 3 * nLen + 2) );
 
   MP_CHECKOK( mp_init_copy(&oddPowers[0], montBase) );
 
-  mp_init_size(&power2, nLen + 2 * MP_USED(montBase) + 2);
+  MP_CHECKOK( mp_init_size(&power2, nLen + 2 * MP_USED(montBase) + 2) );
   MP_CHECKOK( mp_sqr(montBase, &power2) );      /* power2 = montBase ** 2 */
   MP_CHECKOK( s_mp_redc(&power2, mmm) );
 
   for (i = 1; i < odd_ints; ++i) {
-    mp_init_size(oddPowers + i, nLen + 2 * MP_USED(&power2) + 2);
+    MP_CHECKOK( mp_init_size(oddPowers + i, nLen + 2 * MP_USED(&power2) + 2) );
     MP_CHECKOK( mp_mul(oddPowers + (i - 1), &power2, oddPowers + i) );
     MP_CHECKOK( s_mp_redc(oddPowers + i, mmm) );
   }
 
   /* set accumulator to montgomery residue of 1 */
   mp_set(&accum1, 1);
   MP_CHECKOK( s_mp_to_mont(&accum1, mmm, &accum1) );
   pa1 = &accum1;
   pa2 = &accum2;
 
@@ skipping 779 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;
 }