Subversion Repositories HelenOS

Rev

Rev 2131 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2131 Rev 2292
1
/*
1
/*
2
 * Copyright (c) 2006 Jakub Jermar
2
 * Copyright (c) 2006 Jakub Jermar
3
 * All rights reserved.
3
 * All rights reserved.
4
 *
4
 *
5
 * Redistribution and use in source and binary forms, with or without
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
6
 * modification, are permitted provided that the following conditions
7
 * are met:
7
 * are met:
8
 *
8
 *
9
 * - Redistributions of source code must retain the above copyright
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
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
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.
15
 *   derived from this software without specific prior written permission.
16
 *
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
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
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
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
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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
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.
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
27
 */
28
 
28
 
29
/** @addtogroup sparc64mm  
29
/** @addtogroup sparc64mm  
30
 * @{
30
 * @{
31
 */
31
 */
32
/** @file
32
/** @file
33
 */
33
 */
34
 
34
 
35
#include <arch/mm/tsb.h>
35
#include <arch/mm/tsb.h>
36
#include <arch/mm/tlb.h>
36
#include <arch/mm/tlb.h>
-
 
37
#include <arch/mm/page.h>
37
#include <arch/barrier.h>
38
#include <arch/barrier.h>
38
#include <mm/as.h>
39
#include <mm/as.h>
39
#include <arch/types.h>
40
#include <arch/types.h>
40
#include <macros.h>
41
#include <macros.h>
41
#include <debug.h>
42
#include <debug.h>
42
 
43
 
43
#define TSB_INDEX_MASK      ((1 << (21 + 1 + TSB_SIZE - PAGE_WIDTH)) - 1)
44
#define TSB_INDEX_MASK  ((1 << (21 + 1 + TSB_SIZE - MMU_PAGE_WIDTH)) - 1)
44
 
45
 
45
/** Invalidate portion of TSB.
46
/** Invalidate portion of TSB.
46
 *
47
 *
47
 * We assume that the address space is already locked. Note that respective
48
 * We assume that the address space is already locked. Note that respective
48
 * portions of both TSBs are invalidated at a time.
49
 * portions of both TSBs are invalidated at a time.
49
 *
50
 *
50
 * @param as Address space.
51
 * @param as Address space.
51
 * @param page First page to invalidate in TSB.
52
 * @param page First page to invalidate in TSB.
52
 * @param pages Number of pages to invalidate. Value of (count_t) -1 means the
53
 * @param pages Number of pages to invalidate. Value of (count_t) -1 means the
53
 *  whole TSB.
54
 *  whole TSB.
54
 */
55
 */
55
void tsb_invalidate(as_t *as, uintptr_t page, count_t pages)
56
void tsb_invalidate(as_t *as, uintptr_t page, count_t pages)
56
{
57
{
57
    index_t i0, i;
58
    index_t i0, i;
58
    count_t cnt;
59
    count_t cnt;
59
   
60
   
60
    ASSERT(as->arch.itsb && as->arch.dtsb);
61
    ASSERT(as->arch.itsb && as->arch.dtsb);
61
   
62
   
62
    i0 = (page >> PAGE_WIDTH) & TSB_INDEX_MASK;
63
    i0 = (page >> MMU_PAGE_WIDTH) & TSB_INDEX_MASK;
-
 
64
    if (pages == (count_t) -1 || (pages * 2) > ITSB_ENTRY_COUNT)
63
    cnt = min(pages, ITSB_ENTRY_COUNT);
65
        cnt = ITSB_ENTRY_COUNT;
-
 
66
    else
-
 
67
        cnt = pages * 2;
64
   
68
   
65
    for (i = 0; i < cnt; i++) {
69
    for (i = 0; i < cnt; i++) {
66
        as->arch.itsb[(i0 + i) & (ITSB_ENTRY_COUNT - 1)].tag.invalid =
70
        as->arch.itsb[(i0 + i) & (ITSB_ENTRY_COUNT - 1)].tag.invalid =
67
            true;
71
            true;
68
        as->arch.dtsb[(i0 + i) & (DTSB_ENTRY_COUNT - 1)].tag.invalid =
72
        as->arch.dtsb[(i0 + i) & (DTSB_ENTRY_COUNT - 1)].tag.invalid =
69
            true;
73
            true;
70
    }
74
    }
71
}
75
}
72
 
76
 
73
/** Copy software PTE to ITSB.
77
/** Copy software PTE to ITSB.
74
 *
78
 *
75
 * @param t Software PTE.
79
 * @param t     Software PTE.
-
 
80
 * @param index Zero if lower 8K-subpage, one if higher 8K subpage.
76
 */
81
 */
