[4512d7e] | 1 | /*
|
---|
| 2 | * Copyright (C) 2006 Jakub 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 |
|
---|
[f47fd19] | 29 | /** @addtogroup genarchmm
|
---|
[b45c443] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 |
|
---|
[0f27b4c] | 33 | /**
|
---|
[b45c443] | 34 | * @file
|
---|
[0f27b4c] | 35 | * @brief ASID management.
|
---|
[4512d7e] | 36 | *
|
---|
| 37 | * Modern processor architectures optimize TLB utilization
|
---|
| 38 | * by using ASIDs (a.k.a. memory contexts on sparc64 and
|
---|
| 39 | * region identifiers on ia64). These ASIDs help to associate
|
---|
| 40 | * each TLB item with an address space, thus making
|
---|
| 41 | * finer-grained TLB invalidation possible.
|
---|
| 42 | *
|
---|
| 43 | * Unfortunatelly, there are usually less ASIDs available than
|
---|
| 44 | * there can be unique as_t structures (i.e. address spaces
|
---|
| 45 | * recognized by the kernel).
|
---|
| 46 | *
|
---|
| 47 | * When system runs short of ASIDs, it will attempt to steal
|
---|
| 48 | * ASID from an address space that has not been active for
|
---|
| 49 | * a while.
|
---|
| 50 | *
|
---|
[7e4e532] | 51 | * This code depends on the fact that ASIDS_ALLOCABLE
|
---|
| 52 | * is greater than number of supported CPUs (i.e. the
|
---|
| 53 | * amount of concurently active address spaces).
|
---|
| 54 | *
|
---|
[4512d7e] | 55 | * Architectures that don't have hardware support for address
|
---|
| 56 | * spaces do not compile with this file.
|
---|
| 57 | */
|
---|
| 58 |
|
---|
| 59 | #include <mm/asid.h>
|
---|
| 60 | #include <mm/as.h>
|
---|
| 61 | #include <mm/tlb.h>
|
---|
| 62 | #include <arch/mm/asid.h>
|
---|
| 63 | #include <synch/spinlock.h>
|
---|
[1068f6a] | 64 | #include <synch/mutex.h>
|
---|
[4512d7e] | 65 | #include <arch.h>
|
---|
[5c9a08b] | 66 | #include <adt/list.h>
|
---|
[4512d7e] | 67 | #include <debug.h>
|
---|
| 68 |
|
---|
| 69 | /**
|
---|
[7e4e532] | 70 | * asidlock protects the asids_allocated counter.
|
---|
[4512d7e] | 71 | */
|
---|
| 72 | SPINLOCK_INITIALIZE(asidlock);
|
---|
| 73 |
|
---|
| 74 | static count_t asids_allocated = 0;
|
---|
| 75 |
|
---|
| 76 | /** Allocate free address space identifier.
|
---|
| 77 | *
|
---|
[977649b] | 78 | * Interrupts must be disabled and inactive_as_with_asid_lock must be held
|
---|
[7e4e532] | 79 | * prior to this call
|
---|
[4512d7e] | 80 | *
|
---|
| 81 | * @return New ASID.
|
---|
| 82 | */
|
---|
| 83 | asid_t asid_get(void)
|
---|
| 84 | {
|
---|
| 85 | asid_t asid;
|
---|
| 86 | link_t *tmp;
|
---|
| 87 | as_t *as;
|
---|
| 88 |
|
---|
| 89 | /*
|
---|
| 90 | * Check if there is an unallocated ASID.
|
---|
| 91 | */
|
---|
| 92 |
|
---|
| 93 | spinlock_lock(&asidlock);
|
---|
[a60c748] | 94 | if (asids_allocated == ASIDS_ALLOCABLE) {
|
---|
[4512d7e] | 95 |
|
---|
| 96 | /*
|
---|
| 97 | * All ASIDs are already allocated.
|
---|
| 98 | * Resort to stealing.
|
---|
| 99 | */
|
---|
| 100 |
|
---|
| 101 | /*
|
---|
| 102 | * Remove the first item on the list.
|
---|
| 103 | * It is guaranteed to belong to an
|
---|
| 104 | * inactive address space.
|
---|
| 105 | */
|
---|
[7e4e532] | 106 | ASSERT(!list_empty(&inactive_as_with_asid_head));
|
---|
| 107 | tmp = inactive_as_with_asid_head.next;
|
---|
[4512d7e] | 108 | list_remove(tmp);
|
---|
| 109 |
|
---|
[7e4e532] | 110 | as = list_get_instance(tmp, as_t, inactive_as_with_asid_link);
|
---|
[1068f6a] | 111 | mutex_lock_active(&as->lock);
|
---|
[4512d7e] | 112 |
|
---|
| 113 | /*
|
---|
| 114 | * Steal the ASID.
|
---|
| 115 | * Note that the stolen ASID is not active.
|
---|
| 116 | */
|
---|
| 117 | asid = as->asid;
|
---|
| 118 | ASSERT(asid != ASID_INVALID);
|
---|
| 119 |
|
---|
[fa7d9c4] | 120 | /*
|
---|
| 121 | * Notify the address space from wich the ASID
|
---|
| 122 | * was stolen by invalidating its asid member.
|
---|
| 123 | */
|
---|
| 124 | as->asid = ASID_INVALID;
|
---|
[f1d1f5d3] | 125 |
|
---|
| 126 | /*
|
---|
| 127 | * If the architecture uses some software cache
|
---|
| 128 | * of TLB entries (e.g. TSB on sparc64), the
|
---|
| 129 | * cache must be invalidated as well.
|
---|
| 130 | */
|
---|
| 131 | as_invalidate_translation_cache(as, 0, 0);
|
---|
| 132 |
|
---|
[1068f6a] | 133 | mutex_unlock(&as->lock);
|
---|
[fa7d9c4] | 134 |
|
---|
[4512d7e] | 135 | /*
|
---|
| 136 | * Get the system rid of the stolen ASID.
|
---|
| 137 | */
|
---|
| 138 | tlb_shootdown_start(TLB_INVL_ASID, asid, 0, 0);
|
---|
[36b01bb2] | 139 | tlb_invalidate_asid(asid);
|
---|
[88169d9] | 140 | tlb_shootdown_finalize();
|
---|
[4512d7e] | 141 | } else {
|
---|
| 142 |
|
---|
| 143 | /*
|
---|
| 144 | * There is at least one unallocated ASID.
|
---|
| 145 | * Find it and assign it.
|
---|
| 146 | */
|
---|
| 147 |
|
---|
| 148 | asid = asid_find_free();
|
---|
| 149 | asids_allocated++;
|
---|
[88169d9] | 150 |
|
---|
| 151 | /*
|
---|
[f1d1f5d3] | 152 | * Purge the allocated ASID from TLBs.
|
---|
[88169d9] | 153 | */
|
---|
| 154 | tlb_shootdown_start(TLB_INVL_ASID, asid, 0, 0);
|
---|
| 155 | tlb_invalidate_asid(asid);
|
---|
| 156 | tlb_shootdown_finalize();
|
---|
[4512d7e] | 157 | }
|
---|
| 158 |
|
---|
| 159 | spinlock_unlock(&asidlock);
|
---|
| 160 |
|
---|
| 161 | return asid;
|
---|
| 162 | }
|
---|
| 163 |
|
---|
| 164 | /** Release address space identifier.
|
---|
| 165 | *
|
---|
| 166 | * This code relies on architecture
|
---|
| 167 | * dependent functionality.
|
---|
| 168 | *
|
---|
| 169 | * @param asid ASID to be released.
|
---|
| 170 | */
|
---|
| 171 | void asid_put(asid_t asid)
|
---|
| 172 | {
|
---|
| 173 | ipl_t ipl;
|
---|
| 174 |
|
---|
| 175 | ipl = interrupts_disable();
|
---|
| 176 | spinlock_lock(&asidlock);
|
---|
| 177 |
|
---|
| 178 | asids_allocated--;
|
---|
| 179 | asid_put_arch(asid);
|
---|
| 180 |
|
---|
| 181 | spinlock_unlock(&asidlock);
|
---|
| 182 | interrupts_restore(ipl);
|
---|
| 183 | }
|
---|
[b45c443] | 184 |
|
---|
[f47fd19] | 185 | /** @}
|
---|
[b45c443] | 186 | */
|
---|