Linux-2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
This commit is contained in:
Linus Torvalds
216
arch/sparc/prom/memory.c
Normal file
216
arch/sparc/prom/memory.c
Normal file
@@ -0,0 +1,216 @@
|
||||
/* $Id: memory.c,v 1.15 2000/01/29 01:09:12 anton Exp $
|
||||
* memory.c: Prom routine for acquiring various bits of information
|
||||
* about RAM on the machine, both virtual and physical.
|
||||
*
|
||||
* Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu)
|
||||
* Copyright (C) 1997 Michael A. Griffith (grif@acm.org)
|
||||
*/
|
||||
|
||||
#include <linux/config.h>
|
||||
#include <linux/kernel.h>
|
||||
#include <linux/init.h>
|
||||
|
||||
#include <asm/openprom.h>
|
||||
#include <asm/sun4prom.h>
|
||||
#include <asm/oplib.h>
|
||||
|
||||
/* This routine, for consistency, returns the ram parameters in the
|
||||
* V0 prom memory descriptor format. I choose this format because I
|
||||
* think it was the easiest to work with. I feel the religious
|
||||
* arguments now... ;) Also, I return the linked lists sorted to
|
||||
* prevent paging_init() upset stomach as I have not yet written
|
||||
* the pepto-bismol kernel module yet.
|
||||
*/
|
||||
|
||||
struct linux_prom_registers prom_reg_memlist[64];
|
||||
struct linux_prom_registers prom_reg_tmp[64];
|
||||
|
||||
struct linux_mlist_v0 prom_phys_total[64];
|
||||
struct linux_mlist_v0 prom_prom_taken[64];
|
||||
struct linux_mlist_v0 prom_phys_avail[64];
|
||||
|
||||
struct linux_mlist_v0 *prom_ptot_ptr = prom_phys_total;
|
||||
struct linux_mlist_v0 *prom_ptak_ptr = prom_prom_taken;
|
||||
struct linux_mlist_v0 *prom_pavl_ptr = prom_phys_avail;
|
||||
|
||||
struct linux_mem_v0 prom_memlist;
|
||||
|
||||
|
||||
/* Internal Prom library routine to sort a linux_mlist_v0 memory
|
||||
* list. Used below in initialization.
|
||||
*/
|
||||
static void __init
|
||||
prom_sortmemlist(struct linux_mlist_v0 *thislist)
|
||||
{
|
||||
int swapi = 0;
|
||||
int i, mitr, tmpsize;
|
||||
char *tmpaddr;
|
||||
char *lowest;
|
||||
|
||||
for(i=0; thislist[i].theres_more != 0; i++) {
|
||||
lowest = thislist[i].start_adr;
|
||||
for(mitr = i+1; thislist[mitr-1].theres_more != 0; mitr++)
|
||||
if(thislist[mitr].start_adr < lowest) {
|
||||
lowest = thislist[mitr].start_adr;
|
||||
swapi = mitr;
|
||||
}
|
||||
if(lowest == thislist[i].start_adr) continue;
|
||||
tmpaddr = thislist[swapi].start_adr;
|
||||
tmpsize = thislist[swapi].num_bytes;
|
||||
for(mitr = swapi; mitr > i; mitr--) {
|
||||
thislist[mitr].start_adr = thislist[mitr-1].start_adr;
|
||||
thislist[mitr].num_bytes = thislist[mitr-1].num_bytes;
|
||||
}
|
||||
thislist[i].start_adr = tmpaddr;
|
||||
thislist[i].num_bytes = tmpsize;
|
||||
}
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/* Initialize the memory lists based upon the prom version. */
|
||||
void __init prom_meminit(void)
|
||||
{
|
||||
int node = 0;
|
||||
unsigned int iter, num_regs;
|
||||
struct linux_mlist_v0 *mptr; /* ptr for traversal */
|
||||
|
||||
switch(prom_vers) {
|
||||
case PROM_V0:
|
||||
/* Nice, kind of easier to do in this case. */
|
||||
/* First, the total physical descriptors. */
|
||||
for(mptr = (*(romvec->pv_v0mem.v0_totphys)), iter=0;
|
||||
mptr; mptr=mptr->theres_more, iter++) {
|
||||
prom_phys_total[iter].start_adr = mptr->start_adr;
|
||||
prom_phys_total[iter].num_bytes = mptr->num_bytes;
|
||||
prom_phys_total[iter].theres_more = &prom_phys_total[iter+1];
|
||||
}
|
||||
prom_phys_total[iter-1].theres_more = 0x0;
|
||||
/* Second, the total prom taken descriptors. */
|
||||
for(mptr = (*(romvec->pv_v0mem.v0_prommap)), iter=0;
|
||||
mptr; mptr=mptr->theres_more, iter++) {
|
||||
prom_prom_taken[iter].start_adr = mptr->start_adr;
|
||||
prom_prom_taken[iter].num_bytes = mptr->num_bytes;
|
||||
prom_prom_taken[iter].theres_more = &prom_prom_taken[iter+1];
|
||||
}
|
||||
prom_prom_taken[iter-1].theres_more = 0x0;
|
||||
/* Last, the available physical descriptors. */
|
||||
for(mptr = (*(romvec->pv_v0mem.v0_available)), iter=0;
|
||||
mptr; mptr=mptr->theres_more, iter++) {
|
||||
prom_phys_avail[iter].start_adr = mptr->start_adr;
|
||||
prom_phys_avail[iter].num_bytes = mptr->num_bytes;
|
||||
prom_phys_avail[iter].theres_more = &prom_phys_avail[iter+1];
|
||||
}
|
||||
prom_phys_avail[iter-1].theres_more = 0x0;
|
||||
/* Sort all the lists. */
|
||||
prom_sortmemlist(prom_phys_total);
|
||||
prom_sortmemlist(prom_prom_taken);
|
||||
prom_sortmemlist(prom_phys_avail);
|
||||
break;
|
||||
case PROM_V2:
|
||||
case PROM_V3:
|
||||
/* Grrr, have to traverse the prom device tree ;( */
|
||||
node = prom_getchild(prom_root_node);
|
||||
node = prom_searchsiblings(node, "memory");
|
||||
num_regs = prom_getproperty(node, "available",
|
||||
(char *) prom_reg_memlist,
|
||||
sizeof(prom_reg_memlist));
|
||||
num_regs = (num_regs/sizeof(struct linux_prom_registers));
|
||||
for(iter=0; iter<num_regs; iter++) {
|
||||
prom_phys_avail[iter].start_adr =
|
||||
(char *) prom_reg_memlist[iter].phys_addr;
|
||||
prom_phys_avail[iter].num_bytes =
|
||||
(unsigned long) prom_reg_memlist[iter].reg_size;
|
||||
prom_phys_avail[iter].theres_more =
|
||||
&prom_phys_avail[iter+1];
|
||||
}
|
||||
prom_phys_avail[iter-1].theres_more = 0x0;
|
||||
|
||||
num_regs = prom_getproperty(node, "reg",
|
||||
(char *) prom_reg_memlist,
|
||||
sizeof(prom_reg_memlist));
|
||||
num_regs = (num_regs/sizeof(struct linux_prom_registers));
|
||||
for(iter=0; iter<num_regs; iter++) {
|
||||
prom_phys_total[iter].start_adr =
|
||||
(char *) prom_reg_memlist[iter].phys_addr;
|
||||
prom_phys_total[iter].num_bytes =
|
||||
(unsigned long) prom_reg_memlist[iter].reg_size;
|
||||
prom_phys_total[iter].theres_more =
|
||||
&prom_phys_total[iter+1];
|
||||
}
|
||||
prom_phys_total[iter-1].theres_more = 0x0;
|
||||
|
||||
node = prom_getchild(prom_root_node);
|
||||
node = prom_searchsiblings(node, "virtual-memory");
|
||||
num_regs = prom_getproperty(node, "available",
|
||||
(char *) prom_reg_memlist,
|
||||
sizeof(prom_reg_memlist));
|
||||
num_regs = (num_regs/sizeof(struct linux_prom_registers));
|
||||
|
||||
/* Convert available virtual areas to taken virtual
|
||||
* areas. First sort, then convert.
|
||||
*/
|
||||
for(iter=0; iter<num_regs; iter++) {
|
||||
prom_prom_taken[iter].start_adr =
|
||||
(char *) prom_reg_memlist[iter].phys_addr;
|
||||
prom_prom_taken[iter].num_bytes =
|
||||
(unsigned long) prom_reg_memlist[iter].reg_size;
|
||||
prom_prom_taken[iter].theres_more =
|
||||
&prom_prom_taken[iter+1];
|
||||
}
|
||||
prom_prom_taken[iter-1].theres_more = 0x0;
|
||||
|
||||
prom_sortmemlist(prom_prom_taken);
|
||||
|
||||
/* Finally, convert. */
|
||||
for(iter=0; iter<num_regs; iter++) {
|
||||
prom_prom_taken[iter].start_adr =
|
||||
prom_prom_taken[iter].start_adr +
|
||||
prom_prom_taken[iter].num_bytes;
|
||||
prom_prom_taken[iter].num_bytes =
|
||||
prom_prom_taken[iter+1].start_adr -
|
||||
prom_prom_taken[iter].start_adr;
|
||||
}
|
||||
prom_prom_taken[iter-1].num_bytes =
|
||||
0xffffffff - (unsigned long) prom_prom_taken[iter-1].start_adr;
|
||||
|
||||
/* Sort the other two lists. */
|
||||
prom_sortmemlist(prom_phys_total);
|
||||
prom_sortmemlist(prom_phys_avail);
|
||||
break;
|
||||
|
||||
case PROM_SUN4:
|
||||
#ifdef CONFIG_SUN4
|
||||
/* how simple :) */
|
||||
prom_phys_total[0].start_adr = 0x0;
|
||||
prom_phys_total[0].num_bytes = *(sun4_romvec->memorysize);
|
||||
prom_phys_total[0].theres_more = 0x0;
|
||||
prom_prom_taken[0].start_adr = 0x0;
|
||||
prom_prom_taken[0].num_bytes = 0x0;
|
||||
prom_prom_taken[0].theres_more = 0x0;
|
||||
prom_phys_avail[0].start_adr = 0x0;
|
||||
prom_phys_avail[0].num_bytes = *(sun4_romvec->memoryavail);
|
||||
prom_phys_avail[0].theres_more = 0x0;
|
||||
#endif
|
||||
break;
|
||||
|
||||
default:
|
||||
break;
|
||||
};
|
||||
|
||||
/* Link all the lists into the top-level descriptor. */
|
||||
prom_memlist.v0_totphys=&prom_ptot_ptr;
|
||||
prom_memlist.v0_prommap=&prom_ptak_ptr;
|
||||
prom_memlist.v0_available=&prom_pavl_ptr;
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/* This returns a pointer to our libraries internal v0 format
|
||||
* memory descriptor.
|
||||
*/
|
||||
struct linux_mem_v0 *
|
||||
prom_meminfo(void)
|
||||
{
|
||||
return &prom_memlist;
|
||||
}
|
||||
Reference in New Issue
Block a user