vlrt-spim.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711
  1. typedef unsigned long ulong;
  2. typedef unsigned int uint;
  3. typedef unsigned short ushort;
  4. typedef unsigned char uchar;
  5. typedef signed char schar;
  6. #define SIGN(n) (1UL<<(n-1))
  7. typedef struct Vlong Vlong;
  8. struct Vlong
  9. {
  10. union
  11. {
  12. struct
  13. {
  14. ulong lo;
  15. ulong hi;
  16. };
  17. };
  18. };
  19. void abort(void);
  20. void
  21. _addv(Vlong *r, Vlong a, Vlong b)
  22. {
  23. ulong lo, hi;
  24. lo = a.lo + b.lo;
  25. hi = a.hi + b.hi;
  26. if(lo < a.lo)
  27. hi++;
  28. r->lo = lo;
  29. r->hi = hi;
  30. }
  31. void
  32. _subv(Vlong *r, Vlong a, Vlong b)
  33. {
  34. ulong lo, hi;
  35. lo = a.lo - b.lo;
  36. hi = a.hi - b.hi;
  37. if(lo > a.lo)
  38. hi--;
  39. r->lo = lo;
  40. r->hi = hi;
  41. }
  42. void
  43. _d2v(Vlong *y, double d)
  44. {
  45. union { double d; struct Vlong; } x;
  46. ulong xhi, xlo, ylo, yhi;
  47. int sh;
  48. x.d = d;
  49. xhi = (x.hi & 0xfffff) | 0x100000;
  50. xlo = x.lo;
  51. sh = 1075 - ((x.hi >> 20) & 0x7ff);
  52. ylo = 0;
  53. yhi = 0;
  54. if(sh >= 0) {
  55. /* v = (hi||lo) >> sh */
  56. if(sh < 32) {
  57. if(sh == 0) {
  58. ylo = xlo;
  59. yhi = xhi;
  60. } else {
  61. ylo = (xlo >> sh) | (xhi << (32-sh));
  62. yhi = xhi >> sh;
  63. }
  64. } else {
  65. if(sh == 32) {
  66. ylo = xhi;
  67. } else
  68. if(sh < 64) {
  69. ylo = xhi >> (sh-32);
  70. }
  71. }
  72. } else {
  73. /* v = (hi||lo) << -sh */
  74. sh = -sh;
  75. if(sh <= 10) {
  76. ylo = xlo << sh;
  77. yhi = (xhi << sh) | (xlo >> (32-sh));
  78. } else {
  79. /* overflow */
  80. yhi = d; /* causes something awful */
  81. }
  82. }
  83. if(x.hi & SIGN(32)) {
  84. if(ylo != 0) {
  85. ylo = -ylo;
  86. yhi = ~yhi;
  87. } else
  88. yhi = -yhi;
  89. }
  90. y->hi = yhi;
  91. y->lo = ylo;
  92. }
  93. void
  94. _f2v(Vlong *y, float f)
  95. {
  96. _d2v(y, f);
  97. }
  98. double
  99. _v2d(Vlong x)
  100. {
  101. if(x.hi & SIGN(32)) {
  102. if(x.lo) {
  103. x.lo = -x.lo;
  104. x.hi = ~x.hi;
  105. } else
  106. x.hi = -x.hi;
  107. return -((long)x.hi*4294967296. + x.lo);
  108. }
  109. return (long)x.hi*4294967296. + x.lo;
  110. }
  111. float
  112. _v2f(Vlong x)
  113. {
  114. return _v2d(x);
  115. }
  116. static void
  117. dodiv(Vlong num, Vlong den, Vlong *q, Vlong *r)
  118. {
  119. ulong numlo, numhi, denhi, denlo, quohi, quolo, t;
  120. int i;
  121. numhi = num.hi;
  122. numlo = num.lo;
  123. denhi = den.hi;
  124. denlo = den.lo;
  125. /*
  126. * get a divide by zero
  127. */
  128. if(denlo==0 && denhi==0) {
  129. numlo = numlo / denlo;
  130. }
  131. /*
  132. * set up the divisor and find the number of iterations needed
  133. */
  134. if(numhi >= SIGN(32)) {
  135. quohi = SIGN(32);
  136. quolo = 0;
  137. } else {
  138. quohi = numhi;
  139. quolo = numlo;
  140. }
  141. i = 0;
  142. while(denhi < quohi || (denhi == quohi && denlo < quolo)) {
  143. denhi = (denhi<<1) | (denlo>>31);
  144. denlo <<= 1;
  145. i++;
  146. }
  147. quohi = 0;
  148. quolo = 0;
  149. for(; i >= 0; i--) {
  150. quohi = (quohi<<1) | (quolo>>31);
  151. quolo <<= 1;
  152. if(numhi > denhi || (numhi == denhi && numlo >= denlo)) {
  153. t = numlo;
  154. numlo -= denlo;
  155. if(numlo > t)
  156. numhi--;
  157. numhi -= denhi;
  158. quolo |= 1;
  159. }
  160. denlo = (denlo>>1) | (denhi<<31);
  161. denhi >>= 1;
  162. }
  163. if(q) {
  164. q->lo = quolo;
  165. q->hi = quohi;
  166. }
  167. if(r) {
  168. r->lo = numlo;
  169. r->hi = numhi;
  170. }
  171. }
  172. void
  173. _divvu(Vlong *q, Vlong n, Vlong d)
  174. {
  175. if(n.hi == 0 && d.hi == 0) {
  176. q->hi = 0;
  177. q->lo = n.lo / d.lo;
  178. return;
  179. }
  180. dodiv(n, d, q, 0);
  181. }
  182. void
  183. _modvu(Vlong *r, Vlong n, Vlong d)
  184. {
  185. if(n.hi == 0 && d.hi == 0) {
  186. r->hi = 0;
  187. r->lo = n.lo % d.lo;
  188. return;
  189. }
  190. dodiv(n, d, 0, r);
  191. }
  192. static void
  193. vneg(Vlong *v)
  194. {
  195. if(v->lo == 0) {
  196. v->hi = -v->hi;
  197. return;
  198. }
  199. v->lo = -v->lo;
  200. v->hi = ~v->hi;
  201. }
  202. void
  203. _divv(Vlong *q, Vlong n, Vlong d)
  204. {
  205. long nneg, dneg;
  206. if(n.hi == (((long)n.lo)>>31) && d.hi == (((long)d.lo)>>31)) {
  207. q->lo = (long)n.lo / (long)d.lo;
  208. q->hi = ((long)q->lo) >> 31;
  209. return;
  210. }
  211. nneg = n.hi >> 31;
  212. if(nneg)
  213. vneg(&n);
  214. dneg = d.hi >> 31;
  215. if(dneg)
  216. vneg(&d);
  217. dodiv(n, d, q, 0);
  218. if(nneg != dneg)
  219. vneg(q);
  220. }
  221. void
  222. _modv(Vlong *r, Vlong n, Vlong d)
  223. {
  224. long nneg, dneg;
  225. if(n.hi == (((long)n.lo)>>31) && d.hi == (((long)d.lo)>>31)) {
  226. r->lo = (long)n.lo % (long)d.lo;
  227. r->hi = ((long)r->lo) >> 31;
  228. return;
  229. }
  230. nneg = n.hi >> 31;
  231. if(nneg)
  232. vneg(&n);
  233. dneg = d.hi >> 31;
  234. if(dneg)
  235. vneg(&d);
  236. dodiv(n, d, 0, r);
  237. if(nneg)
  238. vneg(r);
  239. }
  240. void
  241. _rshav(Vlong *r, Vlong a, int b)
  242. {
  243. long t;
  244. t = a.hi;
  245. if(b >= 32) {
  246. r->hi = t>>31;
  247. if(b >= 64) {
  248. /* this is illegal re C standard */
  249. r->lo = t>>31;
  250. return;
  251. }
  252. r->lo = t >> (b-32);
  253. return;
  254. }
  255. if(b <= 0) {
  256. r->hi = t;
  257. r->lo = a.lo;
  258. return;
  259. }
  260. r->hi = t >> b;
  261. r->lo = (t << (32-b)) | (a.lo >> b);
  262. }
  263. void
  264. _rshlv(Vlong *r, Vlong a, int b)
  265. {
  266. ulong t;
  267. t = a.hi;
  268. if(b >= 32) {
  269. r->hi = 0;
  270. if(b >= 64) {
  271. /* this is illegal re C standard */
  272. r->lo = 0;
  273. return;
  274. }
  275. r->lo = t >> (b-32);
  276. return;
  277. }
  278. if(b <= 0) {
  279. r->hi = t;
  280. r->lo = a.lo;
  281. return;
  282. }
  283. r->hi = t >> b;
  284. r->lo = (t << (32-b)) | (a.lo >> b);
  285. }
  286. void
  287. _lshv(Vlong *r, Vlong a, int b)
  288. {
  289. ulong t;
  290. t = a.lo;
  291. if(b >= 32) {
  292. r->lo = 0;
  293. if(b >= 64) {
  294. /* this is illegal re C standard */
  295. r->hi = 0;
  296. return;
  297. }
  298. r->hi = t << (b-32);
  299. return;
  300. }
  301. if(b <= 0) {
  302. r->lo = t;
  303. r->hi = a.hi;
  304. return;
  305. }
  306. r->lo = t << b;
  307. r->hi = (t >> (32-b)) | (a.hi << b);
  308. }
  309. void
  310. _andv(Vlong *r, Vlong a, Vlong b)
  311. {
  312. r->hi = a.hi & b.hi;
  313. r->lo = a.lo & b.lo;
  314. }
  315. void
  316. _orv(Vlong *r, Vlong a, Vlong b)
  317. {
  318. r->hi = a.hi | b.hi;
  319. r->lo = a.lo | b.lo;
  320. }
  321. void
  322. _xorv(Vlong *r, Vlong a, Vlong b)
  323. {
  324. r->hi = a.hi ^ b.hi;
  325. r->lo = a.lo ^ b.lo;
  326. }
  327. void
  328. _vpp(Vlong *l, Vlong *r)
  329. {
  330. l->hi = r->hi;
  331. l->lo = r->lo;
  332. r->lo++;
  333. if(r->lo == 0)
  334. r->hi++;
  335. }
  336. void
  337. _vmm(Vlong *l, Vlong *r)
  338. {
  339. l->hi = r->hi;
  340. l->lo = r->lo;
  341. if(r->lo == 0)
  342. r->hi--;
  343. r->lo--;
  344. }
  345. void
  346. _ppv(Vlong *l, Vlong *r)
  347. {
  348. r->lo++;
  349. if(r->lo == 0)
  350. r->hi++;
  351. l->hi = r->hi;
  352. l->lo = r->lo;
  353. }
  354. void
  355. _mmv(Vlong *l, Vlong *r)
  356. {
  357. if(r->lo == 0)
  358. r->hi--;
  359. r->lo--;
  360. l->hi = r->hi;
  361. l->lo = r->lo;
  362. }
  363. void
  364. _vasop(Vlong *ret, void *lv, void fn(Vlong*, Vlong, Vlong), int type, Vlong rv)
  365. {
  366. Vlong t, u;
  367. u = *ret;
  368. switch(type) {
  369. default:
  370. abort();
  371. break;
  372. case 1: /* schar */
  373. t.lo = *(schar*)lv;
  374. t.hi = t.lo >> 31;
  375. fn(&u, t, rv);
  376. *(schar*)lv = u.lo;
  377. break;
  378. case 2: /* uchar */
  379. t.lo = *(uchar*)lv;
  380. t.hi = 0;
  381. fn(&u, t, rv);
  382. *(uchar*)lv = u.lo;
  383. break;
  384. case 3: /* short */
  385. t.lo = *(short*)lv;
  386. t.hi = t.lo >> 31;
  387. fn(&u, t, rv);
  388. *(short*)lv = u.lo;
  389. break;
  390. case 4: /* ushort */
  391. t.lo = *(ushort*)lv;
  392. t.hi = 0;
  393. fn(&u, t, rv);
  394. *(ushort*)lv = u.lo;
  395. break;
  396. case 9: /* int */
  397. t.lo = *(int*)lv;
  398. t.hi = t.lo >> 31;
  399. fn(&u, t, rv);
  400. *(int*)lv = u.lo;
  401. break;
  402. case 10: /* uint */
  403. t.lo = *(uint*)lv;
  404. t.hi = 0;
  405. fn(&u, t, rv);
  406. *(uint*)lv = u.lo;
  407. break;
  408. case 5: /* long */
  409. t.lo = *(long*)lv;
  410. t.hi = t.lo >> 31;
  411. fn(&u, t, rv);
  412. *(long*)lv = u.lo;
  413. break;
  414. case 6: /* ulong */
  415. t.lo = *(ulong*)lv;
  416. t.hi = 0;
  417. fn(&u, t, rv);
  418. *(ulong*)lv = u.lo;
  419. break;
  420. case 7: /* vlong */
  421. case 8: /* uvlong */
  422. fn(&u, *(Vlong*)lv, rv);
  423. *(Vlong*)lv = u;
  424. break;
  425. }
  426. *ret = u;
  427. }
  428. void
  429. _p2v(Vlong *ret, void *p)
  430. {
  431. long t;
  432. t = (ulong)p;
  433. ret->lo = t;
  434. ret->hi = 0;
  435. }
  436. void
  437. _sl2v(Vlong *ret, long sl)
  438. {
  439. long t;
  440. t = sl;
  441. ret->lo = t;
  442. ret->hi = t >> 31;
  443. }
  444. void
  445. _ul2v(Vlong *ret, ulong ul)
  446. {
  447. long t;
  448. t = ul;
  449. ret->lo = t;
  450. ret->hi = 0;
  451. }
  452. void
  453. _si2v(Vlong *ret, int si)
  454. {
  455. long t;
  456. t = si;
  457. ret->lo = t;
  458. ret->hi = t >> 31;
  459. }
  460. void
  461. _ui2v(Vlong *ret, uint ui)
  462. {
  463. long t;
  464. t = ui;
  465. ret->lo = t;
  466. ret->hi = 0;
  467. }
  468. void
  469. _sh2v(Vlong *ret, long sh)
  470. {
  471. long t;
  472. t = (sh << 16) >> 16;
  473. ret->lo = t;
  474. ret->hi = t >> 31;
  475. }
  476. void
  477. _uh2v(Vlong *ret, ulong ul)
  478. {
  479. long t;
  480. t = ul & 0xffff;
  481. ret->lo = t;
  482. ret->hi = 0;
  483. }
  484. void
  485. _sc2v(Vlong *ret, long uc)
  486. {
  487. long t;
  488. t = (uc << 24) >> 24;
  489. ret->lo = t;
  490. ret->hi = t >> 31;
  491. }
  492. void
  493. _uc2v(Vlong *ret, ulong ul)
  494. {
  495. long t;
  496. t = ul & 0xff;
  497. ret->lo = t;
  498. ret->hi = 0;
  499. }
  500. long
  501. _v2sc(Vlong rv)
  502. {
  503. long t;
  504. t = rv.lo & 0xff;
  505. return (t << 24) >> 24;
  506. }
  507. long
  508. _v2uc(Vlong rv)
  509. {
  510. return rv.lo & 0xff;
  511. }
  512. long
  513. _v2sh(Vlong rv)
  514. {
  515. long t;
  516. t = rv.lo & 0xffff;
  517. return (t << 16) >> 16;
  518. }
  519. long
  520. _v2uh(Vlong rv)
  521. {
  522. return rv.lo & 0xffff;
  523. }
  524. long
  525. _v2sl(Vlong rv)
  526. {
  527. return rv.lo;
  528. }
  529. long
  530. _v2ul(Vlong rv)
  531. {
  532. return rv.lo;
  533. }
  534. long
  535. _v2si(Vlong rv)
  536. {
  537. return rv.lo;
  538. }
  539. long
  540. _v2ui(Vlong rv)
  541. {
  542. return rv.lo;
  543. }
  544. int
  545. _testv(Vlong rv)
  546. {
  547. return rv.lo || rv.hi;
  548. }
  549. int
  550. _eqv(Vlong lv, Vlong rv)
  551. {
  552. return lv.lo == rv.lo && lv.hi == rv.hi;
  553. }
  554. int
  555. _nev(Vlong lv, Vlong rv)
  556. {
  557. return lv.lo != rv.lo || lv.hi != rv.hi;
  558. }
  559. int
  560. _ltv(Vlong lv, Vlong rv)
  561. {
  562. return (long)lv.hi < (long)rv.hi ||
  563. (lv.hi == rv.hi && lv.lo < rv.lo);
  564. }
  565. int
  566. _lev(Vlong lv, Vlong rv)
  567. {
  568. return (long)lv.hi < (long)rv.hi ||
  569. (lv.hi == rv.hi && lv.lo <= rv.lo);
  570. }
  571. int
  572. _gtv(Vlong lv, Vlong rv)
  573. {
  574. return (long)lv.hi > (long)rv.hi ||
  575. (lv.hi == rv.hi && lv.lo > rv.lo);
  576. }
  577. int
  578. _gev(Vlong lv, Vlong rv)
  579. {
  580. return (long)lv.hi > (long)rv.hi ||
  581. (lv.hi == rv.hi && lv.lo >= rv.lo);
  582. }
  583. int
  584. _lov(Vlong lv, Vlong rv)
  585. {
  586. return lv.hi < rv.hi ||
  587. (lv.hi == rv.hi && lv.lo < rv.lo);
  588. }
  589. int
  590. _lsv(Vlong lv, Vlong rv)
  591. {
  592. return lv.hi < rv.hi ||
  593. (lv.hi == rv.hi && lv.lo <= rv.lo);
  594. }
  595. int
  596. _hiv(Vlong lv, Vlong rv)
  597. {
  598. return lv.hi > rv.hi ||
  599. (lv.hi == rv.hi && lv.lo > rv.lo);
  600. }
  601. int
  602. _hsv(Vlong lv, Vlong rv)
  603. {
  604. return lv.hi > rv.hi ||
  605. (lv.hi == rv.hi && lv.lo >= rv.lo);
  606. }