test.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  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. int_factorial = load(l.test_factorial, [c_uint64], Res)
  116. def test(test_name: "", res: Res, param=[], expected_error = Error.Okay, expected_result = "", radix=16):
  117. passed = True
  118. r = None
  119. err = Error(res.err)
  120. if err != expected_error:
  121. error_loc = res.res.decode('utf-8')
  122. error = "{}: {} in '{}'".format(test_name, err, error_loc)
  123. if len(param):
  124. error += " with params {}".format(param)
  125. print(error, flush=True)
  126. passed = False
  127. elif err == Error.Okay:
  128. r = None
  129. try:
  130. r = res.res.decode('utf-8')
  131. r = int(res.res, radix)
  132. except:
  133. pass
  134. if r != expected_result:
  135. error = "{}: Result was '{}', expected '{}'".format(test_name, r, expected_result)
  136. if len(param):
  137. error += " with params {}".format(param)
  138. print(error, flush=True)
  139. passed = False
  140. if EXIT_ON_FAIL and not passed: exit(res.err)
  141. return passed
  142. def arg_to_odin(a):
  143. if a >= 0:
  144. s = hex(a)[2:]
  145. else:
  146. s = '-' + hex(a)[3:]
  147. return s.encode('utf-8')
  148. def test_add(a = 0, b = 0, expected_error = Error.Okay):
  149. args = [arg_to_odin(a), arg_to_odin(b)]
  150. res = add(*args)
  151. expected_result = None
  152. if expected_error == Error.Okay:
  153. expected_result = a + b
  154. return test("test_add", res, [a, b], expected_error, expected_result)
  155. def test_sub(a = 0, b = 0, expected_error = Error.Okay):
  156. args = [arg_to_odin(a), arg_to_odin(b)]
  157. res = sub(*args)
  158. expected_result = None
  159. if expected_error == Error.Okay:
  160. expected_result = a - b
  161. return test("test_sub", res, [a, b], expected_error, expected_result)
  162. def test_mul(a = 0, b = 0, expected_error = Error.Okay):
  163. args = [arg_to_odin(a), arg_to_odin(b)]
  164. res = mul(*args)
  165. expected_result = None
  166. if expected_error == Error.Okay:
  167. expected_result = a * b
  168. return test("test_mul", res, [a, b], expected_error, expected_result)
  169. def test_div(a = 0, b = 0, expected_error = Error.Okay):
  170. args = [arg_to_odin(a), arg_to_odin(b)]
  171. res = div(*args)
  172. expected_result = None
  173. if expected_error == Error.Okay:
  174. #
  175. # We don't round the division results, so if one component is negative, we're off by one.
  176. #
  177. if a < 0 and b > 0:
  178. expected_result = int(-(abs(a) // b))
  179. elif b < 0 and a > 0:
  180. expected_result = int(-(a // abs((b))))
  181. else:
  182. expected_result = a // b if b != 0 else None
  183. return test("test_div", res, [a, b], expected_error, expected_result)
  184. def test_log(a = 0, base = 0, expected_error = Error.Okay):
  185. args = [arg_to_odin(a), base]
  186. res = int_log(*args)
  187. expected_result = None
  188. if expected_error == Error.Okay:
  189. expected_result = int(math.log(a, base))
  190. return test("test_log", res, [a, base], expected_error, expected_result)
  191. def test_pow(base = 0, power = 0, expected_error = Error.Okay):
  192. args = [arg_to_odin(base), power]
  193. res = int_pow(*args)
  194. expected_result = None
  195. if expected_error == Error.Okay:
  196. if power < 0:
  197. expected_result = 0
  198. else:
  199. # NOTE(Jeroen): Don't use `math.pow`, it's a floating point approximation.
  200. # Use built-in `pow` or `a**b` instead.
  201. expected_result = pow(base, power)
  202. return test("test_pow", res, [base, power], expected_error, expected_result)
  203. def test_sqrt(number = 0, expected_error = Error.Okay):
  204. args = [arg_to_odin(number)]
  205. res = int_sqrt(*args)
  206. expected_result = None
  207. if expected_error == Error.Okay:
  208. if number < 0:
  209. expected_result = 0
  210. else:
  211. expected_result = int(math.isqrt(number))
  212. return test("test_sqrt", res, [number], expected_error, expected_result)
  213. def root_n(number, root):
  214. u, s = number, number + 1
  215. while u < s:
  216. s = u
  217. t = (root-1) * s + number // pow(s, root - 1)
  218. u = t // root
  219. return s
  220. def test_root_n(number = 0, root = 0, expected_error = Error.Okay):
  221. args = [arg_to_odin(number), root]
  222. res = int_root_n(*args)
  223. expected_result = None
  224. if expected_error == Error.Okay:
  225. if number < 0:
  226. expected_result = 0
  227. else:
  228. expected_result = root_n(number, root)
  229. return test("test_root_n", res, [number, root], expected_error, expected_result)
  230. def test_shl_digit(a = 0, digits = 0, expected_error = Error.Okay):
  231. args = [arg_to_odin(a), digits]
  232. res = int_shl_digit(*args)
  233. expected_result = None
  234. if expected_error == Error.Okay:
  235. expected_result = a << (digits * 60)
  236. return test("test_shl_digit", res, [a, digits], expected_error, expected_result)
  237. def test_shr_digit(a = 0, digits = 0, expected_error = Error.Okay):
  238. args = [arg_to_odin(a), digits]
  239. res = int_shr_digit(*args)
  240. expected_result = None
  241. if expected_error == Error.Okay:
  242. if a < 0:
  243. # Don't pass negative numbers. We have a shr_signed.
  244. return False
  245. else:
  246. expected_result = a >> (digits * 60)
  247. return test("test_shr_digit", res, [a, digits], expected_error, expected_result)
  248. def test_shl(a = 0, bits = 0, expected_error = Error.Okay):
  249. args = [arg_to_odin(a), bits]
  250. res = int_shl(*args)
  251. expected_result = None
  252. if expected_error == Error.Okay:
  253. expected_result = a << bits
  254. return test("test_shl", res, [a, bits], expected_error, expected_result)
  255. def test_shr(a = 0, bits = 0, expected_error = Error.Okay):
  256. args = [arg_to_odin(a), bits]
  257. res = int_shr(*args)
  258. expected_result = None
  259. if expected_error == Error.Okay:
  260. if a < 0:
  261. # Don't pass negative numbers. We have a shr_signed.
  262. return False
  263. else:
  264. expected_result = a >> bits
  265. return test("test_shr", res, [a, bits], expected_error, expected_result)
  266. def test_shr_signed(a = 0, bits = 0, expected_error = Error.Okay):
  267. args = [arg_to_odin(a), bits]
  268. res = int_shr_signed(*args)
  269. expected_result = None
  270. if expected_error == Error.Okay:
  271. expected_result = a >> bits
  272. return test("test_shr_signed", res, [a, bits], expected_error, expected_result)
  273. def test_factorial(n = 0, expected_error = Error.Okay):
  274. args = [n]
  275. res = int_factorial(*args)
  276. expected_result = None
  277. if expected_error == Error.Okay:
  278. expected_result = math.factorial(n)
  279. return test("test_factorial", res, [n], expected_error, expected_result)
  280. # TODO(Jeroen): Make sure tests cover edge cases, fast paths, and so on.
  281. #
  282. # The last two arguments in tests are the expected error and expected result.
  283. #
  284. # The expected error defaults to None.
  285. # By default the Odin implementation will be tested against the Python one.
  286. # You can override that by supplying an expected result as the last argument instead.
  287. TESTS = {
  288. test_add: [
  289. [ 1234, 5432],
  290. ],
  291. test_sub: [
  292. [ 1234, 5432],
  293. ],
  294. test_mul: [
  295. [ 1234, 5432],
  296. [ 0xd3b4e926aaba3040e1c12b5ea553b5, 0x1a821e41257ed9281bee5bc7789ea7]
  297. ],
  298. test_div: [
  299. [ 54321, 12345],
  300. [ 55431, 0, Error.Division_by_Zero],
  301. [ 12980742146337069150589594264770969721, 4611686018427387904 ],
  302. ],
  303. test_log: [
  304. [ 3192, 1, Error.Invalid_Argument],
  305. [ -1234, 2, Error.Math_Domain_Error],
  306. [ 0, 2, Error.Math_Domain_Error],
  307. [ 1024, 2],
  308. ],
  309. test_pow: [
  310. [ 0, -1, Error.Math_Domain_Error ], # Math
  311. [ 0, 0 ], # 1
  312. [ 0, 2 ], # 0
  313. [ 42, -1,], # 0
  314. [ 42, 1 ], # 1
  315. [ 42, 0 ], # 42
  316. [ 42, 2 ], # 42*42
  317. ],
  318. test_sqrt: [
  319. [ -1, Error.Invalid_Argument, ],
  320. [ 42, Error.Okay, ],
  321. [ 12345678901234567890, Error.Okay, ],
  322. [ 1298074214633706907132624082305024, Error.Okay, ],
  323. ],
  324. test_root_n: [
  325. [ 1298074214633706907132624082305024, 2, Error.Okay, ],
  326. ],
  327. test_shl_digit: [
  328. [ 3192, 1 ],
  329. [ 1298074214633706907132624082305024, 2 ],
  330. [ 1024, 3 ],
  331. ],
  332. test_shr_digit: [
  333. [ 3680125442705055547392, 1 ],
  334. [ 1725436586697640946858688965569256363112777243042596638790631055949824, 2 ],
  335. [ 219504133884436710204395031992179571, 2 ],
  336. ],
  337. test_shl: [
  338. [ 3192, 1 ],
  339. [ 1298074214633706907132624082305024, 2 ],
  340. [ 1024, 3 ],
  341. ],
  342. test_shr: [
  343. [ 3680125442705055547392, 1 ],
  344. [ 1725436586697640946858688965569256363112777243042596638790631055949824, 2 ],
  345. [ 219504133884436710204395031992179571, 2 ],
  346. ],
  347. test_shr_signed: [
  348. [ -611105530635358368578155082258244262, 12 ],
  349. [ -149195686190273039203651143129455, 12 ],
  350. [ 611105530635358368578155082258244262, 12 ],
  351. [ 149195686190273039203651143129455, 12 ],
  352. ],
  353. test_factorial: [
  354. [ 12_345 ],
  355. ],
  356. }
  357. total_passes = 0
  358. total_failures = 0
  359. #
  360. # test_shr_signed also tests shr, so we're not going to test shr randomly.
  361. #
  362. RANDOM_TESTS = [
  363. test_add, test_sub, test_mul, test_div,
  364. test_log, test_pow, test_sqrt, test_root_n,
  365. test_shl_digit, test_shr_digit, test_shl, test_shr_signed,
  366. ]
  367. SKIP_LARGE = [
  368. test_pow, test_root_n,
  369. ]
  370. SKIP_LARGEST = []
  371. # Untimed warmup.
  372. for test_proc in TESTS:
  373. for t in TESTS[test_proc]:
  374. res = test_proc(*t)
  375. if __name__ == '__main__':
  376. print("---- math/big tests ----")
  377. print()
  378. for test_proc in TESTS:
  379. count_pass = 0
  380. count_fail = 0
  381. TIMINGS = {}
  382. for t in TESTS[test_proc]:
  383. start = time.perf_counter()
  384. res = test_proc(*t)
  385. diff = time.perf_counter() - start
  386. TOTAL_TIME += diff
  387. if test_proc not in TIMINGS:
  388. TIMINGS[test_proc] = diff
  389. else:
  390. TIMINGS[test_proc] += diff
  391. if res:
  392. count_pass += 1
  393. total_passes += 1
  394. else:
  395. count_fail += 1
  396. total_failures += 1
  397. 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))
  398. for BITS, ITERATIONS in BITS_AND_ITERATIONS:
  399. print()
  400. print("---- math/big with two random {bits:,} bit numbers ----".format(bits=BITS))
  401. print()
  402. for test_proc in RANDOM_TESTS:
  403. if BITS > 1_200 and test_proc in SKIP_LARGE: continue
  404. if BITS > 4_096 and test_proc in SKIP_LARGEST: continue
  405. count_pass = 0
  406. count_fail = 0
  407. TIMINGS = {}
  408. UNTIL_ITERS = ITERATIONS
  409. if test_proc == test_root_n and BITS == 1_200:
  410. UNTIL_ITERS /= 10
  411. UNTIL_TIME = TOTAL_TIME + BITS / TIMED_BITS_PER_SECOND
  412. # We run each test for a second per 20k bits
  413. while we_iterate():
  414. a = randint(-(1 << BITS), 1 << BITS)
  415. b = randint(-(1 << BITS), 1 << BITS)
  416. if test_proc == test_div:
  417. # We've already tested division by zero above.
  418. bits = int(BITS * 0.6)
  419. b = randint(-(1 << bits), 1 << bits)
  420. if b == 0:
  421. b == 42
  422. elif test_proc == test_log:
  423. # We've already tested log's domain errors.
  424. a = randint(1, 1 << BITS)
  425. b = randint(2, 1 << 60)
  426. elif test_proc == test_pow:
  427. b = randint(1, 10)
  428. elif test_proc == test_sqrt:
  429. a = randint(1, 1 << BITS)
  430. b = Error.Okay
  431. elif test_proc == test_root_n:
  432. a = randint(1, 1 << BITS)
  433. b = randint(1, 10);
  434. elif test_proc == test_shl_digit:
  435. b = randint(0, 10);
  436. elif test_proc == test_shr_digit:
  437. a = abs(a)
  438. b = randint(0, 10);
  439. elif test_proc == test_shl:
  440. b = randint(0, min(BITS, 120));
  441. elif test_proc == test_shr_signed:
  442. b = randint(0, min(BITS, 120));
  443. else:
  444. b = randint(0, 1 << BITS)
  445. res = None
  446. start = time.perf_counter()
  447. res = test_proc(a, b)
  448. diff = time.perf_counter() - start
  449. TOTAL_TIME += diff
  450. if test_proc not in TIMINGS:
  451. TIMINGS[test_proc] = diff
  452. else:
  453. TIMINGS[test_proc] += diff
  454. if res:
  455. count_pass += 1; total_passes += 1
  456. else:
  457. count_fail += 1; total_failures += 1
  458. 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))
  459. print()
  460. print("---- THE END ----")
  461. print()
  462. 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))
  463. if total_failures:
  464. exit(1)