math.odin 80 KB

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