counter.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (C) 2015-2019 Jason A. Donenfeld <[email protected]>. All Rights Reserved.
  4. */
  5. #ifdef DEBUG
  6. bool __init wg_packet_counter_selftest(void)
  7. {
  8. struct noise_replay_counter *counter;
  9. unsigned int test_num = 0, i;
  10. bool success = true;
  11. counter = kmalloc(sizeof(*counter), GFP_KERNEL);
  12. if (unlikely(!counter)) {
  13. pr_err("nonce counter self-test malloc: FAIL\n");
  14. return false;
  15. }
  16. #define T_INIT do { \
  17. memset(counter, 0, sizeof(*counter)); \
  18. spin_lock_init(&counter->lock); \
  19. } while (0)
  20. #define T_LIM (COUNTER_WINDOW_SIZE + 1)
  21. #define T(n, v) do { \
  22. ++test_num; \
  23. if (counter_validate(counter, n) != (v)) { \
  24. pr_err("nonce counter self-test %u: FAIL\n", \
  25. test_num); \
  26. success = false; \
  27. } \
  28. } while (0)
  29. T_INIT;
  30. /* 1 */ T(0, true);
  31. /* 2 */ T(1, true);
  32. /* 3 */ T(1, false);
  33. /* 4 */ T(9, true);
  34. /* 5 */ T(8, true);
  35. /* 6 */ T(7, true);
  36. /* 7 */ T(7, false);
  37. /* 8 */ T(T_LIM, true);
  38. /* 9 */ T(T_LIM - 1, true);
  39. /* 10 */ T(T_LIM - 1, false);
  40. /* 11 */ T(T_LIM - 2, true);
  41. /* 12 */ T(2, true);
  42. /* 13 */ T(2, false);
  43. /* 14 */ T(T_LIM + 16, true);
  44. /* 15 */ T(3, false);
  45. /* 16 */ T(T_LIM + 16, false);
  46. /* 17 */ T(T_LIM * 4, true);
  47. /* 18 */ T(T_LIM * 4 - (T_LIM - 1), true);
  48. /* 19 */ T(10, false);
  49. /* 20 */ T(T_LIM * 4 - T_LIM, false);
  50. /* 21 */ T(T_LIM * 4 - (T_LIM + 1), false);
  51. /* 22 */ T(T_LIM * 4 - (T_LIM - 2), true);
  52. /* 23 */ T(T_LIM * 4 + 1 - T_LIM, false);
  53. /* 24 */ T(0, false);
  54. /* 25 */ T(REJECT_AFTER_MESSAGES, false);
  55. /* 26 */ T(REJECT_AFTER_MESSAGES - 1, true);
  56. /* 27 */ T(REJECT_AFTER_MESSAGES, false);
  57. /* 28 */ T(REJECT_AFTER_MESSAGES - 1, false);
  58. /* 29 */ T(REJECT_AFTER_MESSAGES - 2, true);
  59. /* 30 */ T(REJECT_AFTER_MESSAGES + 1, false);
  60. /* 31 */ T(REJECT_AFTER_MESSAGES + 2, false);
  61. /* 32 */ T(REJECT_AFTER_MESSAGES - 2, false);
  62. /* 33 */ T(REJECT_AFTER_MESSAGES - 3, true);
  63. /* 34 */ T(0, false);
  64. T_INIT;
  65. for (i = 1; i <= COUNTER_WINDOW_SIZE; ++i)
  66. T(i, true);
  67. T(0, true);
  68. T(0, false);
  69. T_INIT;
  70. for (i = 2; i <= COUNTER_WINDOW_SIZE + 1; ++i)
  71. T(i, true);
  72. T(1, true);
  73. T(0, false);
  74. T_INIT;
  75. for (i = COUNTER_WINDOW_SIZE + 1; i-- > 0;)
  76. T(i, true);
  77. T_INIT;
  78. for (i = COUNTER_WINDOW_SIZE + 2; i-- > 1;)
  79. T(i, true);
  80. T(0, false);
  81. T_INIT;
  82. for (i = COUNTER_WINDOW_SIZE + 1; i-- > 1;)
  83. T(i, true);
  84. T(COUNTER_WINDOW_SIZE + 1, true);
  85. T(0, false);
  86. T_INIT;
  87. for (i = COUNTER_WINDOW_SIZE + 1; i-- > 1;)
  88. T(i, true);
  89. T(0, true);
  90. T(COUNTER_WINDOW_SIZE + 1, true);
  91. #undef T
  92. #undef T_LIM
  93. #undef T_INIT
  94. if (success)
  95. pr_info("nonce counter self-tests: pass\n");
  96. kfree(counter);
  97. return success;
  98. }
  99. #endif