aboutsummaryrefslogtreecommitdiffstats
path: root/libav/tick.h
blob: e2d747e33632dcdcef18b7eab9a77eb3039d3aed (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/* tick.h - Compute successive integer multiples of a rational
 * number without long-term rounding error.
 * (c)2002 by Lennert Buytenhek <buytenh@gnu.org>
 * File licensed under the GPL, see http://www.fsf.org/ for more info.
 * Dedicated to Marija Kulikova.
 */

#include "avcodec.h"

typedef struct Ticker {
    int value;
    int inrate;
    int outrate;
    int div;
    int mod;
} Ticker;

extern void ticker_init(Ticker *tick, INT64 inrate, INT64 outrate);

static inline int ticker_tick(Ticker *tick, int num)
{
    int n = num * tick->div;

    tick->value += num * tick->mod;
#if 1
    if (tick->value > 0) {
        n += (tick->value / tick->inrate);
        tick->value = tick->value % tick->inrate;
        if (tick->value > 0) {
            tick->value -= tick->inrate;
            n++;
        }
    }
#else
    while (tick->value > 0) {
        tick->value -= tick->inrate;
        n++;
    }
#endif
    return n;
}

static inline INT64 ticker_abs(Ticker *tick, int num)
{
    INT64 n = (INT64) num * tick->div;
    INT64 value = (INT64) num * tick->mod;

    if (value > 0) {
        n += (value / tick->inrate);
        value = value % tick->inrate;
        if (value > 0) {
            /* value -= tick->inrate; */
            n++;
        }
    }
    return n;
}