test_nx.c 4.5 KB

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