Update NSPR to 4.12 and NSS to 3.23 on iOS

nss/lib/freebl/ecl/ecp_256_32.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/. */
 
 /* A 32-bit implementation of the NIST P-256 elliptic curve. */
 
 #include <string.h>
 
 #include "prtypes.h"
 #include "mpi.h"
@@ skipping 1284 matching lines @@
 static mp_err to_montgomery(felem out, const mp_int *in, const ECGroup *group)
 {
     /* There are no MPI functions for bitshift operations and we wish to shift
      * in 257 bits left so we move the digits 256-bits left and then multiply
      * by two.
      */
     mp_int in_shifted;
     int i;
     mp_err res;
 
-    mp_init(&in_shifted);
-    s_mp_pad(&in_shifted, MP_USED(in) + MP_DIGITS_IN_256_BITS);
+    MP_CHECKOK(mp_init(&in_shifted));
+    MP_CHECKOK(s_mp_pad(&in_shifted, MP_USED(in) + MP_DIGITS_IN_256_BITS));
     memcpy(&MP_DIGIT(&in_shifted, MP_DIGITS_IN_256_BITS),
            MP_DIGITS(in),
            MP_USED(in)*sizeof(mp_digit));
-    mp_mul_2(&in_shifted, &in_shifted);
+    MP_CHECKOK(mp_mul_2(&in_shifted, &in_shifted));
     MP_CHECKOK(group->meth->field_mod(&in_shifted, &in_shifted, group->meth));
 
     for (i = 0;; i++) {
         out[i] = MP_DIGIT(&in_shifted, 0) & kBottom29Bits;
-        mp_div_d(&in_shifted, kTwo29, &in_shifted, NULL);
+        MP_CHECKOK(mp_div_d(&in_shifted, kTwo29, &in_shifted, NULL));
 
         i++;
         if (i == NLIMBS)
             break;
         out[i] = MP_DIGIT(&in_shifted, 0) & kBottom28Bits;
-        mp_div_d(&in_shifted, kTwo28, &in_shifted, NULL);
+        MP_CHECKOK(mp_div_d(&in_shifted, kTwo28, &in_shifted, NULL));
     }
 
 CLEANUP:
     mp_clear(&in_shifted);
     return res;
 }
 
 /* from_montgomery sets out=in/R. */
 static mp_err from_montgomery(mp_int *out, const felem in,
                               const ECGroup *group)
 {
     mp_int result, tmp;
     mp_err res;
     int i;
 
-    mp_init(&result);
-    mp_init(&tmp);
+    MP_CHECKOK(mp_init(&result));
+    MP_CHECKOK(mp_init(&tmp));
 
     MP_CHECKOK(mp_add_d(&tmp, in[NLIMBS-1], &result));
     for (i = NLIMBS-2; i >= 0; i--) {
         if ((i & 1) == 0) {
             MP_CHECKOK(mp_mul_d(&result, kTwo29, &tmp));
         } else {
             MP_CHECKOK(mp_mul_d(&result, kTwo28, &tmp));
         }
         MP_CHECKOK(mp_add_d(&tmp, in[i], &result));
     }
@@ skipping 146 matching lines @@
 /* Wire in fast point multiplication for named curves. */
 mp_err ec_group_set_gfp256_32(ECGroup *group, ECCurveName name)
 {
     if (name == ECCurve_NIST_P256) {
         group->base_point_mul = &ec_GFp_nistp256_base_point_mul;
         group->point_mul = &ec_GFp_nistp256_point_mul;
         group->points_mul = &ec_GFp_nistp256_points_mul_vartime;
     }
     return MP_OKAY;
 }