OLD | NEW |
1 /* | 1 /* |
2 * The copyright in this software is being made available under the 2-clauses | 2 * The copyright in this software is being made available under the 2-clauses |
3 * BSD License, included below. This software may be subject to other third | 3 * BSD License, included below. This software may be subject to other third |
4 * party and contributor rights, including patent rights, and no such rights | 4 * party and contributor rights, including patent rights, and no such rights |
5 * are granted under this license. | 5 * are granted under this license. |
6 * | 6 * |
7 * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium | 7 * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium |
8 * Copyright (c) 2002-2014, Professor Benoit Macq | 8 * Copyright (c) 2002-2014, Professor Benoit Macq |
9 * Copyright (c) 2001-2003, David Janssens | 9 * Copyright (c) 2001-2003, David Janssens |
10 * Copyright (c) 2002-2003, Yannick Verschueren | 10 * Copyright (c) 2002-2003, Yannick Verschueren |
(...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 { | 63 { |
64 return opj_mct_norms; | 64 return opj_mct_norms; |
65 } | 65 } |
66 | 66 |
67 const OPJ_FLOAT64 * opj_mct_get_mct_norms_real () | 67 const OPJ_FLOAT64 * opj_mct_get_mct_norms_real () |
68 { | 68 { |
69 return opj_mct_norms_real; | 69 return opj_mct_norms_real; |
70 } | 70 } |
71 | 71 |
72 /* <summary> */ | 72 /* <summary> */ |
73 /* Foward reversible MCT. */ | 73 /* Forward reversible MCT. */ |
74 /* </summary> */ | 74 /* </summary> */ |
75 #ifdef __SSE2__ | 75 #ifdef __SSE2__ |
76 void opj_mct_encode( | 76 void opj_mct_encode( |
77 OPJ_INT32* restrict c0, | 77 OPJ_INT32* restrict c0, |
78 OPJ_INT32* restrict c1, | 78 OPJ_INT32* restrict c1, |
79 OPJ_INT32* restrict c2, | 79 OPJ_INT32* restrict c2, |
80 OPJ_UINT32 n) | 80 OPJ_UINT32 n) |
81 { | 81 { |
82 OPJ_SIZE_T i; | 82 OPJ_SIZE_T i; |
83 const OPJ_SIZE_T len = n; | 83 const OPJ_SIZE_T len = n; |
(...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
195 #endif | 195 #endif |
196 | 196 |
197 /* <summary> */ | 197 /* <summary> */ |
198 /* Get norm of basis function of reversible MCT. */ | 198 /* Get norm of basis function of reversible MCT. */ |
199 /* </summary> */ | 199 /* </summary> */ |
200 OPJ_FLOAT64 opj_mct_getnorm(OPJ_UINT32 compno) { | 200 OPJ_FLOAT64 opj_mct_getnorm(OPJ_UINT32 compno) { |
201 return opj_mct_norms[compno]; | 201 return opj_mct_norms[compno]; |
202 } | 202 } |
203 | 203 |
204 /* <summary> */ | 204 /* <summary> */ |
205 /* Foward irreversible MCT. */ | 205 /* Forward irreversible MCT. */ |
206 /* </summary> */ | 206 /* </summary> */ |
207 #ifdef __SSE4_1__ | 207 #ifdef __SSE4_1__ |
208 void opj_mct_encode_real( | 208 void opj_mct_encode_real( |
209
OPJ_INT32* restrict c0, | 209
OPJ_INT32* restrict c0, |
210
OPJ_INT32* restrict c1, | 210
OPJ_INT32* restrict c1, |
211
OPJ_INT32* restrict c2, | 211
OPJ_INT32* restrict c2, |
212
OPJ_UINT32 n) | 212
OPJ_UINT32 n) |
213 { | 213 { |
214 OPJ_SIZE_T i; | 214 OPJ_SIZE_T i; |
215 const OPJ_SIZE_T len = n; | 215 const OPJ_SIZE_T len = n; |
(...skipping 328 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
544 lIndex = i; | 544 lIndex = i; |
545 | 545 |
546 for (j=0;j<pNbComps;++j) { | 546 for (j=0;j<pNbComps;++j) { |
547 lCurrentValue = lMatrix[lIndex]; | 547 lCurrentValue = lMatrix[lIndex]; |
548 lIndex += pNbComps; | 548 lIndex += pNbComps; |
549 lNorms[i] += lCurrentValue * lCurrentValue; | 549 lNorms[i] += lCurrentValue * lCurrentValue; |
550 } | 550 } |
551 lNorms[i] = sqrt(lNorms[i]); | 551 lNorms[i] = sqrt(lNorms[i]); |
552 } | 552 } |
553 } | 553 } |
OLD | NEW |