bits.odin 14 KB

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