overflow_kunit.c 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149
  1. // SPDX-License-Identifier: GPL-2.0 OR MIT
  2. /*
  3. * Test cases for arithmetic overflow checks. See:
  4. * "Running tests with kunit_tool" at Documentation/dev-tools/kunit/start.rst
  5. * ./tools/testing/kunit/kunit.py run overflow [--raw_output]
  6. */
  7. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  8. #include <kunit/test.h>
  9. #include <linux/device.h>
  10. #include <linux/kernel.h>
  11. #include <linux/mm.h>
  12. #include <linux/module.h>
  13. #include <linux/overflow.h>
  14. #include <linux/slab.h>
  15. #include <linux/types.h>
  16. #include <linux/vmalloc.h>
  17. #define SKIP(cond, reason) do { \
  18. if (cond) { \
  19. kunit_skip(test, reason); \
  20. return; \
  21. } \
  22. } while (0)
  23. /*
  24. * Clang 11 and earlier generate unwanted libcalls for signed output
  25. * on unsigned input.
  26. */
  27. #if defined(CONFIG_CC_IS_CLANG) && __clang_major__ <= 11
  28. # define SKIP_SIGN_MISMATCH(t) SKIP(t, "Clang 11 unwanted libcalls")
  29. #else
  30. # define SKIP_SIGN_MISMATCH(t) do { } while (0)
  31. #endif
  32. /*
  33. * Clang 13 and earlier generate unwanted libcalls for 64-bit tests on
  34. * 32-bit hosts.
  35. */
  36. #if defined(CONFIG_CC_IS_CLANG) && __clang_major__ <= 13 && \
  37. BITS_PER_LONG != 64
  38. # define SKIP_64_ON_32(t) SKIP(t, "Clang 13 unwanted libcalls")
  39. #else
  40. # define SKIP_64_ON_32(t) do { } while (0)
  41. #endif
  42. #define DEFINE_TEST_ARRAY_TYPED(t1, t2, t) \
  43. static const struct test_ ## t1 ## _ ## t2 ## __ ## t { \
  44. t1 a; \
  45. t2 b; \
  46. t sum, diff, prod; \
  47. bool s_of, d_of, p_of; \
  48. } t1 ## _ ## t2 ## __ ## t ## _tests[]
  49. #define DEFINE_TEST_ARRAY(t) DEFINE_TEST_ARRAY_TYPED(t, t, t)
  50. DEFINE_TEST_ARRAY(u8) = {
  51. {0, 0, 0, 0, 0, false, false, false},
  52. {1, 1, 2, 0, 1, false, false, false},
  53. {0, 1, 1, U8_MAX, 0, false, true, false},
  54. {1, 0, 1, 1, 0, false, false, false},
  55. {0, U8_MAX, U8_MAX, 1, 0, false, true, false},
  56. {U8_MAX, 0, U8_MAX, U8_MAX, 0, false, false, false},
  57. {1, U8_MAX, 0, 2, U8_MAX, true, true, false},
  58. {U8_MAX, 1, 0, U8_MAX-1, U8_MAX, true, false, false},
  59. {U8_MAX, U8_MAX, U8_MAX-1, 0, 1, true, false, true},
  60. {U8_MAX, U8_MAX-1, U8_MAX-2, 1, 2, true, false, true},
  61. {U8_MAX-1, U8_MAX, U8_MAX-2, U8_MAX, 2, true, true, true},
  62. {1U << 3, 1U << 3, 1U << 4, 0, 1U << 6, false, false, false},
  63. {1U << 4, 1U << 4, 1U << 5, 0, 0, false, false, true},
  64. {1U << 4, 1U << 3, 3*(1U << 3), 1U << 3, 1U << 7, false, false, false},
  65. {1U << 7, 1U << 7, 0, 0, 0, true, false, true},
  66. {48, 32, 80, 16, 0, false, false, true},
  67. {128, 128, 0, 0, 0, true, false, true},
  68. {123, 234, 101, 145, 110, true, true, true},
  69. };
  70. DEFINE_TEST_ARRAY(u16) = {
  71. {0, 0, 0, 0, 0, false, false, false},
  72. {1, 1, 2, 0, 1, false, false, false},
  73. {0, 1, 1, U16_MAX, 0, false, true, false},
  74. {1, 0, 1, 1, 0, false, false, false},
  75. {0, U16_MAX, U16_MAX, 1, 0, false, true, false},
  76. {U16_MAX, 0, U16_MAX, U16_MAX, 0, false, false, false},
  77. {1, U16_MAX, 0, 2, U16_MAX, true, true, false},
  78. {U16_MAX, 1, 0, U16_MAX-1, U16_MAX, true, false, false},
  79. {U16_MAX, U16_MAX, U16_MAX-1, 0, 1, true, false, true},
  80. {U16_MAX, U16_MAX-1, U16_MAX-2, 1, 2, true, false, true},
  81. {U16_MAX-1, U16_MAX, U16_MAX-2, U16_MAX, 2, true, true, true},
  82. {1U << 7, 1U << 7, 1U << 8, 0, 1U << 14, false, false, false},
  83. {1U << 8, 1U << 8, 1U << 9, 0, 0, false, false, true},
  84. {1U << 8, 1U << 7, 3*(1U << 7), 1U << 7, 1U << 15, false, false, false},
  85. {1U << 15, 1U << 15, 0, 0, 0, true, false, true},
  86. {123, 234, 357, 65425, 28782, false, true, false},
  87. {1234, 2345, 3579, 64425, 10146, false, true, true},
  88. };
  89. DEFINE_TEST_ARRAY(u32) = {
  90. {0, 0, 0, 0, 0, false, false, false},
  91. {1, 1, 2, 0, 1, false, false, false},
  92. {0, 1, 1, U32_MAX, 0, false, true, false},
  93. {1, 0, 1, 1, 0, false, false, false},
  94. {0, U32_MAX, U32_MAX, 1, 0, false, true, false},
  95. {U32_MAX, 0, U32_MAX, U32_MAX, 0, false, false, false},
  96. {1, U32_MAX, 0, 2, U32_MAX, true, true, false},
  97. {U32_MAX, 1, 0, U32_MAX-1, U32_MAX, true, false, false},
  98. {U32_MAX, U32_MAX, U32_MAX-1, 0, 1, true, false, true},
  99. {U32_MAX, U32_MAX-1, U32_MAX-2, 1, 2, true, false, true},
  100. {U32_MAX-1, U32_MAX, U32_MAX-2, U32_MAX, 2, true, true, true},
  101. {1U << 15, 1U << 15, 1U << 16, 0, 1U << 30, false, false, false},
  102. {1U << 16, 1U << 16, 1U << 17, 0, 0, false, false, true},
  103. {1U << 16, 1U << 15, 3*(1U << 15), 1U << 15, 1U << 31, false, false, false},
  104. {1U << 31, 1U << 31, 0, 0, 0, true, false, true},
  105. {-2U, 1U, -1U, -3U, -2U, false, false, false},
  106. {-4U, 5U, 1U, -9U, -20U, true, false, true},
  107. };
  108. DEFINE_TEST_ARRAY(u64) = {
  109. {0, 0, 0, 0, 0, false, false, false},
  110. {1, 1, 2, 0, 1, false, false, false},
  111. {0, 1, 1, U64_MAX, 0, false, true, false},
  112. {1, 0, 1, 1, 0, false, false, false},
  113. {0, U64_MAX, U64_MAX, 1, 0, false, true, false},
  114. {U64_MAX, 0, U64_MAX, U64_MAX, 0, false, false, false},
  115. {1, U64_MAX, 0, 2, U64_MAX, true, true, false},
  116. {U64_MAX, 1, 0, U64_MAX-1, U64_MAX, true, false, false},
  117. {U64_MAX, U64_MAX, U64_MAX-1, 0, 1, true, false, true},
  118. {U64_MAX, U64_MAX-1, U64_MAX-2, 1, 2, true, false, true},
  119. {U64_MAX-1, U64_MAX, U64_MAX-2, U64_MAX, 2, true, true, true},
  120. {1ULL << 31, 1ULL << 31, 1ULL << 32, 0, 1ULL << 62, false, false, false},
  121. {1ULL << 32, 1ULL << 32, 1ULL << 33, 0, 0, false, false, true},
  122. {1ULL << 32, 1ULL << 31, 3*(1ULL << 31), 1ULL << 31, 1ULL << 63, false, false, false},
  123. {1ULL << 63, 1ULL << 63, 0, 0, 0, true, false, true},
  124. {1000000000ULL /* 10^9 */, 10000000000ULL /* 10^10 */,
  125. 11000000000ULL, 18446744064709551616ULL, 10000000000000000000ULL,
  126. false, true, false},
  127. {-15ULL, 10ULL, -5ULL, -25ULL, -150ULL, false, false, true},
  128. };
  129. DEFINE_TEST_ARRAY(s8) = {
  130. {0, 0, 0, 0, 0, false, false, false},
  131. {0, S8_MAX, S8_MAX, -S8_MAX, 0, false, false, false},
  132. {S8_MAX, 0, S8_MAX, S8_MAX, 0, false, false, false},
  133. {0, S8_MIN, S8_MIN, S8_MIN, 0, false, true, false},
  134. {S8_MIN, 0, S8_MIN, S8_MIN, 0, false, false, false},
  135. {-1, S8_MIN, S8_MAX, S8_MAX, S8_MIN, true, false, true},
  136. {S8_MIN, -1, S8_MAX, -S8_MAX, S8_MIN, true, false, true},
  137. {-1, S8_MAX, S8_MAX-1, S8_MIN, -S8_MAX, false, false, false},
  138. {S8_MAX, -1, S8_MAX-1, S8_MIN, -S8_MAX, false, true, false},
  139. {-1, -S8_MAX, S8_MIN, S8_MAX-1, S8_MAX, false, false, false},
  140. {-S8_MAX, -1, S8_MIN, S8_MIN+2, S8_MAX, false, false, false},
  141. {1, S8_MIN, -S8_MAX, -S8_MAX, S8_MIN, false, true, false},
  142. {S8_MIN, 1, -S8_MAX, S8_MAX, S8_MIN, false, true, false},
  143. {1, S8_MAX, S8_MIN, S8_MIN+2, S8_MAX, true, false, false},
  144. {S8_MAX, 1, S8_MIN, S8_MAX-1, S8_MAX, true, false, false},
  145. {S8_MIN, S8_MIN, 0, 0, 0, true, false, true},
  146. {S8_MAX, S8_MAX, -2, 0, 1, true, false, true},
  147. {-4, -32, -36, 28, -128, false, false, true},
  148. {-4, 32, 28, -36, -128, false, false, false},
  149. };
  150. DEFINE_TEST_ARRAY(s16) = {
  151. {0, 0, 0, 0, 0, false, false, false},
  152. {0, S16_MAX, S16_MAX, -S16_MAX, 0, false, false, false},
  153. {S16_MAX, 0, S16_MAX, S16_MAX, 0, false, false, false},
  154. {0, S16_MIN, S16_MIN, S16_MIN, 0, false, true, false},
  155. {S16_MIN, 0, S16_MIN, S16_MIN, 0, false, false, false},
  156. {-1, S16_MIN, S16_MAX, S16_MAX, S16_MIN, true, false, true},
  157. {S16_MIN, -1, S16_MAX, -S16_MAX, S16_MIN, true, false, true},
  158. {-1, S16_MAX, S16_MAX-1, S16_MIN, -S16_MAX, false, false, false},
  159. {S16_MAX, -1, S16_MAX-1, S16_MIN, -S16_MAX, false, true, false},
  160. {-1, -S16_MAX, S16_MIN, S16_MAX-1, S16_MAX, false, false, false},
  161. {-S16_MAX, -1, S16_MIN, S16_MIN+2, S16_MAX, false, false, false},
  162. {1, S16_MIN, -S16_MAX, -S16_MAX, S16_MIN, false, true, false},
  163. {S16_MIN, 1, -S16_MAX, S16_MAX, S16_MIN, false, true, false},
  164. {1, S16_MAX, S16_MIN, S16_MIN+2, S16_MAX, true, false, false},
  165. {S16_MAX, 1, S16_MIN, S16_MAX-1, S16_MAX, true, false, false},
  166. {S16_MIN, S16_MIN, 0, 0, 0, true, false, true},
  167. {S16_MAX, S16_MAX, -2, 0, 1, true, false, true},
  168. };
  169. DEFINE_TEST_ARRAY(s32) = {
  170. {0, 0, 0, 0, 0, false, false, false},
  171. {0, S32_MAX, S32_MAX, -S32_MAX, 0, false, false, false},
  172. {S32_MAX, 0, S32_MAX, S32_MAX, 0, false, false, false},
  173. {0, S32_MIN, S32_MIN, S32_MIN, 0, false, true, false},
  174. {S32_MIN, 0, S32_MIN, S32_MIN, 0, false, false, false},
  175. {-1, S32_MIN, S32_MAX, S32_MAX, S32_MIN, true, false, true},
  176. {S32_MIN, -1, S32_MAX, -S32_MAX, S32_MIN, true, false, true},
  177. {-1, S32_MAX, S32_MAX-1, S32_MIN, -S32_MAX, false, false, false},
  178. {S32_MAX, -1, S32_MAX-1, S32_MIN, -S32_MAX, false, true, false},
  179. {-1, -S32_MAX, S32_MIN, S32_MAX-1, S32_MAX, false, false, false},
  180. {-S32_MAX, -1, S32_MIN, S32_MIN+2, S32_MAX, false, false, false},
  181. {1, S32_MIN, -S32_MAX, -S32_MAX, S32_MIN, false, true, false},
  182. {S32_MIN, 1, -S32_MAX, S32_MAX, S32_MIN, false, true, false},
  183. {1, S32_MAX, S32_MIN, S32_MIN+2, S32_MAX, true, false, false},
  184. {S32_MAX, 1, S32_MIN, S32_MAX-1, S32_MAX, true, false, false},
  185. {S32_MIN, S32_MIN, 0, 0, 0, true, false, true},
  186. {S32_MAX, S32_MAX, -2, 0, 1, true, false, true},
  187. };
  188. DEFINE_TEST_ARRAY(s64) = {
  189. {0, 0, 0, 0, 0, false, false, false},
  190. {0, S64_MAX, S64_MAX, -S64_MAX, 0, false, false, false},
  191. {S64_MAX, 0, S64_MAX, S64_MAX, 0, false, false, false},
  192. {0, S64_MIN, S64_MIN, S64_MIN, 0, false, true, false},
  193. {S64_MIN, 0, S64_MIN, S64_MIN, 0, false, false, false},
  194. {-1, S64_MIN, S64_MAX, S64_MAX, S64_MIN, true, false, true},
  195. {S64_MIN, -1, S64_MAX, -S64_MAX, S64_MIN, true, false, true},
  196. {-1, S64_MAX, S64_MAX-1, S64_MIN, -S64_MAX, false, false, false},
  197. {S64_MAX, -1, S64_MAX-1, S64_MIN, -S64_MAX, false, true, false},
  198. {-1, -S64_MAX, S64_MIN, S64_MAX-1, S64_MAX, false, false, false},
  199. {-S64_MAX, -1, S64_MIN, S64_MIN+2, S64_MAX, false, false, false},
  200. {1, S64_MIN, -S64_MAX, -S64_MAX, S64_MIN, false, true, false},
  201. {S64_MIN, 1, -S64_MAX, S64_MAX, S64_MIN, false, true, false},
  202. {1, S64_MAX, S64_MIN, S64_MIN+2, S64_MAX, true, false, false},
  203. {S64_MAX, 1, S64_MIN, S64_MAX-1, S64_MAX, true, false, false},
  204. {S64_MIN, S64_MIN, 0, 0, 0, true, false, true},
  205. {S64_MAX, S64_MAX, -2, 0, 1, true, false, true},
  206. {-1, -1, -2, 0, 1, false, false, false},
  207. {-1, -128, -129, 127, 128, false, false, false},
  208. {-128, -1, -129, -127, 128, false, false, false},
  209. {0, -S64_MAX, -S64_MAX, S64_MAX, 0, false, false, false},
  210. };
  211. #define check_one_op(t, fmt, op, sym, a, b, r, of) do { \
  212. int _a_orig = a, _a_bump = a + 1; \
  213. int _b_orig = b, _b_bump = b + 1; \
  214. bool _of; \
  215. t _r; \
  216. \
  217. _of = check_ ## op ## _overflow(a, b, &_r); \
  218. KUNIT_EXPECT_EQ_MSG(test, _of, of, \
  219. "expected "fmt" "sym" "fmt" to%s overflow (type %s)\n", \
  220. a, b, of ? "" : " not", #t); \
  221. KUNIT_EXPECT_EQ_MSG(test, _r, r, \
  222. "expected "fmt" "sym" "fmt" == "fmt", got "fmt" (type %s)\n", \
  223. a, b, r, _r, #t); \
  224. /* Check for internal macro side-effects. */ \
  225. _of = check_ ## op ## _overflow(_a_orig++, _b_orig++, &_r); \
  226. KUNIT_EXPECT_EQ_MSG(test, _a_orig, _a_bump, "Unexpected " #op " macro side-effect!\n"); \
  227. KUNIT_EXPECT_EQ_MSG(test, _b_orig, _b_bump, "Unexpected " #op " macro side-effect!\n"); \
  228. } while (0)
  229. #define DEFINE_TEST_FUNC_TYPED(n, t, fmt) \
  230. static void do_test_ ## n(struct kunit *test, const struct test_ ## n *p) \
  231. { \
  232. check_one_op(t, fmt, add, "+", p->a, p->b, p->sum, p->s_of); \
  233. check_one_op(t, fmt, add, "+", p->b, p->a, p->sum, p->s_of); \
  234. check_one_op(t, fmt, sub, "-", p->a, p->b, p->diff, p->d_of); \
  235. check_one_op(t, fmt, mul, "*", p->a, p->b, p->prod, p->p_of); \
  236. check_one_op(t, fmt, mul, "*", p->b, p->a, p->prod, p->p_of); \
  237. } \
  238. \
  239. static void n ## _overflow_test(struct kunit *test) { \
  240. unsigned i; \
  241. \
  242. SKIP_64_ON_32(__same_type(t, u64)); \
  243. SKIP_64_ON_32(__same_type(t, s64)); \
  244. SKIP_SIGN_MISMATCH(__same_type(n ## _tests[0].a, u32) && \
  245. __same_type(n ## _tests[0].b, u32) && \
  246. __same_type(n ## _tests[0].sum, int)); \
  247. \
  248. for (i = 0; i < ARRAY_SIZE(n ## _tests); ++i) \
  249. do_test_ ## n(test, &n ## _tests[i]); \
  250. kunit_info(test, "%zu %s arithmetic tests finished\n", \
  251. ARRAY_SIZE(n ## _tests), #n); \
  252. }
  253. #define DEFINE_TEST_FUNC(t, fmt) \
  254. DEFINE_TEST_FUNC_TYPED(t ## _ ## t ## __ ## t, t, fmt)
  255. DEFINE_TEST_FUNC(u8, "%d");
  256. DEFINE_TEST_FUNC(s8, "%d");
  257. DEFINE_TEST_FUNC(u16, "%d");
  258. DEFINE_TEST_FUNC(s16, "%d");
  259. DEFINE_TEST_FUNC(u32, "%u");
  260. DEFINE_TEST_FUNC(s32, "%d");
  261. DEFINE_TEST_FUNC(u64, "%llu");
  262. DEFINE_TEST_FUNC(s64, "%lld");
  263. DEFINE_TEST_ARRAY_TYPED(u32, u32, u8) = {
  264. {0, 0, 0, 0, 0, false, false, false},
  265. {U8_MAX, 2, 1, U8_MAX - 2, U8_MAX - 1, true, false, true},
  266. {U8_MAX + 1, 0, 0, 0, 0, true, true, false},
  267. };
  268. DEFINE_TEST_FUNC_TYPED(u32_u32__u8, u8, "%d");
  269. DEFINE_TEST_ARRAY_TYPED(u32, u32, int) = {
  270. {0, 0, 0, 0, 0, false, false, false},
  271. {U32_MAX, 0, -1, -1, 0, true, true, false},
  272. };
  273. DEFINE_TEST_FUNC_TYPED(u32_u32__int, int, "%d");
  274. DEFINE_TEST_ARRAY_TYPED(u8, u8, int) = {
  275. {0, 0, 0, 0, 0, false, false, false},
  276. {U8_MAX, U8_MAX, 2 * U8_MAX, 0, U8_MAX * U8_MAX, false, false, false},
  277. {1, 2, 3, -1, 2, false, false, false},
  278. };
  279. DEFINE_TEST_FUNC_TYPED(u8_u8__int, int, "%d");
  280. DEFINE_TEST_ARRAY_TYPED(int, int, u8) = {
  281. {0, 0, 0, 0, 0, false, false, false},
  282. {1, 2, 3, U8_MAX, 2, false, true, false},
  283. {-1, 0, U8_MAX, U8_MAX, 0, true, true, false},
  284. };
  285. DEFINE_TEST_FUNC_TYPED(int_int__u8, u8, "%d");
  286. /* Args are: value, shift, type, expected result, overflow expected */
  287. #define TEST_ONE_SHIFT(a, s, t, expect, of) do { \
  288. typeof(a) __a = (a); \
  289. typeof(s) __s = (s); \
  290. t __e = (expect); \
  291. t __d; \
  292. bool __of = check_shl_overflow(__a, __s, &__d); \
  293. if (__of != of) { \
  294. KUNIT_EXPECT_EQ_MSG(test, __of, of, \
  295. "expected (%s)(%s << %s) to%s overflow\n", \
  296. #t, #a, #s, of ? "" : " not"); \
  297. } else if (!__of && __d != __e) { \
  298. KUNIT_EXPECT_EQ_MSG(test, __d, __e, \
  299. "expected (%s)(%s << %s) == %s\n", \
  300. #t, #a, #s, #expect); \
  301. if ((t)-1 < 0) \
  302. kunit_info(test, "got %lld\n", (s64)__d); \
  303. else \
  304. kunit_info(test, "got %llu\n", (u64)__d); \
  305. } \
  306. count++; \
  307. } while (0)
  308. static void shift_sane_test(struct kunit *test)
  309. {
  310. int count = 0;
  311. /* Sane shifts. */
  312. TEST_ONE_SHIFT(1, 0, u8, 1 << 0, false);
  313. TEST_ONE_SHIFT(1, 4, u8, 1 << 4, false);
  314. TEST_ONE_SHIFT(1, 7, u8, 1 << 7, false);
  315. TEST_ONE_SHIFT(0xF, 4, u8, 0xF << 4, false);
  316. TEST_ONE_SHIFT(1, 0, u16, 1 << 0, false);
  317. TEST_ONE_SHIFT(1, 10, u16, 1 << 10, false);
  318. TEST_ONE_SHIFT(1, 15, u16, 1 << 15, false);
  319. TEST_ONE_SHIFT(0xFF, 8, u16, 0xFF << 8, false);
  320. TEST_ONE_SHIFT(1, 0, int, 1 << 0, false);
  321. TEST_ONE_SHIFT(1, 16, int, 1 << 16, false);
  322. TEST_ONE_SHIFT(1, 30, int, 1 << 30, false);
  323. TEST_ONE_SHIFT(1, 0, s32, 1 << 0, false);
  324. TEST_ONE_SHIFT(1, 16, s32, 1 << 16, false);
  325. TEST_ONE_SHIFT(1, 30, s32, 1 << 30, false);
  326. TEST_ONE_SHIFT(1, 0, unsigned int, 1U << 0, false);
  327. TEST_ONE_SHIFT(1, 20, unsigned int, 1U << 20, false);
  328. TEST_ONE_SHIFT(1, 31, unsigned int, 1U << 31, false);
  329. TEST_ONE_SHIFT(0xFFFFU, 16, unsigned int, 0xFFFFU << 16, false);
  330. TEST_ONE_SHIFT(1, 0, u32, 1U << 0, false);
  331. TEST_ONE_SHIFT(1, 20, u32, 1U << 20, false);
  332. TEST_ONE_SHIFT(1, 31, u32, 1U << 31, false);
  333. TEST_ONE_SHIFT(0xFFFFU, 16, u32, 0xFFFFU << 16, false);
  334. TEST_ONE_SHIFT(1, 0, u64, 1ULL << 0, false);
  335. TEST_ONE_SHIFT(1, 40, u64, 1ULL << 40, false);
  336. TEST_ONE_SHIFT(1, 63, u64, 1ULL << 63, false);
  337. TEST_ONE_SHIFT(0xFFFFFFFFULL, 32, u64, 0xFFFFFFFFULL << 32, false);
  338. /* Sane shift: start and end with 0, without a too-wide shift. */
  339. TEST_ONE_SHIFT(0, 7, u8, 0, false);
  340. TEST_ONE_SHIFT(0, 15, u16, 0, false);
  341. TEST_ONE_SHIFT(0, 31, unsigned int, 0, false);
  342. TEST_ONE_SHIFT(0, 31, u32, 0, false);
  343. TEST_ONE_SHIFT(0, 63, u64, 0, false);
  344. /* Sane shift: start and end with 0, without reaching signed bit. */
  345. TEST_ONE_SHIFT(0, 6, s8, 0, false);
  346. TEST_ONE_SHIFT(0, 14, s16, 0, false);
  347. TEST_ONE_SHIFT(0, 30, int, 0, false);
  348. TEST_ONE_SHIFT(0, 30, s32, 0, false);
  349. TEST_ONE_SHIFT(0, 62, s64, 0, false);
  350. kunit_info(test, "%d sane shift tests finished\n", count);
  351. }
  352. static void shift_overflow_test(struct kunit *test)
  353. {
  354. int count = 0;
  355. /* Overflow: shifted the bit off the end. */
  356. TEST_ONE_SHIFT(1, 8, u8, 0, true);
  357. TEST_ONE_SHIFT(1, 16, u16, 0, true);
  358. TEST_ONE_SHIFT(1, 32, unsigned int, 0, true);
  359. TEST_ONE_SHIFT(1, 32, u32, 0, true);
  360. TEST_ONE_SHIFT(1, 64, u64, 0, true);
  361. /* Overflow: shifted into the signed bit. */
  362. TEST_ONE_SHIFT(1, 7, s8, 0, true);
  363. TEST_ONE_SHIFT(1, 15, s16, 0, true);
  364. TEST_ONE_SHIFT(1, 31, int, 0, true);
  365. TEST_ONE_SHIFT(1, 31, s32, 0, true);
  366. TEST_ONE_SHIFT(1, 63, s64, 0, true);
  367. /* Overflow: high bit falls off unsigned types. */
  368. /* 10010110 */
  369. TEST_ONE_SHIFT(150, 1, u8, 0, true);
  370. /* 1000100010010110 */
  371. TEST_ONE_SHIFT(34966, 1, u16, 0, true);
  372. /* 10000100000010001000100010010110 */
  373. TEST_ONE_SHIFT(2215151766U, 1, u32, 0, true);
  374. TEST_ONE_SHIFT(2215151766U, 1, unsigned int, 0, true);
  375. /* 1000001000010000010000000100000010000100000010001000100010010110 */
  376. TEST_ONE_SHIFT(9372061470395238550ULL, 1, u64, 0, true);
  377. /* Overflow: bit shifted into signed bit on signed types. */
  378. /* 01001011 */
  379. TEST_ONE_SHIFT(75, 1, s8, 0, true);
  380. /* 0100010001001011 */
  381. TEST_ONE_SHIFT(17483, 1, s16, 0, true);
  382. /* 01000010000001000100010001001011 */
  383. TEST_ONE_SHIFT(1107575883, 1, s32, 0, true);
  384. TEST_ONE_SHIFT(1107575883, 1, int, 0, true);
  385. /* 0100000100001000001000000010000001000010000001000100010001001011 */
  386. TEST_ONE_SHIFT(4686030735197619275LL, 1, s64, 0, true);
  387. /* Overflow: bit shifted past signed bit on signed types. */
  388. /* 01001011 */
  389. TEST_ONE_SHIFT(75, 2, s8, 0, true);
  390. /* 0100010001001011 */
  391. TEST_ONE_SHIFT(17483, 2, s16, 0, true);
  392. /* 01000010000001000100010001001011 */
  393. TEST_ONE_SHIFT(1107575883, 2, s32, 0, true);
  394. TEST_ONE_SHIFT(1107575883, 2, int, 0, true);
  395. /* 0100000100001000001000000010000001000010000001000100010001001011 */
  396. TEST_ONE_SHIFT(4686030735197619275LL, 2, s64, 0, true);
  397. kunit_info(test, "%d overflow shift tests finished\n", count);
  398. }
  399. static void shift_truncate_test(struct kunit *test)
  400. {
  401. int count = 0;
  402. /* Overflow: values larger than destination type. */
  403. TEST_ONE_SHIFT(0x100, 0, u8, 0, true);
  404. TEST_ONE_SHIFT(0xFF, 0, s8, 0, true);
  405. TEST_ONE_SHIFT(0x10000U, 0, u16, 0, true);
  406. TEST_ONE_SHIFT(0xFFFFU, 0, s16, 0, true);
  407. TEST_ONE_SHIFT(0x100000000ULL, 0, u32, 0, true);
  408. TEST_ONE_SHIFT(0x100000000ULL, 0, unsigned int, 0, true);
  409. TEST_ONE_SHIFT(0xFFFFFFFFUL, 0, s32, 0, true);
  410. TEST_ONE_SHIFT(0xFFFFFFFFUL, 0, int, 0, true);
  411. TEST_ONE_SHIFT(0xFFFFFFFFFFFFFFFFULL, 0, s64, 0, true);
  412. /* Overflow: shifted at or beyond entire type's bit width. */
  413. TEST_ONE_SHIFT(0, 8, u8, 0, true);
  414. TEST_ONE_SHIFT(0, 9, u8, 0, true);
  415. TEST_ONE_SHIFT(0, 8, s8, 0, true);
  416. TEST_ONE_SHIFT(0, 9, s8, 0, true);
  417. TEST_ONE_SHIFT(0, 16, u16, 0, true);
  418. TEST_ONE_SHIFT(0, 17, u16, 0, true);
  419. TEST_ONE_SHIFT(0, 16, s16, 0, true);
  420. TEST_ONE_SHIFT(0, 17, s16, 0, true);
  421. TEST_ONE_SHIFT(0, 32, u32, 0, true);
  422. TEST_ONE_SHIFT(0, 33, u32, 0, true);
  423. TEST_ONE_SHIFT(0, 32, int, 0, true);
  424. TEST_ONE_SHIFT(0, 33, int, 0, true);
  425. TEST_ONE_SHIFT(0, 32, s32, 0, true);
  426. TEST_ONE_SHIFT(0, 33, s32, 0, true);
  427. TEST_ONE_SHIFT(0, 64, u64, 0, true);
  428. TEST_ONE_SHIFT(0, 65, u64, 0, true);
  429. TEST_ONE_SHIFT(0, 64, s64, 0, true);
  430. TEST_ONE_SHIFT(0, 65, s64, 0, true);
  431. kunit_info(test, "%d truncate shift tests finished\n", count);
  432. }
  433. static void shift_nonsense_test(struct kunit *test)
  434. {
  435. int count = 0;
  436. /* Nonsense: negative initial value. */
  437. TEST_ONE_SHIFT(-1, 0, s8, 0, true);
  438. TEST_ONE_SHIFT(-1, 0, u8, 0, true);
  439. TEST_ONE_SHIFT(-5, 0, s16, 0, true);
  440. TEST_ONE_SHIFT(-5, 0, u16, 0, true);
  441. TEST_ONE_SHIFT(-10, 0, int, 0, true);
  442. TEST_ONE_SHIFT(-10, 0, unsigned int, 0, true);
  443. TEST_ONE_SHIFT(-100, 0, s32, 0, true);
  444. TEST_ONE_SHIFT(-100, 0, u32, 0, true);
  445. TEST_ONE_SHIFT(-10000, 0, s64, 0, true);
  446. TEST_ONE_SHIFT(-10000, 0, u64, 0, true);
  447. /* Nonsense: negative shift values. */
  448. TEST_ONE_SHIFT(0, -5, s8, 0, true);
  449. TEST_ONE_SHIFT(0, -5, u8, 0, true);
  450. TEST_ONE_SHIFT(0, -10, s16, 0, true);
  451. TEST_ONE_SHIFT(0, -10, u16, 0, true);
  452. TEST_ONE_SHIFT(0, -15, int, 0, true);
  453. TEST_ONE_SHIFT(0, -15, unsigned int, 0, true);
  454. TEST_ONE_SHIFT(0, -20, s32, 0, true);
  455. TEST_ONE_SHIFT(0, -20, u32, 0, true);
  456. TEST_ONE_SHIFT(0, -30, s64, 0, true);
  457. TEST_ONE_SHIFT(0, -30, u64, 0, true);
  458. /*
  459. * Corner case: for unsigned types, we fail when we've shifted
  460. * through the entire width of bits. For signed types, we might
  461. * want to match this behavior, but that would mean noticing if
  462. * we shift through all but the signed bit, and this is not
  463. * currently detected (but we'll notice an overflow into the
  464. * signed bit). So, for now, we will test this condition but
  465. * mark it as not expected to overflow.
  466. */
  467. TEST_ONE_SHIFT(0, 7, s8, 0, false);
  468. TEST_ONE_SHIFT(0, 15, s16, 0, false);
  469. TEST_ONE_SHIFT(0, 31, int, 0, false);
  470. TEST_ONE_SHIFT(0, 31, s32, 0, false);
  471. TEST_ONE_SHIFT(0, 63, s64, 0, false);
  472. kunit_info(test, "%d nonsense shift tests finished\n", count);
  473. }
  474. #undef TEST_ONE_SHIFT
  475. /*
  476. * Deal with the various forms of allocator arguments. See comments above
  477. * the DEFINE_TEST_ALLOC() instances for mapping of the "bits".
  478. */
  479. #define alloc_GFP (GFP_KERNEL | __GFP_NOWARN)
  480. #define alloc010(alloc, arg, sz) alloc(sz, alloc_GFP)
  481. #define alloc011(alloc, arg, sz) alloc(sz, alloc_GFP, NUMA_NO_NODE)
  482. #define alloc000(alloc, arg, sz) alloc(sz)
  483. #define alloc001(alloc, arg, sz) alloc(sz, NUMA_NO_NODE)
  484. #define alloc110(alloc, arg, sz) alloc(arg, sz, alloc_GFP)
  485. #define free0(free, arg, ptr) free(ptr)
  486. #define free1(free, arg, ptr) free(arg, ptr)
  487. /* Wrap around to 16K */
  488. #define TEST_SIZE (5 * 4096)
  489. #define DEFINE_TEST_ALLOC(func, free_func, want_arg, want_gfp, want_node)\
  490. static void test_ ## func (struct kunit *test, void *arg) \
  491. { \
  492. volatile size_t a = TEST_SIZE; \
  493. volatile size_t b = (SIZE_MAX / TEST_SIZE) + 1; \
  494. void *ptr; \
  495. \
  496. /* Tiny allocation test. */ \
  497. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, 1);\
  498. KUNIT_ASSERT_NOT_ERR_OR_NULL_MSG(test, ptr, \
  499. #func " failed regular allocation?!\n"); \
  500. free ## want_arg (free_func, arg, ptr); \
  501. \
  502. /* Wrapped allocation test. */ \
  503. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, \
  504. a * b); \
  505. KUNIT_ASSERT_NOT_ERR_OR_NULL_MSG(test, ptr, \
  506. #func " unexpectedly failed bad wrapping?!\n"); \
  507. free ## want_arg (free_func, arg, ptr); \
  508. \
  509. /* Saturated allocation test. */ \
  510. ptr = alloc ## want_arg ## want_gfp ## want_node (func, arg, \
  511. array_size(a, b)); \
  512. if (ptr) { \
  513. KUNIT_FAIL(test, #func " missed saturation!\n"); \
  514. free ## want_arg (free_func, arg, ptr); \
  515. } \
  516. }
  517. /*
  518. * Allocator uses a trailing node argument --------+ (e.g. kmalloc_node())
  519. * Allocator uses the gfp_t argument -----------+ | (e.g. kmalloc())
  520. * Allocator uses a special leading argument + | | (e.g. devm_kmalloc())
  521. * | | |
  522. */
  523. DEFINE_TEST_ALLOC(kmalloc, kfree, 0, 1, 0);
  524. DEFINE_TEST_ALLOC(kmalloc_node, kfree, 0, 1, 1);
  525. DEFINE_TEST_ALLOC(kzalloc, kfree, 0, 1, 0);
  526. DEFINE_TEST_ALLOC(kzalloc_node, kfree, 0, 1, 1);
  527. DEFINE_TEST_ALLOC(__vmalloc, vfree, 0, 1, 0);
  528. DEFINE_TEST_ALLOC(kvmalloc, kvfree, 0, 1, 0);
  529. DEFINE_TEST_ALLOC(kvmalloc_node, kvfree, 0, 1, 1);
  530. DEFINE_TEST_ALLOC(kvzalloc, kvfree, 0, 1, 0);
  531. DEFINE_TEST_ALLOC(kvzalloc_node, kvfree, 0, 1, 1);
  532. DEFINE_TEST_ALLOC(devm_kmalloc, devm_kfree, 1, 1, 0);
  533. DEFINE_TEST_ALLOC(devm_kzalloc, devm_kfree, 1, 1, 0);
  534. static void overflow_allocation_test(struct kunit *test)
  535. {
  536. const char device_name[] = "overflow-test";
  537. struct device *dev;
  538. int count = 0;
  539. #define check_allocation_overflow(alloc) do { \
  540. count++; \
  541. test_ ## alloc(test, dev); \
  542. } while (0)
  543. /* Create dummy device for devm_kmalloc()-family tests. */
  544. dev = root_device_register(device_name);
  545. KUNIT_ASSERT_FALSE_MSG(test, IS_ERR(dev),
  546. "Cannot register test device\n");
  547. check_allocation_overflow(kmalloc);
  548. check_allocation_overflow(kmalloc_node);
  549. check_allocation_overflow(kzalloc);
  550. check_allocation_overflow(kzalloc_node);
  551. check_allocation_overflow(__vmalloc);
  552. check_allocation_overflow(kvmalloc);
  553. check_allocation_overflow(kvmalloc_node);
  554. check_allocation_overflow(kvzalloc);
  555. check_allocation_overflow(kvzalloc_node);
  556. check_allocation_overflow(devm_kmalloc);
  557. check_allocation_overflow(devm_kzalloc);
  558. device_unregister(dev);
  559. kunit_info(test, "%d allocation overflow tests finished\n", count);
  560. #undef check_allocation_overflow
  561. }
  562. struct __test_flex_array {
  563. unsigned long flags;
  564. size_t count;
  565. unsigned long data[];
  566. };
  567. static void overflow_size_helpers_test(struct kunit *test)
  568. {
  569. /* Make sure struct_size() can be used in a constant expression. */
  570. u8 ce_array[struct_size((struct __test_flex_array *)0, data, 55)];
  571. struct __test_flex_array *obj;
  572. int count = 0;
  573. int var;
  574. volatile int unconst = 0;
  575. /* Verify constant expression against runtime version. */
  576. var = 55;
  577. OPTIMIZER_HIDE_VAR(var);
  578. KUNIT_EXPECT_EQ(test, sizeof(ce_array), struct_size(obj, data, var));
  579. #define check_one_size_helper(expected, func, args...) do { \
  580. size_t _r = func(args); \
  581. KUNIT_EXPECT_EQ_MSG(test, _r, expected, \
  582. "expected " #func "(" #args ") to return %zu but got %zu instead\n", \
  583. (size_t)(expected), _r); \
  584. count++; \
  585. } while (0)
  586. var = 4;
  587. check_one_size_helper(20, size_mul, var++, 5);
  588. check_one_size_helper(20, size_mul, 4, var++);
  589. check_one_size_helper(0, size_mul, 0, 3);
  590. check_one_size_helper(0, size_mul, 3, 0);
  591. check_one_size_helper(6, size_mul, 2, 3);
  592. check_one_size_helper(SIZE_MAX, size_mul, SIZE_MAX, 1);
  593. check_one_size_helper(SIZE_MAX, size_mul, SIZE_MAX, 3);
  594. check_one_size_helper(SIZE_MAX, size_mul, SIZE_MAX, -3);
  595. var = 4;
  596. check_one_size_helper(9, size_add, var++, 5);
  597. check_one_size_helper(9, size_add, 4, var++);
  598. check_one_size_helper(9, size_add, 9, 0);
  599. check_one_size_helper(9, size_add, 0, 9);
  600. check_one_size_helper(5, size_add, 2, 3);
  601. check_one_size_helper(SIZE_MAX, size_add, SIZE_MAX, 1);
  602. check_one_size_helper(SIZE_MAX, size_add, SIZE_MAX, 3);
  603. check_one_size_helper(SIZE_MAX, size_add, SIZE_MAX, -3);
  604. var = 4;
  605. check_one_size_helper(1, size_sub, var--, 3);
  606. check_one_size_helper(1, size_sub, 4, var--);
  607. check_one_size_helper(1, size_sub, 3, 2);
  608. check_one_size_helper(9, size_sub, 9, 0);
  609. check_one_size_helper(SIZE_MAX, size_sub, 9, -3);
  610. check_one_size_helper(SIZE_MAX, size_sub, 0, 9);
  611. check_one_size_helper(SIZE_MAX, size_sub, 2, 3);
  612. check_one_size_helper(SIZE_MAX, size_sub, SIZE_MAX, 0);
  613. check_one_size_helper(SIZE_MAX, size_sub, SIZE_MAX, 10);
  614. check_one_size_helper(SIZE_MAX, size_sub, 0, SIZE_MAX);
  615. check_one_size_helper(SIZE_MAX, size_sub, 14, SIZE_MAX);
  616. check_one_size_helper(SIZE_MAX - 2, size_sub, SIZE_MAX - 1, 1);
  617. check_one_size_helper(SIZE_MAX - 4, size_sub, SIZE_MAX - 1, 3);
  618. check_one_size_helper(1, size_sub, SIZE_MAX - 1, -3);
  619. var = 4;
  620. check_one_size_helper(4 * sizeof(*obj->data),
  621. flex_array_size, obj, data, var++);
  622. check_one_size_helper(5 * sizeof(*obj->data),
  623. flex_array_size, obj, data, var++);
  624. check_one_size_helper(0, flex_array_size, obj, data, 0 + unconst);
  625. check_one_size_helper(sizeof(*obj->data),
  626. flex_array_size, obj, data, 1 + unconst);
  627. check_one_size_helper(7 * sizeof(*obj->data),
  628. flex_array_size, obj, data, 7 + unconst);
  629. check_one_size_helper(SIZE_MAX,
  630. flex_array_size, obj, data, -1 + unconst);
  631. check_one_size_helper(SIZE_MAX,
  632. flex_array_size, obj, data, SIZE_MAX - 4 + unconst);
  633. var = 4;
  634. check_one_size_helper(sizeof(*obj) + (4 * sizeof(*obj->data)),
  635. struct_size, obj, data, var++);
  636. check_one_size_helper(sizeof(*obj) + (5 * sizeof(*obj->data)),
  637. struct_size, obj, data, var++);
  638. check_one_size_helper(sizeof(*obj), struct_size, obj, data, 0 + unconst);
  639. check_one_size_helper(sizeof(*obj) + sizeof(*obj->data),
  640. struct_size, obj, data, 1 + unconst);
  641. check_one_size_helper(SIZE_MAX,
  642. struct_size, obj, data, -3 + unconst);
  643. check_one_size_helper(SIZE_MAX,
  644. struct_size, obj, data, SIZE_MAX - 3 + unconst);
  645. kunit_info(test, "%d overflow size helper tests finished\n", count);
  646. #undef check_one_size_helper
  647. }
  648. static void overflows_type_test(struct kunit *test)
  649. {
  650. int count = 0;
  651. unsigned int var;
  652. #define __TEST_OVERFLOWS_TYPE(func, arg1, arg2, of) do { \
  653. bool __of = func(arg1, arg2); \
  654. KUNIT_EXPECT_EQ_MSG(test, __of, of, \
  655. "expected " #func "(" #arg1 ", " #arg2 " to%s overflow\n",\
  656. of ? "" : " not"); \
  657. count++; \
  658. } while (0)
  659. /* Args are: first type, second type, value, overflow expected */
  660. #define TEST_OVERFLOWS_TYPE(__t1, __t2, v, of) do { \
  661. __t1 t1 = (v); \
  662. __t2 t2; \
  663. __TEST_OVERFLOWS_TYPE(__overflows_type, t1, t2, of); \
  664. __TEST_OVERFLOWS_TYPE(__overflows_type, t1, __t2, of); \
  665. __TEST_OVERFLOWS_TYPE(__overflows_type_constexpr, t1, t2, of); \
  666. __TEST_OVERFLOWS_TYPE(__overflows_type_constexpr, t1, __t2, of);\
  667. } while (0)
  668. TEST_OVERFLOWS_TYPE(u8, u8, U8_MAX, false);
  669. TEST_OVERFLOWS_TYPE(u8, u16, U8_MAX, false);
  670. TEST_OVERFLOWS_TYPE(u8, s8, U8_MAX, true);
  671. TEST_OVERFLOWS_TYPE(u8, s8, S8_MAX, false);
  672. TEST_OVERFLOWS_TYPE(u8, s8, (u8)S8_MAX + 1, true);
  673. TEST_OVERFLOWS_TYPE(u8, s16, U8_MAX, false);
  674. TEST_OVERFLOWS_TYPE(s8, u8, S8_MAX, false);
  675. TEST_OVERFLOWS_TYPE(s8, u8, -1, true);
  676. TEST_OVERFLOWS_TYPE(s8, u8, S8_MIN, true);
  677. TEST_OVERFLOWS_TYPE(s8, u16, S8_MAX, false);
  678. TEST_OVERFLOWS_TYPE(s8, u16, -1, true);
  679. TEST_OVERFLOWS_TYPE(s8, u16, S8_MIN, true);
  680. TEST_OVERFLOWS_TYPE(s8, u32, S8_MAX, false);
  681. TEST_OVERFLOWS_TYPE(s8, u32, -1, true);
  682. TEST_OVERFLOWS_TYPE(s8, u32, S8_MIN, true);
  683. #if BITS_PER_LONG == 64
  684. TEST_OVERFLOWS_TYPE(s8, u64, S8_MAX, false);
  685. TEST_OVERFLOWS_TYPE(s8, u64, -1, true);
  686. TEST_OVERFLOWS_TYPE(s8, u64, S8_MIN, true);
  687. #endif
  688. TEST_OVERFLOWS_TYPE(s8, s8, S8_MAX, false);
  689. TEST_OVERFLOWS_TYPE(s8, s8, S8_MIN, false);
  690. TEST_OVERFLOWS_TYPE(s8, s16, S8_MAX, false);
  691. TEST_OVERFLOWS_TYPE(s8, s16, S8_MIN, false);
  692. TEST_OVERFLOWS_TYPE(u16, u8, U8_MAX, false);
  693. TEST_OVERFLOWS_TYPE(u16, u8, (u16)U8_MAX + 1, true);
  694. TEST_OVERFLOWS_TYPE(u16, u8, U16_MAX, true);
  695. TEST_OVERFLOWS_TYPE(u16, s8, S8_MAX, false);
  696. TEST_OVERFLOWS_TYPE(u16, s8, (u16)S8_MAX + 1, true);
  697. TEST_OVERFLOWS_TYPE(u16, s8, U16_MAX, true);
  698. TEST_OVERFLOWS_TYPE(u16, s16, S16_MAX, false);
  699. TEST_OVERFLOWS_TYPE(u16, s16, (u16)S16_MAX + 1, true);
  700. TEST_OVERFLOWS_TYPE(u16, s16, U16_MAX, true);
  701. TEST_OVERFLOWS_TYPE(u16, u32, U16_MAX, false);
  702. TEST_OVERFLOWS_TYPE(u16, s32, U16_MAX, false);
  703. TEST_OVERFLOWS_TYPE(s16, u8, U8_MAX, false);
  704. TEST_OVERFLOWS_TYPE(s16, u8, (s16)U8_MAX + 1, true);
  705. TEST_OVERFLOWS_TYPE(s16, u8, -1, true);
  706. TEST_OVERFLOWS_TYPE(s16, u8, S16_MIN, true);
  707. TEST_OVERFLOWS_TYPE(s16, u16, S16_MAX, false);
  708. TEST_OVERFLOWS_TYPE(s16, u16, -1, true);
  709. TEST_OVERFLOWS_TYPE(s16, u16, S16_MIN, true);
  710. TEST_OVERFLOWS_TYPE(s16, u32, S16_MAX, false);
  711. TEST_OVERFLOWS_TYPE(s16, u32, -1, true);
  712. TEST_OVERFLOWS_TYPE(s16, u32, S16_MIN, true);
  713. #if BITS_PER_LONG == 64
  714. TEST_OVERFLOWS_TYPE(s16, u64, S16_MAX, false);
  715. TEST_OVERFLOWS_TYPE(s16, u64, -1, true);
  716. TEST_OVERFLOWS_TYPE(s16, u64, S16_MIN, true);
  717. #endif
  718. TEST_OVERFLOWS_TYPE(s16, s8, S8_MAX, false);
  719. TEST_OVERFLOWS_TYPE(s16, s8, S8_MIN, false);
  720. TEST_OVERFLOWS_TYPE(s16, s8, (s16)S8_MAX + 1, true);
  721. TEST_OVERFLOWS_TYPE(s16, s8, (s16)S8_MIN - 1, true);
  722. TEST_OVERFLOWS_TYPE(s16, s8, S16_MAX, true);
  723. TEST_OVERFLOWS_TYPE(s16, s8, S16_MIN, true);
  724. TEST_OVERFLOWS_TYPE(s16, s16, S16_MAX, false);
  725. TEST_OVERFLOWS_TYPE(s16, s16, S16_MIN, false);
  726. TEST_OVERFLOWS_TYPE(s16, s32, S16_MAX, false);
  727. TEST_OVERFLOWS_TYPE(s16, s32, S16_MIN, false);
  728. TEST_OVERFLOWS_TYPE(u32, u8, U8_MAX, false);
  729. TEST_OVERFLOWS_TYPE(u32, u8, (u32)U8_MAX + 1, true);
  730. TEST_OVERFLOWS_TYPE(u32, u8, U32_MAX, true);
  731. TEST_OVERFLOWS_TYPE(u32, s8, S8_MAX, false);
  732. TEST_OVERFLOWS_TYPE(u32, s8, (u32)S8_MAX + 1, true);
  733. TEST_OVERFLOWS_TYPE(u32, s8, U32_MAX, true);
  734. TEST_OVERFLOWS_TYPE(u32, u16, U16_MAX, false);
  735. TEST_OVERFLOWS_TYPE(u32, u16, U16_MAX + 1, true);
  736. TEST_OVERFLOWS_TYPE(u32, u16, U32_MAX, true);
  737. TEST_OVERFLOWS_TYPE(u32, s16, S16_MAX, false);
  738. TEST_OVERFLOWS_TYPE(u32, s16, (u32)S16_MAX + 1, true);
  739. TEST_OVERFLOWS_TYPE(u32, s16, U32_MAX, true);
  740. TEST_OVERFLOWS_TYPE(u32, u32, U32_MAX, false);
  741. TEST_OVERFLOWS_TYPE(u32, s32, S32_MAX, false);
  742. TEST_OVERFLOWS_TYPE(u32, s32, U32_MAX, true);
  743. TEST_OVERFLOWS_TYPE(u32, s32, (u32)S32_MAX + 1, true);
  744. #if BITS_PER_LONG == 64
  745. TEST_OVERFLOWS_TYPE(u32, u64, U32_MAX, false);
  746. TEST_OVERFLOWS_TYPE(u32, s64, U32_MAX, false);
  747. #endif
  748. TEST_OVERFLOWS_TYPE(s32, u8, U8_MAX, false);
  749. TEST_OVERFLOWS_TYPE(s32, u8, (s32)U8_MAX + 1, true);
  750. TEST_OVERFLOWS_TYPE(s32, u16, S32_MAX, true);
  751. TEST_OVERFLOWS_TYPE(s32, u8, -1, true);
  752. TEST_OVERFLOWS_TYPE(s32, u8, S32_MIN, true);
  753. TEST_OVERFLOWS_TYPE(s32, u16, U16_MAX, false);
  754. TEST_OVERFLOWS_TYPE(s32, u16, (s32)U16_MAX + 1, true);
  755. TEST_OVERFLOWS_TYPE(s32, u16, S32_MAX, true);
  756. TEST_OVERFLOWS_TYPE(s32, u16, -1, true);
  757. TEST_OVERFLOWS_TYPE(s32, u16, S32_MIN, true);
  758. TEST_OVERFLOWS_TYPE(s32, u32, S32_MAX, false);
  759. TEST_OVERFLOWS_TYPE(s32, u32, -1, true);
  760. TEST_OVERFLOWS_TYPE(s32, u32, S32_MIN, true);
  761. #if BITS_PER_LONG == 64
  762. TEST_OVERFLOWS_TYPE(s32, u64, S32_MAX, false);
  763. TEST_OVERFLOWS_TYPE(s32, u64, -1, true);
  764. TEST_OVERFLOWS_TYPE(s32, u64, S32_MIN, true);
  765. #endif
  766. TEST_OVERFLOWS_TYPE(s32, s8, S8_MAX, false);
  767. TEST_OVERFLOWS_TYPE(s32, s8, S8_MIN, false);
  768. TEST_OVERFLOWS_TYPE(s32, s8, (s32)S8_MAX + 1, true);
  769. TEST_OVERFLOWS_TYPE(s32, s8, (s32)S8_MIN - 1, true);
  770. TEST_OVERFLOWS_TYPE(s32, s8, S32_MAX, true);
  771. TEST_OVERFLOWS_TYPE(s32, s8, S32_MIN, true);
  772. TEST_OVERFLOWS_TYPE(s32, s16, S16_MAX, false);
  773. TEST_OVERFLOWS_TYPE(s32, s16, S16_MIN, false);
  774. TEST_OVERFLOWS_TYPE(s32, s16, (s32)S16_MAX + 1, true);
  775. TEST_OVERFLOWS_TYPE(s32, s16, (s32)S16_MIN - 1, true);
  776. TEST_OVERFLOWS_TYPE(s32, s16, S32_MAX, true);
  777. TEST_OVERFLOWS_TYPE(s32, s16, S32_MIN, true);
  778. TEST_OVERFLOWS_TYPE(s32, s32, S32_MAX, false);
  779. TEST_OVERFLOWS_TYPE(s32, s32, S32_MIN, false);
  780. #if BITS_PER_LONG == 64
  781. TEST_OVERFLOWS_TYPE(s32, s64, S32_MAX, false);
  782. TEST_OVERFLOWS_TYPE(s32, s64, S32_MIN, false);
  783. TEST_OVERFLOWS_TYPE(u64, u8, U64_MAX, true);
  784. TEST_OVERFLOWS_TYPE(u64, u8, U8_MAX, false);
  785. TEST_OVERFLOWS_TYPE(u64, u8, (u64)U8_MAX + 1, true);
  786. TEST_OVERFLOWS_TYPE(u64, u16, U64_MAX, true);
  787. TEST_OVERFLOWS_TYPE(u64, u16, U16_MAX, false);
  788. TEST_OVERFLOWS_TYPE(u64, u16, (u64)U16_MAX + 1, true);
  789. TEST_OVERFLOWS_TYPE(u64, u32, U64_MAX, true);
  790. TEST_OVERFLOWS_TYPE(u64, u32, U32_MAX, false);
  791. TEST_OVERFLOWS_TYPE(u64, u32, (u64)U32_MAX + 1, true);
  792. TEST_OVERFLOWS_TYPE(u64, u64, U64_MAX, false);
  793. TEST_OVERFLOWS_TYPE(u64, s8, S8_MAX, false);
  794. TEST_OVERFLOWS_TYPE(u64, s8, (u64)S8_MAX + 1, true);
  795. TEST_OVERFLOWS_TYPE(u64, s8, U64_MAX, true);
  796. TEST_OVERFLOWS_TYPE(u64, s16, S16_MAX, false);
  797. TEST_OVERFLOWS_TYPE(u64, s16, (u64)S16_MAX + 1, true);
  798. TEST_OVERFLOWS_TYPE(u64, s16, U64_MAX, true);
  799. TEST_OVERFLOWS_TYPE(u64, s32, S32_MAX, false);
  800. TEST_OVERFLOWS_TYPE(u64, s32, (u64)S32_MAX + 1, true);
  801. TEST_OVERFLOWS_TYPE(u64, s32, U64_MAX, true);
  802. TEST_OVERFLOWS_TYPE(u64, s64, S64_MAX, false);
  803. TEST_OVERFLOWS_TYPE(u64, s64, U64_MAX, true);
  804. TEST_OVERFLOWS_TYPE(u64, s64, (u64)S64_MAX + 1, true);
  805. TEST_OVERFLOWS_TYPE(s64, u8, S64_MAX, true);
  806. TEST_OVERFLOWS_TYPE(s64, u8, S64_MIN, true);
  807. TEST_OVERFLOWS_TYPE(s64, u8, -1, true);
  808. TEST_OVERFLOWS_TYPE(s64, u8, U8_MAX, false);
  809. TEST_OVERFLOWS_TYPE(s64, u8, (s64)U8_MAX + 1, true);
  810. TEST_OVERFLOWS_TYPE(s64, u16, S64_MAX, true);
  811. TEST_OVERFLOWS_TYPE(s64, u16, S64_MIN, true);
  812. TEST_OVERFLOWS_TYPE(s64, u16, -1, true);
  813. TEST_OVERFLOWS_TYPE(s64, u16, U16_MAX, false);
  814. TEST_OVERFLOWS_TYPE(s64, u16, (s64)U16_MAX + 1, true);
  815. TEST_OVERFLOWS_TYPE(s64, u32, S64_MAX, true);
  816. TEST_OVERFLOWS_TYPE(s64, u32, S64_MIN, true);
  817. TEST_OVERFLOWS_TYPE(s64, u32, -1, true);
  818. TEST_OVERFLOWS_TYPE(s64, u32, U32_MAX, false);
  819. TEST_OVERFLOWS_TYPE(s64, u32, (s64)U32_MAX + 1, true);
  820. TEST_OVERFLOWS_TYPE(s64, u64, S64_MAX, false);
  821. TEST_OVERFLOWS_TYPE(s64, u64, S64_MIN, true);
  822. TEST_OVERFLOWS_TYPE(s64, u64, -1, true);
  823. TEST_OVERFLOWS_TYPE(s64, s8, S8_MAX, false);
  824. TEST_OVERFLOWS_TYPE(s64, s8, S8_MIN, false);
  825. TEST_OVERFLOWS_TYPE(s64, s8, (s64)S8_MAX + 1, true);
  826. TEST_OVERFLOWS_TYPE(s64, s8, (s64)S8_MIN - 1, true);
  827. TEST_OVERFLOWS_TYPE(s64, s8, S64_MAX, true);
  828. TEST_OVERFLOWS_TYPE(s64, s16, S16_MAX, false);
  829. TEST_OVERFLOWS_TYPE(s64, s16, S16_MIN, false);
  830. TEST_OVERFLOWS_TYPE(s64, s16, (s64)S16_MAX + 1, true);
  831. TEST_OVERFLOWS_TYPE(s64, s16, (s64)S16_MIN - 1, true);
  832. TEST_OVERFLOWS_TYPE(s64, s16, S64_MAX, true);
  833. TEST_OVERFLOWS_TYPE(s64, s32, S32_MAX, false);
  834. TEST_OVERFLOWS_TYPE(s64, s32, S32_MIN, false);
  835. TEST_OVERFLOWS_TYPE(s64, s32, (s64)S32_MAX + 1, true);
  836. TEST_OVERFLOWS_TYPE(s64, s32, (s64)S32_MIN - 1, true);
  837. TEST_OVERFLOWS_TYPE(s64, s32, S64_MAX, true);
  838. TEST_OVERFLOWS_TYPE(s64, s64, S64_MAX, false);
  839. TEST_OVERFLOWS_TYPE(s64, s64, S64_MIN, false);
  840. #endif
  841. /* Check for macro side-effects. */
  842. var = INT_MAX - 1;
  843. __TEST_OVERFLOWS_TYPE(__overflows_type, var++, int, false);
  844. __TEST_OVERFLOWS_TYPE(__overflows_type, var++, int, false);
  845. __TEST_OVERFLOWS_TYPE(__overflows_type, var++, int, true);
  846. var = INT_MAX - 1;
  847. __TEST_OVERFLOWS_TYPE(overflows_type, var++, int, false);
  848. __TEST_OVERFLOWS_TYPE(overflows_type, var++, int, false);
  849. __TEST_OVERFLOWS_TYPE(overflows_type, var++, int, true);
  850. kunit_info(test, "%d overflows_type() tests finished\n", count);
  851. #undef TEST_OVERFLOWS_TYPE
  852. #undef __TEST_OVERFLOWS_TYPE
  853. }
  854. static void same_type_test(struct kunit *test)
  855. {
  856. int count = 0;
  857. int var;
  858. #define TEST_SAME_TYPE(t1, t2, same) do { \
  859. typeof(t1) __t1h = type_max(t1); \
  860. typeof(t1) __t1l = type_min(t1); \
  861. typeof(t2) __t2h = type_max(t2); \
  862. typeof(t2) __t2l = type_min(t2); \
  863. KUNIT_EXPECT_EQ(test, true, __same_type(t1, __t1h)); \
  864. KUNIT_EXPECT_EQ(test, true, __same_type(t1, __t1l)); \
  865. KUNIT_EXPECT_EQ(test, true, __same_type(__t1h, t1)); \
  866. KUNIT_EXPECT_EQ(test, true, __same_type(__t1l, t1)); \
  867. KUNIT_EXPECT_EQ(test, true, __same_type(t2, __t2h)); \
  868. KUNIT_EXPECT_EQ(test, true, __same_type(t2, __t2l)); \
  869. KUNIT_EXPECT_EQ(test, true, __same_type(__t2h, t2)); \
  870. KUNIT_EXPECT_EQ(test, true, __same_type(__t2l, t2)); \
  871. KUNIT_EXPECT_EQ(test, same, __same_type(t1, t2)); \
  872. KUNIT_EXPECT_EQ(test, same, __same_type(t2, __t1h)); \
  873. KUNIT_EXPECT_EQ(test, same, __same_type(t2, __t1l)); \
  874. KUNIT_EXPECT_EQ(test, same, __same_type(__t1h, t2)); \
  875. KUNIT_EXPECT_EQ(test, same, __same_type(__t1l, t2)); \
  876. KUNIT_EXPECT_EQ(test, same, __same_type(t1, __t2h)); \
  877. KUNIT_EXPECT_EQ(test, same, __same_type(t1, __t2l)); \
  878. KUNIT_EXPECT_EQ(test, same, __same_type(__t2h, t1)); \
  879. KUNIT_EXPECT_EQ(test, same, __same_type(__t2l, t1)); \
  880. } while (0)
  881. #if BITS_PER_LONG == 64
  882. # define TEST_SAME_TYPE64(base, t, m) TEST_SAME_TYPE(base, t, m)
  883. #else
  884. # define TEST_SAME_TYPE64(base, t, m) do { } while (0)
  885. #endif
  886. #define TEST_TYPE_SETS(base, mu8, mu16, mu32, ms8, ms16, ms32, mu64, ms64) \
  887. do { \
  888. TEST_SAME_TYPE(base, u8, mu8); \
  889. TEST_SAME_TYPE(base, u16, mu16); \
  890. TEST_SAME_TYPE(base, u32, mu32); \
  891. TEST_SAME_TYPE(base, s8, ms8); \
  892. TEST_SAME_TYPE(base, s16, ms16); \
  893. TEST_SAME_TYPE(base, s32, ms32); \
  894. TEST_SAME_TYPE64(base, u64, mu64); \
  895. TEST_SAME_TYPE64(base, s64, ms64); \
  896. } while (0)
  897. TEST_TYPE_SETS(u8, true, false, false, false, false, false, false, false);
  898. TEST_TYPE_SETS(u16, false, true, false, false, false, false, false, false);
  899. TEST_TYPE_SETS(u32, false, false, true, false, false, false, false, false);
  900. TEST_TYPE_SETS(s8, false, false, false, true, false, false, false, false);
  901. TEST_TYPE_SETS(s16, false, false, false, false, true, false, false, false);
  902. TEST_TYPE_SETS(s32, false, false, false, false, false, true, false, false);
  903. #if BITS_PER_LONG == 64
  904. TEST_TYPE_SETS(u64, false, false, false, false, false, false, true, false);
  905. TEST_TYPE_SETS(s64, false, false, false, false, false, false, false, true);
  906. #endif
  907. /* Check for macro side-effects. */
  908. var = 4;
  909. KUNIT_EXPECT_EQ(test, var, 4);
  910. KUNIT_EXPECT_TRUE(test, __same_type(var++, int));
  911. KUNIT_EXPECT_EQ(test, var, 4);
  912. KUNIT_EXPECT_TRUE(test, __same_type(int, var++));
  913. KUNIT_EXPECT_EQ(test, var, 4);
  914. KUNIT_EXPECT_TRUE(test, __same_type(var++, var++));
  915. KUNIT_EXPECT_EQ(test, var, 4);
  916. kunit_info(test, "%d __same_type() tests finished\n", count);
  917. #undef TEST_TYPE_SETS
  918. #undef TEST_SAME_TYPE64
  919. #undef TEST_SAME_TYPE
  920. }
  921. static void castable_to_type_test(struct kunit *test)
  922. {
  923. int count = 0;
  924. #define TEST_CASTABLE_TO_TYPE(arg1, arg2, pass) do { \
  925. bool __pass = castable_to_type(arg1, arg2); \
  926. KUNIT_EXPECT_EQ_MSG(test, __pass, pass, \
  927. "expected castable_to_type(" #arg1 ", " #arg2 ") to%s pass\n",\
  928. pass ? "" : " not"); \
  929. count++; \
  930. } while (0)
  931. TEST_CASTABLE_TO_TYPE(16, u8, true);
  932. TEST_CASTABLE_TO_TYPE(16, u16, true);
  933. TEST_CASTABLE_TO_TYPE(16, u32, true);
  934. TEST_CASTABLE_TO_TYPE(16, s8, true);
  935. TEST_CASTABLE_TO_TYPE(16, s16, true);
  936. TEST_CASTABLE_TO_TYPE(16, s32, true);
  937. TEST_CASTABLE_TO_TYPE(-16, s8, true);
  938. TEST_CASTABLE_TO_TYPE(-16, s16, true);
  939. TEST_CASTABLE_TO_TYPE(-16, s32, true);
  940. #if BITS_PER_LONG == 64
  941. TEST_CASTABLE_TO_TYPE(16, u64, true);
  942. TEST_CASTABLE_TO_TYPE(-16, s64, true);
  943. #endif
  944. #define TEST_CASTABLE_TO_TYPE_VAR(width) do { \
  945. u ## width u ## width ## var = 0; \
  946. s ## width s ## width ## var = 0; \
  947. \
  948. /* Constant expressions that fit types. */ \
  949. TEST_CASTABLE_TO_TYPE(type_max(u ## width), u ## width, true); \
  950. TEST_CASTABLE_TO_TYPE(type_min(u ## width), u ## width, true); \
  951. TEST_CASTABLE_TO_TYPE(type_max(u ## width), u ## width ## var, true); \
  952. TEST_CASTABLE_TO_TYPE(type_min(u ## width), u ## width ## var, true); \
  953. TEST_CASTABLE_TO_TYPE(type_max(s ## width), s ## width, true); \
  954. TEST_CASTABLE_TO_TYPE(type_min(s ## width), s ## width, true); \
  955. TEST_CASTABLE_TO_TYPE(type_max(s ## width), s ## width ## var, true); \
  956. TEST_CASTABLE_TO_TYPE(type_min(u ## width), s ## width ## var, true); \
  957. /* Constant expressions that do not fit types. */ \
  958. TEST_CASTABLE_TO_TYPE(type_max(u ## width), s ## width, false); \
  959. TEST_CASTABLE_TO_TYPE(type_max(u ## width), s ## width ## var, false); \
  960. TEST_CASTABLE_TO_TYPE(type_min(s ## width), u ## width, false); \
  961. TEST_CASTABLE_TO_TYPE(type_min(s ## width), u ## width ## var, false); \
  962. /* Non-constant expression with mismatched type. */ \
  963. TEST_CASTABLE_TO_TYPE(s ## width ## var, u ## width, false); \
  964. TEST_CASTABLE_TO_TYPE(u ## width ## var, s ## width, false); \
  965. } while (0)
  966. #define TEST_CASTABLE_TO_TYPE_RANGE(width) do { \
  967. unsigned long big = U ## width ## _MAX; \
  968. signed long small = S ## width ## _MIN; \
  969. u ## width u ## width ## var = 0; \
  970. s ## width s ## width ## var = 0; \
  971. \
  972. /* Constant expression in range. */ \
  973. TEST_CASTABLE_TO_TYPE(U ## width ## _MAX, u ## width, true); \
  974. TEST_CASTABLE_TO_TYPE(U ## width ## _MAX, u ## width ## var, true); \
  975. TEST_CASTABLE_TO_TYPE(S ## width ## _MIN, s ## width, true); \
  976. TEST_CASTABLE_TO_TYPE(S ## width ## _MIN, s ## width ## var, true); \
  977. /* Constant expression out of range. */ \
  978. TEST_CASTABLE_TO_TYPE((unsigned long)U ## width ## _MAX + 1, u ## width, false); \
  979. TEST_CASTABLE_TO_TYPE((unsigned long)U ## width ## _MAX + 1, u ## width ## var, false); \
  980. TEST_CASTABLE_TO_TYPE((signed long)S ## width ## _MIN - 1, s ## width, false); \
  981. TEST_CASTABLE_TO_TYPE((signed long)S ## width ## _MIN - 1, s ## width ## var, false); \
  982. /* Non-constant expression with mismatched type. */ \
  983. TEST_CASTABLE_TO_TYPE(big, u ## width, false); \
  984. TEST_CASTABLE_TO_TYPE(big, u ## width ## var, false); \
  985. TEST_CASTABLE_TO_TYPE(small, s ## width, false); \
  986. TEST_CASTABLE_TO_TYPE(small, s ## width ## var, false); \
  987. } while (0)
  988. TEST_CASTABLE_TO_TYPE_VAR(8);
  989. TEST_CASTABLE_TO_TYPE_VAR(16);
  990. TEST_CASTABLE_TO_TYPE_VAR(32);
  991. #if BITS_PER_LONG == 64
  992. TEST_CASTABLE_TO_TYPE_VAR(64);
  993. #endif
  994. TEST_CASTABLE_TO_TYPE_RANGE(8);
  995. TEST_CASTABLE_TO_TYPE_RANGE(16);
  996. #if BITS_PER_LONG == 64
  997. TEST_CASTABLE_TO_TYPE_RANGE(32);
  998. #endif
  999. kunit_info(test, "%d castable_to_type() tests finished\n", count);
  1000. #undef TEST_CASTABLE_TO_TYPE_RANGE
  1001. #undef TEST_CASTABLE_TO_TYPE_VAR
  1002. #undef TEST_CASTABLE_TO_TYPE
  1003. }
  1004. static struct kunit_case overflow_test_cases[] = {
  1005. KUNIT_CASE(u8_u8__u8_overflow_test),
  1006. KUNIT_CASE(s8_s8__s8_overflow_test),
  1007. KUNIT_CASE(u16_u16__u16_overflow_test),
  1008. KUNIT_CASE(s16_s16__s16_overflow_test),
  1009. KUNIT_CASE(u32_u32__u32_overflow_test),
  1010. KUNIT_CASE(s32_s32__s32_overflow_test),
  1011. KUNIT_CASE(u64_u64__u64_overflow_test),
  1012. KUNIT_CASE(s64_s64__s64_overflow_test),
  1013. KUNIT_CASE(u32_u32__int_overflow_test),
  1014. KUNIT_CASE(u32_u32__u8_overflow_test),
  1015. KUNIT_CASE(u8_u8__int_overflow_test),
  1016. KUNIT_CASE(int_int__u8_overflow_test),
  1017. KUNIT_CASE(shift_sane_test),
  1018. KUNIT_CASE(shift_overflow_test),
  1019. KUNIT_CASE(shift_truncate_test),
  1020. KUNIT_CASE(shift_nonsense_test),
  1021. KUNIT_CASE(overflow_allocation_test),
  1022. KUNIT_CASE(overflow_size_helpers_test),
  1023. KUNIT_CASE(overflows_type_test),
  1024. KUNIT_CASE(same_type_test),
  1025. KUNIT_CASE(castable_to_type_test),
  1026. {}
  1027. };
  1028. static struct kunit_suite overflow_test_suite = {
  1029. .name = "overflow",
  1030. .test_cases = overflow_test_cases,
  1031. };
  1032. kunit_test_suite(overflow_test_suite);
  1033. MODULE_LICENSE("Dual MIT/GPL");