Rev 1210 | Rev 1702 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 1210 | Rev 1290 | ||
|---|---|---|---|
| - | 1 | /* |
|
| - | 2 | * Copyright (C) 2006 Jakub Vana |
|
| - | 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 | ||
| 1 | #include <arch/mm/vhpt.h> |
30 | #include <arch/mm/vhpt.h> |
| 2 | #include <mm/frame.h> |
31 | #include <mm/frame.h> |
| 3 | #include <print.h> |
32 | #include <print.h> |
| 4 | 33 | ||
| 5 | 34 | ||
| 6 | static vhpt_entry_t* vhpt_base; |
35 | static vhpt_entry_t* vhpt_base; |
| 7 | 36 | ||
| 8 | __address vhpt_set_up(void) |
37 | __address vhpt_set_up(void) |
| 9 | { |
38 | { |
| 10 | vhpt_base=(vhpt_entry_t*) PA2KA(PFN2ADDR(frame_alloc(VHPT_WIDTH-FRAME_WIDTH,FRAME_KA))); |
39 | vhpt_base=(vhpt_entry_t*) PA2KA(PFN2ADDR(frame_alloc(VHPT_WIDTH-FRAME_WIDTH,FRAME_KA))); |
| 11 | if(!vhpt_base) panic("Kernel configured with VHPT but no memory for table."); |
40 | if(!vhpt_base) panic("Kernel configured with VHPT but no memory for table."); |
| 12 | vhpt_invalidate_all(); |
41 | vhpt_invalidate_all(); |
| 13 | return (__address) vhpt_base; |
42 | return (__address) vhpt_base; |
| 14 | } |
43 | } |
| 15 | 44 | ||
| 16 | 45 | ||
| 17 | void vhpt_mapping_insert(__address va, asid_t asid, tlb_entry_t entry) |
46 | void vhpt_mapping_insert(__address va, asid_t asid, tlb_entry_t entry) |
| 18 | { |
47 | { |
| 19 | region_register rr_save, rr; |
48 | region_register rr_save, rr; |
| 20 | index_t vrn; |
49 | index_t vrn; |
| 21 | rid_t rid; |
50 | rid_t rid; |
| 22 | __u64 tag; |
51 | __u64 tag; |
| 23 | 52 | ||
| 24 | vhpt_entry_t *ventry; |
53 | vhpt_entry_t *ventry; |
| 25 | 54 | ||
| 26 | 55 | ||
| 27 | vrn = va >> VRN_SHIFT; |
56 | vrn = va >> VRN_SHIFT; |
| 28 | rid = ASID2RID(asid, vrn); |
57 | rid = ASID2RID(asid, vrn); |
| 29 | 58 | ||
| 30 | rr_save.word = rr_read(vrn); |
59 | rr_save.word = rr_read(vrn); |
| 31 | rr.word = rr_save.word; |
60 | rr.word = rr_save.word; |
| 32 | rr.map.rid = rid; |
61 | rr.map.rid = rid; |
| 33 | rr_write(vrn, rr.word); |
62 | rr_write(vrn, rr.word); |
| 34 | srlz_i(); |
63 | srlz_i(); |
| 35 | 64 | ||
| 36 | ventry = (vhpt_entry_t *) thash(va); |
65 | ventry = (vhpt_entry_t *) thash(va); |
| 37 | tag = ttag(va); |
66 | tag = ttag(va); |
| 38 | rr_write(vrn, rr_save.word); |
67 | rr_write(vrn, rr_save.word); |
| 39 | srlz_i(); |
68 | srlz_i(); |
| 40 | srlz_d(); |
69 | srlz_d(); |
| 41 | 70 | ||
| 42 | ventry->word[0]=entry.word[0]; |
71 | ventry->word[0]=entry.word[0]; |
| 43 | ventry->word[1]=entry.word[1]; |
72 | ventry->word[1]=entry.word[1]; |
| 44 | ventry->present.tag.tag_word = tag; |
73 | ventry->present.tag.tag_word = tag; |
| 45 | 74 | ||
| 46 | 75 | ||
| 47 | } |
76 | } |
| 48 | 77 | ||
| 49 | void vhpt_invalidate_all() |
78 | void vhpt_invalidate_all() |
| 50 | { |
79 | { |
| 51 | memsetb((__address)vhpt_base,1<<VHPT_WIDTH,0); |
80 | memsetb((__address)vhpt_base,1<<VHPT_WIDTH,0); |
| 52 | } |
81 | } |
| 53 | 82 | ||
| 54 | void vhpt_invalidate_asid(asid_t asid) |
83 | void vhpt_invalidate_asid(asid_t asid) |
| 55 | { |
84 | { |
| 56 | vhpt_invalidate_all(); |
85 | vhpt_invalidate_all(); |
| 57 | } |
86 | } |
| 58 | 87 | ||
| 59 | 88 | ||
| 60 | 89 | ||