drand48-iter.c 1.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
  1. /* Copyright (C) 1995, 1996, 2001 Free Software Foundation, Inc.
  2. This file is part of the GNU C Library.
  3. Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>, August 1995.
  4. The GNU C Library is free software; you can redistribute it and/or
  5. modify it under the terms of the GNU Lesser General Public
  6. License as published by the Free Software Foundation; either
  7. version 2.1 of the License, or (at your option) any later version.
  8. The GNU C Library is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. Lesser General Public License for more details.
  12. You should have received a copy of the GNU Lesser General Public
  13. License along with the GNU C Library; if not, write to the Free
  14. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  15. 02111-1307 USA. */
  16. #include <errno.h>
  17. #include <stdlib.h>
  18. #include <limits.h>
  19. #include <stdint.h>
  20. #include <sys/types.h>
  21. /* Global state for non-reentrant functions. */
  22. struct drand48_data __libc_drand48_data attribute_hidden;
  23. int __drand48_iterate (unsigned short int xsubi[3], struct drand48_data *buffer) attribute_hidden;
  24. int
  25. __drand48_iterate (xsubi, buffer)
  26. unsigned short int xsubi[3];
  27. struct drand48_data *buffer;
  28. {
  29. uint64_t X;
  30. uint64_t result;
  31. /* Initialize buffer, if not yet done. */
  32. if (unlikely(!buffer->__init))
  33. {
  34. buffer->__a = 0x5deece66dull;
  35. buffer->__c = 0xb;
  36. buffer->__init = 1;
  37. }
  38. /* Do the real work. We choose a data type which contains at least
  39. 48 bits. Because we compute the modulus it does not care how
  40. many bits really are computed. */
  41. X = (uint64_t) xsubi[2] << 32 | (uint32_t) xsubi[1] << 16 | xsubi[0];
  42. result = X * buffer->__a + buffer->__c;
  43. xsubi[0] = result & 0xffff;
  44. xsubi[1] = (result >> 16) & 0xffff;
  45. xsubi[2] = (result >> 32) & 0xffff;
  46. return 0;
  47. }