kcore.c 14.9 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
L
Linus Torvalds 已提交
2 3 4 5 6 7 8 9 10 11 12
/*
 *	fs/proc/kcore.c kernel ELF core dumper
 *
 *	Modelled on fs/exec.c:aout_core_dump()
 *	Jeremy Fitzhardinge <jeremy@sw.oz.au>
 *	ELF version written by David Howells <David.Howells@nexor.co.uk>
 *	Modified and incorporated into 2.3.x by Tigran Aivazian <tigran@veritas.com>
 *	Support to dump vmalloc'd areas (ELF only), Tigran Aivazian <tigran@veritas.com>
 *	Safe accesses to vmalloc/direct-mapped discontiguous areas, Kanoj Sarcar <kanoj@sgi.com>
 */

13
#include <linux/crash_core.h>
L
Linus Torvalds 已提交
14 15
#include <linux/mm.h>
#include <linux/proc_fs.h>
16
#include <linux/kcore.h>
L
Linus Torvalds 已提交
17
#include <linux/user.h>
18
#include <linux/capability.h>
L
Linus Torvalds 已提交
19 20
#include <linux/elf.h>
#include <linux/elfcore.h>
21
#include <linux/notifier.h>
L
Linus Torvalds 已提交
22 23
#include <linux/vmalloc.h>
#include <linux/highmem.h>
A
Andrew Morton 已提交
24
#include <linux/printk.h>
25
#include <linux/bootmem.h>
L
Linus Torvalds 已提交
26
#include <linux/init.h>
27
#include <linux/slab.h>
28
#include <linux/uaccess.h>
L
Linus Torvalds 已提交
29
#include <asm/io.h>
30
#include <linux/list.h>
31 32
#include <linux/ioport.h>
#include <linux/memory.h>
33
#include <linux/sched/task.h>
34
#include <asm/sections.h>
35
#include "internal.h"
L
Linus Torvalds 已提交
36

37
#define CORE_STR "CORE"
L
Linus Torvalds 已提交
38

39 40 41 42
#ifndef ELF_CORE_EFLAGS
#define ELF_CORE_EFLAGS	0
#endif

43 44
static struct proc_dir_entry *proc_root_kcore;

L
Linus Torvalds 已提交
45 46 47 48 49 50 51 52

#ifndef kc_vaddr_to_offset
#define	kc_vaddr_to_offset(v) ((v) - PAGE_OFFSET)
#endif
#ifndef	kc_offset_to_vaddr
#define	kc_offset_to_vaddr(o) ((o) + PAGE_OFFSET)
#endif

53
static LIST_HEAD(kclist_head);
54
static DECLARE_RWSEM(kclist_lock);
55
static int kcore_need_update = 1;
L
Linus Torvalds 已提交
56

57 58 59
/* This doesn't grab kclist_lock, so it should only be used at init time. */
void __init kclist_add(struct kcore_list *new, void *addr, size_t size,
		       int type)
L
Linus Torvalds 已提交
60 61 62
{
	new->addr = (unsigned long)addr;
	new->size = size;
K
KAMEZAWA Hiroyuki 已提交
63
	new->type = type;
L
Linus Torvalds 已提交
64

65
	list_add_tail(&new->list, &kclist_head);
L
Linus Torvalds 已提交
66 67
}

68 69
static size_t get_kcore_size(int *nphdr, size_t *phdrs_len, size_t *notes_len,
			     size_t *data_offset)
L
Linus Torvalds 已提交
70 71 72 73 74 75 76
{
	size_t try, size;
	struct kcore_list *m;

	*nphdr = 1; /* PT_NOTE */
	size = 0;

77
	list_for_each_entry(m, &kclist_head, list) {
L
Linus Torvalds 已提交
78 79 80 81 82
		try = kc_vaddr_to_offset((size_t)m->addr + m->size);
		if (try > size)
			size = try;
		*nphdr = *nphdr + 1;
	}
83 84

	*phdrs_len = *nphdr * sizeof(struct elf_phdr);
85 86 87
	*notes_len = (4 * sizeof(struct elf_note) +
		      3 * ALIGN(sizeof(CORE_STR), 4) +
		      VMCOREINFO_NOTE_NAME_BYTES +
88 89
		      ALIGN(sizeof(struct elf_prstatus), 4) +
		      ALIGN(sizeof(struct elf_prpsinfo), 4) +
90 91
		      ALIGN(arch_task_struct_size, 4) +
		      ALIGN(vmcoreinfo_size, 4));
92 93 94
	*data_offset = PAGE_ALIGN(sizeof(struct elfhdr) + *phdrs_len +
				  *notes_len);
	return *data_offset + size;
L
Linus Torvalds 已提交
95 96
}

