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