math.odin 81 KB

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