Rev 391 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 391 | Rev 396 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Martin Decky |
2 | * Copyright (C) 2005 Martin Decky |
- | 3 | * Copyright (C) 2005 Jakub Jermar |
|
3 | * All rights reserved. |
4 | * All rights reserved. |
4 | * |
5 | * |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
7 | * are met: |
8 | * are met: |
8 | * |
9 | * |
9 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
14 | * 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 | * - 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 | * derived from this software without specific prior written permission. |
16 | * |
17 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * 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 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * 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 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * 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 | * (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 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
28 | */ |
28 | 29 | ||
29 | #include <arch/mm/asid.h> |
30 | #include <arch/mm/asid.h> |
30 | #include <synch/spinlock.h> |
31 | #include <synch/spinlock.h> |
31 | #include <arch.h> |
32 | #include <arch.h> |
32 | #include <debug.h> |
33 | #include <debug.h> |
33 | - | ||
34 | #define ASIDS 256 |
34 | #include <typedefs.h> |
35 | 35 | ||
36 | static spinlock_t asid_usage_lock; |
36 | static spinlock_t asid_usage_lock; |
37 | static count_t asid_usage[ASIDS]; /**< Usage tracking array for ASIDs */ |
37 | static count_t asid_usage[ASIDS]; /**< Usage tracking array for ASIDs */ |
38 | 38 | ||
39 | /** Get ASID |
39 | /** Get ASID |
40 | * |
40 | * |
41 | * Get the least used ASID. |
41 | * Get the least used ASID. |
42 | * |
42 | * |
43 | * @return ASID |
43 | * @return ASID |
44 | */ |
44 | */ |
45 | asid_t asid_get(void) |
45 | asid_t asid_get(void) |
46 | { |
46 | { |
47 | pri_t pri; |
47 | pri_t pri; |
48 | int i, j; |
48 | int i, j; |
49 | count_t min; |
49 | count_t min; |
50 | 50 | ||
51 | min = (unsigned) -1; |
51 | min = (unsigned) -1; |
52 | 52 | ||
53 | pri = cpu_priority_high(); |
53 | pri = cpu_priority_high(); |
54 | spinlock_lock(&asid_usage_lock); |
54 | spinlock_lock(&asid_usage_lock); |
55 | 55 | ||
56 | for (i=0, j = 0; (i<ASIDS); i++) { |
56 | for (i = ASID_START, j = ASID_START; i < ASIDS; i++) { |
57 | if (asid_usage[i] < min) { |
57 | if (asid_usage[i] < min) { |
58 | j = i; |
58 | j = i; |
59 | min = asid_usage[i]; |
59 | min = asid_usage[i]; |
60 | if (!min) |
60 | if (!min) |
61 | break; |
61 | break; |
62 | } |
62 | } |
63 | } |
63 | } |
64 | 64 | ||
65 | asid_usage[i]++; |
65 | asid_usage[j]++; |
66 | 66 | ||
67 | spinlock_unlock(&asid_usage_lock); |
67 | spinlock_unlock(&asid_usage_lock); |
68 | cpu_priority_restore(pri); |
68 | cpu_priority_restore(pri); |
69 | 69 | ||
70 | return i; |
70 | return i; |
71 | } |
71 | } |
72 | 72 | ||
73 | /** Release ASID |
73 | /** Release ASID |
74 | * |
74 | * |
75 | * Release ASID by decrementing its usage count. |
75 | * Release ASID by decrementing its usage count. |
76 | * |
76 | * |
77 | * @param asid ASID. |
77 | * @param asid ASID. |
78 | */ |
78 | */ |
79 | void asid_put(asid_t asid) |
79 | void asid_put(asid_t asid) |
80 | { |
80 | { |
81 | pri_t pri; |
81 | pri_t pri; |
82 | 82 | ||
83 | pri = cpu_priority_high(); |
83 | pri = cpu_priority_high(); |
84 | spinlock_lock(&asid_usage_lock); |
84 | spinlock_lock(&asid_usage_lock); |
85 | 85 | ||
- | 86 | ASSERT(asid != ASID_INVALID); |
|
- | 87 | ||
86 | ASSERT(asid_usage[asid] > 0); |
88 | ASSERT(asid_usage[asid] > 0); |
87 | asid_usage[asid]--; |
89 | asid_usage[asid]--; |
88 | 90 | ||
89 | spinlock_unlock(&asid_usage_lock); |
91 | spinlock_unlock(&asid_usage_lock); |
90 | cpu_priority_restore(pri); |
92 | cpu_priority_restore(pri); |
91 | } |
93 | } |
- | 94 | ||
- | 95 | /** Find out whether ASID is used by more address spaces |
|
- | 96 | * |
|
- | 97 | * Find out whether ASID is used by more address spaces. |
|
- | 98 | * |
|
- | 99 | * @param asid ASID in question. |
|
- | 100 | * |
|
- | 101 | * @return True if 'asid' is used by more address spaces, false otherwise. |
|
- | 102 | */ |
|
- | 103 | bool asid_has_conflicts(asid_t asid) |
|
- | 104 | { |
|
- | 105 | bool has_conflicts = false; |
|
- | 106 | pri_t pri; |
|
- | 107 | ||
- | 108 | ASSERT(asid != ASID_INVALID); |
|
- | 109 | ||
- | 110 | pri = cpu_priority_high(); |
|
- | 111 | spinlock_lock(&asid_usage_lock); |
|
- | 112 | ||
- | 113 | if (asid_usage[asid] > 1) |
|
- | 114 | has_conflicts = true; |
|
- | 115 | ||
- | 116 | spinlock_unlock(&asid_usage_lock); |
|
- | 117 | cpu_priority_restore(pri); |
|
- | 118 | ||
- | 119 | return has_conflicts; |
|
- | 120 | } |
|
92 | 121 |