Subversion Repositories HelenOS

Rev

Rev 195 | Go to most recent revision | Blame | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 Josef Cejka
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <arch/boot/memmap.h>
  30. #include <arch/mm/memory_init.h>
  31. #include <arch/mm/page.h>
  32. #include <print.h>
  33.  
  34. size_t get_memory_size(void)
  35. {
  36.     return e801memorysize*1024;
  37. }
  38.  
  39. void memory_print_map(void)
  40. {
  41.     __u8 i;
  42.    
  43.     /*
  44.      * We must not work with the original addresses for they are not mapped anymore.
  45.      */
  46.     struct e820memmap_ *memtable = (struct e820memmap_ *) PA2KA(e820table);
  47.     __u32 *counter_p = (__u32 *) PA2KA(&e820counter);
  48.    
  49.    
  50.     for (i=*counter_p;i>0;i--) {
  51.         printf("E820 base: %Q size: %Q type: ", memtable[i-1].base_address, memtable[i-1].size);
  52.         switch (memtable[i-1].type) {
  53.             case MEMMAP_MEMORY_AVAILABLE:
  54.                 printf("available memory\n");
  55.                 break;
  56.             case MEMMAP_MEMORY_RESERVED:
  57.                 printf("reserved memory\n");
  58.                 break;
  59.             case MEMMAP_MEMORY_ACPI:
  60.                 printf("ACPI table\n");
  61.                 break;
  62.             case MEMMAP_MEMORY_NVS:
  63.                 printf("NVS\n");
  64.                 break;
  65.             case MEMMAP_MEMORY_UNUSABLE:
  66.                 printf("unusable memory\n");
  67.                 break;
  68.             default:
  69.                 printf("undefined memory type\n");
  70.         }
  71.     }
  72.  
  73. }
  74.  
  75.