mathematics.c 5.92 KB
Newer Older
1
/*
2
 * Copyright (c) 2005-2012 Michael Niedermayer <michaelni@gmx.at>
3
 *
4 5 6
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
7 8
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
9
 * version 2.1 of the License, or (at your option) any later version.
10
 *
11
 * FFmpeg is distributed in the hope that it will be useful,
12 13 14 15 16
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * 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
19
 */
20

21
/**
22
 * @file
23
 * miscellaneous math routines and tables
24 25
 */

26 27
#include <stdint.h>
#include <limits.h>
28

29
#include "mathematics.h"
30
#include "libavutil/intmath.h"
31
#include "libavutil/common.h"
32
#include "avassert.h"
33
#include "version.h"
34

35 36 37 38 39 40 41 42
/* Stein's binary GCD algorithm:
 * https://en.wikipedia.org/wiki/Binary_GCD_algorithm */
int64_t av_gcd(int64_t a, int64_t b) {
    int za, zb, k;
    int64_t u, v;
    if (a == 0)
        return b;
    if (b == 0)
43
        return a;
44 45 46 47 48 49 50 51 52 53 54
    za = ff_ctzll(a);
    zb = ff_ctzll(b);
    k  = FFMIN(za, zb);
    u = llabs(a >> za);
    v = llabs(b >> zb);
    while (u != v) {
        if (u > v)
            FFSWAP(int64_t, v, u);
        v -= u;
        v >>= ff_ctzll(v);
    }
55
    return (uint64_t)u << k;
56 57
}

58 59 60
int64_t av_rescale_rnd(int64_t a, int64_t b, int64_t c, enum AVRounding rnd)
{
    int64_t r = 0;
61 62
    av_assert2(c > 0);
    av_assert2(b >=0);
63 64
    av_assert2((unsigned)(rnd&~AV_ROUND_PASS_MINMAX)<=5 && (rnd&~AV_ROUND_PASS_MINMAX)!=4);

65
    if (c <= 0 || b < 0 || !((unsigned)(rnd&~AV_ROUND_PASS_MINMAX)<=5 && (rnd&~AV_ROUND_PASS_MINMAX)!=4))
66
        return INT64_MIN;
67

68 69 70 71 72
    if (rnd & AV_ROUND_PASS_MINMAX) {
        if (a == INT64_MIN || a == INT64_MAX)
            return a;
        rnd -= AV_ROUND_PASS_MINMAX;
    }
73

74
    if (a < 0)
75
        return -(uint64_t)av_rescale_rnd(-FFMAX(a, -INT64_MAX), b, c, rnd ^ ((rnd >> 1) & 1));
76

77 78 79 80
    if (rnd == AV_ROUND_NEAR_INF)
        r = c / 2;
    else if (rnd & 1)
        r = c - 1;
81

82 83 84
    if (b <= INT_MAX && c <= INT_MAX) {
        if (a <= INT_MAX)
            return (a * b + r) / c;
85 86 87
        else {
            int64_t ad = a / c;
            int64_t a2 = (a % c * b + r) / c;
88
            if (ad >= INT32_MAX && b && ad > (INT64_MAX - a2) / b)
89 90 91
                return INT64_MIN;
            return ad * b + a2;
        }
92
    } else {
93
#if 1
94 95 96 97 98 99
        uint64_t a0  = a & 0xFFFFFFFF;
        uint64_t a1  = a >> 32;
        uint64_t b0  = b & 0xFFFFFFFF;
        uint64_t b1  = b >> 32;
        uint64_t t1  = a0 * b1 + a1 * b0;
        uint64_t t1a = t1 << 32;
100 101
        int i;

102 103
        a0  = a0 * b0 + t1a;
        a1  = a1 * b1 + (t1 >> 32) + (a0 < t1a);
104
        a0 += r;
105
        a1 += a0 < r;
106

107 108 109 110
        for (i = 63; i >= 0; i--) {
            a1 += a1 + ((a0 >> i) & 1);
            t1 += t1;
            if (c <= a1) {
111 112 113 114
                a1 -= c;
                t1++;
            }
        }
115 116
        if (t1 > INT64_MAX)
            return INT64_MIN;
117 118
        return t1;
#else
119
        /* reference code doing (a*b + r) / c, requires libavutil/integer.h */
120
        AVInteger ai;
121 122
        ai = av_mul_i(av_int2i(a), av_int2i(b));
        ai = av_add_i(ai, av_int2i(r));
123

124 125
        return av_i2int(av_div_i(ai, av_int2i(c)));
#endif
126
    }
127 128
}

