Mercurial > libavutil.hg
annotate lfg.h @ 744:059c6e697629 libavutil
ARM: use gcc inline asm in bswap.h only when available
author | mru |
---|---|
date | Wed, 01 Jul 2009 00:55:15 +0000 |
parents | 8c48a1b999a3 |
children | 41da9d9d39b7 |
rev | line source |
---|---|
533 | 1 /* |
2 * Lagged Fibonacci PRNG | |
3 * Copyright (c) 2008 Michael Niedermayer | |
4 * | |
5 * This file is part of FFmpeg. | |
6 * | |
7 * FFmpeg 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. | |
11 * | |
12 * FFmpeg 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. | |
16 * | |
17 * You should have received a copy of the GNU Lesser General Public | |
18 * License along with FFmpeg; if not, write to the Free Software | |
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
20 */ | |
21 | |
567 | 22 #ifndef AVUTIL_LFG_H |
23 #define AVUTIL_LFG_H | |
533 | 24 |
25 typedef struct { | |
26 unsigned int state[64]; | |
27 int index; | |
28 } AVLFG; | |
29 | |
30 void av_lfg_init(AVLFG *c, unsigned int seed); | |
31 | |
535 | 32 /** |
633 | 33 * Gets the next random unsigned 32-bit number using an ALFG. |
535 | 34 * |
35 * Please also consider a simple LCG like state= state*1664525+1013904223, | |
36 * it may be good enough and faster for your specific use case. | |
37 */ | |
533 | 38 static inline unsigned int av_lfg_get(AVLFG *c){ |
39 c->state[c->index & 63] = c->state[(c->index-24) & 63] + c->state[(c->index-55) & 63]; | |
40 return c->state[c->index++ & 63]; | |
41 } | |
42 | |
537
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
43 /** |
633 | 44 * Gets the next random unsigned 32-bit number using a MLFG. |
537
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
45 * |
633 | 46 * Please also consider av_lfg_get() above, it is faster. |
537
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
47 */ |
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
48 static inline unsigned int av_mlfg_get(AVLFG *c){ |
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
49 unsigned int a= c->state[(c->index-55) & 63]; |
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
50 unsigned int b= c->state[(c->index-24) & 63]; |
538 | 51 return c->state[c->index++ & 63] = 2*a*b+a+b; |
537
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
52 } |
2862fa9da110
Add a multiplicative LFG for those thinking the additive is not good
michael
parents:
535
diff
changeset
|
53 |
567 | 54 #endif /* AVUTIL_LFG_H */ |