97 98 99 100 101 102
#ifdef CONFIG_HIGHMEM
/*
 * If no highmem, we can assume [0...max_low_pfn) continuous range of memory
 * because memory hole is not as big as !HIGHMEM case.
 * (HIGHMEM is special because part of memory is _invisible_ from the kernel.)
 */
103
static int kcore_ram_list(struct list_head *head)
104 105 106 107 108 109 110 111 112
{
	struct kcore_list *ent;

	ent = kmalloc(sizeof(*ent), GFP_KERNEL);
	if (!ent)
		return -ENOMEM;
	ent->addr = (unsigned long)__va(0);
	ent->size = max_low_pfn << PAGE_SHIFT;
	ent->type = KCORE_RAM;
113 114
	list_add(&ent->list, head);
	return 0;
115 116 117 118
}

#else /* !CONFIG_HIGHMEM */

119 120
#ifdef CONFIG_SPARSEMEM_VMEMMAP
/* calculate vmemmap's address from given system ram pfn and register it */
121 122
static int
get_sparsemem_vmemmap_info(struct kcore_list *ent, struct list_head *head)
123 124 125 126 127 128 129 130 131
{
	unsigned long pfn = __pa(ent->addr) >> PAGE_SHIFT;
	unsigned long nr_pages = ent->size >> PAGE_SHIFT;
	unsigned long start, end;
	struct kcore_list *vmm, *tmp;


	start = ((unsigned long)pfn_to_page(pfn)) & PAGE_MASK;
	end = ((unsigned long)pfn_to_page(pfn + nr_pages)) - 1;
132
	end = PAGE_ALIGN(end);
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
	/* overlap check (because we have to align page */
	list_for_each_entry(tmp, head, list) {
		if (tmp->type != KCORE_VMEMMAP)
			continue;
		if (start < tmp->addr + tmp->size)
			if (end > tmp->addr)
				end = tmp->addr;
	}
	if (start < end) {
		vmm = kmalloc(sizeof(*vmm), GFP_KERNEL);
		if (!vmm)
			return 0;
		vmm->addr = start;
		vmm->size = end - start;
		vmm->type = KCORE_VMEMMAP;
		list_add_tail(&vmm->list, head);
	}
	return 1;

}
#else
154 155
static int
get_sparsemem_vmemmap_info(struct kcore_list *ent, struct list_head *head)
156 157 158 159 160 161
{
	return 1;
}

#endif

162 163 164 165 166
static int
kclist_add_private(unsigned long pfn, unsigned long nr_pages, void *arg)
{
	struct list_head *head = (struct list_head *)arg;
	struct kcore_list *ent;
167 168 169 170 171 172 173 174
	struct page *p;

	if (!pfn_valid(pfn))
		return 1;

	p = pfn_to_page(pfn);
	if (!memmap_valid_within(pfn, p, page_zone(p)))
		return 1;
175 176 177 178

	ent = kmalloc(sizeof(*ent), GFP_KERNEL);
	if (!ent)
		return -ENOMEM;
179
	ent->addr = (unsigned long)page_to_virt(p);
180 181
	ent->size = nr_pages << PAGE_SHIFT;

182
	if (!virt_addr_valid(ent->addr))
183 184 185 186 187 188
		goto free_out;

	/* cut not-mapped area. ....from ppc-32 code. */
	if (ULONG_MAX - ent->addr < ent->size)
		ent->size = ULONG_MAX - ent->addr;

189 190 191 192 193 194
	/*
	 * We've already checked virt_addr_valid so we know this address
	 * is a valid pointer, therefore we can check against it to determine
	 * if we need to trim
	 */
	if (VMALLOC_START > ent->addr) {
195 196 197 198 199 200
		if (VMALLOC_START - ent->addr < ent->size)
			ent->size = VMALLOC_START - ent->addr;
	}

	ent->type = KCORE_RAM;
	list_add_tail(&ent->list, head);
201 202 203 204 205 206

	if (!get_sparsemem_vmemmap_info(ent, head)) {
		list_del(&ent->list);
		goto free_out;
	}

207 208 209 210 211 212
	return 0;
free_out:
	kfree(ent);
	return 1;
}

