vlrt.c 8.8 KB

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