Etusivu Tutki Apua
Kirjaudu sisään
c
/
odin-lang.Odin
peilaus alkaen https://github.com/odin-lang/Odin
2
0
Fork 0
Tiedostot Ongelmat 0 Wiki
Puu: v0.4.0
Haarat Tagit
odin-lang.Odin
/
core
/
bits.odin

bits.odin 24 KB
Pysyvä linkki Historia Raaka

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287 
  1. const (
    2. 

  2. 	U8_MIN   =   u8(0);
    3. 

  3. 	U16_MIN  =  u16(0);
    4. 

  4. 	U32_MIN  =  u32(0);
    5. 

  5. 	U64_MIN  =  u64(0);
    6. 

  6. 	U128_MIN = u128(0);
    7. 

  7. 

  8. 	I8_MIN   =   i8(-0x80);
    9. 

  9. 	I16_MIN  =  i16(-0x8000);
    10. 

  10. 	I32_MIN  =  i32(-0x8000_0000);
    11. 

  11. 	I64_MIN  =  i64(-0x8000_0000_0000_0000);
    12. 

  12. 	I128_MIN = i128(-0x8000_0000_0000_0000_0000_0000_0000_0000);
    13. 

  13. 

  14. 	U8_MAX   =   ~u8(0);
    15. 

  15. 	U16_MAX  =  ~u16(0);
    16. 

  16. 	U32_MAX  =  ~u32(0);
    17. 

  17. 	U64_MAX  =  ~u64(0);
    18. 

  18. 	U128_MAX = ~u128(0);
    19. 

  19. 

  20. 	I8_MAX   =   i8(0x7f);
    21. 

  21. 	I16_MAX  =  i16(0x7fff);
    22. 

  22. 	I32_MAX  =  i32(0x7fff_ffff);
    23. 

  23. 	I64_MAX  =  i64(0x7fff_ffff_ffff_ffff);
    24. 

  24. 	I128_MAX = i128(0x7fff_ffff_ffff_ffff_ffff_ffff_ffff_ffff);
    25. 

  25. )
    26. 

  26. 

  27. proc count_ones(i:   u8) ->   u8 { foreign __llvm_core proc __llvm_ctpop(u8)   ->   u8 #link_name "llvm.ctpop.i8";  return __llvm_ctpop(i); }
    28. 

  28. proc count_ones(i:   i8) ->   i8 { foreign __llvm_core proc __llvm_ctpop(i8)   ->   i8 #link_name "llvm.ctpop.i8";  return __llvm_ctpop(i); }
    29. 

  29. proc count_ones(i:  u16) ->  u16 { foreign __llvm_core proc __llvm_ctpop(u16)  ->  u16 #link_name "llvm.ctpop.i16"; return __llvm_ctpop(i); }
    30. 

  30. proc count_ones(i:  i16) ->  i16 { foreign __llvm_core proc __llvm_ctpop(i16)  ->  i16 #link_name "llvm.ctpop.i16"; return __llvm_ctpop(i); }
    31. 

  31. proc count_ones(i:  u32) ->  u32 { foreign __llvm_core proc __llvm_ctpop(u32)  ->  u32 #link_name "llvm.ctpop.i32"; return __llvm_ctpop(i); }
    32. 

  32. proc count_ones(i:  i32) ->  i32 { foreign __llvm_core proc __llvm_ctpop(i32)  ->  i32 #link_name "llvm.ctpop.i32"; return __llvm_ctpop(i); }
    33. 

  33. proc count_ones(i:  u64) ->  u64 { foreign __llvm_core proc __llvm_ctpop(u64)  ->  u64 #link_name "llvm.ctpop.i64"; return __llvm_ctpop(i); }
    34. 

  34. proc count_ones(i:  i64) ->  i64 { foreign __llvm_core proc __llvm_ctpop(i64)  ->  i64 #link_name "llvm.ctpop.i64"; return __llvm_ctpop(i); }
    35. 

  35. proc count_ones(i: u128) -> u128 { foreign __llvm_core proc __llvm_ctpop(u128) -> u128 #link_name "llvm.ctpop.i128";return __llvm_ctpop(i); }
    36. 

  36. proc count_ones(i: i128) -> i128 { foreign __llvm_core proc __llvm_ctpop(i128) -> i128 #link_name "llvm.ctpop.i128";return __llvm_ctpop(i); }
    37. 

  37. proc count_ones(i: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(count_ones(u32(i))); } else { return uint(count_ones(u64(i))); } }
    38. 

  38. proc count_ones(i:  int) ->  int { when size_of(int)  == size_of(i32) { return int(count_ones(i32(i)));  } else { return int(count_ones(i64(i))); } }
    39. 

  39. 

  40. proc count_zeros(i:   u8) ->   u8 { return   8 - count_ones(i); }
    41. 

  41. proc count_zeros(i:   i8) ->   i8 { return   8 - count_ones(i); }
    42. 

  42. proc count_zeros(i:  u16) ->  u16 { return  16 - count_ones(i); }
    43. 

  43. proc count_zeros(i:  i16) ->  i16 { return  16 - count_ones(i); }
    44. 

  44. proc count_zeros(i:  u32) ->  u32 { return  32 - count_ones(i); }
    45. 

  45. proc count_zeros(i:  i32) ->  i32 { return  32 - count_ones(i); }
    46. 

  46. proc count_zeros(i:  u64) ->  u64 { return  64 - count_ones(i); }
    47. 

  47. proc count_zeros(i:  i64) ->  i64 { return  64 - count_ones(i); }
    48. 

  48. proc count_zeros(i: u128) -> u128 { return 128 - count_ones(i); }
    49. 

  49. proc count_zeros(i: i128) -> i128 { return 128 - count_ones(i); }
    50. 

  50. proc count_zeros(i: uint) -> uint { return 8*size_of(uint) - count_ones(i); }
    51. 

  51. proc count_zeros(i:  int) ->  int { return 8*size_of(int)  - count_ones(i); }
    52. 

  52. 

  53. 

  54. proc rotate_left(i: u8,   s: uint) ->   u8 { return (i << s)|(i >> (8*size_of(u8)   - s)); }
    55. 

  55. proc rotate_left(i: i8,   s: uint) ->   i8 { return (i << s)|(i >> (8*size_of(i8)   - s)); }
    56. 

  56. proc rotate_left(i: u16,  s: uint) ->  u16 { return (i << s)|(i >> (8*size_of(u16)  - s)); }
    57. 

  57. proc rotate_left(i: i16,  s: uint) ->  i16 { return (i << s)|(i >> (8*size_of(i16)  - s)); }
    58. 

  58. proc rotate_left(i: u32,  s: uint) ->  u32 { return (i << s)|(i >> (8*size_of(u32)  - s)); }
    59. 

  59. proc rotate_left(i: i32,  s: uint) ->  i32 { return (i << s)|(i >> (8*size_of(i32)  - s)); }
    60. 

  60. proc rotate_left(i: u64,  s: uint) ->  u64 { return (i << s)|(i >> (8*size_of(u64)  - s)); }
    61. 

  61. proc rotate_left(i: i64,  s: uint) ->  i64 { return (i << s)|(i >> (8*size_of(i64)  - s)); }
    62. 

  62. proc rotate_left(i: u128, s: uint) -> u128 { return (i << s)|(i >> (8*size_of(u128) - s)); }
    63. 

  63. proc rotate_left(i: i128, s: uint) -> i128 { return (i << s)|(i >> (8*size_of(i128) - s)); }
    64. 

  64. proc rotate_left(i: uint, s: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(rotate_left(u32(i), s)); } else { return uint(rotate_left(u64(i), s)); } }
    65. 

  65. proc rotate_left(i:  int, s: uint) ->  int { when size_of(int)  == size_of(i32) { return  int(rotate_left(i32(i), s)); } else { return  int(rotate_left(i64(i), s)); } }
    66. 

  66. 

  67. 

  68. proc rotate_right(i: u8,   s: uint) ->   u8 { return (i >> s)|(i << (8*size_of(u8)   - s)); }
    69. 

  69. proc rotate_right(i: i8,   s: uint) ->   i8 { return (i >> s)|(i << (8*size_of(i8)   - s)); }
    70. 

  70. proc rotate_right(i: u16,  s: uint) ->  u16 { return (i >> s)|(i << (8*size_of(u16)  - s)); }
    71. 

  71. proc rotate_right(i: i16,  s: uint) ->  i16 { return (i >> s)|(i << (8*size_of(i16)  - s)); }
    72. 

  72. proc rotate_right(i: u32,  s: uint) ->  u32 { return (i >> s)|(i << (8*size_of(u32)  - s)); }
    73. 

  73. proc rotate_right(i: i32,  s: uint) ->  i32 { return (i >> s)|(i << (8*size_of(i32)  - s)); }
    74. 

  74. proc rotate_right(i: u64,  s: uint) ->  u64 { return (i >> s)|(i << (8*size_of(u64)  - s)); }
    75. 

  75. proc rotate_right(i: i64,  s: uint) ->  i64 { return (i >> s)|(i << (8*size_of(i64)  - s)); }
    76. 

  76. proc rotate_right(i: u128, s: uint) -> u128 { return (i >> s)|(i << (8*size_of(u128) - s)); }
    77. 

  77. proc rotate_right(i: i128, s: uint) -> i128 { return (i >> s)|(i << (8*size_of(i128) - s)); }
    78. 

  78. proc rotate_right(i: uint, s: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(rotate_right(u32(i), s)); } else { return uint(rotate_right(u64(i), s)); } }
    79. 

  79. proc rotate_right(i:  int, s: uint) ->  int { when size_of(int)  == size_of(i32) { return  int(rotate_right(i32(i), s)); } else { return  int(rotate_right(i64(i), s)); } }
    80. 

  80. 

  81. 

  82. proc leading_zeros(i:   u8) ->   u8 { foreign __llvm_core proc __llvm_ctlz(u8,   bool) ->   u8 #link_name "llvm.ctlz.i8";  return __llvm_ctlz(i, false); }
    83. 

  83. proc leading_zeros(i:   i8) ->   i8 { foreign __llvm_core proc __llvm_ctlz(i8,   bool) ->   i8 #link_name "llvm.ctlz.i8";  return __llvm_ctlz(i, false); }
    84. 

  84. proc leading_zeros(i:  u16) ->  u16 { foreign __llvm_core proc __llvm_ctlz(u16,  bool) ->  u16 #link_name "llvm.ctlz.i16"; return __llvm_ctlz(i, false); }
    85. 

  85. proc leading_zeros(i:  i16) ->  i16 { foreign __llvm_core proc __llvm_ctlz(i16,  bool) ->  i16 #link_name "llvm.ctlz.i16"; return __llvm_ctlz(i, false); }
    86. 

  86. proc leading_zeros(i:  u32) ->  u32 { foreign __llvm_core proc __llvm_ctlz(u32,  bool) ->  u32 #link_name "llvm.ctlz.i32"; return __llvm_ctlz(i, false); }
    87. 

  87. proc leading_zeros(i:  i32) ->  i32 { foreign __llvm_core proc __llvm_ctlz(i32,  bool) ->  i32 #link_name "llvm.ctlz.i32"; return __llvm_ctlz(i, false); }
    88. 

  88. proc leading_zeros(i:  u64) ->  u64 { foreign __llvm_core proc __llvm_ctlz(u64,  bool) ->  u64 #link_name "llvm.ctlz.i64"; return __llvm_ctlz(i, false); }
    89. 

  89. proc leading_zeros(i:  i64) ->  i64 { foreign __llvm_core proc __llvm_ctlz(i64,  bool) ->  i64 #link_name "llvm.ctlz.i64"; return __llvm_ctlz(i, false); }
    90. 

  90. proc leading_zeros(i: u128) -> u128 { foreign __llvm_core proc __llvm_ctlz(u128, bool) -> u128 #link_name "llvm.ctlz.i128";return __llvm_ctlz(i, false); }
    91. 

  91. proc leading_zeros(i: i128) -> i128 { foreign __llvm_core proc __llvm_ctlz(i128, bool) -> i128 #link_name "llvm.ctlz.i128";return __llvm_ctlz(i, false); }
    92. 

  92. proc leading_zeros(i: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(leading_zeros(u32(i))); } else { return uint(leading_zeros(u64(i))); } }
    93. 

  93. proc leading_zeros(i:  int) ->  int { when size_of(int)  == size_of(i32) { return  int(leading_zeros(i32(i))); } else { return  int(leading_zeros(i64(i))); } }
    94. 

  94. 

  95. proc trailing_zeros(i:   u8) ->   u8 { foreign __llvm_core proc __llvm_cttz(u8,   bool) ->   u8 #link_name "llvm.cttz.i8";  return __llvm_cttz(i, false); }
    96. 

  96. proc trailing_zeros(i:   i8) ->   i8 { foreign __llvm_core proc __llvm_cttz(i8,   bool) ->   i8 #link_name "llvm.cttz.i8";  return __llvm_cttz(i, false); }
    97. 

  97. proc trailing_zeros(i:  u16) ->  u16 { foreign __llvm_core proc __llvm_cttz(u16,  bool) ->  u16 #link_name "llvm.cttz.i16"; return __llvm_cttz(i, false); }
    98. 

  98. proc trailing_zeros(i:  i16) ->  i16 { foreign __llvm_core proc __llvm_cttz(i16,  bool) ->  i16 #link_name "llvm.cttz.i16"; return __llvm_cttz(i, false); }
    99. 

  99. proc trailing_zeros(i:  u32) ->  u32 { foreign __llvm_core proc __llvm_cttz(u32,  bool) ->  u32 #link_name "llvm.cttz.i32"; return __llvm_cttz(i, false); }
    100. 

  100. proc trailing_zeros(i:  i32) ->  i32 { foreign __llvm_core proc __llvm_cttz(i32,  bool) ->  i32 #link_name "llvm.cttz.i32"; return __llvm_cttz(i, false); }
    101. 

  101. proc trailing_zeros(i:  u64) ->  u64 { foreign __llvm_core proc __llvm_cttz(u64,  bool) ->  u64 #link_name "llvm.cttz.i64"; return __llvm_cttz(i, false); }
    102. 

  102. proc trailing_zeros(i:  i64) ->  i64 { foreign __llvm_core proc __llvm_cttz(i64,  bool) ->  i64 #link_name "llvm.cttz.i64"; return __llvm_cttz(i, false); }
    103. 

  103. proc trailing_zeros(i: u128) -> u128 { foreign __llvm_core proc __llvm_cttz(u128, bool) -> u128 #link_name "llvm.cttz.i128";return __llvm_cttz(i, false); }
    104. 

  104. proc trailing_zeros(i: i128) -> i128 { foreign __llvm_core proc __llvm_cttz(i128, bool) -> i128 #link_name "llvm.cttz.i128";return __llvm_cttz(i, false); }
    105. 

  105. proc trailing_zeros(i: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(trailing_zeros(u32(i))); } else { return uint(trailing_zeros(u64(i))); } }
    106. 

  106. proc trailing_zeros(i:  int) ->  int { when size_of(int)  == size_of(i32) { return  int(trailing_zeros(i32(i))); } else { return  int(trailing_zeros(i64(i))); } }
    107. 

  107. 

  108. 

  109. proc reverse_bits(i:   u8) ->   u8 { foreign __llvm_core proc __llvm_bitreverse(u8)   ->   u8 #link_name "llvm.bitreverse.i8";  return __llvm_bitreverse(i); }
    110. 

  110. proc reverse_bits(i:   i8) ->   i8 { foreign __llvm_core proc __llvm_bitreverse(i8)   ->   i8 #link_name "llvm.bitreverse.i8";  return __llvm_bitreverse(i); }
    111. 

  111. proc reverse_bits(i:  u16) ->  u16 { foreign __llvm_core proc __llvm_bitreverse(u16)  ->  u16 #link_name "llvm.bitreverse.i16"; return __llvm_bitreverse(i); }
    112. 

  112. proc reverse_bits(i:  i16) ->  i16 { foreign __llvm_core proc __llvm_bitreverse(i16)  ->  i16 #link_name "llvm.bitreverse.i16"; return __llvm_bitreverse(i); }
    113. 

  113. proc reverse_bits(i:  u32) ->  u32 { foreign __llvm_core proc __llvm_bitreverse(u32)  ->  u32 #link_name "llvm.bitreverse.i32"; return __llvm_bitreverse(i); }
    114. 

  114. proc reverse_bits(i:  i32) ->  i32 { foreign __llvm_core proc __llvm_bitreverse(i32)  ->  i32 #link_name "llvm.bitreverse.i32"; return __llvm_bitreverse(i); }
    115. 

  115. proc reverse_bits(i:  u64) ->  u64 { foreign __llvm_core proc __llvm_bitreverse(u64)  ->  u64 #link_name "llvm.bitreverse.i64"; return __llvm_bitreverse(i); }
    116. 

  116. proc reverse_bits(i:  i64) ->  i64 { foreign __llvm_core proc __llvm_bitreverse(i64)  ->  i64 #link_name "llvm.bitreverse.i64"; return __llvm_bitreverse(i); }
    117. 

  117. proc reverse_bits(i: u128) -> u128 { foreign __llvm_core proc __llvm_bitreverse(u128) -> u128 #link_name "llvm.bitreverse.i128";return __llvm_bitreverse(i); }
    118. 

  118. proc reverse_bits(i: i128) -> i128 { foreign __llvm_core proc __llvm_bitreverse(i128) -> i128 #link_name "llvm.bitreverse.i128";return __llvm_bitreverse(i); }
    119. 

  119. proc reverse_bits(i: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(reverse_bits(u32(i))); } else { return uint(reverse_bits(u64(i))); } }
    120. 

  120. proc reverse_bits(i:  int) ->  int { when size_of(int)  == size_of(i32) { return  int(reverse_bits(i32(i))); } else { return  int(reverse_bits(i64(i))); } }
    121. 

  121. 

  122. foreign __llvm_core {
    123. 

  123. proc byte_swap(u16)  ->  u16 #link_name "llvm.bswap.i16";
    124. 

  124. proc byte_swap(i16)  ->  i16 #link_name "llvm.bswap.i16";
    125. 

  125. proc byte_swap(u32)  ->  u32 #link_name "llvm.bswap.i32";
    126. 

  126. proc byte_swap(i32)  ->  i32 #link_name "llvm.bswap.i32";
    127. 

  127. proc byte_swap(u64)  ->  u64 #link_name "llvm.bswap.i64";
    128. 

  128. proc byte_swap(i64)  ->  i64 #link_name "llvm.bswap.i64";
    129. 

  129. proc byte_swap(u128) -> u128 #link_name "llvm.bswap.i128";
    130. 

  130. proc byte_swap(i128) -> i128 #link_name "llvm.bswap.i128";
    131. 

  131. }
    132. 

  132. proc byte_swap(i: uint) -> uint { when size_of(uint) == size_of(u32) { return uint(byte_swap(u32(i))); } else { return uint(byte_swap(u64(i))); } }
    133. 

  133. proc byte_swap(i:  int) ->  int { when size_of(int)  == size_of(i32) { return  int(byte_swap(i32(i))); } else { return  int(byte_swap(i64(i))); } }
    134. 

  134. 

  135. proc from_be(i:   u8) ->   u8 { return i; }
    136. 

  136. proc from_be(i:   i8) ->   i8 { return i; }
    137. 

  137. proc from_be(i:  u16) ->  u16 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    138. 

  138. proc from_be(i:  i16) ->  i16 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    139. 

  139. proc from_be(i:  u32) ->  u32 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    140. 

  140. proc from_be(i:  i32) ->  i32 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    141. 

  141. proc from_be(i:  u64) ->  u64 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    142. 

  142. proc from_be(i:  i64) ->  i64 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    143. 

  143. proc from_be(i: u128) -> u128 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    144. 

  144. proc from_be(i: i128) -> i128 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    145. 

  145. proc from_be(i: uint) -> uint { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    146. 

  146. proc from_be(i:  int) ->  int { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    147. 

  147. 

  148. proc from_le(i:   u8) ->   u8 { return i; }
    149. 

  149. proc from_le(i:   i8) ->   i8 { return i; }
    150. 

  150. proc from_le(i:  u16) ->  u16 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    151. 

  151. proc from_le(i:  i16) ->  i16 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    152. 

  152. proc from_le(i:  u32) ->  u32 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    153. 

  153. proc from_le(i:  i32) ->  i32 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    154. 

  154. proc from_le(i:  u64) ->  u64 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    155. 

  155. proc from_le(i:  i64) ->  i64 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    156. 

  156. proc from_le(i: u128) -> u128 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    157. 

  157. proc from_le(i: i128) -> i128 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    158. 

  158. proc from_le(i: uint) -> uint { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    159. 

  159. proc from_le(i:  int) ->  int { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    160. 

  160. 

  161. proc to_be(i:   u8) ->   u8 { return i; }
    162. 

  162. proc to_be(i:   i8) ->   i8 { return i; }
    163. 

  163. proc to_be(i:  u16) ->  u16 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    164. 

  164. proc to_be(i:  i16) ->  i16 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    165. 

  165. proc to_be(i:  u32) ->  u32 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    166. 

  166. proc to_be(i:  i32) ->  i32 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    167. 

  167. proc to_be(i:  u64) ->  u64 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    168. 

  168. proc to_be(i:  i64) ->  i64 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    169. 

  169. proc to_be(i: u128) -> u128 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    170. 

  170. proc to_be(i: i128) -> i128 { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    171. 

  171. proc to_be(i: uint) -> uint { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    172. 

  172. proc to_be(i:  int) ->  int { when ODIN_ENDIAN == "big" { return i; } else { return byte_swap(i); } }
    173. 

  173. 

  174. 

  175. proc to_le(i:   u8) ->   u8 { return i; }
    176. 

  176. proc to_le(i:   i8) ->   i8 { return i; }
    177. 

  177. proc to_le(i:  u16) ->  u16 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    178. 

  178. proc to_le(i:  i16) ->  i16 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    179. 

  179. proc to_le(i:  u32) ->  u32 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    180. 

  180. proc to_le(i:  i32) ->  i32 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    181. 

  181. proc to_le(i:  u64) ->  u64 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    182. 

  182. proc to_le(i:  i64) ->  i64 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    183. 

  183. proc to_le(i: u128) -> u128 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    184. 

  184. proc to_le(i: i128) -> i128 { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    185. 

  185. proc to_le(i: uint) -> uint { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    186. 

  186. proc to_le(i:  int) ->  int { when ODIN_ENDIAN == "little" { return i; } else { return byte_swap(i); } }
    187. 

  187. 

  188. 

  189. proc overflowing_add(lhs, rhs:   u8) -> (u8, bool)   { foreign __llvm_core proc op(u8, u8)     -> (u8, bool)   #link_name "llvm.uadd.with.overflow.i8";   return op(lhs, rhs); }
    190. 

  190. proc overflowing_add(lhs, rhs:   i8) -> (i8, bool)   { foreign __llvm_core proc op(i8, i8)     -> (i8, bool)   #link_name "llvm.sadd.with.overflow.i8";   return op(lhs, rhs); }
    191. 

  191. proc overflowing_add(lhs, rhs:  u16) -> (u16, bool)  { foreign __llvm_core proc op(u16, u16)   -> (u16, bool)  #link_name "llvm.uadd.with.overflow.i16";  return op(lhs, rhs); }
    192. 

  192. proc overflowing_add(lhs, rhs:  i16) -> (i16, bool)  { foreign __llvm_core proc op(i16, i16)   -> (i16, bool)  #link_name "llvm.sadd.with.overflow.i16";  return op(lhs, rhs); }
    193. 

  193. proc overflowing_add(lhs, rhs:  u32) -> (u32, bool)  { foreign __llvm_core proc op(u32, u32)   -> (u32, bool)  #link_name "llvm.uadd.with.overflow.i32";  return op(lhs, rhs); }
    194. 

  194. proc overflowing_add(lhs, rhs:  i32) -> (i32, bool)  { foreign __llvm_core proc op(i32, i32)   -> (i32, bool)  #link_name "llvm.sadd.with.overflow.i32";  return op(lhs, rhs); }
    195. 

  195. proc overflowing_add(lhs, rhs:  u64) -> (u64, bool)  { foreign __llvm_core proc op(u64, u64)   -> (u64, bool)  #link_name "llvm.uadd.with.overflow.i64";  return op(lhs, rhs); }
    196. 

  196. proc overflowing_add(lhs, rhs:  i64) -> (i64, bool)  { foreign __llvm_core proc op(i64, i64)   -> (i64, bool)  #link_name "llvm.sadd.with.overflow.i64";  return op(lhs, rhs); }
    197. 

  197. proc overflowing_add(lhs, rhs: u128) -> (u128, bool) { foreign __llvm_core proc op(u128, u128) -> (u128, bool) #link_name "llvm.uadd.with.overflow.i128"; return op(lhs, rhs); }
    198. 

  198. proc overflowing_add(lhs, rhs: i128) -> (i128, bool) { foreign __llvm_core proc op(i128, i128) -> (i128, bool) #link_name "llvm.sadd.with.overflow.i128"; return op(lhs, rhs); }
    199. 

  199. proc overflowing_add(lhs, rhs: uint) -> (uint, bool) {
    200. 

  200. 	when size_of(uint) == size_of(u32) {
    201. 

  201. 		var x, ok = overflowing_add(u32(lhs), u32(rhs));
    202. 

  202. 		return uint(x), ok;
    203. 

  203. 	} else {
    204. 

  204. 		var x, ok = overflowing_add(u64(lhs), u64(rhs));
    205. 

  205. 		return uint(x), ok;
    206. 

  206. 	}
    207. 

  207. }
    208. 

  208. proc overflowing_add(lhs, rhs: int) -> (int, bool) {
    209. 

  209. 	when size_of(int) == size_of(i32) {
    210. 

  210. 		var x, ok = overflowing_add(i32(lhs), i32(rhs));
    211. 

  211. 		return int(x), ok;
    212. 

  212. 	} else {
    213. 

  213. 		var x, ok = overflowing_add(i64(lhs), i64(rhs));
    214. 

  214. 		return int(x), ok;
    215. 

  215. 	}
    216. 

  216. }
    217. 

  217. 

  218. proc overflowing_sub(lhs, rhs:   u8) -> (u8, bool)   { foreign __llvm_core proc op(u8, u8)     -> (u8, bool)   #link_name "llvm.usub.with.overflow.i8";   return op(lhs, rhs); }
    219. 

  219. proc overflowing_sub(lhs, rhs:   i8) -> (i8, bool)   { foreign __llvm_core proc op(i8, i8)     -> (i8, bool)   #link_name "llvm.ssub.with.overflow.i8";   return op(lhs, rhs); }
    220. 

  220. proc overflowing_sub(lhs, rhs:  u16) -> (u16, bool)  { foreign __llvm_core proc op(u16, u16)   -> (u16, bool)  #link_name "llvm.usub.with.overflow.i16";  return op(lhs, rhs); }
    221. 

  221. proc overflowing_sub(lhs, rhs:  i16) -> (i16, bool)  { foreign __llvm_core proc op(i16, i16)   -> (i16, bool)  #link_name "llvm.ssub.with.overflow.i16";  return op(lhs, rhs); }
    222. 

  222. proc overflowing_sub(lhs, rhs:  u32) -> (u32, bool)  { foreign __llvm_core proc op(u32, u32)   -> (u32, bool)  #link_name "llvm.usub.with.overflow.i32";  return op(lhs, rhs); }
    223. 

  223. proc overflowing_sub(lhs, rhs:  i32) -> (i32, bool)  { foreign __llvm_core proc op(i32, i32)   -> (i32, bool)  #link_name "llvm.ssub.with.overflow.i32";  return op(lhs, rhs); }
    224. 

  224. proc overflowing_sub(lhs, rhs:  u64) -> (u64, bool)  { foreign __llvm_core proc op(u64, u64)   -> (u64, bool)  #link_name "llvm.usub.with.overflow.i64";  return op(lhs, rhs); }
    225. 

  225. proc overflowing_sub(lhs, rhs:  i64) -> (i64, bool)  { foreign __llvm_core proc op(i64, i64)   -> (i64, bool)  #link_name "llvm.ssub.with.overflow.i64";  return op(lhs, rhs); }
    226. 

  226. proc overflowing_sub(lhs, rhs: u128) -> (u128, bool) { foreign __llvm_core proc op(u128, u128) -> (u128, bool) #link_name "llvm.usub.with.overflow.i128"; return op(lhs, rhs); }
    227. 

  227. proc overflowing_sub(lhs, rhs: i128) -> (i128, bool) { foreign __llvm_core proc op(i128, i128) -> (i128, bool) #link_name "llvm.ssub.with.overflow.i128"; return op(lhs, rhs); }
    228. 

  228. proc overflowing_sub(lhs, rhs: uint) -> (uint, bool) {
    229. 

  229. 	when size_of(uint) == size_of(u32) {
    230. 

  230. 		var x, ok = overflowing_sub(u32(lhs), u32(rhs));
    231. 

  231. 		return uint(x), ok;
    232. 

  232. 	} else {
    233. 

  233. 		var x, ok = overflowing_sub(u64(lhs), u64(rhs));
    234. 

  234. 		return uint(x), ok;
    235. 

  235. 	}
    236. 

  236. }
    237. 

  237. proc overflowing_sub(lhs, rhs: int) -> (int, bool) {
    238. 

  238. 	when size_of(int) == size_of(i32) {
    239. 

  239. 		var x, ok = overflowing_sub(i32(lhs), i32(rhs));
    240. 

  240. 		return int(x), ok;
    241. 

  241. 	} else {
    242. 

  242. 		var x, ok = overflowing_sub(i64(lhs), i64(rhs));
    243. 

  243. 		return int(x), ok;
    244. 

  244. 	}
    245. 

  245. }
    246. 

  246. 

  247. proc overflowing_mul(lhs, rhs:   u8) -> (u8, bool)   { foreign __llvm_core proc op(u8, u8)     -> (u8, bool)   #link_name "llvm.umul.with.overflow.i8";   return op(lhs, rhs); }
    248. 

  248. proc overflowing_mul(lhs, rhs:   i8) -> (i8, bool)   { foreign __llvm_core proc op(i8, i8)     -> (i8, bool)   #link_name "llvm.smul.with.overflow.i8";   return op(lhs, rhs); }
    249. 

  249. proc overflowing_mul(lhs, rhs:  u16) -> (u16, bool)  { foreign __llvm_core proc op(u16, u16)   -> (u16, bool)  #link_name "llvm.umul.with.overflow.i16";  return op(lhs, rhs); }
    250. 

  250. proc overflowing_mul(lhs, rhs:  i16) -> (i16, bool)  { foreign __llvm_core proc op(i16, i16)   -> (i16, bool)  #link_name "llvm.smul.with.overflow.i16";  return op(lhs, rhs); }
    251. 

  251. proc overflowing_mul(lhs, rhs:  u32) -> (u32, bool)  { foreign __llvm_core proc op(u32, u32)   -> (u32, bool)  #link_name "llvm.umul.with.overflow.i32";  return op(lhs, rhs); }
    252. 

  252. proc overflowing_mul(lhs, rhs:  i32) -> (i32, bool)  { foreign __llvm_core proc op(i32, i32)   -> (i32, bool)  #link_name "llvm.smul.with.overflow.i32";  return op(lhs, rhs); }
    253. 

  253. proc overflowing_mul(lhs, rhs:  u64) -> (u64, bool)  { foreign __llvm_core proc op(u64, u64)   -> (u64, bool)  #link_name "llvm.umul.with.overflow.i64";  return op(lhs, rhs); }
    254. 

  254. proc overflowing_mul(lhs, rhs:  i64) -> (i64, bool)  { foreign __llvm_core proc op(i64, i64)   -> (i64, bool)  #link_name "llvm.smul.with.overflow.i64";  return op(lhs, rhs); }
    255. 

  255. proc overflowing_mul(lhs, rhs: u128) -> (u128, bool) { foreign __llvm_core proc op(u128, u128) -> (u128, bool) #link_name "llvm.umul.with.overflow.i128"; return op(lhs, rhs); }
    256. 

  256. proc overflowing_mul(lhs, rhs: i128) -> (i128, bool) { foreign __llvm_core proc op(i128, i128) -> (i128, bool) #link_name "llvm.smul.with.overflow.i128"; return op(lhs, rhs); }
    257. 

  257. proc overflowing_mul(lhs, rhs: uint) -> (uint, bool) {
    258. 

  258. 	when size_of(uint) == size_of(u32) {
    259. 

  259. 		var x, ok = overflowing_mul(u32(lhs), u32(rhs));
    260. 

  260. 		return uint(x), ok;
    261. 

  261. 	} else {
    262. 

  262. 		var x, ok = overflowing_mul(u64(lhs), u64(rhs));
    263. 

  263. 		return uint(x), ok;
    264. 

  264. 	}
    265. 

  265. }
    266. 

  266. proc overflowing_mul(lhs, rhs: int) -> (int, bool) {
    267. 

  267. 	when size_of(int) == size_of(i32) {
    268. 

  268. 		var x, ok = overflowing_mul(i32(lhs), i32(rhs));
    269. 

  269. 		return int(x), ok;
    270. 

  270. 	} else {
    271. 

  271. 		var x, ok = overflowing_mul(i64(lhs), i64(rhs));
    272. 

  272. 		return int(x), ok;
    273. 

  273. 	}
    274. 

  274. }
    275. 

  275. 

  276. proc is_power_of_two(i:   u8) -> bool { return i > 0 && (i & (i-1)) == 0; }
    277. 

  277. proc is_power_of_two(i:   i8) -> bool { return i > 0 && (i & (i-1)) == 0; }
    278. 

  278. proc is_power_of_two(i:  u16) -> bool { return i > 0 && (i & (i-1)) == 0; }
    279. 

  279. proc is_power_of_two(i:  i16) -> bool { return i > 0 && (i & (i-1)) == 0; }
    280. 

  280. proc is_power_of_two(i:  u32) -> bool { return i > 0 && (i & (i-1)) == 0; }
    281. 

  281. proc is_power_of_two(i:  i32) -> bool { return i > 0 && (i & (i-1)) == 0; }
    282. 

  282. proc is_power_of_two(i:  u64) -> bool { return i > 0 && (i & (i-1)) == 0; }
    283. 

  283. proc is_power_of_two(i:  i64) -> bool { return i > 0 && (i & (i-1)) == 0; }
    284. 

  284. proc is_power_of_two(i: u128) -> bool { return i > 0 && (i & (i-1)) == 0; }
    285. 

  285. proc is_power_of_two(i: i128) -> bool { return i > 0 && (i & (i-1)) == 0; }
    286. 

  286. proc is_power_of_two(i: uint) -> bool { return i > 0 && (i & (i-1)) == 0; }
    287. 

  287. proc is_power_of_two(i:  int) -> bool { return i > 0 && (i & (i-1)) == 0; }
    288.