Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2015, ARM Limited and Contributors. All rights reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions are met: |
| 6 | * |
| 7 | * Redistributions of source code must retain the above copyright notice, this |
| 8 | * list of conditions and the following disclaimer. |
| 9 | * |
| 10 | * Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * |
| 14 | * Neither the name of ARM nor the names of its contributors may be used |
| 15 | * to endorse or promote products derived from this software without specific |
| 16 | * prior written permission. |
| 17 | * |
| 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 28 | * POSSIBILITY OF SUCH DAMAGE. |
| 29 | */ |
| 30 | |
| 31 | #include <arch_helpers.h> |
| 32 | #include <assert.h> |
| 33 | #include <bakery_lock.h> |
| 34 | #include <cpu_data.h> |
| 35 | #include <platform.h> |
| 36 | #include <string.h> |
| 37 | |
| 38 | /* |
| 39 | * Functions in this file implement Bakery Algorithm for mutual exclusion with the |
| 40 | * bakery lock data structures in cacheable and Normal memory. |
| 41 | * |
| 42 | * ARM architecture offers a family of exclusive access instructions to |
| 43 | * efficiently implement mutual exclusion with hardware support. However, as |
| 44 | * well as depending on external hardware, these instructions have defined |
| 45 | * behavior only on certain memory types (cacheable and Normal memory in |
| 46 | * particular; see ARMv8 Architecture Reference Manual section B2.10). Use cases |
| 47 | * in trusted firmware are such that mutual exclusion implementation cannot |
| 48 | * expect that accesses to the lock have the specific type required by the |
| 49 | * architecture for these primitives to function (for example, not all |
| 50 | * contenders may have address translation enabled). |
| 51 | * |
| 52 | * This implementation does not use mutual exclusion primitives. It expects |
| 53 | * memory regions where the locks reside to be cacheable and Normal. |
| 54 | * |
| 55 | * Note that the ARM architecture guarantees single-copy atomicity for aligned |
| 56 | * accesses regardless of status of address translation. |
| 57 | */ |
| 58 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 59 | #ifdef PLAT_PERCPU_BAKERY_LOCK_SIZE |
| 60 | /* |
| 61 | * Verify that the platform defined value for the per-cpu space for bakery locks is |
| 62 | * a multiple of the cache line size, to prevent multiple CPUs writing to the same |
| 63 | * bakery lock cache line |
| 64 | * |
| 65 | * Using this value, if provided, rather than the linker generated value results in |
| 66 | * more efficient code |
| 67 | */ |
| 68 | CASSERT((PLAT_PERCPU_BAKERY_LOCK_SIZE & (CACHE_WRITEBACK_GRANULE - 1)) == 0, \ |
| 69 | PLAT_PERCPU_BAKERY_LOCK_SIZE_not_cacheline_multiple); |
| 70 | #define PERCPU_BAKERY_LOCK_SIZE (PLAT_PERCPU_BAKERY_LOCK_SIZE) |
| 71 | #else |
| 72 | /* |
| 73 | * Use the linker defined symbol which has evaluated the size reqiurement. |
| 74 | * This is not as efficient as using a platform defined constant |
| 75 | */ |
| 76 | extern void *__PERCPU_BAKERY_LOCK_SIZE__; |
| 77 | #define PERCPU_BAKERY_LOCK_SIZE ((uintptr_t)&__PERCPU_BAKERY_LOCK_SIZE__) |
| 78 | #endif |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 79 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 80 | #define get_bakery_info(cpu_ix, lock) \ |
| 81 | (bakery_info_t *)((uintptr_t)lock + cpu_ix * PERCPU_BAKERY_LOCK_SIZE) |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 82 | |
| 83 | #define write_cache_op(addr, cached) \ |
| 84 | do { \ |
| 85 | (cached ? dccvac((uint64_t)addr) :\ |
| 86 | dcivac((uint64_t)addr));\ |
| 87 | dsbish();\ |
| 88 | } while (0) |
| 89 | |
| 90 | #define read_cache_op(addr, cached) if (cached) \ |
| 91 | dccivac((uint64_t)addr) |
| 92 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 93 | static unsigned int bakery_get_ticket(bakery_lock_t *lock, |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 94 | unsigned int me, int is_cached) |
| 95 | { |
| 96 | unsigned int my_ticket, their_ticket; |
| 97 | unsigned int they; |
| 98 | bakery_info_t *my_bakery_info, *their_bakery_info; |
| 99 | |
| 100 | /* |
| 101 | * Obtain a reference to the bakery information for this cpu and ensure |
| 102 | * it is not NULL. |
| 103 | */ |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 104 | my_bakery_info = get_bakery_info(me, lock); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 105 | assert(my_bakery_info); |
| 106 | |
| 107 | /* |
Soby Mathew | 548579f | 2015-02-20 16:04:17 +0000 | [diff] [blame] | 108 | * Prevent recursive acquisition. |
| 109 | * Since lock data is written to and cleaned by the owning cpu, it |
| 110 | * doesn't require any cache operations prior to reading the lock data. |
| 111 | */ |
| 112 | assert(!bakery_ticket_number(my_bakery_info->lock_data)); |
| 113 | |
| 114 | /* |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 115 | * Tell other contenders that we are through the bakery doorway i.e. |
| 116 | * going to allocate a ticket for this cpu. |
| 117 | */ |
| 118 | my_ticket = 0; |
| 119 | my_bakery_info->lock_data = make_bakery_data(CHOOSING_TICKET, my_ticket); |
| 120 | |
| 121 | write_cache_op(my_bakery_info, is_cached); |
| 122 | |
| 123 | /* |
| 124 | * Iterate through the bakery information of each contender to allocate |
| 125 | * the highest ticket number for this cpu. |
| 126 | */ |
| 127 | for (they = 0; they < BAKERY_LOCK_MAX_CPUS; they++) { |
| 128 | if (me == they) |
| 129 | continue; |
| 130 | |
| 131 | /* |
| 132 | * Get a reference to the other contender's bakery info and |
| 133 | * ensure that a stale copy is not read. |
| 134 | */ |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 135 | their_bakery_info = get_bakery_info(they, lock); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 136 | assert(their_bakery_info); |
| 137 | |
| 138 | read_cache_op(their_bakery_info, is_cached); |
| 139 | |
| 140 | /* |
| 141 | * Update this cpu's ticket number if a higher ticket number is |
| 142 | * seen |
| 143 | */ |
| 144 | their_ticket = bakery_ticket_number(their_bakery_info->lock_data); |
| 145 | if (their_ticket > my_ticket) |
| 146 | my_ticket = their_ticket; |
| 147 | } |
| 148 | |
| 149 | /* |
| 150 | * Compute ticket; then signal to other contenders waiting for us to |
| 151 | * finish calculating our ticket value that we're done |
| 152 | */ |
| 153 | ++my_ticket; |
Soby Mathew | 1c9573a | 2015-02-19 16:23:51 +0000 | [diff] [blame] | 154 | my_bakery_info->lock_data = make_bakery_data(CHOSEN_TICKET, my_ticket); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 155 | |
| 156 | write_cache_op(my_bakery_info, is_cached); |
| 157 | |
| 158 | return my_ticket; |
| 159 | } |
| 160 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 161 | void bakery_lock_get(bakery_lock_t *lock) |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 162 | { |
| 163 | unsigned int they, me, is_cached; |
| 164 | unsigned int my_ticket, my_prio, their_ticket; |
| 165 | bakery_info_t *their_bakery_info; |
Soby Mathew | 1c9573a | 2015-02-19 16:23:51 +0000 | [diff] [blame] | 166 | unsigned int their_bakery_data; |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 167 | |
Soby Mathew | 85a181c | 2015-07-13 11:21:11 +0100 | [diff] [blame] | 168 | me = plat_my_core_pos(); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 169 | |
| 170 | is_cached = read_sctlr_el3() & SCTLR_C_BIT; |
| 171 | |
| 172 | /* Get a ticket */ |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 173 | my_ticket = bakery_get_ticket(lock, me, is_cached); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 174 | |
| 175 | /* |
| 176 | * Now that we got our ticket, compute our priority value, then compare |
| 177 | * with that of others, and proceed to acquire the lock |
| 178 | */ |
| 179 | my_prio = PRIORITY(my_ticket, me); |
| 180 | for (they = 0; they < BAKERY_LOCK_MAX_CPUS; they++) { |
| 181 | if (me == they) |
| 182 | continue; |
| 183 | |
| 184 | /* |
| 185 | * Get a reference to the other contender's bakery info and |
| 186 | * ensure that a stale copy is not read. |
| 187 | */ |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 188 | their_bakery_info = get_bakery_info(they, lock); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 189 | assert(their_bakery_info); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 190 | |
| 191 | /* Wait for the contender to get their ticket */ |
Soby Mathew | 1c9573a | 2015-02-19 16:23:51 +0000 | [diff] [blame] | 192 | do { |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 193 | read_cache_op(their_bakery_info, is_cached); |
| 194 | their_bakery_data = their_bakery_info->lock_data; |
Soby Mathew | 1c9573a | 2015-02-19 16:23:51 +0000 | [diff] [blame] | 195 | } while (bakery_is_choosing(their_bakery_data)); |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 196 | |
| 197 | /* |
| 198 | * If the other party is a contender, they'll have non-zero |
| 199 | * (valid) ticket value. If they do, compare priorities |
| 200 | */ |
| 201 | their_ticket = bakery_ticket_number(their_bakery_data); |
| 202 | if (their_ticket && (PRIORITY(their_ticket, they) < my_prio)) { |
| 203 | /* |
| 204 | * They have higher priority (lower value). Wait for |
| 205 | * their ticket value to change (either release the lock |
| 206 | * to have it dropped to 0; or drop and probably content |
| 207 | * again for the same lock to have an even higher value) |
| 208 | */ |
| 209 | do { |
| 210 | wfe(); |
| 211 | read_cache_op(their_bakery_info, is_cached); |
| 212 | } while (their_ticket |
| 213 | == bakery_ticket_number(their_bakery_info->lock_data)); |
| 214 | } |
| 215 | } |
Soby Mathew | 548579f | 2015-02-20 16:04:17 +0000 | [diff] [blame] | 216 | /* Lock acquired */ |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 217 | } |
| 218 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 219 | void bakery_lock_release(bakery_lock_t *lock) |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 220 | { |
| 221 | bakery_info_t *my_bakery_info; |
| 222 | unsigned int is_cached = read_sctlr_el3() & SCTLR_C_BIT; |
| 223 | |
Andrew Thoelke | ee7b35c | 2015-09-10 11:39:36 +0100 | [diff] [blame^] | 224 | my_bakery_info = get_bakery_info(plat_my_core_pos(), lock); |
Soby Mathew | 548579f | 2015-02-20 16:04:17 +0000 | [diff] [blame] | 225 | assert(bakery_ticket_number(my_bakery_info->lock_data)); |
| 226 | |
Soby Mathew | 8c5fe0b | 2015-01-08 18:02:19 +0000 | [diff] [blame] | 227 | my_bakery_info->lock_data = 0; |
| 228 | write_cache_op(my_bakery_info, is_cached); |
| 229 | sev(); |
| 230 | } |