}
#ifdef TEST
-#undef random
#define SIZE 10240
+#include "libavutil/lfg.h"
#include "avcodec.h"
#include "cabac.h"
uint8_t r[9*SIZE];
int i;
uint8_t state[10]= {0};
+ AVLFG prn;
+ av_lfg_init(&prn, 1);
ff_init_cabac_encoder(&c, b, SIZE);
ff_init_cabac_states(&c);
for(i=0; i<SIZE; i++){
- r[i]= random()%7;
+ r[i] = av_lfg_get(&prn) % 7;
}
for(i=0; i<SIZE; i++){
#include <math.h>
#include "libavutil/common.h"
+#include "libavutil/lfg.h"
#include "simple_idct.h"
#include "aandcttab.h"
#include "x86/idct_xvid.h"
#undef printf
-#undef random
void *fast_memcpy(void *a, const void *b, size_t c){return memcpy(a,b,c);};
int64_t sysErr[64], sysErrMax=0;
int maxout=0;
int blockSumErrMax=0, blockSumErr;
+ AVLFG prn;
- srandom(0);
+ av_lfg_init(&prn, 1);
err_inf = 0;
err2 = 0;
switch(test){
case 0:
for(i=0;i<64;i++)
- block1[i] = (random() % 512) -256;
+ block1[i] = (av_lfg_get(&prn) % 512) -256;
if (is_idct){
fdct(block1);
}
break;
case 1:{
- int num= (random()%10)+1;
+ int num = av_lfg_get(&prn) % 10 + 1;
for(i=0;i<num;i++)
- block1[random()%64] = (random() % 512) -256;
+ block1[av_lfg_get(&prn) % 64] = av_lfg_get(&prn) % 512 -256;
}break;
case 2:
- block1[0]= (random()%4096)-2048;
+ block1[0] = av_lfg_get(&prn) % 4096 - 2048;
block1[63]= (block1[0]&1)^1;
break;
}
switch(test){
case 0:
for(i=0;i<64;i++)
- block1[i] = (random() % 512) -256;
+ block1[i] = av_lfg_get(&prn) % 512 -256;
if (is_idct){
fdct(block1);
break;
case 1:{
case 2:
- block1[0] = (random() % 512) -256;
- block1[1] = (random() % 512) -256;
- block1[2] = (random() % 512) -256;
- block1[3] = (random() % 512) -256;
+ block1[0] = av_lfg_get(&prn) % 512 -256;
+ block1[1] = av_lfg_get(&prn) % 512 -256;
+ block1[2] = av_lfg_get(&prn) % 512 -256;
+ block1[3] = av_lfg_get(&prn) % 512 -256;
}break;
}
{
int it, i, it1, ti, ti1, err_max, v;
- srandom(0);
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
/* just one test to see if code is correct (precision is less
important here) */
/* XXX: use forward transform to generate values */
for(i=0;i<64;i++)
- block1[i] = (random() % 256) - 128;
+ block1[i] = av_lfg_get(&prn) % 256 - 128;
block1[0] += 1024;
for(i=0; i<64; i++)
* FFT and MDCT tests.
*/
+#include "libavutil/lfg.h"
#include "dsputil.h"
#include <math.h>
#include <unistd.h>
#include <string.h>
#undef exit
-#undef random
/* reference fft */
float frandom(void)
{
- return (float)((random() & 0xffff) - 32768) / 32768.0;
+ AVLFG prn;
+ av_lfg_init(&prn, 1);
+ return (float)((av_lfg_get(&prn) & 0xffff) - 32768) / 32768.0;
}
int64_t gettime(void)
#include <unistd.h>
#include "dsputil.h"
+#include "libavutil/lfg.h"
#undef exit
#undef printf
-#undef random
#define WIDTH 64
#define HEIGHT 64
void fill_random(uint8_t *tab, int size)
{
int i;
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
for(i=0;i<size;i++) {
#if 1
- tab[i] = random() % 256;
+ tab[i] = av_lfg_get(&prn) % 256;
#else
tab[i] = i;
#endif
ctx = avcodec_alloc_context();
ctx->dsp_mask = FF_MM_FORCE;
dsputil_init(&cctx, ctx);
- for (c = 0; c < 2; c++) {
+ for (c = 0; c < 1; c++) {
int x;
ctx->dsp_mask = FF_MM_FORCE | flags[c];
dsputil_init(&mmxctx, ctx);
#ifdef TEST
#define SIZE 10240
-#undef random
+
+#include "libavutil/lfg.h"
+
int main(void){
RangeCoder c;
uint8_t b[9*SIZE];
uint8_t r[9*SIZE];
int i;
uint8_t state[10]= {0};
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
ff_init_range_encoder(&c, b, SIZE);
ff_build_rac_states(&c, 0.05*(1LL<<32), 128+64+32+16);
memset(state, 128, sizeof(state));
for(i=0; i<SIZE; i++){
- r[i]= random()%7;
+ r[i] = av_lfg_get(&prn) % 7;
}
for(i=0; i<SIZE; i++){
#undef malloc
#undef free
#undef printf
-#undef random
+
+#include "libavutil/lfg.h"
int main(void){
int width=256;
int i;
s.spatial_decomposition_count=6;
s.spatial_decomposition_type=1;
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
printf("testing 5/3 DWT\n");
for(i=0; i<width*height; i++)
- buffer[0][i]= buffer[1][i]= random()%54321 - 12345;
+ buffer[0][i] = buffer[1][i] = av_lfg_get(&prn) % 54321 - 12345;
ff_spatial_dwt(buffer[0], width, height, width, s.spatial_decomposition_type, s.spatial_decomposition_count);
ff_spatial_idwt(buffer[0], width, height, width, s.spatial_decomposition_type, s.spatial_decomposition_count);
printf("testing 9/7 DWT\n");
s.spatial_decomposition_type=0;
for(i=0; i<width*height; i++)
- buffer[0][i]= buffer[1][i]= random()%54321 - 12345;
+ buffer[0][i] = buffer[1][i] = av_lfg_get(&prn) % 54321 - 12345;
ff_spatial_dwt(buffer[0], width, height, width, s.spatial_decomposition_type, s.spatial_decomposition_count);
ff_spatial_idwt(buffer[0], width, height, width, s.spatial_decomposition_type, s.spatial_decomposition_count);
}
#ifdef TEST
+#include "lfg.h"
#include "log.h"
-#undef random
-
int main(void){
int i,j;
AVAES ae, ad, b;
{0x73, 0x22, 0x81, 0xc0, 0xa0, 0xaa, 0xb8, 0xf7, 0xa5, 0x4a, 0x0c, 0x67, 0xa0, 0xc4, 0x5e, 0xcf},
{0x6d, 0x25, 0x1e, 0x69, 0x44, 0xb0, 0x51, 0xe0, 0x4e, 0xaa, 0x6f, 0xb4, 0xdb, 0xf7, 0x84, 0x65}};
uint8_t temp[16];
+ AVLFG prn;
av_aes_init(&ae, "PI=3.141592654..", 128, 0);
av_aes_init(&ad, "PI=3.141592654..", 128, 1);
av_log_set_level(AV_LOG_DEBUG);
+ av_lfg_init(&prn, 1);
for(i=0; i<2; i++){
av_aes_init(&b, rkey[i], 128, 1);
for(i=0; i<10000; i++){
for(j=0; j<16; j++){
- pt[j]= random();
+ pt[j] = av_lfg_get(&prn);
}
{START_TIMER
av_aes_crypt(&ae, temp, pt, 1, NULL, 0);
#ifdef TEST
#undef printf
-#undef random
#include <stdio.h>
#include <stdlib.h>
+#include "lfg.h"
int main(void){
PCA *pca;
#define LEN 8
double eigenvector[LEN*LEN];
double eigenvalue[LEN];
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
pca= ff_pca_init(LEN);
for(i=0; i<9000000; i++){
double v[2*LEN+100];
double sum=0;
- int pos= random()%LEN;
- int v2= (random()%101) - 50;
- v[0]= (random()%101) - 50;
+ int pos = av_lfg_get(&prn) % LEN;
+ int v2 = av_lfg_get(&prn) % 101 - 50;
+ v[0] = av_lfg_get(&prn) % 101 - 50;
for(j=1; j<8; j++){
if(j<=pos) v[j]= v[0];
else v[j]= v2;
/* for(j=0; j<LEN; j++){
v[j] -= v[pos];
}*/
-// sum += random()%10;
+// sum += av_lfg_get(&prn) % 10;
/* for(j=0; j<LEN; j++){
v[j] -= sum/LEN;
}*/
#endif
#ifdef TEST
-#undef random
+
+#include "lfg.h"
+
static int check(AVTreeNode *t){
if(t){
int left= check(t->child[0]);
int main(void){
int i,k;
AVTreeNode *root= NULL, *node=NULL;
+ AVLFG prn;
+
+ av_lfg_init(&prn, 1);
for(i=0; i<10000; i++){
- int j= (random()%86294);
+ int j = av_lfg_get(&prn) % 86294;
if(check(root) > 999){
av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
print(root, 0);
node= av_mallocz(av_tree_node_size);
av_tree_insert(&root, (void*)(j+1), cmp, &node);
- j= (random()%86294);
+ j = av_lfg_get(&prn) % 86294;
{
AVTreeNode *node2=NULL;
av_log(NULL, AV_LOG_ERROR, "removing %4d\n", j);