2 * self test for change_page_attr.
4 * Clears the a test pte bit on random pages in the direct mapping,
5 * then reverts and compares page tables forwards and afterwards.
7 #include <linux/bootmem.h>
8 #include <linux/kthread.h>
9 #include <linux/random.h>
10 #include <linux/kernel.h>
11 #include <linux/init.h>
14 #include <asm/cacheflush.h>
15 #include <asm/pgtable.h>
16 #include <asm/kdebug.h>
19 * Only print the results of the first pass:
21 static __read_mostly int print = 1;
26 LPS = (1 << PMD_SHIFT),
27 #elif defined(CONFIG_X86_PAE)
28 LPS = (1 << PMD_SHIFT),
35 #define PAGE_TESTBIT __pgprot(_PAGE_UNUSED1)
37 static int pte_testbit(pte_t pte)
39 return pte_flags(pte) & _PAGE_UNUSED1;
43 long lpg, gpg, spg, exec;
44 long min_exec, max_exec;
47 static int print_split(struct split_state *s)
49 long i, expected, missed = 0;
52 s->lpg = s->gpg = s->spg = s->exec = 0;
55 for (i = 0; i < max_pfn_mapped; ) {
56 unsigned long addr = (unsigned long)__va(i << PAGE_SHIFT);
60 pte = lookup_address(addr, &level);
67 if (level == PG_LEVEL_1G && sizeof(long) == 8) {
70 } else if (level == PG_LEVEL_2M) {
71 if (!(pte_val(*pte) & _PAGE_PSE)) {
73 "%lx level %d but not PSE %Lx\n",
74 addr, level, (u64)pte_val(*pte));
83 if (!(pte_val(*pte) & _PAGE_NX)) {
85 if (addr < s->min_exec)
87 if (addr > s->max_exec)
93 " 4k %lu large %lu gb %lu x %lu[%lx-%lx] miss %lu\n",
94 s->spg, s->lpg, s->gpg, s->exec,
95 s->min_exec != ~0UL ? s->min_exec : 0,
99 expected = (s->gpg*GPS + s->lpg*LPS)/PAGE_SIZE + s->spg + missed;
101 printk(KERN_ERR "CPA max_pfn_mapped %lu but expected %lu\n",
102 max_pfn_mapped, expected);
108 static unsigned long addr[NTEST];
109 static unsigned int len[NTEST];
111 /* Change the global bit on random pages in the direct mapping */
112 static int pageattr_test(void)
114 struct split_state sa, sb, sc;
123 printk(KERN_INFO "CPA self-test:\n");
125 bm = vmalloc((max_pfn_mapped + 7) / 8);
127 printk(KERN_ERR "CPA Cannot vmalloc bitmap\n");
130 memset(bm, 0, (max_pfn_mapped + 7) / 8);
132 failed += print_split(&sa);
135 for (i = 0; i < NTEST; i++) {
136 unsigned long pfn = random32() % max_pfn_mapped;
138 addr[i] = (unsigned long)__va(pfn << PAGE_SHIFT);
139 len[i] = random32() % 100;
140 len[i] = min_t(unsigned long, len[i], max_pfn_mapped - pfn - 1);
146 pte0 = pfn_pte(0, __pgprot(0)); /* shut gcc up */
148 for (k = 0; k < len[i]; k++) {
149 pte = lookup_address(addr[i] + k*PAGE_SIZE, &level);
150 if (!pte || pgprot_val(pte_pgprot(*pte)) == 0 ||
151 !(pte_val(*pte) & _PAGE_PRESENT)) {
158 if (pgprot_val(pte_pgprot(*pte)) !=
159 pgprot_val(pte_pgprot(pte0))) {
164 if (test_bit(pfn + k, bm)) {
168 __set_bit(pfn + k, bm);
170 if (!addr[i] || !pte || !k) {
175 err = change_page_attr_set(addr[i], len[i], PAGE_TESTBIT);
177 printk(KERN_ERR "CPA %d failed %d\n", i, err);
181 pte = lookup_address(addr[i], &level);
182 if (!pte || !pte_testbit(*pte) || pte_huge(*pte)) {
183 printk(KERN_ERR "CPA %lx: bad pte %Lx\n", addr[i],
184 pte ? (u64)pte_val(*pte) : 0ULL);
187 if (level != PG_LEVEL_4K) {
188 printk(KERN_ERR "CPA %lx: unexpected level %d\n",
196 failed += print_split(&sb);
198 for (i = 0; i < NTEST; i++) {
201 pte = lookup_address(addr[i], &level);
203 printk(KERN_ERR "CPA lookup of %lx failed\n", addr[i]);
207 err = change_page_attr_clear(addr[i], len[i], PAGE_TESTBIT);
209 printk(KERN_ERR "CPA reverting failed: %d\n", err);
212 pte = lookup_address(addr[i], &level);
213 if (!pte || pte_testbit(*pte)) {
214 printk(KERN_ERR "CPA %lx: bad pte after revert %Lx\n",
215 addr[i], pte ? (u64)pte_val(*pte) : 0ULL);
221 failed += print_split(&sc);
224 printk(KERN_ERR "NOT PASSED. Please report.\n");
229 printk(KERN_INFO "ok.\n");
235 static int do_pageattr_test(void *__unused)
237 while (!kthread_should_stop()) {
238 schedule_timeout_interruptible(HZ*30);
239 if (pageattr_test() < 0)
247 static int start_pageattr_test(void)
249 struct task_struct *p;
251 p = kthread_create(do_pageattr_test, NULL, "pageattr-test");
260 module_init(start_pageattr_test);