Thomas Gleixner | 90cafdd | 2018-03-14 22:15:17 +0100 | [diff] [blame] | 1 | // SPDX-License-Identifier: GPL-2.0 |
| 2 | // Copyright (C) 2017 Thomas Gleixner <tglx@linutronix.de> |
| 3 | |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 4 | #include <linux/spinlock.h> |
| 5 | #include <linux/seq_file.h> |
| 6 | #include <linux/bitmap.h> |
| 7 | #include <linux/percpu.h> |
| 8 | #include <linux/cpu.h> |
| 9 | #include <linux/irq.h> |
| 10 | |
Michael Kelley | 57f0179 | 2018-11-01 00:35:05 +0000 | [diff] [blame] | 11 | #define IRQ_MATRIX_SIZE (BITS_TO_LONGS(IRQ_MATRIX_BITS)) |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 12 | |
| 13 | struct cpumap { |
| 14 | unsigned int available; |
| 15 | unsigned int allocated; |
| 16 | unsigned int managed; |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 17 | unsigned int managed_allocated; |
Thomas Gleixner | 651ca2c | 2018-02-22 12:08:05 +0100 | [diff] [blame] | 18 | bool initialized; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 19 | bool online; |
| 20 | unsigned long alloc_map[IRQ_MATRIX_SIZE]; |
| 21 | unsigned long managed_map[IRQ_MATRIX_SIZE]; |
| 22 | }; |
| 23 | |
| 24 | struct irq_matrix { |
| 25 | unsigned int matrix_bits; |
| 26 | unsigned int alloc_start; |
| 27 | unsigned int alloc_end; |
| 28 | unsigned int alloc_size; |
| 29 | unsigned int global_available; |
| 30 | unsigned int global_reserved; |
| 31 | unsigned int systembits_inalloc; |
| 32 | unsigned int total_allocated; |
| 33 | unsigned int online_maps; |
| 34 | struct cpumap __percpu *maps; |
| 35 | unsigned long scratch_map[IRQ_MATRIX_SIZE]; |
| 36 | unsigned long system_map[IRQ_MATRIX_SIZE]; |
| 37 | }; |
| 38 | |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 39 | #define CREATE_TRACE_POINTS |
| 40 | #include <trace/events/irq_matrix.h> |
| 41 | |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 42 | /** |
| 43 | * irq_alloc_matrix - Allocate a irq_matrix structure and initialize it |
| 44 | * @matrix_bits: Number of matrix bits must be <= IRQ_MATRIX_BITS |
| 45 | * @alloc_start: From which bit the allocation search starts |
| 46 | * @alloc_end: At which bit the allocation search ends, i.e first |
| 47 | * invalid bit |
| 48 | */ |
| 49 | __init struct irq_matrix *irq_alloc_matrix(unsigned int matrix_bits, |
| 50 | unsigned int alloc_start, |
| 51 | unsigned int alloc_end) |
| 52 | { |
| 53 | struct irq_matrix *m; |
| 54 | |
| 55 | if (matrix_bits > IRQ_MATRIX_BITS) |
| 56 | return NULL; |
| 57 | |
| 58 | m = kzalloc(sizeof(*m), GFP_KERNEL); |
| 59 | if (!m) |
| 60 | return NULL; |
| 61 | |
| 62 | m->matrix_bits = matrix_bits; |
| 63 | m->alloc_start = alloc_start; |
| 64 | m->alloc_end = alloc_end; |
| 65 | m->alloc_size = alloc_end - alloc_start; |
| 66 | m->maps = alloc_percpu(*m->maps); |
| 67 | if (!m->maps) { |
| 68 | kfree(m); |
| 69 | return NULL; |
| 70 | } |
| 71 | return m; |
| 72 | } |
| 73 | |
| 74 | /** |
| 75 | * irq_matrix_online - Bring the local CPU matrix online |
| 76 | * @m: Matrix pointer |
| 77 | */ |
| 78 | void irq_matrix_online(struct irq_matrix *m) |
| 79 | { |
| 80 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 81 | |
| 82 | BUG_ON(cm->online); |
| 83 | |
Thomas Gleixner | 651ca2c | 2018-02-22 12:08:05 +0100 | [diff] [blame] | 84 | if (!cm->initialized) { |
| 85 | cm->available = m->alloc_size; |
| 86 | cm->available -= cm->managed + m->systembits_inalloc; |
| 87 | cm->initialized = true; |
| 88 | } |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 89 | m->global_available += cm->available; |
| 90 | cm->online = true; |
| 91 | m->online_maps++; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 92 | trace_irq_matrix_online(m); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 93 | } |
| 94 | |
| 95 | /** |
| 96 | * irq_matrix_offline - Bring the local CPU matrix offline |
| 97 | * @m: Matrix pointer |
| 98 | */ |
| 99 | void irq_matrix_offline(struct irq_matrix *m) |
| 100 | { |
| 101 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 102 | |
| 103 | /* Update the global available size */ |
| 104 | m->global_available -= cm->available; |
| 105 | cm->online = false; |
| 106 | m->online_maps--; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 107 | trace_irq_matrix_offline(m); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 108 | } |
| 109 | |
| 110 | static unsigned int matrix_alloc_area(struct irq_matrix *m, struct cpumap *cm, |
| 111 | unsigned int num, bool managed) |
| 112 | { |
| 113 | unsigned int area, start = m->alloc_start; |
| 114 | unsigned int end = m->alloc_end; |
| 115 | |
| 116 | bitmap_or(m->scratch_map, cm->managed_map, m->system_map, end); |
| 117 | bitmap_or(m->scratch_map, m->scratch_map, cm->alloc_map, end); |
| 118 | area = bitmap_find_next_zero_area(m->scratch_map, end, start, num, 0); |
| 119 | if (area >= end) |
| 120 | return area; |
| 121 | if (managed) |
| 122 | bitmap_set(cm->managed_map, area, num); |
| 123 | else |
| 124 | bitmap_set(cm->alloc_map, area, num); |
| 125 | return area; |
| 126 | } |
| 127 | |
Dou Liyang | 8ffe4e6 | 2018-09-09 01:58:37 +0800 | [diff] [blame] | 128 | /* Find the best CPU which has the lowest vector allocation count */ |
| 129 | static unsigned int matrix_find_best_cpu(struct irq_matrix *m, |
| 130 | const struct cpumask *msk) |
| 131 | { |
| 132 | unsigned int cpu, best_cpu, maxavl = 0; |
| 133 | struct cpumap *cm; |
| 134 | |
| 135 | best_cpu = UINT_MAX; |
| 136 | |
| 137 | for_each_cpu(cpu, msk) { |
| 138 | cm = per_cpu_ptr(m->maps, cpu); |
| 139 | |
| 140 | if (!cm->online || cm->available <= maxavl) |
| 141 | continue; |
| 142 | |
| 143 | best_cpu = cpu; |
| 144 | maxavl = cm->available; |
| 145 | } |
| 146 | return best_cpu; |
| 147 | } |
| 148 | |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 149 | /* Find the best CPU which has the lowest number of managed IRQs allocated */ |
| 150 | static unsigned int matrix_find_best_cpu_managed(struct irq_matrix *m, |
| 151 | const struct cpumask *msk) |
| 152 | { |
| 153 | unsigned int cpu, best_cpu, allocated = UINT_MAX; |
| 154 | struct cpumap *cm; |
| 155 | |
| 156 | best_cpu = UINT_MAX; |
| 157 | |
| 158 | for_each_cpu(cpu, msk) { |
| 159 | cm = per_cpu_ptr(m->maps, cpu); |
| 160 | |
| 161 | if (!cm->online || cm->managed_allocated > allocated) |
| 162 | continue; |
| 163 | |
| 164 | best_cpu = cpu; |
| 165 | allocated = cm->managed_allocated; |
| 166 | } |
| 167 | return best_cpu; |
| 168 | } |
| 169 | |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 170 | /** |
| 171 | * irq_matrix_assign_system - Assign system wide entry in the matrix |
| 172 | * @m: Matrix pointer |
| 173 | * @bit: Which bit to reserve |
| 174 | * @replace: Replace an already allocated vector with a system |
| 175 | * vector at the same bit position. |
| 176 | * |
| 177 | * The BUG_ON()s below are on purpose. If this goes wrong in the |
| 178 | * early boot process, then the chance to survive is about zero. |
| 179 | * If this happens when the system is life, it's not much better. |
| 180 | */ |
| 181 | void irq_matrix_assign_system(struct irq_matrix *m, unsigned int bit, |
| 182 | bool replace) |
| 183 | { |
| 184 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 185 | |
| 186 | BUG_ON(bit > m->matrix_bits); |
| 187 | BUG_ON(m->online_maps > 1 || (m->online_maps && !replace)); |
| 188 | |
| 189 | set_bit(bit, m->system_map); |
| 190 | if (replace) { |
| 191 | BUG_ON(!test_and_clear_bit(bit, cm->alloc_map)); |
| 192 | cm->allocated--; |
| 193 | m->total_allocated--; |
| 194 | } |
| 195 | if (bit >= m->alloc_start && bit < m->alloc_end) |
| 196 | m->systembits_inalloc++; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 197 | |
| 198 | trace_irq_matrix_assign_system(bit, m); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 199 | } |
| 200 | |
| 201 | /** |
| 202 | * irq_matrix_reserve_managed - Reserve a managed interrupt in a CPU map |
| 203 | * @m: Matrix pointer |
| 204 | * @msk: On which CPUs the bits should be reserved. |
| 205 | * |
| 206 | * Can be called for offline CPUs. Note, this will only reserve one bit |
| 207 | * on all CPUs in @msk, but it's not guaranteed that the bits are at the |
| 208 | * same offset on all CPUs |
| 209 | */ |
| 210 | int irq_matrix_reserve_managed(struct irq_matrix *m, const struct cpumask *msk) |
| 211 | { |
| 212 | unsigned int cpu, failed_cpu; |
| 213 | |
| 214 | for_each_cpu(cpu, msk) { |
| 215 | struct cpumap *cm = per_cpu_ptr(m->maps, cpu); |
| 216 | unsigned int bit; |
| 217 | |
| 218 | bit = matrix_alloc_area(m, cm, 1, true); |
| 219 | if (bit >= m->alloc_end) |
| 220 | goto cleanup; |
| 221 | cm->managed++; |
| 222 | if (cm->online) { |
| 223 | cm->available--; |
| 224 | m->global_available--; |
| 225 | } |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 226 | trace_irq_matrix_reserve_managed(bit, cpu, m, cm); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 227 | } |
| 228 | return 0; |
| 229 | cleanup: |
| 230 | failed_cpu = cpu; |
| 231 | for_each_cpu(cpu, msk) { |
| 232 | if (cpu == failed_cpu) |
| 233 | break; |
| 234 | irq_matrix_remove_managed(m, cpumask_of(cpu)); |
| 235 | } |
| 236 | return -ENOSPC; |
| 237 | } |
| 238 | |
| 239 | /** |
| 240 | * irq_matrix_remove_managed - Remove managed interrupts in a CPU map |
| 241 | * @m: Matrix pointer |
| 242 | * @msk: On which CPUs the bits should be removed |
| 243 | * |
| 244 | * Can be called for offline CPUs |
| 245 | * |
| 246 | * This removes not allocated managed interrupts from the map. It does |
| 247 | * not matter which one because the managed interrupts free their |
| 248 | * allocation when they shut down. If not, the accounting is screwed, |
| 249 | * but all what can be done at this point is warn about it. |
| 250 | */ |
| 251 | void irq_matrix_remove_managed(struct irq_matrix *m, const struct cpumask *msk) |
| 252 | { |
| 253 | unsigned int cpu; |
| 254 | |
| 255 | for_each_cpu(cpu, msk) { |
| 256 | struct cpumap *cm = per_cpu_ptr(m->maps, cpu); |
| 257 | unsigned int bit, end = m->alloc_end; |
| 258 | |
| 259 | if (WARN_ON_ONCE(!cm->managed)) |
| 260 | continue; |
| 261 | |
| 262 | /* Get managed bit which are not allocated */ |
| 263 | bitmap_andnot(m->scratch_map, cm->managed_map, cm->alloc_map, end); |
| 264 | |
| 265 | bit = find_first_bit(m->scratch_map, end); |
| 266 | if (WARN_ON_ONCE(bit >= end)) |
| 267 | continue; |
| 268 | |
| 269 | clear_bit(bit, cm->managed_map); |
| 270 | |
| 271 | cm->managed--; |
| 272 | if (cm->online) { |
| 273 | cm->available++; |
| 274 | m->global_available++; |
| 275 | } |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 276 | trace_irq_matrix_remove_managed(bit, cpu, m, cm); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 277 | } |
| 278 | } |
| 279 | |
| 280 | /** |
| 281 | * irq_matrix_alloc_managed - Allocate a managed interrupt in a CPU map |
| 282 | * @m: Matrix pointer |
| 283 | * @cpu: On which CPU the interrupt should be allocated |
| 284 | */ |
Dou Liyang | 76f99ae | 2018-09-09 01:58:38 +0800 | [diff] [blame] | 285 | int irq_matrix_alloc_managed(struct irq_matrix *m, const struct cpumask *msk, |
| 286 | unsigned int *mapped_cpu) |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 287 | { |
Dou Liyang | 76f99ae | 2018-09-09 01:58:38 +0800 | [diff] [blame] | 288 | unsigned int bit, cpu, end = m->alloc_end; |
| 289 | struct cpumap *cm; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 290 | |
Dou Liyang | 76f99ae | 2018-09-09 01:58:38 +0800 | [diff] [blame] | 291 | if (cpumask_empty(msk)) |
| 292 | return -EINVAL; |
| 293 | |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 294 | cpu = matrix_find_best_cpu_managed(m, msk); |
Dou Liyang | 76f99ae | 2018-09-09 01:58:38 +0800 | [diff] [blame] | 295 | if (cpu == UINT_MAX) |
| 296 | return -ENOSPC; |
| 297 | |
| 298 | cm = per_cpu_ptr(m->maps, cpu); |
| 299 | end = m->alloc_end; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 300 | /* Get managed bit which are not allocated */ |
| 301 | bitmap_andnot(m->scratch_map, cm->managed_map, cm->alloc_map, end); |
| 302 | bit = find_first_bit(m->scratch_map, end); |
| 303 | if (bit >= end) |
| 304 | return -ENOSPC; |
| 305 | set_bit(bit, cm->alloc_map); |
| 306 | cm->allocated++; |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 307 | cm->managed_allocated++; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 308 | m->total_allocated++; |
Dou Liyang | 76f99ae | 2018-09-09 01:58:38 +0800 | [diff] [blame] | 309 | *mapped_cpu = cpu; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 310 | trace_irq_matrix_alloc_managed(bit, cpu, m, cm); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 311 | return bit; |
| 312 | } |
| 313 | |
| 314 | /** |
| 315 | * irq_matrix_assign - Assign a preallocated interrupt in the local CPU map |
| 316 | * @m: Matrix pointer |
| 317 | * @bit: Which bit to mark |
| 318 | * |
| 319 | * This should only be used to mark preallocated vectors |
| 320 | */ |
| 321 | void irq_matrix_assign(struct irq_matrix *m, unsigned int bit) |
| 322 | { |
| 323 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 324 | |
| 325 | if (WARN_ON_ONCE(bit < m->alloc_start || bit >= m->alloc_end)) |
| 326 | return; |
| 327 | if (WARN_ON_ONCE(test_and_set_bit(bit, cm->alloc_map))) |
| 328 | return; |
| 329 | cm->allocated++; |
| 330 | m->total_allocated++; |
| 331 | cm->available--; |
| 332 | m->global_available--; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 333 | trace_irq_matrix_assign(bit, smp_processor_id(), m, cm); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 334 | } |
| 335 | |
| 336 | /** |
| 337 | * irq_matrix_reserve - Reserve interrupts |
| 338 | * @m: Matrix pointer |
| 339 | * |
Juergen Gross | 2c6b021 | 2021-02-11 08:09:53 +0100 | [diff] [blame] | 340 | * This is merely a book keeping call. It increments the number of globally |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 341 | * reserved interrupt bits w/o actually allocating them. This allows to |
| 342 | * setup interrupt descriptors w/o assigning low level resources to it. |
| 343 | * The actual allocation happens when the interrupt gets activated. |
| 344 | */ |
| 345 | void irq_matrix_reserve(struct irq_matrix *m) |
| 346 | { |
Juergen Gross | 2c6b021 | 2021-02-11 08:09:53 +0100 | [diff] [blame] | 347 | if (m->global_reserved == m->global_available) |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 348 | pr_warn("Interrupt reservation exceeds available resources\n"); |
| 349 | |
| 350 | m->global_reserved++; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 351 | trace_irq_matrix_reserve(m); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 352 | } |
| 353 | |
| 354 | /** |
| 355 | * irq_matrix_remove_reserved - Remove interrupt reservation |
| 356 | * @m: Matrix pointer |
| 357 | * |
Krzysztof Kozlowski | 5c982c5 | 2021-03-16 11:02:05 +0100 | [diff] [blame] | 358 | * This is merely a book keeping call. It decrements the number of globally |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 359 | * reserved interrupt bits. This is used to undo irq_matrix_reserve() when the |
| 360 | * interrupt was never in use and a real vector allocated, which undid the |
| 361 | * reservation. |
| 362 | */ |
| 363 | void irq_matrix_remove_reserved(struct irq_matrix *m) |
| 364 | { |
| 365 | m->global_reserved--; |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 366 | trace_irq_matrix_remove_reserved(m); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 367 | } |
| 368 | |
| 369 | /** |
| 370 | * irq_matrix_alloc - Allocate a regular interrupt in a CPU map |
| 371 | * @m: Matrix pointer |
| 372 | * @msk: Which CPUs to search in |
| 373 | * @reserved: Allocate previously reserved interrupts |
| 374 | * @mapped_cpu: Pointer to store the CPU for which the irq was allocated |
| 375 | */ |
| 376 | int irq_matrix_alloc(struct irq_matrix *m, const struct cpumask *msk, |
| 377 | bool reserved, unsigned int *mapped_cpu) |
| 378 | { |
Dou Liyang | 8ffe4e6 | 2018-09-09 01:58:37 +0800 | [diff] [blame] | 379 | unsigned int cpu, bit; |
Thomas Gleixner | a0c9259 | 2018-01-17 16:01:47 +0100 | [diff] [blame] | 380 | struct cpumap *cm; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 381 | |
Thomas Gleixner | 784a083 | 2020-08-30 19:07:53 +0200 | [diff] [blame] | 382 | /* |
| 383 | * Not required in theory, but matrix_find_best_cpu() uses |
| 384 | * for_each_cpu() which ignores the cpumask on UP . |
| 385 | */ |
| 386 | if (cpumask_empty(msk)) |
| 387 | return -EINVAL; |
| 388 | |
Dou Liyang | 8ffe4e6 | 2018-09-09 01:58:37 +0800 | [diff] [blame] | 389 | cpu = matrix_find_best_cpu(m, msk); |
| 390 | if (cpu == UINT_MAX) |
| 391 | return -ENOSPC; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 392 | |
Dou Liyang | 8ffe4e6 | 2018-09-09 01:58:37 +0800 | [diff] [blame] | 393 | cm = per_cpu_ptr(m->maps, cpu); |
| 394 | bit = matrix_alloc_area(m, cm, 1, false); |
| 395 | if (bit >= m->alloc_end) |
| 396 | return -ENOSPC; |
| 397 | cm->allocated++; |
| 398 | cm->available--; |
| 399 | m->total_allocated++; |
| 400 | m->global_available--; |
| 401 | if (reserved) |
| 402 | m->global_reserved--; |
| 403 | *mapped_cpu = cpu; |
| 404 | trace_irq_matrix_alloc(bit, cpu, m, cm); |
| 405 | return bit; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 406 | |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 407 | } |
| 408 | |
| 409 | /** |
| 410 | * irq_matrix_free - Free allocated interrupt in the matrix |
| 411 | * @m: Matrix pointer |
| 412 | * @cpu: Which CPU map needs be updated |
| 413 | * @bit: The bit to remove |
| 414 | * @managed: If true, the interrupt is managed and not accounted |
| 415 | * as available. |
| 416 | */ |
| 417 | void irq_matrix_free(struct irq_matrix *m, unsigned int cpu, |
| 418 | unsigned int bit, bool managed) |
| 419 | { |
| 420 | struct cpumap *cm = per_cpu_ptr(m->maps, cpu); |
| 421 | |
| 422 | if (WARN_ON_ONCE(bit < m->alloc_start || bit >= m->alloc_end)) |
| 423 | return; |
| 424 | |
Vitaly Kuznetsov | c93a5e2 | 2021-03-19 12:18:23 +0100 | [diff] [blame^] | 425 | if (WARN_ON_ONCE(!test_and_clear_bit(bit, cm->alloc_map))) |
| 426 | return; |
| 427 | |
Thomas Gleixner | 651ca2c | 2018-02-22 12:08:05 +0100 | [diff] [blame] | 428 | cm->allocated--; |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 429 | if(managed) |
| 430 | cm->managed_allocated--; |
Thomas Gleixner | 651ca2c | 2018-02-22 12:08:05 +0100 | [diff] [blame] | 431 | |
| 432 | if (cm->online) |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 433 | m->total_allocated--; |
Thomas Gleixner | 651ca2c | 2018-02-22 12:08:05 +0100 | [diff] [blame] | 434 | |
| 435 | if (!managed) { |
| 436 | cm->available++; |
| 437 | if (cm->online) |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 438 | m->global_available++; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 439 | } |
Thomas Gleixner | ec0f7cd | 2017-09-13 23:29:15 +0200 | [diff] [blame] | 440 | trace_irq_matrix_free(bit, cpu, m, cm); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 441 | } |
| 442 | |
| 443 | /** |
| 444 | * irq_matrix_available - Get the number of globally available irqs |
| 445 | * @m: Pointer to the matrix to query |
| 446 | * @cpudown: If true, the local CPU is about to go down, adjust |
| 447 | * the number of available irqs accordingly |
| 448 | */ |
| 449 | unsigned int irq_matrix_available(struct irq_matrix *m, bool cpudown) |
| 450 | { |
| 451 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 452 | |
Thomas Gleixner | bb5c4342 | 2017-11-28 15:40:33 +0100 | [diff] [blame] | 453 | if (!cpudown) |
| 454 | return m->global_available; |
| 455 | return m->global_available - cm->available; |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 456 | } |
| 457 | |
| 458 | /** |
| 459 | * irq_matrix_reserved - Get the number of globally reserved irqs |
| 460 | * @m: Pointer to the matrix to query |
| 461 | */ |
| 462 | unsigned int irq_matrix_reserved(struct irq_matrix *m) |
| 463 | { |
| 464 | return m->global_reserved; |
| 465 | } |
| 466 | |
| 467 | /** |
| 468 | * irq_matrix_allocated - Get the number of allocated irqs on the local cpu |
| 469 | * @m: Pointer to the matrix to search |
| 470 | * |
| 471 | * This returns number of allocated irqs |
| 472 | */ |
| 473 | unsigned int irq_matrix_allocated(struct irq_matrix *m) |
| 474 | { |
| 475 | struct cpumap *cm = this_cpu_ptr(m->maps); |
| 476 | |
| 477 | return cm->allocated; |
| 478 | } |
| 479 | |
| 480 | #ifdef CONFIG_GENERIC_IRQ_DEBUGFS |
| 481 | /** |
| 482 | * irq_matrix_debug_show - Show detailed allocation information |
| 483 | * @sf: Pointer to the seq_file to print to |
| 484 | * @m: Pointer to the matrix allocator |
| 485 | * @ind: Indentation for the print format |
| 486 | * |
| 487 | * Note, this is a lockless snapshot. |
| 488 | */ |
| 489 | void irq_matrix_debug_show(struct seq_file *sf, struct irq_matrix *m, int ind) |
| 490 | { |
| 491 | unsigned int nsys = bitmap_weight(m->system_map, m->matrix_bits); |
| 492 | int cpu; |
| 493 | |
| 494 | seq_printf(sf, "Online bitmaps: %6u\n", m->online_maps); |
| 495 | seq_printf(sf, "Global available: %6u\n", m->global_available); |
| 496 | seq_printf(sf, "Global reserved: %6u\n", m->global_reserved); |
| 497 | seq_printf(sf, "Total allocated: %6u\n", m->total_allocated); |
| 498 | seq_printf(sf, "System: %u: %*pbl\n", nsys, m->matrix_bits, |
| 499 | m->system_map); |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 500 | seq_printf(sf, "%*s| CPU | avl | man | mac | act | vectors\n", ind, " "); |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 501 | cpus_read_lock(); |
| 502 | for_each_online_cpu(cpu) { |
| 503 | struct cpumap *cm = per_cpu_ptr(m->maps, cpu); |
| 504 | |
Long Li | e8da879 | 2018-11-06 04:00:00 +0000 | [diff] [blame] | 505 | seq_printf(sf, "%*s %4d %4u %4u %4u %4u %*pbl\n", ind, " ", |
| 506 | cpu, cm->available, cm->managed, |
| 507 | cm->managed_allocated, cm->allocated, |
Thomas Gleixner | 2f75d9e | 2017-09-13 23:29:14 +0200 | [diff] [blame] | 508 | m->matrix_bits, cm->alloc_map); |
| 509 | } |
| 510 | cpus_read_unlock(); |
| 511 | } |
| 512 | #endif |