math.odin 72 KB

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