util_uint128.h 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. /*
  2. * Copyright (c) 2023 Lain Bailey <[email protected]>
  3. *
  4. * Permission to use, copy, modify, and distribute this software for any
  5. * purpose with or without fee is hereby granted, provided that the above
  6. * copyright notice and this permission notice appear in all copies.
  7. *
  8. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  9. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  10. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  11. * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  12. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  13. * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  14. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  15. */
  16. #pragma once
  17. struct util_uint128 {
  18. union {
  19. uint32_t i32[4];
  20. struct {
  21. uint64_t low;
  22. uint64_t high;
  23. };
  24. };
  25. };
  26. typedef struct util_uint128 util_uint128_t;
  27. static inline util_uint128_t util_add128(util_uint128_t a, util_uint128_t b)
  28. {
  29. util_uint128_t out;
  30. uint64_t val;
  31. val = (a.low & 0xFFFFFFFFULL) + (b.low & 0xFFFFFFFFULL);
  32. out.i32[0] = (uint32_t)(val & 0xFFFFFFFFULL);
  33. val >>= 32;
  34. val += (a.low >> 32) + (b.low >> 32);
  35. out.i32[1] = (uint32_t)val;
  36. val >>= 32;
  37. val += (a.high & 0xFFFFFFFFULL) + (b.high & 0xFFFFFFFFULL);
  38. out.i32[2] = (uint32_t)(val & 0xFFFFFFFFULL);
  39. val >>= 32;
  40. val += (a.high >> 32) + (b.high >> 32);
  41. out.i32[3] = (uint32_t)val;
  42. return out;
  43. }
  44. static inline util_uint128_t util_lshift64_internal_32(uint64_t a)
  45. {
  46. util_uint128_t val;
  47. val.low = a << 32;
  48. val.high = a >> 32;
  49. return val;
  50. }
  51. static inline util_uint128_t util_lshift64_internal_64(uint64_t a)
  52. {
  53. util_uint128_t val;
  54. val.low = 0;
  55. val.high = a;
  56. return val;
  57. }
  58. static inline util_uint128_t util_mul64_64(uint64_t a, uint64_t b)
  59. {
  60. util_uint128_t out;
  61. uint64_t m;
  62. m = (a & 0xFFFFFFFFULL) * (b & 0xFFFFFFFFULL);
  63. out.low = m;
  64. out.high = 0;
  65. m = (a >> 32) * (b & 0xFFFFFFFFULL);
  66. out = util_add128(out, util_lshift64_internal_32(m));
  67. m = (a & 0xFFFFFFFFULL) * (b >> 32);
  68. out = util_add128(out, util_lshift64_internal_32(m));
  69. m = (a >> 32) * (b >> 32);
  70. out = util_add128(out, util_lshift64_internal_64(m));
  71. return out;
  72. }
  73. static inline util_uint128_t util_div128_32(util_uint128_t a, uint32_t b)
  74. {
  75. util_uint128_t out;
  76. uint64_t val = 0;
  77. for (int i = 3; i >= 0; i--) {
  78. val = (val << 32) | a.i32[i];
  79. if (val < b) {
  80. out.i32[i] = 0;
  81. continue;
  82. }
  83. out.i32[i] = (uint32_t)(val / b);
  84. val = val % b;
  85. }
  86. return out;
  87. }