vfpdouble.cpp 36 KB

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