Subversion Repositories HelenOS

Rev

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

Rev 2787 Rev 4377
1
/*
1
/*
2
 * Copyright (c) 2005 Jakub Jermar
2
 * Copyright (c) 2005 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
#ifdef ia64
-
 
30
 
-
 
31
#include <print.h>
29
#include <print.h>
32
#include <test.h>
30
#include <test.h>
33
#include <mm/page.h>
31
#include <mm/page.h>
34
#include <mm/frame.h>
32
#include <mm/frame.h>
35
#include <mm/as.h>
33
#include <mm/as.h>
36
#include <arch/mm/page.h>
34
#include <arch/mm/page.h>
37
#include <arch/mm/tlb.h>
35
#include <arch/mm/tlb.h>
38
#include <arch/types.h>
36
#include <arch/types.h>
39
#include <debug.h>
37
#include <debug.h>
40
 
38
 
41
extern void tlb_invalidate_all(void);
39
extern void tlb_invalidate_all(void);
42
extern void tlb_invalidate_pages(asid_t asid, uintptr_t va, count_t cnt);
40
extern void tlb_invalidate_pages(asid_t asid, uintptr_t va, count_t cnt);
43
 
41
 
44
char * test_purge1(bool quiet)
42
char *test_purge1(void)
45
{
43
{
46
    tlb_entry_t entryi;
44
    tlb_entry_t entryi;
47
    tlb_entry_t entryd;
45
    tlb_entry_t entryd;
48
   
46
   
49
    int i;
47
    int i;
50
                                                                                                                                                                                   
-
 
-
 
48
   
51
    entryd.word[0] = 0;
49
    entryd.word[0] = 0;
52
    entryd.word[1] = 0;
50
    entryd.word[1] = 0;
53
                                               
51
   
54
    entryd.p = true;                 /* present */
52
    entryd.p = true;                 /* present */
55
    entryd.ma = MA_WRITEBACK;
53
    entryd.ma = MA_WRITEBACK;
56
    entryd.a = true;                 /* already accessed */
54
    entryd.a = true;                 /* already accessed */
57
    entryd.d = true;                 /* already dirty */
55
    entryd.d = true;                 /* already dirty */
58
    entryd.pl = PL_KERNEL;
56
    entryd.pl = PL_KERNEL;
59
    entryd.ar = AR_READ | AR_WRITE;
57
    entryd.ar = AR_READ | AR_WRITE;
60
    entryd.ppn = 0;
58
    entryd.ppn = 0;
61
    entryd.ps = PAGE_WIDTH;
59
    entryd.ps = PAGE_WIDTH;
62
   
60
   
63
    entryi.word[0] = 0;
61
    entryi.word[0] = 0;
64
    entryi.word[1] = 0;
62
    entryi.word[1] = 0;
65
   
63
   
66
    entryi.p = true;                 /* present */
64
    entryi.p = true;                 /* present */
67
    entryi.ma = MA_WRITEBACK;
65
    entryi.ma = MA_WRITEBACK;
68
    entryi.a = true;                 /* already accessed */
66
    entryi.a = true;                 /* already accessed */
69
    entryi.d = true;                 /* already dirty */
67
    entryi.d = true;                 /* already dirty */
70
    entryi.pl = PL_KERNEL;
68
    entryi.pl = PL_KERNEL;
71
    entryi.ar = AR_READ | AR_EXECUTE;
69
    entryi.ar = AR_READ | AR_EXECUTE;
72
    entryi.ppn = 0;
70
    entryi.ppn = 0;
73
    entryi.ps = PAGE_WIDTH;
71
    entryi.ps = PAGE_WIDTH;
74
   
72
   
75
    for (i = 0; i < 100; i++) {
73
    for (i = 0; i < 100; i++) {
76
        itc_mapping_insert(0 + i * (1 << PAGE_WIDTH), 8, entryi);
74
        itc_mapping_insert(0 + i * (1 << PAGE_WIDTH), 8, entryi);
77
        dtc_mapping_insert(0 + i * (1 << PAGE_WIDTH), 9, entryd);
75
        dtc_mapping_insert(0 + i * (1 << PAGE_WIDTH), 9, entryd);
78
    }
76
    }
79
   
77
   
80
    tlb_invalidate_pages(8,0x0c000,14);
78
    tlb_invalidate_pages(8, 0x0c000, 14);
81
   
79
   
82
    /*tlb_invalidate_all();*/
80
    /* tlb_invalidate_all(); */
83
   
81
   
84
    return NULL;
82
    return NULL;
85
}
83
}
86
 
-
 
87
#endif
-
 
88
 
84