Statistics
| Branch: | Revision:

ffmpeg / libavcodec / mathops.h @ 2912e87a

History | View | Annotate | Download (4.1 KB)

1 99aed7c8 Luca Barbato
/*
2
 * simple math operations
3 406792e7 Diego Biurrun
 * Copyright (c) 2001, 2002 Fabrice Bellard
4 99aed7c8 Luca Barbato
 * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at> et al
5
 *
6 2912e87a Mans Rullgard
 * This file is part of Libav.
7 b78e7197 Diego Biurrun
 *
8 2912e87a Mans Rullgard
 * Libav is free software; you can redistribute it and/or
9 99aed7c8 Luca Barbato
 * modify it under the terms of the GNU Lesser General Public
10
 * License as published by the Free Software Foundation; either
11 b78e7197 Diego Biurrun
 * version 2.1 of the License, or (at your option) any later version.
12 99aed7c8 Luca Barbato
 *
13 2912e87a Mans Rullgard
 * Libav is distributed in the hope that it will be useful,
14 99aed7c8 Luca Barbato
 * 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.
17
 *
18
 * You should have received a copy of the GNU Lesser General Public
19 2912e87a Mans Rullgard
 * License along with Libav; if not, write to the Free Software
20 99aed7c8 Luca Barbato
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21
 */
