8660 mpi code checks return value of void function

*** 38,52 ****
   * ***** END LICENSE BLOCK ***** */
  /*
   * Copyright 2007 Sun Microsystems, Inc.  All rights reserved.
   * Use is subject to license terms.
   *
   * Sun elects to use this software under the MPL license.
   */
  
- #pragma ident   "%Z%%M% %I%     %E% SMI"
- 
  /* $Id: mpmontg.c,v 1.20 2006/08/29 02:41:38 nelson%bolyard.com Exp $ */
  
  /* This file implements moduluar exponentiation using Montgomery's
   * method for modular reduction.  This file implements the method
   * described as "Improvement 1" in the paper "A Cryptogrpahic Library for
--- 38,52 ----
   * ***** END LICENSE BLOCK ***** */
  /*
   * Copyright 2007 Sun Microsystems, Inc.  All rights reserved.
   * Use is subject to license terms.
   *
+  * Copyright 2017 RackTop Systems.
+  *
   * Sun elects to use this software under the MPL license.
   */
  
  /* $Id: mpmontg.c,v 1.20 2006/08/29 02:41:38 nelson%bolyard.com Exp $ */
  
  /* This file implements moduluar exponentiation using Montgomery's
   * method for modular reduction.  This file implements the method
   * described as "Improvement 1" in the paper "A Cryptogrpahic Library for
*** 102,112 ****
    i = MP_USED(T) + MP_USED(&mmm->N) + 2;
    MP_CHECKOK( s_mp_pad(T, i) );
    for (i = 0; i < MP_USED(&mmm->N); ++i ) {
      mp_digit m_i = MP_DIGIT(T, i) * mmm->n0prime;
      /* T += N * m_i * (MP_RADIX ** i); */
!     MP_CHECKOK( s_mp_mul_d_add_offset(&mmm->N, m_i, T, i) );
    }
    s_mp_clamp(T);
  
    /* T /= R */
    s_mp_div_2d(T, mmm->b); 
--- 102,112 ----
    i = MP_USED(T) + MP_USED(&mmm->N) + 2;
    MP_CHECKOK( s_mp_pad(T, i) );
    for (i = 0; i < MP_USED(&mmm->N); ++i ) {
      mp_digit m_i = MP_DIGIT(T, i) * mmm->n0prime;
      /* T += N * m_i * (MP_RADIX ** i); */
!     s_mp_mul_d_add_offset(&mmm->N, m_i, T, i);
    }
    s_mp_clamp(T);
  
    /* T /= R */
    s_mp_div_2d(T, mmm->b);