vfpdouble.cpp 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234
  1. /*
  2. vfp/vfpdouble.c - ARM VFPv3 emulation unit - SoftFloat double instruction
  3. Copyright (C) 2003 Skyeye Develop Group
  4. for help please send mail to <skyeye-developer@lists.gro.clinux.org>
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  16. */
  17. /*
  18. * This code is derived in part from :
  19. * - Android kernel
  20. * - John R. Housers softfloat library, which
  21. * carries the following notice:
  22. *
  23. * ===========================================================================
  24. * This C source file is part of the SoftFloat IEC/IEEE Floating-point
  25. * Arithmetic Package, Release 2.
  26. *
  27. * Written by John R. Hauser. This work was made possible in part by the
  28. * International Computer Science Institute, located at Suite 600, 1947 Center
  29. * Street, Berkeley, California 94704. Funding was partially provided by the
  30. * National Science Foundation under grant MIP-9311980. The original version
  31. * of this code was written as part of a project to build a fixed-point vector
  32. * processor in collaboration with the University of California at Berkeley,
  33. * overseen by Profs. Nelson Morgan and John Wawrzynek. More information
  34. * is available through the web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
  35. * arithmetic/softfloat.html'.
  36. *
  37. * THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
  38. * has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
  39. * TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
  40. * PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
  41. * AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
  42. *
  43. * Derivative works are acceptable, even for commercial purposes, so long as
  44. * (1) they include prominent notice that the work is derivative, and (2) they
  45. * include prominent notice akin to these three paragraphs for those parts of
  46. * this code that are retained.
  47. * ===========================================================================
  48. */
  49. #include <algorithm>
  50. #include "common/logging/log.h"
  51. #include "core/arm/skyeye_common/vfp/asm_vfp.h"
  52. #include "core/arm/skyeye_common/vfp/vfp.h"
  53. #include "core/arm/skyeye_common/vfp/vfp_helper.h"
  54. static struct vfp_double vfp_double_default_qnan = {
  55. 2047, 0, VFP_DOUBLE_SIGNIFICAND_QNAN,
  56. };
  57. static void vfp_double_dump(const char* str, struct vfp_double* d) {
  58. LOG_TRACE(Core_ARM11, "VFP: %s: sign=%d exponent=%d significand=%016llx", str, d->sign != 0,
  59. d->exponent, d->significand);
  60. }
  61. static void vfp_double_normalise_denormal(struct vfp_double* vd) {
  62. int bits = 31 - fls((u32)(vd->significand >> 32));
  63. if (bits == 31)
  64. bits = 63 - fls((u32)vd->significand);
  65. vfp_double_dump("normalise_denormal: in", vd);
  66. if (bits) {
  67. vd->exponent -= bits - 1;
  68. vd->significand <<= bits;
  69. }
  70. vfp_double_dump("normalise_denormal: out", vd);
  71. }
  72. u32 vfp_double_normaliseround(ARMul_State* state, int dd, struct vfp_double* vd, u32 fpscr,
  73. u32 exceptions, const char* func) {
  74. u64 significand, incr;
  75. int exponent, shift, underflow;
  76. u32 rmode;
  77. vfp_double_dump("pack: in", vd);
  78. /*
  79. * Infinities and NaNs are a special case.
  80. */
  81. if (vd->exponent == 2047 && (vd->significand == 0 || exceptions))
  82. goto pack;
  83. /*
  84. * Special-case zero.
  85. */
  86. if (vd->significand == 0) {
  87. vd->exponent = 0;
  88. goto pack;
  89. }
  90. exponent = vd->exponent;
  91. significand = vd->significand;
  92. shift = 32 - fls((u32)(significand >> 32));
  93. if (shift == 32)
  94. shift = 64 - fls((u32)significand);
  95. if (shift) {
  96. exponent -= shift;
  97. significand <<= shift;
  98. }
  99. #if 1
  100. vd->exponent = exponent;
  101. vd->significand = significand;
  102. vfp_double_dump("pack: normalised", vd);
  103. #endif
  104. /*
  105. * Tiny number?
  106. */
  107. underflow = exponent < 0;
  108. if (underflow) {
  109. significand = vfp_shiftright64jamming(significand, -exponent);
  110. exponent = 0;
  111. #if 1
  112. vd->exponent = exponent;
  113. vd->significand = significand;
  114. vfp_double_dump("pack: tiny number", vd);
  115. #endif
  116. if (!(significand & ((1ULL << (VFP_DOUBLE_LOW_BITS + 1)) - 1)))
  117. underflow = 0;
  118. }
  119. /*
  120. * Select rounding increment.
  121. */
  122. incr = 0;
  123. rmode = fpscr & FPSCR_RMODE_MASK;
  124. if (rmode == FPSCR_ROUND_NEAREST) {
  125. incr = 1ULL << VFP_DOUBLE_LOW_BITS;
  126. if ((significand & (1ULL << (VFP_DOUBLE_LOW_BITS + 1))) == 0)
  127. incr -= 1;
  128. } else if (rmode == FPSCR_ROUND_TOZERO) {
  129. incr = 0;
  130. } else if ((rmode == FPSCR_ROUND_PLUSINF) ^ (vd->sign != 0))
  131. incr = (1ULL << (VFP_DOUBLE_LOW_BITS + 1)) - 1;
  132. LOG_TRACE(Core_ARM11, "VFP: rounding increment = 0x%08llx", incr);
  133. /*
  134. * Is our rounding going to overflow?
  135. */
  136. if ((significand + incr) < significand) {
  137. exponent += 1;
  138. significand = (significand >> 1) | (significand & 1);
  139. incr >>= 1;
  140. #if 1
  141. vd->exponent = exponent;
  142. vd->significand = significand;
  143. vfp_double_dump("pack: overflow", vd);
  144. #endif
  145. }
  146. /*
  147. * If any of the low bits (which will be shifted out of the
  148. * number) are non-zero, the result is inexact.
  149. */
  150. if (significand & ((1 << (VFP_DOUBLE_LOW_BITS + 1)) - 1))
  151. exceptions |= FPSCR_IXC;
  152. /*
  153. * Do our rounding.
  154. */
  155. significand += incr;
  156. /*
  157. * Infinity?
  158. */
  159. if (exponent >= 2046) {
  160. exceptions |= FPSCR_OFC | FPSCR_IXC;
  161. if (incr == 0) {
  162. vd->exponent = 2045;
  163. vd->significand = 0x7fffffffffffffffULL;
  164. } else {
  165. vd->exponent = 2047; /* infinity */
  166. vd->significand = 0;
  167. }
  168. } else {
  169. if (significand >> (VFP_DOUBLE_LOW_BITS + 1) == 0)
  170. exponent = 0;
  171. if (exponent || significand > 0x8000000000000000ULL)
  172. underflow = 0;
  173. if (underflow)
  174. exceptions |= FPSCR_UFC;
  175. vd->exponent = exponent;
  176. vd->significand = significand >> 1;
  177. }
  178. pack:
  179. vfp_double_dump("pack: final", vd);
  180. {
  181. s64 d = vfp_double_pack(vd);
  182. LOG_TRACE(Core_ARM11, "VFP: %s: d(d%d)=%016llx exceptions=%08x", func, dd, d, exceptions);
  183. vfp_put_double(state, d, dd);
  184. }
  185. return exceptions;
  186. }
  187. /*
  188. * Propagate the NaN, setting exceptions if it is signalling.
  189. * 'n' is always a NaN. 'm' may be a number, NaN or infinity.
  190. */
  191. static u32 vfp_propagate_nan(struct vfp_double* vdd, struct vfp_double* vdn, struct vfp_double* vdm,
  192. u32 fpscr) {
  193. struct vfp_double* nan;
  194. int tn, tm = 0;
  195. tn = vfp_double_type(vdn);
  196. if (vdm)
  197. tm = vfp_double_type(vdm);
  198. if (fpscr & FPSCR_DEFAULT_NAN)
  199. /*
  200. * Default NaN mode - always returns a quiet NaN
  201. */
  202. nan = &vfp_double_default_qnan;
  203. else {
  204. /*
  205. * Contemporary mode - select the first signalling
  206. * NAN, or if neither are signalling, the first
  207. * quiet NAN.
  208. */
  209. if (tn == VFP_SNAN || (tm != VFP_SNAN && tn == VFP_QNAN))
  210. nan = vdn;
  211. else
  212. nan = vdm;
  213. /*
  214. * Make the NaN quiet.
  215. */
  216. nan->significand |= VFP_DOUBLE_SIGNIFICAND_QNAN;
  217. }
  218. *vdd = *nan;
  219. /*
  220. * If one was a signalling NAN, raise invalid operation.
  221. */
  222. return tn == VFP_SNAN || tm == VFP_SNAN ? FPSCR_IOC : VFP_NAN_FLAG;
  223. }
  224. /*
  225. * Extended operations
  226. */
  227. static u32 vfp_double_fabs(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  228. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  229. vfp_put_double(state, vfp_double_packed_abs(vfp_get_double(state, dm)), dd);
  230. return 0;
  231. }
  232. static u32 vfp_double_fcpy(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  233. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  234. vfp_put_double(state, vfp_get_double(state, dm), dd);
  235. return 0;
  236. }
  237. static u32 vfp_double_fneg(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  238. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  239. vfp_put_double(state, vfp_double_packed_negate(vfp_get_double(state, dm)), dd);
  240. return 0;
  241. }
  242. static u32 vfp_double_fsqrt(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  243. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  244. vfp_double vdm, vdd, *vdp;
  245. int ret, tm;
  246. u32 exceptions = 0;
  247. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  248. tm = vfp_double_type(&vdm);
  249. if (tm & (VFP_NAN | VFP_INFINITY)) {
  250. vdp = &vdd;
  251. if (tm & VFP_NAN)
  252. ret = vfp_propagate_nan(vdp, &vdm, nullptr, fpscr);
  253. else if (vdm.sign == 0) {
  254. sqrt_copy:
  255. vdp = &vdm;
  256. ret = 0;
  257. } else {
  258. sqrt_invalid:
  259. vdp = &vfp_double_default_qnan;
  260. ret = FPSCR_IOC;
  261. }
  262. vfp_put_double(state, vfp_double_pack(vdp), dd);
  263. return ret;
  264. }
  265. /*
  266. * sqrt(+/- 0) == +/- 0
  267. */
  268. if (tm & VFP_ZERO)
  269. goto sqrt_copy;
  270. /*
  271. * Normalise a denormalised number
  272. */
  273. if (tm & VFP_DENORMAL)
  274. vfp_double_normalise_denormal(&vdm);
  275. /*
  276. * sqrt(<0) = invalid
  277. */
  278. if (vdm.sign)
  279. goto sqrt_invalid;
  280. vfp_double_dump("sqrt", &vdm);
  281. /*
  282. * Estimate the square root.
  283. */
  284. vdd.sign = 0;
  285. vdd.exponent = ((vdm.exponent - 1023) >> 1) + 1023;
  286. vdd.significand = (u64)vfp_estimate_sqrt_significand(vdm.exponent, vdm.significand >> 32) << 31;
  287. vfp_double_dump("sqrt estimate1", &vdd);
  288. vdm.significand >>= 1 + (vdm.exponent & 1);
  289. vdd.significand += 2 + vfp_estimate_div128to64(vdm.significand, 0, vdd.significand);
  290. vfp_double_dump("sqrt estimate2", &vdd);
  291. /*
  292. * And now adjust.
  293. */
  294. if ((vdd.significand & VFP_DOUBLE_LOW_BITS_MASK) <= 5) {
  295. if (vdd.significand < 2) {
  296. vdd.significand = ~0ULL;
  297. } else {
  298. u64 termh, terml, remh, reml;
  299. vdm.significand <<= 2;
  300. mul64to128(&termh, &terml, vdd.significand, vdd.significand);
  301. sub128(&remh, &reml, vdm.significand, 0, termh, terml);
  302. while ((s64)remh < 0) {
  303. vdd.significand -= 1;
  304. shift64left(&termh, &terml, vdd.significand);
  305. terml |= 1;
  306. add128(&remh, &reml, remh, reml, termh, terml);
  307. }
  308. vdd.significand |= (remh | reml) != 0;
  309. }
  310. }
  311. vdd.significand = vfp_shiftright64jamming(vdd.significand, 1);
  312. exceptions |= vfp_double_normaliseround(state, dd, &vdd, fpscr, 0, "fsqrt");
  313. return exceptions;
  314. }
  315. /*
  316. * Equal := ZC
  317. * Less than := N
  318. * Greater than := C
  319. * Unordered := CV
  320. */
  321. static u32 vfp_compare(ARMul_State* state, int dd, int signal_on_qnan, int dm, u32 fpscr) {
  322. s64 d, m;
  323. u32 ret = 0;
  324. LOG_TRACE(Core_ARM11, "In %s, state=0x%p, fpscr=0x%x", __FUNCTION__, state, fpscr);
  325. m = vfp_get_double(state, dm);
  326. if (vfp_double_packed_exponent(m) == 2047 && vfp_double_packed_mantissa(m)) {
  327. ret |= FPSCR_CFLAG | FPSCR_VFLAG;
  328. if (signal_on_qnan ||
  329. !(vfp_double_packed_mantissa(m) & (1ULL << (VFP_DOUBLE_MANTISSA_BITS - 1))))
  330. /*
  331. * Signalling NaN, or signalling on quiet NaN
  332. */
  333. ret |= FPSCR_IOC;
  334. }
  335. d = vfp_get_double(state, dd);
  336. if (vfp_double_packed_exponent(d) == 2047 && vfp_double_packed_mantissa(d)) {
  337. ret |= FPSCR_CFLAG | FPSCR_VFLAG;
  338. if (signal_on_qnan ||
  339. !(vfp_double_packed_mantissa(d) & (1ULL << (VFP_DOUBLE_MANTISSA_BITS - 1))))
  340. /*
  341. * Signalling NaN, or signalling on quiet NaN
  342. */
  343. ret |= FPSCR_IOC;
  344. }
  345. if (ret == 0) {
  346. // printf("In %s, d=%lld, m =%lld\n ", __FUNCTION__, d, m);
  347. if (d == m || vfp_double_packed_abs(d | m) == 0) {
  348. /*
  349. * equal
  350. */
  351. ret |= FPSCR_ZFLAG | FPSCR_CFLAG;
  352. // printf("In %s,1 ret=0x%x\n", __FUNCTION__, ret);
  353. } else if (vfp_double_packed_sign(d ^ m)) {
  354. /*
  355. * different signs
  356. */
  357. if (vfp_double_packed_sign(d))
  358. /*
  359. * d is negative, so d < m
  360. */
  361. ret |= FPSCR_NFLAG;
  362. else
  363. /*
  364. * d is positive, so d > m
  365. */
  366. ret |= FPSCR_CFLAG;
  367. } else if ((vfp_double_packed_sign(d) != 0) ^ (d < m)) {
  368. /*
  369. * d < m
  370. */
  371. ret |= FPSCR_NFLAG;
  372. } else if ((vfp_double_packed_sign(d) != 0) ^ (d > m)) {
  373. /*
  374. * d > m
  375. */
  376. ret |= FPSCR_CFLAG;
  377. }
  378. }
  379. LOG_TRACE(Core_ARM11, "In %s, state=0x%p, ret=0x%x", __FUNCTION__, state, ret);
  380. return ret;
  381. }
  382. static u32 vfp_double_fcmp(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  383. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  384. return vfp_compare(state, dd, 0, dm, fpscr);
  385. }
  386. static u32 vfp_double_fcmpe(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  387. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  388. return vfp_compare(state, dd, 1, dm, fpscr);
  389. }
  390. static u32 vfp_double_fcmpz(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  391. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  392. return vfp_compare(state, dd, 0, VFP_REG_ZERO, fpscr);
  393. }
  394. static u32 vfp_double_fcmpez(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  395. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  396. return vfp_compare(state, dd, 1, VFP_REG_ZERO, fpscr);
  397. }
  398. static u32 vfp_double_fcvts(ARMul_State* state, int sd, int unused, int dm, u32 fpscr) {
  399. struct vfp_double vdm;
  400. struct vfp_single vsd;
  401. int tm;
  402. u32 exceptions = 0;
  403. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  404. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  405. tm = vfp_double_type(&vdm);
  406. /*
  407. * If we have a signalling NaN, signal invalid operation.
  408. */
  409. if (tm == VFP_SNAN)
  410. exceptions = FPSCR_IOC;
  411. if (tm & VFP_DENORMAL)
  412. vfp_double_normalise_denormal(&vdm);
  413. vsd.sign = vdm.sign;
  414. vsd.significand = vfp_hi64to32jamming(vdm.significand);
  415. /*
  416. * If we have an infinity or a NaN, the exponent must be 255
  417. */
  418. if (tm & (VFP_INFINITY | VFP_NAN)) {
  419. vsd.exponent = 255;
  420. if (tm == VFP_QNAN)
  421. vsd.significand |= VFP_SINGLE_SIGNIFICAND_QNAN;
  422. goto pack_nan;
  423. } else if (tm & VFP_ZERO)
  424. vsd.exponent = 0;
  425. else
  426. vsd.exponent = vdm.exponent - (1023 - 127);
  427. return vfp_single_normaliseround(state, sd, &vsd, fpscr, exceptions, "fcvts");
  428. pack_nan:
  429. vfp_put_float(state, vfp_single_pack(&vsd), sd);
  430. return exceptions;
  431. }
  432. static u32 vfp_double_fuito(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  433. struct vfp_double vdm;
  434. u32 m = vfp_get_float(state, dm);
  435. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  436. vdm.sign = 0;
  437. vdm.exponent = 1023 + 63 - 1;
  438. vdm.significand = (u64)m;
  439. return vfp_double_normaliseround(state, dd, &vdm, fpscr, 0, "fuito");
  440. }
  441. static u32 vfp_double_fsito(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  442. struct vfp_double vdm;
  443. u32 m = vfp_get_float(state, dm);
  444. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  445. vdm.sign = (m & 0x80000000) >> 16;
  446. vdm.exponent = 1023 + 63 - 1;
  447. vdm.significand = vdm.sign ? (~m + 1) : m;
  448. return vfp_double_normaliseround(state, dd, &vdm, fpscr, 0, "fsito");
  449. }
  450. static u32 vfp_double_ftoui(ARMul_State* state, int sd, int unused, int dm, u32 fpscr) {
  451. struct vfp_double vdm;
  452. u32 d, exceptions = 0;
  453. int rmode = fpscr & FPSCR_RMODE_MASK;
  454. int tm;
  455. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  456. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  457. /*
  458. * Do we have a denormalised number?
  459. */
  460. tm = vfp_double_type(&vdm);
  461. if (tm & VFP_DENORMAL)
  462. exceptions |= FPSCR_IDC;
  463. if (tm & VFP_NAN)
  464. vdm.sign = 1;
  465. if (vdm.exponent >= 1023 + 32) {
  466. d = vdm.sign ? 0 : 0xffffffff;
  467. exceptions = FPSCR_IOC;
  468. } else if (vdm.exponent >= 1023) {
  469. int shift = 1023 + 63 - vdm.exponent;
  470. u64 rem, incr = 0;
  471. /*
  472. * 2^0 <= m < 2^32-2^8
  473. */
  474. d = (u32)((vdm.significand << 1) >> shift);
  475. rem = vdm.significand << (65 - shift);
  476. if (rmode == FPSCR_ROUND_NEAREST) {
  477. incr = 0x8000000000000000ULL;
  478. if ((d & 1) == 0)
  479. incr -= 1;
  480. } else if (rmode == FPSCR_ROUND_TOZERO) {
  481. incr = 0;
  482. } else if ((rmode == FPSCR_ROUND_PLUSINF) ^ (vdm.sign != 0)) {
  483. incr = ~0ULL;
  484. }
  485. if ((rem + incr) < rem) {
  486. if (d < 0xffffffff)
  487. d += 1;
  488. else
  489. exceptions |= FPSCR_IOC;
  490. }
  491. if (d && vdm.sign) {
  492. d = 0;
  493. exceptions |= FPSCR_IOC;
  494. } else if (rem)
  495. exceptions |= FPSCR_IXC;
  496. } else {
  497. d = 0;
  498. if (vdm.exponent | vdm.significand) {
  499. if (rmode == FPSCR_ROUND_NEAREST) {
  500. if (vdm.exponent >= 1022) {
  501. d = vdm.sign ? 0 : 1;
  502. exceptions |= vdm.sign ? FPSCR_IOC : FPSCR_IXC;
  503. } else {
  504. exceptions |= FPSCR_IXC;
  505. }
  506. } else if (rmode == FPSCR_ROUND_PLUSINF && vdm.sign == 0) {
  507. d = 1;
  508. exceptions |= FPSCR_IXC;
  509. } else if (rmode == FPSCR_ROUND_MINUSINF) {
  510. exceptions |= vdm.sign ? FPSCR_IOC : FPSCR_IXC;
  511. } else {
  512. exceptions |= FPSCR_IXC;
  513. }
  514. }
  515. }
  516. LOG_TRACE(Core_ARM11, "VFP: ftoui: d(s%d)=%08x exceptions=%08x", sd, d, exceptions);
  517. vfp_put_float(state, d, sd);
  518. return exceptions;
  519. }
  520. static u32 vfp_double_ftouiz(ARMul_State* state, int sd, int unused, int dm, u32 fpscr) {
  521. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  522. return vfp_double_ftoui(state, sd, unused, dm,
  523. (fpscr & ~FPSCR_RMODE_MASK) | FPSCR_ROUND_TOZERO);
  524. }
  525. static u32 vfp_double_ftosi(ARMul_State* state, int sd, int unused, int dm, u32 fpscr) {
  526. struct vfp_double vdm;
  527. u32 d, exceptions = 0;
  528. int rmode = fpscr & FPSCR_RMODE_MASK;
  529. int tm;
  530. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  531. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  532. vfp_double_dump("VDM", &vdm);
  533. /*
  534. * Do we have denormalised number?
  535. */
  536. tm = vfp_double_type(&vdm);
  537. if (tm & VFP_DENORMAL)
  538. exceptions |= FPSCR_IDC;
  539. if (tm & VFP_NAN) {
  540. d = 0;
  541. exceptions |= FPSCR_IOC;
  542. } else if (vdm.exponent >= 1023 + 31) {
  543. d = 0x7fffffff;
  544. if (vdm.sign)
  545. d = ~d;
  546. exceptions |= FPSCR_IOC;
  547. } else if (vdm.exponent >= 1023) {
  548. int shift = 1023 + 63 - vdm.exponent; /* 58 */
  549. u64 rem, incr = 0;
  550. d = (u32)((vdm.significand << 1) >> shift);
  551. rem = vdm.significand << (65 - shift);
  552. if (rmode == FPSCR_ROUND_NEAREST) {
  553. incr = 0x8000000000000000ULL;
  554. if ((d & 1) == 0)
  555. incr -= 1;
  556. } else if (rmode == FPSCR_ROUND_TOZERO) {
  557. incr = 0;
  558. } else if ((rmode == FPSCR_ROUND_PLUSINF) ^ (vdm.sign != 0)) {
  559. incr = ~0ULL;
  560. }
  561. if ((rem + incr) < rem && d < 0xffffffff)
  562. d += 1;
  563. if (d > (0x7fffffffU + (vdm.sign != 0))) {
  564. d = (0x7fffffffU + (vdm.sign != 0));
  565. exceptions |= FPSCR_IOC;
  566. } else if (rem)
  567. exceptions |= FPSCR_IXC;
  568. if (vdm.sign)
  569. d = (~d + 1);
  570. } else {
  571. d = 0;
  572. if (vdm.exponent | vdm.significand) {
  573. exceptions |= FPSCR_IXC;
  574. if (rmode == FPSCR_ROUND_NEAREST) {
  575. if (vdm.exponent >= 1022) {
  576. d = vdm.sign ? 0xffffffff : 1;
  577. } else {
  578. d = 0;
  579. }
  580. } else if (rmode == FPSCR_ROUND_PLUSINF && vdm.sign == 0) {
  581. d = 1;
  582. } else if (rmode == FPSCR_ROUND_MINUSINF && vdm.sign) {
  583. d = 0xffffffff;
  584. }
  585. }
  586. }
  587. LOG_TRACE(Core_ARM11, "VFP: ftosi: d(s%d)=%08x exceptions=%08x", sd, d, exceptions);
  588. vfp_put_float(state, (s32)d, sd);
  589. return exceptions;
  590. }
  591. static u32 vfp_double_ftosiz(ARMul_State* state, int dd, int unused, int dm, u32 fpscr) {
  592. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  593. return vfp_double_ftosi(state, dd, unused, dm,
  594. (fpscr & ~FPSCR_RMODE_MASK) | FPSCR_ROUND_TOZERO);
  595. }
  596. static struct op fops_ext[] = {
  597. {vfp_double_fcpy, 0}, // 0x00000000 - FEXT_FCPY
  598. {vfp_double_fabs, 0}, // 0x00000001 - FEXT_FABS
  599. {vfp_double_fneg, 0}, // 0x00000002 - FEXT_FNEG
  600. {vfp_double_fsqrt, 0}, // 0x00000003 - FEXT_FSQRT
  601. {nullptr, 0},
  602. {nullptr, 0},
  603. {nullptr, 0},
  604. {nullptr, 0},
  605. {vfp_double_fcmp, OP_SCALAR}, // 0x00000008 - FEXT_FCMP
  606. {vfp_double_fcmpe, OP_SCALAR}, // 0x00000009 - FEXT_FCMPE
  607. {vfp_double_fcmpz, OP_SCALAR}, // 0x0000000A - FEXT_FCMPZ
  608. {vfp_double_fcmpez, OP_SCALAR}, // 0x0000000B - FEXT_FCMPEZ
  609. {nullptr, 0},
  610. {nullptr, 0},
  611. {nullptr, 0},
  612. {vfp_double_fcvts, OP_SCALAR | OP_DD}, // 0x0000000F - FEXT_FCVT
  613. {vfp_double_fuito, OP_SCALAR | OP_SM}, // 0x00000010 - FEXT_FUITO
  614. {vfp_double_fsito, OP_SCALAR | OP_SM}, // 0x00000011 - FEXT_FSITO
  615. {nullptr, 0},
  616. {nullptr, 0},
  617. {nullptr, 0},
  618. {nullptr, 0},
  619. {nullptr, 0},
  620. {nullptr, 0},
  621. {vfp_double_ftoui, OP_SCALAR | OP_SD}, // 0x00000018 - FEXT_FTOUI
  622. {vfp_double_ftouiz, OP_SCALAR | OP_SD}, // 0x00000019 - FEXT_FTOUIZ
  623. {vfp_double_ftosi, OP_SCALAR | OP_SD}, // 0x0000001A - FEXT_FTOSI
  624. {vfp_double_ftosiz, OP_SCALAR | OP_SD}, // 0x0000001B - FEXT_FTOSIZ
  625. };
  626. static u32 vfp_double_fadd_nonnumber(struct vfp_double* vdd, struct vfp_double* vdn,
  627. struct vfp_double* vdm, u32 fpscr) {
  628. struct vfp_double* vdp;
  629. u32 exceptions = 0;
  630. int tn, tm;
  631. tn = vfp_double_type(vdn);
  632. tm = vfp_double_type(vdm);
  633. if (tn & tm & VFP_INFINITY) {
  634. /*
  635. * Two infinities. Are they different signs?
  636. */
  637. if (vdn->sign ^ vdm->sign) {
  638. /*
  639. * different signs -> invalid
  640. */
  641. exceptions = FPSCR_IOC;
  642. vdp = &vfp_double_default_qnan;
  643. } else {
  644. /*
  645. * same signs -> valid
  646. */
  647. vdp = vdn;
  648. }
  649. } else if (tn & VFP_INFINITY && tm & VFP_NUMBER) {
  650. /*
  651. * One infinity and one number -> infinity
  652. */
  653. vdp = vdn;
  654. } else {
  655. /*
  656. * 'n' is a NaN of some type
  657. */
  658. return vfp_propagate_nan(vdd, vdn, vdm, fpscr);
  659. }
  660. *vdd = *vdp;
  661. return exceptions;
  662. }
  663. u32 vfp_double_add(struct vfp_double* vdd, struct vfp_double* vdn, struct vfp_double* vdm,
  664. u32 fpscr) {
  665. u32 exp_diff;
  666. u64 m_sig;
  667. if (vdn->significand & (1ULL << 63) || vdm->significand & (1ULL << 63)) {
  668. LOG_INFO(Core_ARM11, "VFP: bad FP values in %s", __func__);
  669. vfp_double_dump("VDN", vdn);
  670. vfp_double_dump("VDM", vdm);
  671. }
  672. /*
  673. * Ensure that 'n' is the largest magnitude number. Note that
  674. * if 'n' and 'm' have equal exponents, we do not swap them.
  675. * This ensures that NaN propagation works correctly.
  676. */
  677. if (vdn->exponent < vdm->exponent) {
  678. std::swap(vdm, vdn);
  679. }
  680. /*
  681. * Is 'n' an infinity or a NaN? Note that 'm' may be a number,
  682. * infinity or a NaN here.
  683. */
  684. if (vdn->exponent == 2047)
  685. return vfp_double_fadd_nonnumber(vdd, vdn, vdm, fpscr);
  686. /*
  687. * We have two proper numbers, where 'vdn' is the larger magnitude.
  688. *
  689. * Copy 'n' to 'd' before doing the arithmetic.
  690. */
  691. *vdd = *vdn;
  692. /*
  693. * Align 'm' with the result.
  694. */
  695. exp_diff = vdn->exponent - vdm->exponent;
  696. m_sig = vfp_shiftright64jamming(vdm->significand, exp_diff);
  697. /*
  698. * If the signs are different, we are really subtracting.
  699. */
  700. if (vdn->sign ^ vdm->sign) {
  701. m_sig = vdn->significand - m_sig;
  702. if ((s64)m_sig < 0) {
  703. vdd->sign = vfp_sign_negate(vdd->sign);
  704. m_sig = (~m_sig + 1);
  705. } else if (m_sig == 0) {
  706. vdd->sign = (fpscr & FPSCR_RMODE_MASK) == FPSCR_ROUND_MINUSINF ? 0x8000 : 0;
  707. }
  708. } else {
  709. m_sig += vdn->significand;
  710. }
  711. vdd->significand = m_sig;
  712. return 0;
  713. }
  714. u32 vfp_double_multiply(struct vfp_double* vdd, struct vfp_double* vdn, struct vfp_double* vdm,
  715. u32 fpscr) {
  716. vfp_double_dump("VDN", vdn);
  717. vfp_double_dump("VDM", vdm);
  718. /*
  719. * Ensure that 'n' is the largest magnitude number. Note that
  720. * if 'n' and 'm' have equal exponents, we do not swap them.
  721. * This ensures that NaN propagation works correctly.
  722. */
  723. if (vdn->exponent < vdm->exponent) {
  724. std::swap(vdm, vdn);
  725. LOG_TRACE(Core_ARM11, "VFP: swapping M <-> N");
  726. }
  727. vdd->sign = vdn->sign ^ vdm->sign;
  728. /*
  729. * If 'n' is an infinity or NaN, handle it. 'm' may be anything.
  730. */
  731. if (vdn->exponent == 2047) {
  732. if (vdn->significand || (vdm->exponent == 2047 && vdm->significand))
  733. return vfp_propagate_nan(vdd, vdn, vdm, fpscr);
  734. if ((vdm->exponent | vdm->significand) == 0) {
  735. *vdd = vfp_double_default_qnan;
  736. return FPSCR_IOC;
  737. }
  738. vdd->exponent = vdn->exponent;
  739. vdd->significand = 0;
  740. return 0;
  741. }
  742. /*
  743. * If 'm' is zero, the result is always zero. In this case,
  744. * 'n' may be zero or a number, but it doesn't matter which.
  745. */
  746. if ((vdm->exponent | vdm->significand) == 0) {
  747. vdd->exponent = 0;
  748. vdd->significand = 0;
  749. return 0;
  750. }
  751. /*
  752. * We add 2 to the destination exponent for the same reason
  753. * as the addition case - though this time we have +1 from
  754. * each input operand.
  755. */
  756. vdd->exponent = vdn->exponent + vdm->exponent - 1023 + 2;
  757. vdd->significand = vfp_hi64multiply64(vdn->significand, vdm->significand);
  758. vfp_double_dump("VDD", vdd);
  759. return 0;
  760. }
  761. #define NEG_MULTIPLY (1 << 0)
  762. #define NEG_SUBTRACT (1 << 1)
  763. static u32 vfp_double_multiply_accumulate(ARMul_State* state, int dd, int dn, int dm, u32 fpscr,
  764. u32 negate, const char* func) {
  765. struct vfp_double vdd, vdp, vdn, vdm;
  766. u32 exceptions = 0;
  767. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  768. if (vdn.exponent == 0 && vdn.significand)
  769. vfp_double_normalise_denormal(&vdn);
  770. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  771. if (vdm.exponent == 0 && vdm.significand)
  772. vfp_double_normalise_denormal(&vdm);
  773. exceptions |= vfp_double_multiply(&vdp, &vdn, &vdm, fpscr);
  774. if (negate & NEG_MULTIPLY)
  775. vdp.sign = vfp_sign_negate(vdp.sign);
  776. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dd), fpscr);
  777. if (vdn.exponent == 0 && vdn.significand != 0)
  778. vfp_double_normalise_denormal(&vdn);
  779. if (negate & NEG_SUBTRACT)
  780. vdn.sign = vfp_sign_negate(vdn.sign);
  781. exceptions |= vfp_double_add(&vdd, &vdn, &vdp, fpscr);
  782. return vfp_double_normaliseround(state, dd, &vdd, fpscr, exceptions, func);
  783. }
  784. /*
  785. * Standard operations
  786. */
  787. /*
  788. * sd = sd + (sn * sm)
  789. */
  790. static u32 vfp_double_fmac(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  791. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  792. return vfp_double_multiply_accumulate(state, dd, dn, dm, fpscr, 0, "fmac");
  793. }
  794. /*
  795. * sd = sd - (sn * sm)
  796. */
  797. static u32 vfp_double_fnmac(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  798. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  799. return vfp_double_multiply_accumulate(state, dd, dn, dm, fpscr, NEG_MULTIPLY, "fnmac");
  800. }
  801. /*
  802. * sd = -sd + (sn * sm)
  803. */
  804. static u32 vfp_double_fmsc(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  805. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  806. return vfp_double_multiply_accumulate(state, dd, dn, dm, fpscr, NEG_SUBTRACT, "fmsc");
  807. }
  808. /*
  809. * sd = -sd - (sn * sm)
  810. */
  811. static u32 vfp_double_fnmsc(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  812. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  813. return vfp_double_multiply_accumulate(state, dd, dn, dm, fpscr, NEG_SUBTRACT | NEG_MULTIPLY,
  814. "fnmsc");
  815. }
  816. /*
  817. * sd = sn * sm
  818. */
  819. static u32 vfp_double_fmul(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  820. struct vfp_double vdd, vdn, vdm;
  821. u32 exceptions = 0;
  822. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  823. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  824. if (vdn.exponent == 0 && vdn.significand)
  825. vfp_double_normalise_denormal(&vdn);
  826. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  827. if (vdm.exponent == 0 && vdm.significand)
  828. vfp_double_normalise_denormal(&vdm);
  829. exceptions |= vfp_double_multiply(&vdd, &vdn, &vdm, fpscr);
  830. return vfp_double_normaliseround(state, dd, &vdd, fpscr, exceptions, "fmul");
  831. }
  832. /*
  833. * sd = -(sn * sm)
  834. */
  835. static u32 vfp_double_fnmul(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  836. struct vfp_double vdd, vdn, vdm;
  837. u32 exceptions = 0;
  838. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  839. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  840. if (vdn.exponent == 0 && vdn.significand)
  841. vfp_double_normalise_denormal(&vdn);
  842. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  843. if (vdm.exponent == 0 && vdm.significand)
  844. vfp_double_normalise_denormal(&vdm);
  845. exceptions |= vfp_double_multiply(&vdd, &vdn, &vdm, fpscr);
  846. vdd.sign = vfp_sign_negate(vdd.sign);
  847. return vfp_double_normaliseround(state, dd, &vdd, fpscr, exceptions, "fnmul");
  848. }
  849. /*
  850. * sd = sn + sm
  851. */
  852. static u32 vfp_double_fadd(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  853. struct vfp_double vdd, vdn, vdm;
  854. u32 exceptions = 0;
  855. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  856. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  857. if (vdn.exponent == 0 && vdn.significand)
  858. vfp_double_normalise_denormal(&vdn);
  859. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  860. if (vdm.exponent == 0 && vdm.significand)
  861. vfp_double_normalise_denormal(&vdm);
  862. exceptions |= vfp_double_add(&vdd, &vdn, &vdm, fpscr);
  863. return vfp_double_normaliseround(state, dd, &vdd, fpscr, exceptions, "fadd");
  864. }
  865. /*
  866. * sd = sn - sm
  867. */
  868. static u32 vfp_double_fsub(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  869. struct vfp_double vdd, vdn, vdm;
  870. u32 exceptions = 0;
  871. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  872. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  873. if (vdn.exponent == 0 && vdn.significand)
  874. vfp_double_normalise_denormal(&vdn);
  875. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  876. if (vdm.exponent == 0 && vdm.significand)
  877. vfp_double_normalise_denormal(&vdm);
  878. /*
  879. * Subtraction is like addition, but with a negated operand.
  880. */
  881. vdm.sign = vfp_sign_negate(vdm.sign);
  882. exceptions |= vfp_double_add(&vdd, &vdn, &vdm, fpscr);
  883. return vfp_double_normaliseround(state, dd, &vdd, fpscr, exceptions, "fsub");
  884. }
  885. /*
  886. * sd = sn / sm
  887. */
  888. static u32 vfp_double_fdiv(ARMul_State* state, int dd, int dn, int dm, u32 fpscr) {
  889. struct vfp_double vdd, vdn, vdm;
  890. u32 exceptions = 0;
  891. int tm, tn;
  892. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  893. exceptions |= vfp_double_unpack(&vdn, vfp_get_double(state, dn), fpscr);
  894. exceptions |= vfp_double_unpack(&vdm, vfp_get_double(state, dm), fpscr);
  895. vdd.sign = vdn.sign ^ vdm.sign;
  896. tn = vfp_double_type(&vdn);
  897. tm = vfp_double_type(&vdm);
  898. /*
  899. * Is n a NAN?
  900. */
  901. if (tn & VFP_NAN)
  902. goto vdn_nan;
  903. /*
  904. * Is m a NAN?
  905. */
  906. if (tm & VFP_NAN)
  907. goto vdm_nan;
  908. /*
  909. * If n and m are infinity, the result is invalid
  910. * If n and m are zero, the result is invalid
  911. */
  912. if (tm & tn & (VFP_INFINITY | VFP_ZERO))
  913. goto invalid;
  914. /*
  915. * If n is infinity, the result is infinity
  916. */
  917. if (tn & VFP_INFINITY)
  918. goto infinity;
  919. /*
  920. * If m is zero, raise div0 exceptions
  921. */
  922. if (tm & VFP_ZERO)
  923. goto divzero;
  924. /*
  925. * If m is infinity, or n is zero, the result is zero
  926. */
  927. if (tm & VFP_INFINITY || tn & VFP_ZERO)
  928. goto zero;
  929. if (tn & VFP_DENORMAL)
  930. vfp_double_normalise_denormal(&vdn);
  931. if (tm & VFP_DENORMAL)
  932. vfp_double_normalise_denormal(&vdm);
  933. /*
  934. * Ok, we have two numbers, we can perform division.
  935. */
  936. vdd.exponent = vdn.exponent - vdm.exponent + 1023 - 1;
  937. vdm.significand <<= 1;
  938. if (vdm.significand <= (2 * vdn.significand)) {
  939. vdn.significand >>= 1;
  940. vdd.exponent++;
  941. }
  942. vdd.significand = vfp_estimate_div128to64(vdn.significand, 0, vdm.significand);
  943. if ((vdd.significand & 0x1ff) <= 2) {
  944. u64 termh, terml, remh, reml;
  945. mul64to128(&termh, &terml, vdm.significand, vdd.significand);
  946. sub128(&remh, &reml, vdn.significand, 0, termh, terml);
  947. while ((s64)remh < 0) {
  948. vdd.significand -= 1;
  949. add128(&remh, &reml, remh, reml, 0, vdm.significand);
  950. }
  951. vdd.significand |= (reml != 0);
  952. }
  953. return vfp_double_normaliseround(state, dd, &vdd, fpscr, 0, "fdiv");
  954. vdn_nan:
  955. exceptions |= vfp_propagate_nan(&vdd, &vdn, &vdm, fpscr);
  956. pack:
  957. vfp_put_double(state, vfp_double_pack(&vdd), dd);
  958. return exceptions;
  959. vdm_nan:
  960. exceptions |= vfp_propagate_nan(&vdd, &vdm, &vdn, fpscr);
  961. goto pack;
  962. zero:
  963. vdd.exponent = 0;
  964. vdd.significand = 0;
  965. goto pack;
  966. divzero:
  967. exceptions |= FPSCR_DZC;
  968. infinity:
  969. vdd.exponent = 2047;
  970. vdd.significand = 0;
  971. goto pack;
  972. invalid:
  973. vfp_put_double(state, vfp_double_pack(&vfp_double_default_qnan), dd);
  974. return FPSCR_IOC;
  975. }
  976. static struct op fops[] = {
  977. {vfp_double_fmac, 0}, {vfp_double_fmsc, 0}, {vfp_double_fmul, 0},
  978. {vfp_double_fadd, 0}, {vfp_double_fnmac, 0}, {vfp_double_fnmsc, 0},
  979. {vfp_double_fnmul, 0}, {vfp_double_fsub, 0}, {vfp_double_fdiv, 0},
  980. };
  981. #define FREG_BANK(x) ((x)&0x0c)
  982. #define FREG_IDX(x) ((x)&3)
  983. u32 vfp_double_cpdo(ARMul_State* state, u32 inst, u32 fpscr) {
  984. u32 op = inst & FOP_MASK;
  985. u32 exceptions = 0;
  986. unsigned int dest;
  987. unsigned int dn = vfp_get_dn(inst);
  988. unsigned int dm;
  989. unsigned int vecitr, veclen, vecstride;
  990. struct op* fop;
  991. LOG_TRACE(Core_ARM11, "In %s", __FUNCTION__);
  992. vecstride = (1 + ((fpscr & FPSCR_STRIDE_MASK) == FPSCR_STRIDE_MASK));
  993. fop = (op == FOP_EXT) ? &fops_ext[FEXT_TO_IDX(inst)] : &fops[FOP_TO_IDX(op)];
  994. /*
  995. * fcvtds takes an sN register number as destination, not dN.
  996. * It also always operates on scalars.
  997. */
  998. if (fop->flags & OP_SD)
  999. dest = vfp_get_sd(inst);
  1000. else
  1001. dest = vfp_get_dd(inst);
  1002. /*
  1003. * f[us]ito takes a sN operand, not a dN operand.
  1004. */
  1005. if (fop->flags & OP_SM)
  1006. dm = vfp_get_sm(inst);
  1007. else
  1008. dm = vfp_get_dm(inst);
  1009. /*
  1010. * If destination bank is zero, vector length is always '1'.
  1011. * ARM DDI0100F C5.1.3, C5.3.2.
  1012. */
  1013. if ((fop->flags & OP_SCALAR) || (FREG_BANK(dest) == 0))
  1014. veclen = 0;
  1015. else
  1016. veclen = fpscr & FPSCR_LENGTH_MASK;
  1017. LOG_TRACE(Core_ARM11, "VFP: vecstride=%u veclen=%u", vecstride,
  1018. (veclen >> FPSCR_LENGTH_BIT) + 1);
  1019. if (!fop->fn) {
  1020. printf("VFP: could not find double op %d\n", FEXT_TO_IDX(inst));
  1021. goto invalid;
  1022. }
  1023. for (vecitr = 0; vecitr <= veclen; vecitr += 1 << FPSCR_LENGTH_BIT) {
  1024. u32 except;
  1025. char type;
  1026. type = (fop->flags & OP_SD) ? 's' : 'd';
  1027. if (op == FOP_EXT)
  1028. LOG_TRACE(Core_ARM11, "VFP: itr%d (%c%u) = op[%u] (d%u)", vecitr >> FPSCR_LENGTH_BIT,
  1029. type, dest, dn, dm);
  1030. else
  1031. LOG_TRACE(Core_ARM11, "VFP: itr%d (%c%u) = (d%u) op[%u] (d%u)",
  1032. vecitr >> FPSCR_LENGTH_BIT, type, dest, dn, FOP_TO_IDX(op), dm);
  1033. except = fop->fn(state, dest, dn, dm, fpscr);
  1034. LOG_TRACE(Core_ARM11, "VFP: itr%d: exceptions=%08x", vecitr >> FPSCR_LENGTH_BIT, except);
  1035. exceptions |= except & ~VFP_NAN_FLAG;
  1036. /*
  1037. * CHECK: It appears to be undefined whether we stop when
  1038. * we encounter an exception. We continue.
  1039. */
  1040. dest = FREG_BANK(dest) + ((FREG_IDX(dest) + vecstride) & 3);
  1041. dn = FREG_BANK(dn) + ((FREG_IDX(dn) + vecstride) & 3);
  1042. if (FREG_BANK(dm) != 0)
  1043. dm = FREG_BANK(dm) + ((FREG_IDX(dm) + vecstride) & 3);
  1044. }
  1045. return exceptions;
  1046. invalid:
  1047. return ~0;
  1048. }