You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

117 lines
3.1KB

  1. /*
  2. * Copyright (c) 2009 Baptiste Coudurier <baptiste.coudurier@gmail.com>
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * Libav is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with Libav; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #include "config.h"
  21. #if HAVE_UNISTD_H
  22. #include <unistd.h>
  23. #endif
  24. #if HAVE_BCRYPT
  25. #include <windows.h>
  26. #include <bcrypt.h>
  27. #endif
  28. #include <fcntl.h>
  29. #include <math.h>
  30. #include <time.h>
  31. #include "internal.h"
  32. #include "intreadwrite.h"
  33. #include "mem.h"
  34. #include "timer.h"
  35. #include "random_seed.h"
  36. #include "sha.h"
  37. static int read_random(uint32_t *dst, const char *file)
  38. {
  39. #if HAVE_UNISTD_H
  40. int fd = avpriv_open(file, O_RDONLY);
  41. int err = -1;
  42. if (fd == -1)
  43. return -1;
  44. err = read(fd, dst, sizeof(*dst));
  45. close(fd);
  46. return err;
  47. #else
  48. return -1;
  49. #endif
  50. }
  51. static uint32_t get_generic_seed(void)
  52. {
  53. struct AVSHA *sha = av_sha_alloc();
  54. clock_t last_t = 0;
  55. static uint64_t i = 0;
  56. static uint32_t buffer[512] = { 0 };
  57. unsigned char digest[20];
  58. uint64_t last_i = i;
  59. for (;;) {
  60. clock_t t = clock();
  61. if (last_t == t) {
  62. buffer[i & 511]++;
  63. } else {
  64. buffer[++i & 511] += (t - last_t) % 3294638521U;
  65. if (last_i && i - last_i > 4 || i - last_i > 64)
  66. break;
  67. }
  68. last_t = t;
  69. }
  70. if (!sha) {
  71. uint32_t seed = 0;
  72. int j;
  73. // Unable to allocate an SHA context, just XOR the buffer together
  74. // to create something hopefully unique.
  75. for (j = 0; j < 512; j++)
  76. seed ^= buffer[j];
  77. return seed;
  78. }
  79. av_sha_init(sha, 160);
  80. av_sha_update(sha, (const uint8_t *) buffer, sizeof(buffer));
  81. av_sha_final(sha, digest);
  82. av_free(sha);
  83. return AV_RB32(digest) + AV_RB32(digest + 16);
  84. }
  85. uint32_t av_get_random_seed(void)
  86. {
  87. uint32_t seed;
  88. #if HAVE_BCRYPT
  89. BCRYPT_ALG_HANDLE algo_handle;
  90. NTSTATUS ret = BCryptOpenAlgorithmProvider(&algo_handle, BCRYPT_RNG_ALGORITHM,
  91. MS_PRIMITIVE_PROVIDER, 0);
  92. if (BCRYPT_SUCCESS(ret)) {
  93. NTSTATUS ret = BCryptGenRandom(algo_handle, (UCHAR*)&seed, sizeof(seed), 0);
  94. BCryptCloseAlgorithmProvider(algo_handle, 0);
  95. if (BCRYPT_SUCCESS(ret))
  96. return seed;
  97. }
  98. #endif
  99. if (read_random(&seed, "/dev/urandom") == sizeof(seed))
  100. return seed;
  101. if (read_random(&seed, "/dev/random") == sizeof(seed))
  102. return seed;
  103. return get_generic_seed();
  104. }