test_klp_shadow_vars.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301
  1. // SPDX-License-Identifier: GPL-2.0
  2. // Copyright (C) 2018 Joe Lawrence <[email protected]>
  3. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  4. #include <linux/module.h>
  5. #include <linux/kernel.h>
  6. #include <linux/list.h>
  7. #include <linux/livepatch.h>
  8. #include <linux/slab.h>
  9. /*
  10. * Keep a small list of pointers so that we can print address-agnostic
  11. * pointer values. Use a rolling integer count to differentiate the values.
  12. * Ironically we could have used the shadow variable API to do this, but
  13. * let's not lean too heavily on the very code we're testing.
  14. */
  15. static LIST_HEAD(ptr_list);
  16. struct shadow_ptr {
  17. void *ptr;
  18. int id;
  19. struct list_head list;
  20. };
  21. static void free_ptr_list(void)
  22. {
  23. struct shadow_ptr *sp, *tmp_sp;
  24. list_for_each_entry_safe(sp, tmp_sp, &ptr_list, list) {
  25. list_del(&sp->list);
  26. kfree(sp);
  27. }
  28. }
  29. static int ptr_id(void *ptr)
  30. {
  31. struct shadow_ptr *sp;
  32. static int count;
  33. list_for_each_entry(sp, &ptr_list, list) {
  34. if (sp->ptr == ptr)
  35. return sp->id;
  36. }
  37. sp = kmalloc(sizeof(*sp), GFP_ATOMIC);
  38. if (!sp)
  39. return -ENOMEM;
  40. sp->ptr = ptr;
  41. sp->id = count++;
  42. list_add(&sp->list, &ptr_list);
  43. return sp->id;
  44. }
  45. /*
  46. * Shadow variable wrapper functions that echo the function and arguments
  47. * to the kernel log for testing verification. Don't display raw pointers,
  48. * but use the ptr_id() value instead.
  49. */
  50. static void *shadow_get(void *obj, unsigned long id)
  51. {
  52. int **sv;
  53. sv = klp_shadow_get(obj, id);
  54. pr_info("klp_%s(obj=PTR%d, id=0x%lx) = PTR%d\n",
  55. __func__, ptr_id(obj), id, ptr_id(sv));
  56. return sv;
  57. }
  58. static void *shadow_alloc(void *obj, unsigned long id, size_t size,
  59. gfp_t gfp_flags, klp_shadow_ctor_t ctor,
  60. void *ctor_data)
  61. {
  62. int **var = ctor_data;
  63. int **sv;
  64. sv = klp_shadow_alloc(obj, id, size, gfp_flags, ctor, var);
  65. pr_info("klp_%s(obj=PTR%d, id=0x%lx, size=%zx, gfp_flags=%pGg), ctor=PTR%d, ctor_data=PTR%d = PTR%d\n",
  66. __func__, ptr_id(obj), id, size, &gfp_flags, ptr_id(ctor),
  67. ptr_id(*var), ptr_id(sv));
  68. return sv;
  69. }
  70. static void *shadow_get_or_alloc(void *obj, unsigned long id, size_t size,
  71. gfp_t gfp_flags, klp_shadow_ctor_t ctor,
  72. void *ctor_data)
  73. {
  74. int **var = ctor_data;
  75. int **sv;
  76. sv = klp_shadow_get_or_alloc(obj, id, size, gfp_flags, ctor, var);
  77. pr_info("klp_%s(obj=PTR%d, id=0x%lx, size=%zx, gfp_flags=%pGg), ctor=PTR%d, ctor_data=PTR%d = PTR%d\n",
  78. __func__, ptr_id(obj), id, size, &gfp_flags, ptr_id(ctor),
  79. ptr_id(*var), ptr_id(sv));
  80. return sv;
  81. }
  82. static void shadow_free(void *obj, unsigned long id, klp_shadow_dtor_t dtor)
  83. {
  84. klp_shadow_free(obj, id, dtor);
  85. pr_info("klp_%s(obj=PTR%d, id=0x%lx, dtor=PTR%d)\n",
  86. __func__, ptr_id(obj), id, ptr_id(dtor));
  87. }
  88. static void shadow_free_all(unsigned long id, klp_shadow_dtor_t dtor)
  89. {
  90. klp_shadow_free_all(id, dtor);
  91. pr_info("klp_%s(id=0x%lx, dtor=PTR%d)\n", __func__, id, ptr_id(dtor));
  92. }
  93. /* Shadow variable constructor - remember simple pointer data */
  94. static int shadow_ctor(void *obj, void *shadow_data, void *ctor_data)
  95. {
  96. int **sv = shadow_data;
  97. int **var = ctor_data;
  98. if (!var)
  99. return -EINVAL;
  100. *sv = *var;
  101. pr_info("%s: PTR%d -> PTR%d\n", __func__, ptr_id(sv), ptr_id(*var));
  102. return 0;
  103. }
  104. /*
  105. * With more than one item to free in the list, order is not determined and
  106. * shadow_dtor will not be passed to shadow_free_all() which would make the
  107. * test fail. (see pass 6)
  108. */
  109. static void shadow_dtor(void *obj, void *shadow_data)
  110. {
  111. int **sv = shadow_data;
  112. pr_info("%s(obj=PTR%d, shadow_data=PTR%d)\n",
  113. __func__, ptr_id(obj), ptr_id(sv));
  114. }
  115. /* number of objects we simulate that need shadow vars */
  116. #define NUM_OBJS 3
  117. /* dynamically created obj fields have the following shadow var id values */
  118. #define SV_ID1 0x1234
  119. #define SV_ID2 0x1235
  120. /*
  121. * The main test case adds/removes new fields (shadow var) to each of these
  122. * test structure instances. The last group of fields in the struct represent
  123. * the idea that shadow variables may be added and removed to and from the
  124. * struct during execution.
  125. */
  126. struct test_object {
  127. /* add anything here below and avoid to define an empty struct */
  128. struct shadow_ptr sp;
  129. /* these represent shadow vars added and removed with SV_ID{1,2} */
  130. /* char nfield1; */
  131. /* int nfield2; */
  132. };
  133. static int test_klp_shadow_vars_init(void)
  134. {
  135. struct test_object objs[NUM_OBJS];
  136. char nfields1[NUM_OBJS], *pnfields1[NUM_OBJS], **sv1[NUM_OBJS];
  137. char *pndup[NUM_OBJS];
  138. int nfields2[NUM_OBJS], *pnfields2[NUM_OBJS], **sv2[NUM_OBJS];
  139. void **sv;
  140. int ret;
  141. int i;
  142. ptr_id(NULL);
  143. /*
  144. * With an empty shadow variable hash table, expect not to find
  145. * any matches.
  146. */
  147. sv = shadow_get(&objs[0], SV_ID1);
  148. if (!sv)
  149. pr_info(" got expected NULL result\n");
  150. /* pass 1: init & alloc a char+int pair of svars for each objs */
  151. for (i = 0; i < NUM_OBJS; i++) {
  152. pnfields1[i] = &nfields1[i];
  153. ptr_id(pnfields1[i]);
  154. if (i % 2) {
  155. sv1[i] = shadow_alloc(&objs[i], SV_ID1,
  156. sizeof(pnfields1[i]), GFP_KERNEL,
  157. shadow_ctor, &pnfields1[i]);
  158. } else {
  159. sv1[i] = shadow_get_or_alloc(&objs[i], SV_ID1,
  160. sizeof(pnfields1[i]), GFP_KERNEL,
  161. shadow_ctor, &pnfields1[i]);
  162. }
  163. if (!sv1[i]) {
  164. ret = -ENOMEM;
  165. goto out;
  166. }
  167. pnfields2[i] = &nfields2[i];
  168. ptr_id(pnfields2[i]);
  169. sv2[i] = shadow_alloc(&objs[i], SV_ID2, sizeof(pnfields2[i]),
  170. GFP_KERNEL, shadow_ctor, &pnfields2[i]);
  171. if (!sv2[i]) {
  172. ret = -ENOMEM;
  173. goto out;
  174. }
  175. }
  176. /* pass 2: verify we find allocated svars and where they point to */
  177. for (i = 0; i < NUM_OBJS; i++) {
  178. /* check the "char" svar for all objects */
  179. sv = shadow_get(&objs[i], SV_ID1);
  180. if (!sv) {
  181. ret = -EINVAL;
  182. goto out;
  183. }
  184. if ((char **)sv == sv1[i] && *sv1[i] == pnfields1[i])
  185. pr_info(" got expected PTR%d -> PTR%d result\n",
  186. ptr_id(sv1[i]), ptr_id(*sv1[i]));
  187. /* check the "int" svar for all objects */
  188. sv = shadow_get(&objs[i], SV_ID2);
  189. if (!sv) {
  190. ret = -EINVAL;
  191. goto out;
  192. }
  193. if ((int **)sv == sv2[i] && *sv2[i] == pnfields2[i])
  194. pr_info(" got expected PTR%d -> PTR%d result\n",
  195. ptr_id(sv2[i]), ptr_id(*sv2[i]));
  196. }
  197. /* pass 3: verify that 'get_or_alloc' returns already allocated svars */
  198. for (i = 0; i < NUM_OBJS; i++) {
  199. pndup[i] = &nfields1[i];
  200. ptr_id(pndup[i]);
  201. sv = shadow_get_or_alloc(&objs[i], SV_ID1, sizeof(pndup[i]),
  202. GFP_KERNEL, shadow_ctor, &pndup[i]);
  203. if (!sv) {
  204. ret = -EINVAL;
  205. goto out;
  206. }
  207. if ((char **)sv == sv1[i] && *sv1[i] == pnfields1[i])
  208. pr_info(" got expected PTR%d -> PTR%d result\n",
  209. ptr_id(sv1[i]), ptr_id(*sv1[i]));
  210. }
  211. /* pass 4: free <objs[*], SV_ID1> pairs of svars, verify removal */
  212. for (i = 0; i < NUM_OBJS; i++) {
  213. shadow_free(&objs[i], SV_ID1, shadow_dtor); /* 'char' pairs */
  214. sv = shadow_get(&objs[i], SV_ID1);
  215. if (!sv)
  216. pr_info(" got expected NULL result\n");
  217. }
  218. /* pass 5: check we still find <objs[*], SV_ID2> svar pairs */
  219. for (i = 0; i < NUM_OBJS; i++) {
  220. sv = shadow_get(&objs[i], SV_ID2); /* 'int' pairs */
  221. if (!sv) {
  222. ret = -EINVAL;
  223. goto out;
  224. }
  225. if ((int **)sv == sv2[i] && *sv2[i] == pnfields2[i])
  226. pr_info(" got expected PTR%d -> PTR%d result\n",
  227. ptr_id(sv2[i]), ptr_id(*sv2[i]));
  228. }
  229. /* pass 6: free all the <objs[*], SV_ID2> svar pairs too. */
  230. shadow_free_all(SV_ID2, NULL); /* 'int' pairs */
  231. for (i = 0; i < NUM_OBJS; i++) {
  232. sv = shadow_get(&objs[i], SV_ID2);
  233. if (!sv)
  234. pr_info(" got expected NULL result\n");
  235. }
  236. free_ptr_list();
  237. return 0;
  238. out:
  239. shadow_free_all(SV_ID1, NULL); /* 'char' pairs */
  240. shadow_free_all(SV_ID2, NULL); /* 'int' pairs */
  241. free_ptr_list();
  242. return ret;
  243. }
  244. static void test_klp_shadow_vars_exit(void)
  245. {
  246. }
  247. module_init(test_klp_shadow_vars_init);
  248. module_exit(test_klp_shadow_vars_exit);
  249. MODULE_LICENSE("GPL");
  250. MODULE_AUTHOR("Joe Lawrence <[email protected]>");
  251. MODULE_DESCRIPTION("Livepatch test: shadow variables");