math.odin 81 KB

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