vfpdouble.cpp 36 KB

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