lfg.c 2.48 KB
Newer Older
1 2 3 4
/*
 * Lagged Fibonacci PRNG
 * Copyright (c) 2008 Michael Niedermayer
 *
5
 * This file is part of Libav.
6
 *
7
 * Libav is free software; you can redistribute it and/or
8 9 10 11
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * 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 14 15 16 17
 * 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
18
 * License along with Libav; if not, write to the Free Software
19 20 21 22
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */

#include <inttypes.h>
23 24
#include <limits.h>
#include <math.h>
25 26 27
#include "lfg.h"
#include "md5.h"
#include "intreadwrite.h"
28
#include "attributes.h"
29

30
av_cold void av_lfg_init(AVLFG *c, unsigned int seed)
31 32
{
    uint8_t tmp[16] = { 0 };
33 34
    int i;

35 36 37 38 39 40 41 42
    for (i = 8; i < 64; i += 4) {
        AV_WL32(tmp, seed);
        tmp[4] = i;
        av_md5_sum(tmp, tmp, 16);
        c->state[i    ] = AV_RL32(tmp);
        c->state[i + 1] = AV_RL32(tmp + 4);
        c->state[i + 2] = AV_RL32(tmp + 8);
        c->state[i + 3] = AV_RL32(tmp + 12);
43
    }
44
    c->index = 0;
45 46
}

47 48 49 50 51
void av_bmg_get(AVLFG *lfg, double out[2])
{
    double x1, x2, w;

    do {
52 53 54
        x1 = 2.0 / UINT_MAX * av_lfg_get(lfg) - 1.0;
        x2 = 2.0 / UINT_MAX * av_lfg_get(lfg) - 1.0;
        w  = x1 * x1 + x2 * x2;
55 56 57 58 59 60 61
    } while (w >= 1.0);

    w = sqrt((-2.0 * log(w)) / w);
    out[0] = x1 * w;
    out[1] = x2 * w;
}

62 63
#ifdef TEST
#include "log.h"
64
#include "timer.h"
65 66 67

int main(void)
{
68
    int x = 0;
69 70 71 72 73 74
    int i, j;
    AVLFG state;

    av_lfg_init(&state, 0xdeadbeef);
    for (j = 0; j < 10000; j++) {
        START_TIMER
75
        for (i = 0; i < 624; i++)
76
            x += av_lfg_get(&state);
77
        STOP_TIMER("624 calls of av_lfg_get");
78 79
    }
    av_log(NULL, AV_LOG_ERROR, "final value:%X\n", x);
80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97

    /* BMG usage example */
    {
        double mean   = 1000;
        double stddev = 53;

        av_lfg_init(&state, 42);

        for (i = 0; i < 1000; i += 2) {
            double bmg_out[2];
            av_bmg_get(&state, bmg_out);
            av_log(NULL, AV_LOG_INFO,
                   "%f\n%f\n",
                   bmg_out[0] * stddev + mean,
                   bmg_out[1] * stddev + mean);
        }
    }

98 99 100
    return 0;
}
#endif