Subversion Repositories HelenOS-historic

Rev

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

  1. /*
  2.  * Copyright (C) 2006 Jakub Jermar
  3.  * Copyright (C) 2006 Jakub Vana
  4.  * All rights reserved.
  5.  *
  6.  * Redistribution and use in source and binary forms, with or without
  7.  * modification, are permitted provided that the following conditions
  8.  * are met:
  9.  *
  10.  * - Redistributions of source code must retain the above copyright
  11.  *   notice, this list of conditions and the following disclaimer.
  12.  * - Redistributions in binary form must reproduce the above copyright
  13.  *   notice, this list of conditions and the following disclaimer in the
  14.  *   documentation and/or other materials provided with the distribution.
  15.  * - The name of the author may not be used to endorse or promote products
  16.  *   derived from this software without specific prior written permission.
  17.  *
  18.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  19.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  20.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  21.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  22.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  23.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  24.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  25.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  27.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28.  */
  29.  
  30. #include <arch/mm/page.h>
  31. #include <genarch/mm/page_ht.h>
  32. #include <mm/asid.h>
  33. #include <arch/mm/asid.h>
  34. #include <arch/mm/vhpt.h>
  35. #include <arch/types.h>
  36. #include <typedefs.h>
  37. #include <print.h>
  38. #include <mm/page.h>
  39. #include <mm/frame.h>
  40. #include <config.h>
  41. #include <panic.h>
  42. #include <arch/asm.h>
  43. #include <arch/barrier.h>
  44. #include <memstr.h>
  45.  
  46. static void set_environment(void);
  47.  
  48. /** Initialize ia64 virtual address translation subsystem. */
  49. void page_arch_init(void)
  50. {
  51.     page_mapping_operations = &ht_mapping_operations;
  52.     pk_disable();
  53.     set_environment();
  54. }
  55.  
  56. /** Initialize VHPT and region registers. */
  57. void set_environment(void)
  58. {
  59.     region_register rr;
  60.     pta_register pta;  
  61.     int i;
  62. #ifdef CONFIG_VHPT 
  63.     __address vhpt_base;
  64. #endif
  65.  
  66.     /*
  67.      * First set up kernel region register.
  68.      * This is redundant (see start.S) but we keep it here just for sure.
  69.      */
  70.     rr.word = rr_read(VRN_KERNEL);
  71.     rr.map.ve = 0;                  /* disable VHPT walker */
  72.     rr.map.ps = PAGE_WIDTH;
  73.     rr.map.rid = ASID2RID(ASID_KERNEL, VRN_KERNEL);
  74.     rr_write(VRN_KERNEL, rr.word);
  75.     srlz_i();
  76.     srlz_d();
  77.  
  78.     /*
  79.      * And setup the rest of region register.
  80.      */
  81.     for(i = 0; i < REGION_REGISTERS; i++) {
  82.         /* skip kernel rr */
  83.         if (i == VRN_KERNEL)
  84.             continue;
  85.    
  86.         rr.word = rr_read(i);
  87.         rr.map.ve = 0;      /* disable VHPT walker */
  88.         rr.map.rid = RID_KERNEL;
  89.         rr.map.ps = PAGE_WIDTH;
  90.         rr_write(i, rr.word);
  91.         srlz_i();
  92.         srlz_d();
  93.     }
  94.  
  95. #ifdef CONFIG_VHPT 
  96.     vhpt_base = vhpt_set_up();
  97. #endif
  98.     /*
  99.      * Set up PTA register.
  100.      */
  101.     pta.word = pta_read();
  102. #ifndef CONFIG_VHPT
  103.     pta.map.ve = 0;                   /* disable VHPT walker */
  104.     pta.map.base = 0 >> PTA_BASE_SHIFT;
  105. #else
  106.     pta.map.ve = 1;                   /* enable VHPT walker */
  107.     pta.map.base = vhpt_base >> PTA_BASE_SHIFT;
  108. #endif
  109.     pta.map.vf = 1;                   /* large entry format */
  110.     pta.map.size = VHPT_WIDTH;
  111.     pta_write(pta.word);
  112.     srlz_i();
  113.     srlz_d();
  114. }
  115.  
  116. /** Calculate address of collision chain from VPN and ASID.
  117.  *
  118.  * Interrupts must be disabled.
  119.  *
  120.  * @param page Address of virtual page including VRN bits.
  121.  * @param asid Address space identifier.
  122.  *
  123.  * @return VHPT entry address.
  124.  */
  125. vhpt_entry_t *vhpt_hash(__address page, asid_t asid)
  126. {
  127.     region_register rr_save, rr;
  128.     index_t vrn;
  129.     rid_t rid;
  130.     vhpt_entry_t *v;
  131.  
  132.     vrn = page >> VRN_SHIFT;
  133.     rid = ASID2RID(asid, vrn);
  134.    
  135.     rr_save.word = rr_read(vrn);
  136.     if (rr_save.map.rid == rid) {
  137.         /*
  138.          * The RID is already in place, compute thash and return.
  139.          */
  140.         v = (vhpt_entry_t *) thash(page);
  141.         return v;
  142.     }
  143.    
  144.     /*
  145.      * The RID must be written to some region register.
  146.      * To speed things up, register indexed by vrn is used.
  147.      */
  148.     rr.word = rr_save.word;
  149.     rr.map.rid = rid;
  150.     rr_write(vrn, rr.word);
  151.     srlz_i();
  152.     v = (vhpt_entry_t *) thash(page);
  153.     rr_write(vrn, rr_save.word);
  154.     srlz_i();
  155.     srlz_d();
  156.  
  157.     return v;
  158. }
  159.  
  160. /** Compare ASID and VPN against PTE.
  161.  *
  162.  * Interrupts must be disabled.
  163.  *
  164.  * @param page Address of virtual page including VRN bits.
  165.  * @param asid Address space identifier.
  166.  *
  167.  * @return True if page and asid match the page and asid of t, false otherwise.
  168.  */
  169. bool vhpt_compare(__address page, asid_t asid, vhpt_entry_t *v)
  170. {
  171.     region_register rr_save, rr;   
  172.     index_t vrn;
  173.     rid_t rid;
  174.     bool match;
  175.  
  176.     ASSERT(v);
  177.  
  178.     vrn = page >> VRN_SHIFT;
  179.     rid = ASID2RID(asid, vrn);
  180.    
  181.     rr_save.word = rr_read(vrn);
  182.     if (rr_save.map.rid == rid) {
  183.         /*
  184.          * The RID is already in place, compare ttag with t and return.
  185.          */
  186.         return ttag(page) == v->present.tag.tag_word;
  187.     }
  188.    
  189.     /*
  190.      * The RID must be written to some region register.
  191.      * To speed things up, register indexed by vrn is used.
  192.      */
  193.     rr.word = rr_save.word;
  194.     rr.map.rid = rid;
  195.     rr_write(vrn, rr.word);
  196.     srlz_i();
  197.     match = (ttag(page) == v->present.tag.tag_word);
  198.     rr_write(vrn, rr_save.word);
  199.     srlz_i();
  200.     srlz_d();
  201.  
  202.     return match;      
  203. }
  204.  
  205. /** Set up one VHPT entry.
  206.  *
  207.  * @param t VHPT entry to be set up.
  208.  * @param page Virtual address of the page mapped by the entry.
  209.  * @param asid Address space identifier of the address space to which page belongs.
  210.  * @param frame Physical address of the frame to wich page is mapped.
  211.  * @param flags Different flags for the mapping.
  212.  */
  213. void vhpt_set_record(vhpt_entry_t *v, __address page, asid_t asid, __address frame, int flags)
  214. {
  215.     region_register rr_save, rr;   
  216.     index_t vrn;
  217.     rid_t rid;
  218.     __u64 tag;
  219.  
  220.     ASSERT(v);
  221.  
  222.     vrn = page >> VRN_SHIFT;
  223.     rid = ASID2RID(asid, vrn);
  224.    
  225.     /*
  226.      * Compute ttag.
  227.      */
  228.     rr_save.word = rr_read(vrn);
  229.     rr.word = rr_save.word;
  230.     rr.map.rid = rid;
  231.     rr_write(vrn, rr.word);
  232.     srlz_i();
  233.     tag = ttag(page);
  234.     rr_write(vrn, rr_save.word);
  235.     srlz_i();
  236.     srlz_d();
  237.    
  238.     /*
  239.      * Clear the entry.
  240.      */
  241.     v->word[0] = 0;
  242.     v->word[1] = 0;
  243.     v->word[2] = 0;
  244.     v->word[3] = 0;
  245.    
  246.     v->present.p = true;
  247.     v->present.ma = (flags & PAGE_CACHEABLE) ? MA_WRITEBACK : MA_UNCACHEABLE;
  248.     v->present.a = false;   /* not accessed */
  249.     v->present.d = false;   /* not dirty */
  250.     v->present.pl = (flags & PAGE_USER) ? PL_USER : PL_KERNEL;
  251.     v->present.ar = (flags & PAGE_WRITE) ? AR_WRITE : AR_READ;
  252.     v->present.ar |= (flags & PAGE_EXEC) ? AR_EXECUTE : 0;
  253.     v->present.ppn = frame >> PPN_SHIFT;
  254.     v->present.ed = false;  /* exception not deffered */
  255.     v->present.ps = PAGE_WIDTH;
  256.     v->present.key = 0;
  257.     v->present.tag.tag_word = tag;
  258. }
  259.