Subversion Repositories HelenOS

Rev

Rev 3386 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2005 Jakub Jermar
  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. /** @addtogroup mips32mm
  30.  * @{
  31.  */
  32. /** @file
  33.  */
  34.  
  35. #include <macros.h>
  36. #include <arch/mm/frame.h>
  37. #include <arch/mm/tlb.h>
  38. #include <interrupt.h>
  39. #include <mm/frame.h>
  40. #include <mm/asid.h>
  41. #include <config.h>
  42. #include <arch/drivers/msim.h>
  43. #include <print.h>
  44.  
  45. #define ZERO_PAGE_MASK    TLB_PAGE_MASK_256K
  46. #define ZERO_FRAMES       2048
  47. #define ZERO_PAGE_WIDTH   18  /* 256K */
  48. #define ZERO_PAGE_SIZE    (1 << ZERO_PAGE_WIDTH)
  49. #define ZERO_PAGE_ASID    ASID_INVALID
  50. #define ZERO_PAGE_TLBI    0
  51. #define ZERO_PAGE_ADDR    0
  52. #define ZERO_PAGE_OFFSET  (ZERO_PAGE_SIZE / sizeof(uint32_t) - 1)
  53. #define ZERO_PAGE_VALUE   (((volatile uint32_t *) ZERO_PAGE_ADDR)[ZERO_PAGE_OFFSET])
  54.  
  55. #define ZERO_PAGE_VALUE_KSEG1(frame) \
  56.     (((volatile uint32_t *) (0xa0000000 + (frame << ZERO_PAGE_WIDTH)))[ZERO_PAGE_OFFSET])
  57.  
  58. #define MAX_REGIONS  32
  59.  
  60. typedef struct {
  61.     pfn_t start;
  62.     pfn_t count;
  63. } phys_region_t;
  64.  
  65. static count_t phys_regions_count = 0;
  66. static phys_region_t phys_regions[MAX_REGIONS];
  67.  
  68. /** Check whether frame is available
  69.  *
  70.  * Returns true if given frame is generally available for use.
  71.  * Returns false if given frame is used for physical memory
  72.  * mapped devices and cannot be used.
  73.  *
  74.  */
  75. static bool frame_available(pfn_t frame)
  76. {
  77. #ifdef MACHINE_msim
  78.     /* MSIM device (dprinter) */
  79.     if (frame == (KA2PA(MSIM_VIDEORAM) >> ZERO_PAGE_WIDTH))
  80.         return false;
  81.    
  82.     /* MSIM device (dkeyboard) */
  83.     if (frame == (KA2PA(MSIM_KBD_ADDRESS) >> ZERO_PAGE_WIDTH))
  84.         return false;
  85. #endif
  86.    
  87. #if defined(MACHINE_lgxemul) || defined(MACHINE_bgxemul)
  88.     /* gxemul devices */
  89.     if (overlaps(frame << ZERO_PAGE_WIDTH, ZERO_PAGE_SIZE,
  90.         0x10000000, MB2SIZE(256)))
  91.         return false;
  92. #endif
  93.    
  94.     return true;
  95. }
  96.  
  97.  
  98. /** Check whether frame is safe to write
  99.  *
  100.  * Returns true if given frame is safe for read/write test.
  101.  * Returns false if given frame should not be touched.
  102.  *
  103.  */
  104. static bool frame_safe(pfn_t frame)
  105. {
  106.     /* Kernel structures */
  107.     if ((frame << ZERO_PAGE_WIDTH) < KA2PA(config.base))
  108.         return false;
  109.    
  110.     /* Kernel */
  111.     if (overlaps(frame << ZERO_PAGE_WIDTH, ZERO_PAGE_SIZE,
  112.         KA2PA(config.base), config.kernel_size))
  113.         return false;
  114.    
  115.     /* Kernel stack */
  116.     if (overlaps(frame << ZERO_PAGE_WIDTH, ZERO_PAGE_SIZE,
  117.         KA2PA(config.stack_base), config.stack_size))
  118.         return false;
  119.    
  120.     /* Init tasks */
  121.     bool safe = true;
  122.     count_t i;
  123.     for (i = 0; i < init.cnt; i++)
  124.         if (overlaps(frame << ZERO_PAGE_WIDTH, ZERO_PAGE_SIZE,
  125.             KA2PA(init.tasks[i].addr), init.tasks[i].size)) {
  126.             safe = false;
  127.             break;
  128.         }
  129.    
  130.     return safe;
  131. }
  132.  
  133. static void frame_add_region(pfn_t start_frame, pfn_t end_frame)
  134. {
  135.     if (end_frame > start_frame) {
  136.         /* Convert 1M frames to 16K frames */
  137.         pfn_t first = ADDR2PFN(start_frame << ZERO_PAGE_WIDTH);
  138.         pfn_t count = ADDR2PFN((end_frame - start_frame) << ZERO_PAGE_WIDTH);
  139.        
  140.         /* Interrupt vector frame is blacklisted */
  141.         pfn_t conf_frame;
  142.         if (first == 0)
  143.             conf_frame = 1;
  144.         else
  145.             conf_frame = first;
  146.        
  147.         zone_create(first, count, conf_frame, 0);
  148.        
  149.         if (phys_regions_count < MAX_REGIONS) {
  150.             phys_regions[phys_regions_count].start = first;
  151.             phys_regions[phys_regions_count].count = count;
  152.             phys_regions_count++;
  153.         }
  154.     }
  155. }
  156.  
  157.  
  158. /** Create memory zones
  159.  *
  160.  * Walk through available 256 KB chunks of physical
  161.  * memory and create zones.
  162.  *
  163.  * Note: It is assumed that the TLB is not yet being
  164.  * used in any way, thus there is no interference.
  165.  *
  166.  */
  167. void frame_arch_init(void)
  168. {
  169.     ipl_t ipl = interrupts_disable();
  170.    
  171.     /* Clear and initialize TLB */
  172.     cp0_pagemask_write(ZERO_PAGE_MASK);
  173.     cp0_entry_lo0_write(0);
  174.     cp0_entry_lo1_write(0);
  175.     cp0_entry_hi_write(0);
  176.  
  177.     count_t i;
  178.     for (i = 0; i < TLB_ENTRY_COUNT; i++) {
  179.         cp0_index_write(i);
  180.         tlbwi();
  181.     }
  182.        
  183.     pfn_t start_frame = 0;
  184.     pfn_t frame;
  185.     bool avail = true;
  186.    
  187.     /* Walk through all 1 MB frames */
  188.     for (frame = 0; frame < ZERO_FRAMES; frame++) {
  189.         if (!frame_available(frame))
  190.             avail = false;
  191.         else {
  192.             if (frame_safe(frame)) {
  193.                 entry_lo_t lo0;
  194.                 entry_lo_t lo1;
  195.                 entry_hi_t hi;
  196.                 tlb_prepare_entry_lo(&lo0, false, true, true, false, frame << (ZERO_PAGE_WIDTH - 12));
  197.                 tlb_prepare_entry_lo(&lo1, false, false, false, false, 0);
  198.                 tlb_prepare_entry_hi(&hi, ZERO_PAGE_ASID, ZERO_PAGE_ADDR);
  199.                
  200.                 cp0_pagemask_write(ZERO_PAGE_MASK);
  201.                 cp0_entry_lo0_write(lo0.value);
  202.                 cp0_entry_lo1_write(lo1.value);
  203.                 cp0_entry_hi_write(hi.value);
  204.                 cp0_index_write(ZERO_PAGE_TLBI);
  205.                 tlbwi();
  206.                
  207.                 ZERO_PAGE_VALUE = 0;
  208.                 if (ZERO_PAGE_VALUE != 0)
  209.                     avail = false;
  210.                 else {
  211.                     ZERO_PAGE_VALUE = 0xdeadbeef;
  212.                     if (ZERO_PAGE_VALUE != 0xdeadbeef)
  213.                         avail = false;
  214. #if defined(MACHINE_lgxemul) || defined(MACHINE_bgxemul)
  215.                     else {
  216.                         ZERO_PAGE_VALUE_KSEG1(frame) = 0xaabbccdd;
  217.                         if (ZERO_PAGE_VALUE_KSEG1(frame) != 0xaabbccdd)
  218.                             avail = false;
  219.                     }
  220. #endif
  221.                 }
  222.             }
  223.         }
  224.        
  225.         if (!avail) {
  226.             frame_add_region(start_frame, frame);
  227.             start_frame = frame + 1;
  228.             avail = true;
  229.         }
  230.     }
  231.    
  232.     frame_add_region(start_frame, frame);
  233.    
  234.     /* Blacklist interrupt vector frame */
  235.     frame_mark_unavailable(0, 1);
  236.    
  237.     /* Cleanup */
  238.     cp0_pagemask_write(ZERO_PAGE_MASK);
  239.     cp0_entry_lo0_write(0);
  240.     cp0_entry_lo1_write(0);
  241.     cp0_entry_hi_write(0);
  242.     cp0_index_write(ZERO_PAGE_TLBI);
  243.     tlbwi();
  244.    
  245.     interrupts_restore(ipl);
  246. }
  247.  
  248.  
  249. void physmem_print(void)
  250. {
  251.     printf("Base       Size\n");
  252.     printf("---------- ----------\n");
  253.    
  254.     count_t i;
  255.     for (i = 0; i < phys_regions_count; i++) {
  256.         printf("%#010x %10u\n",
  257.             PFN2ADDR(phys_regions[i].start), PFN2ADDR(phys_regions[i].count));
  258.     }  
  259. }
  260.  
  261. /** @}
  262.  */
  263.