2 * Copyright (c) 2005 Michael Niedermayer <michaelni@gmx.at>
4 * This file is part of FFmpeg.
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 * Miscellaneous math routines and tables.
27 #include "mathematics.h"
29 const uint8_t ff_sqrt_tab[128]={
30 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5,
31 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
32 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
33 9, 9, 9, 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11
36 const uint8_t ff_log2_tab[256]={
37 0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
38 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
39 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
40 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
41 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
42 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
43 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
44 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
47 int64_t ff_gcd(int64_t a, int64_t b){
48 if(b) return ff_gcd(b, a%b);
52 int64_t av_rescale_rnd(int64_t a, int64_t b, int64_t c, enum AVRounding rnd){
56 assert(rnd >=0 && rnd<=5 && rnd!=4);
58 if(a<0 && a != INT64_MIN) return -av_rescale_rnd(-a, b, c, rnd ^ ((rnd>>1)&1));
60 if(rnd==AV_ROUND_NEAR_INF) r= c/2;
61 else if(rnd&1) r= c-1;
63 if(b<=INT_MAX && c<=INT_MAX){
67 return a/c*b + (a%c*b + r)/c;
70 uint64_t a0= a&0xFFFFFFFF;
72 uint64_t b0= b&0xFFFFFFFF;
74 uint64_t t1= a0*b1 + a1*b0;
79 a1 = a1*b1 + (t1>>32) + (a0<t1a);
84 // int o= a1 & 0x8000000000000000ULL;
85 a1+= a1 + ((a0>>i)&1);
96 ai= av_mul_i(av_int2i(a), av_int2i(b));
97 ai= av_add_i(ai, av_int2i(r));
99 return av_i2int(av_div_i(ai, av_int2i(c)));
104 int64_t av_rescale(int64_t a, int64_t b, int64_t c){
105 return av_rescale_rnd(a, b, c, AV_ROUND_NEAR_INF);
108 int64_t av_rescale_q(int64_t a, AVRational bq, AVRational cq){
109 int64_t b= bq.num * (int64_t)cq.den;
110 int64_t c= cq.num * (int64_t)bq.den;
111 return av_rescale_rnd(a, b, c, AV_ROUND_NEAR_INF);
119 for(a=7; a<(1LL<<62); a+=a/3+1){
120 for(b=3; b<(1LL<<62); b+=b/4+1){
121 for(c=9; c<(1LL<<62); c+=(c*2)/5+3){
124 ai= av_mul_i(av_int2i(a), av_int2i(b));
125 ai= av_add_i(ai, av_int2i(r));
127 d= av_i2int(av_div_i(ai, av_int2i(c)));
129 e= av_rescale(a,b,c);
131 if((double)a * (double)b / (double)c > (1LL<<63))
134 if(d!=e) printf("%"PRId64"*%"PRId64"/%"PRId64"= %"PRId64"=%"PRId64"\n", a, b, c, d, e);