test.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561
  1. from ctypes import *
  2. from random import *
  3. import math
  4. import os
  5. import platform
  6. import time
  7. from enum import Enum
  8. #
  9. # Normally, we report the number of passes and fails.
  10. # With EXIT_ON_FAIL set, we exit at the first fail.
  11. #
  12. EXIT_ON_FAIL = True
  13. EXIT_ON_FAIL = False
  14. #
  15. # We skip randomized tests altogether if NO_RANDOM_TESTS is set.
  16. #
  17. NO_RANDOM_TESTS = True
  18. NO_RANDOM_TESTS = False
  19. #
  20. # If TIMED_TESTS == False and FAST_TESTS == True, we cut down the number of iterations.
  21. # See below.
  22. #
  23. FAST_TESTS = True
  24. #
  25. # For timed tests we budget a second per `n` bits and iterate until we hit that time.
  26. # Otherwise, we specify the number of iterations per bit depth in BITS_AND_ITERATIONS.
  27. #
  28. TIMED_TESTS = False
  29. TIMED_BITS_PER_SECOND = 20_000
  30. #
  31. # How many iterations of each random test do we want to run?
  32. #
  33. BITS_AND_ITERATIONS = [
  34. ( 120, 10_000),
  35. ( 1_200, 1_000),
  36. ( 4_096, 100),
  37. (12_000, 10),
  38. ]
  39. if FAST_TESTS:
  40. for k in range(len(BITS_AND_ITERATIONS)):
  41. b, i = BITS_AND_ITERATIONS[k]
  42. BITS_AND_ITERATIONS[k] = (b, i // 10 if i >= 100 else 5)
  43. if NO_RANDOM_TESTS:
  44. BITS_AND_ITERATIONS = []
  45. #
  46. # Where is the DLL? If missing, build using: `odin build . -build-mode:shared`
  47. #
  48. if platform.system() == "Windows":
  49. LIB_PATH = os.getcwd() + os.sep + "big.dll"
  50. elif platform.system() == "Linux":
  51. LIB_PATH = os.getcwd() + os.sep + "big.so"
  52. elif platform.system() == "Darwin":
  53. LIB_PATH = os.getcwd() + os.sep + "big.dylib"
  54. else:
  55. print("Platform is unsupported.")
  56. exit(1)
  57. TOTAL_TIME = 0
  58. UNTIL_TIME = 0
  59. UNTIL_ITERS = 0
  60. def we_iterate():
  61. if TIMED_TESTS:
  62. return TOTAL_TIME < UNTIL_TIME
  63. else:
  64. global UNTIL_ITERS
  65. UNTIL_ITERS -= 1
  66. return UNTIL_ITERS != -1
  67. #
  68. # Error enum values
  69. #
  70. class Error(Enum):
  71. Okay = 0
  72. Out_Of_Memory = 1
  73. Invalid_Pointer = 2
  74. Invalid_Argument = 3
  75. Unknown_Error = 4
  76. Max_Iterations_Reached = 5
  77. Buffer_Overflow = 6
  78. Integer_Overflow = 7
  79. Division_by_Zero = 8
  80. Math_Domain_Error = 9
  81. Unimplemented = 127
  82. #
  83. # Set up exported procedures
  84. #
  85. try:
  86. l = cdll.LoadLibrary(LIB_PATH)
  87. except:
  88. print("Couldn't find or load " + LIB_PATH + ".")
  89. exit(1)
  90. def load(export_name, args, res):
  91. export_name.argtypes = args
  92. export_name.restype = res
  93. return export_name
  94. #
  95. # Result values will be passed in a struct { res: cstring, err: Error }
  96. #
  97. class Res(Structure):
  98. _fields_ = [("res", c_char_p), ("err", c_uint64)]
  99. error_string = load(l.test_error_string, [c_byte], c_char_p)
  100. add = load(l.test_add, [c_char_p, c_char_p], Res)
  101. sub = load(l.test_sub, [c_char_p, c_char_p], Res)
  102. mul = load(l.test_mul, [c_char_p, c_char_p], Res)
  103. div = load(l.test_div, [c_char_p, c_char_p], Res)
  104. # Powers and such
  105. int_log = load(l.test_log, [c_char_p, c_longlong], Res)
  106. int_pow = load(l.test_pow, [c_char_p, c_longlong], Res)
  107. int_sqrt = load(l.test_sqrt, [c_char_p], Res)
  108. int_root_n = load(l.test_root_n, [c_char_p, c_longlong], Res)
  109. # Logical operations
  110. int_shl_digit = load(l.test_shl_digit, [c_char_p, c_longlong], Res)
  111. int_shr_digit = load(l.test_shr_digit, [c_char_p, c_longlong], Res)
  112. int_shl = load(l.test_shl, [c_char_p, c_longlong], Res)
  113. int_shr = load(l.test_shr, [c_char_p, c_longlong], Res)
  114. int_shr_signed = load(l.test_shr_signed, [c_char_p, c_longlong], Res)
  115. def test(test_name: "", res: Res, param=[], expected_error = Error.Okay, expected_result = ""):
  116. passed = True
  117. r = None
  118. err = Error(res.err)
  119. if err != expected_error:
  120. error_loc = res.res.decode('utf-8')
  121. error = "{}: {} in '{}'".format(test_name, err, error_loc)
  122. if len(param):
  123. error += " with params {}".format(param)
  124. print(error, flush=True)
  125. passed = False
  126. elif err == Error.Okay:
  127. r = None
  128. try:
  129. r = res.res.decode('utf-8')
  130. r = int(res.res, 10)
  131. except:
  132. pass
  133. if r != expected_result:
  134. error = "{}: Result was '{}', expected '{}'".format(test_name, r, expected_result)
  135. if len(param):
  136. error += " with params {}".format(param)
  137. print(error, flush=True)
  138. passed = False
  139. if EXIT_ON_FAIL and not passed: exit(res.err)
  140. return passed
  141. def test_add(a = 0, b = 0, expected_error = Error.Okay):
  142. args = [str(a), str(b)]
  143. sa_c, sb_c = args[0].encode('utf-8'), args[1].encode('utf-8')
  144. res = add(sa_c, sb_c)
  145. expected_result = None
  146. if expected_error == Error.Okay:
  147. expected_result = a + b
  148. return test("test_add", res, args, expected_error, expected_result)
  149. def test_sub(a = 0, b = 0, expected_error = Error.Okay):
  150. sa, sb = str(a), str(b)
  151. sa_c, sb_c = sa.encode('utf-8'), sb.encode('utf-8')
  152. res = sub(sa_c, sb_c)
  153. expected_result = None
  154. if expected_error == Error.Okay:
  155. expected_result = a - b
  156. return test("test_sub", res, [sa_c, sb_c], expected_error, expected_result)
  157. def test_mul(a = 0, b = 0, expected_error = Error.Okay):
  158. sa, sb = str(a), str(b)
  159. sa_c, sb_c = sa.encode('utf-8'), sb.encode('utf-8')
  160. res = mul(sa_c, sb_c)
  161. expected_result = None
  162. if expected_error == Error.Okay:
  163. expected_result = a * b
  164. return test("test_mul", res, [sa_c, sb_c], expected_error, expected_result)
  165. def test_div(a = 0, b = 0, expected_error = Error.Okay):
  166. sa, sb = str(a), str(b)
  167. sa_c, sb_c = sa.encode('utf-8'), sb.encode('utf-8')
  168. try:
  169. res = div(sa_c, sb_c)
  170. except:
  171. print("Exception with arguments:", a, b)
  172. return False
  173. expected_result = None
  174. if expected_error == Error.Okay:
  175. #
  176. # We don't round the division results, so if one component is negative, we're off by one.
  177. #
  178. if a < 0 and b > 0:
  179. expected_result = int(-(abs(a) // b))
  180. elif b < 0 and a > 0:
  181. expected_result = int(-(a // abs((b))))
  182. else:
  183. expected_result = a // b if b != 0 else None
  184. return test("test_div", res, [sa_c, sb_c], expected_error, expected_result)
  185. def test_log(a = 0, base = 0, expected_error = Error.Okay):
  186. args = [str(a), base]
  187. sa_c = args[0].encode('utf-8')
  188. res = int_log(sa_c, base)
  189. expected_result = None
  190. if expected_error == Error.Okay:
  191. expected_result = int(math.log(a, base))
  192. return test("test_log", res, args, expected_error, expected_result)
  193. def test_pow(base = 0, power = 0, expected_error = Error.Okay):
  194. args = [str(base), power]
  195. sa_c = args[0].encode('utf-8')
  196. res = int_pow(sa_c, power)
  197. expected_result = None
  198. if expected_error == Error.Okay:
  199. if power < 0:
  200. expected_result = 0
  201. else:
  202. # NOTE(Jeroen): Don't use `math.pow`, it's a floating point approximation.
  203. # Use built-in `pow` or `a**b` instead.
  204. expected_result = pow(base, power)
  205. return test("test_pow", res, args, expected_error, expected_result)
  206. def test_sqrt(number = 0, expected_error = Error.Okay):
  207. args = [str(number)]
  208. sa_c = args[0].encode('utf-8')
  209. try:
  210. res = int_sqrt(sa_c)
  211. except:
  212. print("sqrt:", number)
  213. expected_result = None
  214. if expected_error == Error.Okay:
  215. if number < 0:
  216. expected_result = 0
  217. else:
  218. expected_result = int(math.isqrt(number))
  219. return test("test_sqrt", res, args, expected_error, expected_result)
  220. def root_n(number, root):
  221. u, s = number, number + 1
  222. while u < s:
  223. s = u
  224. t = (root-1) * s + number // pow(s, root - 1)
  225. u = t // root
  226. return s
  227. def test_root_n(number = 0, root = 0, expected_error = Error.Okay):
  228. args = [str(number), root]
  229. sa_c = args[0].encode('utf-8')
  230. try:
  231. res = int_root_n(sa_c, root)
  232. except:
  233. print("root_n:", number, root)
  234. expected_result = None
  235. if expected_error == Error.Okay:
  236. if number < 0:
  237. expected_result = 0
  238. else:
  239. expected_result = root_n(number, root)
  240. return test("test_root_n", res, args, expected_error, expected_result)
  241. def test_shl_digit(a = 0, digits = 0, expected_error = Error.Okay):
  242. args = [str(a), digits]
  243. sa_c = args[0].encode('utf-8')
  244. res = int_shl_digit(sa_c, digits)
  245. expected_result = None
  246. if expected_error == Error.Okay:
  247. expected_result = a << (digits * 60)
  248. return test("test_shl_digit", res, args, expected_error, expected_result)
  249. def test_shr_digit(a = 0, digits = 0, expected_error = Error.Okay):
  250. args = [str(a), digits]
  251. sa_c = args[0].encode('utf-8')
  252. try:
  253. res = int_shr_digit(sa_c, digits)
  254. except:
  255. print("int_shr_digit", a, digits)
  256. exit()
  257. expected_result = None
  258. if expected_error == Error.Okay:
  259. if a < 0:
  260. # Don't pass negative numbers. We have a shr_signed.
  261. return False
  262. else:
  263. expected_result = a >> (digits * 60)
  264. return test("test_shr_digit", res, args, expected_error, expected_result)
  265. def test_shl(a = 0, bits = 0, expected_error = Error.Okay):
  266. args = [str(a), bits]
  267. sa_c = args[0].encode('utf-8')
  268. res = int_shl(sa_c, bits)
  269. expected_result = None
  270. if expected_error == Error.Okay:
  271. expected_result = a << bits
  272. return test("test_shl", res, args, expected_error, expected_result)
  273. def test_shr(a = 0, bits = 0, expected_error = Error.Okay):
  274. args = [str(a), bits]
  275. sa_c = args[0].encode('utf-8')
  276. try:
  277. res = int_shr(sa_c, bits)
  278. except:
  279. print("int_shr", a, bits)
  280. exit()
  281. expected_result = None
  282. if expected_error == Error.Okay:
  283. if a < 0:
  284. # Don't pass negative numbers. We have a shr_signed.
  285. return False
  286. else:
  287. expected_result = a >> bits
  288. return test("test_shr", res, args, expected_error, expected_result)
  289. def test_shr_signed(a = 0, bits = 0, expected_error = Error.Okay):
  290. args = [str(a), bits]
  291. sa_c = args[0].encode('utf-8')
  292. try:
  293. res = int_shr_signed(sa_c, bits)
  294. except:
  295. print("int_shr_signed", a, bits)
  296. exit()
  297. expected_result = None
  298. if expected_error == Error.Okay:
  299. expected_result = a >> bits
  300. return test("test_shr_signed", res, args, expected_error, expected_result)
  301. # TODO(Jeroen): Make sure tests cover edge cases, fast paths, and so on.
  302. #
  303. # The last two arguments in tests are the expected error and expected result.
  304. #
  305. # The expected error defaults to None.
  306. # By default the Odin implementation will be tested against the Python one.
  307. # You can override that by supplying an expected result as the last argument instead.
  308. TESTS = {
  309. test_add: [
  310. [ 1234, 5432],
  311. ],
  312. test_sub: [
  313. [ 1234, 5432],
  314. ],
  315. test_mul: [
  316. [ 1234, 5432],
  317. [ 0xd3b4e926aaba3040e1c12b5ea553b5, 0x1a821e41257ed9281bee5bc7789ea7]
  318. ],
  319. test_div: [
  320. [ 54321, 12345],
  321. [ 55431, 0, Error.Division_by_Zero],
  322. [ 12980742146337069150589594264770969721, 4611686018427387904 ],
  323. ],
  324. test_log: [
  325. [ 3192, 1, Error.Invalid_Argument],
  326. [ -1234, 2, Error.Math_Domain_Error],
  327. [ 0, 2, Error.Math_Domain_Error],
  328. [ 1024, 2],
  329. ],
  330. test_pow: [
  331. [ 0, -1, Error.Math_Domain_Error ], # Math
  332. [ 0, 0 ], # 1
  333. [ 0, 2 ], # 0
  334. [ 42, -1,], # 0
  335. [ 42, 1 ], # 1
  336. [ 42, 0 ], # 42
  337. [ 42, 2 ], # 42*42
  338. ],
  339. test_sqrt: [
  340. [ -1, Error.Invalid_Argument, ],
  341. [ 42, Error.Okay, ],
  342. [ 12345678901234567890, Error.Okay, ],
  343. [ 1298074214633706907132624082305024, Error.Okay, ],
  344. ],
  345. test_root_n: [
  346. [ 1298074214633706907132624082305024, 2, Error.Okay, ],
  347. ],
  348. test_shl_digit: [
  349. [ 3192, 1 ],
  350. [ 1298074214633706907132624082305024, 2 ],
  351. [ 1024, 3 ],
  352. ],
  353. test_shr_digit: [
  354. [ 3680125442705055547392, 1 ],
  355. [ 1725436586697640946858688965569256363112777243042596638790631055949824, 2 ],
  356. [ 219504133884436710204395031992179571, 2 ],
  357. ],
  358. test_shl: [
  359. [ 3192, 1 ],
  360. [ 1298074214633706907132624082305024, 2 ],
  361. [ 1024, 3 ],
  362. ],
  363. test_shr: [
  364. [ 3680125442705055547392, 1 ],
  365. [ 1725436586697640946858688965569256363112777243042596638790631055949824, 2 ],
  366. [ 219504133884436710204395031992179571, 2 ],
  367. ],
  368. test_shr_signed: [
  369. [ -611105530635358368578155082258244262, 12 ],
  370. [ -149195686190273039203651143129455, 12 ],
  371. [ 611105530635358368578155082258244262, 12 ],
  372. [ 149195686190273039203651143129455, 12 ],
  373. ]
  374. }
  375. total_passes = 0
  376. total_failures = 0
  377. #
  378. # test_shr_signed also tests shr, so we're not going to test shr randomly.
  379. #
  380. RANDOM_TESTS = [
  381. test_add, test_sub, test_mul, test_div,
  382. test_log, test_pow, test_sqrt, test_root_n,
  383. test_shl_digit, test_shr_digit, test_shl, test_shr_signed,
  384. ]
  385. SKIP_LARGE = [
  386. test_pow, test_root_n,
  387. ]
  388. SKIP_LARGEST = []
  389. # Untimed warmup.
  390. for test_proc in TESTS:
  391. for t in TESTS[test_proc]:
  392. res = test_proc(*t)
  393. if __name__ == '__main__':
  394. print("---- math/big tests ----")
  395. print()
  396. for test_proc in TESTS:
  397. count_pass = 0
  398. count_fail = 0
  399. TIMINGS = {}
  400. for t in TESTS[test_proc]:
  401. start = time.perf_counter()
  402. res = test_proc(*t)
  403. diff = time.perf_counter() - start
  404. TOTAL_TIME += diff
  405. if test_proc not in TIMINGS:
  406. TIMINGS[test_proc] = diff
  407. else:
  408. TIMINGS[test_proc] += diff
  409. if res:
  410. count_pass += 1
  411. total_passes += 1
  412. else:
  413. count_fail += 1
  414. total_failures += 1
  415. print("{name}: {count_pass:,} passes and {count_fail:,} failures in {timing:.3f} ms.".format(name=test_proc.__name__, count_pass=count_pass, count_fail=count_fail, timing=TIMINGS[test_proc] * 1_000))
  416. for BITS, ITERATIONS in BITS_AND_ITERATIONS:
  417. print()
  418. print("---- math/big with two random {bits:,} bit numbers ----".format(bits=BITS))
  419. print()
  420. for test_proc in RANDOM_TESTS:
  421. if BITS > 1_200 and test_proc in SKIP_LARGE: continue
  422. if BITS > 4_096 and test_proc in SKIP_LARGEST: continue
  423. count_pass = 0
  424. count_fail = 0
  425. TIMINGS = {}
  426. UNTIL_ITERS = ITERATIONS
  427. UNTIL_TIME = TOTAL_TIME + BITS / TIMED_BITS_PER_SECOND
  428. # We run each test for a second per 20k bits
  429. while we_iterate():
  430. a = randint(-(1 << BITS), 1 << BITS)
  431. b = randint(-(1 << BITS), 1 << BITS)
  432. if test_proc == test_div:
  433. # We've already tested division by zero above.
  434. bits = int(BITS * 0.6)
  435. b = randint(-(1 << bits), 1 << bits)
  436. if b == 0:
  437. b == 42
  438. elif test_proc == test_log:
  439. # We've already tested log's domain errors.
  440. a = randint(1, 1 << BITS)
  441. b = randint(2, 1 << 60)
  442. elif test_proc == test_pow:
  443. b = randint(1, 10)
  444. elif test_proc == test_sqrt:
  445. a = randint(1, 1 << BITS)
  446. b = Error.Okay
  447. elif test_proc == test_root_n:
  448. a = randint(1, 1 << BITS)
  449. b = randint(1, 10);
  450. elif test_proc == test_shl_digit:
  451. b = randint(0, 10);
  452. elif test_proc == test_shr_digit:
  453. a = abs(a)
  454. b = randint(0, 10);
  455. elif test_proc == test_shl:
  456. b = randint(0, min(BITS, 120));
  457. elif test_proc == test_shr_signed:
  458. b = randint(0, min(BITS, 120));
  459. else:
  460. b = randint(0, 1 << BITS)
  461. res = None
  462. start = time.perf_counter()
  463. res = test_proc(a, b)
  464. diff = time.perf_counter() - start
  465. TOTAL_TIME += diff
  466. if test_proc not in TIMINGS:
  467. TIMINGS[test_proc] = diff
  468. else:
  469. TIMINGS[test_proc] += diff
  470. if res:
  471. count_pass += 1; total_passes += 1
  472. else:
  473. count_fail += 1; total_failures += 1
  474. print("{name}: {count_pass:,} passes and {count_fail:,} failures in {timing:.3f} ms.".format(name=test_proc.__name__, count_pass=count_pass, count_fail=count_fail, timing=TIMINGS[test_proc] * 1_000))
  475. print()
  476. print("---- THE END ----")
  477. print()
  478. print("total: {count_pass:,} passes and {count_fail:,} failures in {timing:.3f} ms.".format(count_pass=total_passes, count_fail=total_failures, timing=TOTAL_TIME * 1_000))
  479. if total_failures:
  480. exit(1)