2
* arbitrary precision integers
3
* Copyright (c) 2004 Michael Niedermayer <michaelni@gmx.at>
5
* This file is part of Libav.
7
* Libav is free software; you can redistribute it and/or
8
* modify it under the terms of the GNU Lesser General Public
9
* License as published by the Free Software Foundation; either
10
* version 2.1 of the License, or (at your option) any later version.
12
* Libav is distributed in the hope that it will be useful,
13
* but WITHOUT ANY WARRANTY; without even the implied warranty of
14
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15
* Lesser General Public License for more details.
17
* You should have received a copy of the GNU Lesser General Public
18
* License along with Libav; if not, write to the Free Software
19
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24
* arbitrary precision integers
25
* @author Michael Niedermayer <michaelni@gmx.at>
31
AVInteger av_add_i(AVInteger a, AVInteger b){
34
for(i=0; i<AV_INTEGER_SIZE; i++){
35
carry= (carry>>16) + a.v[i] + b.v[i];
41
AVInteger av_sub_i(AVInteger a, AVInteger b){
44
for(i=0; i<AV_INTEGER_SIZE; i++){
45
carry= (carry>>16) + a.v[i] - b.v[i];
51
int av_log2_i(AVInteger a){
54
for(i=AV_INTEGER_SIZE-1; i>=0; i--){
56
return av_log2_16bit(a.v[i]) + 16*i;
61
AVInteger av_mul_i(AVInteger a, AVInteger b){
64
int na= (av_log2_i(a)+16) >> 4;
65
int nb= (av_log2_i(b)+16) >> 4;
67
memset(&out, 0, sizeof(out));
73
for(j=i; j<AV_INTEGER_SIZE && j-i<=nb; j++){
74
carry= (carry>>16) + out.v[j] + a.v[i]*b.v[j-i];
82
int av_cmp_i(AVInteger a, AVInteger b){
84
int v= (int16_t)a.v[AV_INTEGER_SIZE-1] - (int16_t)b.v[AV_INTEGER_SIZE-1];
85
if(v) return (v>>16)|1;
87
for(i=AV_INTEGER_SIZE-2; i>=0; i--){
88
int v= a.v[i] - b.v[i];
89
if(v) return (v>>16)|1;
94
AVInteger av_shr_i(AVInteger a, int s){
98
for(i=0; i<AV_INTEGER_SIZE; i++){
99
unsigned int index= i + (s>>4);
101
if(index+1<AV_INTEGER_SIZE) v = a.v[index+1]<<16;
102
if(index <AV_INTEGER_SIZE) v+= a.v[index ];
103
out.v[i]= v >> (s&15);
108
AVInteger av_mod_i(AVInteger *quot, AVInteger a, AVInteger b){
109
int i= av_log2_i(a) - av_log2_i(b);
111
if(!quot) quot = "_temp;
113
assert((int16_t)a[AV_INTEGER_SIZE-1] >= 0 && (int16_t)b[AV_INTEGER_SIZE-1] >= 0);
114
assert(av_log2(b)>=0);
119
memset(quot, 0, sizeof(AVInteger));
122
*quot= av_shr_i(*quot, -1);
123
if(av_cmp_i(a, b) >= 0){
132
AVInteger av_div_i(AVInteger a, AVInteger b){
134
av_mod_i(", a, b);
138
AVInteger av_int2i(int64_t a){
142
for(i=0; i<AV_INTEGER_SIZE; i++){
149
int64_t av_i2int(AVInteger a){
151
int64_t out=(int8_t)a.v[AV_INTEGER_SIZE-1];
153
for(i= AV_INTEGER_SIZE-2; i>=0; i--){
154
out = (out<<16) + a.v[i];
163
const uint8_t ff_log2_tab[256]={
164
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,
165
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,
166
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,
167
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,
168
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,
169
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,
170
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,
171
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
177
for(a=7; a<256*256*256; a+=13215){
178
for(b=3; b<256*256*256; b+=27118){
179
AVInteger ai= av_int2i(a);
180
AVInteger bi= av_int2i(b);
182
assert(av_i2int(ai) == a);
183
assert(av_i2int(bi) == b);
184
assert(av_i2int(av_add_i(ai,bi)) == a+b);
185
assert(av_i2int(av_sub_i(ai,bi)) == a-b);
186
assert(av_i2int(av_mul_i(ai,bi)) == a*b);
187
assert(av_i2int(av_shr_i(ai, 9)) == a>>9);
188
assert(av_i2int(av_shr_i(ai,-9)) == a<<9);
189
assert(av_i2int(av_shr_i(ai, 17)) == a>>17);
190
assert(av_i2int(av_shr_i(ai,-17)) == a<<17);
191
assert(av_log2_i(ai) == av_log2(a));
192
assert(av_i2int(av_div_i(ai,bi)) == a/b);