213
static int kcore_ram_list(struct list_head *list)
214 215 216 217 218 219 220
{
	int nid, ret;
	unsigned long end_pfn;

	/* Not inialized....update now */
	/* find out "max pfn" */
	end_pfn = 0;
221
	for_each_node_state(nid, N_MEMORY) {
222
		unsigned long node_end;
223
		node_end = node_end_pfn(nid);
224 225 226 227
		if (end_pfn < node_end)
			end_pfn = node_end;
	}
	/* scan 0 to max_pfn */
228 229
	ret = walk_system_ram_range(0, end_pfn, list, kclist_add_private);
	if (ret)
230
		return -ENOMEM;
231 232 233 234 235 236 237 238 239
	return 0;
}
#endif /* CONFIG_HIGHMEM */

static int kcore_update_ram(void)
{
	LIST_HEAD(list);
	LIST_HEAD(garbage);
	int nphdr;
240
	size_t phdrs_len, notes_len, data_offset;
241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
	struct kcore_list *tmp, *pos;
	int ret = 0;

	down_write(&kclist_lock);
	if (!xchg(&kcore_need_update, 0))
		goto out;

	ret = kcore_ram_list(&list);
	if (ret) {
		/* Couldn't get the RAM list, try again next time. */
		WRITE_ONCE(kcore_need_update, 1);
		list_splice_tail(&list, &garbage);
		goto out;
	}

	list_for_each_entry_safe(pos, tmp, &kclist_head, list) {
		if (pos->type == KCORE_RAM || pos->type == KCORE_VMEMMAP)
			list_move(&pos->list, &garbage);
	}
	list_splice_tail(&list, &kclist_head);

262 263
	proc_root_kcore->size = get_kcore_size(&nphdr, &phdrs_len, &notes_len,
					       &data_offset);
264 265 266 267 268 269

out:
	up_write(&kclist_lock);
	list_for_each_entry_safe(pos, tmp, &garbage, list) {
		list_del(&pos->list);
		kfree(pos);
270 271 272
	}
	return ret;
}
L
Linus Torvalds 已提交
273

274 275 276
static void append_kcore_note(char *notes, size_t *i, const char *name,
			      unsigned int type, const void *desc,
			      size_t descsz)
L
Linus Torvalds 已提交
277
{
278 279 280 281 282 283 284 285 286 287 288
	struct elf_note *note = (struct elf_note *)&notes[*i];

	note->n_namesz = strlen(name) + 1;
	note->n_descsz = descsz;
	note->n_type = type;
	*i += sizeof(*note);
	memcpy(&notes[*i], name, note->n_namesz);
	*i = ALIGN(*i + note->n_namesz, 4);
	memcpy(&notes[*i], desc, descsz);
	*i = ALIGN(*i + descsz, 4);
}
L
Linus Torvalds 已提交
289 290 291 292

