blob: 91e05a26004d16b967f06af732f7e6a4871d22f2 [file] [log] [blame]
Andi Kleenfa2d8362008-01-30 13:33:43 +01001/*
2 * self test for change_page_attr.
3 *
4 * Clears the global bit on random pages in the direct mapping, then reverts
5 * and compares page tables forwards and afterwards.
6 */
Ingo Molnar851339b2008-01-30 13:33:43 +01007#include <linux/bootmem.h>
Andi Kleenfa2d8362008-01-30 13:33:43 +01008#include <linux/random.h>
9#include <linux/kernel.h>
10#include <linux/init.h>
Ingo Molnar851339b2008-01-30 13:33:43 +010011#include <linux/mm.h>
12
Andi Kleenfa2d8362008-01-30 13:33:43 +010013#include <asm/cacheflush.h>
14#include <asm/pgtable.h>
15#include <asm/kdebug.h>
16
17enum {
Ingo Molnar851339b2008-01-30 13:33:43 +010018 NTEST = 400,
Andi Kleenfa2d8362008-01-30 13:33:43 +010019#ifdef CONFIG_X86_64
Ingo Molnar851339b2008-01-30 13:33:43 +010020 LOWEST_LEVEL = 4,
21 LPS = (1 << PMD_SHIFT),
Andi Kleenfa2d8362008-01-30 13:33:43 +010022#elif defined(CONFIG_X86_PAE)
Ingo Molnar851339b2008-01-30 13:33:43 +010023 LOWEST_LEVEL = 3,
24 LPS = (1 << PMD_SHIFT),
Andi Kleenfa2d8362008-01-30 13:33:43 +010025#else
Ingo Molnar851339b2008-01-30 13:33:43 +010026 LOWEST_LEVEL = 3, /* lookup_address lies here */
27 LPS = (1 << 22),
Andi Kleenfa2d8362008-01-30 13:33:43 +010028#endif
Ingo Molnar851339b2008-01-30 13:33:43 +010029 GPS = (1<<30)
Andi Kleenfa2d8362008-01-30 13:33:43 +010030};
31
32#ifdef CONFIG_X86_64
Ingo Molnar851339b2008-01-30 13:33:43 +010033# include <asm/proto.h>
34# define max_mapped end_pfn_map
Andi Kleenfa2d8362008-01-30 13:33:43 +010035#else
Ingo Molnar851339b2008-01-30 13:33:43 +010036# define max_mapped max_low_pfn
Andi Kleenfa2d8362008-01-30 13:33:43 +010037#endif
38
39struct split_state {
40 long lpg, gpg, spg, exec;
41 long min_exec, max_exec;
42};
43
44static __init int print_split(struct split_state *s)
45{
Andi Kleenfa2d8362008-01-30 13:33:43 +010046 long i, expected, missed = 0;
Ingo Molnar851339b2008-01-30 13:33:43 +010047 int printed = 0;
Andi Kleenfa2d8362008-01-30 13:33:43 +010048 int err = 0;
49
50 s->lpg = s->gpg = s->spg = s->exec = 0;
51 s->min_exec = ~0UL;
52 s->max_exec = 0;
53 for (i = 0; i < max_mapped; ) {
Ingo Molnar851339b2008-01-30 13:33:43 +010054 unsigned long addr = (unsigned long)__va(i << PAGE_SHIFT);
Andi Kleenfa2d8362008-01-30 13:33:43 +010055 int level;
56 pte_t *pte;
Andi Kleenfa2d8362008-01-30 13:33:43 +010057
Ingo Molnar851339b2008-01-30 13:33:43 +010058 pte = lookup_address(addr, &level);
Andi Kleenfa2d8362008-01-30 13:33:43 +010059 if (!pte) {
60 if (!printed) {
Ingo Molnar851339b2008-01-30 13:33:43 +010061 dump_pagetable(addr);
62 printk(KERN_INFO "CPA %lx no pte level %d\n",
63 addr, level);
Andi Kleenfa2d8362008-01-30 13:33:43 +010064 printed = 1;
65 }
66 missed++;
67 i++;
68 continue;
69 }
70
71 if (level == 2 && sizeof(long) == 8) {
72 s->gpg++;
73 i += GPS/PAGE_SIZE;
74 } else if (level != LOWEST_LEVEL) {
75 if (!(pte_val(*pte) & _PAGE_PSE)) {
Ingo Molnar851339b2008-01-30 13:33:43 +010076 printk(KERN_ERR
77 "%lx level %d but not PSE %Lx\n",
78 addr, level, (u64)pte_val(*pte));
Andi Kleenfa2d8362008-01-30 13:33:43 +010079 err = 1;
80 }
81 s->lpg++;
82 i += LPS/PAGE_SIZE;
83 } else {
84 s->spg++;
85 i++;
86 }
87 if (!(pte_val(*pte) & _PAGE_NX)) {
88 s->exec++;
Ingo Molnar851339b2008-01-30 13:33:43 +010089 if (addr < s->min_exec)
90 s->min_exec = addr;
91 if (addr > s->max_exec)
92 s->max_exec = addr;
Andi Kleenfa2d8362008-01-30 13:33:43 +010093 }
94 }
Ingo Molnar851339b2008-01-30 13:33:43 +010095 printk(KERN_INFO
96 "CPA mapping 4k %lu large %lu gb %lu x %lu[%lx-%lx] miss %lu\n",
Andi Kleenfa2d8362008-01-30 13:33:43 +010097 s->spg, s->lpg, s->gpg, s->exec,
98 s->min_exec != ~0UL ? s->min_exec : 0, s->max_exec, missed);
Ingo Molnar851339b2008-01-30 13:33:43 +010099
Andi Kleenfa2d8362008-01-30 13:33:43 +0100100 expected = (s->gpg*GPS + s->lpg*LPS)/PAGE_SIZE + s->spg + missed;
101 if (expected != i) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100102 printk(KERN_ERR "CPA max_mapped %lu but expected %lu\n",
Andi Kleenfa2d8362008-01-30 13:33:43 +0100103 max_mapped, expected);
104 return 1;
105 }
106 return err;
107}
108
109static __init int state_same(struct split_state *a, struct split_state *b)
110{
111 return a->lpg == b->lpg && a->gpg == b->gpg && a->spg == b->spg &&
Ingo Molnar851339b2008-01-30 13:33:43 +0100112 a->exec == b->exec;
Andi Kleenfa2d8362008-01-30 13:33:43 +0100113}
114
Ingo Molnar851339b2008-01-30 13:33:43 +0100115static unsigned long __initdata addr[NTEST];
116static unsigned int __initdata len[NTEST];
Andi Kleenfa2d8362008-01-30 13:33:43 +0100117
118/* Change the global bit on random pages in the direct mapping */
119static __init int exercise_pageattr(void)
120{
Andi Kleenfa2d8362008-01-30 13:33:43 +0100121 struct split_state sa, sb, sc;
Andi Kleenfa2d8362008-01-30 13:33:43 +0100122 unsigned long *bm;
Ingo Molnar851339b2008-01-30 13:33:43 +0100123 pte_t *pte, pte0;
124 int failed = 0;
125 int level;
126 int i, k;
127 int err;
Andi Kleenfa2d8362008-01-30 13:33:43 +0100128
Ingo Molnar851339b2008-01-30 13:33:43 +0100129 printk(KERN_INFO "CPA exercising pageattr\n");
Andi Kleenfa2d8362008-01-30 13:33:43 +0100130
131 bm = vmalloc((max_mapped + 7) / 8);
132 if (!bm) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100133 printk(KERN_ERR "CPA Cannot vmalloc bitmap\n");
Andi Kleenfa2d8362008-01-30 13:33:43 +0100134 return -ENOMEM;
135 }
136 memset(bm, 0, (max_mapped + 7) / 8);
137
138 failed += print_split(&sa);
139 srandom32(100);
Ingo Molnar851339b2008-01-30 13:33:43 +0100140
Andi Kleenfa2d8362008-01-30 13:33:43 +0100141 for (i = 0; i < NTEST; i++) {
142 unsigned long pfn = random32() % max_mapped;
Ingo Molnar851339b2008-01-30 13:33:43 +0100143
Andi Kleenfa2d8362008-01-30 13:33:43 +0100144 addr[i] = (unsigned long)__va(pfn << PAGE_SHIFT);
145 len[i] = random32() % 100;
146 len[i] = min_t(unsigned long, len[i], max_mapped - pfn - 1);
Ingo Molnar851339b2008-01-30 13:33:43 +0100147
Andi Kleenfa2d8362008-01-30 13:33:43 +0100148 if (len[i] == 0)
149 len[i] = 1;
150
151 pte = NULL;
152 pte0 = pfn_pte(0, __pgprot(0)); /* shut gcc up */
Ingo Molnar851339b2008-01-30 13:33:43 +0100153
Andi Kleenfa2d8362008-01-30 13:33:43 +0100154 for (k = 0; k < len[i]; k++) {
155 pte = lookup_address(addr[i] + k*PAGE_SIZE, &level);
156 if (!pte || pgprot_val(pte_pgprot(*pte)) == 0) {
157 addr[i] = 0;
158 break;
159 }
Ingo Molnar851339b2008-01-30 13:33:43 +0100160 if (k == 0) {
Andi Kleenfa2d8362008-01-30 13:33:43 +0100161 pte0 = *pte;
Ingo Molnar851339b2008-01-30 13:33:43 +0100162 } else {
163 if (pgprot_val(pte_pgprot(*pte)) !=
Andi Kleenfa2d8362008-01-30 13:33:43 +0100164 pgprot_val(pte_pgprot(pte0))) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100165 len[i] = k;
166 break;
167 }
Andi Kleenfa2d8362008-01-30 13:33:43 +0100168 }
169 if (test_bit(pfn + k, bm)) {
170 len[i] = k;
171 break;
172 }
173 __set_bit(pfn + k, bm);
174 }
175 if (!addr[i] || !pte || !k) {
176 addr[i] = 0;
177 continue;
178 }
179
Andi Kleen6ba9b7d2008-01-30 13:33:52 +0100180 err = change_page_attr_addr(addr[i], len[i],
Andi Kleenfa2d8362008-01-30 13:33:43 +0100181 pte_pgprot(pte_clrhuge(pte_clrglobal(pte0))));
182 if (err < 0) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100183 printk(KERN_ERR "CPA %d failed %d\n", i, err);
Andi Kleenfa2d8362008-01-30 13:33:43 +0100184 failed++;
185 }
186
187 pte = lookup_address(addr[i], &level);
188 if (!pte || pte_global(*pte) || pte_huge(*pte)) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100189 printk(KERN_ERR "CPA %lx: bad pte %Lx\n", addr[i],
Andi Kleenfa2d8362008-01-30 13:33:43 +0100190 pte ? (u64)pte_val(*pte) : 0ULL);
191 failed++;
192 }
193 if (level != LOWEST_LEVEL) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100194 printk(KERN_ERR "CPA %lx: unexpected level %d\n",
195 addr[i], level);
Andi Kleenfa2d8362008-01-30 13:33:43 +0100196 failed++;
197 }
198
199 }
200 vfree(bm);
201 global_flush_tlb();
202
203 failed += print_split(&sb);
204
Ingo Molnar851339b2008-01-30 13:33:43 +0100205 printk(KERN_INFO "CPA reverting everything\n");
Andi Kleenfa2d8362008-01-30 13:33:43 +0100206 for (i = 0; i < NTEST; i++) {
207 if (!addr[i])
208 continue;
209 pte = lookup_address(addr[i], &level);
210 if (!pte) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100211 printk(KERN_ERR "CPA lookup of %lx failed\n", addr[i]);
Andi Kleenfa2d8362008-01-30 13:33:43 +0100212 failed++;
213 continue;
214 }
Andi Kleen6ba9b7d2008-01-30 13:33:52 +0100215 err = change_page_attr_addr(addr[i], len[i],
Andi Kleenfa2d8362008-01-30 13:33:43 +0100216 pte_pgprot(pte_mkglobal(*pte)));
217 if (err < 0) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100218 printk(KERN_ERR "CPA reverting failed: %d\n", err);
Andi Kleenfa2d8362008-01-30 13:33:43 +0100219 failed++;
220 }
221 pte = lookup_address(addr[i], &level);
222 if (!pte || !pte_global(*pte)) {
Ingo Molnar851339b2008-01-30 13:33:43 +0100223 printk(KERN_ERR "CPA %lx: bad pte after revert %Lx\n",
224 addr[i], pte ? (u64)pte_val(*pte) : 0ULL);
Andi Kleenfa2d8362008-01-30 13:33:43 +0100225 failed++;
226 }
227
228 }
229 global_flush_tlb();
230
231 failed += print_split(&sc);
232 if (!state_same(&sa, &sc))
233 failed++;
234
235 if (failed)
Ingo Molnar851339b2008-01-30 13:33:43 +0100236 printk(KERN_ERR "CPA selftests NOT PASSED. Please report.\n");
Andi Kleenfa2d8362008-01-30 13:33:43 +0100237 else
Ingo Molnar851339b2008-01-30 13:33:43 +0100238 printk(KERN_INFO "CPA selftests PASSED\n");
Andi Kleenfa2d8362008-01-30 13:33:43 +0100239
240 return 0;
241}
Andi Kleenfa2d8362008-01-30 13:33:43 +0100242module_init(exercise_pageattr);