math.odin 79 KB

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