bits.odin 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524
  1. package math_bits
  2. import "base:intrinsics"
  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. count_ones :: intrinsics.count_ones
  20. count_zeros :: intrinsics.count_zeros
  21. trailing_zeros :: intrinsics.count_trailing_zeros
  22. leading_zeros :: intrinsics.count_leading_zeros
  23. count_trailing_zeros :: intrinsics.count_trailing_zeros
  24. count_leading_zeros :: intrinsics.count_leading_zeros
  25. reverse_bits :: intrinsics.reverse_bits
  26. byte_swap :: intrinsics.byte_swap
  27. overflowing_add :: intrinsics.overflow_add
  28. overflowing_sub :: intrinsics.overflow_sub
  29. overflowing_mul :: intrinsics.overflow_mul
  30. @(require_results)
  31. log2 :: proc "contextless" (x: $T) -> T where intrinsics.type_is_integer(T), intrinsics.type_is_unsigned(T) {
  32. return (8*size_of(T)-1) - count_leading_zeros(x)
  33. }
  34. @(require_results)
  35. rotate_left8 :: proc "contextless" (x: u8, k: int) -> u8 {
  36. n :: 8
  37. s := uint(k) & (n-1)
  38. return x <<s | x>>(n-s)
  39. }
  40. @(require_results)
  41. rotate_left16 :: proc "contextless" (x: u16, k: int) -> u16 {
  42. n :: 16
  43. s := uint(k) & (n-1)
  44. return x <<s | x>>(n-s)
  45. }
  46. @(require_results)
  47. rotate_left32 :: proc "contextless" (x: u32, k: int) -> u32 {
  48. n :: 32
  49. s := uint(k) & (n-1)
  50. return x <<s | x>>(n-s)
  51. }
  52. @(require_results)
  53. rotate_left64 :: proc "contextless" (x: u64, k: int) -> u64 {
  54. n :: 64
  55. s := uint(k) & (n-1)
  56. return x <<s | x>>(n-s)
  57. }
  58. @(require_results)
  59. rotate_left :: proc "contextless" (x: uint, k: int) -> uint {
  60. n :: 8*size_of(uint)
  61. s := uint(k) & (n-1)
  62. return x <<s | x>>(n-s)
  63. }
  64. @(require_results)
  65. from_be_u8 :: proc "contextless" (i: u8) -> u8 { return i }
  66. @(require_results)
  67. from_be_u16 :: proc "contextless" (i: u16) -> u16 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  68. @(require_results)
  69. from_be_u32 :: proc "contextless" (i: u32) -> u32 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  70. @(require_results)
  71. from_be_u64 :: proc "contextless" (i: u64) -> u64 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  72. @(require_results)
  73. from_be_uint :: proc "contextless" (i: uint) -> uint { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  74. @(require_results)
  75. from_le_u8 :: proc "contextless" (i: u8) -> u8 { return i }
  76. @(require_results)
  77. from_le_u16 :: proc "contextless" (i: u16) -> u16 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  78. @(require_results)
  79. from_le_u32 :: proc "contextless" (i: u32) -> u32 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  80. @(require_results)
  81. from_le_u64 :: proc "contextless" (i: u64) -> u64 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  82. @(require_results)
  83. from_le_uint :: proc "contextless" (i: uint) -> uint { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  84. @(require_results)
  85. to_be_u8 :: proc "contextless" (i: u8) -> u8 { return i }
  86. @(require_results)
  87. to_be_u16 :: proc "contextless" (i: u16) -> u16 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  88. @(require_results)
  89. to_be_u32 :: proc "contextless" (i: u32) -> u32 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  90. @(require_results)
  91. to_be_u64 :: proc "contextless" (i: u64) -> u64 { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  92. @(require_results)
  93. to_be_uint :: proc "contextless" (i: uint) -> uint { when ODIN_ENDIAN == .Big { return i } else { return byte_swap(i) } }
  94. @(require_results)
  95. to_le_u8 :: proc "contextless" (i: u8) -> u8 { return i }
  96. @(require_results)
  97. to_le_u16 :: proc "contextless" (i: u16) -> u16 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  98. @(require_results)
  99. to_le_u32 :: proc "contextless" (i: u32) -> u32 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  100. @(require_results)
  101. to_le_u64 :: proc "contextless" (i: u64) -> u64 { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  102. @(require_results)
  103. to_le_uint :: proc "contextless" (i: uint) -> uint { when ODIN_ENDIAN == .Little { return i } else { return byte_swap(i) } }
  104. @(require_results)
  105. len_u8 :: proc "contextless" (x: u8) -> int {
  106. return int(len_u8_table[x])
  107. }
  108. @(require_results)
  109. len_u16 :: proc "contextless" (x: u16) -> (n: int) {
  110. x := x
  111. if x >= 1<<8 {
  112. x >>= 8
  113. n = 8
  114. }
  115. return n + int(len_u8_table[x])
  116. }
  117. @(require_results)
  118. len_u32 :: proc "contextless" (x: u32) -> (n: int) {
  119. x := x
  120. if x >= 1<<16 {
  121. x >>= 16
  122. n = 16
  123. }
  124. if x >= 1<<8 {
  125. x >>= 8
  126. n += 8
  127. }
  128. return n + int(len_u8_table[x])
  129. }
  130. @(require_results)
  131. len_u64 :: proc "contextless" (x: u64) -> (n: int) {
  132. x := x
  133. if x >= 1<<32 {
  134. x >>= 32
  135. n = 32
  136. }
  137. if x >= 1<<16 {
  138. x >>= 16
  139. n += 16
  140. }
  141. if x >= 1<<8 {
  142. x >>= 8
  143. n += 8
  144. }
  145. return n + int(len_u8_table[x])
  146. }
  147. @(require_results)
  148. len_uint :: proc "contextless" (x: uint) -> (n: int) {
  149. when size_of(uint) == size_of(u64) {
  150. return len_u64(u64(x))
  151. } else {
  152. return len_u32(u32(x))
  153. }
  154. }
  155. // returns the minimum number of bits required to represent x
  156. len :: proc{len_u8, len_u16, len_u32, len_u64, len_uint}
  157. @(require_results)
  158. add_u32 :: proc "contextless" (x, y, carry: u32) -> (sum, carry_out: u32) {
  159. tmp_carry, tmp_carry2: bool
  160. sum, tmp_carry = intrinsics.overflow_add(x, y)
  161. sum, tmp_carry2 = intrinsics.overflow_add(sum, carry)
  162. carry_out = u32(tmp_carry | tmp_carry2)
  163. return
  164. }
  165. @(require_results)
  166. add_u64 :: proc "contextless" (x, y, carry: u64) -> (sum, carry_out: u64) {
  167. tmp_carry, tmp_carry2: bool
  168. sum, tmp_carry = intrinsics.overflow_add(x, y)
  169. sum, tmp_carry2 = intrinsics.overflow_add(sum, carry)
  170. carry_out = u64(tmp_carry | tmp_carry2)
  171. return
  172. }
  173. @(require_results)
  174. add_uint :: proc "contextless" (x, y, carry: uint) -> (sum, carry_out: uint) {
  175. when size_of(uint) == size_of(u64) {
  176. a, b := add_u64(u64(x), u64(y), u64(carry))
  177. } else {
  178. #assert(size_of(uint) == size_of(u32))
  179. a, b := add_u32(u32(x), u32(y), u32(carry))
  180. }
  181. return uint(a), uint(b)
  182. }
  183. add :: proc{add_u32, add_u64, add_uint}
  184. @(require_results)
  185. sub_u32 :: proc "contextless" (x, y, borrow: u32) -> (diff, borrow_out: u32) {
  186. tmp_borrow, tmp_borrow2: bool
  187. diff, tmp_borrow = intrinsics.overflow_sub(x, y)
  188. diff, tmp_borrow2 = intrinsics.overflow_sub(diff, borrow)
  189. borrow_out = u32(tmp_borrow | tmp_borrow2)
  190. return
  191. }
  192. @(require_results)
  193. sub_u64 :: proc "contextless" (x, y, borrow: u64) -> (diff, borrow_out: u64) {
  194. tmp_borrow, tmp_borrow2: bool
  195. diff, tmp_borrow = intrinsics.overflow_sub(x, y)
  196. diff, tmp_borrow2 = intrinsics.overflow_sub(diff, borrow)
  197. borrow_out = u64(tmp_borrow | tmp_borrow2)
  198. return
  199. }
  200. @(require_results)
  201. sub_uint :: proc "contextless" (x, y, borrow: uint) -> (diff, borrow_out: uint) {
  202. when size_of(uint) == size_of(u64) {
  203. a, b := sub_u64(u64(x), u64(y), u64(borrow))
  204. } else {
  205. #assert(size_of(uint) == size_of(u32))
  206. a, b := sub_u32(u32(x), u32(y), u32(borrow))
  207. }
  208. return uint(a), uint(b)
  209. }
  210. sub :: proc{sub_u32, sub_u64, sub_uint}
  211. @(require_results)
  212. mul_u32 :: proc "contextless" (x, y: u32) -> (hi, lo: u32) {
  213. z := u64(x) * u64(y)
  214. hi, lo = u32(z>>32), u32(z)
  215. return
  216. }
  217. @(require_results)
  218. mul_u64 :: proc "contextless" (x, y: u64) -> (hi, lo: u64) {
  219. prod_wide := u128(x) * u128(y)
  220. hi, lo = u64(prod_wide>>64), u64(prod_wide)
  221. return
  222. }
  223. @(require_results)
  224. mul_uint :: proc "contextless" (x, y: uint) -> (hi, lo: uint) {
  225. when size_of(uint) == size_of(u32) {
  226. a, b := mul_u32(u32(x), u32(y))
  227. } else {
  228. #assert(size_of(uint) == size_of(u64))
  229. a, b := mul_u64(u64(x), u64(y))
  230. }
  231. return uint(a), uint(b)
  232. }
  233. mul :: proc{mul_u32, mul_u64, mul_uint}
  234. @(require_results)
  235. div_u32 :: proc "odin" (hi, lo, y: u32) -> (quo, rem: u32) {
  236. assert(y != 0 && y <= hi)
  237. z := u64(hi)<<32 | u64(lo)
  238. quo, rem = u32(z/u64(y)), u32(z%u64(y))
  239. return
  240. }
  241. @(require_results)
  242. div_u64 :: proc "odin" (hi, lo, y: u64) -> (quo, rem: u64) {
  243. y := y
  244. two32 :: 1 << 32
  245. mask32 :: two32 - 1
  246. if y == 0 {
  247. panic("divide error")
  248. }
  249. if y <= hi {
  250. panic("overflow error")
  251. }
  252. s := uint(count_leading_zeros(y))
  253. y <<= s
  254. yn1 := y >> 32
  255. yn0 := y & mask32
  256. un32 := hi<<s | lo>>(64-s)
  257. un10 := lo << s
  258. un1 := un10 >> 32
  259. un0 := un10 & mask32
  260. q1 := un32 / yn1
  261. rhat := un32 - q1*yn1
  262. for q1 >= two32 || q1*yn0 > two32*rhat+un1 {
  263. q1 -= 1
  264. rhat += yn1
  265. if rhat >= two32 {
  266. break
  267. }
  268. }
  269. un21 := un32*two32 + un1 - q1*y
  270. q0 := un21 / yn1
  271. rhat = un21 - q0*yn1
  272. for q0 >= two32 || q0*yn0 > two32*rhat+un0 {
  273. q0 -= 1
  274. rhat += yn1
  275. if rhat >= two32 {
  276. break
  277. }
  278. }
  279. return q1*two32 + q0, (un21*two32 + un0 - q0*y) >> s
  280. }
  281. @(require_results)
  282. div_uint :: proc "odin" (hi, lo, y: uint) -> (quo, rem: uint) {
  283. when size_of(uint) == size_of(u32) {
  284. a, b := div_u32(u32(hi), u32(lo), u32(y))
  285. } else {
  286. #assert(size_of(uint) == size_of(u64))
  287. a, b := div_u64(u64(hi), u64(lo), u64(y))
  288. }
  289. return uint(a), uint(b)
  290. }
  291. div :: proc{div_u32, div_u64, div_uint}
  292. @(require_results)
  293. is_power_of_two_u8 :: proc "contextless" (i: u8) -> bool { return i > 0 && (i & (i-1)) == 0 }
  294. @(require_results)
  295. is_power_of_two_i8 :: proc "contextless" (i: i8) -> bool { return i > 0 && (i & (i-1)) == 0 }
  296. @(require_results)
  297. is_power_of_two_u16 :: proc "contextless" (i: u16) -> bool { return i > 0 && (i & (i-1)) == 0 }
  298. @(require_results)
  299. is_power_of_two_i16 :: proc "contextless" (i: i16) -> bool { return i > 0 && (i & (i-1)) == 0 }
  300. @(require_results)
  301. is_power_of_two_u32 :: proc "contextless" (i: u32) -> bool { return i > 0 && (i & (i-1)) == 0 }
  302. @(require_results)
  303. is_power_of_two_i32 :: proc "contextless" (i: i32) -> bool { return i > 0 && (i & (i-1)) == 0 }
  304. @(require_results)
  305. is_power_of_two_u64 :: proc "contextless" (i: u64) -> bool { return i > 0 && (i & (i-1)) == 0 }
  306. @(require_results)
  307. is_power_of_two_i64 :: proc "contextless" (i: i64) -> bool { return i > 0 && (i & (i-1)) == 0 }
  308. @(require_results)
  309. is_power_of_two_uint :: proc "contextless" (i: uint) -> bool { return i > 0 && (i & (i-1)) == 0 }
  310. @(require_results)
  311. is_power_of_two_int :: proc "contextless" (i: int) -> bool { return i > 0 && (i & (i-1)) == 0 }
  312. is_power_of_two :: proc{
  313. is_power_of_two_u8, is_power_of_two_i8,
  314. is_power_of_two_u16, is_power_of_two_i16,
  315. is_power_of_two_u32, is_power_of_two_i32,
  316. is_power_of_two_u64, is_power_of_two_i64,
  317. is_power_of_two_uint, is_power_of_two_int,
  318. }
  319. @private
  320. len_u8_table := [256]u8{
  321. 0 = 0,
  322. 1 = 1,
  323. 2..<4 = 2,
  324. 4..<8 = 3,
  325. 8..<16 = 4,
  326. 16..<32 = 5,
  327. 32..<64 = 6,
  328. 64..<128 = 7,
  329. 128..<256 = 8,
  330. }
  331. @(require_results)
  332. bitfield_extract_u8 :: proc "contextless" (value: u8, offset, bits: uint) -> u8 { return (value >> offset) & u8(1<<bits - 1) }
  333. @(require_results)
  334. bitfield_extract_u16 :: proc "contextless" (value: u16, offset, bits: uint) -> u16 { return (value >> offset) & u16(1<<bits - 1) }
  335. @(require_results)
  336. bitfield_extract_u32 :: proc "contextless" (value: u32, offset, bits: uint) -> u32 { return (value >> offset) & u32(1<<bits - 1) }
  337. @(require_results)
  338. bitfield_extract_u64 :: proc "contextless" (value: u64, offset, bits: uint) -> u64 { return (value >> offset) & u64(1<<bits - 1) }
  339. @(require_results)
  340. bitfield_extract_u128 :: proc "contextless" (value: u128, offset, bits: uint) -> u128 { return (value >> offset) & u128(1<<bits - 1) }
  341. @(require_results)
  342. bitfield_extract_uint :: proc "contextless" (value: uint, offset, bits: uint) -> uint { return (value >> offset) & uint(1<<bits - 1) }
  343. @(require_results)
  344. bitfield_extract_i8 :: proc "contextless" (value: i8, offset, bits: uint) -> i8 {
  345. v := (u8(value) >> offset) & u8(1<<bits - 1)
  346. m := u8(1<<(bits-1))
  347. r := (v~m) - m
  348. return i8(r)
  349. }
  350. @(require_results)
  351. bitfield_extract_i16 :: proc "contextless" (value: i16, offset, bits: uint) -> i16 {
  352. v := (u16(value) >> offset) & u16(1<<bits - 1)
  353. m := u16(1<<(bits-1))
  354. r := (v~m) - m
  355. return i16(r)
  356. }
  357. @(require_results)
  358. bitfield_extract_i32 :: proc "contextless" (value: i32, offset, bits: uint) -> i32 {
  359. v := (u32(value) >> offset) & u32(1<<bits - 1)
  360. m := u32(1<<(bits-1))
  361. r := (v~m) - m
  362. return i32(r)
  363. }
  364. @(require_results)
  365. bitfield_extract_i64 :: proc "contextless" (value: i64, offset, bits: uint) -> i64 {
  366. v := (u64(value) >> offset) & u64(1<<bits - 1)
  367. m := u64(1<<(bits-1))
  368. r := (v~m) - m
  369. return i64(r)
  370. }
  371. @(require_results)
  372. bitfield_extract_i128 :: proc "contextless" (value: i128, offset, bits: uint) -> i128 {
  373. v := (u128(value) >> offset) & u128(1<<bits - 1)
  374. m := u128(1<<(bits-1))
  375. r := (v~m) - m
  376. return i128(r)
  377. }
  378. @(require_results)
  379. bitfield_extract_int :: proc "contextless" (value: int, offset, bits: uint) -> int {
  380. v := (uint(value) >> offset) & uint(1<<bits - 1)
  381. m := uint(1<<(bits-1))
  382. r := (v~m) - m
  383. return int(r)
  384. }
  385. bitfield_extract :: proc{
  386. bitfield_extract_u8,
  387. bitfield_extract_u16,
  388. bitfield_extract_u32,
  389. bitfield_extract_u64,
  390. bitfield_extract_u128,
  391. bitfield_extract_uint,
  392. bitfield_extract_i8,
  393. bitfield_extract_i16,
  394. bitfield_extract_i32,
  395. bitfield_extract_i64,
  396. bitfield_extract_i128,
  397. bitfield_extract_int,
  398. }
  399. @(require_results)
  400. bitfield_insert_u8 :: proc "contextless" (base, insert: u8, offset, bits: uint) -> u8 {
  401. mask := u8(1<<bits - 1)
  402. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  403. }
  404. @(require_results)
  405. bitfield_insert_u16 :: proc "contextless" (base, insert: u16, offset, bits: uint) -> u16 {
  406. mask := u16(1<<bits - 1)
  407. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  408. }
  409. @(require_results)
  410. bitfield_insert_u32 :: proc "contextless" (base, insert: u32, offset, bits: uint) -> u32 {
  411. mask := u32(1<<bits - 1)
  412. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  413. }
  414. @(require_results)
  415. bitfield_insert_u64 :: proc "contextless" (base, insert: u64, offset, bits: uint) -> u64 {
  416. mask := u64(1<<bits - 1)
  417. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  418. }
  419. @(require_results)
  420. bitfield_insert_u128 :: proc "contextless" (base, insert: u128, offset, bits: uint) -> u128 {
  421. mask := u128(1<<bits - 1)
  422. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  423. }
  424. @(require_results)
  425. bitfield_insert_uint :: proc "contextless" (base, insert: uint, offset, bits: uint) -> uint {
  426. mask := uint(1<<bits - 1)
  427. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  428. }
  429. @(require_results)
  430. bitfield_insert_i8 :: proc "contextless" (base, insert: i8, offset, bits: uint) -> i8 {
  431. mask := i8(1<<bits - 1)
  432. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  433. }
  434. @(require_results)
  435. bitfield_insert_i16 :: proc "contextless" (base, insert: i16, offset, bits: uint) -> i16 {
  436. mask := i16(1<<bits - 1)
  437. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  438. }
  439. @(require_results)
  440. bitfield_insert_i32 :: proc "contextless" (base, insert: i32, offset, bits: uint) -> i32 {
  441. mask := i32(1<<bits - 1)
  442. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  443. }
  444. @(require_results)
  445. bitfield_insert_i64 :: proc "contextless" (base, insert: i64, offset, bits: uint) -> i64 {
  446. mask := i64(1<<bits - 1)
  447. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  448. }
  449. @(require_results)
  450. bitfield_insert_i128 :: proc "contextless" (base, insert: i128, offset, bits: uint) -> i128 {
  451. mask := i128(1<<bits - 1)
  452. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  453. }
  454. @(require_results)
  455. bitfield_insert_int :: proc "contextless" (base, insert: int, offset, bits: uint) -> int {
  456. mask := int(1<<bits - 1)
  457. return (base &~ (mask<<offset)) | ((insert&mask) << offset)
  458. }
  459. bitfield_insert :: proc{
  460. bitfield_insert_u8,
  461. bitfield_insert_u16,
  462. bitfield_insert_u32,
  463. bitfield_insert_u64,
  464. bitfield_insert_u128,
  465. bitfield_insert_uint,
  466. bitfield_insert_i8,
  467. bitfield_insert_i16,
  468. bitfield_insert_i32,
  469. bitfield_insert_i64,
  470. bitfield_insert_i128,
  471. bitfield_insert_int,
  472. }