Rev 3386 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1191 | jermar | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2006 Jakub Jermar |
1191 | 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 | |||
1888 | jermar | 29 | /** @addtogroup amd64ddi |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1191 | jermar | 35 | #include <ddi/ddi.h> |
1256 | jermar | 36 | #include <arch/ddi/ddi.h> |
1191 | jermar | 37 | #include <proc/task.h> |
38 | #include <arch/types.h> |
||
1203 | jermar | 39 | #include <adt/bitmap.h> |
40 | #include <mm/slab.h> |
||
41 | #include <arch/pm.h> |
||
42 | #include <errno.h> |
||
1212 | palkovsky | 43 | #include <arch/cpu.h> |
1256 | jermar | 44 | #include <arch.h> |
1263 | jermar | 45 | #include <align.h> |
1191 | jermar | 46 | |
47 | /** Enable I/O space range for task. |
||
48 | * |
||
49 | * Interrupts are disabled and task is locked. |
||
50 | * |
||
51 | * @param task Task. |
||
52 | * @param ioaddr Startign I/O space address. |
||
53 | * @param size Size of the enabled I/O range. |
||
54 | * |
||
55 | * @return 0 on success or an error code from errno.h. |
||
56 | */ |
||
1780 | jermar | 57 | int ddi_iospace_enable_arch(task_t *task, uintptr_t ioaddr, size_t size) |
1191 | jermar | 58 | { |
1203 | jermar | 59 | count_t bits; |
4153 | mejdrech | 60 | |
1203 | jermar | 61 | bits = ioaddr + size; |
62 | if (bits > IO_PORTS) |
||
63 | return ENOENT; |
||
4153 | mejdrech | 64 | |
1203 | jermar | 65 | if (task->arch.iomap.bits < bits) { |
66 | bitmap_t oldiomap; |
||
1780 | jermar | 67 | uint8_t *newmap; |
4153 | mejdrech | 68 | |
1203 | jermar | 69 | /* |
70 | * The I/O permission bitmap is too small and needs to be grown. |
||
71 | */ |
||
72 | |||
1780 | jermar | 73 | newmap = (uint8_t *) malloc(BITS2BYTES(bits), FRAME_ATOMIC); |
1203 | jermar | 74 | if (!newmap) |
75 | return ENOMEM; |
||
76 | |||
2630 | jermar | 77 | bitmap_initialize(&oldiomap, task->arch.iomap.map, |
78 | task->arch.iomap.bits); |
||
1203 | jermar | 79 | bitmap_initialize(&task->arch.iomap, newmap, bits); |
4153 | mejdrech | 80 | |
1203 | jermar | 81 | /* |
82 | * Mark the new range inaccessible. |
||
83 | */ |
||
2630 | jermar | 84 | bitmap_set_range(&task->arch.iomap, oldiomap.bits, |
85 | bits - oldiomap.bits); |
||
4153 | mejdrech | 86 | |
1203 | jermar | 87 | /* |
88 | * In case there really existed smaller iomap, |
||
89 | * copy its contents and deallocate it. |
||
4153 | mejdrech | 90 | */ |
1203 | jermar | 91 | if (oldiomap.bits) { |
2630 | jermar | 92 | bitmap_copy(&task->arch.iomap, &oldiomap, |
93 | oldiomap.bits); |
||
1203 | jermar | 94 | free(oldiomap.map); |
95 | } |
||
96 | } |
||
4153 | mejdrech | 97 | |
1203 | jermar | 98 | /* |
99 | * Enable the range and we are done. |
||
100 | */ |
||
101 | bitmap_clear_range(&task->arch.iomap, (index_t) ioaddr, (count_t) size); |
||
4153 | mejdrech | 102 | |
1256 | jermar | 103 | /* |
104 | * Increment I/O Permission bitmap generation counter. |
||
105 | */ |
||
106 | task->arch.iomapver++; |
||
4153 | mejdrech | 107 | |
1191 | jermar | 108 | return 0; |
109 | } |
||
1212 | palkovsky | 110 | |
1256 | jermar | 111 | /** Install I/O Permission bitmap. |
112 | * |
||
113 | * Current task's I/O permission bitmap, if any, is installed |
||
114 | * in the current CPU's TSS. |
||
115 | * |
||
116 | * Interrupts must be disabled prior this call. |
||
117 | */ |
||
118 | void io_perm_bitmap_install(void) |
||
119 | { |
||
120 | count_t bits; |
||
121 | ptr_16_64_t cpugdtr; |
||
122 | descriptor_t *gdt_p; |
||
123 | tss_descriptor_t *tss_desc; |
||
124 | count_t ver; |
||
4153 | mejdrech | 125 | |
1256 | jermar | 126 | /* First, copy the I/O Permission Bitmap. */ |
127 | spinlock_lock(&TASK->lock); |
||
128 | ver = TASK->arch.iomapver; |
||
129 | if ((bits = TASK->arch.iomap.bits)) { |
||
130 | bitmap_t iomap; |
||
131 | |||
132 | ASSERT(TASK->arch.iomap.map); |
||
2630 | jermar | 133 | bitmap_initialize(&iomap, CPU->arch.tss->iomap, |
134 | TSS_IOMAP_SIZE * 8); |
||
1256 | jermar | 135 | bitmap_copy(&iomap, &TASK->arch.iomap, TASK->arch.iomap.bits); |
136 | /* |
||
2630 | jermar | 137 | * It is safe to set the trailing eight bits because of the |
138 | * extra convenience byte in TSS_IOMAP_SIZE. |
||
1256 | jermar | 139 | */ |
1263 | jermar | 140 | bitmap_set_range(&iomap, ALIGN_UP(TASK->arch.iomap.bits, 8), 8); |
1256 | jermar | 141 | } |
142 | spinlock_unlock(&TASK->lock); |
||
4153 | mejdrech | 143 | |
1263 | jermar | 144 | /* |
145 | * Second, adjust TSS segment limit. |
||
146 | * Take the extra ending byte will all bits set into account. |
||
147 | */ |
||
1256 | jermar | 148 | gdtr_store(&cpugdtr); |
149 | gdt_p = (descriptor_t *) cpugdtr.base; |
||
1263 | jermar | 150 | gdt_tss_setlimit(&gdt_p[TSS_DES], TSS_BASIC_SIZE + BITS2BYTES(bits)); |
1256 | jermar | 151 | gdtr_load(&cpugdtr); |
152 | |||
153 | /* |
||
4153 | mejdrech | 154 | * Before we load new TSS limit, the current TSS descriptor |
155 | * type must be changed to describe inactive TSS. |
||
156 | */ |
||
157 | tss_desc = (tss_descriptor_t *) &gdt_p[TSS_DES]; |
||
1256 | jermar | 158 | tss_desc->type = AR_TSS; |
159 | tr_load(gdtselector(TSS_DES)); |
||
160 | |||
161 | /* |
||
162 | * Update the generation count so that faults caused by |
||
163 | * early accesses can be serviced. |
||
164 | */ |
||
165 | CPU->arch.iomapver_copy = ver; |
||
166 | } |
||
1702 | cejka | 167 | |
1888 | jermar | 168 | /** @} |
1702 | cejka | 169 | */ |