static ssize_t
read_kcore(struct file *file, char __user *buffer, size_t buflen, loff_t *fpos)
{
293
	char *buf = file->private_data;
294 295 296 297
	size_t phdrs_offset, notes_offset, data_offset;
	size_t phdrs_len, notes_len;
	struct kcore_list *m;
	size_t tsz;
L
Linus Torvalds 已提交
298 299
	int nphdr;
	unsigned long start;
300 301
	size_t orig_buflen = buflen;
	int ret = 0;
L
Linus Torvalds 已提交
302

303
	down_read(&kclist_lock);
304

305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336
	get_kcore_size(&nphdr, &phdrs_len, &notes_len, &data_offset);
	phdrs_offset = sizeof(struct elfhdr);
	notes_offset = phdrs_offset + phdrs_len;

	/* ELF file header. */
	if (buflen && *fpos < sizeof(struct elfhdr)) {
		struct elfhdr ehdr = {
			.e_ident = {
				[EI_MAG0] = ELFMAG0,
				[EI_MAG1] = ELFMAG1,
				[EI_MAG2] = ELFMAG2,
				[EI_MAG3] = ELFMAG3,
				[EI_CLASS] = ELF_CLASS,
				[EI_DATA] = ELF_DATA,
				[EI_VERSION] = EV_CURRENT,
				[EI_OSABI] = ELF_OSABI,
			},
			.e_type = ET_CORE,
			.e_machine = ELF_ARCH,
			.e_version = EV_CURRENT,
			.e_phoff = sizeof(struct elfhdr),
			.e_flags = ELF_CORE_EFLAGS,
			.e_ehsize = sizeof(struct elfhdr),
			.e_phentsize = sizeof(struct elf_phdr),
			.e_phnum = nphdr,
		};

		tsz = min_t(size_t, buflen, sizeof(struct elfhdr) - *fpos);
		if (copy_to_user(buffer, (char *)&ehdr + *fpos, tsz)) {
			ret = -EFAULT;
			goto out;
		}
L
Linus Torvalds 已提交
337

338 339 340 341
		buffer += tsz;
		buflen -= tsz;
		*fpos += tsz;
	}
L
Linus Torvalds 已提交
342

343 344 345
	/* ELF program headers. */
	if (buflen && *fpos < phdrs_offset + phdrs_len) {
		struct elf_phdr *phdrs, *phdr;
L
Linus Torvalds 已提交
346

347 348
		phdrs = kzalloc(phdrs_len, GFP_KERNEL);
		if (!phdrs) {
349 350
			ret = -ENOMEM;
			goto out;
L
Linus Torvalds 已提交
351
		}
352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377

		phdrs[0].p_type = PT_NOTE;
		phdrs[0].p_offset = notes_offset;
		phdrs[0].p_filesz = notes_len;

		phdr = &phdrs[1];
		list_for_each_entry(m, &kclist_head, list) {
			phdr->p_type = PT_LOAD;
			phdr->p_flags = PF_R | PF_W | PF_X;
			phdr->p_offset = kc_vaddr_to_offset(m->addr) + data_offset;
			phdr->p_vaddr = (size_t)m->addr;
			if (m->type == KCORE_RAM)
				phdr->p_paddr = __pa(m->addr);
			else if (m->type == KCORE_TEXT)
				phdr->p_paddr = __pa_symbol(m->addr);
			else
				phdr->p_paddr = (elf_addr_t)-1;
			phdr->p_filesz = phdr->p_memsz = m->size;
			phdr->p_align = PAGE_SIZE;
			phdr++;
		}

		tsz = min_t(size_t, buflen, phdrs_offset + phdrs_len - *fpos);
		if (copy_to_user(buffer, (char *)phdrs + *fpos - phdrs_offset,
				 tsz)) {
			kfree(phdrs);
378 379
			ret = -EFAULT;
			goto out;
L
Linus Torvalds 已提交
380
		}
381 382 383
		kfree(phdrs);

		buffer += tsz;
L
Linus Torvalds 已提交
384 385
		buflen -= tsz;
		*fpos += tsz;
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
	}

	/* ELF note segment. */
	if (buflen && *fpos < notes_offset + notes_len) {
		struct elf_prstatus prstatus = {};
		struct elf_prpsinfo prpsinfo = {
			.pr_sname = 'R',
			.pr_fname = "vmlinux",
		};
		char *notes;
		size_t i = 0;

		strlcpy(prpsinfo.pr_psargs, saved_command_line,
			sizeof(prpsinfo.pr_psargs));

		notes = kzalloc(notes_len, GFP_KERNEL);
		if (!notes) {
			ret = -ENOMEM;
			goto out;
		}

		append_kcore_note(notes, &i, CORE_STR, NT_PRSTATUS, &prstatus,
				  sizeof(prstatus));
		append_kcore_note(notes, &i, CORE_STR, NT_PRPSINFO, &prpsinfo,
				  sizeof(prpsinfo));
		append_kcore_note(notes, &i, CORE_STR, NT_TASKSTRUCT, current,
				  arch_task_struct_size);
413 414 415 416 417 418 419 420 421 422
		/*
		 * vmcoreinfo_size is mostly constant after init time, but it
		 * can be changed by crash_save_vmcoreinfo(). Racing here with a
		 * panic on another CPU before the machine goes down is insanely
		 * unlikely, but it's better to not leave potential buffer
		 * overflows lying around, regardless.
		 */
		append_kcore_note(notes, &i, VMCOREINFO_NOTE_NAME, 0,
				  vmcoreinfo_data,
				  min(vmcoreinfo_size, notes_len - i));
L
Linus Torvalds 已提交
423

424 425 426 427
		tsz = min_t(size_t, buflen, notes_offset + notes_len - *fpos);
		if (copy_to_user(buffer, notes + *fpos - notes_offset, tsz)) {
			kfree(notes);
			ret = -EFAULT;
428
			goto out;
429 430 431 432 433 434
		}
		kfree(notes);

		buffer += tsz;
		buflen -= tsz;
		*fpos += tsz;
435
	}
L
Linus Torvalds 已提交
436 437 438 439 440

	/*
	 * Check to see if our file offset matches with any of
	 * the addresses in the elf_phdr on our list.
	 */
441
	start = kc_offset_to_vaddr(*fpos - data_offset);
L
Linus Torvalds 已提交
442 443 444
	if ((tsz = (PAGE_SIZE - (start & ~PAGE_MASK))) > buflen)
		tsz = buflen;

445
	m = NULL;
446
	while (buflen) {
447 448 449 450 451 452 453 454 455 456
		/*
		 * If this is the first iteration or the address is not within
		 * the previous entry, search for a matching entry.
		 */
		if (!m || start < m->addr || start >= m->addr + m->size) {
			list_for_each_entry(m, &kclist_head, list) {
				if (start >= m->addr &&
				    start < m->addr + m->size)
					break;
			}
L
Linus Torvalds 已提交
457 458
		}

D
Dan Carpenter 已提交
459
		if (&m->list == &kclist_head) {
460 461 462 463
			if (clear_user(buffer, tsz)) {
				ret = -EFAULT;
				goto out;
			}
464
		} else if (m->type == KCORE_VMALLOC) {
465
			vread(buf, (char *)start, tsz);
466
			/* we have to zero-fill user buffer even if no read */
467 468 469 470
			if (copy_to_user(buffer, buf, tsz)) {
				ret = -EFAULT;
				goto out;
			}
471 472
		} else if (m->type == KCORE_USER) {
			/* User page is handled prior to normal kernel page: */
473 474 475 476
			if (copy_to_user(buffer, (char *)start, tsz)) {
				ret = -EFAULT;
				goto out;
			}
L
Linus Torvalds 已提交
477 478
		} else {
			if (kern_addr_valid(start)) {
479 480 481 482
				/*
				 * Using bounce buffer to bypass the
				 * hardened user copy kernel text checks.
				 */
483
				if (probe_kernel_read(buf, (void *) start, tsz)) {
484 485 486 487
					if (clear_user(buffer, tsz)) {
						ret = -EFAULT;
						goto out;
					}
488
				} else {
489 490 491 492
					if (copy_to_user(buffer, buf, tsz)) {
						ret = -EFAULT;
						goto out;
					}
L
Linus Torvalds 已提交
493 494
				}
			} else {
495 496 497 498
				if (clear_user(buffer, tsz)) {
					ret = -EFAULT;
					goto out;
				}
L
Linus Torvalds 已提交
499 500 501 502 503 504 505 506 507
			}
		}
		buflen -= tsz;
		*fpos += tsz;
		buffer += tsz;
		start += tsz;
		tsz = (buflen > PAGE_SIZE ? PAGE_SIZE : buflen);
	}

508 509 510 511 512
out:
	up_read(&kclist_lock);
	if (ret)
		return ret;
	return orig_buflen - buflen;
L
Linus Torvalds 已提交
513
}
514

