bits.odin 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. package bits
  2. import "core:os"
  3. U8_MIN :: 0;
  4. U16_MIN :: 0;
  5. U32_MIN :: 0;
  6. U64_MIN :: 0;
  7. U8_MAX :: 1 << 8 - 1;
  8. U16_MAX :: 1 << 16 - 1;
  9. U32_MAX :: 1 << 32 - 1;
  10. U64_MAX :: 1 << 64 - 1;
  11. I8_MIN :: - 1 << 7;
  12. I16_MIN :: - 1 << 15;
  13. I32_MIN :: - 1 << 31;
  14. I64_MIN :: - 1 << 63;
  15. I8_MAX :: 1 << 7 - 1;
  16. I16_MAX :: 1 << 15 - 1;
  17. I32_MAX :: 1 << 31 - 1;
  18. I64_MAX :: 1 << 63 - 1;
  19. foreign {
  20. @(link_name="llvm.ctpop.i8") count_ones8 :: proc(i: u8) -> u8 ---
  21. @(link_name="llvm.ctpop.i16") count_ones16 :: proc(i: u16) -> u16 ---
  22. @(link_name="llvm.ctpop.i32") count_ones32 :: proc(i: u32) -> u32 ---
  23. @(link_name="llvm.ctpop.i64") count_ones64 :: proc(i: u64) -> u64 ---
  24. @(link_name="llvm.ctlz.i8") leading_zeros8 :: proc(i: u8, is_zero_undef := false) -> u8 ---
  25. @(link_name="llvm.ctlz.i16") leading_zeros16 :: proc(i: u16, is_zero_undef := false) -> u16 ---
  26. @(link_name="llvm.ctlz.i32") leading_zeros32 :: proc(i: u32, is_zero_undef := false) -> u32 ---
  27. @(link_name="llvm.ctlz.i64") leading_zeros64 :: proc(i: u64, is_zero_undef := false) -> u64 ---
  28. @(link_name="llvm.cttz.i8") trailing_zeros8 :: proc(i: u8, is_zero_undef := false) -> u8 ---
  29. @(link_name="llvm.cttz.i16") trailing_zeros16 :: proc(i: u16, is_zero_undef := false) -> u16 ---
  30. @(link_name="llvm.cttz.i32") trailing_zeros32 :: proc(i: u32, is_zero_undef := false) -> u32 ---
  31. @(link_name="llvm.cttz.i64") trailing_zeros64 :: proc(i: u64, is_zero_undef := false) -> u64 ---
  32. @(link_name="llvm.bitreverse.i8") reverse_bits8 :: proc(i: u8) -> u8 ---
  33. @(link_name="llvm.bitreverse.i16") reverse_bits16 :: proc(i: u16) -> u16 ---
  34. @(link_name="llvm.bitreverse.i32") reverse_bits32 :: proc(i: u32) -> u32 ---
  35. @(link_name="llvm.bitreverse.i64") reverse_bits64 :: proc(i: u64) -> u64 ---
  36. @(link_name="llvm.bswap.i16") byte_swap_u16 :: proc(u16) -> u16 ---
  37. @(link_name="llvm.bswap.i32") byte_swap_u32 :: proc(u32) -> u32 ---
  38. @(link_name="llvm.bswap.i64") byte_swap_u64 :: proc(u64) -> u64 ---
  39. @(link_name="llvm.bswap.i16") byte_swap_i16 :: proc(i16) -> i16 ---
  40. @(link_name="llvm.bswap.i32") byte_swap_i32 :: proc(i32) -> i32 ---
  41. @(link_name="llvm.bswap.i64") byte_swap_i64 :: proc(i64) -> i64 ---
  42. }
  43. byte_swap_uint :: proc(i: uint) -> uint {
  44. when size_of(uint) == size_of(u32) {
  45. return uint(byte_swap_u32(u32(i)));
  46. } else {
  47. return uint(byte_swap_u64(u64(i)));
  48. }
  49. }
  50. byte_swap_int :: proc(i: int) -> int {
  51. when size_of(int) == size_of(i32) {
  52. return int(byte_swap_i32(i32(i)));
  53. } else {
  54. return int(byte_swap_i64(i64(i)));
  55. }
  56. }
  57. byte_swap :: proc[
  58. byte_swap_u16,
  59. byte_swap_u32,
  60. byte_swap_u64,
  61. byte_swap_i16,
  62. byte_swap_i32,
  63. byte_swap_i64,
  64. byte_swap_uint,
  65. byte_swap_int,
  66. ];
  67. count_zeros8 :: proc(i: u8) -> u8 { return 8 - count_ones8(i); }
  68. count_zeros16 :: proc(i: u16) -> u16 { return 16 - count_ones16(i); }
  69. count_zeros32 :: proc(i: u32) -> u32 { return 32 - count_ones32(i); }
  70. count_zeros64 :: proc(i: u64) -> u64 { return 64 - count_ones64(i); }
  71. rotate_left8 :: proc(i: u8, s: uint) -> u8 { return (i << s)|(i >> (8*size_of(u8) - s)); }
  72. rotate_left16 :: proc(i: u16, s: uint) -> u16 { return (i << s)|(i >> (8*size_of(u16) - s)); }
  73. rotate_left32 :: proc(i: u32, s: uint) -> u32 { return (i << s)|(i >> (8*size_of(u32) - s)); }
  74. rotate_left64 :: proc(i: u64, s: uint) -> u64 { return (i << s)|(i >> (8*size_of(u64) - s)); }
  75. rotate_right8 :: proc(i: u8, s: uint) -> u8 { return (i >> s)|(i << (8*size_of(u8) - s)); }
  76. rotate_right16 :: proc(i: u16, s: uint) -> u16 { return (i >> s)|(i << (8*size_of(u16) - s)); }
  77. rotate_right32 :: proc(i: u32, s: uint) -> u32 { return (i >> s)|(i << (8*size_of(u32) - s)); }
  78. rotate_right64 :: proc(i: u64, s: uint) -> u64 { return (i >> s)|(i << (8*size_of(u64) - s)); }
  79. from_be_u8 :: proc(i: u8) -> u8 { return i; }
  80. from_be_u16 :: proc(i: u16) -> u16 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  81. from_be_u32 :: proc(i: u32) -> u32 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  82. from_be_u64 :: proc(i: u64) -> u64 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  83. from_be_uint :: proc(i: uint) -> uint { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  84. from_le_u8 :: proc(i: u8) -> u8 { return i; }
  85. from_le_u16 :: proc(i: u16) -> u16 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  86. from_le_u32 :: proc(i: u32) -> u32 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  87. from_le_u64 :: proc(i: u64) -> u64 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  88. from_le_uint :: proc(i: uint) -> uint { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  89. to_be_u8 :: proc(i: u8) -> u8 { return i; }
  90. to_be_u16 :: proc(i: u16) -> u16 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  91. to_be_u32 :: proc(i: u32) -> u32 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  92. to_be_u64 :: proc(i: u64) -> u64 { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  93. to_be_uint :: proc(i: uint) -> uint { when os.ENDIAN == "big" { return i; } else { return byte_swap(i); } }
  94. to_le_u8 :: proc(i: u8) -> u8 { return i; }
  95. to_le_u16 :: proc(i: u16) -> u16 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  96. to_le_u32 :: proc(i: u32) -> u32 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  97. to_le_u64 :: proc(i: u64) -> u64 { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  98. to_le_uint :: proc(i: uint) -> uint { when os.ENDIAN == "little" { return i; } else { return byte_swap(i); } }
  99. foreign {
  100. @(link_name="llvm.uadd.with.overflow.i8") overflowing_add_u8 :: proc(lhs, rhs: u8) -> (u8, bool) ---
  101. @(link_name="llvm.sadd.with.overflow.i8") overflowing_add_i8 :: proc(lhs, rhs: i8) -> (i8, bool) ---
  102. @(link_name="llvm.uadd.with.overflow.i16") overflowing_add_u16 :: proc(lhs, rhs: u16) -> (u16, bool) ---
  103. @(link_name="llvm.sadd.with.overflow.i16") overflowing_add_i16 :: proc(lhs, rhs: i16) -> (i16, bool) ---
  104. @(link_name="llvm.uadd.with.overflow.i32") overflowing_add_u32 :: proc(lhs, rhs: u32) -> (u32, bool) ---
  105. @(link_name="llvm.sadd.with.overflow.i32") overflowing_add_i32 :: proc(lhs, rhs: i32) -> (i32, bool) ---
  106. @(link_name="llvm.uadd.with.overflow.i64") overflowing_add_u64 :: proc(lhs, rhs: u64) -> (u64, bool) ---
  107. @(link_name="llvm.sadd.with.overflow.i64") overflowing_add_i64 :: proc(lhs, rhs: i64) -> (i64, bool) ---
  108. }
  109. overflowing_add_uint :: proc(lhs, rhs: uint) -> (uint, bool) {
  110. when size_of(uint) == size_of(u32) {
  111. x, ok := overflowing_add_u32(u32(lhs), u32(rhs));
  112. return uint(x), ok;
  113. } else {
  114. x, ok := overflowing_add_u64(u64(lhs), u64(rhs));
  115. return uint(x), ok;
  116. }
  117. }
  118. overflowing_add_int :: proc(lhs, rhs: int) -> (int, bool) {
  119. when size_of(int) == size_of(i32) {
  120. x, ok := overflowing_add_i32(i32(lhs), i32(rhs));
  121. return int(x), ok;
  122. } else {
  123. x, ok := overflowing_add_i64(i64(lhs), i64(rhs));
  124. return int(x), ok;
  125. }
  126. }
  127. overflowing_add :: proc[
  128. overflowing_add_u8, overflowing_add_i8,
  129. overflowing_add_u16, overflowing_add_i16,
  130. overflowing_add_u32, overflowing_add_i32,
  131. overflowing_add_u64, overflowing_add_i64,
  132. overflowing_add_uint, overflowing_add_int,
  133. ];
  134. foreign {
  135. @(link_name="llvm.usub.with.overflow.i8") overflowing_sub_u8 :: proc(lhs, rhs: u8) -> (u8, bool) ---
  136. @(link_name="llvm.ssub.with.overflow.i8") overflowing_sub_i8 :: proc(lhs, rhs: i8) -> (i8, bool) ---
  137. @(link_name="llvm.usub.with.overflow.i16") overflowing_sub_u16 :: proc(lhs, rhs: u16) -> (u16, bool) ---
  138. @(link_name="llvm.ssub.with.overflow.i16") overflowing_sub_i16 :: proc(lhs, rhs: i16) -> (i16, bool) ---
  139. @(link_name="llvm.usub.with.overflow.i32") overflowing_sub_u32 :: proc(lhs, rhs: u32) -> (u32, bool) ---
  140. @(link_name="llvm.ssub.with.overflow.i32") overflowing_sub_i32 :: proc(lhs, rhs: i32) -> (i32, bool) ---
  141. @(link_name="llvm.usub.with.overflow.i64") overflowing_sub_u64 :: proc(lhs, rhs: u64) -> (u64, bool) ---
  142. @(link_name="llvm.ssub.with.overflow.i64") overflowing_sub_i64 :: proc(lhs, rhs: i64) -> (i64, bool) ---
  143. }
  144. overflowing_sub_uint :: proc(lhs, rhs: uint) -> (uint, bool) {
  145. when size_of(uint) == size_of(u32) {
  146. x, ok := overflowing_sub_u32(u32(lhs), u32(rhs));
  147. return uint(x), ok;
  148. } else {
  149. x, ok := overflowing_sub_u64(u64(lhs), u64(rhs));
  150. return uint(x), ok;
  151. }
  152. }
  153. overflowing_sub_int :: proc(lhs, rhs: int) -> (int, bool) {
  154. when size_of(int) == size_of(i32) {
  155. x, ok := overflowing_sub_i32(i32(lhs), i32(rhs));
  156. return int(x), ok;
  157. } else {
  158. x, ok := overflowing_sub_i64(i64(lhs), i64(rhs));
  159. return int(x), ok;
  160. }
  161. }
  162. overflowing_sub :: proc[
  163. overflowing_sub_u8, overflowing_sub_i8,
  164. overflowing_sub_u16, overflowing_sub_i16,
  165. overflowing_sub_u32, overflowing_sub_i32,
  166. overflowing_sub_u64, overflowing_sub_i64,
  167. overflowing_sub_uint, overflowing_sub_int,
  168. ];
  169. foreign {
  170. @(link_name="llvm.umul.with.overflow.i8") overflowing_mul_u8 :: proc(lhs, rhs: u8) -> (u8, bool) ---
  171. @(link_name="llvm.smul.with.overflow.i8") overflowing_mul_i8 :: proc(lhs, rhs: i8) -> (i8, bool) ---
  172. @(link_name="llvm.umul.with.overflow.i16") overflowing_mul_u16 :: proc(lhs, rhs: u16) -> (u16, bool) ---
  173. @(link_name="llvm.smul.with.overflow.i16") overflowing_mul_i16 :: proc(lhs, rhs: i16) -> (i16, bool) ---
  174. @(link_name="llvm.umul.with.overflow.i32") overflowing_mul_u32 :: proc(lhs, rhs: u32) -> (u32, bool) ---
  175. @(link_name="llvm.smul.with.overflow.i32") overflowing_mul_i32 :: proc(lhs, rhs: i32) -> (i32, bool) ---
  176. @(link_name="llvm.umul.with.overflow.i64") overflowing_mul_u64 :: proc(lhs, rhs: u64) -> (u64, bool) ---
  177. @(link_name="llvm.smul.with.overflow.i64") overflowing_mul_i64 :: proc(lhs, rhs: i64) -> (i64, bool) ---
  178. }
  179. overflowing_mul_uint :: proc(lhs, rhs: uint) -> (uint, bool) {
  180. when size_of(uint) == size_of(u32) {
  181. x, ok := overflowing_mul_u32(u32(lhs), u32(rhs));
  182. return uint(x), ok;
  183. } else {
  184. x, ok := overflowing_mul_u64(u64(lhs), u64(rhs));
  185. return uint(x), ok;
  186. }
  187. }
  188. overflowing_mul_int :: proc(lhs, rhs: int) -> (int, bool) {
  189. when size_of(int) == size_of(i32) {
  190. x, ok := overflowing_mul_i32(i32(lhs), i32(rhs));
  191. return int(x), ok;
  192. } else {
  193. x, ok := overflowing_mul_i64(i64(lhs), i64(rhs));
  194. return int(x), ok;
  195. }
  196. }
  197. overflowing_mul :: proc[
  198. overflowing_mul_u8, overflowing_mul_i8,
  199. overflowing_mul_u16, overflowing_mul_i16,
  200. overflowing_mul_u32, overflowing_mul_i32,
  201. overflowing_mul_u64, overflowing_mul_i64,
  202. overflowing_mul_uint, overflowing_mul_int,
  203. ];
  204. is_power_of_two_u8 :: proc(i: u8) -> bool { return i > 0 && (i & (i-1)) == 0; }
  205. is_power_of_two_i8 :: proc(i: i8) -> bool { return i > 0 && (i & (i-1)) == 0; }
  206. is_power_of_two_u16 :: proc(i: u16) -> bool { return i > 0 && (i & (i-1)) == 0; }
  207. is_power_of_two_i16 :: proc(i: i16) -> bool { return i > 0 && (i & (i-1)) == 0; }
  208. is_power_of_two_u32 :: proc(i: u32) -> bool { return i > 0 && (i & (i-1)) == 0; }
  209. is_power_of_two_i32 :: proc(i: i32) -> bool { return i > 0 && (i & (i-1)) == 0; }
  210. is_power_of_two_u64 :: proc(i: u64) -> bool { return i > 0 && (i & (i-1)) == 0; }
  211. is_power_of_two_i64 :: proc(i: i64) -> bool { return i > 0 && (i & (i-1)) == 0; }
  212. is_power_of_two_uint :: proc(i: uint) -> bool { return i > 0 && (i & (i-1)) == 0; }
  213. is_power_of_two_int :: proc(i: int) -> bool { return i > 0 && (i & (i-1)) == 0; }
  214. is_power_of_two :: proc[
  215. is_power_of_two_u8, is_power_of_two_i8,
  216. is_power_of_two_u16, is_power_of_two_i16,
  217. is_power_of_two_u32, is_power_of_two_i32,
  218. is_power_of_two_u64, is_power_of_two_i64,
  219. is_power_of_two_uint, is_power_of_two_int,
  220. ]