math.odin 63 KB

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