Merge to M46: upgrade openjpeg to commit# cf352af

third_party/libopenjpeg20/mct.c

 /*
  * The copyright in this software is being made available under the 2-clauses 
  * BSD License, included below. This software may be subject to other third 
  * party and contributor rights, including patent rights, and no such rights
  * are granted under this license.
  *
  * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
  * Copyright (c) 2002-2014, Professor Benoit Macq
  * Copyright (c) 2001-2003, David Janssens
  * Copyright (c) 2002-2003, Yannick Verschueren
@@ skipping 52 matching lines @@
 {
         return opj_mct_norms;
 }
 
 const OPJ_FLOAT64 * opj_mct_get_mct_norms_real ()
 {
         return opj_mct_norms_real;
 }
 
 /* <summary> */
-/* Foward reversible MCT. */
+/* Forward reversible MCT. */
 /* </summary> */
 #ifdef __SSE2__
 void opj_mct_encode(
                 OPJ_INT32* restrict c0,
                 OPJ_INT32* restrict c1,
                 OPJ_INT32* restrict c2,
                 OPJ_UINT32 n)
 {
         OPJ_SIZE_T i;
         const OPJ_SIZE_T len = n;
@@ skipping 111 matching lines @@
 #endif
 
 /* <summary> */
 /* Get norm of basis function of reversible MCT. */
 /* </summary> */
 OPJ_FLOAT64 opj_mct_getnorm(OPJ_UINT32 compno) {
         return opj_mct_norms[compno];
 }
 
 /* <summary> */
-/* Foward irreversible MCT. */
+/* Forward irreversible MCT. */
 /* </summary> */
 #ifdef __SSE4_1__
 void opj_mct_encode_real(
                                                                                                  OPJ_INT32* restrict c0,
                                                                                                  OPJ_INT32* restrict c1,
                                                                                                  OPJ_INT32* restrict c2,
                                                                                                  OPJ_UINT32 n)
 {
         OPJ_SIZE_T i;
         const OPJ_SIZE_T len = n;
@@ skipping 328 matching lines @@
                 lIndex = i;
 
                 for     (j=0;j<pNbComps;++j) {
                         lCurrentValue = lMatrix[lIndex];
                         lIndex += pNbComps;
                         lNorms[i] += lCurrentValue * lCurrentValue;
                 }
                 lNorms[i] = sqrt(lNorms[i]);
         }
 }