math.odin 81 KB

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