bits.odin 16 KB

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