test_nx.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175
  1. /*
  2. * test_nx.c: functional test for NX functionality
  3. *
  4. * (C) Copyright 2008 Intel Corporation
  5. * Author: Arjan van de Ven <arjan@linux.intel.com>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; version 2
  10. * of the License.
  11. */
  12. #include <linux/module.h>
  13. #include <linux/sort.h>
  14. #include <linux/slab.h>
  15. #include <asm/uaccess.h>
  16. #include <asm/asm.h>
  17. extern int rodata_test_data;
  18. /*
  19. * This file checks 4 things:
  20. * 1) Check if the stack is not executable
  21. * 2) Check if kmalloc memory is not executable
  22. * 3) Check if the .rodata section is not executable
  23. * 4) Check if the .data section of a module is not executable
  24. *
  25. * To do this, the test code tries to execute memory in stack/kmalloc/etc,
  26. * and then checks if the expected trap happens.
  27. *
  28. * Sadly, this implies having a dynamic exception handling table entry.
  29. * ... which can be done (and will make Rusty cry)... but it can only
  30. * be done in a stand-alone module with only 1 entry total.
  31. * (otherwise we'd have to sort and that's just too messy)
  32. */
  33. /*
  34. * We want to set up an exception handling point on our stack,
  35. * which means a variable value. This function is rather dirty
  36. * and walks the exception table of the module, looking for a magic
  37. * marker and replaces it with a specific function.
  38. */
  39. static void fudze_exception_table(void *marker, void *new)
  40. {
  41. struct module *mod = THIS_MODULE;
  42. struct exception_table_entry *extable;
  43. /*
  44. * Note: This module has only 1 exception table entry,
  45. * so searching and sorting is not needed. If that changes,
  46. * this would be the place to search and re-sort the exception
  47. * table.
  48. */
  49. if (mod->num_exentries > 1) {
  50. printk(KERN_ERR "test_nx: too many exception table entries!\n");
  51. printk(KERN_ERR "test_nx: test results are not reliable.\n");
  52. return;
  53. }
  54. extable = (struct exception_table_entry *)mod->extable;
  55. extable[0].insn = (unsigned long)new;
  56. }
  57. /*
  58. * exception tables get their symbols translated so we need
  59. * to use a fake function to put in there, which we can then
  60. * replace at runtime.
  61. */
  62. void foo_label(void);
  63. /*
  64. * returns 0 for not-executable, negative for executable
  65. *
  66. * Note: we cannot allow this function to be inlined, because
  67. * that would give us more than 1 exception table entry.
  68. * This in turn would break the assumptions above.
  69. */
  70. static noinline int test_address(void *address)
  71. {
  72. unsigned long result;
  73. /* Set up an exception table entry for our address */
  74. fudze_exception_table(&foo_label, address);
  75. result = 1;
  76. asm volatile(
  77. "foo_label:\n"
  78. "0: call *%[fake_code]\n"
  79. "1:\n"
  80. ".section .fixup,\"ax\"\n"
  81. "2: mov %[zero], %[rslt]\n"
  82. " ret\n"
  83. ".previous\n"
  84. _ASM_EXTABLE(0b,2b)
  85. : [rslt] "=r" (result)
  86. : [fake_code] "r" (address), [zero] "r" (0UL), "0" (result)
  87. );
  88. /* change the exception table back for the next round */
  89. fudze_exception_table(address, &foo_label);
  90. if (result)
  91. return -ENODEV;
  92. return 0;
  93. }
  94. static unsigned char test_data = 0xC3; /* 0xC3 is the opcode for "ret" */
  95. static int test_NX(void)
  96. {
  97. int ret = 0;
  98. /* 0xC3 is the opcode for "ret" */
  99. char stackcode[] = {0xC3, 0x90, 0 };
  100. char *heap;
  101. test_data = 0xC3;
  102. printk(KERN_INFO "Testing NX protection\n");
  103. /* Test 1: check if the stack is not executable */
  104. if (test_address(&stackcode)) {
  105. printk(KERN_ERR "test_nx: stack was executable\n");
  106. ret = -ENODEV;
  107. }
  108. /* Test 2: Check if the heap is executable */
  109. heap = kmalloc(64, GFP_KERNEL);
  110. if (!heap)
  111. return -ENOMEM;
  112. heap[0] = 0xC3; /* opcode for "ret" */
  113. if (test_address(heap)) {
  114. printk(KERN_ERR "test_nx: heap was executable\n");
  115. ret = -ENODEV;
  116. }
  117. kfree(heap);
  118. /*
  119. * The following 2 tests currently fail, this needs to get fixed
  120. * Until then, don't run them to avoid too many people getting scared
  121. * by the error message
  122. */
  123. #ifdef CONFIG_DEBUG_RODATA
  124. /* Test 3: Check if the .rodata section is executable */
  125. if (rodata_test_data != 0xC3) {
  126. printk(KERN_ERR "test_nx: .rodata marker has invalid value\n");
  127. ret = -ENODEV;
  128. } else if (test_address(&rodata_test_data)) {
  129. printk(KERN_ERR "test_nx: .rodata section is executable\n");
  130. ret = -ENODEV;
  131. }
  132. #endif
  133. #if 0
  134. /* Test 4: Check if the .data section of a module is executable */
  135. if (test_address(&test_data)) {
  136. printk(KERN_ERR "test_nx: .data section is executable\n");
  137. ret = -ENODEV;
  138. }
  139. #endif
  140. return ret;
  141. }
  142. static void test_exit(void)
  143. {
  144. }
  145. module_init(test_NX);
  146. module_exit(test_exit);
  147. MODULE_LICENSE("GPL");
  148. MODULE_DESCRIPTION("Testcase for the NX infrastructure");
  149. MODULE_AUTHOR("Arjan van de Ven <arjan@linux.intel.com>");