77
void itsb_pte_copy(pte_t *t)
82
void itsb_pte_copy(pte_t *t, index_t index)
78
{
83
{
79
    as_t *as;
84
    as_t *as;
80
    tsb_entry_t *tsb;
85
    tsb_entry_t *tsb;
-
 
86
    index_t entry;
81
   
87
   
82
    as = t->as;
88
    as = t->as;
83
    tsb = &as->arch.itsb[(t->page >> PAGE_WIDTH) & TSB_INDEX_MASK];
89
    entry = ((t->page >> MMU_PAGE_WIDTH) + index) & TSB_INDEX_MASK;
-
 
90
    tsb = &as->arch.itsb[entry];
84
 
91
 
85
    /*
92
    /*
86
     * We use write barriers to make sure that the TSB load
93
     * We use write barriers to make sure that the TSB load
87
     * won't use inconsistent data or that the fault will
94
     * won't use inconsistent data or that the fault will
88
     * be repeated.
95
     * be repeated.
89
     */
96
     */
90
 
97
 
91
    tsb->tag.invalid = true;    /* invalidate the entry
98
    tsb->tag.invalid = true;    /* invalidate the entry
92
                     * (tag target has this
99
                     * (tag target has this
93
                     * set to 0) */
100
                     * set to 0) */
94
 
101
 
95
    write_barrier();
102
    write_barrier();
96
 
103
 
97
    tsb->tag.context = as->asid;
104
    tsb->tag.context = as->asid;
98
    tsb->tag.va_tag = t->page >> VA_TAG_PAGE_SHIFT;
105
    tsb->tag.va_tag = (t->page + (index << MMU_PAGE_WIDTH)) >>
-
 
106
        VA_TAG_PAGE_SHIFT;
99
    tsb->data.value = 0;
107
    tsb->data.value = 0;
100
    tsb->data.size = PAGESIZE_8K;
108
    tsb->data.size = PAGESIZE_8K;
101
    tsb->data.pfn = t->frame >> FRAME_WIDTH;
109
    tsb->data.pfn = (t->frame >> MMU_FRAME_WIDTH) + index;
102
    tsb->data.cp = t->c;
110
    tsb->data.cp = t->c;
103
    tsb->data.p = t->k;     /* p as privileged */
111
    tsb->data.p = t->k;     /* p as privileged */
104
    tsb->data.v = t->p;
112
    tsb->data.v = t->p;
105
   
113
   
106
    write_barrier();
114
    write_barrier();
107
   
115
   
108
    tsb->tag.invalid = false;   /* mark the entry as valid */
116
    tsb->tag.invalid = false;   /* mark the entry as valid */
109
}
117
}
110
 
118
 
111
/** Copy software PTE to DTSB.
119
/** Copy software PTE to DTSB.
112
 *
120
 *
113
 * @param t Software PTE.
121
 * @param t Software PTE.
-
 
122
 * @param index Zero if lower 8K-subpage, one if higher 8K-subpage.
114
 * @param ro If true, the mapping is copied read-only.
123
 * @param ro    If true, the mapping is copied read-only.
115
 */
124
 */
116
void dtsb_pte_copy(pte_t *t, bool ro)
125
void dtsb_pte_copy(pte_t *t, index_t index, bool ro)
117
{
126
{
118
    as_t *as;
127
    as_t *as;
119
    tsb_entry_t *tsb;
128
    tsb_entry_t *tsb;
-
 
129
    index_t entry;
120
   
130
   
121
    as = t->as;
131
    as = t->as;
122
    tsb = &as->arch.dtsb[(t->page >> PAGE_WIDTH) & TSB_INDEX_MASK];
132
    entry = ((t->page >> MMU_PAGE_WIDTH) + index) & TSB_INDEX_MASK;
-
 
133
    tsb = &as->arch.dtsb[entry];
123
 
134
 
124
    /*
135
    /*
125
     * We use write barriers to make sure that the TSB load
136
     * We use write barriers to make sure that the TSB load
126
     * won't use inconsistent data or that the fault will
137
     * won't use inconsistent data or that the fault will
127
     * be repeated.
138
     * be repeated.
128
     */
139
     */
129
 
140
 
130
    tsb->tag.invalid = true;    /* invalidate the entry
141
    tsb->tag.invalid = true;    /* invalidate the entry
131
                     * (tag target has this
142
                     * (tag target has this
132
                     * set to 0) */
143
                     * set to 0) */
133
 
144
 
134
    write_barrier();
145
    write_barrier();
135
 
146
 
136
    tsb->tag.context = as->asid;
147
    tsb->tag.context = as->asid;
137
    tsb->tag.va_tag = t->page >> VA_TAG_PAGE_SHIFT;
148
    tsb->tag.va_tag = (t->page + (index << MMU_PAGE_WIDTH)) >>
-
 
149
        VA_TAG_PAGE_SHIFT;
138
    tsb->data.value = 0;
150
    tsb->data.value = 0;
139
    tsb->data.size = PAGESIZE_8K;
151
    tsb->data.size = PAGESIZE_8K;
140
    tsb->data.pfn = t->frame >> FRAME_WIDTH;
152
    tsb->data.pfn = (t->frame >> MMU_FRAME_WIDTH) + index;
141
    tsb->data.cp = t->c;
153
    tsb->data.cp = t->c;
142
#ifdef CONFIG_VIRT_IDX_DCACHE
154
#ifdef CONFIG_VIRT_IDX_DCACHE
143
    tsb->data.cv = t->c;
155
    tsb->data.cv = t->c;
144
#endif /* CONFIG_VIRT_IDX_DCACHE */
156
#endif /* CONFIG_VIRT_IDX_DCACHE */
145
    tsb->data.p = t->k;     /* p as privileged */
157
    tsb->data.p = t->k;     /* p as privileged */
146
    tsb->data.w = ro ? false : t->w;
158
    tsb->data.w = ro ? false : t->w;
147
    tsb->data.v = t->p;
159
    tsb->data.v = t->p;
148
   
160
   
149
    write_barrier();
161
    write_barrier();
150
   
162
   
151
    tsb->tag.invalid = true;    /* mark the entry as valid */
163
    tsb->tag.invalid = false;   /* mark the entry as valid */
152
}
164
}
153
 
165
 
154
/** @}
166
/** @}
155
 */
167
 */
156
 
168