source: mainline/kernel/generic/src/ipc/irq.c@ c1f68b0

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since c1f68b0 was c1f68b0, checked in by Jakub Jermar <jakub@…>, 8 years ago

Use recursive mutex to protect task_t::cap_info

This makes it possible to use the mutex-protected capability APIs even
inside caps_apply_to_kobject_type() callbacks. Now there is no need to
provide eg. cap_unpublish_locked() and cap_free_locked(). Likewise,
ipc_irq_unsubscribe() can be used when the task's cap_info is already
locked by the current thread inside of a callback.
  • Property mode set to 100644
File size: 14.4 KB
Line 
1/*
2 * Copyright (c) 2006 Ondrej Palkovsky
3 * Copyright (c) 2006 Jakub Jermar
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
30/** @addtogroup genericipc
31 * @{
32 */
33
34/**
35 * @file
36 * @brief IRQ notification framework.
37 *
38 * This framework allows applications to subscribe to receive a notification
39 * when an interrupt is detected. The application may provide a simple
40 * 'top-half' handler as part of its registration, which can perform simple
41 * operations (read/write port/memory, add information to notification IPC
42 * message).
43 *
44 * The structure of a notification message is as follows:
45 * - IMETHOD: interface and method as set by the SYS_IPC_IRQ_SUBSCRIBE syscall
46 * - ARG1: payload modified by a 'top-half' handler (scratch[1])
47 * - ARG2: payload modified by a 'top-half' handler (scratch[2])
48 * - ARG3: payload modified by a 'top-half' handler (scratch[3])
49 * - ARG4: payload modified by a 'top-half' handler (scratch[4])
50 * - ARG5: payload modified by a 'top-half' handler (scratch[5])
51 * - in_phone_hash: interrupt counter (may be needed to assure correct order
52 * in multithreaded drivers)
53 */
54
55#include <arch.h>
56#include <assert.h>
57#include <mm/slab.h>
58#include <mm/page.h>
59#include <mm/km.h>
60#include <errno.h>
61#include <ddi/irq.h>
62#include <ipc/ipc.h>
63#include <ipc/irq.h>
64#include <syscall/copy.h>
65#include <console/console.h>
66#include <print.h>
67#include <macros.h>
68#include <cap/cap.h>
69
70static void ranges_unmap(irq_pio_range_t *ranges, size_t rangecount)
71{
72 for (size_t i = 0; i < rangecount; i++) {
73#ifdef IO_SPACE_BOUNDARY
74 if ((void *) ranges[i].base >= IO_SPACE_BOUNDARY)
75#endif
76 km_unmap(ranges[i].base, ranges[i].size);
77 }
78}
79
80static int ranges_map_and_apply(irq_pio_range_t *ranges, size_t rangecount,
81 irq_cmd_t *cmds, size_t cmdcount)
82{
83 /* Copy the physical base addresses aside. */
84 uintptr_t *pbase = malloc(rangecount * sizeof(uintptr_t), 0);
85 for (size_t i = 0; i < rangecount; i++)
86 pbase[i] = ranges[i].base;
87
88 /* Map the PIO ranges into the kernel virtual address space. */
89 for (size_t i = 0; i < rangecount; i++) {
90#ifdef IO_SPACE_BOUNDARY
91 if ((void *) ranges[i].base < IO_SPACE_BOUNDARY)
92 continue;
93#endif
94 ranges[i].base = km_map(pbase[i], ranges[i].size,
95 PAGE_READ | PAGE_WRITE | PAGE_KERNEL | PAGE_NOT_CACHEABLE);
96 if (!ranges[i].base) {
97 ranges_unmap(ranges, i);
98 free(pbase);
99 return ENOMEM;
100 }
101 }
102
103 /* Rewrite the IRQ code addresses from physical to kernel virtual. */
104 for (size_t i = 0; i < cmdcount; i++) {
105 uintptr_t addr;
106 size_t size;
107
108 /* Process only commands that use an address. */
109 switch (cmds[i].cmd) {
110 case CMD_PIO_READ_8:
111 case CMD_PIO_WRITE_8:
112 case CMD_PIO_WRITE_A_8:
113 size = 1;
114 break;
115 case CMD_PIO_READ_16:
116 case CMD_PIO_WRITE_16:
117 case CMD_PIO_WRITE_A_16:
118 size = 2;
119 break;
120 case CMD_PIO_READ_32:
121 case CMD_PIO_WRITE_32:
122 case CMD_PIO_WRITE_A_32:
123 size = 4;
124 break;
125 default:
126 /* Move onto the next command. */
127 continue;
128 }
129
130 addr = (uintptr_t) cmds[i].addr;
131
132 size_t j;
133 for (j = 0; j < rangecount; j++) {
134 /* Find the matching range. */
135 if (!iswithin(pbase[j], ranges[j].size, addr, size))
136 continue;
137
138 /* Switch the command to a kernel virtual address. */
139 addr -= pbase[j];
140 addr += ranges[j].base;
141
142 cmds[i].addr = (void *) addr;
143 break;
144 }
145
146 if (j == rangecount) {
147 /*
148 * The address used in this command is outside of all
149 * defined ranges.
150 */
151 ranges_unmap(ranges, rangecount);
152 free(pbase);
153 return EINVAL;
154 }
155 }
156
157 free(pbase);
158 return EOK;
159}
160
161/** Statically check the top-half IRQ code
162 *
163 * Check the top-half IRQ code for invalid or unsafe constructs.
164 *
165 */
166static int code_check(irq_cmd_t *cmds, size_t cmdcount)
167{
168 for (size_t i = 0; i < cmdcount; i++) {
169 /*
170 * Check for accepted ranges.
171 */
172 if (cmds[i].cmd >= CMD_LAST)
173 return EINVAL;
174
175 if (cmds[i].srcarg >= IPC_CALL_LEN)
176 return EINVAL;
177
178 if (cmds[i].dstarg >= IPC_CALL_LEN)
179 return EINVAL;
180
181 switch (cmds[i].cmd) {
182 case CMD_PREDICATE:
183 /*
184 * Check for control flow overflow.
185 * Note that jumping just beyond the last
186 * command is a correct behaviour.
187 */
188 if (i + cmds[i].value > cmdcount)
189 return EINVAL;
190
191 break;
192 default:
193 break;
194 }
195 }
196
197 return EOK;
198}
199
200/** Free the top-half IRQ code.
201 *
202 * @param code Pointer to the top-half IRQ code.
203 *
204 */
205static void code_free(irq_code_t *code)
206{
207 if (code) {
208 ranges_unmap(code->ranges, code->rangecount);
209 free(code->ranges);
210 free(code->cmds);
211 free(code);
212 }
213}
214
215/** Copy the top-half IRQ code from userspace into the kernel.
216 *
217 * @param ucode Userspace address of the top-half IRQ code.
218 *
219 * @return Kernel address of the copied IRQ code.
220 *
221 */
222static irq_code_t *code_from_uspace(irq_code_t *ucode)
223{
224 irq_pio_range_t *ranges = NULL;
225 irq_cmd_t *cmds = NULL;
226
227 irq_code_t *code = malloc(sizeof(*code), 0);
228 int rc = copy_from_uspace(code, ucode, sizeof(*code));
229 if (rc != EOK)
230 goto error;
231
232 if ((code->rangecount > IRQ_MAX_RANGE_COUNT) ||
233 (code->cmdcount > IRQ_MAX_PROG_SIZE))
234 goto error;
235
236 ranges = malloc(sizeof(code->ranges[0]) * code->rangecount, 0);
237 rc = copy_from_uspace(ranges, code->ranges,
238 sizeof(code->ranges[0]) * code->rangecount);
239 if (rc != EOK)
240 goto error;
241
242 cmds = malloc(sizeof(code->cmds[0]) * code->cmdcount, 0);
243 rc = copy_from_uspace(cmds, code->cmds,
244 sizeof(code->cmds[0]) * code->cmdcount);
245 if (rc != EOK)
246 goto error;
247
248 rc = code_check(cmds, code->cmdcount);
249 if (rc != EOK)
250 goto error;
251
252 rc = ranges_map_and_apply(ranges, code->rangecount, cmds,
253 code->cmdcount);
254 if (rc != EOK)
255 goto error;
256
257 code->ranges = ranges;
258 code->cmds = cmds;
259
260 return code;
261
262error:
263 if (cmds)
264 free(cmds);
265
266 if (ranges)
267 free(ranges);
268
269 free(code);
270 return NULL;
271}
272
273static void irq_hash_out(irq_t *irq)
274{
275 irq_spinlock_lock(&irq_uspace_hash_table_lock, true);
276 irq_spinlock_lock(&irq->lock, false);
277
278 if (irq->notif_cfg.hashed_in) {
279 /* Remove the IRQ from the uspace IRQ hash table. */
280 hash_table_remove_item(&irq_uspace_hash_table, &irq->link);
281 irq->notif_cfg.hashed_in = false;
282 }
283
284 irq_spinlock_unlock(&irq->lock, false);
285 irq_spinlock_unlock(&irq_uspace_hash_table_lock, true);
286}
287
288static void irq_destroy(void *arg)
289{
290 irq_t *irq = (irq_t *) arg;
291
292 irq_hash_out(irq);
293
294 /* Free up the IRQ code and associated structures. */
295 code_free(irq->notif_cfg.code);
296 slab_free(irq_slab, irq);
297}
298
299static kobject_ops_t irq_kobject_ops = {
300 .destroy = irq_destroy
301};
302
303/** Subscribe an answerbox as a receiving end for IRQ notifications.
304 *
305 * @param box Receiving answerbox.
306 * @param inr IRQ number.
307 * @param imethod Interface and method to be associated with the notification.
308 * @param ucode Uspace pointer to top-half IRQ code.
309 *
310 * @return IRQ capability handle.
311 * @return Negative error code.
312 *
313 */
314int ipc_irq_subscribe(answerbox_t *box, inr_t inr, sysarg_t imethod,
315 irq_code_t *ucode)
316{
317 if ((inr < 0) || (inr > last_inr))
318 return ELIMIT;
319
320 irq_code_t *code;
321 if (ucode) {
322 code = code_from_uspace(ucode);
323 if (!code)
324 return EBADMEM;
325 } else
326 code = NULL;
327
328 /*
329 * Allocate and populate the IRQ kernel object.
330 */
331 cap_handle_t handle = cap_alloc(TASK);
332 if (handle < 0)
333 return handle;
334
335 irq_t *irq = (irq_t *) slab_alloc(irq_slab, FRAME_ATOMIC);
336 if (!irq) {
337 cap_free(TASK, handle);
338 return ENOMEM;
339 }
340
341 kobject_t *kobject = malloc(sizeof(kobject_t), FRAME_ATOMIC);
342 if (!kobject) {
343 cap_free(TASK, handle);
344 slab_free(irq_slab, irq);
345 return ENOMEM;
346 }
347
348 irq_initialize(irq);
349 irq->inr = inr;
350 irq->claim = ipc_irq_top_half_claim;
351 irq->handler = ipc_irq_top_half_handler;
352 irq->notif_cfg.notify = true;
353 irq->notif_cfg.answerbox = box;
354 irq->notif_cfg.imethod = imethod;
355 irq->notif_cfg.code = code;
356 irq->notif_cfg.counter = 0;
357
358 /*
359 * Insert the IRQ structure into the uspace IRQ hash table.
360 */
361 irq_spinlock_lock(&irq_uspace_hash_table_lock, true);
362 irq_spinlock_lock(&irq->lock, false);
363
364 irq->notif_cfg.hashed_in = true;
365 hash_table_insert(&irq_uspace_hash_table, &irq->link);
366
367 irq_spinlock_unlock(&irq->lock, false);
368 irq_spinlock_unlock(&irq_uspace_hash_table_lock, true);
369
370 kobject_initialize(kobject, KOBJECT_TYPE_IRQ, irq, &irq_kobject_ops);
371 cap_publish(TASK, handle, kobject);
372
373 return handle;
374}
375
376/** Unsubscribe task from IRQ notification.
377 *
378 * @param box Answerbox associated with the notification.
379 * @param handle IRQ capability handle.
380 *
381 * @return EOK on success or a negative error code.
382 *
383 */
384int ipc_irq_unsubscribe(answerbox_t *box, int handle)
385{
386 kobject_t *kobj = cap_unpublish(TASK, handle, KOBJECT_TYPE_IRQ);
387 if (!kobj)
388 return ENOENT;
389
390 assert(kobj->irq->notif_cfg.answerbox == box);
391
392 irq_hash_out(kobj->irq);
393
394 kobject_put(kobj);
395 cap_free(TASK, handle);
396
397 return EOK;
398}
399
400/** Add a call to the proper answerbox queue.
401 *
402 * Assume irq->lock is locked and interrupts disabled.
403 *
404 * @param irq IRQ structure referencing the target answerbox.
405 * @param call IRQ notification call.
406 *
407 */
408static void send_call(irq_t *irq, call_t *call)
409{
410 irq_spinlock_lock(&irq->notif_cfg.answerbox->irq_lock, false);
411 list_append(&call->ab_link, &irq->notif_cfg.answerbox->irq_notifs);
412 irq_spinlock_unlock(&irq->notif_cfg.answerbox->irq_lock, false);
413
414 waitq_wakeup(&irq->notif_cfg.answerbox->wq, WAKEUP_FIRST);
415}
416
417/** Apply the top-half IRQ code to find out whether to accept the IRQ or not.
418 *
419 * @param irq IRQ structure.
420 *
421 * @return IRQ_ACCEPT if the interrupt is accepted by the IRQ code.
422 * @return IRQ_DECLINE if the interrupt is not accepted byt the IRQ code.
423 *
424 */
425irq_ownership_t ipc_irq_top_half_claim(irq_t *irq)
426{
427 irq_code_t *code = irq->notif_cfg.code;
428 uint32_t *scratch = irq->notif_cfg.scratch;
429
430 if (!irq->notif_cfg.notify)
431 return IRQ_DECLINE;
432
433 if (!code)
434 return IRQ_DECLINE;
435
436 for (size_t i = 0; i < code->cmdcount; i++) {
437 uintptr_t srcarg = code->cmds[i].srcarg;
438 uintptr_t dstarg = code->cmds[i].dstarg;
439
440 switch (code->cmds[i].cmd) {
441 case CMD_PIO_READ_8:
442 scratch[dstarg] =
443 pio_read_8((ioport8_t *) code->cmds[i].addr);
444 break;
445 case CMD_PIO_READ_16:
446 scratch[dstarg] =
447 pio_read_16((ioport16_t *) code->cmds[i].addr);
448 break;
449 case CMD_PIO_READ_32:
450 scratch[dstarg] =
451 pio_read_32((ioport32_t *) code->cmds[i].addr);
452 break;
453 case CMD_PIO_WRITE_8:
454 pio_write_8((ioport8_t *) code->cmds[i].addr,
455 (uint8_t) code->cmds[i].value);
456 break;
457 case CMD_PIO_WRITE_16:
458 pio_write_16((ioport16_t *) code->cmds[i].addr,
459 (uint16_t) code->cmds[i].value);
460 break;
461 case CMD_PIO_WRITE_32:
462 pio_write_32((ioport32_t *) code->cmds[i].addr,
463 (uint32_t) code->cmds[i].value);
464 break;
465 case CMD_PIO_WRITE_A_8:
466 pio_write_8((ioport8_t *) code->cmds[i].addr,
467 (uint8_t) scratch[srcarg]);
468 break;
469 case CMD_PIO_WRITE_A_16:
470 pio_write_16((ioport16_t *) code->cmds[i].addr,
471 (uint16_t) scratch[srcarg]);
472 break;
473 case CMD_PIO_WRITE_A_32:
474 pio_write_32((ioport32_t *) code->cmds[i].addr,
475 (uint32_t) scratch[srcarg]);
476 break;
477 case CMD_LOAD:
478 scratch[dstarg] = code->cmds[i].value;
479 break;
480 case CMD_AND:
481 scratch[dstarg] = scratch[srcarg] &
482 code->cmds[i].value;
483 break;
484 case CMD_PREDICATE:
485 if (scratch[srcarg] == 0)
486 i += code->cmds[i].value;
487
488 break;
489 case CMD_ACCEPT:
490 return IRQ_ACCEPT;
491 case CMD_DECLINE:
492 default:
493 return IRQ_DECLINE;
494 }
495 }
496
497 return IRQ_DECLINE;
498}
499
500/* IRQ top-half handler.
501 *
502 * We expect interrupts to be disabled and the irq->lock already held.
503 *
504 * @param irq IRQ structure.
505 *
506 */
507void ipc_irq_top_half_handler(irq_t *irq)
508{
509 assert(irq);
510
511 assert(interrupts_disabled());
512 assert(irq_spinlock_locked(&irq->lock));
513
514 if (irq->notif_cfg.answerbox) {
515 call_t *call = ipc_call_alloc(FRAME_ATOMIC);
516 if (!call)
517 return;
518
519 call->flags |= IPC_CALL_NOTIF;
520 /* Put a counter to the message */
521 call->priv = ++irq->notif_cfg.counter;
522
523 /* Set up args */
524 IPC_SET_IMETHOD(call->data, irq->notif_cfg.imethod);
525 IPC_SET_ARG1(call->data, irq->notif_cfg.scratch[1]);
526 IPC_SET_ARG2(call->data, irq->notif_cfg.scratch[2]);
527 IPC_SET_ARG3(call->data, irq->notif_cfg.scratch[3]);
528 IPC_SET_ARG4(call->data, irq->notif_cfg.scratch[4]);
529 IPC_SET_ARG5(call->data, irq->notif_cfg.scratch[5]);
530
531 send_call(irq, call);
532 }
533}
534
535/** Send notification message.
536 *
537 * @param irq IRQ structure.
538 * @param a1 Driver-specific payload argument.
539 * @param a2 Driver-specific payload argument.
540 * @param a3 Driver-specific payload argument.
541 * @param a4 Driver-specific payload argument.
542 * @param a5 Driver-specific payload argument.
543 *
544 */
545void ipc_irq_send_msg(irq_t *irq, sysarg_t a1, sysarg_t a2, sysarg_t a3,
546 sysarg_t a4, sysarg_t a5)
547{
548 irq_spinlock_lock(&irq->lock, true);
549
550 if (irq->notif_cfg.answerbox) {
551 call_t *call = ipc_call_alloc(FRAME_ATOMIC);
552 if (!call) {
553 irq_spinlock_unlock(&irq->lock, true);
554 return;
555 }
556
557 call->flags |= IPC_CALL_NOTIF;
558 /* Put a counter to the message */
559 call->priv = ++irq->notif_cfg.counter;
560
561 IPC_SET_IMETHOD(call->data, irq->notif_cfg.imethod);
562 IPC_SET_ARG1(call->data, a1);
563 IPC_SET_ARG2(call->data, a2);
564 IPC_SET_ARG3(call->data, a3);
565 IPC_SET_ARG4(call->data, a4);
566 IPC_SET_ARG5(call->data, a5);
567
568 send_call(irq, call);
569 }
570
571 irq_spinlock_unlock(&irq->lock, true);
572}
573
574/** @}
575 */
Note: See TracBrowser for help on using the repository browser.