Subversion Repositories HelenOS

Rev

Rev 2089 | Rev 2292 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1889 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2006 Jakub Jermar
1889 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 sparc64mm  
30
 * @{
31
 */
32
/** @file
33
 */
34
 
35
#include <arch/mm/tsb.h>
1891 jermar 36
#include <arch/mm/tlb.h>
37
#include <arch/barrier.h>
1889 jermar 38
#include <mm/as.h>
39
#include <arch/types.h>
1891 jermar 40
#include <macros.h>
41
#include <debug.h>
1889 jermar 42
 
2048 jermar 43
#define TSB_INDEX_MASK      ((1 << (21 + 1 + TSB_SIZE - PAGE_WIDTH)) - 1)
1891 jermar 44
 
1889 jermar 45
/** Invalidate portion of TSB.
46
 *
2048 jermar 47
 * We assume that the address space is already locked. Note that respective
48
 * portions of both TSBs are invalidated at a time.
1889 jermar 49
 *
50
 * @param as Address space.
51
 * @param page First page to invalidate in TSB.
2048 jermar 52
 * @param pages Number of pages to invalidate. Value of (count_t) -1 means the
53
 *  whole TSB.
1889 jermar 54
 */
55
void tsb_invalidate(as_t *as, uintptr_t page, count_t pages)
56
{
1891 jermar 57
    index_t i0, i;
58
    count_t cnt;
59
 
60
    ASSERT(as->arch.itsb && as->arch.dtsb);
61
 
62
    i0 = (page >> PAGE_WIDTH) & TSB_INDEX_MASK;
63
    cnt = min(pages, ITSB_ENTRY_COUNT);
64
 
65
    for (i = 0; i < cnt; i++) {
2048 jermar 66
        as->arch.itsb[(i0 + i) & (ITSB_ENTRY_COUNT - 1)].tag.invalid =
67
            true;
68
        as->arch.dtsb[(i0 + i) & (DTSB_ENTRY_COUNT - 1)].tag.invalid =
69
            true;
1891 jermar 70
    }
1889 jermar 71
}
72
 
1891 jermar 73
/** Copy software PTE to ITSB.
74
 *
75
 * @param t Software PTE.
76
 */
77
void itsb_pte_copy(pte_t *t)
78
{
79
    as_t *as;
80
    tsb_entry_t *tsb;
81
 
82
    as = t->as;
83
    tsb = &as->arch.itsb[(t->page >> PAGE_WIDTH) & TSB_INDEX_MASK];
84
 
85
    /*
86
     * We use write barriers to make sure that the TSB load
87
     * won't use inconsistent data or that the fault will
88
     * be repeated.
89
     */
90
 
1960 jermar 91
    tsb->tag.invalid = true;    /* invalidate the entry
92
                     * (tag target has this
93
                     * set to 0) */
1891 jermar 94
 
95
    write_barrier();
96
 
97
    tsb->tag.context = as->asid;
98
    tsb->tag.va_tag = t->page >> VA_TAG_PAGE_SHIFT;
99
    tsb->data.value = 0;
100
    tsb->data.size = PAGESIZE_8K;
2001 jermar 101
    tsb->data.pfn = t->frame >> FRAME_WIDTH;
1891 jermar 102
    tsb->data.cp = t->c;
1960 jermar 103
    tsb->data.p = t->k;     /* p as privileged */
1891 jermar 104
    tsb->data.v = t->p;
105
 
106
    write_barrier();
107
 
1960 jermar 108
    tsb->tag.invalid = false;   /* mark the entry as valid */
1891 jermar 109
}
110
 
111
/** Copy software PTE to DTSB.
112
 *
113
 * @param t Software PTE.
114
 * @param ro If true, the mapping is copied read-only.
115
 */
116
void dtsb_pte_copy(pte_t *t, bool ro)
117
{
118
    as_t *as;
119
    tsb_entry_t *tsb;
120
 
121
    as = t->as;
122
    tsb = &as->arch.dtsb[(t->page >> PAGE_WIDTH) & TSB_INDEX_MASK];
123
 
124
    /*
125
     * We use write barriers to make sure that the TSB load
126
     * won't use inconsistent data or that the fault will
127
     * be repeated.
128
     */
129
 
1960 jermar 130
    tsb->tag.invalid = true;    /* invalidate the entry
131
                     * (tag target has this
132
                     * set to 0) */
1891 jermar 133
 
134
    write_barrier();
135
 
136
    tsb->tag.context = as->asid;
137
    tsb->tag.va_tag = t->page >> VA_TAG_PAGE_SHIFT;
138
    tsb->data.value = 0;
139
    tsb->data.size = PAGESIZE_8K;
2001 jermar 140
    tsb->data.pfn = t->frame >> FRAME_WIDTH;
1891 jermar 141
    tsb->data.cp = t->c;
2009 jermar 142
#ifdef CONFIG_VIRT_IDX_DCACHE
1891 jermar 143
    tsb->data.cv = t->c;
2009 jermar 144
#endif /* CONFIG_VIRT_IDX_DCACHE */
1960 jermar 145
    tsb->data.p = t->k;     /* p as privileged */
1891 jermar 146
    tsb->data.w = ro ? false : t->w;
147
    tsb->data.v = t->p;
148
 
149
    write_barrier();
150
 
1960 jermar 151
    tsb->tag.invalid = true;    /* mark the entry as valid */
1891 jermar 152
}
153
 
1889 jermar 154
/** @}
155
 */