515 516 517 518
static int open_kcore(struct inode *inode, struct file *filp)
{
	if (!capable(CAP_SYS_RAWIO))
		return -EPERM;
519 520 521 522 523

	filp->private_data = kmalloc(PAGE_SIZE, GFP_KERNEL);
	if (!filp->private_data)
		return -ENOMEM;

524 525
	if (kcore_need_update)
		kcore_update_ram();
526
	if (i_size_read(inode) != proc_root_kcore->size) {
A
Al Viro 已提交
527
		inode_lock(inode);
528
		i_size_write(inode, proc_root_kcore->size);
A
Al Viro 已提交
529
		inode_unlock(inode);
530
	}
531 532 533
	return 0;
}

534 535 536 537 538
static int release_kcore(struct inode *inode, struct file *file)
{
	kfree(file->private_data);
	return 0;
}
539 540 541 542

static const struct file_operations proc_kcore_operations = {
	.read		= read_kcore,
	.open		= open_kcore,
543
	.release	= release_kcore,
D
Dave Anderson 已提交
544
	.llseek		= default_llseek,
545 546 547 548 549 550 551 552 553 554
};

/* just remember that we have to update kcore */
static int __meminit kcore_callback(struct notifier_block *self,
				    unsigned long action, void *arg)
{
	switch (action) {
	case MEM_ONLINE:
	case MEM_OFFLINE:
		kcore_need_update = 1;
555
		break;
556 557 558 559
	}
	return NOTIFY_OK;
}

