2
0

lfg.c 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
  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. #include <inttypes.h>
  22. #include <limits.h>
  23. #include <math.h>
  24. #include "lfg.h"
  25. #include "crc.h"
  26. #include "md5.h"
  27. #include "error.h"
  28. #include "intreadwrite.h"
  29. #include "attributes.h"
  30. av_cold void av_lfg_init(AVLFG *c, unsigned int seed)
  31. {
  32. uint8_t tmp[16] = { 0 };
  33. int i;
  34. for (i = 8; i < 64; i += 4) {
  35. AV_WL32(tmp, seed);
  36. tmp[4] = i;
  37. av_md5_sum(tmp, tmp, 16);
  38. c->state[i ] = AV_RL32(tmp);
  39. c->state[i + 1] = AV_RL32(tmp + 4);
  40. c->state[i + 2] = AV_RL32(tmp + 8);
  41. c->state[i + 3] = AV_RL32(tmp + 12);
  42. }
  43. c->index = 0;
  44. }
  45. void av_bmg_get(AVLFG *lfg, double out[2])
  46. {
  47. double x1, x2, w;
  48. do {
  49. x1 = 2.0 / UINT_MAX * av_lfg_get(lfg) - 1.0;
  50. x2 = 2.0 / UINT_MAX * av_lfg_get(lfg) - 1.0;
  51. w = x1 * x1 + x2 * x2;
  52. } while (w >= 1.0);
  53. w = sqrt((-2.0 * log(w)) / w);
  54. out[0] = x1 * w;
  55. out[1] = x2 * w;
  56. }
  57. int av_lfg_init_from_data(AVLFG *c, const uint8_t *data, unsigned int length) {
  58. unsigned int beg, end, segm;
  59. const AVCRC *avcrc;
  60. uint32_t crc = 1;
  61. /* avoid integer overflow in the loop below. */
  62. if (length > (UINT_MAX / 128U)) return AVERROR(EINVAL);
  63. c->index = 0;
  64. avcrc = av_crc_get_table(AV_CRC_32_IEEE); /* This can't fail. It's a well-defined table in crc.c */
  65. /* across 64 segments of the incoming data,
  66. * do a running crc of each segment and store the crc as the state for that slot.
  67. * this works even if the length of the segment is 0 bytes. */
  68. beg = 0;
  69. for (segm = 0;segm < 64;segm++) {
  70. end = (((segm + 1) * length) / 64);
  71. crc = av_crc(avcrc, crc, data + beg, end - beg);
  72. c->state[segm] = (unsigned int)crc;
  73. beg = end;
  74. }
  75. return 0;
  76. }