test_overflow.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417
  1. // SPDX-License-Identifier: GPL-2.0 OR MIT
  2. /*
  3. * Test cases for arithmetic overflow checks.
  4. */
  5. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  6. #include <linux/device.h>
  7. #include <linux/init.h>
  8. #include <linux/kernel.h>
  9. #include <linux/mm.h>
  10. #include <linux/module.h>
  11. #include <linux/overflow.h>
  12. #include <linux/slab.h>
  13. #include <linux/types.h>
  14. #include <linux/vmalloc.h>
  15. #define DEFINE_TEST_ARRAY(t) \
  16. static const struct test_ ## t { \
  17. t a, b; \
  18. t sum, diff, prod; \
  19. bool s_of, d_of, p_of; \
  20. } t ## _tests[] __initconst
  21. DEFINE_TEST_ARRAY(u8) = {
  22. {0, 0, 0, 0, 0, false, false, false},
  23. {1, 1, 2, 0, 1, false, false, false},
  24. {0, 1, 1, U8_MAX, 0, false, true, false},
  25. {1, 0, 1, 1, 0, false, false, false},
  26. {0, U8_MAX, U8_MAX, 1, 0, false, true, false},
  27. {U8_MAX, 0, U8_MAX, U8_MAX, 0, false, false, false},
  28. {1, U8_MAX, 0, 2, U8_MAX, true, true, false},
  29. {U8_MAX, 1, 0, U8_MAX-1, U8_MAX, true, false, false},
  30. {U8_MAX, U8_MAX, U8_MAX-1, 0, 1, true, false, true},
  31. {U8_MAX, U8_MAX-1, U8_MAX-2, 1, 2, true, false, true},
  32. {U8_MAX-1, U8_MAX, U8_MAX-2, U8_MAX, 2, true, true, true},
  33. {1U << 3, 1U << 3, 1U << 4, 0, 1U << 6, false, false, false},
  34. {1U << 4, 1U << 4, 1U << 5, 0, 0, false, false, true},
  35. {1U << 4, 1U << 3, 3*(1U << 3), 1U << 3, 1U << 7, false, false, false},
  36. {1U << 7, 1U << 7, 0, 0, 0, true, false, true},
  37. {48, 32, 80, 16, 0, false, false, true},
  38. {128, 128, 0, 0, 0, true, false, true},
  39. {123, 234, 101, 145, 110, true, true, true},
  40. };
  41. DEFINE_TEST_ARRAY(u16) = {
  42. {0, 0, 0, 0, 0, false, false, false},
  43. {1, 1, 2, 0, 1, false, false, false},
  44. {0, 1, 1, U16_MAX, 0, false, true, false},
  45. {1, 0, 1, 1, 0, false, false, false},
  46. {0, U16_MAX, U16_MAX, 1, 0, false, true, false},
  47. {U16_MAX, 0, U16_MAX, U16_MAX, 0, false, false, false},
  48. {1, U16_MAX, 0, 2, U16_MAX, true, true, false},
  49. {U16_MAX, 1, 0, U16_MAX-1, U16_MAX, true, false, false},
  50. {U16_MAX, U16_MAX, U16_MAX-1, 0, 1, true, false, true},
  51. {U16_MAX, U16_MAX-1, U16_MAX-2, 1, 2, true, false, true},
  52. {U16_MAX-1, U16_MAX, U16_MAX-2, U16_MAX, 2, true, true, true},
  53. {1U << 7, 1U << 7, 1U << 8, 0, 1U << 14, false, false, false},
  54. {1U << 8, 1U << 8, 1U << 9, 0, 0, false, false, true},
  55. {1U << 8, 1U << 7, 3*(1U << 7), 1U << 7, 1U << 15, false, false, false},
  56. {1U << 15, 1U << 15, 0, 0, 0, true, false, true},
  57. {123, 234, 357, 65425, 28782, false, true, false},
  58. {1234, 2345, 3579, 64425, 10146, false, true, true},
  59. };
  60. DEFINE_TEST_ARRAY(u32) = {
  61. {0, 0, 0, 0, 0, false, false, false},
  62. {1, 1, 2, 0, 1, false, false, false},
  63. {0, 1, 1, U32_MAX, 0, false, true, false},
  64. {1, 0, 1, 1, 0, false, false, false},
  65. {0, U32_MAX, U32_MAX, 1, 0, false, true, false},
  66. {U32_MAX, 0, U32_MAX, U32_MAX, 0, false, false, false},
  67. {1, U32_MAX, 0, 2, U32_MAX, true, true, false},
  68. {U32_MAX, 1, 0, U32_MAX-1, U32_MAX, true, false, false},
  69. {U32_MAX, U32_MAX, U32_MAX-1, 0, 1, true, false, true},
  70. {U32_MAX, U32_MAX-1, U32_MAX-2, 1, 2, true, false, true},
  71. {U32_MAX-1, U32_MAX, U32_MAX-2, U32_MAX, 2, true, true, true},
  72. {1U << 15, 1U << 15, 1U << 16, 0, 1U << 30, false, false, false},
  73. {1U << 16, 1U << 16, 1U << 17, 0, 0, false, false, true},
  74. {1U << 16, 1U << 15, 3*(1U << 15), 1U << 15, 1U << 31, false, false, false},
  75. {1U << 31, 1U << 31, 0, 0, 0, true, false, true},
  76. {-2U, 1U, -1U, -3U, -2U, false, false, false},
  77. {-4U, 5U, 1U, -9U, -20U, true, false, true},
  78. };
  79. DEFINE_TEST_ARRAY(u64) = {
  80. {0, 0, 0, 0, 0, false, false, false},
  81. {1, 1, 2, 0, 1, false, false, false},
  82. {0, 1, 1, U64_MAX, 0, false, true, false},
  83. {1, 0, 1, 1, 0, false, false, false},
  84. {0, U64_MAX, U64_MAX, 1, 0, false, true, false},
  85. {U64_MAX, 0, U64_MAX, U64_MAX, 0, false, false, false},
  86. {1, U64_MAX, 0, 2, U64_MAX, true, true, false},
  87. {U64_MAX, 1, 0, U64_MAX-1, U64_MAX, true, false, false},
  88. {U64_MAX, U64_MAX, U64_MAX-1, 0, 1, true, false, true},
  89. {U64_MAX, U64_MAX-1, U64_MAX-2, 1, 2, true, false, true},
  90. {U64_MAX-1, U64_MAX, U64_MAX-2, U64_MAX, 2, true, true, true},
  91. {1ULL << 31, 1ULL << 31, 1ULL << 32, 0, 1ULL << 62, false, false, false},
  92. {1ULL << 32, 1ULL << 32, 1ULL << 33, 0, 0, false, false, true},
  93. {1ULL << 32, 1ULL << 31, 3*(1ULL << 31), 1ULL << 31, 1ULL << 63, false, false, false},
  94. {1ULL << 63, 1ULL << 63, 0, 0, 0, true, false, true},
  95. {1000000000ULL /* 10^9 */, 10000000000ULL /* 10^10 */,
  96. 11000000000ULL, 18446744064709551616ULL, 10000000000000000000ULL,
  97. false, true, false},
  98. {-15ULL, 10ULL, -5ULL, -25ULL, -150ULL, false, false, true},
  99. };
  100. DEFINE_TEST_ARRAY(s8) = {
  101. {0, 0, 0, 0, 0, false, false, false},
  102. {0, S8_MAX, S8_MAX, -S8_MAX, 0, false, false, false},
  103. {S8_MAX, 0, S8_MAX, S8_MAX, 0, false, false, false},
  104. {0, S8_MIN, S8_MIN, S8_MIN, 0, false, true, false},
  105. {S8_MIN, 0, S8_MIN, S8_MIN, 0, false, false, false},
  106. {-1, S8_MIN, S8_MAX, S8_MAX, S8_MIN, true, false, true},
  107. {S8_MIN, -1, S8_MAX, -S8_MAX, S8_MIN, true, false, true},
  108. {-1, S8_MAX, S8_MAX-1, S8_MIN, -S8_MAX, false, false, false},
  109. {S8_MAX, -1, S8_MAX-1, S8_MIN, -S8_MAX, false, true, false},
  110. {-1, -S8_MAX, S8_MIN, S8_MAX-1, S8_MAX, false, false, false},
  111. {-S8_MAX, -1, S8_MIN, S8_MIN+2, S8_MAX, false, false, false},
  112. {1, S8_MIN, -S8_MAX, -S8_MAX, S8_MIN, false, true, false},
  113. {S8_MIN, 1, -S8_MAX, S8_MAX, S8_MIN, false, true, false},
  114. {1, S8_MAX, S8_MIN, S8_MIN+2, S8_MAX, true, false, false},
  115. {S8_MAX, 1, S8_MIN, S8_MAX-1, S8_MAX, true, false, false},
  116. {S8_MIN, S8_MIN, 0, 0, 0, true, false, true},
  117. {S8_MAX, S8_MAX, -2, 0, 1, true, false, true},
  118. {-4, -32, -36, 28, -128, false, false, true},
  119. {-4, 32, 28, -36, -128, false, false, false},
  120. };
  121. DEFINE_TEST_ARRAY(s16) = {
  122. {0, 0, 0, 0, 0, false, false, false},
  123. {0, S16_MAX, S16_MAX, -S16_MAX, 0, false, false, false},
  124. {S16_MAX, 0, S16_MAX, S16_MAX, 0, false, false, false},
  125. {0, S16_MIN, S16_MIN, S16_MIN, 0, false, true, false},
  126. {S16_MIN, 0, S16_MIN, S16_MIN, 0, false, false, false},
  127. {-1, S16_MIN, S16_MAX, S16_MAX, S16_MIN, true, false, true},
  128. {S16_MIN, -1, S16_MAX, -S16_MAX, S16_MIN, true, false, true},
  129. {-1, S16_MAX, S16_MAX-1, S16_MIN, -S16_MAX, false, false, false},
  130. {S16_MAX, -1, S16_MAX-1, S16_MIN, -S16_MAX, false, true, false},
  131. {-1, -S16_MAX, S16_MIN, S16_MAX-1, S16_MAX, false, false, false},
  132. {-S16_MAX, -1, S16_MIN, S16_MIN+2, S16_MAX, false, false, false},
  133. {1, S16_MIN, -S16_MAX, -S16_MAX, S16_MIN, false, true, false},
  134. {S16_MIN, 1, -S16_MAX, S16_MAX, S16_MIN, false, true, false},
  135. {1, S16_MAX, S16_MIN, S16_MIN+2, S16_MAX, true, false, false},
  136. {S16_MAX, 1, S16_MIN, S16_MAX-1, S16_MAX, true, false, false},
  137. {S16_MIN, S16_MIN, 0, 0, 0, true, false, true},
  138. {S16_MAX, S16_MAX, -2, 0, 1, true, false, true},
  139. };
  140. DEFINE_TEST_ARRAY(s32) = {
  141. {0, 0, 0, 0, 0, false, false, false},
  142. {0, S32_MAX, S32_MAX, -S32_MAX, 0, false, false, false},
  143. {S32_MAX, 0, S32_MAX, S32_MAX, 0, false, false, false},
  144. {0, S32_MIN, S32_MIN, S32_MIN, 0, false, true, false},
  145. {S32_MIN, 0, S32_MIN, S32_MIN, 0, false, false, false},
  146. {-1, S32_MIN, S32_MAX, S32_MAX, S32_MIN, true, false, true},
  147. {S32_MIN, -1, S32_MAX, -S32_MAX, S32_MIN, true, false, true},
  148. {-1, S32_MAX, S32_MAX-1, S32_MIN, -S32_MAX, false, false, false},
  149. {S32_MAX, -1, S32_MAX-1, S32_MIN, -S32_MAX, false, true, false},
  150. {-1, -S32_MAX, S32_MIN, S32_MAX-1, S32_MAX, false, false, false},
  151. {-S32_MAX, -1, S32_MIN, S32_MIN+2, S32_MAX, false, false, false},
  152. {1, S32_MIN, -S32_MAX, -S32_MAX, S32_MIN, false, true, false},
  153. {S32_MIN, 1, -S32_MAX, S32_MAX, S32_MIN, false, true, false},
  154. {1, S32_MAX, S32_MIN, S32_MIN+2, S32_MAX, true, false, false},
  155. {S32_MAX, 1, S32_MIN, S32_MAX-1, S32_MAX, true, false, false},
  156. {S32_MIN, S32_MIN, 0, 0, 0, true, false, true},
  157. {S32_MAX, S32_MAX, -2, 0, 1, true, false, true},
  158. };
  159. DEFINE_TEST_ARRAY(s64) = {
  160. {0, 0, 0, 0, 0, false, false, false},
  161. {0, S64_MAX, S64_MAX, -S64_MAX, 0, false, false, false},
  162. {S64_MAX, 0, S64_MAX, S64_MAX, 0, false, false, false},
  163. {0, S64_MIN, S64_MIN, S64_MIN, 0, false, true, false},
  164. {S64_MIN, 0, S64_MIN, S64_MIN, 0, false, false, false},
  165. {-1, S64_MIN, S64_MAX, S64_MAX, S64_MIN, true, false, true},
  166. {S64_MIN, -1, S64_MAX, -S64_MAX, S64_MIN, true, false, true},
  167. {-1, S64_MAX, S64_MAX-1, S64_MIN, -S64_MAX, false, false, false},
  168. {S64_MAX, -1, S64_MAX-1, S64_MIN, -S64_MAX, false, true, false},
  169. {-1, -S64_MAX, S64_MIN, S64_MAX-1, S64_MAX, false, false, false},
  170. {-S64_MAX, -1, S64_MIN, S64_MIN+2, S64_MAX, false, false, false},
  171. {1, S64_MIN, -S64_MAX, -S64_MAX, S64_MIN, false, true, false},
  172. {S64_MIN, 1, -S64_MAX, S64_MAX, S64_MIN, false, true, false},
  173. {1, S64_MAX, S64_MIN, S64_MIN+2, S64_MAX, true, false, false},
  174. {S64_MAX, 1, S64_MIN, S64_MAX-1, S64_MAX, true, false, false},
  175. {S64_MIN, S64_MIN, 0, 0, 0, true, false, true},
  176. {S64_MAX, S64_MAX, -2, 0, 1, true, false, true},
  177. {-1, -1, -2, 0, 1, false, false, false},
  178. {-1, -128, -129, 127, 128, false, false, false},
  179. {-128, -1, -129, -127, 128, false, false, false},
  180. {0, -S64_MAX, -S64_MAX, S64_MAX, 0, false, false, false},
  181. };
  182. #define check_one_op(t, fmt, op, sym, a, b, r, of) do { \
  183. t _r; \
  184. bool _of; \
  185. \
  186. _of = check_ ## op ## _overflow(a, b, &_r); \
  187. if (_of != of) { \
  188. pr_warn("expected "fmt" "sym" "fmt \
  189. " to%s overflow (type %s)\n", \
  190. a, b, of ? "" : " not", #t); \
  191. err = 1; \
  192. } \
  193. if (_r != r) { \
  194. pr_warn("expected "fmt" "sym" "fmt" == " \
  195. fmt", got "fmt" (type %s)\n", \
  196. a, b, r, _r, #t); \
  197. err = 1; \
  198. } \
  199. } while (0)
  200. #define DEFINE_TEST_FUNC(t, fmt) \
  201. static int __init do_test_ ## t(const struct test_ ## t *p) \
  202. { \
  203. int err = 0; \
  204. \
  205. check_one_op(t, fmt, add, "+", p->a, p->b, p->sum, p->s_of); \
  206. check_one_op(t, fmt, add, "+", p->b, p->a, p->sum, p->s_of); \
  207. check_one_op(t, fmt, sub, "-", p->a, p->b, p->diff, p->d_of); \
  208. check_one_op(t, fmt, mul, "*", p->a, p->b, p->prod, p->p_of); \
  209. check_one_op(t, fmt, mul, "*", p->b, p->a, p->prod, p->p_of); \
  210. \
  211. return err; \
  212. } \
  213. \
  214. static int __init test_ ## t ## _overflow(void) { \
  215. int err = 0; \
  216. unsigned i; \
  217. \
  218. pr_info("%-3s: %zu tests\n", #t, ARRAY_SIZE(t ## _tests)); \
  219. for (i = 0; i < ARRAY_SIZE(t ## _tests); ++i) \
  220. err |= do_test_ ## t(&t ## _tests[i]); \
  221. return err; \
  222. }
  223. DEFINE_TEST_FUNC(u8, "%d");
  224. DEFINE_TEST_FUNC(s8, "%d");
  225. DEFINE_TEST_FUNC(u16, "%d");
  226. DEFINE_TEST_FUNC(s16, "%d");
  227. DEFINE_TEST_FUNC(u32, "%u");
  228. DEFINE_TEST_FUNC(s32, "%d");
  229. #if BITS_PER_LONG == 64
  230. DEFINE_TEST_FUNC(u64, "%llu");
  231. DEFINE_TEST_FUNC(s64, "%lld");
  232. #endif
  233. static int __init test_overflow_calculation(void)
  234. {
  235. int err = 0;
  236. err |= test_u8_overflow();
  237. err |= test_s8_overflow();
  238. err |= test_u16_overflow();
  239. err |= test_s16_overflow();
  240. err |= test_u32_overflow();
  241. err |= test_s32_overflow();
  242. #if BITS_PER_LONG == 64
  243. err |= test_u64_overflow();
  244. err |= test_s64_overflow();
  245. #endif
  246. return err;
  247. }
  248. /*
  249. * Deal with the various forms of allocator arguments. See comments above
  250. * the DEFINE_TEST_ALLOC() instances for mapping of the "bits".
  251. */
  252. #define alloc010(alloc, arg, sz) alloc(sz, GFP_KERNEL)
  253. #define alloc011(alloc, arg, sz) alloc(sz, GFP_KERNEL, NUMA_NO_NODE)
  254. #define alloc000(alloc, arg, sz) alloc(sz)
  255. #define alloc001(alloc, arg, sz) alloc(sz, NUMA_NO_NODE)
  256. #define alloc110(alloc, arg, sz) alloc(arg, sz, GFP_KERNEL)
  257. #define free0(free, arg, ptr) free(ptr)
  258. #define free1(free, arg, ptr) free(arg, ptr)
  259. /* Wrap around to 8K */
  260. #define TEST_SIZE (9 << PAGE_SHIFT)
  261. #define DEFINE_TEST_ALLOC(func, free_func, want_arg, want_gfp, want_node)\
  262. static int __init test_ ## func (void *arg) \
  263. { \
  264. volatile size_t a = TEST_SIZE; \
  265. volatile size_t b = (SIZE_MAX / TEST_SIZE) + 1; \
  266. void *ptr; \
  267. \
  268. /* Tiny allocation test. */ \
  269. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, 1);\
  270. if (!ptr) { \
  271. pr_warn(#func " failed regular allocation?!\n"); \
  272. return 1; \
  273. } \
  274. free ## want_arg (free_func, arg, ptr); \
  275. \
  276. /* Wrapped allocation test. */ \
  277. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, \
  278. a * b); \
  279. if (!ptr) { \
  280. pr_warn(#func " unexpectedly failed bad wrapping?!\n"); \
  281. return 1; \
  282. } \
  283. free ## want_arg (free_func, arg, ptr); \
  284. \
  285. /* Saturated allocation test. */ \
  286. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, \
  287. array_size(a, b)); \
  288. if (ptr) { \
  289. pr_warn(#func " missed saturation!\n"); \
  290. free ## want_arg (free_func, arg, ptr); \
  291. return 1; \
  292. } \
  293. pr_info(#func " detected saturation\n"); \
  294. return 0; \
  295. }
  296. /*
  297. * Allocator uses a trailing node argument --------+ (e.g. kmalloc_node())
  298. * Allocator uses the gfp_t argument -----------+ | (e.g. kmalloc())
  299. * Allocator uses a special leading argument + | | (e.g. devm_kmalloc())
  300. * | | |
  301. */
  302. DEFINE_TEST_ALLOC(kmalloc, kfree, 0, 1, 0);
  303. DEFINE_TEST_ALLOC(kmalloc_node, kfree, 0, 1, 1);
  304. DEFINE_TEST_ALLOC(kzalloc, kfree, 0, 1, 0);
  305. DEFINE_TEST_ALLOC(kzalloc_node, kfree, 0, 1, 1);
  306. DEFINE_TEST_ALLOC(vmalloc, vfree, 0, 0, 0);
  307. DEFINE_TEST_ALLOC(vmalloc_node, vfree, 0, 0, 1);
  308. DEFINE_TEST_ALLOC(vzalloc, vfree, 0, 0, 0);
  309. DEFINE_TEST_ALLOC(vzalloc_node, vfree, 0, 0, 1);
  310. DEFINE_TEST_ALLOC(kvmalloc, kvfree, 0, 1, 0);
  311. DEFINE_TEST_ALLOC(kvmalloc_node, kvfree, 0, 1, 1);
  312. DEFINE_TEST_ALLOC(kvzalloc, kvfree, 0, 1, 0);
  313. DEFINE_TEST_ALLOC(kvzalloc_node, kvfree, 0, 1, 1);
  314. DEFINE_TEST_ALLOC(devm_kmalloc, devm_kfree, 1, 1, 0);
  315. DEFINE_TEST_ALLOC(devm_kzalloc, devm_kfree, 1, 1, 0);
  316. static int __init test_overflow_allocation(void)
  317. {
  318. const char device_name[] = "overflow-test";
  319. struct device *dev;
  320. int err = 0;
  321. /* Create dummy device for devm_kmalloc()-family tests. */
  322. dev = root_device_register(device_name);
  323. if (!dev) {
  324. pr_warn("Cannot register test device\n");
  325. return 1;
  326. }
  327. err |= test_kmalloc(NULL);
  328. err |= test_kmalloc_node(NULL);
  329. err |= test_kzalloc(NULL);
  330. err |= test_kzalloc_node(NULL);
  331. err |= test_kvmalloc(NULL);
  332. err |= test_kvmalloc_node(NULL);
  333. err |= test_kvzalloc(NULL);
  334. err |= test_kvzalloc_node(NULL);
  335. err |= test_vmalloc(NULL);
  336. err |= test_vmalloc_node(NULL);
  337. err |= test_vzalloc(NULL);
  338. err |= test_vzalloc_node(NULL);
  339. err |= test_devm_kmalloc(dev);
  340. err |= test_devm_kzalloc(dev);
  341. device_unregister(dev);
  342. return err;
  343. }
  344. static int __init test_module_init(void)
  345. {
  346. int err = 0;
  347. err |= test_overflow_calculation();
  348. err |= test_overflow_allocation();
  349. if (err) {
  350. pr_warn("FAIL!\n");
  351. err = -EINVAL;
  352. } else {
  353. pr_info("all tests passed\n");
  354. }
  355. return err;
  356. }
  357. static void __exit test_module_exit(void)
  358. { }
  359. module_init(test_module_init);
  360. module_exit(test_module_exit);
  361. MODULE_LICENSE("Dual MIT/GPL");