memory.c 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. /* memory.c: Prom routine for acquiring various bits of information
  2. * about RAM on the machine, both virtual and physical.
  3. *
  4. * Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu)
  5. * Copyright (C) 1997 Michael A. Griffith (grif@acm.org)
  6. */
  7. #include <linux/kernel.h>
  8. #include <linux/init.h>
  9. #include <asm/openprom.h>
  10. #include <asm/sun4prom.h>
  11. #include <asm/oplib.h>
  12. /* This routine, for consistency, returns the ram parameters in the
  13. * V0 prom memory descriptor format. I choose this format because I
  14. * think it was the easiest to work with. I feel the religious
  15. * arguments now... ;) Also, I return the linked lists sorted to
  16. * prevent paging_init() upset stomach as I have not yet written
  17. * the pepto-bismol kernel module yet.
  18. */
  19. struct linux_prom_registers prom_reg_memlist[64];
  20. struct linux_mlist_v0 prom_phys_avail[64];
  21. /* Internal Prom library routine to sort a linux_mlist_v0 memory
  22. * list. Used below in initialization.
  23. */
  24. static void __init
  25. prom_sortmemlist(struct linux_mlist_v0 *thislist)
  26. {
  27. int swapi = 0;
  28. int i, mitr, tmpsize;
  29. char *tmpaddr;
  30. char *lowest;
  31. for(i=0; thislist[i].theres_more; i++) {
  32. lowest = thislist[i].start_adr;
  33. for(mitr = i+1; thislist[mitr-1].theres_more; mitr++)
  34. if(thislist[mitr].start_adr < lowest) {
  35. lowest = thislist[mitr].start_adr;
  36. swapi = mitr;
  37. }
  38. if(lowest == thislist[i].start_adr) continue;
  39. tmpaddr = thislist[swapi].start_adr;
  40. tmpsize = thislist[swapi].num_bytes;
  41. for(mitr = swapi; mitr > i; mitr--) {
  42. thislist[mitr].start_adr = thislist[mitr-1].start_adr;
  43. thislist[mitr].num_bytes = thislist[mitr-1].num_bytes;
  44. }
  45. thislist[i].start_adr = tmpaddr;
  46. thislist[i].num_bytes = tmpsize;
  47. }
  48. return;
  49. }
  50. /* Initialize the memory lists based upon the prom version. */
  51. void __init prom_meminit(void)
  52. {
  53. int node = 0;
  54. unsigned int iter, num_regs;
  55. struct linux_mlist_v0 *mptr; /* ptr for traversal */
  56. switch(prom_vers) {
  57. case PROM_V0:
  58. /* Nice, kind of easier to do in this case. */
  59. for(mptr = (*(romvec->pv_v0mem.v0_available)), iter=0;
  60. mptr; mptr=mptr->theres_more, iter++) {
  61. prom_phys_avail[iter].start_adr = mptr->start_adr;
  62. prom_phys_avail[iter].num_bytes = mptr->num_bytes;
  63. prom_phys_avail[iter].theres_more = &prom_phys_avail[iter+1];
  64. }
  65. prom_phys_avail[iter-1].theres_more = NULL;
  66. prom_sortmemlist(prom_phys_avail);
  67. break;
  68. case PROM_V2:
  69. case PROM_V3:
  70. /* Grrr, have to traverse the prom device tree ;( */
  71. node = prom_getchild(prom_root_node);
  72. node = prom_searchsiblings(node, "memory");
  73. num_regs = prom_getproperty(node, "available",
  74. (char *) prom_reg_memlist,
  75. sizeof(prom_reg_memlist));
  76. num_regs = (num_regs/sizeof(struct linux_prom_registers));
  77. for(iter=0; iter<num_regs; iter++) {
  78. prom_phys_avail[iter].start_adr =
  79. (char *) prom_reg_memlist[iter].phys_addr;
  80. prom_phys_avail[iter].num_bytes =
  81. (unsigned long) prom_reg_memlist[iter].reg_size;
  82. prom_phys_avail[iter].theres_more =
  83. &prom_phys_avail[iter+1];
  84. }
  85. prom_phys_avail[iter-1].theres_more = NULL;
  86. prom_sortmemlist(prom_phys_avail);
  87. break;
  88. case PROM_SUN4:
  89. #ifdef CONFIG_SUN4
  90. /* how simple :) */
  91. prom_phys_avail[0].start_adr = NULL;
  92. prom_phys_avail[0].num_bytes = *(sun4_romvec->memoryavail);
  93. prom_phys_avail[0].theres_more = NULL;
  94. #endif
  95. break;
  96. default:
  97. break;
  98. };
  99. }
  100. /* This returns a pointer to our libraries internal v0 format
  101. * available memory list.
  102. */
  103. struct linux_mlist_v0 *
  104. prom_meminfo(void)
  105. {
  106. return prom_phys_avail;
  107. }