RT-AC66 3.0.0.4.374.130 core
[tomato.git] / release / src-rt-6.x / linux / linux-2.6 / drivers / usb / host / uhci-q.c
blob6c692d8feab791886706796addf31007812862a4
1 /*
2 * Universal Host Controller Interface driver for USB.
4 * Maintainer: Alan Stern <stern@rowland.harvard.edu>
6 * (C) Copyright 1999 Linus Torvalds
7 * (C) Copyright 1999-2002 Johannes Erdfelt, johannes@erdfelt.com
8 * (C) Copyright 1999 Randy Dunlap
9 * (C) Copyright 1999 Georg Acher, acher@in.tum.de
10 * (C) Copyright 1999 Deti Fliegl, deti@fliegl.de
11 * (C) Copyright 1999 Thomas Sailer, sailer@ife.ee.ethz.ch
12 * (C) Copyright 1999 Roman Weissgaerber, weissg@vienna.at
13 * (C) Copyright 2000 Yggdrasil Computing, Inc. (port of new PCI interface
14 * support from usb-ohci.c by Adam Richter, adam@yggdrasil.com).
15 * (C) Copyright 1999 Gregory P. Smith (from usb-ohci.c)
16 * (C) Copyright 2004-2007 Alan Stern, stern@rowland.harvard.edu
21 * Technically, updating td->status here is a race, but it's not really a
22 * problem. The worst that can happen is that we set the IOC bit again
23 * generating a spurious interrupt. We could fix this by creating another
24 * QH and leaving the IOC bit always set, but then we would have to play
25 * games with the FSBR code to make sure we get the correct order in all
26 * the cases. I don't think it's worth the effort
28 static void uhci_set_next_interrupt(struct uhci_hcd *uhci)
30 if (uhci->is_stopped)
31 mod_timer(&uhci_to_hcd(uhci)->rh_timer, jiffies);
32 uhci->term_td->status |= cpu_to_le32(TD_CTRL_IOC);
35 static inline void uhci_clear_next_interrupt(struct uhci_hcd *uhci)
37 uhci->term_td->status &= ~cpu_to_le32(TD_CTRL_IOC);
42 * Full-Speed Bandwidth Reclamation (FSBR).
43 * We turn on FSBR whenever a queue that wants it is advancing,
44 * and leave it on for a short time thereafter.
46 static void uhci_fsbr_on(struct uhci_hcd *uhci)
48 struct uhci_qh *lqh;
50 /* The terminating skeleton QH always points back to the first
51 * FSBR QH. Make the last async QH point to the terminating
52 * skeleton QH. */
53 uhci->fsbr_is_on = 1;
54 lqh = list_entry(uhci->skel_async_qh->node.prev,
55 struct uhci_qh, node);
56 lqh->link = LINK_TO_QH(uhci->skel_term_qh);
59 static void uhci_fsbr_off(struct uhci_hcd *uhci)
61 struct uhci_qh *lqh;
63 /* Remove the link from the last async QH to the terminating
64 * skeleton QH. */
65 uhci->fsbr_is_on = 0;
66 lqh = list_entry(uhci->skel_async_qh->node.prev,
67 struct uhci_qh, node);
68 lqh->link = UHCI_PTR_TERM;
71 static void uhci_add_fsbr(struct uhci_hcd *uhci, struct urb *urb)
73 struct urb_priv *urbp = urb->hcpriv;
75 if (!(urb->transfer_flags & URB_NO_FSBR))
76 urbp->fsbr = 1;
79 static void uhci_urbp_wants_fsbr(struct uhci_hcd *uhci, struct urb_priv *urbp)
81 if (urbp->fsbr) {
82 uhci->fsbr_is_wanted = 1;
83 if (!uhci->fsbr_is_on)
84 uhci_fsbr_on(uhci);
85 else if (uhci->fsbr_expiring) {
86 uhci->fsbr_expiring = 0;
87 del_timer(&uhci->fsbr_timer);
92 static void uhci_fsbr_timeout(unsigned long _uhci)
94 struct uhci_hcd *uhci = (struct uhci_hcd *) _uhci;
95 unsigned long flags;
97 spin_lock_irqsave(&uhci->lock, flags);
98 if (uhci->fsbr_expiring) {
99 uhci->fsbr_expiring = 0;
100 uhci_fsbr_off(uhci);
102 spin_unlock_irqrestore(&uhci->lock, flags);
106 static struct uhci_td *uhci_alloc_td(struct uhci_hcd *uhci)
108 dma_addr_t dma_handle;
109 struct uhci_td *td;
111 td = dma_pool_alloc(uhci->td_pool, GFP_ATOMIC, &dma_handle);
112 if (!td)
113 return NULL;
115 td->dma_handle = dma_handle;
116 td->frame = -1;
118 INIT_LIST_HEAD(&td->list);
119 INIT_LIST_HEAD(&td->fl_list);
121 return td;
124 static void uhci_free_td(struct uhci_hcd *uhci, struct uhci_td *td)
126 if (!list_empty(&td->list)) {
127 dev_warn(uhci_dev(uhci), "td %p still in list!\n", td);
128 WARN_ON(1);
130 if (!list_empty(&td->fl_list)) {
131 dev_warn(uhci_dev(uhci), "td %p still in fl_list!\n", td);
132 WARN_ON(1);
135 dma_pool_free(uhci->td_pool, td, td->dma_handle);
138 static inline void uhci_fill_td(struct uhci_td *td, u32 status,
139 u32 token, u32 buffer)
141 td->status = cpu_to_le32(status);
142 td->token = cpu_to_le32(token);
143 td->buffer = cpu_to_le32(buffer);
146 static void uhci_add_td_to_urbp(struct uhci_td *td, struct urb_priv *urbp)
148 list_add_tail(&td->list, &urbp->td_list);
151 static void uhci_remove_td_from_urbp(struct uhci_td *td)
153 list_del_init(&td->list);
157 * We insert Isochronous URBs directly into the frame list at the beginning
159 static inline void uhci_insert_td_in_frame_list(struct uhci_hcd *uhci,
160 struct uhci_td *td, unsigned framenum)
162 framenum &= (UHCI_NUMFRAMES - 1);
164 td->frame = framenum;
166 /* Is there a TD already mapped there? */
167 if (uhci->frame_cpu[framenum]) {
168 struct uhci_td *ftd, *ltd;
170 ftd = uhci->frame_cpu[framenum];
171 ltd = list_entry(ftd->fl_list.prev, struct uhci_td, fl_list);
173 list_add_tail(&td->fl_list, &ftd->fl_list);
175 td->link = ltd->link;
176 wmb();
177 ltd->link = LINK_TO_TD(td);
178 } else {
179 td->link = uhci->frame[framenum];
180 wmb();
181 uhci->frame[framenum] = LINK_TO_TD(td);
182 uhci->frame_cpu[framenum] = td;
186 static inline void uhci_remove_td_from_frame_list(struct uhci_hcd *uhci,
187 struct uhci_td *td)
189 /* If it's not inserted, don't remove it */
190 if (td->frame == -1) {
191 WARN_ON(!list_empty(&td->fl_list));
192 return;
195 if (uhci->frame_cpu[td->frame] == td) {
196 if (list_empty(&td->fl_list)) {
197 uhci->frame[td->frame] = td->link;
198 uhci->frame_cpu[td->frame] = NULL;
199 } else {
200 struct uhci_td *ntd;
202 ntd = list_entry(td->fl_list.next, struct uhci_td, fl_list);
203 uhci->frame[td->frame] = LINK_TO_TD(ntd);
204 uhci->frame_cpu[td->frame] = ntd;
206 } else {
207 struct uhci_td *ptd;
209 ptd = list_entry(td->fl_list.prev, struct uhci_td, fl_list);
210 ptd->link = td->link;
213 list_del_init(&td->fl_list);
214 td->frame = -1;
217 static inline void uhci_remove_tds_from_frame(struct uhci_hcd *uhci,
218 unsigned int framenum)
220 struct uhci_td *ftd, *ltd;
222 framenum &= (UHCI_NUMFRAMES - 1);
224 ftd = uhci->frame_cpu[framenum];
225 if (ftd) {
226 ltd = list_entry(ftd->fl_list.prev, struct uhci_td, fl_list);
227 uhci->frame[framenum] = ltd->link;
228 uhci->frame_cpu[framenum] = NULL;
230 while (!list_empty(&ftd->fl_list))
231 list_del_init(ftd->fl_list.prev);
236 * Remove all the TDs for an Isochronous URB from the frame list
238 static void uhci_unlink_isochronous_tds(struct uhci_hcd *uhci, struct urb *urb)
240 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
241 struct uhci_td *td;
243 list_for_each_entry(td, &urbp->td_list, list)
244 uhci_remove_td_from_frame_list(uhci, td);
247 static struct uhci_qh *uhci_alloc_qh(struct uhci_hcd *uhci,
248 struct usb_device *udev, struct usb_host_endpoint *hep)
250 dma_addr_t dma_handle;
251 struct uhci_qh *qh;
253 qh = dma_pool_alloc(uhci->qh_pool, GFP_ATOMIC, &dma_handle);
254 if (!qh)
255 return NULL;
257 memset(qh, 0, sizeof(*qh));
258 qh->dma_handle = dma_handle;
260 qh->element = UHCI_PTR_TERM;
261 qh->link = UHCI_PTR_TERM;
263 INIT_LIST_HEAD(&qh->queue);
264 INIT_LIST_HEAD(&qh->node);
266 if (udev) { /* Normal QH */
267 qh->type = usb_endpoint_type(&hep->desc);
268 if (qh->type != USB_ENDPOINT_XFER_ISOC) {
269 qh->dummy_td = uhci_alloc_td(uhci);
270 if (!qh->dummy_td) {
271 dma_pool_free(uhci->qh_pool, qh, dma_handle);
272 return NULL;
275 qh->state = QH_STATE_IDLE;
276 qh->hep = hep;
277 qh->udev = udev;
278 hep->hcpriv = qh;
280 if (qh->type == USB_ENDPOINT_XFER_INT ||
281 qh->type == USB_ENDPOINT_XFER_ISOC)
282 qh->load = usb_calc_bus_time(udev->speed,
283 usb_endpoint_dir_in(&hep->desc),
284 qh->type == USB_ENDPOINT_XFER_ISOC,
285 le16_to_cpu(hep->desc.wMaxPacketSize))
286 / 1000 + 1;
288 } else { /* Skeleton QH */
289 qh->state = QH_STATE_ACTIVE;
290 qh->type = -1;
292 return qh;
295 static void uhci_free_qh(struct uhci_hcd *uhci, struct uhci_qh *qh)
297 WARN_ON(qh->state != QH_STATE_IDLE && qh->udev);
298 if (!list_empty(&qh->queue)) {
299 dev_warn(uhci_dev(uhci), "qh %p list not empty!\n", qh);
300 WARN_ON(1);
303 list_del(&qh->node);
304 if (qh->udev) {
305 qh->hep->hcpriv = NULL;
306 if (qh->dummy_td)
307 uhci_free_td(uhci, qh->dummy_td);
309 dma_pool_free(uhci->qh_pool, qh, qh->dma_handle);
313 * When a queue is stopped and a dequeued URB is given back, adjust
314 * the previous TD link (if the URB isn't first on the queue) or
315 * save its toggle value (if it is first and is currently executing).
317 * Returns 0 if the URB should not yet be given back, 1 otherwise.
319 static int uhci_cleanup_queue(struct uhci_hcd *uhci, struct uhci_qh *qh,
320 struct urb *urb)
322 struct urb_priv *urbp = urb->hcpriv;
323 struct uhci_td *td;
324 int ret = 1;
326 /* Isochronous pipes don't use toggles and their TD link pointers
327 * get adjusted during uhci_urb_dequeue(). But since their queues
328 * cannot truly be stopped, we have to watch out for dequeues
329 * occurring after the nominal unlink frame. */
330 if (qh->type == USB_ENDPOINT_XFER_ISOC) {
331 ret = (uhci->frame_number + uhci->is_stopped !=
332 qh->unlink_frame);
333 goto done;
336 /* If the URB isn't first on its queue, adjust the link pointer
337 * of the last TD in the previous URB. The toggle doesn't need
338 * to be saved since this URB can't be executing yet. */
339 if (qh->queue.next != &urbp->node) {
340 struct urb_priv *purbp;
341 struct uhci_td *ptd;
343 purbp = list_entry(urbp->node.prev, struct urb_priv, node);
344 WARN_ON(list_empty(&purbp->td_list));
345 ptd = list_entry(purbp->td_list.prev, struct uhci_td,
346 list);
347 td = list_entry(urbp->td_list.prev, struct uhci_td,
348 list);
349 ptd->link = td->link;
350 goto done;
353 /* If the QH element pointer is UHCI_PTR_TERM then then currently
354 * executing URB has already been unlinked, so this one isn't it. */
355 if (qh_element(qh) == UHCI_PTR_TERM)
356 goto done;
357 qh->element = UHCI_PTR_TERM;
359 /* Control pipes don't have to worry about toggles */
360 if (qh->type == USB_ENDPOINT_XFER_CONTROL)
361 goto done;
363 /* Save the next toggle value */
364 WARN_ON(list_empty(&urbp->td_list));
365 td = list_entry(urbp->td_list.next, struct uhci_td, list);
366 qh->needs_fixup = 1;
367 qh->initial_toggle = uhci_toggle(td_token(td));
369 done:
370 return ret;
374 * Fix up the data toggles for URBs in a queue, when one of them
375 * terminates early (short transfer, error, or dequeued).
377 static void uhci_fixup_toggles(struct uhci_qh *qh, int skip_first)
379 struct urb_priv *urbp = NULL;
380 struct uhci_td *td;
381 unsigned int toggle = qh->initial_toggle;
382 unsigned int pipe;
384 /* Fixups for a short transfer start with the second URB in the
385 * queue (the short URB is the first). */
386 if (skip_first)
387 urbp = list_entry(qh->queue.next, struct urb_priv, node);
389 /* When starting with the first URB, if the QH element pointer is
390 * still valid then we know the URB's toggles are okay. */
391 else if (qh_element(qh) != UHCI_PTR_TERM)
392 toggle = 2;
394 /* Fix up the toggle for the URBs in the queue. Normally this
395 * loop won't run more than once: When an error or short transfer
396 * occurs, the queue usually gets emptied. */
397 urbp = list_prepare_entry(urbp, &qh->queue, node);
398 list_for_each_entry_continue(urbp, &qh->queue, node) {
400 /* If the first TD has the right toggle value, we don't
401 * need to change any toggles in this URB */
402 td = list_entry(urbp->td_list.next, struct uhci_td, list);
403 if (toggle > 1 || uhci_toggle(td_token(td)) == toggle) {
404 td = list_entry(urbp->td_list.prev, struct uhci_td,
405 list);
406 toggle = uhci_toggle(td_token(td)) ^ 1;
408 /* Otherwise all the toggles in the URB have to be switched */
409 } else {
410 list_for_each_entry(td, &urbp->td_list, list) {
411 td->token ^= __constant_cpu_to_le32(
412 TD_TOKEN_TOGGLE);
413 toggle ^= 1;
418 wmb();
419 pipe = list_entry(qh->queue.next, struct urb_priv, node)->urb->pipe;
420 usb_settoggle(qh->udev, usb_pipeendpoint(pipe),
421 usb_pipeout(pipe), toggle);
422 qh->needs_fixup = 0;
426 * Link an Isochronous QH into its skeleton's list
428 static inline void link_iso(struct uhci_hcd *uhci, struct uhci_qh *qh)
430 list_add_tail(&qh->node, &uhci->skel_iso_qh->node);
432 /* Isochronous QHs aren't linked by the hardware */
436 * Link a high-period interrupt QH into the schedule at the end of its
437 * skeleton's list
439 static void link_interrupt(struct uhci_hcd *uhci, struct uhci_qh *qh)
441 struct uhci_qh *pqh;
443 list_add_tail(&qh->node, &uhci->skelqh[qh->skel]->node);
445 pqh = list_entry(qh->node.prev, struct uhci_qh, node);
446 qh->link = pqh->link;
447 wmb();
448 pqh->link = LINK_TO_QH(qh);
452 * Link a period-1 interrupt or async QH into the schedule at the
453 * correct spot in the async skeleton's list, and update the FSBR link
455 static void link_async(struct uhci_hcd *uhci, struct uhci_qh *qh)
457 struct uhci_qh *pqh;
458 __le32 link_to_new_qh;
460 /* Find the predecessor QH for our new one and insert it in the list.
461 * The list of QHs is expected to be short, so linear search won't
462 * take too long. */
463 list_for_each_entry_reverse(pqh, &uhci->skel_async_qh->node, node) {
464 if (pqh->skel <= qh->skel)
465 break;
467 list_add(&qh->node, &pqh->node);
469 /* Link it into the schedule */
470 qh->link = pqh->link;
471 wmb();
472 link_to_new_qh = LINK_TO_QH(qh);
473 pqh->link = link_to_new_qh;
475 /* If this is now the first FSBR QH, link the terminating skeleton
476 * QH to it. */
477 if (pqh->skel < SKEL_FSBR && qh->skel >= SKEL_FSBR)
478 uhci->skel_term_qh->link = link_to_new_qh;
482 * Put a QH on the schedule in both hardware and software
484 static void uhci_activate_qh(struct uhci_hcd *uhci, struct uhci_qh *qh)
486 WARN_ON(list_empty(&qh->queue));
488 /* Set the element pointer if it isn't set already.
489 * This isn't needed for Isochronous queues, but it doesn't hurt. */
490 if (qh_element(qh) == UHCI_PTR_TERM) {
491 struct urb_priv *urbp = list_entry(qh->queue.next,
492 struct urb_priv, node);
493 struct uhci_td *td = list_entry(urbp->td_list.next,
494 struct uhci_td, list);
496 qh->element = LINK_TO_TD(td);
499 /* Treat the queue as if it has just advanced */
500 qh->wait_expired = 0;
501 qh->advance_jiffies = jiffies;
503 if (qh->state == QH_STATE_ACTIVE)
504 return;
505 qh->state = QH_STATE_ACTIVE;
507 /* Move the QH from its old list to the correct spot in the appropriate
508 * skeleton's list */
509 if (qh == uhci->next_qh)
510 uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,
511 node);
512 list_del(&qh->node);
514 if (qh->skel == SKEL_ISO)
515 link_iso(uhci, qh);
516 else if (qh->skel < SKEL_ASYNC)
517 link_interrupt(uhci, qh);
518 else
519 link_async(uhci, qh);
523 * Unlink a high-period interrupt QH from the schedule
525 static void unlink_interrupt(struct uhci_hcd *uhci, struct uhci_qh *qh)
527 struct uhci_qh *pqh;
529 pqh = list_entry(qh->node.prev, struct uhci_qh, node);
530 pqh->link = qh->link;
531 mb();
535 * Unlink a period-1 interrupt or async QH from the schedule
537 static void unlink_async(struct uhci_hcd *uhci, struct uhci_qh *qh)
539 struct uhci_qh *pqh;
540 __le32 link_to_next_qh = qh->link;
542 pqh = list_entry(qh->node.prev, struct uhci_qh, node);
543 pqh->link = link_to_next_qh;
545 /* If this was the old first FSBR QH, link the terminating skeleton
546 * QH to the next (new first FSBR) QH. */
547 if (pqh->skel < SKEL_FSBR && qh->skel >= SKEL_FSBR)
548 uhci->skel_term_qh->link = link_to_next_qh;
549 mb();
553 * Take a QH off the hardware schedule
555 static void uhci_unlink_qh(struct uhci_hcd *uhci, struct uhci_qh *qh)
557 if (qh->state == QH_STATE_UNLINKING)
558 return;
559 WARN_ON(qh->state != QH_STATE_ACTIVE || !qh->udev);
560 qh->state = QH_STATE_UNLINKING;
562 /* Unlink the QH from the schedule and record when we did it */
563 if (qh->skel == SKEL_ISO)
565 else if (qh->skel < SKEL_ASYNC)
566 unlink_interrupt(uhci, qh);
567 else
568 unlink_async(uhci, qh);
570 uhci_get_current_frame_number(uhci);
571 qh->unlink_frame = uhci->frame_number;
573 /* Force an interrupt so we know when the QH is fully unlinked */
574 if (list_empty(&uhci->skel_unlink_qh->node) || uhci->is_stopped)
575 uhci_set_next_interrupt(uhci);
577 /* Move the QH from its old list to the end of the unlinking list */
578 if (qh == uhci->next_qh)
579 uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,
580 node);
581 list_move_tail(&qh->node, &uhci->skel_unlink_qh->node);
585 * When we and the controller are through with a QH, it becomes IDLE.
586 * This happens when a QH has been off the schedule (on the unlinking
587 * list) for more than one frame, or when an error occurs while adding
588 * the first URB onto a new QH.
590 static void uhci_make_qh_idle(struct uhci_hcd *uhci, struct uhci_qh *qh)
592 WARN_ON(qh->state == QH_STATE_ACTIVE);
594 if (qh == uhci->next_qh)
595 uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,
596 node);
597 list_move(&qh->node, &uhci->idle_qh_list);
598 qh->state = QH_STATE_IDLE;
600 /* Now that the QH is idle, its post_td isn't being used */
601 if (qh->post_td) {
602 uhci_free_td(uhci, qh->post_td);
603 qh->post_td = NULL;
606 /* If anyone is waiting for a QH to become idle, wake them up */
607 if (uhci->num_waiting)
608 wake_up_all(&uhci->waitqh);
612 * Find the highest existing bandwidth load for a given phase and period.
614 static int uhci_highest_load(struct uhci_hcd *uhci, int phase, int period)
616 int highest_load = uhci->load[phase];
618 for (phase += period; phase < MAX_PHASE; phase += period)
619 highest_load = max_t(int, highest_load, uhci->load[phase]);
620 return highest_load;
624 * Set qh->phase to the optimal phase for a periodic transfer and
625 * check whether the bandwidth requirement is acceptable.
627 static int uhci_check_bandwidth(struct uhci_hcd *uhci, struct uhci_qh *qh)
629 int minimax_load;
631 /* Find the optimal phase (unless it is already set) and get
632 * its load value. */
633 if (qh->phase >= 0)
634 minimax_load = uhci_highest_load(uhci, qh->phase, qh->period);
635 else {
636 int phase, load;
637 int max_phase = min_t(int, MAX_PHASE, qh->period);
639 qh->phase = 0;
640 minimax_load = uhci_highest_load(uhci, qh->phase, qh->period);
641 for (phase = 1; phase < max_phase; ++phase) {
642 load = uhci_highest_load(uhci, phase, qh->period);
643 if (load < minimax_load) {
644 minimax_load = load;
645 qh->phase = phase;
650 /* Maximum allowable periodic bandwidth is 90%, or 900 us per frame */
651 if (minimax_load + qh->load > 900) {
652 dev_dbg(uhci_dev(uhci), "bandwidth allocation failed: "
653 "period %d, phase %d, %d + %d us\n",
654 qh->period, qh->phase, minimax_load, qh->load);
655 return -ENOSPC;
657 return 0;
661 * Reserve a periodic QH's bandwidth in the schedule
663 static void uhci_reserve_bandwidth(struct uhci_hcd *uhci, struct uhci_qh *qh)
665 int i;
666 int load = qh->load;
667 char *p = "??";
669 for (i = qh->phase; i < MAX_PHASE; i += qh->period) {
670 uhci->load[i] += load;
671 uhci->total_load += load;
673 uhci_to_hcd(uhci)->self.bandwidth_allocated =
674 uhci->total_load / MAX_PHASE;
675 switch (qh->type) {
676 case USB_ENDPOINT_XFER_INT:
677 ++uhci_to_hcd(uhci)->self.bandwidth_int_reqs;
678 p = "INT";
679 break;
680 case USB_ENDPOINT_XFER_ISOC:
681 ++uhci_to_hcd(uhci)->self.bandwidth_isoc_reqs;
682 p = "ISO";
683 break;
685 qh->bandwidth_reserved = 1;
686 dev_dbg(uhci_dev(uhci),
687 "%s dev %d ep%02x-%s, period %d, phase %d, %d us\n",
688 "reserve", qh->udev->devnum,
689 qh->hep->desc.bEndpointAddress, p,
690 qh->period, qh->phase, load);
694 * Release a periodic QH's bandwidth reservation
696 static void uhci_release_bandwidth(struct uhci_hcd *uhci, struct uhci_qh *qh)
698 int i;
699 int load = qh->load;
700 char *p = "??";
702 for (i = qh->phase; i < MAX_PHASE; i += qh->period) {
703 uhci->load[i] -= load;
704 uhci->total_load -= load;
706 uhci_to_hcd(uhci)->self.bandwidth_allocated =
707 uhci->total_load / MAX_PHASE;
708 switch (qh->type) {
709 case USB_ENDPOINT_XFER_INT:
710 --uhci_to_hcd(uhci)->self.bandwidth_int_reqs;
711 p = "INT";
712 break;
713 case USB_ENDPOINT_XFER_ISOC:
714 --uhci_to_hcd(uhci)->self.bandwidth_isoc_reqs;
715 p = "ISO";
716 break;
718 qh->bandwidth_reserved = 0;
719 dev_dbg(uhci_dev(uhci),
720 "%s dev %d ep%02x-%s, period %d, phase %d, %d us\n",
721 "release", qh->udev->devnum,
722 qh->hep->desc.bEndpointAddress, p,
723 qh->period, qh->phase, load);
726 static inline struct urb_priv *uhci_alloc_urb_priv(struct uhci_hcd *uhci,
727 struct urb *urb)
729 struct urb_priv *urbp;
731 urbp = kmem_cache_zalloc(uhci_up_cachep, GFP_ATOMIC);
732 if (!urbp)
733 return NULL;
735 urbp->urb = urb;
736 urb->hcpriv = urbp;
738 INIT_LIST_HEAD(&urbp->node);
739 INIT_LIST_HEAD(&urbp->td_list);
741 return urbp;
744 static void uhci_free_urb_priv(struct uhci_hcd *uhci,
745 struct urb_priv *urbp)
747 struct uhci_td *td, *tmp;
749 if (!list_empty(&urbp->node)) {
750 dev_warn(uhci_dev(uhci), "urb %p still on QH's list!\n",
751 urbp->urb);
752 WARN_ON(1);
755 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
756 uhci_remove_td_from_urbp(td);
757 uhci_free_td(uhci, td);
760 kmem_cache_free(uhci_up_cachep, urbp);
764 * Map status to standard result codes
766 * <status> is (td_status(td) & 0xF60000), a.k.a.
767 * uhci_status_bits(td_status(td)).
768 * Note: <status> does not include the TD_CTRL_NAK bit.
769 * <dir_out> is True for output TDs and False for input TDs.
771 static int uhci_map_status(int status, int dir_out)
773 if (!status)
774 return 0;
775 if (status & TD_CTRL_BITSTUFF) /* Bitstuff error */
776 return -EPROTO;
777 if (status & TD_CTRL_CRCTIMEO) { /* CRC/Timeout */
778 if (dir_out)
779 return -EPROTO;
780 else
781 return -EILSEQ;
783 if (status & TD_CTRL_BABBLE) /* Babble */
784 return -EOVERFLOW;
785 if (status & TD_CTRL_DBUFERR) /* Buffer error */
786 return -ENOSR;
787 if (status & TD_CTRL_STALLED) /* Stalled */
788 return -EPIPE;
789 return 0;
793 * Control transfers
795 static int uhci_submit_control(struct uhci_hcd *uhci, struct urb *urb,
796 struct uhci_qh *qh)
798 struct uhci_td *td;
799 unsigned long destination, status;
800 int maxsze = le16_to_cpu(qh->hep->desc.wMaxPacketSize);
801 int len = urb->transfer_buffer_length;
802 dma_addr_t data = urb->transfer_dma;
803 __le32 *plink;
804 struct urb_priv *urbp = urb->hcpriv;
805 int skel;
807 /* The "pipe" thing contains the destination in bits 8--18 */
808 destination = (urb->pipe & PIPE_DEVEP_MASK) | USB_PID_SETUP;
810 /* 3 errors, dummy TD remains inactive */
811 status = uhci_maxerr(3);
812 if (urb->dev->speed == USB_SPEED_LOW)
813 status |= TD_CTRL_LS;
816 * Build the TD for the control request setup packet
818 td = qh->dummy_td;
819 uhci_add_td_to_urbp(td, urbp);
820 uhci_fill_td(td, status, destination | uhci_explen(8),
821 urb->setup_dma);
822 plink = &td->link;
823 status |= TD_CTRL_ACTIVE;
826 * If direction is "send", change the packet ID from SETUP (0x2D)
827 * to OUT (0xE1). Else change it from SETUP to IN (0x69) and
828 * set Short Packet Detect (SPD) for all data packets.
830 * 0-length transfers always get treated as "send".
832 if (usb_pipeout(urb->pipe) || len == 0)
833 destination ^= (USB_PID_SETUP ^ USB_PID_OUT);
834 else {
835 destination ^= (USB_PID_SETUP ^ USB_PID_IN);
836 status |= TD_CTRL_SPD;
840 * Build the DATA TDs
842 while (len > 0) {
843 int pktsze = maxsze;
845 if (len <= pktsze) { /* The last data packet */
846 pktsze = len;
847 status &= ~TD_CTRL_SPD;
850 td = uhci_alloc_td(uhci);
851 if (!td)
852 goto nomem;
853 *plink = LINK_TO_TD(td);
855 /* Alternate Data0/1 (start with Data1) */
856 destination ^= TD_TOKEN_TOGGLE;
858 uhci_add_td_to_urbp(td, urbp);
859 uhci_fill_td(td, status, destination | uhci_explen(pktsze),
860 data);
861 plink = &td->link;
863 data += pktsze;
864 len -= pktsze;
868 * Build the final TD for control status
870 td = uhci_alloc_td(uhci);
871 if (!td)
872 goto nomem;
873 *plink = LINK_TO_TD(td);
875 /* Change direction for the status transaction */
876 destination ^= (USB_PID_IN ^ USB_PID_OUT);
877 destination |= TD_TOKEN_TOGGLE; /* End in Data1 */
879 uhci_add_td_to_urbp(td, urbp);
880 uhci_fill_td(td, status | TD_CTRL_IOC,
881 destination | uhci_explen(0), 0);
882 plink = &td->link;
885 * Build the new dummy TD and activate the old one
887 td = uhci_alloc_td(uhci);
888 if (!td)
889 goto nomem;
890 *plink = LINK_TO_TD(td);
892 uhci_fill_td(td, 0, USB_PID_OUT | uhci_explen(0), 0);
893 wmb();
894 qh->dummy_td->status |= __constant_cpu_to_le32(TD_CTRL_ACTIVE);
895 qh->dummy_td = td;
897 /* Low-speed transfers get a different queue, and won't hog the bus.
898 * Also, some devices enumerate better without FSBR; the easiest way
899 * to do that is to put URBs on the low-speed queue while the device
900 * isn't in the CONFIGURED state. */
901 if (urb->dev->speed == USB_SPEED_LOW ||
902 urb->dev->state != USB_STATE_CONFIGURED)
903 skel = SKEL_LS_CONTROL;
904 else {
905 skel = SKEL_FS_CONTROL;
906 uhci_add_fsbr(uhci, urb);
908 if (qh->state != QH_STATE_ACTIVE)
909 qh->skel = skel;
910 return 0;
912 nomem:
913 /* Remove the dummy TD from the td_list so it doesn't get freed */
914 uhci_remove_td_from_urbp(qh->dummy_td);
915 return -ENOMEM;
919 * Common submit for bulk and interrupt
921 static int uhci_submit_common(struct uhci_hcd *uhci, struct urb *urb,
922 struct uhci_qh *qh)
924 struct uhci_td *td;
925 unsigned long destination, status;
926 int maxsze = le16_to_cpu(qh->hep->desc.wMaxPacketSize);
927 int len = urb->transfer_buffer_length;
928 dma_addr_t data = urb->transfer_dma;
929 __le32 *plink;
930 struct urb_priv *urbp = urb->hcpriv;
931 unsigned int toggle;
933 if (len < 0)
934 return -EINVAL;
936 /* The "pipe" thing contains the destination in bits 8--18 */
937 destination = (urb->pipe & PIPE_DEVEP_MASK) | usb_packetid(urb->pipe);
938 toggle = usb_gettoggle(urb->dev, usb_pipeendpoint(urb->pipe),
939 usb_pipeout(urb->pipe));
941 /* 3 errors, dummy TD remains inactive */
942 status = uhci_maxerr(3);
943 if (urb->dev->speed == USB_SPEED_LOW)
944 status |= TD_CTRL_LS;
945 if (usb_pipein(urb->pipe))
946 status |= TD_CTRL_SPD;
949 * Build the DATA TDs
951 plink = NULL;
952 td = qh->dummy_td;
953 do { /* Allow zero length packets */
954 int pktsze = maxsze;
956 if (len <= pktsze) { /* The last packet */
957 pktsze = len;
958 if (!(urb->transfer_flags & URB_SHORT_NOT_OK))
959 status &= ~TD_CTRL_SPD;
962 if (plink) {
963 td = uhci_alloc_td(uhci);
964 if (!td)
965 goto nomem;
966 *plink = LINK_TO_TD(td);
968 uhci_add_td_to_urbp(td, urbp);
969 uhci_fill_td(td, status,
970 destination | uhci_explen(pktsze) |
971 (toggle << TD_TOKEN_TOGGLE_SHIFT),
972 data);
973 plink = &td->link;
974 status |= TD_CTRL_ACTIVE;
976 data += pktsze;
977 len -= maxsze;
978 toggle ^= 1;
979 } while (len > 0);
982 * URB_ZERO_PACKET means adding a 0-length packet, if direction
983 * is OUT and the transfer_length was an exact multiple of maxsze,
984 * hence (len = transfer_length - N * maxsze) == 0
985 * however, if transfer_length == 0, the zero packet was already
986 * prepared above.
988 if ((urb->transfer_flags & URB_ZERO_PACKET) &&
989 usb_pipeout(urb->pipe) && len == 0 &&
990 urb->transfer_buffer_length > 0) {
991 td = uhci_alloc_td(uhci);
992 if (!td)
993 goto nomem;
994 *plink = LINK_TO_TD(td);
996 uhci_add_td_to_urbp(td, urbp);
997 uhci_fill_td(td, status,
998 destination | uhci_explen(0) |
999 (toggle << TD_TOKEN_TOGGLE_SHIFT),
1000 data);
1001 plink = &td->link;
1003 toggle ^= 1;
1006 /* Set the interrupt-on-completion flag on the last packet.
1007 * A more-or-less typical 4 KB URB (= size of one memory page)
1008 * will require about 3 ms to transfer; that's a little on the
1009 * fast side but not enough to justify delaying an interrupt
1010 * more than 2 or 3 URBs, so we will ignore the URB_NO_INTERRUPT
1011 * flag setting. */
1012 td->status |= __constant_cpu_to_le32(TD_CTRL_IOC);
1015 * Build the new dummy TD and activate the old one
1017 td = uhci_alloc_td(uhci);
1018 if (!td)
1019 goto nomem;
1020 *plink = LINK_TO_TD(td);
1022 uhci_fill_td(td, 0, USB_PID_OUT | uhci_explen(0), 0);
1023 wmb();
1024 qh->dummy_td->status |= __constant_cpu_to_le32(TD_CTRL_ACTIVE);
1025 qh->dummy_td = td;
1027 usb_settoggle(urb->dev, usb_pipeendpoint(urb->pipe),
1028 usb_pipeout(urb->pipe), toggle);
1029 return 0;
1031 nomem:
1032 /* Remove the dummy TD from the td_list so it doesn't get freed */
1033 uhci_remove_td_from_urbp(qh->dummy_td);
1034 return -ENOMEM;
1037 static int uhci_submit_bulk(struct uhci_hcd *uhci, struct urb *urb,
1038 struct uhci_qh *qh)
1040 int ret;
1042 /* Can't have low-speed bulk transfers */
1043 if (urb->dev->speed == USB_SPEED_LOW)
1044 return -EINVAL;
1046 if (qh->state != QH_STATE_ACTIVE)
1047 qh->skel = SKEL_BULK;
1048 ret = uhci_submit_common(uhci, urb, qh);
1049 if (ret == 0)
1050 uhci_add_fsbr(uhci, urb);
1051 return ret;
1054 static int uhci_submit_interrupt(struct uhci_hcd *uhci, struct urb *urb,
1055 struct uhci_qh *qh)
1057 int ret;
1059 /* USB 1.1 interrupt transfers only involve one packet per interval.
1060 * Drivers can submit URBs of any length, but longer ones will need
1061 * multiple intervals to complete.
1064 if (!qh->bandwidth_reserved) {
1065 int exponent;
1067 /* Figure out which power-of-two queue to use */
1068 for (exponent = 7; exponent >= 0; --exponent) {
1069 if ((1 << exponent) <= urb->interval)
1070 break;
1072 if (exponent < 0)
1073 return -EINVAL;
1075 /* If the slot is full, try a lower period */
1076 do {
1077 qh->period = 1 << exponent;
1078 qh->skel = SKEL_INDEX(exponent);
1080 /* For now, interrupt phase is fixed by the layout
1081 * of the QH lists.
1083 qh->phase = (qh->period / 2) & (MAX_PHASE - 1);
1084 ret = uhci_check_bandwidth(uhci, qh);
1085 } while (ret != 0 && --exponent >= 0);
1086 if (ret)
1087 return ret;
1088 } else if (qh->period > urb->interval)
1089 return -EINVAL; /* Can't decrease the period */
1091 ret = uhci_submit_common(uhci, urb, qh);
1092 if (ret == 0) {
1093 urb->interval = qh->period;
1094 if (!qh->bandwidth_reserved)
1095 uhci_reserve_bandwidth(uhci, qh);
1097 return ret;
1101 * Fix up the data structures following a short transfer
1103 static int uhci_fixup_short_transfer(struct uhci_hcd *uhci,
1104 struct uhci_qh *qh, struct urb_priv *urbp)
1106 struct uhci_td *td;
1107 struct list_head *tmp;
1108 int ret;
1110 td = list_entry(urbp->td_list.prev, struct uhci_td, list);
1111 if (qh->type == USB_ENDPOINT_XFER_CONTROL) {
1113 /* When a control transfer is short, we have to restart
1114 * the queue at the status stage transaction, which is
1115 * the last TD. */
1116 WARN_ON(list_empty(&urbp->td_list));
1117 qh->element = LINK_TO_TD(td);
1118 tmp = td->list.prev;
1119 ret = -EINPROGRESS;
1121 } else {
1123 /* When a bulk/interrupt transfer is short, we have to
1124 * fix up the toggles of the following URBs on the queue
1125 * before restarting the queue at the next URB. */
1126 qh->initial_toggle = uhci_toggle(td_token(qh->post_td)) ^ 1;
1127 uhci_fixup_toggles(qh, 1);
1129 if (list_empty(&urbp->td_list))
1130 td = qh->post_td;
1131 qh->element = td->link;
1132 tmp = urbp->td_list.prev;
1133 ret = 0;
1136 /* Remove all the TDs we skipped over, from tmp back to the start */
1137 while (tmp != &urbp->td_list) {
1138 td = list_entry(tmp, struct uhci_td, list);
1139 tmp = tmp->prev;
1141 uhci_remove_td_from_urbp(td);
1142 uhci_free_td(uhci, td);
1144 return ret;
1148 * Common result for control, bulk, and interrupt
1150 static int uhci_result_common(struct uhci_hcd *uhci, struct urb *urb)
1152 struct urb_priv *urbp = urb->hcpriv;
1153 struct uhci_qh *qh = urbp->qh;
1154 struct uhci_td *td, *tmp;
1155 unsigned status;
1156 int ret = 0;
1158 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1159 unsigned int ctrlstat;
1160 int len;
1162 ctrlstat = td_status(td);
1163 status = uhci_status_bits(ctrlstat);
1164 if (status & TD_CTRL_ACTIVE)
1165 return -EINPROGRESS;
1167 len = uhci_actual_length(ctrlstat);
1168 urb->actual_length += len;
1170 if (status) {
1171 ret = uhci_map_status(status,
1172 uhci_packetout(td_token(td)));
1173 if ((debug == 1 && ret != -EPIPE) || debug > 1) {
1174 /* Some debugging code */
1175 dev_dbg(&urb->dev->dev,
1176 "%s: failed with status %x\n",
1177 __FUNCTION__, status);
1179 if (debug > 1 && errbuf) {
1180 /* Print the chain for debugging */
1181 uhci_show_qh(uhci, urbp->qh, errbuf,
1182 ERRBUF_LEN, 0);
1183 lprintk(errbuf);
1187 /* Did we receive a short packet? */
1188 } else if (len < uhci_expected_length(td_token(td))) {
1190 /* For control transfers, go to the status TD if
1191 * this isn't already the last data TD */
1192 if (qh->type == USB_ENDPOINT_XFER_CONTROL) {
1193 if (td->list.next != urbp->td_list.prev)
1194 ret = 1;
1197 /* For bulk and interrupt, this may be an error */
1198 else if (urb->transfer_flags & URB_SHORT_NOT_OK)
1199 ret = -EREMOTEIO;
1201 /* Fixup needed only if this isn't the URB's last TD */
1202 else if (&td->list != urbp->td_list.prev)
1203 ret = 1;
1206 uhci_remove_td_from_urbp(td);
1207 if (qh->post_td)
1208 uhci_free_td(uhci, qh->post_td);
1209 qh->post_td = td;
1211 if (ret != 0)
1212 goto err;
1214 return ret;
1216 err:
1217 if (ret < 0) {
1218 /* Note that the queue has stopped and save
1219 * the next toggle value */
1220 qh->element = UHCI_PTR_TERM;
1221 qh->is_stopped = 1;
1222 qh->needs_fixup = (qh->type != USB_ENDPOINT_XFER_CONTROL);
1223 qh->initial_toggle = uhci_toggle(td_token(td)) ^
1224 (ret == -EREMOTEIO);
1226 } else /* Short packet received */
1227 ret = uhci_fixup_short_transfer(uhci, qh, urbp);
1228 return ret;
1232 * Isochronous transfers
1234 static int uhci_submit_isochronous(struct uhci_hcd *uhci, struct urb *urb,
1235 struct uhci_qh *qh)
1237 struct uhci_td *td = NULL; /* Since urb->number_of_packets > 0 */
1238 int i, frame;
1239 unsigned long destination, status;
1240 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1242 /* Values must not be too big (could overflow below) */
1243 if (urb->interval >= UHCI_NUMFRAMES ||
1244 urb->number_of_packets >= UHCI_NUMFRAMES)
1245 return -EFBIG;
1247 /* Check the period and figure out the starting frame number */
1248 if (!qh->bandwidth_reserved) {
1249 qh->period = urb->interval;
1250 if (urb->transfer_flags & URB_ISO_ASAP) {
1251 qh->phase = -1; /* Find the best phase */
1252 i = uhci_check_bandwidth(uhci, qh);
1253 if (i)
1254 return i;
1256 /* Allow a little time to allocate the TDs */
1257 uhci_get_current_frame_number(uhci);
1258 frame = uhci->frame_number + 10;
1260 /* Move forward to the first frame having the
1261 * correct phase */
1262 urb->start_frame = frame + ((qh->phase - frame) &
1263 (qh->period - 1));
1264 } else {
1265 i = urb->start_frame - uhci->last_iso_frame;
1266 if (i <= 0 || i >= UHCI_NUMFRAMES)
1267 return -EINVAL;
1268 qh->phase = urb->start_frame & (qh->period - 1);
1269 i = uhci_check_bandwidth(uhci, qh);
1270 if (i)
1271 return i;
1274 } else if (qh->period != urb->interval) {
1275 return -EINVAL; /* Can't change the period */
1277 } else {
1278 /* Find the next unused frame */
1279 if (list_empty(&qh->queue)) {
1280 frame = qh->iso_frame;
1281 } else {
1282 struct urb *lurb;
1284 lurb = list_entry(qh->queue.prev,
1285 struct urb_priv, node)->urb;
1286 frame = lurb->start_frame +
1287 lurb->number_of_packets *
1288 lurb->interval;
1290 if (urb->transfer_flags & URB_ISO_ASAP) {
1291 /* Skip some frames if necessary to insure
1292 * the start frame is in the future.
1294 uhci_get_current_frame_number(uhci);
1295 if (uhci_frame_before_eq(frame, uhci->frame_number)) {
1296 frame = uhci->frame_number + 1;
1297 frame += ((qh->phase - frame) &
1298 (qh->period - 1));
1300 } /* Otherwise pick up where the last URB leaves off */
1301 urb->start_frame = frame;
1304 /* Make sure we won't have to go too far into the future */
1305 if (uhci_frame_before_eq(uhci->last_iso_frame + UHCI_NUMFRAMES,
1306 urb->start_frame + urb->number_of_packets *
1307 urb->interval))
1308 return -EFBIG;
1310 status = TD_CTRL_ACTIVE | TD_CTRL_IOS;
1311 destination = (urb->pipe & PIPE_DEVEP_MASK) | usb_packetid(urb->pipe);
1313 for (i = 0; i < urb->number_of_packets; i++) {
1314 td = uhci_alloc_td(uhci);
1315 if (!td)
1316 return -ENOMEM;
1318 uhci_add_td_to_urbp(td, urbp);
1319 uhci_fill_td(td, status, destination |
1320 uhci_explen(urb->iso_frame_desc[i].length),
1321 urb->transfer_dma +
1322 urb->iso_frame_desc[i].offset);
1325 /* Set the interrupt-on-completion flag on the last packet. */
1326 td->status |= __constant_cpu_to_le32(TD_CTRL_IOC);
1328 /* Add the TDs to the frame list */
1329 frame = urb->start_frame;
1330 list_for_each_entry(td, &urbp->td_list, list) {
1331 uhci_insert_td_in_frame_list(uhci, td, frame);
1332 frame += qh->period;
1335 if (list_empty(&qh->queue)) {
1336 qh->iso_packet_desc = &urb->iso_frame_desc[0];
1337 qh->iso_frame = urb->start_frame;
1340 qh->skel = SKEL_ISO;
1341 if (!qh->bandwidth_reserved)
1342 uhci_reserve_bandwidth(uhci, qh);
1343 return 0;
1346 static int uhci_result_isochronous(struct uhci_hcd *uhci, struct urb *urb)
1348 struct uhci_td *td, *tmp;
1349 struct urb_priv *urbp = urb->hcpriv;
1350 struct uhci_qh *qh = urbp->qh;
1352 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1353 unsigned int ctrlstat;
1354 int status;
1355 int actlength;
1357 if (uhci_frame_before_eq(uhci->cur_iso_frame, qh->iso_frame))
1358 return -EINPROGRESS;
1360 uhci_remove_tds_from_frame(uhci, qh->iso_frame);
1362 ctrlstat = td_status(td);
1363 if (ctrlstat & TD_CTRL_ACTIVE) {
1364 status = -EXDEV; /* TD was added too late? */
1365 } else {
1366 status = uhci_map_status(uhci_status_bits(ctrlstat),
1367 usb_pipeout(urb->pipe));
1368 actlength = uhci_actual_length(ctrlstat);
1370 urb->actual_length += actlength;
1371 qh->iso_packet_desc->actual_length = actlength;
1372 qh->iso_packet_desc->status = status;
1374 if (status)
1375 urb->error_count++;
1377 uhci_remove_td_from_urbp(td);
1378 uhci_free_td(uhci, td);
1379 qh->iso_frame += qh->period;
1380 ++qh->iso_packet_desc;
1382 return 0;
1385 static int uhci_urb_enqueue(struct usb_hcd *hcd,
1386 struct urb *urb, gfp_t mem_flags)
1388 int ret;
1389 struct uhci_hcd *uhci = hcd_to_uhci(hcd);
1390 unsigned long flags;
1391 struct urb_priv *urbp;
1392 struct uhci_qh *qh;
1394 spin_lock_irqsave(&uhci->lock, flags);
1396 ret = usb_hcd_link_urb_to_ep(hcd, urb);
1397 if (ret)
1398 goto done_not_linked;
1400 ret = -ENOMEM;
1401 urbp = uhci_alloc_urb_priv(uhci, urb);
1402 if (!urbp)
1403 goto done;
1405 if (urb->ep->hcpriv)
1406 qh = urb->ep->hcpriv;
1407 else {
1408 qh = uhci_alloc_qh(uhci, urb->dev, urb->ep);
1409 if (!qh)
1410 goto err_no_qh;
1412 urbp->qh = qh;
1414 switch (qh->type) {
1415 case USB_ENDPOINT_XFER_CONTROL:
1416 ret = uhci_submit_control(uhci, urb, qh);
1417 break;
1418 case USB_ENDPOINT_XFER_BULK:
1419 ret = uhci_submit_bulk(uhci, urb, qh);
1420 break;
1421 case USB_ENDPOINT_XFER_INT:
1422 ret = uhci_submit_interrupt(uhci, urb, qh);
1423 break;
1424 case USB_ENDPOINT_XFER_ISOC:
1425 urb->error_count = 0;
1426 ret = uhci_submit_isochronous(uhci, urb, qh);
1427 break;
1429 if (ret != 0)
1430 goto err_submit_failed;
1432 /* Add this URB to the QH */
1433 list_add_tail(&urbp->node, &qh->queue);
1435 /* If the new URB is the first and only one on this QH then either
1436 * the QH is new and idle or else it's unlinked and waiting to
1437 * become idle, so we can activate it right away. But only if the
1438 * queue isn't stopped. */
1439 if (qh->queue.next == &urbp->node && !qh->is_stopped) {
1440 uhci_activate_qh(uhci, qh);
1441 uhci_urbp_wants_fsbr(uhci, urbp);
1443 goto done;
1445 err_submit_failed:
1446 if (qh->state == QH_STATE_IDLE)
1447 uhci_make_qh_idle(uhci, qh); /* Reclaim unused QH */
1448 err_no_qh:
1449 uhci_free_urb_priv(uhci, urbp);
1450 done:
1451 if (ret)
1452 usb_hcd_unlink_urb_from_ep(hcd, urb);
1453 done_not_linked:
1454 spin_unlock_irqrestore(&uhci->lock, flags);
1455 return ret;
1458 static int uhci_urb_dequeue(struct usb_hcd *hcd, struct urb *urb, int status)
1460 struct uhci_hcd *uhci = hcd_to_uhci(hcd);
1461 unsigned long flags;
1462 struct uhci_qh *qh;
1463 int rc;
1465 spin_lock_irqsave(&uhci->lock, flags);
1466 rc = usb_hcd_check_unlink_urb(hcd, urb, status);
1467 if (rc)
1468 goto done;
1470 qh = ((struct urb_priv *) urb->hcpriv)->qh;
1472 /* Remove Isochronous TDs from the frame list ASAP */
1473 if (qh->type == USB_ENDPOINT_XFER_ISOC) {
1474 uhci_unlink_isochronous_tds(uhci, urb);
1475 mb();
1477 /* If the URB has already started, update the QH unlink time */
1478 uhci_get_current_frame_number(uhci);
1479 if (uhci_frame_before_eq(urb->start_frame, uhci->frame_number))
1480 qh->unlink_frame = uhci->frame_number;
1483 uhci_unlink_qh(uhci, qh);
1485 done:
1486 spin_unlock_irqrestore(&uhci->lock, flags);
1487 return rc;
1491 * Finish unlinking an URB and give it back
1493 static void uhci_giveback_urb(struct uhci_hcd *uhci, struct uhci_qh *qh,
1494 struct urb *urb, int status)
1495 __releases(uhci->lock)
1496 __acquires(uhci->lock)
1498 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1500 if (qh->type == USB_ENDPOINT_XFER_CONTROL) {
1502 /* Subtract off the length of the SETUP packet from
1503 * urb->actual_length.
1505 urb->actual_length -= min_t(u32, 8, urb->actual_length);
1508 /* When giving back the first URB in an Isochronous queue,
1509 * reinitialize the QH's iso-related members for the next URB. */
1510 else if (qh->type == USB_ENDPOINT_XFER_ISOC &&
1511 urbp->node.prev == &qh->queue &&
1512 urbp->node.next != &qh->queue) {
1513 struct urb *nurb = list_entry(urbp->node.next,
1514 struct urb_priv, node)->urb;
1516 qh->iso_packet_desc = &nurb->iso_frame_desc[0];
1517 qh->iso_frame = nurb->start_frame;
1520 /* Take the URB off the QH's queue. If the queue is now empty,
1521 * this is a perfect time for a toggle fixup. */
1522 list_del_init(&urbp->node);
1523 if (list_empty(&qh->queue) && qh->needs_fixup) {
1524 usb_settoggle(urb->dev, usb_pipeendpoint(urb->pipe),
1525 usb_pipeout(urb->pipe), qh->initial_toggle);
1526 qh->needs_fixup = 0;
1529 uhci_free_urb_priv(uhci, urbp);
1530 usb_hcd_unlink_urb_from_ep(uhci_to_hcd(uhci), urb);
1532 spin_unlock(&uhci->lock);
1533 usb_hcd_giveback_urb(uhci_to_hcd(uhci), urb, status);
1534 spin_lock(&uhci->lock);
1536 /* If the queue is now empty, we can unlink the QH and give up its
1537 * reserved bandwidth. */
1538 if (list_empty(&qh->queue)) {
1539 uhci_unlink_qh(uhci, qh);
1540 if (qh->bandwidth_reserved)
1541 uhci_release_bandwidth(uhci, qh);
1546 * Scan the URBs in a QH's queue
1548 #define QH_FINISHED_UNLINKING(qh) \
1549 (qh->state == QH_STATE_UNLINKING && \
1550 uhci->frame_number + uhci->is_stopped != qh->unlink_frame)
1552 static void uhci_scan_qh(struct uhci_hcd *uhci, struct uhci_qh *qh)
1554 struct urb_priv *urbp;
1555 struct urb *urb;
1556 int status;
1558 while (!list_empty(&qh->queue)) {
1559 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1560 urb = urbp->urb;
1562 if (qh->type == USB_ENDPOINT_XFER_ISOC)
1563 status = uhci_result_isochronous(uhci, urb);
1564 else
1565 status = uhci_result_common(uhci, urb);
1566 if (status == -EINPROGRESS)
1567 break;
1569 /* Dequeued but completed URBs can't be given back unless
1570 * the QH is stopped or has finished unlinking. */
1571 if (urb->unlinked) {
1572 if (QH_FINISHED_UNLINKING(qh))
1573 qh->is_stopped = 1;
1574 else if (!qh->is_stopped)
1575 return;
1578 uhci_giveback_urb(uhci, qh, urb, status);
1579 if (status < 0)
1580 break;
1583 /* If the QH is neither stopped nor finished unlinking (normal case),
1584 * our work here is done. */
1585 if (QH_FINISHED_UNLINKING(qh))
1586 qh->is_stopped = 1;
1587 else if (!qh->is_stopped)
1588 return;
1590 /* Otherwise give back each of the dequeued URBs */
1591 restart:
1592 list_for_each_entry(urbp, &qh->queue, node) {
1593 urb = urbp->urb;
1594 if (urb->unlinked) {
1596 /* Fix up the TD links and save the toggles for
1597 * non-Isochronous queues. For Isochronous queues,
1598 * test for too-recent dequeues. */
1599 if (!uhci_cleanup_queue(uhci, qh, urb)) {
1600 qh->is_stopped = 0;
1601 return;
1603 uhci_giveback_urb(uhci, qh, urb, 0);
1604 goto restart;
1607 qh->is_stopped = 0;
1609 /* There are no more dequeued URBs. If there are still URBs on the
1610 * queue, the QH can now be re-activated. */
1611 if (!list_empty(&qh->queue)) {
1612 if (qh->needs_fixup)
1613 uhci_fixup_toggles(qh, 0);
1615 /* If the first URB on the queue wants FSBR but its time
1616 * limit has expired, set the next TD to interrupt on
1617 * completion before reactivating the QH. */
1618 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1619 if (urbp->fsbr && qh->wait_expired) {
1620 struct uhci_td *td = list_entry(urbp->td_list.next,
1621 struct uhci_td, list);
1623 td->status |= __cpu_to_le32(TD_CTRL_IOC);
1626 uhci_activate_qh(uhci, qh);
1629 /* The queue is empty. The QH can become idle if it is fully
1630 * unlinked. */
1631 else if (QH_FINISHED_UNLINKING(qh))
1632 uhci_make_qh_idle(uhci, qh);
1636 * Check for queues that have made some forward progress.
1637 * Returns 0 if the queue is not Isochronous, is ACTIVE, and
1638 * has not advanced since last examined; 1 otherwise.
1640 * Early Intel controllers have a bug which causes qh->element sometimes
1641 * not to advance when a TD completes successfully. The queue remains
1642 * stuck on the inactive completed TD. We detect such cases and advance
1643 * the element pointer by hand.
1645 static int uhci_advance_check(struct uhci_hcd *uhci, struct uhci_qh *qh)
1647 struct urb_priv *urbp = NULL;
1648 struct uhci_td *td;
1649 int ret = 1;
1650 unsigned status;
1652 if (qh->type == USB_ENDPOINT_XFER_ISOC)
1653 goto done;
1655 /* Treat an UNLINKING queue as though it hasn't advanced.
1656 * This is okay because reactivation will treat it as though
1657 * it has advanced, and if it is going to become IDLE then
1658 * this doesn't matter anyway. Furthermore it's possible
1659 * for an UNLINKING queue not to have any URBs at all, or
1660 * for its first URB not to have any TDs (if it was dequeued
1661 * just as it completed). So it's not easy in any case to
1662 * test whether such queues have advanced. */
1663 if (qh->state != QH_STATE_ACTIVE) {
1664 urbp = NULL;
1665 status = 0;
1667 } else {
1668 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1669 td = list_entry(urbp->td_list.next, struct uhci_td, list);
1670 status = td_status(td);
1671 if (!(status & TD_CTRL_ACTIVE)) {
1673 /* We're okay, the queue has advanced */
1674 qh->wait_expired = 0;
1675 qh->advance_jiffies = jiffies;
1676 goto done;
1678 ret = uhci->is_stopped;
1681 /* The queue hasn't advanced; check for timeout */
1682 if (qh->wait_expired)
1683 goto done;
1685 if (time_after(jiffies, qh->advance_jiffies + QH_WAIT_TIMEOUT)) {
1687 /* Detect the Intel bug and work around it */
1688 if (qh->post_td && qh_element(qh) == LINK_TO_TD(qh->post_td)) {
1689 qh->element = qh->post_td->link;
1690 qh->advance_jiffies = jiffies;
1691 ret = 1;
1692 goto done;
1695 qh->wait_expired = 1;
1697 /* If the current URB wants FSBR, unlink it temporarily
1698 * so that we can safely set the next TD to interrupt on
1699 * completion. That way we'll know as soon as the queue
1700 * starts moving again. */
1701 if (urbp && urbp->fsbr && !(status & TD_CTRL_IOC))
1702 uhci_unlink_qh(uhci, qh);
1704 } else {
1705 /* Unmoving but not-yet-expired queues keep FSBR alive */
1706 if (urbp)
1707 uhci_urbp_wants_fsbr(uhci, urbp);
1710 done:
1711 return ret;
1715 * Process events in the schedule, but only in one thread at a time
1717 static void uhci_scan_schedule(struct uhci_hcd *uhci)
1719 int i;
1720 struct uhci_qh *qh;
1722 /* Don't allow re-entrant calls */
1723 if (uhci->scan_in_progress) {
1724 uhci->need_rescan = 1;
1725 return;
1727 uhci->scan_in_progress = 1;
1728 rescan:
1729 uhci->need_rescan = 0;
1730 uhci->fsbr_is_wanted = 0;
1732 uhci_clear_next_interrupt(uhci);
1733 uhci_get_current_frame_number(uhci);
1734 uhci->cur_iso_frame = uhci->frame_number;
1736 /* Go through all the QH queues and process the URBs in each one */
1737 for (i = 0; i < UHCI_NUM_SKELQH - 1; ++i) {
1738 uhci->next_qh = list_entry(uhci->skelqh[i]->node.next,
1739 struct uhci_qh, node);
1740 while ((qh = uhci->next_qh) != uhci->skelqh[i]) {
1741 uhci->next_qh = list_entry(qh->node.next,
1742 struct uhci_qh, node);
1744 if (uhci_advance_check(uhci, qh)) {
1745 uhci_scan_qh(uhci, qh);
1746 if (qh->state == QH_STATE_ACTIVE) {
1747 uhci_urbp_wants_fsbr(uhci,
1748 list_entry(qh->queue.next, struct urb_priv, node));
1754 uhci->last_iso_frame = uhci->cur_iso_frame;
1755 if (uhci->need_rescan)
1756 goto rescan;
1757 uhci->scan_in_progress = 0;
1759 if (uhci->fsbr_is_on && !uhci->fsbr_is_wanted &&
1760 !uhci->fsbr_expiring) {
1761 uhci->fsbr_expiring = 1;
1762 mod_timer(&uhci->fsbr_timer, jiffies + FSBR_OFF_DELAY);
1765 if (list_empty(&uhci->skel_unlink_qh->node))
1766 uhci_clear_next_interrupt(uhci);
1767 else
1768 uhci_set_next_interrupt(uhci);