22 98790382 Stefano Sabatini
#ifndef AVCODEC_MATHOPS_H
23
#define AVCODEC_MATHOPS_H
24 99aed7c8 Luca Barbato
25 245976da Diego Biurrun
#include "libavutil/common.h"
26 99545457 Måns Rullgård
27 e20a4f53 Måns Rullgård
#if   ARCH_ARM
28 26f6a574 Måns Rullgård
#   include "arm/mathops.h"
29 b7904f78 Måns Rullgård
#elif ARCH_AVR32
30
#   include "avr32/mathops.h"
31 b250f9c6 Aurelien Jacobs
#elif ARCH_BFIN
32 26f6a574 Måns Rullgård
#   include "bfin/mathops.h"
33 9d48e28f Måns Rullgård
#elif ARCH_MIPS
34
#   include "mips/mathops.h"
35 e20a4f53 Måns Rullgård
#elif ARCH_PPC
36
#   include "ppc/mathops.h"
37
#elif ARCH_X86
38
#   include "x86/mathops.h"
39 99aed7c8 Luca Barbato
#endif
40
41
/* generic implementation */
42
43
#ifndef MULL
44 4deaa946 Måns Rullgård
#   define MULL(a,b,s) (((int64_t)(a) * (int64_t)(b)) >> (s))
45 99aed7c8 Luca Barbato
#endif
46
47
#ifndef MULH
48
//gcc 3.4 creates an incredibly bloated mess out of this
49
//#    define MULH(a,b) (((int64_t)(a) * (int64_t)(b))>>32)
50
51 849f1035 Måns Rullgård
static av_always_inline int MULH(int a, int b){
52 99aed7c8 Luca Barbato
    return ((int64_t)(a) * (int64_t)(b))>>32;
53
}
54
#endif
55
56 f2c694af Måns Rullgård
#ifndef UMULH
57
static av_always_inline unsigned UMULH(unsigned a, unsigned b){
58
    return ((uint64_t)(a) * (uint64_t)(b))>>32;
59
}
60
#endif
61
62 99aed7c8 Luca Barbato
#ifndef MUL64
63
#   define MUL64(a,b) ((int64_t)(a) * (int64_t)(b))
64
#endif
65
66 ffa978f1 Måns Rullgård
#ifndef MAC64
67
#   define MAC64(d, a, b) ((d) += MUL64(a, b))
68
#endif
69
70
#ifndef MLS64
71
#   define MLS64(d, a, b) ((d) -= MUL64(a, b))
72
#endif
73
74 99aed7c8 Luca Barbato
/* signed 16x16 -> 32 multiply add accumulate */
75
#ifndef MAC16
76
#   define MAC16(rt, ra, rb) rt += (ra) * (rb)
77
#endif
78
79
/* signed 16x16 -> 32 multiply */
80
#ifndef MUL16
81
#   define MUL16(ra, rb) ((ra) * (rb))
82
#endif
83
84 ffa978f1 Måns Rullgård
#ifndef MLS16
85
#   define MLS16(rt, ra, rb) ((rt) -= (ra) * (rb))
86
#endif
87
88 199436b9 Aurelien Jacobs
/* median of 3 */
89
#ifndef mid_pred
90
#define mid_pred mid_pred
91
static inline av_const int mid_pred(int a, int b, int c)
92
{
93
#if 0
94
    int t= (a-b)&((a-b)>>31);
95
    a-=t;
96
    b+=t;
97
    b-= (b-c)&((b-c)>>31);
98
    b+= (a-b)&((a-b)>>31);
99

100
    return b;
101
#else
102
    if(a>b){
103
        if(c>b){
104
            if(c>a) b=a;
105
            else    b=c;
106
        }
107
    }else{
108
        if(b>c){
109
            if(c>a) b=c;
110
            else    b=a;
111
        }
112
    }
113
    return b;
114
#endif
115
}
116
#endif
117
118 101dfa7d Måns Rullgård
#ifndef sign_extend
119
static inline av_const int sign_extend(int val, unsigned bits)
120
{
121 e969e261 Michael Niedermayer
    return (val << ((8 * sizeof(int)) - bits)) >> ((8 * sizeof(int)) - bits);
122 101dfa7d Måns Rullgård
}
123
#endif
124
125 48960b8f Måns Rullgård
#ifndef zero_extend
126
static inline av_const unsigned zero_extend(unsigned val, unsigned bits)
127
{
128 e969e261 Michael Niedermayer
    return (val << ((8 * sizeof(int)) - bits)) >> ((8 * sizeof(int)) - bits);
129 48960b8f Måns Rullgård
}
130
#endif
131
132 5e7dfb7d Måns Rullgård
#ifndef COPY3_IF_LT
133
#define COPY3_IF_LT(x, y, a, b, c, d)\
134
if ((y) < (x)) {\
135
    (x) = (y);\
136
    (a) = (b);\
137
    (c) = (d);\
138
}
139
#endif
140
141 5e46be96 Måns Rullgård
#ifndef NEG_SSR32
142
#   define NEG_SSR32(a,s) ((( int32_t)(a))>>(32-(s)))
143
#endif
144
145
#ifndef NEG_USR32
146
#   define NEG_USR32(a,s) (((uint32_t)(a))>>(32-(s)))
147
#endif
148
149 cf60d669 Måns Rullgård
#if HAVE_BIGENDIAN
150
# ifndef PACK_2U8
151
#   define PACK_2U8(a,b)     (((a) <<  8) | (b))
152 b39a2d19 Ronald S. Bultje
# endif
153 cf60d669 Måns Rullgård
# ifndef PACK_4U8
154
#   define PACK_4U8(a,b,c,d) (((a) << 24) | ((b) << 16) | ((c) << 8) | (d))
155
# endif
156
# ifndef PACK_2U16
157
#   define PACK_2U16(a,b)    (((a) << 16) | (b))
158
# endif
159
#else
160
# ifndef PACK_2U8
161
#   define PACK_2U8(a,b)     (((b) <<  8) | (a))
162
# endif
163
# ifndef PACK_4U2
164
#   define PACK_4U8(a,b,c,d) (((d) << 24) | ((c) << 16) | ((b) << 8) | (a))
165
# endif
166
# ifndef PACK_2U16
167
#   define PACK_2U16(a,b)    (((b) << 16) | (a))
168
# endif
169
#endif
170
171
#ifndef PACK_2S8
172
#   define PACK_2S8(a,b)     PACK_2U8((a)&255, (b)&255)
173
#endif
174
#ifndef PACK_4S8
175
#   define PACK_4S8(a,b,c,d) PACK_4U8((a)&255, (b)&255, (c)&255, (d)&255)
176
#endif
177
#ifndef PACK_2S16
178
#   define PACK_2S16(a,b)    PACK_2U16((a)&0xffff, (b)&0xffff)
179 b39a2d19 Ronald S. Bultje
#endif
180
181 98790382 Stefano Sabatini
#endif /* AVCODEC_MATHOPS_H */