math.odin 55 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765
  1. package math
  2. import "core:intrinsics"
  3. _ :: intrinsics
  4. Float_Class :: enum {
  5. Normal, // an ordinary nonzero floating point value
  6. Subnormal, // a subnormal floating point value
  7. Zero, // zero
  8. Neg_Zero, // the negative zero
  9. NaN, // Not-A-Number (NaN)
  10. Inf, // positive infinity
  11. Neg_Inf, // negative infinity
  12. }
  13. TAU :: 6.28318530717958647692528676655900576
  14. PI :: 3.14159265358979323846264338327950288
  15. E :: 2.71828182845904523536
  16. τ :: TAU
  17. π :: PI
  18. e :: E
  19. SQRT_TWO :: 1.41421356237309504880168872420969808
  20. SQRT_THREE :: 1.73205080756887729352744634150587236
  21. SQRT_FIVE :: 2.23606797749978969640917366873127623
  22. LN2 :: 0.693147180559945309417232121458176568
  23. LN10 :: 2.30258509299404568401799145468436421
  24. MAX_F64_PRECISION :: 16 // Maximum number of meaningful digits after the decimal point for 'f64'
  25. MAX_F32_PRECISION :: 8 // Maximum number of meaningful digits after the decimal point for 'f32'
  26. MAX_F16_PRECISION :: 4 // Maximum number of meaningful digits after the decimal point for 'f16'
  27. RAD_PER_DEG :: TAU/360.0
  28. DEG_PER_RAD :: 360.0/TAU
  29. sqrt_f16le :: proc "contextless" (x: f16le) -> f16le { return #force_inline f16le(sqrt_f16(f16(x))) }
  30. sqrt_f16be :: proc "contextless" (x: f16be) -> f16be { return #force_inline f16be(sqrt_f16(f16(x))) }
  31. sqrt_f32le :: proc "contextless" (x: f32le) -> f32le { return #force_inline f32le(sqrt_f32(f32(x))) }
  32. sqrt_f32be :: proc "contextless" (x: f32be) -> f32be { return #force_inline f32be(sqrt_f32(f32(x))) }
  33. sqrt_f64le :: proc "contextless" (x: f64le) -> f64le { return #force_inline f64le(sqrt_f64(f64(x))) }
  34. sqrt_f64be :: proc "contextless" (x: f64be) -> f64be { return #force_inline f64be(sqrt_f64(f64(x))) }
  35. sqrt :: proc{
  36. sqrt_f16, sqrt_f16le, sqrt_f16be,
  37. sqrt_f32, sqrt_f32le, sqrt_f32be,
  38. sqrt_f64, sqrt_f64le, sqrt_f64be,
  39. }
  40. sin_f16le :: proc "contextless" (θ: f16le) -> f16le { return #force_inline f16le(sin_f16(f16(θ))) }
  41. sin_f16be :: proc "contextless" (θ: f16be) -> f16be { return #force_inline f16be(sin_f16(f16(θ))) }
  42. sin_f32le :: proc "contextless" (θ: f32le) -> f32le { return #force_inline f32le(sin_f32(f32(θ))) }
  43. sin_f32be :: proc "contextless" (θ: f32be) -> f32be { return #force_inline f32be(sin_f32(f32(θ))) }
  44. sin_f64le :: proc "contextless" (θ: f64le) -> f64le { return #force_inline f64le(sin_f64(f64(θ))) }
  45. sin_f64be :: proc "contextless" (θ: f64be) -> f64be { return #force_inline f64be(sin_f64(f64(θ))) }
  46. sin :: proc{
  47. sin_f16, sin_f16le, sin_f16be,
  48. sin_f32, sin_f32le, sin_f32be,
  49. sin_f64, sin_f64le, sin_f64be,
  50. }
  51. cos_f16le :: proc "contextless" (θ: f16le) -> f16le { return #force_inline f16le(cos_f16(f16(θ))) }
  52. cos_f16be :: proc "contextless" (θ: f16be) -> f16be { return #force_inline f16be(cos_f16(f16(θ))) }
  53. cos_f32le :: proc "contextless" (θ: f32le) -> f32le { return #force_inline f32le(cos_f32(f32(θ))) }
  54. cos_f32be :: proc "contextless" (θ: f32be) -> f32be { return #force_inline f32be(cos_f32(f32(θ))) }
  55. cos_f64le :: proc "contextless" (θ: f64le) -> f64le { return #force_inline f64le(cos_f64(f64(θ))) }
  56. cos_f64be :: proc "contextless" (θ: f64be) -> f64be { return #force_inline f64be(cos_f64(f64(θ))) }
  57. cos :: proc{
  58. cos_f16, cos_f16le, cos_f16be,
  59. cos_f32, cos_f32le, cos_f32be,
  60. cos_f64, cos_f64le, cos_f64be,
  61. }
  62. pow_f16le :: proc "contextless" (x, power: f16le) -> f16le { return #force_inline f16le(pow_f16(f16(x), f16(power))) }
  63. pow_f16be :: proc "contextless" (x, power: f16be) -> f16be { return #force_inline f16be(pow_f16(f16(x), f16(power))) }
  64. pow_f32le :: proc "contextless" (x, power: f32le) -> f32le { return #force_inline f32le(pow_f32(f32(x), f32(power))) }
  65. pow_f32be :: proc "contextless" (x, power: f32be) -> f32be { return #force_inline f32be(pow_f32(f32(x), f32(power))) }
  66. pow_f64le :: proc "contextless" (x, power: f64le) -> f64le { return #force_inline f64le(pow_f64(f64(x), f64(power))) }
  67. pow_f64be :: proc "contextless" (x, power: f64be) -> f64be { return #force_inline f64be(pow_f64(f64(x), f64(power))) }
  68. pow :: proc{
  69. pow_f16, pow_f16le, pow_f16be,
  70. pow_f32, pow_f32le, pow_f32be,
  71. pow_f64, pow_f64le, pow_f64be,
  72. }
  73. fmuladd_f16le :: proc "contextless" (a, b, c: f16le) -> f16le { return #force_inline f16le(fmuladd_f16(f16(a), f16(b), f16(c))) }
  74. fmuladd_f16be :: proc "contextless" (a, b, c: f16be) -> f16be { return #force_inline f16be(fmuladd_f16(f16(a), f16(b), f16(c))) }
  75. fmuladd_f32le :: proc "contextless" (a, b, c: f32le) -> f32le { return #force_inline f32le(fmuladd_f32(f32(a), f32(b), f32(c))) }
  76. fmuladd_f32be :: proc "contextless" (a, b, c: f32be) -> f32be { return #force_inline f32be(fmuladd_f32(f32(a), f32(b), f32(c))) }
  77. fmuladd_f64le :: proc "contextless" (a, b, c: f64le) -> f64le { return #force_inline f64le(fmuladd_f64(f64(a), f64(b), f64(c))) }
  78. fmuladd_f64be :: proc "contextless" (a, b, c: f64be) -> f64be { return #force_inline f64be(fmuladd_f64(f64(a), f64(b), f64(c))) }
  79. fmuladd :: proc{
  80. fmuladd_f16, fmuladd_f16le, fmuladd_f16be,
  81. fmuladd_f32, fmuladd_f32le, fmuladd_f32be,
  82. fmuladd_f64, fmuladd_f64le, fmuladd_f64be,
  83. }
  84. exp_f16le :: proc "contextless" (x: f16le) -> f16le { return #force_inline f16le(exp_f16(f16(x))) }
  85. exp_f16be :: proc "contextless" (x: f16be) -> f16be { return #force_inline f16be(exp_f16(f16(x))) }
  86. exp_f32le :: proc "contextless" (x: f32le) -> f32le { return #force_inline f32le(exp_f32(f32(x))) }
  87. exp_f32be :: proc "contextless" (x: f32be) -> f32be { return #force_inline f32be(exp_f32(f32(x))) }
  88. exp_f64le :: proc "contextless" (x: f64le) -> f64le { return #force_inline f64le(exp_f64(f64(x))) }
  89. exp_f64be :: proc "contextless" (x: f64be) -> f64be { return #force_inline f64be(exp_f64(f64(x))) }
  90. exp :: proc{
  91. exp_f16, exp_f16le, exp_f16be,
  92. exp_f32, exp_f32le, exp_f32be,
  93. exp_f64, exp_f64le, exp_f64be,
  94. }
  95. ldexp_f64 :: proc "contextless" (val: f64, exp: int) -> f64 {
  96. mask :: F64_MASK
  97. shift :: F64_SHIFT
  98. bias :: F64_BIAS
  99. switch {
  100. case val == 0:
  101. return val
  102. case is_inf(val) || is_nan(val):
  103. return val
  104. }
  105. exp := exp
  106. frac, e := normalize_f64(val)
  107. exp += e
  108. x := transmute(u64)frac
  109. exp += int(x>>shift)&mask - bias
  110. if exp < -1075 { // underflow
  111. return copy_sign(0, frac)
  112. } else if exp > 1023 { // overflow
  113. if frac < 0 {
  114. return inf_f64(-1)
  115. }
  116. return inf_f64(+1)
  117. }
  118. m: f64 = 1
  119. if exp < -1022 { // denormal
  120. exp += 53
  121. m = 1.0 / (1<<53)
  122. }
  123. x &~= mask << shift
  124. x |= u64(exp+bias) << shift
  125. return m * transmute(f64)x
  126. }
  127. ldexp_f16 :: proc "contextless" (val: f16, exp: int) -> f16 { return f16(ldexp_f64(f64(val), exp)) }
  128. ldexp_f32 :: proc "contextless" (val: f32, exp: int) -> f32 { return f32(ldexp_f64(f64(val), exp)) }
  129. ldexp_f16le :: proc "contextless" (val: f16le, exp: int) -> f16le { return #force_inline f16le(ldexp_f16(f16(val), exp)) }
  130. ldexp_f16be :: proc "contextless" (val: f16be, exp: int) -> f16be { return #force_inline f16be(ldexp_f16(f16(val), exp)) }
  131. ldexp_f32le :: proc "contextless" (val: f32le, exp: int) -> f32le { return #force_inline f32le(ldexp_f32(f32(val), exp)) }
  132. ldexp_f32be :: proc "contextless" (val: f32be, exp: int) -> f32be { return #force_inline f32be(ldexp_f32(f32(val), exp)) }
  133. ldexp_f64le :: proc "contextless" (val: f64le, exp: int) -> f64le { return #force_inline f64le(ldexp_f64(f64(val), exp)) }
  134. ldexp_f64be :: proc "contextless" (val: f64be, exp: int) -> f64be { return #force_inline f64be(ldexp_f64(f64(val), exp)) }
  135. // ldexp is the inverse of frexp
  136. // it returns val * 2**exp.
  137. //
  138. // Special cases:
  139. // ldexp(+0, exp) = +0
  140. // ldexp(-0, exp) = -0
  141. // ldexp(+inf, exp) = +inf
  142. // ldexp(-inf, exp) = -inf
  143. // ldexp(NaN, exp) = NaN
  144. ldexp :: proc{
  145. ldexp_f16, ldexp_f16le, ldexp_f16be,
  146. ldexp_f32, ldexp_f32le, ldexp_f32be,
  147. ldexp_f64, ldexp_f64le, ldexp_f64be,
  148. }
  149. log_f16 :: proc "contextless" (x, base: f16) -> f16 { return ln(x) / ln(base) }
  150. log_f16le :: proc "contextless" (x, base: f16le) -> f16le { return f16le(log_f16(f16(x), f16(base))) }
  151. log_f16be :: proc "contextless" (x, base: f16be) -> f16be { return f16be(log_f16(f16(x), f16(base))) }
  152. log_f32 :: proc "contextless" (x, base: f32) -> f32 { return ln(x) / ln(base) }
  153. log_f32le :: proc "contextless" (x, base: f32le) -> f32le { return f32le(log_f32(f32(x), f32(base))) }
  154. log_f32be :: proc "contextless" (x, base: f32be) -> f32be { return f32be(log_f32(f32(x), f32(base))) }
  155. log_f64 :: proc "contextless" (x, base: f64) -> f64 { return ln(x) / ln(base) }
  156. log_f64le :: proc "contextless" (x, base: f64le) -> f64le { return f64le(log_f64(f64(x), f64(base))) }
  157. log_f64be :: proc "contextless" (x, base: f64be) -> f64be { return f64be(log_f64(f64(x), f64(base))) }
  158. log :: proc{
  159. log_f16, log_f16le, log_f16be,
  160. log_f32, log_f32le, log_f32be,
  161. log_f64, log_f64le, log_f64be,
  162. }
  163. log2_f16 :: proc "contextless" (x: f16) -> f16 { return log(f16(x), f16(2.0)) }
  164. log2_f16le :: proc "contextless" (x: f16le) -> f16le { return f16le(log_f16(f16(x), f16(2.0))) }
  165. log2_f16be :: proc "contextless" (x: f16be) -> f16be { return f16be(log_f16(f16(x), f16(2.0))) }
  166. log2_f32 :: proc "contextless" (x: f32) -> f32 { return log(f32(x), f32(2.0)) }
  167. log2_f32le :: proc "contextless" (x: f32le) -> f32le { return f32le(log_f32(f32(x), f32(2.0))) }
  168. log2_f32be :: proc "contextless" (x: f32be) -> f32be { return f32be(log_f32(f32(x), f32(2.0))) }
  169. log2_f64 :: proc "contextless" (x: f64) -> f64 { return log(f64(x), f64(2.0)) }
  170. log2_f64le :: proc "contextless" (x: f64le) -> f64le { return f64le(log_f64(f64(x), f64(2.0))) }
  171. log2_f64be :: proc "contextless" (x: f64be) -> f64be { return f64be(log_f64(f64(x), f64(2.0))) }
  172. log2 :: proc{
  173. log2_f16, log2_f16le, log2_f16be,
  174. log2_f32, log2_f32le, log2_f32be,
  175. log2_f64, log2_f64le, log2_f64be,
  176. }
  177. log10_f16 :: proc "contextless" (x: f16) -> f16 { return ln(x)/LN10 }
  178. log10_f16le :: proc "contextless" (x: f16le) -> f16le { return f16le(log10_f16(f16(x))) }
  179. log10_f16be :: proc "contextless" (x: f16be) -> f16be { return f16be(log10_f16(f16(x))) }
  180. log10_f32 :: proc "contextless" (x: f32) -> f32 { return ln(x)/LN10 }
  181. log10_f32le :: proc "contextless" (x: f32le) -> f32le { return f32le(log10_f32(f32(x))) }
  182. log10_f32be :: proc "contextless" (x: f32be) -> f32be { return f32be(log10_f32(f32(x))) }
  183. log10_f64 :: proc "contextless" (x: f64) -> f64 { return ln(x)/LN10 }
  184. log10_f64le :: proc "contextless" (x: f64le) -> f64le { return f64le(log10_f64(f64(x))) }
  185. log10_f64be :: proc "contextless" (x: f64be) -> f64be { return f64be(log10_f64(f64(x))) }
  186. log10 :: proc{
  187. log10_f16, log10_f16le, log10_f16be,
  188. log10_f32, log10_f32le, log10_f32be,
  189. log10_f64, log10_f64le, log10_f64be,
  190. }
  191. tan_f16 :: proc "contextless" (θ: f16) -> f16 { return sin(θ)/cos(θ) }
  192. tan_f16le :: proc "contextless" (θ: f16le) -> f16le { return f16le(tan_f16(f16(θ))) }
  193. tan_f16be :: proc "contextless" (θ: f16be) -> f16be { return f16be(tan_f16(f16(θ))) }
  194. tan_f32 :: proc "contextless" (θ: f32) -> f32 { return sin(θ)/cos(θ) }
  195. tan_f32le :: proc "contextless" (θ: f32le) -> f32le { return f32le(tan_f32(f32(θ))) }
  196. tan_f32be :: proc "contextless" (θ: f32be) -> f32be { return f32be(tan_f32(f32(θ))) }
  197. tan_f64 :: proc "contextless" (θ: f64) -> f64 { return sin(θ)/cos(θ) }
  198. tan_f64le :: proc "contextless" (θ: f64le) -> f64le { return f64le(tan_f64(f64(θ))) }
  199. tan_f64be :: proc "contextless" (θ: f64be) -> f64be { return f64be(tan_f64(f64(θ))) }
  200. tan :: proc{
  201. tan_f16, tan_f16le, tan_f16be,
  202. tan_f32, tan_f32le, tan_f32be,
  203. tan_f64, tan_f64le, tan_f64be,
  204. }
  205. lerp :: proc "contextless" (a, b: $T, t: $E) -> (x: T) { return a*(1-t) + b*t }
  206. saturate :: proc "contextless" (a: $T) -> (x: T) { return clamp(a, 0, 1) }
  207. unlerp :: proc "contextless" (a, b, x: $T) -> (t: T) where intrinsics.type_is_float(T), !intrinsics.type_is_array(T) {
  208. return (x-a)/(b-a)
  209. }
  210. remap :: proc "contextless" (old_value, old_min, old_max, new_min, new_max: $T) -> (x: T) where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  211. old_range := old_max - old_min
  212. new_range := new_max - new_min
  213. if old_range == 0 {
  214. return new_range / 2
  215. }
  216. return ((old_value - old_min) / old_range) * new_range + new_min
  217. }
  218. wrap :: proc "contextless" (x, y: $T) -> T where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  219. tmp := mod(x, y)
  220. return y + tmp if tmp < 0 else tmp
  221. }
  222. angle_diff :: proc "contextless" (a, b: $T) -> T where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  223. dist := wrap(b - a, TAU)
  224. return wrap(dist*2, TAU) - dist
  225. }
  226. angle_lerp :: proc "contextless" (a, b, t: $T) -> T where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  227. return a + angle_diff(a, b) * t
  228. }
  229. step :: proc "contextless" (edge, x: $T) -> T where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  230. return 0 if x < edge else 1
  231. }
  232. smoothstep :: proc "contextless" (edge0, edge1, x: $T) -> T where intrinsics.type_is_numeric(T), !intrinsics.type_is_array(T) {
  233. t := clamp((x - edge0) / (edge1 - edge0), 0, 1)
  234. return t * t * (3 - 2*t)
  235. }
  236. bias :: proc "contextless" (t, b: $T) -> T where intrinsics.type_is_numeric(T) {
  237. return t / (((1/b) - 2) * (1 - t) + 1)
  238. }
  239. gain :: proc "contextless" (t, g: $T) -> T where intrinsics.type_is_numeric(T) {
  240. if t < 0.5 {
  241. return bias(t*2, g)*0.5
  242. }
  243. return bias(t*2 - 1, 1 - g)*0.5 + 0.5
  244. }
  245. sign_f16 :: proc "contextless" (x: f16) -> f16 { return f16(int(0 < x) - int(x < 0)) }
  246. sign_f16le :: proc "contextless" (x: f16le) -> f16le { return f16le(int(0 < x) - int(x < 0)) }
  247. sign_f16be :: proc "contextless" (x: f16be) -> f16be { return f16be(int(0 < x) - int(x < 0)) }
  248. sign_f32 :: proc "contextless" (x: f32) -> f32 { return f32(int(0 < x) - int(x < 0)) }
  249. sign_f32le :: proc "contextless" (x: f32le) -> f32le { return f32le(int(0 < x) - int(x < 0)) }
  250. sign_f32be :: proc "contextless" (x: f32be) -> f32be { return f32be(int(0 < x) - int(x < 0)) }
  251. sign_f64 :: proc "contextless" (x: f64) -> f64 { return f64(int(0 < x) - int(x < 0)) }
  252. sign_f64le :: proc "contextless" (x: f64le) -> f64le { return f64le(int(0 < x) - int(x < 0)) }
  253. sign_f64be :: proc "contextless" (x: f64be) -> f64be { return f64be(int(0 < x) - int(x < 0)) }
  254. sign :: proc{
  255. sign_f16, sign_f16le, sign_f16be,
  256. sign_f32, sign_f32le, sign_f32be,
  257. sign_f64, sign_f64le, sign_f64be,
  258. }
  259. sign_bit_f16 :: proc "contextless" (x: f16) -> bool {
  260. return (transmute(u16)x) & (1<<15) != 0
  261. }
  262. sign_bit_f16le :: proc "contextless" (x: f16le) -> bool { return #force_inline sign_bit_f16(f16(x)) }
  263. sign_bit_f16be :: proc "contextless" (x: f16be) -> bool { return #force_inline sign_bit_f16(f16(x)) }
  264. sign_bit_f32 :: proc "contextless" (x: f32) -> bool {
  265. return (transmute(u32)x) & (1<<31) != 0
  266. }
  267. sign_bit_f32le :: proc "contextless" (x: f32le) -> bool { return #force_inline sign_bit_f32(f32(x)) }
  268. sign_bit_f32be :: proc "contextless" (x: f32be) -> bool { return #force_inline sign_bit_f32(f32(x)) }
  269. sign_bit_f64 :: proc "contextless" (x: f64) -> bool {
  270. return (transmute(u64)x) & (1<<63) != 0
  271. }
  272. sign_bit_f64le :: proc "contextless" (x: f64le) -> bool { return #force_inline sign_bit_f64(f64(x)) }
  273. sign_bit_f64be :: proc "contextless" (x: f64be) -> bool { return #force_inline sign_bit_f64(f64(x)) }
  274. sign_bit :: proc{
  275. sign_bit_f16, sign_bit_f16le, sign_bit_f16be,
  276. sign_bit_f32, sign_bit_f32le, sign_bit_f32be,
  277. sign_bit_f64, sign_bit_f64le, sign_bit_f64be,
  278. }
  279. copy_sign_f16 :: proc "contextless" (x, y: f16) -> f16 {
  280. ix := transmute(u16)x
  281. iy := transmute(u16)y
  282. ix &= 0x7fff
  283. ix |= iy & 0x8000
  284. return transmute(f16)ix
  285. }
  286. copy_sign_f16le :: proc "contextless" (x, y: f16le) -> f16le { return #force_inline f16le(copy_sign_f16(f16(x), f16(y))) }
  287. copy_sign_f16be :: proc "contextless" (x, y: f16be) -> f16be { return #force_inline f16be(copy_sign_f16(f16(x), f16(y))) }
  288. copy_sign_f32 :: proc "contextless" (x, y: f32) -> f32 {
  289. ix := transmute(u32)x
  290. iy := transmute(u32)y
  291. ix &= 0x7fff_ffff
  292. ix |= iy & 0x8000_0000
  293. return transmute(f32)ix
  294. }
  295. copy_sign_f32le :: proc "contextless" (x, y: f32le) -> f32le { return #force_inline f32le(copy_sign_f32(f32(x), f32(y))) }
  296. copy_sign_f32be :: proc "contextless" (x, y: f32be) -> f32be { return #force_inline f32be(copy_sign_f32(f32(x), f32(y))) }
  297. copy_sign_f64 :: proc "contextless" (x, y: f64) -> f64 {
  298. ix := transmute(u64)x
  299. iy := transmute(u64)y
  300. ix &= 0x7fff_ffff_ffff_ffff
  301. ix |= iy & 0x8000_0000_0000_0000
  302. return transmute(f64)ix
  303. }
  304. copy_sign_f64le :: proc "contextless" (x, y: f64le) -> f64le { return #force_inline f64le(copy_sign_f64(f64(x), f64(y))) }
  305. copy_sign_f64be :: proc "contextless" (x, y: f64be) -> f64be { return #force_inline f64be(copy_sign_f64(f64(x), f64(y))) }
  306. copy_sign :: proc{
  307. copy_sign_f16, copy_sign_f16le, copy_sign_f16be,
  308. copy_sign_f32, copy_sign_f32le, copy_sign_f32be,
  309. copy_sign_f64, copy_sign_f64le, copy_sign_f64be,
  310. }
  311. to_radians_f16 :: proc "contextless" (degrees: f16) -> f16 { return degrees * RAD_PER_DEG }
  312. to_radians_f16le :: proc "contextless" (degrees: f16le) -> f16le { return degrees * RAD_PER_DEG }
  313. to_radians_f16be :: proc "contextless" (degrees: f16be) -> f16be { return degrees * RAD_PER_DEG }
  314. to_radians_f32 :: proc "contextless" (degrees: f32) -> f32 { return degrees * RAD_PER_DEG }
  315. to_radians_f32le :: proc "contextless" (degrees: f32le) -> f32le { return degrees * RAD_PER_DEG }
  316. to_radians_f32be :: proc "contextless" (degrees: f32be) -> f32be { return degrees * RAD_PER_DEG }
  317. to_radians_f64 :: proc "contextless" (degrees: f64) -> f64 { return degrees * RAD_PER_DEG }
  318. to_radians_f64le :: proc "contextless" (degrees: f64le) -> f64le { return degrees * RAD_PER_DEG }
  319. to_radians_f64be :: proc "contextless" (degrees: f64be) -> f64be { return degrees * RAD_PER_DEG }
  320. to_degrees_f16 :: proc "contextless" (radians: f16) -> f16 { return radians * DEG_PER_RAD }
  321. to_degrees_f16le :: proc "contextless" (radians: f16le) -> f16le { return radians * DEG_PER_RAD }
  322. to_degrees_f16be :: proc "contextless" (radians: f16be) -> f16be { return radians * DEG_PER_RAD }
  323. to_degrees_f32 :: proc "contextless" (radians: f32) -> f32 { return radians * DEG_PER_RAD }
  324. to_degrees_f32le :: proc "contextless" (radians: f32le) -> f32le { return radians * DEG_PER_RAD }
  325. to_degrees_f32be :: proc "contextless" (radians: f32be) -> f32be { return radians * DEG_PER_RAD }
  326. to_degrees_f64 :: proc "contextless" (radians: f64) -> f64 { return radians * DEG_PER_RAD }
  327. to_degrees_f64le :: proc "contextless" (radians: f64le) -> f64le { return radians * DEG_PER_RAD }
  328. to_degrees_f64be :: proc "contextless" (radians: f64be) -> f64be { return radians * DEG_PER_RAD }
  329. to_radians :: proc{
  330. to_radians_f16, to_radians_f16le, to_radians_f16be,
  331. to_radians_f32, to_radians_f32le, to_radians_f32be,
  332. to_radians_f64, to_radians_f64le, to_radians_f64be,
  333. }
  334. to_degrees :: proc{
  335. to_degrees_f16, to_degrees_f16le, to_degrees_f16be,
  336. to_degrees_f32, to_degrees_f32le, to_degrees_f32be,
  337. to_degrees_f64, to_degrees_f64le, to_degrees_f64be,
  338. }
  339. trunc_f16 :: proc "contextless" (x: f16) -> f16 {
  340. trunc_internal :: proc "contextless" (f: f16) -> f16 {
  341. mask :: F16_MASK
  342. shift :: F16_SHIFT
  343. bias :: F16_BIAS
  344. if f < 1 {
  345. switch {
  346. case f < 0: return -trunc_internal(-f)
  347. case f == 0: return f
  348. case: return 0
  349. }
  350. }
  351. x := transmute(u16)f
  352. e := (x >> shift) & mask - bias
  353. if e < shift {
  354. x &~= 1 << (shift-e) - 1
  355. }
  356. return transmute(f16)x
  357. }
  358. switch classify(x) {
  359. case .Zero, .Neg_Zero, .NaN, .Inf, .Neg_Inf:
  360. return x
  361. case .Normal, .Subnormal: // carry on
  362. }
  363. return trunc_internal(x)
  364. }
  365. trunc_f16le :: proc "contextless" (x: f16le) -> f16le { return #force_inline f16le(trunc_f16(f16(x))) }
  366. trunc_f16be :: proc "contextless" (x: f16be) -> f16be { return #force_inline f16be(trunc_f16(f16(x))) }
  367. trunc_f32 :: proc "contextless" (x: f32) -> f32 {
  368. trunc_internal :: proc "contextless" (f: f32) -> f32 {
  369. mask :: F32_MASK
  370. shift :: F32_SHIFT
  371. bias :: F32_BIAS
  372. if f < 1 {
  373. switch {
  374. case f < 0: return -trunc_internal(-f)
  375. case f == 0: return f
  376. case: return 0
  377. }
  378. }
  379. x := transmute(u32)f
  380. e := (x >> shift) & mask - bias
  381. if e < shift {
  382. x &~= 1 << (shift-e) - 1
  383. }
  384. return transmute(f32)x
  385. }
  386. switch classify(x) {
  387. case .Zero, .Neg_Zero, .NaN, .Inf, .Neg_Inf:
  388. return x
  389. case .Normal, .Subnormal: // carry on
  390. }
  391. return trunc_internal(x)
  392. }
  393. trunc_f32le :: proc "contextless" (x: f32le) -> f32le { return #force_inline f32le(trunc_f32(f32(x))) }
  394. trunc_f32be :: proc "contextless" (x: f32be) -> f32be { return #force_inline f32be(trunc_f32(f32(x))) }
  395. trunc_f64 :: proc "contextless" (x: f64) -> f64 {
  396. trunc_internal :: proc "contextless" (f: f64) -> f64 {
  397. mask :: F64_MASK
  398. shift :: F64_SHIFT
  399. bias :: F64_BIAS
  400. if f < 1 {
  401. switch {
  402. case f < 0: return -trunc_internal(-f)
  403. case f == 0: return f
  404. case: return 0
  405. }
  406. }
  407. x := transmute(u64)f
  408. e := (x >> shift) & mask - bias
  409. if e < shift {
  410. x &~= 1 << (shift-e) - 1
  411. }
  412. return transmute(f64)x
  413. }
  414. switch classify(x) {
  415. case .Zero, .Neg_Zero, .NaN, .Inf, .Neg_Inf:
  416. return x
  417. case .Normal, .Subnormal: // carry on
  418. }
  419. return trunc_internal(x)
  420. }
  421. trunc_f64le :: proc "contextless" (x: f64le) -> f64le { return #force_inline f64le(trunc_f64(f64(x))) }
  422. trunc_f64be :: proc "contextless" (x: f64be) -> f64be { return #force_inline f64be(trunc_f64(f64(x))) }
  423. // Removes the fractional part of the value, i.e. rounds towards zero.
  424. trunc :: proc{
  425. trunc_f16, trunc_f16le, trunc_f16be,
  426. trunc_f32, trunc_f32le, trunc_f32be,
  427. trunc_f64, trunc_f64le, trunc_f64be,
  428. }
  429. round_f16 :: proc "contextless" (x: f16) -> f16 {
  430. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  431. }
  432. round_f16le :: proc "contextless" (x: f16le) -> f16le {
  433. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  434. }
  435. round_f16be :: proc "contextless" (x: f16be) -> f16be {
  436. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  437. }
  438. round_f32 :: proc "contextless" (x: f32) -> f32 {
  439. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  440. }
  441. round_f32le :: proc "contextless" (x: f32le) -> f32le {
  442. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  443. }
  444. round_f32be :: proc "contextless" (x: f32be) -> f32be {
  445. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  446. }
  447. round_f64 :: proc "contextless" (x: f64) -> f64 {
  448. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  449. }
  450. round_f64le :: proc "contextless" (x: f64le) -> f64le {
  451. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  452. }
  453. round_f64be :: proc "contextless" (x: f64be) -> f64be {
  454. return ceil(x - 0.5) if x < 0 else floor(x + 0.5)
  455. }
  456. round :: proc{
  457. round_f16, round_f16le, round_f16be,
  458. round_f32, round_f32le, round_f32be,
  459. round_f64, round_f64le, round_f64be,
  460. }
  461. ceil_f16 :: proc "contextless" (x: f16) -> f16 { return -floor(-x) }
  462. ceil_f16le :: proc "contextless" (x: f16le) -> f16le { return -floor(-x) }
  463. ceil_f16be :: proc "contextless" (x: f16be) -> f16be { return -floor(-x) }
  464. ceil_f32 :: proc "contextless" (x: f32) -> f32 { return -floor(-x) }
  465. ceil_f32le :: proc "contextless" (x: f32le) -> f32le { return -floor(-x) }
  466. ceil_f32be :: proc "contextless" (x: f32be) -> f32be { return -floor(-x) }
  467. ceil_f64 :: proc "contextless" (x: f64) -> f64 { return -floor(-x) }
  468. ceil_f64le :: proc "contextless" (x: f64le) -> f64le { return -floor(-x) }
  469. ceil_f64be :: proc "contextless" (x: f64be) -> f64be { return -floor(-x) }
  470. ceil :: proc{
  471. ceil_f16, ceil_f16le, ceil_f16be,
  472. ceil_f32, ceil_f32le, ceil_f32be,
  473. ceil_f64, ceil_f64le, ceil_f64be,
  474. }
  475. floor_f16 :: proc "contextless" (x: f16) -> f16 {
  476. if x == 0 || is_nan(x) || is_inf(x) {
  477. return x
  478. }
  479. if x < 0 {
  480. d, fract := modf(-x)
  481. if fract != 0.0 {
  482. d = d + 1
  483. }
  484. return -d
  485. }
  486. d, _ := modf(x)
  487. return d
  488. }
  489. floor_f16le :: proc "contextless" (x: f16le) -> f16le { return #force_inline f16le(floor_f16(f16(x))) }
  490. floor_f16be :: proc "contextless" (x: f16be) -> f16be { return #force_inline f16be(floor_f16(f16(x))) }
  491. floor_f32 :: proc "contextless" (x: f32) -> f32 {
  492. if x == 0 || is_nan(x) || is_inf(x) {
  493. return x
  494. }
  495. if x < 0 {
  496. d, fract := modf(-x)
  497. if fract != 0.0 {
  498. d = d + 1
  499. }
  500. return -d
  501. }
  502. d, _ := modf(x)
  503. return d
  504. }
  505. floor_f32le :: proc "contextless" (x: f32le) -> f32le { return #force_inline f32le(floor_f32(f32(x))) }
  506. floor_f32be :: proc "contextless" (x: f32be) -> f32be { return #force_inline f32be(floor_f32(f32(x))) }
  507. floor_f64 :: proc "contextless" (x: f64) -> f64 {
  508. if x == 0 || is_nan(x) || is_inf(x) {
  509. return x
  510. }
  511. if x < 0 {
  512. d, fract := modf(-x)
  513. if fract != 0.0 {
  514. d = d + 1
  515. }
  516. return -d
  517. }
  518. d, _ := modf(x)
  519. return d
  520. }
  521. floor_f64le :: proc "contextless" (x: f64le) -> f64le { return #force_inline f64le(floor_f64(f64(x))) }
  522. floor_f64be :: proc "contextless" (x: f64be) -> f64be { return #force_inline f64be(floor_f64(f64(x))) }
  523. floor :: proc{
  524. floor_f16, floor_f16le, floor_f16be,
  525. floor_f32, floor_f32le, floor_f32be,
  526. floor_f64, floor_f64le, floor_f64be,
  527. }
  528. floor_div :: proc "contextless" (x, y: $T) -> T
  529. where intrinsics.type_is_integer(T) {
  530. a := x / y
  531. r := x % y
  532. if (r > 0 && y < 0) || (r < 0 && y > 0) {
  533. a -= 1
  534. }
  535. return a
  536. }
  537. floor_mod :: proc "contextless" (x, y: $T) -> T
  538. where intrinsics.type_is_integer(T) {
  539. r := x % y
  540. if (r > 0 && y < 0) || (r < 0 && y > 0) {
  541. r += y
  542. }
  543. return r
  544. }
  545. divmod :: #force_inline proc "contextless" (x, y: $T) -> (div, mod: T)
  546. where intrinsics.type_is_integer(T) {
  547. div = x / y
  548. mod = x % y
  549. return
  550. }
  551. floor_divmod :: #force_inline proc "contextless" (x, y: $T) -> (div, mod: T)
  552. where intrinsics.type_is_integer(T) {
  553. div = x / y
  554. mod = x % y
  555. if (div > 0 && y < 0) || (mod < 0 && y > 0) {
  556. div -= 1
  557. mod += y
  558. }
  559. return
  560. }
  561. modf_f16 :: proc "contextless" (x: f16) -> (int: f16, frac: f16) {
  562. shift :: F16_SHIFT
  563. mask :: F16_MASK
  564. bias :: F16_BIAS
  565. if x < 1 {
  566. switch {
  567. case x < 0:
  568. int, frac = modf(-x)
  569. return -int, -frac
  570. case x == 0:
  571. return x, x
  572. }
  573. return 0, x
  574. }
  575. i := transmute(u16)x
  576. e := uint(i>>shift)&mask - bias
  577. if e < shift {
  578. i &~= 1<<(shift-e) - 1
  579. }
  580. int = transmute(f16)i
  581. frac = x - int
  582. return
  583. }
  584. modf_f16le :: proc "contextless" (x: f16le) -> (int: f16le, frac: f16le) {
  585. i, f := #force_inline modf_f16(f16(x))
  586. return f16le(i), f16le(f)
  587. }
  588. modf_f16be :: proc "contextless" (x: f16be) -> (int: f16be, frac: f16be) {
  589. i, f := #force_inline modf_f16(f16(x))
  590. return f16be(i), f16be(f)
  591. }
  592. modf_f32 :: proc "contextless" (x: f32) -> (int: f32, frac: f32) {
  593. shift :: F32_SHIFT
  594. mask :: F32_MASK
  595. bias :: F32_BIAS
  596. if x < 1 {
  597. switch {
  598. case x < 0:
  599. int, frac = modf(-x)
  600. return -int, -frac
  601. case x == 0:
  602. return x, x
  603. }
  604. return 0, x
  605. }
  606. i := transmute(u32)x
  607. e := uint(i>>shift)&mask - bias
  608. if e < shift {
  609. i &~= 1<<(shift-e) - 1
  610. }
  611. int = transmute(f32)i
  612. frac = x - int
  613. return
  614. }
  615. modf_f32le :: proc "contextless" (x: f32le) -> (int: f32le, frac: f32le) {
  616. i, f := #force_inline modf_f32(f32(x))
  617. return f32le(i), f32le(f)
  618. }
  619. modf_f32be :: proc "contextless" (x: f32be) -> (int: f32be, frac: f32be) {
  620. i, f := #force_inline modf_f32(f32(x))
  621. return f32be(i), f32be(f)
  622. }
  623. modf_f64 :: proc "contextless" (x: f64) -> (int: f64, frac: f64) {
  624. shift :: F64_SHIFT
  625. mask :: F64_MASK
  626. bias :: F64_BIAS
  627. if x < 1 {
  628. switch {
  629. case x < 0:
  630. int, frac = modf(-x)
  631. return -int, -frac
  632. case x == 0:
  633. return x, x
  634. }
  635. return 0, x
  636. }
  637. i := transmute(u64)x
  638. e := uint(i>>shift)&mask - bias
  639. if e < shift {
  640. i &~= 1<<(shift-e) - 1
  641. }
  642. int = transmute(f64)i
  643. frac = x - int
  644. return
  645. }
  646. modf_f64le :: proc "contextless" (x: f64le) -> (int: f64le, frac: f64le) {
  647. i, f := #force_inline modf_f64(f64(x))
  648. return f64le(i), f64le(f)
  649. }
  650. modf_f64be :: proc "contextless" (x: f64be) -> (int: f64be, frac: f64be) {
  651. i, f := #force_inline modf_f64(f64(x))
  652. return f64be(i), f64be(f)
  653. }
  654. modf :: proc{
  655. modf_f16, modf_f16le, modf_f16be,
  656. modf_f32, modf_f32le, modf_f32be,
  657. modf_f64, modf_f64le, modf_f64be,
  658. }
  659. split_decimal :: modf
  660. mod_f16 :: proc "contextless" (x, y: f16) -> (n: f16) {
  661. z := abs(y)
  662. n = remainder(abs(x), z)
  663. if sign(n) < 0 {
  664. n += z
  665. }
  666. return copy_sign(n, x)
  667. }
  668. mod_f16le :: proc "contextless" (x, y: f16le) -> (n: f16le) { return #force_inline f16le(mod_f16(f16(x), f16(y))) }
  669. mod_f16be :: proc "contextless" (x, y: f16be) -> (n: f16be) { return #force_inline f16be(mod_f16(f16(x), f16(y))) }
  670. mod_f32 :: proc "contextless" (x, y: f32) -> (n: f32) {
  671. z := abs(y)
  672. n = remainder(abs(x), z)
  673. if sign(n) < 0 {
  674. n += z
  675. }
  676. return copy_sign(n, x)
  677. }
  678. mod_f32le :: proc "contextless" (x, y: f32le) -> (n: f32le) { return #force_inline f32le(mod_f32(f32(x), f32(y))) }
  679. mod_f32be :: proc "contextless" (x, y: f32be) -> (n: f32be) { return #force_inline f32be(mod_f32(f32(x), f32(y))) }
  680. mod_f64 :: proc "contextless" (x, y: f64) -> (n: f64) {
  681. z := abs(y)
  682. n = remainder(abs(x), z)
  683. if sign(n) < 0 {
  684. n += z
  685. }
  686. return copy_sign(n, x)
  687. }
  688. mod_f64le :: proc "contextless" (x, y: f64le) -> (n: f64le) { return #force_inline f64le(mod_f64(f64(x), f64(y))) }
  689. mod_f64be :: proc "contextless" (x, y: f64be) -> (n: f64be) { return #force_inline f64be(mod_f64(f64(x), f64(y))) }
  690. mod :: proc{
  691. mod_f16, mod_f16le, mod_f16be,
  692. mod_f32, mod_f32le, mod_f32be,
  693. mod_f64, mod_f64le, mod_f64be,
  694. }
  695. remainder_f16 :: proc "contextless" (x, y: f16 ) -> f16 { return x - round(x/y) * y }
  696. remainder_f16le :: proc "contextless" (x, y: f16le) -> f16le { return x - round(x/y) * y }
  697. remainder_f16be :: proc "contextless" (x, y: f16be) -> f16be { return x - round(x/y) * y }
  698. remainder_f32 :: proc "contextless" (x, y: f32 ) -> f32 { return x - round(x/y) * y }
  699. remainder_f32le :: proc "contextless" (x, y: f32le) -> f32le { return x - round(x/y) * y }
  700. remainder_f32be :: proc "contextless" (x, y: f32be) -> f32be { return x - round(x/y) * y }
  701. remainder_f64 :: proc "contextless" (x, y: f64 ) -> f64 { return x - round(x/y) * y }
  702. remainder_f64le :: proc "contextless" (x, y: f64le) -> f64le { return x - round(x/y) * y }
  703. remainder_f64be :: proc "contextless" (x, y: f64be) -> f64be { return x - round(x/y) * y }
  704. remainder :: proc{
  705. remainder_f16, remainder_f16le, remainder_f16be,
  706. remainder_f32, remainder_f32le, remainder_f32be,
  707. remainder_f64, remainder_f64le, remainder_f64be,
  708. }
  709. gcd :: proc "contextless" (x, y: $T) -> T
  710. where intrinsics.type_is_ordered_numeric(T) {
  711. x, y := x, y
  712. for y != 0 {
  713. x %= y
  714. x, y = y, x
  715. }
  716. return abs(x)
  717. }
  718. lcm :: proc "contextless" (x, y: $T) -> T
  719. where intrinsics.type_is_ordered_numeric(T) {
  720. return x / gcd(x, y) * y
  721. }
  722. normalize_f16 :: proc "contextless" (x: f16) -> (y: f16, exponent: int) {
  723. if abs(x) < F16_MIN {
  724. return x * (1<<F16_SHIFT), -F16_SHIFT
  725. }
  726. return x, 0
  727. }
  728. normalize_f32 :: proc "contextless" (x: f32) -> (y: f32, exponent: int) {
  729. if abs(x) < F32_MIN {
  730. return x * (1<<F32_SHIFT), -F32_SHIFT
  731. }
  732. return x, 0
  733. }
  734. normalize_f64 :: proc "contextless" (x: f64) -> (y: f64, exponent: int) {
  735. if abs(x) < F64_MIN {
  736. return x * (1<<F64_SHIFT), -F64_SHIFT
  737. }
  738. return x, 0
  739. }
  740. normalize_f16le :: proc "contextless" (x: f16le) -> (y: f16le, exponent: int) { y0, e := normalize_f16(f16(x)); return f16le(y0), e }
  741. normalize_f16be :: proc "contextless" (x: f16be) -> (y: f16be, exponent: int) { y0, e := normalize_f16(f16(x)); return f16be(y0), e }
  742. normalize_f32le :: proc "contextless" (x: f32le) -> (y: f32le, exponent: int) { y0, e := normalize_f32(f32(x)); return f32le(y0), e }
  743. normalize_f32be :: proc "contextless" (x: f32be) -> (y: f32be, exponent: int) { y0, e := normalize_f32(f32(x)); return f32be(y0), e }
  744. normalize_f64le :: proc "contextless" (x: f64le) -> (y: f64le, exponent: int) { y0, e := normalize_f64(f64(x)); return f64le(y0), e }
  745. normalize_f64be :: proc "contextless" (x: f64be) -> (y: f64be, exponent: int) { y0, e := normalize_f64(f64(x)); return f64be(y0), e }
  746. normalize :: proc{
  747. normalize_f16,
  748. normalize_f32,
  749. normalize_f64,
  750. normalize_f16le,
  751. normalize_f16be,
  752. normalize_f32le,
  753. normalize_f32be,
  754. normalize_f64le,
  755. normalize_f64be,
  756. }
  757. frexp_f16 :: proc "contextless" (x: f16) -> (significand: f16, exponent: int) {
  758. f, e := frexp_f64(f64(x))
  759. return f16(f), e
  760. }
  761. frexp_f16le :: proc "contextless" (x: f16le) -> (significand: f16le, exponent: int) {
  762. f, e := frexp_f64(f64(x))
  763. return f16le(f), e
  764. }
  765. frexp_f16be :: proc "contextless" (x: f16be) -> (significand: f16be, exponent: int) {
  766. f, e := frexp_f64(f64(x))
  767. return f16be(f), e
  768. }
  769. frexp_f32 :: proc "contextless" (x: f32) -> (significand: f32, exponent: int) {
  770. f, e := frexp_f64(f64(x))
  771. return f32(f), e
  772. }
  773. frexp_f32le :: proc "contextless" (x: f32le) -> (significand: f32le, exponent: int) {
  774. f, e := frexp_f64(f64(x))
  775. return f32le(f), e
  776. }
  777. frexp_f32be :: proc "contextless" (x: f32be) -> (significand: f32be, exponent: int) {
  778. f, e := frexp_f64(f64(x))
  779. return f32be(f), e
  780. }
  781. frexp_f64 :: proc "contextless" (f: f64) -> (significand: f64, exponent: int) {
  782. mask :: F64_MASK
  783. shift :: F64_SHIFT
  784. bias :: F64_BIAS
  785. switch {
  786. case f == 0:
  787. return 0, 0
  788. case is_inf(f) || is_nan(f):
  789. return f, 0
  790. }
  791. f := f
  792. f, exponent = normalize_f64(f)
  793. x := transmute(u64)f
  794. exponent += int((x>>shift)&mask) - bias + 1
  795. x &~= mask << shift
  796. x |= (-1 + bias) << shift
  797. significand = transmute(f64)x
  798. return
  799. }
  800. frexp_f64le :: proc "contextless" (x: f64le) -> (significand: f64le, exponent: int) {
  801. f, e := frexp_f64(f64(x))
  802. return f64le(f), e
  803. }
  804. frexp_f64be :: proc "contextless" (x: f64be) -> (significand: f64be, exponent: int) {
  805. f, e := frexp_f64(f64(x))
  806. return f64be(f), e
  807. }
  808. // frexp breaks the value into a normalized fraction, and an integral power of two
  809. // It returns a significand and exponent satisfying x == significand * 2**exponent
  810. // with the absolute value of significand in the intervalue of [0.5, 1).
  811. //
  812. // Special cases:
  813. // frexp(+0) = +0, 0
  814. // frexp(-0) = -0, 0
  815. // frexp(+inf) = +inf, 0
  816. // frexp(-inf) = -inf, 0
  817. // frexp(NaN) = NaN, 0
  818. frexp :: proc{
  819. frexp_f16, frexp_f16le, frexp_f16be,
  820. frexp_f32, frexp_f32le, frexp_f32be,
  821. frexp_f64, frexp_f64le, frexp_f64be,
  822. }
  823. binomial :: proc "contextless" (n, k: int) -> int {
  824. switch {
  825. case k <= 0: return 1
  826. case 2*k > n: return binomial(n, n-k)
  827. }
  828. b := n
  829. for i in 2..<k {
  830. b = (b * (n+1-i))/i
  831. }
  832. return b
  833. }
  834. factorial :: proc "contextless" (n: int) -> int {
  835. when size_of(int) == size_of(i64) {
  836. @static table := [21]int{
  837. 1,
  838. 1,
  839. 2,
  840. 6,
  841. 24,
  842. 120,
  843. 720,
  844. 5_040,
  845. 40_320,
  846. 362_880,
  847. 3_628_800,
  848. 39_916_800,
  849. 479_001_600,
  850. 6_227_020_800,
  851. 87_178_291_200,
  852. 1_307_674_368_000,
  853. 20_922_789_888_000,
  854. 355_687_428_096_000,
  855. 6_402_373_705_728_000,
  856. 121_645_100_408_832_000,
  857. 2_432_902_008_176_640_000,
  858. }
  859. } else {
  860. @static table := [13]int{
  861. 1,
  862. 1,
  863. 2,
  864. 6,
  865. 24,
  866. 120,
  867. 720,
  868. 5_040,
  869. 40_320,
  870. 362_880,
  871. 3_628_800,
  872. 39_916_800,
  873. 479_001_600,
  874. }
  875. }
  876. return table[n]
  877. }
  878. classify_f16 :: proc "contextless" (x: f16) -> Float_Class {
  879. switch {
  880. case x == 0:
  881. i := transmute(i16)x
  882. if i < 0 {
  883. return .Neg_Zero
  884. }
  885. return .Zero
  886. case x*0.25 == x:
  887. if x < 0 {
  888. return .Neg_Inf
  889. }
  890. return .Inf
  891. case !(x == x):
  892. return .NaN
  893. }
  894. u := transmute(u16)x
  895. exp := int(u>>10) & (1<<5 - 1)
  896. if exp == 0 {
  897. return .Subnormal
  898. }
  899. return .Normal
  900. }
  901. classify_f16le :: proc "contextless" (x: f16le) -> Float_Class { return #force_inline classify_f16(f16(x)) }
  902. classify_f16be :: proc "contextless" (x: f16be) -> Float_Class { return #force_inline classify_f16(f16(x)) }
  903. classify_f32 :: proc "contextless" (x: f32) -> Float_Class {
  904. switch {
  905. case x == 0:
  906. i := transmute(i32)x
  907. if i < 0 {
  908. return .Neg_Zero
  909. }
  910. return .Zero
  911. case x*0.5 == x:
  912. if x < 0 {
  913. return .Neg_Inf
  914. }
  915. return .Inf
  916. case !(x == x):
  917. return .NaN
  918. }
  919. u := transmute(u32)x
  920. exp := int(u>>23) & (1<<8 - 1)
  921. if exp == 0 {
  922. return .Subnormal
  923. }
  924. return .Normal
  925. }
  926. classify_f32le :: proc "contextless" (x: f32le) -> Float_Class { return #force_inline classify_f32(f32(x)) }
  927. classify_f32be :: proc "contextless" (x: f32be) -> Float_Class { return #force_inline classify_f32(f32(x)) }
  928. classify_f64 :: proc "contextless" (x: f64) -> Float_Class {
  929. switch {
  930. case x == 0:
  931. i := transmute(i64)x
  932. if i < 0 {
  933. return .Neg_Zero
  934. }
  935. return .Zero
  936. case x*0.5 == x:
  937. if x < 0 {
  938. return .Neg_Inf
  939. }
  940. return .Inf
  941. case !(x == x):
  942. return .NaN
  943. }
  944. u := transmute(u64)x
  945. exp := int(u>>52) & (1<<11 - 1)
  946. if exp == 0 {
  947. return .Subnormal
  948. }
  949. return .Normal
  950. }
  951. classify_f64le :: proc "contextless" (x: f64le) -> Float_Class { return #force_inline classify_f64(f64(x)) }
  952. classify_f64be :: proc "contextless" (x: f64be) -> Float_Class { return #force_inline classify_f64(f64(x)) }
  953. // Returns the `Float_Class` of the value, i.e. whether normal, subnormal, zero, negative zero, NaN, infinity or
  954. // negative infinity.
  955. classify :: proc{
  956. classify_f16, classify_f16le, classify_f16be,
  957. classify_f32, classify_f32le, classify_f32be,
  958. classify_f64, classify_f64le, classify_f64be,
  959. }
  960. is_nan_f16 :: proc "contextless" (x: f16) -> bool { return classify(x) == .NaN }
  961. is_nan_f16le :: proc "contextless" (x: f16le) -> bool { return classify(x) == .NaN }
  962. is_nan_f16be :: proc "contextless" (x: f16be) -> bool { return classify(x) == .NaN }
  963. is_nan_f32 :: proc "contextless" (x: f32) -> bool { return classify(x) == .NaN }
  964. is_nan_f32le :: proc "contextless" (x: f32le) -> bool { return classify(x) == .NaN }
  965. is_nan_f32be :: proc "contextless" (x: f32be) -> bool { return classify(x) == .NaN }
  966. is_nan_f64 :: proc "contextless" (x: f64) -> bool { return classify(x) == .NaN }
  967. is_nan_f64le :: proc "contextless" (x: f64le) -> bool { return classify(x) == .NaN }
  968. is_nan_f64be :: proc "contextless" (x: f64be) -> bool { return classify(x) == .NaN }
  969. is_nan :: proc{
  970. is_nan_f16, is_nan_f16le, is_nan_f16be,
  971. is_nan_f32, is_nan_f32le, is_nan_f32be,
  972. is_nan_f64, is_nan_f64le, is_nan_f64be,
  973. }
  974. // is_inf reports whether f is an infinity, according to sign.
  975. // If sign > 0, is_inf reports whether f is positive infinity.
  976. // If sign < 0, is_inf reports whether f is negative infinity.
  977. // If sign == 0, is_inf reports whether f is either infinity.
  978. is_inf_f16 :: proc "contextless" (x: f16, sign: int = 0) -> bool {
  979. class := classify(abs(x))
  980. switch {
  981. case sign > 0:
  982. return class == .Inf
  983. case sign < 0:
  984. return class == .Neg_Inf
  985. }
  986. return class == .Inf || class == .Neg_Inf
  987. }
  988. is_inf_f16le :: proc "contextless" (x: f16le, sign: int = 0) -> bool {
  989. return #force_inline is_inf_f16(f16(x), sign)
  990. }
  991. is_inf_f16be :: proc "contextless" (x: f16be, sign: int = 0) -> bool {
  992. return #force_inline is_inf_f16(f16(x), sign)
  993. }
  994. is_inf_f32 :: proc "contextless" (x: f32, sign: int = 0) -> bool {
  995. class := classify(abs(x))
  996. switch {
  997. case sign > 0:
  998. return class == .Inf
  999. case sign < 0:
  1000. return class == .Neg_Inf
  1001. }
  1002. return class == .Inf || class == .Neg_Inf
  1003. }
  1004. is_inf_f32le :: proc "contextless" (x: f32le, sign: int = 0) -> bool {
  1005. return #force_inline is_inf_f32(f32(x), sign)
  1006. }
  1007. is_inf_f32be :: proc "contextless" (x: f32be, sign: int = 0) -> bool {
  1008. return #force_inline is_inf_f32(f32(x), sign)
  1009. }
  1010. is_inf_f64 :: proc "contextless" (x: f64, sign: int = 0) -> bool {
  1011. class := classify(abs(x))
  1012. switch {
  1013. case sign > 0:
  1014. return class == .Inf
  1015. case sign < 0:
  1016. return class == .Neg_Inf
  1017. }
  1018. return class == .Inf || class == .Neg_Inf
  1019. }
  1020. is_inf_f64le :: proc "contextless" (x: f64le, sign: int = 0) -> bool {
  1021. return #force_inline is_inf_f64(f64(x), sign)
  1022. }
  1023. is_inf_f64be :: proc "contextless" (x: f64be, sign: int = 0) -> bool {
  1024. return #force_inline is_inf_f64(f64(x), sign)
  1025. }
  1026. is_inf :: proc{
  1027. is_inf_f16, is_inf_f16le, is_inf_f16be,
  1028. is_inf_f32, is_inf_f32le, is_inf_f32be,
  1029. is_inf_f64, is_inf_f64le, is_inf_f64be,
  1030. }
  1031. inf_f16 :: proc "contextless" (sign: int) -> f16 {
  1032. return f16(inf_f64(sign))
  1033. }
  1034. inf_f16le :: proc "contextless" (sign: int) -> f16le {
  1035. return f16le(inf_f64(sign))
  1036. }
  1037. inf_f16be :: proc "contextless" (sign: int) -> f16be {
  1038. return f16be(inf_f64(sign))
  1039. }
  1040. inf_f32 :: proc "contextless" (sign: int) -> f32 {
  1041. return f32(inf_f64(sign))
  1042. }
  1043. inf_f32le :: proc "contextless" (sign: int) -> f32le {
  1044. return f32le(inf_f64(sign))
  1045. }
  1046. inf_f32be :: proc "contextless" (sign: int) -> f32be {
  1047. return f32be(inf_f64(sign))
  1048. }
  1049. inf_f64 :: proc "contextless" (sign: int) -> f64 {
  1050. if sign >= 0 {
  1051. return 0h7ff00000_00000000
  1052. } else {
  1053. return 0hfff00000_00000000
  1054. }
  1055. }
  1056. inf_f64le :: proc "contextless" (sign: int) -> f64le {
  1057. return f64le(inf_f64(sign))
  1058. }
  1059. inf_f64be :: proc "contextless" (sign: int) -> f64be {
  1060. return f64be(inf_f64(sign))
  1061. }
  1062. nan_f16 :: proc "contextless" () -> f16 {
  1063. return f16(nan_f64())
  1064. }
  1065. nan_f16le :: proc "contextless" () -> f16le {
  1066. return f16le(nan_f64())
  1067. }
  1068. nan_f16be :: proc "contextless" () -> f16be {
  1069. return f16be(nan_f64())
  1070. }
  1071. nan_f32 :: proc "contextless" () -> f32 {
  1072. return f32(nan_f64())
  1073. }
  1074. nan_f32le :: proc "contextless" () -> f32le {
  1075. return f32le(nan_f64())
  1076. }
  1077. nan_f32be :: proc "contextless" () -> f32be {
  1078. return f32be(nan_f64())
  1079. }
  1080. nan_f64 :: proc "contextless" () -> f64 {
  1081. return 0h7ff80000_00000001
  1082. }
  1083. nan_f64le :: proc "contextless" () -> f64le {
  1084. return f64le(nan_f64())
  1085. }
  1086. nan_f64be :: proc "contextless" () -> f64be {
  1087. return f64be(nan_f64())
  1088. }
  1089. is_power_of_two :: proc "contextless" (x: int) -> bool {
  1090. return x > 0 && (x & (x-1)) == 0
  1091. }
  1092. next_power_of_two :: proc "contextless" (x: int) -> int {
  1093. k := x -1
  1094. when size_of(int) == 8 {
  1095. k = k | (k >> 32)
  1096. }
  1097. k = k | (k >> 16)
  1098. k = k | (k >> 8)
  1099. k = k | (k >> 4)
  1100. k = k | (k >> 2)
  1101. k = k | (k >> 1)
  1102. k += 1 + int(x <= 0)
  1103. return k
  1104. }
  1105. sum :: proc "contextless" (x: $T/[]$E) -> (res: E)
  1106. where intrinsics.type_is_numeric(E) {
  1107. for i in x {
  1108. res += i
  1109. }
  1110. return
  1111. }
  1112. prod :: proc "contextless" (x: $T/[]$E) -> (res: E)
  1113. where intrinsics.type_is_numeric(E) {
  1114. res = 1
  1115. for i in x {
  1116. res *= i
  1117. }
  1118. return
  1119. }
  1120. cumsum_inplace :: proc "contextless" (x: $T/[]$E)
  1121. where intrinsics.type_is_numeric(E) {
  1122. for i in 1..<len(x) {
  1123. x[i] = x[i-1] + x[i]
  1124. }
  1125. }
  1126. cumsum :: proc "contextless" (dst, src: $T/[]$E) -> T
  1127. where intrinsics.type_is_numeric(E) {
  1128. N := min(len(dst), len(src))
  1129. if N > 0 {
  1130. dst[0] = src[0]
  1131. for i in 1..<N {
  1132. dst[i] = dst[i-1] + src[i]
  1133. }
  1134. }
  1135. return dst[:N]
  1136. }
  1137. atan2_f16 :: proc "contextless" (y, x: f16) -> f16 {
  1138. // TODO(bill): Better atan2_f16
  1139. return f16(atan2_f64(f64(y), f64(x)))
  1140. }
  1141. atan2_f16le :: proc "contextless" (y, x: f16le) -> f16le {
  1142. // TODO(bill): Better atan2_f16
  1143. return f16le(atan2_f64(f64(y), f64(x)))
  1144. }
  1145. atan2_f16be :: proc "contextless" (y, x: f16be) -> f16be {
  1146. // TODO(bill): Better atan2_f16
  1147. return f16be(atan2_f64(f64(y), f64(x)))
  1148. }
  1149. atan2_f32 :: proc "contextless" (y, x: f32) -> f32 {
  1150. // TODO(bill): Better atan2_f32
  1151. return f32(atan2_f64(f64(y), f64(x)))
  1152. }
  1153. atan2_f32le :: proc "contextless" (y, x: f32le) -> f32le {
  1154. // TODO(bill): Better atan2_f32
  1155. return f32le(atan2_f64(f64(y), f64(x)))
  1156. }
  1157. atan2_f32be :: proc "contextless" (y, x: f32be) -> f32be {
  1158. // TODO(bill): Better atan2_f32
  1159. return f32be(atan2_f64(f64(y), f64(x)))
  1160. }
  1161. atan2_f64 :: proc "contextless" (y, x: f64) -> f64 {
  1162. // TODO(bill): Faster atan2_f64 if possible
  1163. // The original C code:
  1164. // Stephen L. Moshier
  1165. // [email protected]
  1166. NAN :: 0h7fff_ffff_ffff_ffff
  1167. INF :: 0h7FF0_0000_0000_0000
  1168. PI :: 0h4009_21fb_5444_2d18
  1169. atan :: proc "contextless" (x: f64) -> f64 {
  1170. if x == 0 {
  1171. return x
  1172. }
  1173. if x > 0 {
  1174. return s_atan(x)
  1175. }
  1176. return -s_atan(-x)
  1177. }
  1178. // s_atan reduces its argument (known to be positive) to the range [0, 0.66] and calls x_atan.
  1179. s_atan :: proc "contextless" (x: f64) -> f64 {
  1180. MORE_BITS :: 6.123233995736765886130e-17 // pi/2 = PIO2 + MORE_BITS
  1181. TAN3PI08 :: 2.41421356237309504880 // tan(3*pi/8)
  1182. if x <= 0.66 {
  1183. return x_atan(x)
  1184. }
  1185. if x > TAN3PI08 {
  1186. return PI/2 - x_atan(1/x) + MORE_BITS
  1187. }
  1188. return PI/4 + x_atan((x-1)/(x+1)) + 0.5*MORE_BITS
  1189. }
  1190. // x_atan evaluates a series valid in the range [0, 0.66].
  1191. x_atan :: proc "contextless" (x: f64) -> f64 {
  1192. P0 :: -8.750608600031904122785e-01
  1193. P1 :: -1.615753718733365076637e+01
  1194. P2 :: -7.500855792314704667340e+01
  1195. P3 :: -1.228866684490136173410e+02
  1196. P4 :: -6.485021904942025371773e+01
  1197. Q0 :: +2.485846490142306297962e+01
  1198. Q1 :: +1.650270098316988542046e+02
  1199. Q2 :: +4.328810604912902668951e+02
  1200. Q3 :: +4.853903996359136964868e+02
  1201. Q4 :: +1.945506571482613964425e+02
  1202. z := x * x
  1203. z = z * ((((P0*z+P1)*z+P2)*z+P3)*z + P4) / (((((z+Q0)*z+Q1)*z+Q2)*z+Q3)*z + Q4)
  1204. z = x*z + x
  1205. return z
  1206. }
  1207. switch {
  1208. case is_nan(y) || is_nan(x):
  1209. return NAN
  1210. case y == 0:
  1211. if x >= 0 && !sign_bit(x) {
  1212. return copy_sign(0.0, y)
  1213. }
  1214. return copy_sign(PI, y)
  1215. case x == 0:
  1216. return copy_sign(PI*0.5, y)
  1217. case is_inf(x, 0):
  1218. if is_inf(x, 1) {
  1219. if is_inf(y, 0) {
  1220. return copy_sign(PI*0.25, y)
  1221. }
  1222. return copy_sign(0, y)
  1223. }
  1224. if is_inf(y, 0) {
  1225. return copy_sign(PI*0.75, y)
  1226. }
  1227. return copy_sign(PI, y)
  1228. case is_inf(y, 0):
  1229. return copy_sign(PI*0.5, y)
  1230. }
  1231. q := atan(y / x)
  1232. if x < 0 {
  1233. if q <= 0 {
  1234. return q + PI
  1235. }
  1236. return q - PI
  1237. }
  1238. return q
  1239. }
  1240. atan2_f64le :: proc "contextless" (y, x: f64le) -> f64le {
  1241. // TODO(bill): Better atan2_f32
  1242. return f64le(atan2_f64(f64(y), f64(x)))
  1243. }
  1244. atan2_f64be :: proc "contextless" (y, x: f64be) -> f64be {
  1245. // TODO(bill): Better atan2_f32
  1246. return f64be(atan2_f64(f64(y), f64(x)))
  1247. }
  1248. atan2 :: proc{
  1249. atan2_f16, atan2_f16le, atan2_f16be,
  1250. atan2_f32, atan2_f32le, atan2_f32be,
  1251. atan2_f64, atan2_f64le, atan2_f64be,
  1252. }
  1253. atan :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1254. return atan2(x, 1)
  1255. }
  1256. asin :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1257. return atan2(x, sqrt(1 - x*x))
  1258. }
  1259. acos :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1260. return 2 * atan2(sqrt(1 - x), sqrt(1 + x))
  1261. }
  1262. sinh :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1263. return (exp(x) - exp(-x))*0.5
  1264. }
  1265. cosh :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1266. return (exp(x) + exp(-x))*0.5
  1267. }
  1268. tanh :: proc "contextless" (x: $T) -> T where intrinsics.type_is_float(T) {
  1269. t := exp(2*x)
  1270. return (t - 1) / (t + 1)
  1271. }
  1272. asinh :: proc "contextless" (y: $T) -> T where intrinsics.type_is_float(T) {
  1273. // The original C code, the long comment, and the constants
  1274. // below are from FreeBSD's /usr/src/lib/msun/src/s_asinh.c
  1275. // and came with this notice.
  1276. //
  1277. // ====================================================
  1278. // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  1279. //
  1280. // Developed at SunPro, a Sun Microsystems, Inc. business.
  1281. // Permission to use, copy, modify, and distribute this
  1282. // software is freely granted, provided that this notice
  1283. // is preserved.
  1284. // ====================================================
  1285. LN2 :: 0h3FE62E42FEFA39EF
  1286. NEAR_ZERO :: 1.0 / (1 << 28)
  1287. LARGE :: 1 << 28
  1288. x := f64(y)
  1289. if is_nan(x) || is_inf(x) {
  1290. return T(x)
  1291. }
  1292. sign := false
  1293. if x < 0 {
  1294. x = -x
  1295. sign = true
  1296. }
  1297. temp: f64
  1298. switch {
  1299. case x > LARGE:
  1300. temp = ln(x) + LN2
  1301. case x > 2:
  1302. temp = ln(2*x + 1/(sqrt(x*x + 1) + x))
  1303. case x < NEAR_ZERO:
  1304. temp = x
  1305. case:
  1306. temp = log1p(x + x*x/(1 + sqrt(1 + x*x)))
  1307. }
  1308. if sign {
  1309. temp = -temp
  1310. }
  1311. return T(temp)
  1312. }
  1313. acosh :: proc "contextless" (y: $T) -> T where intrinsics.type_is_float(T) {
  1314. // The original C code, the long comment, and the constants
  1315. // below are from FreeBSD's /usr/src/lib/msun/src/e_acosh.c
  1316. // and came with this notice.
  1317. //
  1318. // ====================================================
  1319. // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  1320. //
  1321. // Developed at SunPro, a Sun Microsystems, Inc. business.
  1322. // Permission to use, copy, modify, and distribute this
  1323. // software is freely granted, provided that this notice
  1324. // is preserved.
  1325. // ====================================================
  1326. LARGE :: 1<<28
  1327. LN2 :: 0h3FE62E42FEFA39EF
  1328. x := f64(y)
  1329. switch {
  1330. case x < 1 || is_nan(x):
  1331. return T(nan_f64())
  1332. case x == 1:
  1333. return 0
  1334. case x >= LARGE:
  1335. return T(ln(x) + LN2)
  1336. case x > 2:
  1337. return T(ln(2*x - 1/(x+sqrt(x*x-1))))
  1338. }
  1339. t := x-1
  1340. return T(log1p(t + sqrt(2*t + t*t)))
  1341. }
  1342. atanh :: proc "contextless" (y: $T) -> T where intrinsics.type_is_float(T) {
  1343. // The original C code, the long comment, and the constants
  1344. // below are from FreeBSD's /usr/src/lib/msun/src/e_atanh.c
  1345. // and came with this notice.
  1346. //
  1347. // ====================================================
  1348. // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  1349. //
  1350. // Developed at SunPro, a Sun Microsystems, Inc. business.
  1351. // Permission to use, copy, modify, and distribute this
  1352. // software is freely granted, provided that this notice
  1353. // is preserved.
  1354. // ====================================================
  1355. NEAR_ZERO :: 1.0 / (1 << 28)
  1356. x := f64(y)
  1357. switch {
  1358. case x < -1 || x > 1 || is_nan(x):
  1359. return T(nan_f64())
  1360. case x == 1:
  1361. return T(inf_f64(1))
  1362. case x == -1:
  1363. return T(inf_f64(-1))
  1364. }
  1365. sign := false
  1366. if x < 0 {
  1367. x = -x
  1368. sign = true
  1369. }
  1370. temp: f64
  1371. switch {
  1372. case x < NEAR_ZERO:
  1373. temp = x
  1374. case x < 0.5:
  1375. temp = x + x
  1376. temp = 0.5 * log1p(temp + temp*x/(1-x))
  1377. case:
  1378. temp = 0.5 * log1p((x+x)/(1-x))
  1379. }
  1380. if sign {
  1381. temp = -temp
  1382. }
  1383. return T(temp)
  1384. }
  1385. ilogb_f16 :: proc "contextless" (val: f16) -> int {
  1386. switch {
  1387. case val == 0: return int(min(i32))
  1388. case is_nan(val): return int(max(i32))
  1389. case is_inf(val): return int(max(i32))
  1390. }
  1391. x, exp := normalize_f16(val)
  1392. return int(((transmute(u16)x)>>F16_SHIFT)&F16_MASK) - F16_BIAS + exp
  1393. }
  1394. ilogb_f32 :: proc "contextless" (val: f32) -> int {
  1395. switch {
  1396. case val == 0: return int(min(i32))
  1397. case is_nan(val): return int(max(i32))
  1398. case is_inf(val): return int(max(i32))
  1399. }
  1400. x, exp := normalize_f32(val)
  1401. return int(((transmute(u32)x)>>F32_SHIFT)&F32_MASK) - F32_BIAS + exp
  1402. }
  1403. ilogb_f64 :: proc "contextless" (val: f64) -> int {
  1404. switch {
  1405. case val == 0: return int(min(i32))
  1406. case is_nan(val): return int(max(i32))
  1407. case is_inf(val): return int(max(i32))
  1408. }
  1409. x, exp := normalize_f64(val)
  1410. return int(((transmute(u64)x)>>F64_SHIFT)&F64_MASK) - F64_BIAS + exp
  1411. }
  1412. ilogb_f16le :: proc "contextless" (value: f16le) -> int { return ilogb_f16(f16(value)) }
  1413. ilogb_f16be :: proc "contextless" (value: f16be) -> int { return ilogb_f16(f16(value)) }
  1414. ilogb_f32le :: proc "contextless" (value: f32le) -> int { return ilogb_f32(f32(value)) }
  1415. ilogb_f32be :: proc "contextless" (value: f32be) -> int { return ilogb_f32(f32(value)) }
  1416. ilogb_f64le :: proc "contextless" (value: f64le) -> int { return ilogb_f64(f64(value)) }
  1417. ilogb_f64be :: proc "contextless" (value: f64be) -> int { return ilogb_f64(f64(value)) }
  1418. ilogb :: proc {
  1419. ilogb_f16,
  1420. ilogb_f32,
  1421. ilogb_f64,
  1422. ilogb_f16le,
  1423. ilogb_f16be,
  1424. ilogb_f32le,
  1425. ilogb_f32be,
  1426. ilogb_f64le,
  1427. ilogb_f64be,
  1428. }
  1429. logb_f16 :: proc "contextless" (val: f16) -> f16 {
  1430. switch {
  1431. case val == 0: return inf_f16(-1)
  1432. case is_inf(val): return inf_f16(+1)
  1433. case is_nan(val): return val
  1434. }
  1435. return f16(ilogb(val))
  1436. }
  1437. logb_f32 :: proc "contextless" (val: f32) -> f32 {
  1438. switch {
  1439. case val == 0: return inf_f32(-1)
  1440. case is_inf(val): return inf_f32(+1)
  1441. case is_nan(val): return val
  1442. }
  1443. return f32(ilogb(val))
  1444. }
  1445. logb_f64 :: proc "contextless" (val: f64) -> f64 {
  1446. switch {
  1447. case val == 0: return inf_f64(-1)
  1448. case is_inf(val): return inf_f64(+1)
  1449. case is_nan(val): return val
  1450. }
  1451. return f64(ilogb(val))
  1452. }
  1453. logb_f16le :: proc "contextless" (value: f16le) -> f16le { return f16le(logb_f16(f16(value))) }
  1454. logb_f16be :: proc "contextless" (value: f16be) -> f16be { return f16be(logb_f16(f16(value))) }
  1455. logb_f32le :: proc "contextless" (value: f32le) -> f32le { return f32le(logb_f32(f32(value))) }
  1456. logb_f32be :: proc "contextless" (value: f32be) -> f32be { return f32be(logb_f32(f32(value))) }
  1457. logb_f64le :: proc "contextless" (value: f64le) -> f64le { return f64le(logb_f64(f64(value))) }
  1458. logb_f64be :: proc "contextless" (value: f64be) -> f64be { return f64be(logb_f64(f64(value))) }
  1459. logb :: proc {
  1460. logb_f16,
  1461. logb_f32,
  1462. logb_f64,
  1463. logb_f16le,
  1464. logb_f16be,
  1465. logb_f32le,
  1466. logb_f32be,
  1467. logb_f64le,
  1468. logb_f64be,
  1469. }
  1470. nextafter_f16 :: proc "contextless" (x, y: f16) -> (r: f16) {
  1471. switch {
  1472. case is_nan(x) || is_nan(y):
  1473. r = nan_f16()
  1474. case x == y:
  1475. r = x
  1476. case x == 0:
  1477. r = copy_sign_f16(1, y)
  1478. case (y > x) == (x > 0):
  1479. r = transmute(f16)(transmute(u16)x + 1)
  1480. case:
  1481. r = transmute(f16)(transmute(u16)x - 1)
  1482. }
  1483. return
  1484. }
  1485. nextafter_f32 :: proc "contextless" (x, y: f32) -> (r: f32) {
  1486. switch {
  1487. case is_nan(x) || is_nan(y):
  1488. r = nan_f32()
  1489. case x == y:
  1490. r = x
  1491. case x == 0:
  1492. r = copy_sign_f32(1, y)
  1493. case (y > x) == (x > 0):
  1494. r = transmute(f32)(transmute(u32)x + 1)
  1495. case:
  1496. r = transmute(f32)(transmute(u32)x - 1)
  1497. }
  1498. return
  1499. }
  1500. nextafter_f64 :: proc "contextless" (x, y: f64) -> (r: f64) {
  1501. switch {
  1502. case is_nan(x) || is_nan(y):
  1503. r = nan_f64()
  1504. case x == y:
  1505. r = x
  1506. case x == 0:
  1507. r = copy_sign_f64(1, y)
  1508. case (y > x) == (x > 0):
  1509. r = transmute(f64)(transmute(u64)x + 1)
  1510. case:
  1511. r = transmute(f64)(transmute(u64)x - 1)
  1512. }
  1513. return
  1514. }
  1515. nextafter_f16le :: proc "contextless" (x, y: f16le) -> (r: f16le) { return f16le(nextafter_f16(f16(x), f16(y))) }
  1516. nextafter_f16be :: proc "contextless" (x, y: f16be) -> (r: f16be) { return f16be(nextafter_f16(f16(x), f16(y))) }
  1517. nextafter_f32le :: proc "contextless" (x, y: f32le) -> (r: f32le) { return f32le(nextafter_f32(f32(x), f32(y))) }
  1518. nextafter_f32be :: proc "contextless" (x, y: f32be) -> (r: f32be) { return f32be(nextafter_f32(f32(x), f32(y))) }
  1519. nextafter_f64le :: proc "contextless" (x, y: f64le) -> (r: f64le) { return f64le(nextafter_f64(f64(x), f64(y))) }
  1520. nextafter_f64be :: proc "contextless" (x, y: f64be) -> (r: f64be) { return f64be(nextafter_f64(f64(x), f64(y))) }
  1521. nextafter :: proc{
  1522. nextafter_f16, nextafter_f16le, nextafter_f16be,
  1523. nextafter_f32, nextafter_f32le, nextafter_f32be,
  1524. nextafter_f64, nextafter_f64le, nextafter_f64be,
  1525. }
  1526. signbit_f16 :: proc "contextless" (x: f16) -> bool {
  1527. return (transmute(u16)x)&(1<<15) != 0
  1528. }
  1529. signbit_f32 :: proc "contextless" (x: f32) -> bool {
  1530. return (transmute(u32)x)&(1<<31) != 0
  1531. }
  1532. signbit_f64 :: proc "contextless" (x: f64) -> bool {
  1533. return (transmute(u64)x)&(1<<63) != 0
  1534. }
  1535. signbit_f16le :: proc "contextless" (x: f16le) -> bool { return signbit_f16(f16(x)) }
  1536. signbit_f32le :: proc "contextless" (x: f32le) -> bool { return signbit_f32(f32(x)) }
  1537. signbit_f64le :: proc "contextless" (x: f64le) -> bool { return signbit_f64(f64(x)) }
  1538. signbit_f16be :: proc "contextless" (x: f16be) -> bool { return signbit_f16(f16(x)) }
  1539. signbit_f32be :: proc "contextless" (x: f32be) -> bool { return signbit_f32(f32(x)) }
  1540. signbit_f64be :: proc "contextless" (x: f64be) -> bool { return signbit_f64(f64(x)) }
  1541. signbit :: proc{
  1542. signbit_f16, signbit_f16le, signbit_f16be,
  1543. signbit_f32, signbit_f32le, signbit_f32be,
  1544. signbit_f64, signbit_f64le, signbit_f64be,
  1545. }
  1546. F16_DIG :: 3
  1547. F16_EPSILON :: 0.00097656
  1548. F16_GUARD :: 0
  1549. F16_MANT_DIG :: 11
  1550. F16_MAX :: 65504.0
  1551. F16_MAX_10_EXP :: 4
  1552. F16_MAX_EXP :: 15
  1553. F16_MIN :: 6.10351562e-5
  1554. F16_MIN_10_EXP :: -4
  1555. F16_MIN_EXP :: -14
  1556. F16_NORMALIZE :: 0
  1557. F16_RADIX :: 2
  1558. F16_ROUNDS :: 1
  1559. F32_DIG :: 6
  1560. F32_EPSILON :: 1.192092896e-07
  1561. F32_GUARD :: 0
  1562. F32_MANT_DIG :: 24
  1563. F32_MAX :: 3.402823466e+38
  1564. F32_MAX_10_EXP :: 38
  1565. F32_MAX_EXP :: 128
  1566. F32_MIN :: 1.175494351e-38
  1567. F32_MIN_10_EXP :: -37
  1568. F32_MIN_EXP :: -125
  1569. F32_NORMALIZE :: 0
  1570. F32_RADIX :: 2
  1571. F32_ROUNDS :: 1
  1572. F64_DIG :: 15 // # of decimal digits of precision
  1573. F64_EPSILON :: 2.2204460492503131e-016 // smallest such that 1.0+F64_EPSILON != 1.0
  1574. F64_MANT_DIG :: 53 // # of bits in mantissa
  1575. F64_MAX :: 1.7976931348623158e+308 // max value
  1576. F64_MAX_10_EXP :: 308 // max decimal exponent
  1577. F64_MAX_EXP :: 1024 // max binary exponent
  1578. F64_MIN :: 2.2250738585072014e-308 // min positive value
  1579. F64_MIN_10_EXP :: -307 // min decimal exponent
  1580. F64_MIN_EXP :: -1021 // min binary exponent
  1581. F64_RADIX :: 2 // exponent radix
  1582. F64_ROUNDS :: 1 // addition rounding: near
  1583. F16_MASK :: 0x1f
  1584. F16_SHIFT :: 16 - 6
  1585. F16_BIAS :: 0xf
  1586. F32_MASK :: 0xff
  1587. F32_SHIFT :: 32 - 9
  1588. F32_BIAS :: 0x7f
  1589. F64_MASK :: 0x7ff
  1590. F64_SHIFT :: 64 - 12
  1591. F64_BIAS :: 0x3ff
  1592. INF_F16 :f16: 0h7C00
  1593. NEG_INF_F16 :f16: 0hFC00
  1594. SNAN_F16 :f16: 0h7C01
  1595. QNAN_F16 :f16: 0h7E01
  1596. INF_F32 :f32: 0h7F80_0000
  1597. NEG_INF_F32 :f32: 0hFF80_0000
  1598. SNAN_F32 :f32: 0hFF80_0001
  1599. QNAN_F32 :f32: 0hFFC0_0001
  1600. INF_F64 :f64: 0h7FF0_0000_0000_0000
  1601. NEG_INF_F64 :f64: 0hFFF0_0000_0000_0000
  1602. SNAN_F64 :f64: 0h7FF0_0000_0000_0001
  1603. QNAN_F64 :f64: 0h7FF8_0000_0000_0001