blob: c632437c7649db90d22219e0ad421caafb8e5db2 [file] [log] [blame]
David Vrabel7e6133a2008-09-17 16:34:28 +01001/*
2 * Wireless Host Controller (WHC) asynchronous schedule management.
3 *
4 * Copyright (C) 2007 Cambridge Silicon Radio Ltd.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License version
8 * 2 as published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
17 */
18#include <linux/kernel.h>
19#include <linux/dma-mapping.h>
20#include <linux/uwb/umc.h>
21#include <linux/usb.h>
David Vrabel7e6133a2008-09-17 16:34:28 +010022
23#include "../../wusbcore/wusbhc.h"
24
25#include "whcd.h"
26
David Vrabel7e6133a2008-09-17 16:34:28 +010027static void qset_get_next_prev(struct whc *whc, struct whc_qset *qset,
28 struct whc_qset **next, struct whc_qset **prev)
29{
30 struct list_head *n, *p;
31
32 BUG_ON(list_empty(&whc->async_list));
33
34 n = qset->list_node.next;
35 if (n == &whc->async_list)
36 n = n->next;
37 p = qset->list_node.prev;
38 if (p == &whc->async_list)
39 p = p->prev;
40
41 *next = container_of(n, struct whc_qset, list_node);
42 *prev = container_of(p, struct whc_qset, list_node);
43
44}
45
46static void asl_qset_insert_begin(struct whc *whc, struct whc_qset *qset)
47{
48 list_move(&qset->list_node, &whc->async_list);
49 qset->in_sw_list = true;
50}
51
52static void asl_qset_insert(struct whc *whc, struct whc_qset *qset)
53{
54 struct whc_qset *next, *prev;
55
56 qset_clear(whc, qset);
57
58 /* Link into ASL. */
59 qset_get_next_prev(whc, qset, &next, &prev);
60 whc_qset_set_link_ptr(&qset->qh.link, next->qset_dma);
61 whc_qset_set_link_ptr(&prev->qh.link, qset->qset_dma);
62 qset->in_hw_list = true;
63}
64
65static void asl_qset_remove(struct whc *whc, struct whc_qset *qset)
66{
67 struct whc_qset *prev, *next;
68
69 qset_get_next_prev(whc, qset, &next, &prev);
70
71 list_move(&qset->list_node, &whc->async_removed_list);
72 qset->in_sw_list = false;
73
74 /*
75 * No more qsets in the ASL? The caller must stop the ASL as
76 * it's no longer valid.
77 */
78 if (list_empty(&whc->async_list))
79 return;
80
81 /* Remove from ASL. */
82 whc_qset_set_link_ptr(&prev->qh.link, next->qset_dma);
83 qset->in_hw_list = false;
84}
85
86/**
87 * process_qset - process any recently inactivated or halted qTDs in a
88 * qset.
89 *
90 * After inactive qTDs are removed, new qTDs can be added if the
91 * urb queue still contains URBs.
92 *
93 * Returns any additional WUSBCMD bits for the ASL sync command (i.e.,
94 * WUSBCMD_ASYNC_QSET_RM if a halted qset was removed).
95 */
96static uint32_t process_qset(struct whc *whc, struct whc_qset *qset)
97{
98 enum whc_update update = 0;
99 uint32_t status = 0;
100
101 while (qset->ntds) {
102 struct whc_qtd *td;
103 int t;
104
105 t = qset->td_start;
106 td = &qset->qtd[qset->td_start];
107 status = le32_to_cpu(td->status);
108
109 /*
110 * Nothing to do with a still active qTD.
111 */
112 if (status & QTD_STS_ACTIVE)
113 break;
114
115 if (status & QTD_STS_HALTED) {
116 /* Ug, an error. */
117 process_halted_qtd(whc, qset, td);
118 goto done;
119 }
120
121 /* Mmm, a completed qTD. */
122 process_inactive_qtd(whc, qset, td);
123 }
124
David Vrabel7f0406d2009-04-08 17:36:29 +0000125 if (!qset->remove)
126 update |= qset_add_qtds(whc, qset);
David Vrabel7e6133a2008-09-17 16:34:28 +0100127
128done:
129 /*
130 * Remove this qset from the ASL if requested, but only if has
131 * no qTDs.
132 */
133 if (qset->remove && qset->ntds == 0) {
134 asl_qset_remove(whc, qset);
135 update |= WHC_UPDATE_REMOVED;
136 }
137 return update;
138}
139
140void asl_start(struct whc *whc)
141{
142 struct whc_qset *qset;
143
144 qset = list_first_entry(&whc->async_list, struct whc_qset, list_node);
145
146 le_writeq(qset->qset_dma | QH_LINK_NTDS(8), whc->base + WUSBASYNCLISTADDR);
147
148 whc_write_wusbcmd(whc, WUSBCMD_ASYNC_EN, WUSBCMD_ASYNC_EN);
149 whci_wait_for(&whc->umc->dev, whc->base + WUSBSTS,
150 WUSBSTS_ASYNC_SCHED, WUSBSTS_ASYNC_SCHED,
151 1000, "start ASL");
152}
153
154void asl_stop(struct whc *whc)
155{
156 whc_write_wusbcmd(whc, WUSBCMD_ASYNC_EN, 0);
157 whci_wait_for(&whc->umc->dev, whc->base + WUSBSTS,
158 WUSBSTS_ASYNC_SCHED, 0,
159 1000, "stop ASL");
160}
161
David Vrabel56968d02008-11-25 14:23:40 +0000162/**
163 * asl_update - request an ASL update and wait for the hardware to be synced
164 * @whc: the WHCI HC
165 * @wusbcmd: WUSBCMD value to start the update.
166 *
167 * If the WUSB HC is inactive (i.e., the ASL is stopped) then the
168 * update must be skipped as the hardware may not respond to update
169 * requests.
170 */
David Vrabel7e6133a2008-09-17 16:34:28 +0100171void asl_update(struct whc *whc, uint32_t wusbcmd)
172{
David Vrabel56968d02008-11-25 14:23:40 +0000173 struct wusbhc *wusbhc = &whc->wusbhc;
David Vrabela5e6ced2009-01-07 10:54:22 +0000174 long t;
David Vrabel56968d02008-11-25 14:23:40 +0000175
176 mutex_lock(&wusbhc->mutex);
177 if (wusbhc->active) {
178 whc_write_wusbcmd(whc, wusbcmd, wusbcmd);
David Vrabela5e6ced2009-01-07 10:54:22 +0000179 t = wait_event_timeout(
180 whc->async_list_wq,
181 (le_readl(whc->base + WUSBCMD) & WUSBCMD_ASYNC_UPDATED) == 0,
182 msecs_to_jiffies(1000));
183 if (t == 0)
184 whc_hw_error(whc, "ASL update timeout");
David Vrabel56968d02008-11-25 14:23:40 +0000185 }
186 mutex_unlock(&wusbhc->mutex);
David Vrabel7e6133a2008-09-17 16:34:28 +0100187}
188
189/**
190 * scan_async_work - scan the ASL for qsets to process.
191 *
192 * Process each qset in the ASL in turn and then signal the WHC that
193 * the ASL has been updated.
194 *
195 * Then start, stop or update the asynchronous schedule as required.
196 */
197void scan_async_work(struct work_struct *work)
198{
199 struct whc *whc = container_of(work, struct whc, async_work);
200 struct whc_qset *qset, *t;
201 enum whc_update update = 0;
202
203 spin_lock_irq(&whc->lock);
204
David Vrabel7e6133a2008-09-17 16:34:28 +0100205 /*
206 * Transerve the software list backwards so new qsets can be
207 * safely inserted into the ASL without making it non-circular.
208 */
209 list_for_each_entry_safe_reverse(qset, t, &whc->async_list, list_node) {
210 if (!qset->in_hw_list) {
211 asl_qset_insert(whc, qset);
212 update |= WHC_UPDATE_ADDED;
213 }
214
215 update |= process_qset(whc, qset);
216 }
217
David Vrabel7e6133a2008-09-17 16:34:28 +0100218 spin_unlock_irq(&whc->lock);
219
220 if (update) {
221 uint32_t wusbcmd = WUSBCMD_ASYNC_UPDATED | WUSBCMD_ASYNC_SYNCED_DB;
222 if (update & WHC_UPDATE_REMOVED)
223 wusbcmd |= WUSBCMD_ASYNC_QSET_RM;
224 asl_update(whc, wusbcmd);
225 }
226
227 /*
228 * Now that the ASL is updated, complete the removal of any
229 * removed qsets.
David Vrabel831baa42009-06-24 18:26:40 +0100230 *
231 * If the qset was to be reset, do so and reinsert it into the
232 * ASL if it has pending transfers.
David Vrabel7e6133a2008-09-17 16:34:28 +0100233 */
David Vrabela3c12392009-02-16 14:37:12 +0000234 spin_lock_irq(&whc->lock);
David Vrabel7e6133a2008-09-17 16:34:28 +0100235
236 list_for_each_entry_safe(qset, t, &whc->async_removed_list, list_node) {
237 qset_remove_complete(whc, qset);
David Vrabel831baa42009-06-24 18:26:40 +0100238 if (qset->reset) {
239 qset_reset(whc, qset);
240 if (!list_empty(&qset->stds)) {
241 asl_qset_insert_begin(whc, qset);
242 queue_work(whc->workqueue, &whc->async_work);
243 }
244 }
David Vrabel7e6133a2008-09-17 16:34:28 +0100245 }
246
David Vrabela3c12392009-02-16 14:37:12 +0000247 spin_unlock_irq(&whc->lock);
David Vrabel7e6133a2008-09-17 16:34:28 +0100248}
249
250/**
251 * asl_urb_enqueue - queue an URB onto the asynchronous list (ASL).
252 * @whc: the WHCI host controller
253 * @urb: the URB to enqueue
254 * @mem_flags: flags for any memory allocations
255 *
256 * The qset for the endpoint is obtained and the urb queued on to it.
257 *
258 * Work is scheduled to update the hardware's view of the ASL.
259 */
260int asl_urb_enqueue(struct whc *whc, struct urb *urb, gfp_t mem_flags)
261{
262 struct whc_qset *qset;
263 int err;
264 unsigned long flags;
265
266 spin_lock_irqsave(&whc->lock, flags);
267
David Vrabelf720af92009-04-08 17:36:31 +0000268 err = usb_hcd_link_urb_to_ep(&whc->wusbhc.usb_hcd, urb);
269 if (err < 0) {
270 spin_unlock_irqrestore(&whc->lock, flags);
271 return err;
272 }
273
David Vrabel7e6133a2008-09-17 16:34:28 +0100274 qset = get_qset(whc, urb, GFP_ATOMIC);
275 if (qset == NULL)
276 err = -ENOMEM;
277 else
278 err = qset_add_urb(whc, qset, urb, GFP_ATOMIC);
279 if (!err) {
David Vrabel831baa42009-06-24 18:26:40 +0100280 if (!qset->in_sw_list && !qset->remove)
David Vrabel7e6133a2008-09-17 16:34:28 +0100281 asl_qset_insert_begin(whc, qset);
David Vrabelf720af92009-04-08 17:36:31 +0000282 } else
283 usb_hcd_unlink_urb_from_ep(&whc->wusbhc.usb_hcd, urb);
David Vrabel7e6133a2008-09-17 16:34:28 +0100284
285 spin_unlock_irqrestore(&whc->lock, flags);
286
287 if (!err)
288 queue_work(whc->workqueue, &whc->async_work);
289
David Vrabelf720af92009-04-08 17:36:31 +0000290 return err;
David Vrabel7e6133a2008-09-17 16:34:28 +0100291}
292
293/**
294 * asl_urb_dequeue - remove an URB (qset) from the async list.
295 * @whc: the WHCI host controller
296 * @urb: the URB to dequeue
297 * @status: the current status of the URB
298 *
299 * URBs that do yet have qTDs can simply be removed from the software
300 * queue, otherwise the qset must be removed from the ASL so the qTDs
301 * can be removed.
302 */
303int asl_urb_dequeue(struct whc *whc, struct urb *urb, int status)
304{
305 struct whc_urb *wurb = urb->hcpriv;
306 struct whc_qset *qset = wurb->qset;
307 struct whc_std *std, *t;
308 int ret;
309 unsigned long flags;
310
311 spin_lock_irqsave(&whc->lock, flags);
312
313 ret = usb_hcd_check_unlink_urb(&whc->wusbhc.usb_hcd, urb, status);
314 if (ret < 0)
315 goto out;
316
317 list_for_each_entry_safe(std, t, &qset->stds, list_node) {
318 if (std->urb == urb)
319 qset_free_std(whc, std);
320 else
321 std->qtd = NULL; /* so this std is re-added when the qset is */
322 }
323
324 asl_qset_remove(whc, qset);
325 wurb->status = status;
326 wurb->is_async = true;
327 queue_work(whc->workqueue, &wurb->dequeue_work);
328
329out:
330 spin_unlock_irqrestore(&whc->lock, flags);
331
332 return ret;
333}
334
335/**
336 * asl_qset_delete - delete a qset from the ASL
337 */
338void asl_qset_delete(struct whc *whc, struct whc_qset *qset)
339{
340 qset->remove = 1;
341 queue_work(whc->workqueue, &whc->async_work);
342 qset_delete(whc, qset);
343}
344
345/**
346 * asl_init - initialize the asynchronous schedule list
347 *
348 * A dummy qset with no qTDs is added to the ASL to simplify removing
349 * qsets (no need to stop the ASL when the last qset is removed).
350 */
351int asl_init(struct whc *whc)
352{
353 struct whc_qset *qset;
354
355 qset = qset_alloc(whc, GFP_KERNEL);
356 if (qset == NULL)
357 return -ENOMEM;
358
359 asl_qset_insert_begin(whc, qset);
360 asl_qset_insert(whc, qset);
361
362 return 0;
363}
364
365/**
366 * asl_clean_up - free ASL resources
367 *
368 * The ASL is stopped and empty except for the dummy qset.
369 */
370void asl_clean_up(struct whc *whc)
371{
372 struct whc_qset *qset;
373
374 if (!list_empty(&whc->async_list)) {
375 qset = list_first_entry(&whc->async_list, struct whc_qset, list_node);
376 list_del(&qset->list_node);
377 qset_free(whc, qset);
378 }
379}