div64.c 1.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354
  1. /*
  2. * Copyright (C) 2003 Bernardo Innocenti <bernie@develer.com>
  3. *
  4. * Based on former do_div() implementation from asm-parisc/div64.h:
  5. * Copyright (C) 1999 Hewlett-Packard Co
  6. * Copyright (C) 1999 David Mosberger-Tang <davidm@hpl.hp.com>
  7. *
  8. *
  9. * Generic C version of 64bit/32bit division and modulo, with
  10. * 64bit result and 32bit remainder.
  11. *
  12. * The fast case for (n>>32 == 0) is handled inline by do_div().
  13. *
  14. * Code generated for this function might be very inefficient
  15. * for some CPUs. __div64_32() can be overridden by linking arch-specific
  16. * assembly versions such as arch/ppc/lib/div64.S and arch/sh/lib/div64.S.
  17. */
  18. #include <linux/types.h>
  19. #include <asm/div64.h>
  20. uint32_t __div64_32(uint64_t *n, uint32_t base)
  21. {
  22. uint64_t rem = *n;
  23. uint64_t b = base;
  24. uint64_t res, d = 1;
  25. uint32_t high = rem >> 32;
  26. /* Reduce the thing a bit first */
  27. res = 0;
  28. if (high >= base) {
  29. high /= base;
  30. res = (uint64_t) high << 32;
  31. rem -= (uint64_t) (high*base) << 32;
  32. }
  33. while ((int64_t)b > 0 && b < rem) {
  34. b = b+b;
  35. d = d+d;
  36. }
  37. do {
  38. if (rem >= b) {
  39. rem -= b;
  40. res += d;
  41. }
  42. b >>= 1;
  43. d >>= 1;
  44. } while (d);
  45. *n = res;
  46. return rem;
  47. }