numa_32.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. * Written by: Patricia Gaughen <gone@us.ibm.com>, IBM Corporation
  3. * August 2002: added remote node KVA remap - Martin J. Bligh
  4. *
  5. * Copyright (C) 2002, IBM Corp.
  6. *
  7. * All rights reserved.
  8. *
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License as published by
  11. * the Free Software Foundation; either version 2 of the License, or
  12. * (at your option) any later version.
  13. *
  14. * This program is distributed in the hope that it will be useful, but
  15. * WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
  17. * NON INFRINGEMENT. See the GNU General Public License for more
  18. * details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  23. */
  24. #include <linux/memblock.h>
  25. #include <linux/init.h>
  26. #include "numa_internal.h"
  27. #ifdef CONFIG_DISCONTIGMEM
  28. /*
  29. * 4) physnode_map - the mapping between a pfn and owning node
  30. * physnode_map keeps track of the physical memory layout of a generic
  31. * numa node on a 64Mb break (each element of the array will
  32. * represent 64Mb of memory and will be marked by the node id. so,
  33. * if the first gig is on node 0, and the second gig is on node 1
  34. * physnode_map will contain:
  35. *
  36. * physnode_map[0-15] = 0;
  37. * physnode_map[16-31] = 1;
  38. * physnode_map[32- ] = -1;
  39. */
  40. s8 physnode_map[MAX_SECTIONS] __read_mostly = { [0 ... (MAX_SECTIONS - 1)] = -1};
  41. EXPORT_SYMBOL(physnode_map);
  42. void memory_present(int nid, unsigned long start, unsigned long end)
  43. {
  44. unsigned long pfn;
  45. printk(KERN_INFO "Node: %d, start_pfn: %lx, end_pfn: %lx\n",
  46. nid, start, end);
  47. printk(KERN_DEBUG " Setting physnode_map array to node %d for pfns:\n", nid);
  48. printk(KERN_DEBUG " ");
  49. start = round_down(start, PAGES_PER_SECTION);
  50. end = round_up(end, PAGES_PER_SECTION);
  51. for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
  52. physnode_map[pfn / PAGES_PER_SECTION] = nid;
  53. printk(KERN_CONT "%lx ", pfn);
  54. }
  55. printk(KERN_CONT "\n");
  56. }
  57. #endif
  58. extern unsigned long highend_pfn, highstart_pfn;
  59. void __init initmem_init(void)
  60. {
  61. x86_numa_init();
  62. #ifdef CONFIG_HIGHMEM
  63. highstart_pfn = highend_pfn = max_pfn;
  64. if (max_pfn > max_low_pfn)
  65. highstart_pfn = max_low_pfn;
  66. printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
  67. pages_to_mb(highend_pfn - highstart_pfn));
  68. high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
  69. #else
  70. high_memory = (void *) __va(max_low_pfn * PAGE_SIZE - 1) + 1;
  71. #endif
  72. printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
  73. pages_to_mb(max_low_pfn));
  74. printk(KERN_DEBUG "max_low_pfn = %lx, highstart_pfn = %lx\n",
  75. max_low_pfn, highstart_pfn);
  76. printk(KERN_DEBUG "Low memory ends at vaddr %08lx\n",
  77. (ulong) pfn_to_kaddr(max_low_pfn));
  78. printk(KERN_DEBUG "High memory starts at vaddr %08lx\n",
  79. (ulong) pfn_to_kaddr(highstart_pfn));
  80. __vmalloc_start_set = true;
  81. setup_bootmem_allocator();
  82. }