The new code is faster and reuses the previous state in case of multiple calls. The previous code could easily end up in near-infinite loops, if the difference between two clock() calls never was larger than 1. This makes fate-parseutils finish in finite time when run in wine, if CryptGenRandom isn't available (which e.g. isn't available if targeting Windows RT/metro). Patch originally by Michael Niedermayer but with some modifications by Martin Storsjö. Signed-off-by: Martin Storsjö <martin@martin.st> |
||
|---|---|---|
| .. | ||
| Makefile | ||
| config_bfin.h | ||
| dsputil_bfin.c | ||
| dsputil_bfin.h | ||
| fdct_bfin.S | ||
| hpel_pixels_bfin.S | ||
| hpeldsp_bfin.c | ||
| hpeldsp_bfin.h | ||
| idct_bfin.S | ||
| mathops.h | ||
| pixels_bfin.S | ||
| vp3_bfin.c | ||
| vp3_bfin.h | ||
| vp3_idct_bfin.S | ||