⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 init.c

📁 arm平台上的uclinux系统全部源代码
💻 C
字号:
/* *  linux/arch/arm/mm/init.c * *  Copyright (C) 1995, 1996  Russell King */#include <linux/config.h>#include <linux/signal.h>#include <linux/sched.h>#include <linux/head.h>#include <linux/kernel.h>#include <linux/errno.h>#include <linux/string.h>#include <linux/types.h>#include <linux/ptrace.h>#include <linux/mman.h>#include <linux/mm.h>#include <linux/swap.h>#include <linux/smp.h>#ifdef CONFIG_BLK_DEV_INITRD#include <linux/blk.h>#endif#include <asm/system.h>#include <asm/segment.h>#include <asm/pgtable.h>#include <asm/dma.h>#include <asm/hardware.h>#include <asm/proc/mm-init.h>#define DEBUGunsigned long *empty_zero_page;unsigned long *empty_bad_page;unsigned long max_mapnr;#ifndef NO_MMpgd_t swapper_pg_dir[PTRS_PER_PGD];const char bad_pmd_string[] = "Bad pmd in pte_alloc: %08lx\n";/* * BAD_PAGE is the page that is used for page faults when linux * is out-of-memory. Older versions of linux just did a * do_exit(), but using this instead means there is less risk * for a process dying in kernel mode, possibly leaving a inode * unused etc.. * * BAD_PAGETABLE is the accompanying page-table: it is initialized * to point to BAD_PAGE entries. * * ZERO_PAGE is a special page that is used for zero-initialized * data and COW. */#if PTRS_PER_PTE != 1unsigned long *empty_bad_page_table;pte_t *__bad_pagetable(void){	int i;	pte_t bad_page;	bad_page = BAD_PAGE;	for (i = 0; i < PTRS_PER_PTE; i++)		empty_bad_page_table[i] = (unsigned long)pte_val(bad_page);	return (pte_t *) empty_bad_page_table;}#endifpte_t __bad_page(void){	memzero (empty_bad_page, PAGE_SIZE);	return pte_nocache(pte_mkdirty(mk_pte((unsigned long) empty_bad_page, PAGE_SHARED)));}#endifvoid show_mem(void){	extern void show_net_buffers(void);	int i,free = 0,total = 0,reserved = 0;	int shared = 0;	printk("Mem-info:\n");	show_free_areas();#if defined(CONFIG_CPU_ARM2) || defined(CONFIG_CPU_ARM3)	kmalloc_stats();#endif	printk("Free swap:       %6dkB\n",nr_swap_pages<<(PAGE_SHIFT-10));	i = max_mapnr;	while (i-- > 0) {		total++;		if (PageReserved(mem_map+i))			reserved++;		else if (!mem_map[i].count)			free++;		else			shared += mem_map[i].count-1;	}	printk("%d pages of RAM\n",total);	printk("%d free pages\n",free);	printk("%d reserved pages\n",reserved);	printk("%d pages shared\n",shared);	show_buffers();#ifdef CONFIG_NET	show_net_buffers();#endif}void si_meminfo(struct sysinfo *val){	int i;	i = max_mapnr;	val->totalram = 0;	val->sharedram = 0;	val->freeram = nr_free_pages << PAGE_SHIFT;	val->bufferram = buffermem;	while (i-- > 0)  {		if (PageReserved(mem_map+i))			continue;		val->totalram++;		if (!mem_map[i].count)			continue;		val->sharedram += mem_map[i].count-1;	}	val->totalram <<= PAGE_SHIFT;	val->sharedram <<= PAGE_SHIFT;}#ifndef NO_MM/* * paging_init() sets up the page tables... */unsigned long paging_init(unsigned long start_mem, unsigned long end_mem){	extern unsigned long free_area_init(unsigned long, unsigned long);	/* We appear to need this */	current_set[0] = &init_task;	SET_PAGE_DIR(current, swapper_pg_dir);	start_mem = PAGE_ALIGN(start_mem);	empty_zero_page = (unsigned long *)start_mem;	start_mem += PAGE_SIZE;	empty_bad_page = (unsigned long *)start_mem;	start_mem += PAGE_SIZE;#if PTRS_PER_PTE != 1	empty_bad_page_table = (unsigned long *)start_mem;	start_mem += PTRS_PER_PTE * sizeof (void *);#endif	memzero (empty_zero_page, PAGE_SIZE);	start_mem = setup_pagetables (start_mem, end_mem);	flush_tlb_all ();	update_mm_cache_all ();	return free_area_init (start_mem, end_mem);}#elseextern unsigned long free_area_init(unsigned long, unsigned long);unsigned long paging_init(unsigned long start_mem, unsigned long end_mem){#ifdef DEBUG	unsigned long mem_avail = end_mem - start_mem;		printk ("memory available is %ldKB\n", mem_avail >> 10);#endif	/*	 * virtual address after end of kernel	 * "availmem" is setup by the code in head.S.	 */	/*start_mem = availmem;*/#ifdef DEBUG	printk ("start_mem is %#lx\nvirtual_end is %#lx\n",			start_mem, end_mem);#endif	/*	 * initialize the bad page table and bad page to point	 * to a couple of allocated pages	 *///	empty_bad_page_table = start_mem;//	start_mem += PAGE_SIZE;	empty_bad_page = (unsigned long*)start_mem;	start_mem += PAGE_SIZE;	empty_zero_page = (unsigned long*)start_mem;	start_mem += PAGE_SIZE;	memset((void *)empty_zero_page, 0, PAGE_SIZE);	/*	 * Set up SFC/DFC registers (user data space)	 *///	set_fs (USER_DS);#ifdef DEBUG	printk ("before free_area_init\n");	printk ("free_area_init -> start_mem is %#lx\nvirtual_end is %#lx\n",			start_mem, end_mem);#endif	return PAGE_ALIGN(free_area_init (start_mem, end_mem));}#endif/* * mem_init() marks the free areas in the mem_map and tells us how much * memory is free.  This is done after various parts of the system have * claimed their memory after the kernel image. */void mem_init(unsigned long start_mem, unsigned long end_mem){	extern void sound_init(void);	int codepages = 0;	int reservedpages = 0;	int datapages = 0;	unsigned long tmp;	/* mark usable pages in the mem_map[] */	mark_usable_memory_areas(&start_mem, end_mem);	end_mem &= PAGE_MASK;	high_memory = end_mem;	max_mapnr = MAP_NR(end_mem);	for (tmp = PAGE_OFFSET; tmp < high_memory ; tmp += PAGE_SIZE) {		extern int etext;		extern int _stext;		if (PageReserved(mem_map+MAP_NR(tmp))) {			if (tmp < KERNTOPHYS(_stext))				reservedpages++;			else if (tmp < KERNTOPHYS(etext))				codepages++;			else				datapages++;			continue;		}		mem_map[MAP_NR(tmp)].count = 1;#ifdef CONFIG_BLK_DEV_INITRD		if (!initrd_start || (tmp < initrd_start || tmp >= initrd_end))#endif			free_page(tmp);	}	tmp = nr_free_pages << PAGE_SHIFT;	printk ("Memory: %luk/%luM available (%dk kernel code, %dk reserved, %dk data)\n",		 tmp >> 10,		 max_mapnr >> (20 - PAGE_SHIFT),		 codepages << (PAGE_SHIFT-10),		 reservedpages << (PAGE_SHIFT-10),		 datapages << (PAGE_SHIFT-10));}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -