2 * simple math operations
3 * Copyright (c) 2001, 2002 Fabrice Bellard
4 * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at> et al
6 * This file is part of FFmpeg.
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22 #ifndef AVCODEC_MATHOPS_H
23 #define AVCODEC_MATHOPS_H
27 #include "libavutil/common.h"
30 extern const uint32_t ff_inverse[257];
31 extern const uint8_t ff_reverse[256];
32 extern const uint8_t ff_sqrt_tab[256];
35 # include "arm/mathops.h"
37 # include "avr32/mathops.h"
39 # include "bfin/mathops.h"
41 # include "mips/mathops.h"
43 # include "ppc/mathops.h"
45 # include "x86/mathops.h"
48 /* generic implementation */
51 # define MUL64(a,b) ((int64_t)(a) * (int64_t)(b))
55 # define MULL(a,b,s) (MUL64(a, b) >> (s))
59 static av_always_inline int MULH(int a, int b){
60 return MUL64(a, b) >> 32;
65 static av_always_inline unsigned UMULH(unsigned a, unsigned b){
66 return ((uint64_t)(a) * (uint64_t)(b))>>32;
71 # define MAC64(d, a, b) ((d) += MUL64(a, b))
75 # define MLS64(d, a, b) ((d) -= MUL64(a, b))
78 /* signed 16x16 -> 32 multiply add accumulate */
80 # define MAC16(rt, ra, rb) rt += (ra) * (rb)
83 /* signed 16x16 -> 32 multiply */
85 # define MUL16(ra, rb) ((ra) * (rb))
89 # define MLS16(rt, ra, rb) ((rt) -= (ra) * (rb))
94 #define mid_pred mid_pred
95 static inline av_const int mid_pred(int a, int b, int c)
98 int t= (a-b)&((a-b)>>31);
101 b-= (b-c)&((b-c)>>31);
102 b+= (a-b)&((a-b)>>31);
123 static inline av_const int sign_extend(int val, unsigned bits)
125 unsigned shift = 8 * sizeof(int) - bits;
126 union { unsigned u; int s; } v = { (unsigned) val << shift };
132 static inline av_const unsigned zero_extend(unsigned val, unsigned bits)
134 return (val << ((8 * sizeof(int)) - bits)) >> ((8 * sizeof(int)) - bits);
139 #define COPY3_IF_LT(x, y, a, b, c, d)\
148 #define MASK_ABS(mask, level) do { \
149 mask = level >> 31; \
150 level = (level ^ mask) - mask; \
155 # define NEG_SSR32(a,s) ((( int32_t)(a))>>(32-(s)))
159 # define NEG_USR32(a,s) (((uint32_t)(a))>>(32-(s)))
164 # define PACK_2U8(a,b) (((a) << 8) | (b))
167 # define PACK_4U8(a,b,c,d) (((a) << 24) | ((b) << 16) | ((c) << 8) | (d))
170 # define PACK_2U16(a,b) (((a) << 16) | (b))
174 # define PACK_2U8(a,b) (((b) << 8) | (a))
177 # define PACK_4U8(a,b,c,d) (((d) << 24) | ((c) << 16) | ((b) << 8) | (a))
180 # define PACK_2U16(a,b) (((b) << 16) | (a))
185 # define PACK_2S8(a,b) PACK_2U8((a)&255, (b)&255)
188 # define PACK_4S8(a,b,c,d) PACK_4U8((a)&255, (b)&255, (c)&255, (d)&255)
191 # define PACK_2S16(a,b) PACK_2U16((a)&0xffff, (b)&0xffff)
195 # define FASTDIV(a,b) ((uint32_t)((((uint64_t)a) * ff_inverse[b]) >> 32))
199 # define MOD_UNLIKELY(modulus, dividend, divisor, prev_dividend) \
201 if ((prev_dividend) == 0 || (dividend) - (prev_dividend) != (divisor)) \
202 (modulus) = (dividend) % (divisor); \
203 (prev_dividend) = (dividend); \
207 static inline av_const unsigned int ff_sqrt(unsigned int a)
211 if (a < 255) return (ff_sqrt_tab[a + 1] - 1) >> 4;
212 else if (a < (1 << 12)) b = ff_sqrt_tab[a >> 4] >> 2;
214 else if (a < (1 << 14)) b = ff_sqrt_tab[a >> 6] >> 1;
215 else if (a < (1 << 16)) b = ff_sqrt_tab[a >> 8] ;
218 int s = av_log2_16bit(a >> 16) >> 1;
219 unsigned int c = a >> (s + 2);
220 b = ff_sqrt_tab[c >> (s + 8)];
221 b = FASTDIV(c,b) + (b << s);
224 return b - (a < b * b);
227 static inline int8_t ff_u8_to_s8(uint8_t a)
237 #endif /* AVCODEC_MATHOPS_H */