560 561 562 563
static struct notifier_block kcore_callback_nb __meminitdata = {
	.notifier_call = kcore_callback,
	.priority = 0,
};
564

565 566
static struct kcore_list kcore_vmalloc;

567 568 569 570 571 572 573 574
#ifdef CONFIG_ARCH_PROC_KCORE_TEXT
static struct kcore_list kcore_text;
/*
 * If defined, special segment is used for mapping kernel text instead of
 * direct-map area. We need to create special TEXT section.
 */
static void __init proc_kcore_text_init(void)
{
W
Wu Fengguang 已提交
575
	kclist_add(&kcore_text, _text, _end - _text, KCORE_TEXT);
576 577 578 579 580 581 582
}
#else
static void __init proc_kcore_text_init(void)
{
}
#endif

583 584 585 586 587 588 589
#if defined(CONFIG_MODULES) && defined(MODULES_VADDR)
/*
 * MODULES_VADDR has no intersection with VMALLOC_ADDR.
 */
struct kcore_list kcore_modules;
static void __init add_modules_range(void)
{
590 591
	if (MODULES_VADDR != VMALLOC_START && MODULES_END != VMALLOC_END) {
		kclist_add(&kcore_modules, (void *)MODULES_VADDR,
592
			MODULES_END - MODULES_VADDR, KCORE_VMALLOC);
593
	}
594 595 596 597 598 599 600
}
#else
static void __init add_modules_range(void)
{
}
#endif

601 602
static int __init proc_kcore_init(void)
{
603 604
	proc_root_kcore = proc_create("kcore", S_IRUSR, NULL,
				      &proc_kcore_operations);
K
KAMEZAWA Hiroyuki 已提交
605
	if (!proc_root_kcore) {
A
Andrew Morton 已提交
606
		pr_err("couldn't create /proc/kcore\n");
K
KAMEZAWA Hiroyuki 已提交
607 608
		return 0; /* Always returns 0. */
	}
609
	/* Store text area if it's special */
610
	proc_kcore_text_init();
611
	/* Store vmalloc area */
612 613
	kclist_add(&kcore_vmalloc, (void *)VMALLOC_START,
		VMALLOC_END - VMALLOC_START, KCORE_VMALLOC);
614
	add_modules_range();
615 616
	/* Store direct-map area from physical memory map */
	kcore_update_ram();
617
	register_hotmemory_notifier(&kcore_callback_nb);
618

619 620
	return 0;
}
621
fs_initcall(proc_kcore_init);