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
4 * party and contributor rights, including patent rights, and no such rights
5 * are granted under this license.
7 * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
8 * Copyright (c) 2002-2014, Professor Benoit Macq
9 * Copyright (c) 2001-2003, David Janssens
10 * Copyright (c) 2002-2003, Yannick Verschueren
11 * Copyright (c) 2003-2007, Francois-Olivier Devaux
12 * Copyright (c) 2003-2014, Antonin Descampe
13 * Copyright (c) 2005, Herve Drolon, FreeImage Team
14 * All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
41 @brief Implementation of operations on integers (INT)
43 The functions in OPJ_INTMATH.H have for goal to realize operations on integers.
46 /** @defgroup OPJ_INTMATH OPJ_INTMATH - Implementation of operations on integers */
49 /** @name Exported functions (see also openjpeg.h) */
51 /* ----------------------------------------------------------------------- */
53 Get the minimum of two integers
54 @return Returns a if a < b else b
56 static INLINE OPJ_INT32 opj_int_min(OPJ_INT32 a, OPJ_INT32 b)
62 Get the minimum of two integers
63 @return Returns a if a < b else b
65 static INLINE OPJ_UINT32 opj_uint_min(OPJ_UINT32 a, OPJ_UINT32 b)
71 Get the maximum of two integers
72 @return Returns a if a > b else b
74 static INLINE OPJ_INT32 opj_int_max(OPJ_INT32 a, OPJ_INT32 b)
76 return (a > b) ? a : b;
80 Get the maximum of two integers
81 @return Returns a if a > b else b
83 static INLINE OPJ_UINT32 opj_uint_max(OPJ_UINT32 a, OPJ_UINT32 b)
85 return (a > b) ? a : b;
89 Get the saturated sum of two unsigned integers
90 @return Returns saturated sum of a+b
92 static INLINE OPJ_UINT32 opj_uint_adds(OPJ_UINT32 a, OPJ_UINT32 b)
94 OPJ_UINT64 sum = (OPJ_UINT64)a + (OPJ_UINT64)b;
95 return (OPJ_UINT32)(-(OPJ_INT32)(sum >> 32)) | (OPJ_UINT32)sum;
99 Clamp an integer inside an interval
102 <li>Returns a if (min < a < max)
103 <li>Returns max if (a > max)
104 <li>Returns min if (a < min)
107 static INLINE OPJ_INT32 opj_int_clamp(OPJ_INT32 a, OPJ_INT32 min,
119 @return Get absolute value of integer
121 static INLINE OPJ_INT32 opj_int_abs(OPJ_INT32 a)
123 return a < 0 ? -a : a;
126 Divide an integer and round upwards
127 @return Returns a divided by b
129 static INLINE OPJ_INT32 opj_int_ceildiv(OPJ_INT32 a, OPJ_INT32 b)
132 return (a + b - 1) / b;
136 Divide an integer and round upwards
137 @return Returns a divided by b
139 static INLINE OPJ_UINT32 opj_uint_ceildiv(OPJ_UINT32 a, OPJ_UINT32 b)
142 return (a + b - 1) / b;
146 Divide an integer by a power of 2 and round upwards
147 @return Returns a divided by 2^b
149 static INLINE OPJ_INT32 opj_int_ceildivpow2(OPJ_INT32 a, OPJ_INT32 b)
151 return (OPJ_INT32)((a + ((OPJ_INT64)1 << b) - 1) >> b);
155 Divide a 64bits integer by a power of 2 and round upwards
156 @return Returns a divided by 2^b
158 static INLINE OPJ_INT32 opj_int64_ceildivpow2(OPJ_INT64 a, OPJ_INT32 b)
160 return (OPJ_INT32)((a + ((OPJ_INT64)1 << b) - 1) >> b);
164 Divide an integer by a power of 2 and round upwards
165 @return Returns a divided by 2^b
167 static INLINE OPJ_UINT32 opj_uint_ceildivpow2(OPJ_UINT32 a, OPJ_UINT32 b)
169 return (OPJ_UINT32)((a + ((OPJ_UINT64)1U << b) - 1U) >> b);
173 Divide an integer by a power of 2 and round downwards
174 @return Returns a divided by 2^b
176 static INLINE OPJ_INT32 opj_int_floordivpow2(OPJ_INT32 a, OPJ_INT32 b)
181 Get logarithm of an integer and round downwards
182 @return Returns log2(a)
184 static INLINE OPJ_INT32 opj_int_floorlog2(OPJ_INT32 a)
187 for (l = 0; a > 1; l++) {
193 Get logarithm of an integer and round downwards
194 @return Returns log2(a)
196 static INLINE OPJ_UINT32 opj_uint_floorlog2(OPJ_UINT32 a)
199 for (l = 0; a > 1; ++l) {
206 Multiply two fixed-precision rational numbers.
209 @return Returns a * b
211 static INLINE OPJ_INT32 opj_int_fix_mul(OPJ_INT32 a, OPJ_INT32 b)
213 #if defined(_MSC_VER) && (_MSC_VER >= 1400) && !defined(__INTEL_COMPILER) && defined(_M_IX86)
214 OPJ_INT64 temp = __emul(a, b);
216 OPJ_INT64 temp = (OPJ_INT64) a * (OPJ_INT64) b ;
219 assert((temp >> 13) <= (OPJ_INT64)0x7FFFFFFF);
220 assert((temp >> 13) >= (-(OPJ_INT64)0x7FFFFFFF - (OPJ_INT64)1));
221 return (OPJ_INT32)(temp >> 13);
224 static INLINE OPJ_INT32 opj_int_fix_mul_t1(OPJ_INT32 a, OPJ_INT32 b)
226 #if defined(_MSC_VER) && (_MSC_VER >= 1400) && !defined(__INTEL_COMPILER) && defined(_M_IX86)
227 OPJ_INT64 temp = __emul(a, b);
229 OPJ_INT64 temp = (OPJ_INT64) a * (OPJ_INT64) b ;
232 assert((temp >> (13 + 11 - T1_NMSEDEC_FRACBITS)) <= (OPJ_INT64)0x7FFFFFFF);
233 assert((temp >> (13 + 11 - T1_NMSEDEC_FRACBITS)) >= (-(OPJ_INT64)0x7FFFFFFF -
235 return (OPJ_INT32)(temp >> (13 + 11 - T1_NMSEDEC_FRACBITS)) ;
238 /* ----------------------------------------------------------------------- */