Rev 1923 | Rev 2089 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1923 | Rev 1933 | ||
---|---|---|---|
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 genericddi |
29 | /** @addtogroup genericddi |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** |
32 | /** |
33 | * @file |
33 | * @file |
34 | * @brief IRQ dispatcher. |
34 | * @brief IRQ dispatcher. |
35 | * |
35 | * |
36 | * This file provides means of connecting IRQs with particular |
36 | * This file provides means of connecting IRQs with particular |
37 | * devices and logic for dispatching interrupts to IRQ handlers |
37 | * devices and logic for dispatching interrupts to IRQ handlers |
38 | * defined by those devices. |
38 | * defined by those devices. |
39 | * |
39 | * |
40 | * This code is designed to support: |
40 | * This code is designed to support: |
41 | * - multiple devices sharing single IRQ |
41 | * - multiple devices sharing single IRQ |
42 | * - multiple IRQs per signle device |
42 | * - multiple IRQs per signle device |
43 | * |
43 | * |
44 | * |
44 | * |
45 | * Note about architectures. |
45 | * Note about architectures. |
46 | * |
46 | * |
47 | * Some architectures has the term IRQ well defined. Examples |
47 | * Some architectures has the term IRQ well defined. Examples |
48 | * of such architectures include amd64, ia32 and mips32. Some |
48 | * of such architectures include amd64, ia32 and mips32. Some |
49 | * other architectures, such as sparc64, don't use the term |
49 | * other architectures, such as sparc64, don't use the term |
50 | * at all. In those cases, we boldly step forward and define what |
50 | * at all. In those cases, we boldly step forward and define what |
51 | * an IRQ is. |
51 | * an IRQ is. |
52 | * |
52 | * |
53 | * The implementation is generic enough and still allows the |
53 | * The implementation is generic enough and still allows the |
54 | * architectures to use the hardware layout effectively. |
54 | * architectures to use the hardware layout effectively. |
55 | * For instance, on amd64 and ia32, where there is only 16 |
55 | * For instance, on amd64 and ia32, where there is only 16 |
56 | * IRQs, the irq_hash_table can be optimized to a one-dimensional |
56 | * IRQs, the irq_hash_table can be optimized to a one-dimensional |
57 | * array. Next, when it is known that the IRQ numbers (aka INR's) |
57 | * array. Next, when it is known that the IRQ numbers (aka INR's) |
58 | * are unique, the claim functions can always return IRQ_ACCEPT. |
58 | * are unique, the claim functions can always return IRQ_ACCEPT. |
59 | * |
59 | * |
60 | * |
60 | * |
61 | * Note about the irq_hash_table. |
61 | * Note about the irq_hash_table. |
62 | * |
62 | * |
63 | * The hash table is configured to use two keys: inr and devno. |
63 | * The hash table is configured to use two keys: inr and devno. |
64 | * However, the hash index is computed only from inr. Moreover, |
64 | * However, the hash index is computed only from inr. Moreover, |
65 | * if devno is -1, the match is based on the return value of |
65 | * if devno is -1, the match is based on the return value of |
66 | * the claim() function instead of on devno. |
66 | * the claim() function instead of on devno. |
67 | */ |
67 | */ |
68 | 68 | ||
69 | #include <ddi/irq.h> |
69 | #include <ddi/irq.h> |
70 | #include <adt/hash_table.h> |
70 | #include <adt/hash_table.h> |
71 | #include <arch/types.h> |
71 | #include <arch/types.h> |
72 | #include <typedefs.h> |
72 | #include <typedefs.h> |
73 | #include <synch/spinlock.h> |
73 | #include <synch/spinlock.h> |
74 | #include <arch.h> |
74 | #include <arch.h> |
75 | 75 | ||
76 | #define KEY_INR 0 |
76 | #define KEY_INR 0 |
77 | #define KEY_DEVNO 1 |
77 | #define KEY_DEVNO 1 |
78 | 78 | ||
79 | /** |
79 | /** |
80 | * Spinlock protecting the hash table. |
80 | * Spinlock protecting the hash table. |
81 | * This lock must be taken only when interrupts are disabled. |
81 | * This lock must be taken only when interrupts are disabled. |
82 | */ |
82 | */ |
83 | SPINLOCK_INITIALIZE(irq_hash_table_lock); |
83 | SPINLOCK_INITIALIZE(irq_hash_table_lock); |
84 | static hash_table_t irq_hash_table; |
84 | static hash_table_t irq_hash_table; |
85 | 85 | ||
86 | /** |
86 | /** |
87 | * Hash table operations for cases when we know that |
87 | * Hash table operations for cases when we know that |
88 | * there will be collisions between different keys. |
88 | * there will be collisions between different keys. |
89 | */ |
89 | */ |
90 | static index_t irq_ht_hash(unative_t *key); |
90 | static index_t irq_ht_hash(unative_t *key); |
91 | static bool irq_ht_compare(unative_t *key, count_t keys, link_t *item); |
91 | static bool irq_ht_compare(unative_t *key, count_t keys, link_t *item); |
92 | 92 | ||
93 | static hash_table_operations_t irq_ht_ops = { |
93 | static hash_table_operations_t irq_ht_ops = { |
94 | .hash = irq_ht_hash, |
94 | .hash = irq_ht_hash, |
95 | .compare = irq_ht_compare, |
95 | .compare = irq_ht_compare, |
96 | .remove_callback = NULL /* not used */ |
96 | .remove_callback = NULL /* not used */ |
97 | }; |
97 | }; |
98 | 98 | ||
99 | /** |
99 | /** |
100 | * Hash table operations for cases when we know that |
100 | * Hash table operations for cases when we know that |
101 | * there will be no collisions between different keys. |
101 | * there will be no collisions between different keys. |
102 | * However, there might be still collisions among |
102 | * However, there might be still collisions among |
103 | * elements with single key (sharing of one IRQ). |
103 | * elements with single key (sharing of one IRQ). |
104 | */ |
104 | */ |
105 | static index_t irq_lin_hash(unative_t *key); |
105 | static index_t irq_lin_hash(unative_t *key); |
106 | static bool irq_lin_compare(unative_t *key, count_t keys, link_t *item); |
106 | static bool irq_lin_compare(unative_t *key, count_t keys, link_t *item); |
107 | 107 | ||
108 | static hash_table_operations_t irq_lin_ops = { |
108 | static hash_table_operations_t irq_lin_ops = { |
109 | .hash = irq_lin_hash, |
109 | .hash = irq_lin_hash, |
110 | .compare = irq_lin_compare, |
110 | .compare = irq_lin_compare, |
111 | .remove_callback = NULL /* not used */ |
111 | .remove_callback = NULL /* not used */ |
112 | }; |
112 | }; |
113 | 113 | ||
114 | /** Initialize IRQ subsystem. |
114 | /** Initialize IRQ subsystem. |
115 | * |
115 | * |
116 | * @param inrs Numbers of unique IRQ numbers or INRs. |
116 | * @param inrs Numbers of unique IRQ numbers or INRs. |
117 | * @param chains Number of chains in the hash table. |
117 | * @param chains Number of chains in the hash table. |
118 | */ |
118 | */ |
119 | void irq_init(count_t inrs, count_t chains) |
119 | void irq_init(count_t inrs, count_t chains) |
120 | { |
120 | { |
121 | /* |
121 | /* |
122 | * Be smart about the choice of the hash table operations. |
122 | * Be smart about the choice of the hash table operations. |
123 | * In cases in which inrs equals the requested number of |
123 | * In cases in which inrs equals the requested number of |
124 | * chains (i.e. where there is no collision between |
124 | * chains (i.e. where there is no collision between |
125 | * different keys), we can use optimized set of operations. |
125 | * different keys), we can use optimized set of operations. |
126 | */ |
126 | */ |
127 | if (inrs == chains) |
127 | if (inrs == chains) |
128 | hash_table_create(&irq_hash_table, chains, 2, &irq_lin_ops); |
128 | hash_table_create(&irq_hash_table, chains, 2, &irq_lin_ops); |
129 | else |
129 | else |
130 | hash_table_create(&irq_hash_table, chains, 2, &irq_ht_ops); |
130 | hash_table_create(&irq_hash_table, chains, 2, &irq_ht_ops); |
131 | } |
131 | } |
132 | 132 | ||
133 | /** Initialize one IRQ structure. |
133 | /** Initialize one IRQ structure. |
134 | * |
134 | * |
135 | * @param irq Pointer to the IRQ structure to be initialized. |
135 | * @param irq Pointer to the IRQ structure to be initialized. |
136 | * |
136 | * |
137 | */ |
137 | */ |
138 | void irq_initialize(irq_t *irq) |
138 | void irq_initialize(irq_t *irq) |
139 | { |
139 | { |
140 | link_initialize(&irq->link); |
140 | link_initialize(&irq->link); |
141 | spinlock_initialize(&irq->lock, "irq.lock"); |
141 | spinlock_initialize(&irq->lock, "irq.lock"); |
142 | irq->inr = -1; |
142 | irq->inr = -1; |
143 | irq->devno = -1; |
143 | irq->devno = -1; |
144 | irq->trigger = 0; |
144 | irq->trigger = 0; |
145 | irq->claim = NULL; |
145 | irq->claim = NULL; |
146 | irq->handler = NULL; |
146 | irq->handler = NULL; |
147 | irq->arg = NULL; |
147 | irq->arg = NULL; |
- | 148 | irq->notif_cfg.notify = false; |
|
148 | irq->notif_cfg.answerbox = NULL; |
149 | irq->notif_cfg.answerbox = NULL; |
149 | irq->notif_cfg.code = NULL; |
150 | irq->notif_cfg.code = NULL; |
150 | irq->notif_cfg.method = 0; |
151 | irq->notif_cfg.method = 0; |
151 | irq->notif_cfg.counter = 0; |
152 | irq->notif_cfg.counter = 0; |
- | 153 | link_initialize(&irq->notif_cfg.link); |
|
152 | } |
154 | } |
153 | 155 | ||
154 | /** Register IRQ for device. |
156 | /** Register IRQ for device. |
155 | * |
157 | * |
156 | * The irq structure must be filled with information |
158 | * The irq structure must be filled with information |
157 | * about the interrupt source and with the claim() |
159 | * about the interrupt source and with the claim() |
158 | * function pointer and irq_handler() function pointer. |
160 | * function pointer and irq_handler() function pointer. |
159 | * |
161 | * |
160 | * @param irq IRQ structure belonging to a device. |
162 | * @param irq IRQ structure belonging to a device. |
161 | */ |
163 | */ |
162 | void irq_register(irq_t *irq) |
164 | void irq_register(irq_t *irq) |
163 | { |
165 | { |
164 | ipl_t ipl; |
166 | ipl_t ipl; |
165 | unative_t key[] = { |
167 | unative_t key[] = { |
166 | (unative_t) irq->inr, |
168 | (unative_t) irq->inr, |
167 | (unative_t) irq->devno |
169 | (unative_t) irq->devno |
168 | }; |
170 | }; |
169 | 171 | ||
170 | ipl = interrupts_disable(); |
172 | ipl = interrupts_disable(); |
171 | spinlock_lock(&irq_hash_table_lock); |
173 | spinlock_lock(&irq_hash_table_lock); |
172 | hash_table_insert(&irq_hash_table, key, &irq->link); |
174 | hash_table_insert(&irq_hash_table, key, &irq->link); |
173 | spinlock_unlock(&irq_hash_table_lock); |
175 | spinlock_unlock(&irq_hash_table_lock); |
174 | interrupts_restore(ipl); |
176 | interrupts_restore(ipl); |
175 | } |
177 | } |
176 | 178 | ||
177 | /** Dispatch the IRQ. |
179 | /** Dispatch the IRQ. |
178 | * |
180 | * |
179 | * We assume this function is only called from interrupt |
181 | * We assume this function is only called from interrupt |
180 | * context (i.e. that interrupts are disabled prior to |
182 | * context (i.e. that interrupts are disabled prior to |
181 | * this call). |
183 | * this call). |
182 | * |
184 | * |
183 | * This function attempts to lookup a fitting IRQ |
185 | * This function attempts to lookup a fitting IRQ |
184 | * structure. In case of success, return with interrupts |
186 | * structure. In case of success, return with interrupts |
185 | * disabled and holding the respective structure. |
187 | * disabled and holding the respective structure. |
186 | * |
188 | * |
187 | * @param inr Interrupt number (aka inr or irq). |
189 | * @param inr Interrupt number (aka inr or irq). |
188 | * |
190 | * |
189 | * @return IRQ structure of the respective device or NULL. |
191 | * @return IRQ structure of the respective device or NULL. |
190 | */ |
192 | */ |
191 | irq_t *irq_dispatch_and_lock(inr_t inr) |
193 | irq_t *irq_dispatch_and_lock(inr_t inr) |
192 | { |
194 | { |
193 | link_t *lnk; |
195 | link_t *lnk; |
194 | unative_t key[] = { |
196 | unative_t key[] = { |
195 | (unative_t) inr, |
197 | (unative_t) inr, |
196 | (unative_t) -1 /* search will use claim() instead of devno */ |
198 | (unative_t) -1 /* search will use claim() instead of devno */ |
197 | }; |
199 | }; |
198 | 200 | ||
199 | spinlock_lock(&irq_hash_table_lock); |
201 | spinlock_lock(&irq_hash_table_lock); |
200 | 202 | ||
201 | lnk = hash_table_find(&irq_hash_table, key); |
203 | lnk = hash_table_find(&irq_hash_table, key); |
202 | if (lnk) { |
204 | if (lnk) { |
203 | irq_t *irq; |
205 | irq_t *irq; |
204 | 206 | ||
205 | irq = hash_table_get_instance(lnk, irq_t, link); |
207 | irq = hash_table_get_instance(lnk, irq_t, link); |
206 | 208 | ||
207 | spinlock_unlock(&irq_hash_table_lock); |
209 | spinlock_unlock(&irq_hash_table_lock); |
208 | return irq; |
210 | return irq; |
209 | } |
211 | } |
210 | 212 | ||
211 | spinlock_unlock(&irq_hash_table_lock); |
213 | spinlock_unlock(&irq_hash_table_lock); |
212 | 214 | ||
213 | return NULL; |
215 | return NULL; |
214 | } |
216 | } |
215 | 217 | ||
216 | /** Find the IRQ structure corresponding to inr and devno. |
218 | /** Find the IRQ structure corresponding to inr and devno. |
217 | * |
219 | * |
218 | * This functions attempts to lookup the IRQ structure |
220 | * This functions attempts to lookup the IRQ structure |
219 | * corresponding to its arguments. On success, this |
221 | * corresponding to its arguments. On success, this |
220 | * function returns with interrups disabled, holding |
222 | * function returns with interrups disabled, holding |
221 | * the lock of the respective IRQ structure. |
223 | * the lock of the respective IRQ structure. |
222 | * |
224 | * |
223 | * This function assumes interrupts are already disabled. |
225 | * This function assumes interrupts are already disabled. |
224 | * |
226 | * |
225 | * @param inr INR being looked up. |
227 | * @param inr INR being looked up. |
226 | * @param devno Devno being looked up. |
228 | * @param devno Devno being looked up. |
227 | * |
229 | * |
228 | * @return Locked IRQ structure on success or NULL on failure. |
230 | * @return Locked IRQ structure on success or NULL on failure. |
229 | */ |
231 | */ |
230 | irq_t *irq_find_and_lock(inr_t inr, devno_t devno) |
232 | irq_t *irq_find_and_lock(inr_t inr, devno_t devno) |
231 | { |
233 | { |
232 | link_t *lnk; |
234 | link_t *lnk; |
233 | unative_t keys[] = { |
235 | unative_t keys[] = { |
234 | (unative_t) inr, |
236 | (unative_t) inr, |
235 | (unative_t) devno |
237 | (unative_t) devno |
236 | }; |
238 | }; |
237 | 239 | ||
238 | spinlock_lock(&irq_hash_table_lock); |
240 | spinlock_lock(&irq_hash_table_lock); |
239 | 241 | ||
240 | lnk = hash_table_find(&irq_hash_table, keys); |
242 | lnk = hash_table_find(&irq_hash_table, keys); |
241 | if (lnk) { |
243 | if (lnk) { |
242 | irq_t *irq; |
244 | irq_t *irq; |
243 | 245 | ||
244 | irq = hash_table_get_instance(lnk, irq_t, link); |
246 | irq = hash_table_get_instance(lnk, irq_t, link); |
245 | 247 | ||
246 | spinlock_unlock(&irq_hash_table_lock); |
248 | spinlock_unlock(&irq_hash_table_lock); |
247 | return irq; |
249 | return irq; |
248 | } |
250 | } |
249 | 251 | ||
250 | spinlock_unlock(&irq_hash_table_lock); |
252 | spinlock_unlock(&irq_hash_table_lock); |
251 | 253 | ||
252 | return NULL; |
254 | return NULL; |
253 | } |
255 | } |
254 | 256 | ||
255 | /** Compute hash index for the key. |
257 | /** Compute hash index for the key. |
256 | * |
258 | * |
257 | * This function computes hash index into |
259 | * This function computes hash index into |
258 | * the IRQ hash table for which there |
260 | * the IRQ hash table for which there |
259 | * can be collisions between different |
261 | * can be collisions between different |
260 | * INRs. |
262 | * INRs. |
261 | * |
263 | * |
262 | * The devno is not used to compute the hash. |
264 | * The devno is not used to compute the hash. |
263 | * |
265 | * |
264 | * @param key The first of the keys is inr and the second is devno or -1. |
266 | * @param key The first of the keys is inr and the second is devno or -1. |
265 | * |
267 | * |
266 | * @return Index into the hash table. |
268 | * @return Index into the hash table. |
267 | */ |
269 | */ |
268 | index_t irq_ht_hash(unative_t key[]) |
270 | index_t irq_ht_hash(unative_t key[]) |
269 | { |
271 | { |
270 | inr_t inr = (inr_t) key[KEY_INR]; |
272 | inr_t inr = (inr_t) key[KEY_INR]; |
271 | return inr % irq_hash_table.entries; |
273 | return inr % irq_hash_table.entries; |
272 | } |
274 | } |
273 | 275 | ||
274 | /** Compare hash table element with a key. |
276 | /** Compare hash table element with a key. |
275 | * |
277 | * |
276 | * There are two things to note about this function. |
278 | * There are two things to note about this function. |
277 | * First, it is used for the more complex architecture setup |
279 | * First, it is used for the more complex architecture setup |
278 | * in which there are way too many interrupt numbers (i.e. inr's) |
280 | * in which there are way too many interrupt numbers (i.e. inr's) |
279 | * to arrange the hash table so that collisions occur only |
281 | * to arrange the hash table so that collisions occur only |
280 | * among same inrs of different devnos. So the explicit check |
282 | * among same inrs of different devnos. So the explicit check |
281 | * for inr match must be done. |
283 | * for inr match must be done. |
282 | * Second, if devno is -1, the second key (i.e. devno) is not |
284 | * Second, if devno is -1, the second key (i.e. devno) is not |
283 | * used for the match and the result of the claim() function |
285 | * used for the match and the result of the claim() function |
284 | * is used instead. |
286 | * is used instead. |
285 | * |
287 | * |
286 | * This function assumes interrupts are already disabled. |
288 | * This function assumes interrupts are already disabled. |
287 | * |
289 | * |
288 | * @param key Keys (i.e. inr and devno). |
290 | * @param key Keys (i.e. inr and devno). |
289 | * @param keys This is 2. |
291 | * @param keys This is 2. |
290 | * @param item The item to compare the key with. |
292 | * @param item The item to compare the key with. |
291 | * |
293 | * |
292 | * @return True on match or false otherwise. |
294 | * @return True on match or false otherwise. |
293 | */ |
295 | */ |
294 | bool irq_ht_compare(unative_t key[], count_t keys, link_t *item) |
296 | bool irq_ht_compare(unative_t key[], count_t keys, link_t *item) |
295 | { |
297 | { |
296 | irq_t *irq = hash_table_get_instance(item, irq_t, link); |
298 | irq_t *irq = hash_table_get_instance(item, irq_t, link); |
297 | inr_t inr = (inr_t) key[KEY_INR]; |
299 | inr_t inr = (inr_t) key[KEY_INR]; |
298 | devno_t devno = (devno_t) key[KEY_DEVNO]; |
300 | devno_t devno = (devno_t) key[KEY_DEVNO]; |
299 | 301 | ||
300 | bool rv; |
302 | bool rv; |
301 | 303 | ||
302 | spinlock_lock(&irq->lock); |
304 | spinlock_lock(&irq->lock); |
303 | if (devno == -1) { |
305 | if (devno == -1) { |
304 | /* Invoked by irq_dispatch(). */ |
306 | /* Invoked by irq_dispatch(). */ |
305 | rv = ((irq->inr == inr) && (irq->claim() == IRQ_ACCEPT)); |
307 | rv = ((irq->inr == inr) && (irq->claim() == IRQ_ACCEPT)); |
306 | } else { |
308 | } else { |
307 | /* Invoked by irq_find(). */ |
309 | /* Invoked by irq_find(). */ |
308 | rv = ((irq->inr == inr) && (irq->devno == devno)); |
310 | rv = ((irq->inr == inr) && (irq->devno == devno)); |
309 | } |
311 | } |
310 | 312 | ||
311 | /* unlock only on non-match */ |
313 | /* unlock only on non-match */ |
312 | if (!rv) |
314 | if (!rv) |
313 | spinlock_unlock(&irq->lock); |
315 | spinlock_unlock(&irq->lock); |
314 | 316 | ||
315 | return rv; |
317 | return rv; |
316 | } |
318 | } |
317 | 319 | ||
318 | /** Compute hash index for the key. |
320 | /** Compute hash index for the key. |
319 | * |
321 | * |
320 | * This function computes hash index into |
322 | * This function computes hash index into |
321 | * the IRQ hash table for which there |
323 | * the IRQ hash table for which there |
322 | * are no collisions between different |
324 | * are no collisions between different |
323 | * INRs. |
325 | * INRs. |
324 | * |
326 | * |
325 | * @param key The first of the keys is inr and the second is devno or -1. |
327 | * @param key The first of the keys is inr and the second is devno or -1. |
326 | * |
328 | * |
327 | * @return Index into the hash table. |
329 | * @return Index into the hash table. |
328 | */ |
330 | */ |
329 | index_t irq_lin_hash(unative_t key[]) |
331 | index_t irq_lin_hash(unative_t key[]) |
330 | { |
332 | { |
331 | inr_t inr = (inr_t) key[KEY_INR]; |
333 | inr_t inr = (inr_t) key[KEY_INR]; |
332 | return inr; |
334 | return inr; |
333 | } |
335 | } |
334 | 336 | ||
335 | /** Compare hash table element with a key. |
337 | /** Compare hash table element with a key. |
336 | * |
338 | * |
337 | * There are two things to note about this function. |
339 | * There are two things to note about this function. |
338 | * First, it is used for the less complex architecture setup |
340 | * First, it is used for the less complex architecture setup |
339 | * in which there are not too many interrupt numbers (i.e. inr's) |
341 | * in which there are not too many interrupt numbers (i.e. inr's) |
340 | * to arrange the hash table so that collisions occur only |
342 | * to arrange the hash table so that collisions occur only |
341 | * among same inrs of different devnos. So the explicit check |
343 | * among same inrs of different devnos. So the explicit check |
342 | * for inr match is not done. |
344 | * for inr match is not done. |
343 | * Second, if devno is -1, the second key (i.e. devno) is not |
345 | * Second, if devno is -1, the second key (i.e. devno) is not |
344 | * used for the match and the result of the claim() function |
346 | * used for the match and the result of the claim() function |
345 | * is used instead. |
347 | * is used instead. |
346 | * |
348 | * |
347 | * This function assumes interrupts are already disabled. |
349 | * This function assumes interrupts are already disabled. |
348 | * |
350 | * |
349 | * @param key Keys (i.e. inr and devno). |
351 | * @param key Keys (i.e. inr and devno). |
350 | * @param keys This is 2. |
352 | * @param keys This is 2. |
351 | * @param item The item to compare the key with. |
353 | * @param item The item to compare the key with. |
352 | * |
354 | * |
353 | * @return True on match or false otherwise. |
355 | * @return True on match or false otherwise. |
354 | */ |
356 | */ |
355 | bool irq_lin_compare(unative_t key[], count_t keys, link_t *item) |
357 | bool irq_lin_compare(unative_t key[], count_t keys, link_t *item) |
356 | { |
358 | { |
357 | irq_t *irq = list_get_instance(item, irq_t, link); |
359 | irq_t *irq = list_get_instance(item, irq_t, link); |
358 | devno_t devno = (devno_t) key[KEY_DEVNO]; |
360 | devno_t devno = (devno_t) key[KEY_DEVNO]; |
359 | bool rv; |
361 | bool rv; |
360 | 362 | ||
361 | spinlock_lock(&irq->lock); |
363 | spinlock_lock(&irq->lock); |
362 | if (devno == -1) { |
364 | if (devno == -1) { |
363 | /* Invoked by irq_dispatch() */ |
365 | /* Invoked by irq_dispatch() */ |
364 | rv = (irq->claim() == IRQ_ACCEPT); |
366 | rv = (irq->claim() == IRQ_ACCEPT); |
365 | } else { |
367 | } else { |
366 | /* Invoked by irq_find() */ |
368 | /* Invoked by irq_find() */ |
367 | rv = (irq->devno == devno); |
369 | rv = (irq->devno == devno); |
368 | } |
370 | } |
369 | 371 | ||
370 | /* unlock only on non-match */ |
372 | /* unlock only on non-match */ |
371 | if (!rv) |
373 | if (!rv) |
372 | spinlock_unlock(&irq->lock); |
374 | spinlock_unlock(&irq->lock); |
373 | 375 | ||
374 | return rv; |
376 | return rv; |
375 | } |
377 | } |
376 | 378 | ||
377 | /** @} |
379 | /** @} |
378 | */ |
380 | */ |
379 | 381 |