Rev 1191 | Rev 1212 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1191 | jermar | 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 | |||
29 | #include <ddi/ddi.h> |
||
30 | #include <proc/task.h> |
||
31 | #include <arch/types.h> |
||
32 | #include <typedefs.h> |
||
1203 | jermar | 33 | #include <adt/bitmap.h> |
34 | #include <mm/slab.h> |
||
35 | #include <arch/pm.h> |
||
36 | #include <errno.h> |
||
1191 | jermar | 37 | |
38 | /** Enable I/O space range for task. |
||
39 | * |
||
40 | * Interrupts are disabled and task is locked. |
||
41 | * |
||
42 | * @param task Task. |
||
43 | * @param ioaddr Startign I/O space address. |
||
44 | * @param size Size of the enabled I/O range. |
||
45 | * |
||
46 | * @return 0 on success or an error code from errno.h. |
||
47 | */ |
||
48 | int ddi_enable_iospace_arch(task_t *task, __address ioaddr, size_t size) |
||
49 | { |
||
1203 | jermar | 50 | count_t bits; |
51 | |||
52 | bits = ioaddr + size; |
||
53 | if (bits > IO_PORTS) |
||
54 | return ENOENT; |
||
55 | |||
56 | if (task->arch.iomap.bits < bits) { |
||
57 | bitmap_t oldiomap; |
||
58 | __u8 *newmap; |
||
59 | |||
60 | /* |
||
61 | * The I/O permission bitmap is too small and needs to be grown. |
||
62 | */ |
||
63 | |||
64 | newmap = (__u8 *) malloc(BITS2BYTES(bits), FRAME_ATOMIC); |
||
65 | if (!newmap) |
||
66 | return ENOMEM; |
||
67 | |||
68 | bitmap_initialize(&oldiomap, task->arch.iomap.map, task->arch.iomap.bits); |
||
69 | bitmap_initialize(&task->arch.iomap, newmap, bits); |
||
70 | |||
71 | /* |
||
72 | * Mark the new range inaccessible. |
||
73 | */ |
||
74 | bitmap_set_range(&task->arch.iomap, oldiomap.bits, bits - oldiomap.bits); |
||
75 | |||
76 | /* |
||
77 | * In case there really existed smaller iomap, |
||
78 | * copy its contents and deallocate it. |
||
79 | */ |
||
80 | if (oldiomap.bits) { |
||
81 | bitmap_copy(&task->arch.iomap, &oldiomap, task->arch.iomap.bits); |
||
82 | free(oldiomap.map); |
||
83 | } |
||
84 | } |
||
85 | |||
86 | /* |
||
87 | * Enable the range and we are done. |
||
88 | */ |
||
89 | bitmap_clear_range(&task->arch.iomap, (index_t) ioaddr, (count_t) size); |
||
90 | |||
1191 | jermar | 91 | return 0; |
92 | } |