Subversion Repositories HelenOS-historic

Rev

Rev 1702 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1702 Rev 1705
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 ia64mm ia64
29
 /** @addtogroup ia64mm
30
  * @ingroup mm
-
 
31
 * @{
30
 * @{
32
 */
31
 */
33
/** @file
32
/** @file
34
  * @ingroup ia64
-
 
35
 */
33
 */
36
 
34
 
37
#include <arch/mm/as.h>
35
#include <arch/mm/as.h>
38
#include <arch/mm/asid.h>
36
#include <arch/mm/asid.h>
39
#include <arch/mm/page.h>
37
#include <arch/mm/page.h>
40
#include <genarch/mm/as_ht.h>
38
#include <genarch/mm/as_ht.h>
41
#include <genarch/mm/asid_fifo.h>
39
#include <genarch/mm/asid_fifo.h>
42
#include <mm/asid.h>
40
#include <mm/asid.h>
43
#include <arch.h>
41
#include <arch.h>
44
#include <arch/barrier.h>
42
#include <arch/barrier.h>
45
#include <synch/spinlock.h>
43
#include <synch/spinlock.h>
46
 
44
 
47
/** Architecture dependent address space init. */
45
/** Architecture dependent address space init. */
48
void as_arch_init(void)
46
void as_arch_init(void)
49
{
47
{
50
    as_operations = &as_ht_operations;
48
    as_operations = &as_ht_operations;
51
    asid_fifo_init();
49
    asid_fifo_init();
52
}
50
}
53
 
51
 
54
/** Prepare registers for switching to another address space.
52
/** Prepare registers for switching to another address space.
55
 *
53
 *
56
 * @param as Address space.
54
 * @param as Address space.
57
 */
55
 */
58
void as_install_arch(as_t *as)
56
void as_install_arch(as_t *as)
59
{
57
{
60
    ipl_t ipl;
58
    ipl_t ipl;
61
    region_register rr;
59
    region_register rr;
62
    int i;
60
    int i;
63
   
61
   
64
    ipl = interrupts_disable();
62
    ipl = interrupts_disable();
65
    spinlock_lock(&as->lock);
63
    spinlock_lock(&as->lock);
66
   
64
   
67
    ASSERT(as->asid != ASID_INVALID);
65
    ASSERT(as->asid != ASID_INVALID);
68
   
66
   
69
    /*
67
    /*
70
     * Load respective ASID (7 consecutive RIDs) to
68
     * Load respective ASID (7 consecutive RIDs) to
71
     * region registers.
69
     * region registers.
72
     */
70
     */
73
    for (i = 0; i < REGION_REGISTERS; i++) {
71
    for (i = 0; i < REGION_REGISTERS; i++) {
74
        if (i == VRN_KERNEL)
72
        if (i == VRN_KERNEL)
75
            continue;
73
            continue;
76
       
74
       
77
        rr.word = rr_read(i);
75
        rr.word = rr_read(i);
78
        rr.map.ve = false;          /* disable VHPT walker */
76
        rr.map.ve = false;          /* disable VHPT walker */
79
        rr.map.rid = ASID2RID(as->asid, i);
77
        rr.map.rid = ASID2RID(as->asid, i);
80
        rr.map.ps = PAGE_WIDTH;
78
        rr.map.ps = PAGE_WIDTH;
81
        rr_write(i, rr.word);
79
        rr_write(i, rr.word);
82
    }
80
    }
83
    srlz_d();
81
    srlz_d();
84
    srlz_i();
82
    srlz_i();
85
   
83
   
86
    spinlock_unlock(&as->lock);
84
    spinlock_unlock(&as->lock);
87
    interrupts_restore(ipl);
85
    interrupts_restore(ipl);
88
}
86
}
89
 
87
 
90
 /** @}
88
 /** @}
91
 */
89
 */
92
 
90
 
93
 
91