129 130
int64_t av_rescale(int64_t a, int64_t b, int64_t c)
{
131 132 133
    return av_rescale_rnd(a, b, c, AV_ROUND_NEAR_INF);
}

134 135 136
int64_t av_rescale_q_rnd(int64_t a, AVRational bq, AVRational cq,
                         enum AVRounding rnd)
{
137 138
    int64_t b = bq.num * (int64_t)cq.den;
    int64_t c = cq.num * (int64_t)bq.den;
139 140 141 142 143 144
    return av_rescale_rnd(a, b, c, rnd);
}

int64_t av_rescale_q(int64_t a, AVRational bq, AVRational cq)
{
    return av_rescale_q_rnd(a, bq, cq, AV_ROUND_NEAR_INF);
145
}
146

147 148 149 150
int av_compare_ts(int64_t ts_a, AVRational tb_a, int64_t ts_b, AVRational tb_b)
{
    int64_t a = tb_a.num * (int64_t)tb_b.den;
    int64_t b = tb_b.num * (int64_t)tb_a.den;
151
    if ((FFABS(ts_a)|a|FFABS(ts_b)|b) <= INT_MAX)
152
        return (ts_a*a > ts_b*b) - (ts_a*a < ts_b*b);
153 154 155 156
    if (av_rescale_rnd(ts_a, a, b, AV_ROUND_DOWN) < ts_b)
        return -1;
    if (av_rescale_rnd(ts_b, b, a, AV_ROUND_DOWN) < ts_a)
        return 1;
Michael Niedermayer's avatar
Michael Niedermayer committed
157 158 159
    return 0;
}

160 161 162 163 164
int64_t av_compare_mod(uint64_t a, uint64_t b, uint64_t mod)
{
    int64_t c = (a - b) & (mod - 1);
    if (c > (mod >> 1))
        c -= mod;
165 166
    return c;
}
167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189

int64_t av_rescale_delta(AVRational in_tb, int64_t in_ts,  AVRational fs_tb, int duration, int64_t *last, AVRational out_tb){
    int64_t a, b, this;

    av_assert0(in_ts != AV_NOPTS_VALUE);
    av_assert0(duration >= 0);

    if (*last == AV_NOPTS_VALUE || !duration || in_tb.num*(int64_t)out_tb.den <= out_tb.num*(int64_t)in_tb.den) {
simple_round:
        *last = av_rescale_q(in_ts, in_tb, fs_tb) + duration;
        return av_rescale_q(in_ts, in_tb, out_tb);
    }

    a =  av_rescale_q_rnd(2*in_ts-1, in_tb, fs_tb, AV_ROUND_DOWN)   >>1;
    b = (av_rescale_q_rnd(2*in_ts+1, in_tb, fs_tb, AV_ROUND_UP  )+1)>>1;
    if (*last < 2*a - b || *last > 2*b - a)
        goto simple_round;

    this = av_clip64(*last, a, b);
    *last = this + duration;

    return av_rescale_q(this, fs_tb, out_tb);
}
190 191 192

int64_t av_add_stable(AVRational ts_tb, int64_t ts, AVRational inc_tb, int64_t inc)
{
193 194
    int64_t m, d;

195 196
    if (inc != 1)
        inc_tb = av_mul_q(inc_tb, (AVRational) {inc, 1});
197

198 199 200
    m = inc_tb.num * (int64_t)ts_tb.den;
    d = inc_tb.den * (int64_t)ts_tb.num;

201
    if (m % d == 0 && ts <= INT64_MAX - m / d)
202
        return ts + m / d;
203
    if (m < d)
204
        return ts;
205 206

    {
207 208
        int64_t old = av_rescale_q(ts, ts_tb, inc_tb);
        int64_t old_ts = av_rescale_q(old, inc_tb, ts_tb);
209 210 211 212

        if (old == INT64_MAX)
            return ts;

213
        return av_rescale_q(old + 1, inc_tb, ts_tb) + (ts - old_ts);
214 215
    }
}