test.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. #include <u.h>
  10. #include <libc.h>
  11. #include <mp.h>
  12. #include "dat.h"
  13. int loops = 1;
  14. int32_t randomreg;
  15. void
  16. srand(int32_t seed)
  17. {
  18. randomreg = seed;
  19. }
  20. int32_t
  21. lrand(void)
  22. {
  23. randomreg = randomreg*104381 + 81761;
  24. return randomreg;
  25. }
  26. void
  27. prng(uint8_t *p, int n)
  28. {
  29. while(n-- > 0)
  30. *p++ = lrand();
  31. }
  32. void
  33. testconv(char *str)
  34. {
  35. mpint *b;
  36. char *p;
  37. b = strtomp(str, nil, 16, nil);
  38. p = mptoa(b, 10, nil, 0);
  39. print("%s = ", p);
  40. strtomp(p, nil, 10, b);
  41. free(p);
  42. print("%B\n", b);
  43. p = mptoa(b, 16, nil, 0);
  44. print("%s = ", p);
  45. strtomp(p, nil, 16, b);
  46. free(p);
  47. print("%B\n", b);
  48. p = mptoa(b, 32, nil, 0);
  49. print("%s = ", p);
  50. strtomp(p, nil, 32, b);
  51. free(p);
  52. print("%B\n", b);
  53. p = mptoa(b, 64, nil, 0);
  54. print("%s = ", p);
  55. strtomp(p, nil, 64, b);
  56. free(p);
  57. print("%B\n", b);
  58. mpfree(b);
  59. }
  60. void
  61. testshift(char *str)
  62. {
  63. mpint *b1, *b2;
  64. int i;
  65. b1 = strtomp(str, nil, 16, nil);
  66. b2 = mpnew(0);
  67. for(i = 0; i < 64; i++){
  68. mpleft(b1, i, b2);
  69. print("%2.2d %B\n", i, b2);
  70. }
  71. for(i = 0; i < 64; i++){
  72. mpright(b2, i, b1);
  73. print("%2.2d %B\n", i, b1);
  74. }
  75. mpfree(b1);
  76. mpfree(b2);
  77. }
  78. void
  79. testaddsub(char *str)
  80. {
  81. mpint *b1, *b2;
  82. int i;
  83. b1 = strtomp(str, nil, 16, nil);
  84. b2 = mpnew(0);
  85. for(i = 0; i < 16; i++){
  86. mpadd(b1, b2, b2);
  87. print("%2.2d %B\n", i, b2);
  88. }
  89. for(i = 0; i < 16; i++){
  90. mpsub(b2, b1, b2);
  91. print("%2.2d %B\n", i, b2);
  92. }
  93. mpfree(b1);
  94. mpfree(b2);
  95. }
  96. void
  97. testvecdigmuladd(char *str, mpdigit d)
  98. {
  99. mpint *b, *b2;
  100. int i;
  101. int64_t now;
  102. b = strtomp(str, nil, 16, nil);
  103. b2 = mpnew(0);
  104. mpbits(b2, (b->top+1)*Dbits);
  105. now = nsec();
  106. for(i = 0; i < loops; i++){
  107. memset(b2->p, 0, b2->top*Dbytes);
  108. mpvecdigmuladd(b->p, b->top, d, b2->p);
  109. }
  110. if(loops > 1)
  111. print("%lld ns for a %d*%d vecdigmul\n", (nsec()-now)/loops, b->top*Dbits, Dbits);
  112. mpnorm(b2);
  113. print("0 + %B * %x = %B\n", b, d, b2);
  114. mpfree(b);
  115. mpfree(b2);
  116. }
  117. void
  118. testvecdigmulsub(char *str, mpdigit d)
  119. {
  120. mpint *b, *b2;
  121. int i;
  122. int64_t now;
  123. b = strtomp(str, nil, 16, nil);
  124. b2 = mpnew(0);
  125. mpbits(b2, (b->top+1)*Dbits);
  126. now = nsec();
  127. for(i = 0; i < loops; i++){
  128. memset(b2->p, 0, b2->top*Dbytes);
  129. mpvecdigmulsub(b->p, b->top, d, b2->p);
  130. }
  131. if(loops > 1)
  132. print("%lld ns for a %d*%d vecdigmul\n", (nsec()-now)/loops, b->top*Dbits, Dbits);
  133. mpnorm(b2);
  134. print("0 - %B * %x = %B\n", b, d, b2);
  135. mpfree(b);
  136. mpfree(b2);
  137. }
  138. void
  139. testmul(char *str)
  140. {
  141. mpint *b, *b1, *b2;
  142. int64_t now;
  143. int i;
  144. b = strtomp(str, nil, 16, nil);
  145. b1 = mpcopy(b);
  146. b2 = mpnew(0);
  147. now = nsec();
  148. for(i = 0; i < loops; i++)
  149. mpmul(b, b1, b2);
  150. if(loops > 1)
  151. print("%lld µs for a %d*%d mult\n", (nsec()-now)/(loops*1000),
  152. b->top*Dbits, b1->top*Dbits);
  153. print("%B * %B = %B\n", b, b1, b2);
  154. mpfree(b);
  155. mpfree(b1);
  156. mpfree(b2);
  157. }
  158. void
  159. testmul2(mpint *b, mpint *b1)
  160. {
  161. mpint *b2;
  162. int64_t now;
  163. int i;
  164. b2 = mpnew(0);
  165. now = nsec();
  166. for(i = 0; i < loops; i++)
  167. mpmul(b, b1, b2);
  168. if(loops > 1)
  169. print("%lld µs for a %d*%d mult\n", (nsec()-now)/(loops*1000), b->top*Dbits, b1->top*Dbits);
  170. print("%B * ", b);
  171. print("%B = ", b1);
  172. print("%B\n", b2);
  173. mpfree(b2);
  174. }
  175. void
  176. testdigdiv(char *str, mpdigit d)
  177. {
  178. mpint *b;
  179. mpdigit q;
  180. int i;
  181. int64_t now;
  182. b = strtomp(str, nil, 16, nil);
  183. now = nsec();
  184. for(i = 0; i < loops; i++)
  185. mpdigdiv(b->p, d, &q);
  186. if(loops > 1)
  187. print("%lld ns for a %d / %d div\n", (nsec()-now)/loops, 2*Dbits, Dbits);
  188. print("%B / %x = %x\n", b, d, q);
  189. mpfree(b);
  190. }
  191. void
  192. testdiv(mpint *x, mpint *y)
  193. {
  194. mpint *b2, *b3;
  195. int64_t now;
  196. int i;
  197. b2 = mpnew(0);
  198. b3 = mpnew(0);
  199. now = nsec();
  200. for(i = 0; i < loops; i++)
  201. mpdiv(x, y, b2, b3);
  202. if(loops > 1)
  203. print("%lld µs for a %d/%d div\n", (nsec()-now)/(1000*loops),
  204. x->top*Dbits, y->top*Dbits);
  205. print("%B / %B = %B %B\n", x, y, b2, b3);
  206. mpfree(b2);
  207. mpfree(b3);
  208. }
  209. void
  210. testmod(mpint *x, mpint *y)
  211. {
  212. mpint *r;
  213. int64_t now;
  214. int i;
  215. r = mpnew(0);
  216. now = nsec();
  217. for(i = 0; i < loops; i++)
  218. mpmod(x, y, r);
  219. if(loops > 1)
  220. print("%lld µs for a %d/%d mod\n", (nsec()-now)/(1000*loops),
  221. x->top*Dbits, y->top*Dbits);
  222. print("%B mod %B = %B\n", x, y, r);
  223. mpfree(r);
  224. }
  225. void
  226. testinvert(mpint *x, mpint *y)
  227. {
  228. mpint *r, *d1, *d2;
  229. int64_t now;
  230. int i;
  231. r = mpnew(0);
  232. d1 = mpnew(0);
  233. d2 = mpnew(0);
  234. now = nsec();
  235. mpextendedgcd(x, y, r, d1, d2);
  236. mpdiv(x, r, x, d1);
  237. mpdiv(y, r, y, d1);
  238. for(i = 0; i < loops; i++)
  239. mpinvert(x, y, r);
  240. if(loops > 1)
  241. print("%lld µs for a %d in %d invert\n", (nsec()-now)/(1000*loops),
  242. x->top*Dbits, y->top*Dbits);
  243. print("%B**-1 mod %B = %B\n", x, y, r);
  244. mpmul(r, x, d1);
  245. mpmod(d1, y, d2);
  246. print("%B*%B mod %B = %B\n", x, r, y, d2);
  247. mpfree(r);
  248. mpfree(d1);
  249. mpfree(d2);
  250. }
  251. void
  252. testsub1(char *a, char *b)
  253. {
  254. mpint *b1, *b2, *b3;
  255. b1 = strtomp(a, nil, 16, nil);
  256. b2 = strtomp(b, nil, 16, nil);
  257. b3 = mpnew(0);
  258. mpsub(b1, b2, b3);
  259. print("%B - %B = %B\n", b1, b2, b3);
  260. }
  261. void
  262. testmul1(char *a, char *b)
  263. {
  264. mpint *b1, *b2, *b3;
  265. b1 = strtomp(a, nil, 16, nil);
  266. b2 = strtomp(b, nil, 16, nil);
  267. b3 = mpnew(0);
  268. mpmul(b1, b2, b3);
  269. print("%B * %B = %B\n", b1, b2, b3);
  270. }
  271. void
  272. testexp(char *base, char *exp, char *mod)
  273. {
  274. mpint *b, *e, *m, *res;
  275. int i;
  276. uint64_t now;
  277. b = strtomp(base, nil, 16, nil);
  278. e = strtomp(exp, nil, 16, nil);
  279. res = mpnew(0);
  280. if(mod != nil)
  281. m = strtomp(mod, nil, 16, nil);
  282. else
  283. m = nil;
  284. now = nsec();
  285. for(i = 0; i < loops; i++)
  286. mpexp(b, e, m, res);
  287. if(loops > 1)
  288. print("%lluµs for a %d to the %d bit exp\n", (nsec()-now)/(loops*1000),
  289. b->top*Dbits, e->top*Dbits);
  290. if(m != nil)
  291. print("%B ^ %B mod %B == %B\n", b, e, m, res);
  292. else
  293. print("%B ^ %B == %B\n", b, e, res);
  294. mpfree(b);
  295. mpfree(e);
  296. mpfree(res);
  297. if(m != nil)
  298. mpfree(m);
  299. }
  300. void
  301. testgcd(void)
  302. {
  303. mpint *a, *b, *d, *x, *y, *t1, *t2;
  304. int i;
  305. uint64_t now, then;
  306. uint64_t etime;
  307. d = mpnew(0);
  308. x = mpnew(0);
  309. y = mpnew(0);
  310. t1 = mpnew(0);
  311. t2 = mpnew(0);
  312. etime = 0;
  313. a = strtomp("4EECAB3E04C4E6BC1F49D438731450396BF272B4D7B08F91C38E88ADCD281699889AFF872E2204C80CCAA8E460797103DE539D5DF8335A9B20C0B44886384F134C517287202FCA914D8A5096446B40CD861C641EF9C2730CB057D7B133F4C2B16BBD3D75FDDBD9151AAF0F9144AAA473AC93CF945DBFE0859FB685D5CBD0A8B3", nil, 16, nil);
  314. b = strtomp("C41CFBE4D4846F67A3DF7DE9921A49D3B42DC33728427AB159CEC8CBBDB12B5F0C244F1A734AEB9840804EA3C25036AD1B61AFF3ABBC247CD4B384224567A863A6F020E7EE9795554BCD08ABAD7321AF27E1E92E3DB1C6E7E94FAAE590AE9C48F96D93D178E809401ABE8A534A1EC44359733475A36A70C7B425125062B1142D", nil, 16, nil);
  315. mpextendedgcd(a, b, d, x, y);
  316. print("gcd %B*%B+%B*%B = %B?\n", a, x, b, y, d);
  317. mpfree(a);
  318. mpfree(b);
  319. for(i = 0; i < loops; i++){
  320. a = mprand(2048, prng, nil);
  321. b = mprand(2048, prng, nil);
  322. then = nsec();
  323. mpextendedgcd(a, b, d, x, y);
  324. now = nsec();
  325. etime += now-then;
  326. mpmul(a, x, t1);
  327. mpmul(b, y, t2);
  328. mpadd(t1, t2, t2);
  329. if(mpcmp(d, t2) != 0)
  330. print("%d gcd %B*%B+%B*%B != %B\n", i, a, x, b, y, d);
  331. // else
  332. // print("%d euclid %B*%B+%B*%B == %B\n", i, a, x, b, y, d);
  333. mpfree(a);
  334. mpfree(b);
  335. }
  336. mpfree(x);
  337. mpfree(y);
  338. mpfree(d);
  339. mpfree(t1);
  340. mpfree(t2);
  341. if(loops > 1)
  342. print("binary %llu\n", etime);
  343. }
  344. extern int _unnormalizedwarning = 1;
  345. void
  346. main(int argc, char **argv)
  347. {
  348. mpint *x, *y;
  349. ARGBEGIN{
  350. case 'n':
  351. loops = atoi(ARGF());
  352. break;
  353. }ARGEND;
  354. fmtinstall('B', mpconv);
  355. fmtinstall('Q', mpconv);
  356. srand(0);
  357. mpsetminbits(2*Dbits);
  358. testshift("1111111111111111");
  359. testaddsub("fffffffffffffffff");
  360. testdigdiv("1234567812345678", 0x76543218);
  361. testdigdiv("1ffff", 0xffff);
  362. testdigdiv("ffff", 0xffff);
  363. testdigdiv("fff", 0xffff);
  364. testdigdiv("effffffff", 0xffff);
  365. testdigdiv("ffffffff", 0x1);
  366. testdigdiv("ffffffff", 0);
  367. testdigdiv("200000000", 2);
  368. testdigdiv("ffffff00fffffff1", 0xfffffff1);
  369. testvecdigmuladd("fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", 2);
  370. testconv("0");
  371. testconv("-abc0123456789abcedf");
  372. testconv("abc0123456789abcedf");
  373. testvecdigmulsub("fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", 2);
  374. testsub1("1FFFFFFFE00000000", "FFFFFFFE00000001");
  375. testmul1("ffffffff", "f");
  376. testmul("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
  377. testmul1("100000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000030000000000000000000000000000000000000000000000000000000400000000000000000000000000000000000000000000000000000004FFFFFFFFFFFFFFFE0000000200000000000000000000000000000003FFFFFFFFFFFFFFFE0000000200000000000000000000000000000002FFFFFFFFFFFFFFFE0000000200000000000000000000000000000001FFFFFFFFFFFFFFFE0000000200000000000000000000000000000000FFFFFFFFFFFFFFFE0000000200000000FFFFFFFE00000001", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF");
  378. testmul1("1000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001", "1000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001");
  379. testmul1("1000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001", "1000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001000000000000000000000001");
  380. testmul1("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
  381. x = mprand(256, prng, nil);
  382. y = mprand(128, prng, nil);
  383. testdiv(x, y);
  384. x = mprand(2048, prng, nil);
  385. y = mprand(1024, prng, nil);
  386. testdiv(x, y);
  387. // x = mprand(4*1024, prng, nil);
  388. // y = mprand(4*1024, prng, nil);
  389. // testmul2(x, y);
  390. testsub1("677132C9", "-A26559B6");
  391. testgcd();
  392. x = mprand(512, prng, nil);
  393. x->sign = -1;
  394. y = mprand(256, prng, nil);
  395. testdiv(x, y);
  396. testmod(x, y);
  397. x->sign = 1;
  398. testinvert(y, x);
  399. testexp("111111111", "222", "1000000000000000000000");
  400. testexp("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", "100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
  401. #ifdef asdf
  402. #endif adsf
  403. print("done\n");
  404. exits(0);
  405. }