Rev 2071 | Rev 2630 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2071 | Rev 2089 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Jakub Jermar |
2 | * Copyright (c) 2006 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup ia32ddi |
29 | /** @addtogroup ia32ddi |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** @file |
32 | /** @file |
33 | */ |
33 | */ |
34 | 34 | ||
35 | #include <ddi/ddi.h> |
35 | #include <ddi/ddi.h> |
36 | #include <arch/ddi/ddi.h> |
36 | #include <arch/ddi/ddi.h> |
37 | #include <proc/task.h> |
37 | #include <proc/task.h> |
38 | #include <arch/types.h> |
38 | #include <arch/types.h> |
39 | #include <typedefs.h> |
- | |
40 | #include <adt/bitmap.h> |
39 | #include <adt/bitmap.h> |
41 | #include <mm/slab.h> |
40 | #include <mm/slab.h> |
42 | #include <arch/pm.h> |
41 | #include <arch/pm.h> |
43 | #include <errno.h> |
42 | #include <errno.h> |
44 | #include <arch/cpu.h> |
43 | #include <arch/cpu.h> |
45 | #include <cpu.h> |
44 | #include <cpu.h> |
46 | #include <arch.h> |
45 | #include <arch.h> |
47 | #include <align.h> |
46 | #include <align.h> |
48 | 47 | ||
49 | /** Enable I/O space range for task. |
48 | /** Enable I/O space range for task. |
50 | * |
49 | * |
51 | * Interrupts are disabled and task is locked. |
50 | * Interrupts are disabled and task is locked. |
52 | * |
51 | * |
53 | * @param task Task. |
52 | * @param task Task. |
54 | * @param ioaddr Startign I/O space address. |
53 | * @param ioaddr Startign I/O space address. |
55 | * @param size Size of the enabled I/O range. |
54 | * @param size Size of the enabled I/O range. |
56 | * |
55 | * |
57 | * @return 0 on success or an error code from errno.h. |
56 | * @return 0 on success or an error code from errno.h. |
58 | */ |
57 | */ |
59 | int ddi_iospace_enable_arch(task_t *task, uintptr_t ioaddr, size_t size) |
58 | int ddi_iospace_enable_arch(task_t *task, uintptr_t ioaddr, size_t size) |
60 | { |
59 | { |
61 | count_t bits; |
60 | count_t bits; |
62 | 61 | ||
63 | bits = ioaddr + size; |
62 | bits = ioaddr + size; |
64 | if (bits > IO_PORTS) |
63 | if (bits > IO_PORTS) |
65 | return ENOENT; |
64 | return ENOENT; |
66 | 65 | ||
67 | if (task->arch.iomap.bits < bits) { |
66 | if (task->arch.iomap.bits < bits) { |
68 | bitmap_t oldiomap; |
67 | bitmap_t oldiomap; |
69 | uint8_t *newmap; |
68 | uint8_t *newmap; |
70 | 69 | ||
71 | /* |
70 | /* |
72 | * The I/O permission bitmap is too small and needs to be grown. |
71 | * The I/O permission bitmap is too small and needs to be grown. |
73 | */ |
72 | */ |
74 | 73 | ||
75 | newmap = (uint8_t *) malloc(BITS2BYTES(bits), FRAME_ATOMIC); |
74 | newmap = (uint8_t *) malloc(BITS2BYTES(bits), FRAME_ATOMIC); |
76 | if (!newmap) |
75 | if (!newmap) |
77 | return ENOMEM; |
76 | return ENOMEM; |
78 | 77 | ||
79 | bitmap_initialize(&oldiomap, task->arch.iomap.map, task->arch.iomap.bits); |
78 | bitmap_initialize(&oldiomap, task->arch.iomap.map, task->arch.iomap.bits); |
80 | bitmap_initialize(&task->arch.iomap, newmap, bits); |
79 | bitmap_initialize(&task->arch.iomap, newmap, bits); |
81 | 80 | ||
82 | /* |
81 | /* |
83 | * Mark the new range inaccessible. |
82 | * Mark the new range inaccessible. |
84 | */ |
83 | */ |
85 | bitmap_set_range(&task->arch.iomap, oldiomap.bits, bits - oldiomap.bits); |
84 | bitmap_set_range(&task->arch.iomap, oldiomap.bits, bits - oldiomap.bits); |
86 | 85 | ||
87 | /* |
86 | /* |
88 | * In case there really existed smaller iomap, |
87 | * In case there really existed smaller iomap, |
89 | * copy its contents and deallocate it. |
88 | * copy its contents and deallocate it. |
90 | */ |
89 | */ |
91 | if (oldiomap.bits) { |
90 | if (oldiomap.bits) { |
92 | bitmap_copy(&task->arch.iomap, &oldiomap, oldiomap.bits); |
91 | bitmap_copy(&task->arch.iomap, &oldiomap, oldiomap.bits); |
93 | free(oldiomap.map); |
92 | free(oldiomap.map); |
94 | } |
93 | } |
95 | } |
94 | } |
96 | 95 | ||
97 | /* |
96 | /* |
98 | * Enable the range and we are done. |
97 | * Enable the range and we are done. |
99 | */ |
98 | */ |
100 | bitmap_clear_range(&task->arch.iomap, (index_t) ioaddr, (count_t) size); |
99 | bitmap_clear_range(&task->arch.iomap, (index_t) ioaddr, (count_t) size); |
101 | 100 | ||
102 | /* |
101 | /* |
103 | * Increment I/O Permission bitmap generation counter. |
102 | * Increment I/O Permission bitmap generation counter. |
104 | */ |
103 | */ |
105 | task->arch.iomapver++; |
104 | task->arch.iomapver++; |
106 | 105 | ||
107 | return 0; |
106 | return 0; |
108 | } |
107 | } |
109 | 108 | ||
110 | /** Install I/O Permission bitmap. |
109 | /** Install I/O Permission bitmap. |
111 | * |
110 | * |
112 | * Current task's I/O permission bitmap, if any, is installed |
111 | * Current task's I/O permission bitmap, if any, is installed |
113 | * in the current CPU's TSS. |
112 | * in the current CPU's TSS. |
114 | * |
113 | * |
115 | * Interrupts must be disabled prior this call. |
114 | * Interrupts must be disabled prior this call. |
116 | */ |
115 | */ |
117 | void io_perm_bitmap_install(void) |
116 | void io_perm_bitmap_install(void) |
118 | { |
117 | { |
119 | count_t bits; |
118 | count_t bits; |
120 | ptr_16_32_t cpugdtr; |
119 | ptr_16_32_t cpugdtr; |
121 | descriptor_t *gdt_p; |
120 | descriptor_t *gdt_p; |
122 | count_t ver; |
121 | count_t ver; |
123 | 122 | ||
124 | /* First, copy the I/O Permission Bitmap. */ |
123 | /* First, copy the I/O Permission Bitmap. */ |
125 | spinlock_lock(&TASK->lock); |
124 | spinlock_lock(&TASK->lock); |
126 | ver = TASK->arch.iomapver; |
125 | ver = TASK->arch.iomapver; |
127 | if ((bits = TASK->arch.iomap.bits)) { |
126 | if ((bits = TASK->arch.iomap.bits)) { |
128 | bitmap_t iomap; |
127 | bitmap_t iomap; |
129 | 128 | ||
130 | ASSERT(TASK->arch.iomap.map); |
129 | ASSERT(TASK->arch.iomap.map); |
131 | bitmap_initialize(&iomap, CPU->arch.tss->iomap, TSS_IOMAP_SIZE * 8); |
130 | bitmap_initialize(&iomap, CPU->arch.tss->iomap, TSS_IOMAP_SIZE * 8); |
132 | bitmap_copy(&iomap, &TASK->arch.iomap, TASK->arch.iomap.bits); |
131 | bitmap_copy(&iomap, &TASK->arch.iomap, TASK->arch.iomap.bits); |
133 | /* |
132 | /* |
134 | * It is safe to set the trailing eight bits because of the extra |
133 | * It is safe to set the trailing eight bits because of the extra |
135 | * convenience byte in TSS_IOMAP_SIZE. |
134 | * convenience byte in TSS_IOMAP_SIZE. |
136 | */ |
135 | */ |
137 | bitmap_set_range(&iomap, ALIGN_UP(TASK->arch.iomap.bits, 8), 8); |
136 | bitmap_set_range(&iomap, ALIGN_UP(TASK->arch.iomap.bits, 8), 8); |
138 | } |
137 | } |
139 | spinlock_unlock(&TASK->lock); |
138 | spinlock_unlock(&TASK->lock); |
140 | 139 | ||
141 | /* |
140 | /* |
142 | * Second, adjust TSS segment limit. |
141 | * Second, adjust TSS segment limit. |
143 | * Take the extra ending byte with all bits set into account. |
142 | * Take the extra ending byte with all bits set into account. |
144 | */ |
143 | */ |
145 | gdtr_store(&cpugdtr); |
144 | gdtr_store(&cpugdtr); |
146 | gdt_p = (descriptor_t *) cpugdtr.base; |
145 | gdt_p = (descriptor_t *) cpugdtr.base; |
147 | gdt_setlimit(&gdt_p[TSS_DES], TSS_BASIC_SIZE + BITS2BYTES(bits)); |
146 | gdt_setlimit(&gdt_p[TSS_DES], TSS_BASIC_SIZE + BITS2BYTES(bits)); |
148 | gdtr_load(&cpugdtr); |
147 | gdtr_load(&cpugdtr); |
149 | 148 | ||
150 | /* |
149 | /* |
151 | * Before we load new TSS limit, the current TSS descriptor |
150 | * Before we load new TSS limit, the current TSS descriptor |
152 | * type must be changed to describe inactive TSS. |
151 | * type must be changed to describe inactive TSS. |
153 | */ |
152 | */ |
154 | gdt_p[TSS_DES].access = AR_PRESENT | AR_TSS | DPL_KERNEL; |
153 | gdt_p[TSS_DES].access = AR_PRESENT | AR_TSS | DPL_KERNEL; |
155 | tr_load(selector(TSS_DES)); |
154 | tr_load(selector(TSS_DES)); |
156 | 155 | ||
157 | /* |
156 | /* |
158 | * Update the generation count so that faults caused by |
157 | * Update the generation count so that faults caused by |
159 | * early accesses can be serviced. |
158 | * early accesses can be serviced. |
160 | */ |
159 | */ |
161 | CPU->arch.iomapver_copy = ver; |
160 | CPU->arch.iomapver_copy = ver; |
162 | } |
161 | } |
163 | 162 | ||
164 | /** @} |
163 | /** @} |
165 | */ |
164 | */ |
166 | 165 |