ehci-q.c 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118
  1. /*
  2. * Copyright (C) 2001-2004 by David Brownell
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of the GNU General Public License as published by the
  6. * Free Software Foundation; either version 2 of the License, or (at your
  7. * option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful, but
  10. * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  11. * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
  12. * for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software Foundation,
  16. * Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. /* this file is part of ehci-hcd.c */
  19. /*-------------------------------------------------------------------------*/
  20. /*
  21. * EHCI hardware queue manipulation ... the core. QH/QTD manipulation.
  22. *
  23. * Control, bulk, and interrupt traffic all use "qh" lists. They list "qtd"
  24. * entries describing USB transactions, max 16-20kB/entry (with 4kB-aligned
  25. * buffers needed for the larger number). We use one QH per endpoint, queue
  26. * multiple urbs (all three types) per endpoint. URBs may need several qtds.
  27. *
  28. * ISO traffic uses "ISO TD" (itd, and sitd) records, and (along with
  29. * interrupts) needs careful scheduling. Performance improvements can be
  30. * an ongoing challenge. That's in "ehci-sched.c".
  31. *
  32. * USB 1.1 devices are handled (a) by "companion" OHCI or UHCI root hubs,
  33. * or otherwise through transaction translators (TTs) in USB 2.0 hubs using
  34. * (b) special fields in qh entries or (c) split iso entries. TTs will
  35. * buffer low/full speed data so the host collects it at high speed.
  36. */
  37. /*-------------------------------------------------------------------------*/
  38. /* fill a qtd, returning how much of the buffer we were able to queue up */
  39. static int
  40. qtd_fill(struct ehci_hcd *ehci, struct ehci_qtd *qtd, dma_addr_t buf,
  41. size_t len, int token, int maxpacket)
  42. {
  43. int i, count;
  44. u64 addr = buf;
  45. /* one buffer entry per 4K ... first might be short or unaligned */
  46. qtd->hw_buf[0] = cpu_to_hc32(ehci, (u32)addr);
  47. qtd->hw_buf_hi[0] = cpu_to_hc32(ehci, (u32)(addr >> 32));
  48. count = 0x1000 - (buf & 0x0fff); /* rest of that page */
  49. if (likely (len < count)) /* ... iff needed */
  50. count = len;
  51. else {
  52. buf += 0x1000;
  53. buf &= ~0x0fff;
  54. /* per-qtd limit: from 16K to 20K (best alignment) */
  55. for (i = 1; count < len && i < 5; i++) {
  56. addr = buf;
  57. qtd->hw_buf[i] = cpu_to_hc32(ehci, (u32)addr);
  58. qtd->hw_buf_hi[i] = cpu_to_hc32(ehci,
  59. (u32)(addr >> 32));
  60. buf += 0x1000;
  61. if ((count + 0x1000) < len)
  62. count += 0x1000;
  63. else
  64. count = len;
  65. }
  66. /* short packets may only terminate transfers */
  67. if (count != len)
  68. count -= (count % maxpacket);
  69. }
  70. qtd->hw_token = cpu_to_hc32(ehci, (count << 16) | token);
  71. qtd->length = count;
  72. return count;
  73. }
  74. /*-------------------------------------------------------------------------*/
  75. static inline void
  76. qh_update (struct ehci_hcd *ehci, struct ehci_qh *qh, struct ehci_qtd *qtd)
  77. {
  78. /* writes to an active overlay are unsafe */
  79. BUG_ON(qh->qh_state != QH_STATE_IDLE);
  80. qh->hw_qtd_next = QTD_NEXT(ehci, qtd->qtd_dma);
  81. qh->hw_alt_next = EHCI_LIST_END(ehci);
  82. /* Except for control endpoints, we make hardware maintain data
  83. * toggle (like OHCI) ... here (re)initialize the toggle in the QH,
  84. * and set the pseudo-toggle in udev. Only usb_clear_halt() will
  85. * ever clear it.
  86. */
  87. if (!(qh->hw_info1 & cpu_to_hc32(ehci, 1 << 14))) {
  88. unsigned is_out, epnum;
  89. is_out = !(qtd->hw_token & cpu_to_hc32(ehci, 1 << 8));
  90. epnum = (hc32_to_cpup(ehci, &qh->hw_info1) >> 8) & 0x0f;
  91. if (unlikely (!usb_gettoggle (qh->dev, epnum, is_out))) {
  92. qh->hw_token &= ~cpu_to_hc32(ehci, QTD_TOGGLE);
  93. usb_settoggle (qh->dev, epnum, is_out, 1);
  94. }
  95. }
  96. /* HC must see latest qtd and qh data before we clear ACTIVE+HALT */
  97. wmb ();
  98. qh->hw_token &= cpu_to_hc32(ehci, QTD_TOGGLE | QTD_STS_PING);
  99. }
  100. /* if it weren't for a common silicon quirk (writing the dummy into the qh
  101. * overlay, so qh->hw_token wrongly becomes inactive/halted), only fault
  102. * recovery (including urb dequeue) would need software changes to a QH...
  103. */
  104. static void
  105. qh_refresh (struct ehci_hcd *ehci, struct ehci_qh *qh)
  106. {
  107. struct ehci_qtd *qtd;
  108. if (list_empty (&qh->qtd_list))
  109. qtd = qh->dummy;
  110. else {
  111. qtd = list_entry (qh->qtd_list.next,
  112. struct ehci_qtd, qtd_list);
  113. /* first qtd may already be partially processed */
  114. if (cpu_to_hc32(ehci, qtd->qtd_dma) == qh->hw_current)
  115. qtd = NULL;
  116. }
  117. if (qtd)
  118. qh_update (ehci, qh, qtd);
  119. }
  120. /*-------------------------------------------------------------------------*/
  121. static void qtd_copy_status (
  122. struct ehci_hcd *ehci,
  123. struct urb *urb,
  124. size_t length,
  125. u32 token
  126. )
  127. {
  128. /* count IN/OUT bytes, not SETUP (even short packets) */
  129. if (likely (QTD_PID (token) != 2))
  130. urb->actual_length += length - QTD_LENGTH (token);
  131. /* don't modify error codes */
  132. if (unlikely (urb->status != -EINPROGRESS))
  133. return;
  134. /* force cleanup after short read; not always an error */
  135. if (unlikely (IS_SHORT_READ (token)))
  136. urb->status = -EREMOTEIO;
  137. /* serious "can't proceed" faults reported by the hardware */
  138. if (token & QTD_STS_HALT) {
  139. if (token & QTD_STS_BABBLE) {
  140. /* FIXME "must" disable babbling device's port too */
  141. urb->status = -EOVERFLOW;
  142. } else if (token & QTD_STS_MMF) {
  143. /* fs/ls interrupt xfer missed the complete-split */
  144. urb->status = -EPROTO;
  145. } else if (token & QTD_STS_DBE) {
  146. urb->status = (QTD_PID (token) == 1) /* IN ? */
  147. ? -ENOSR /* hc couldn't read data */
  148. : -ECOMM; /* hc couldn't write data */
  149. } else if (token & QTD_STS_XACT) {
  150. /* timeout, bad crc, wrong PID, etc; retried */
  151. if (QTD_CERR (token))
  152. urb->status = -EPIPE;
  153. else {
  154. ehci_dbg (ehci, "devpath %s ep%d%s 3strikes\n",
  155. urb->dev->devpath,
  156. usb_pipeendpoint (urb->pipe),
  157. usb_pipein (urb->pipe) ? "in" : "out");
  158. urb->status = -EPROTO;
  159. }
  160. /* CERR nonzero + no errors + halt --> stall */
  161. } else if (QTD_CERR (token))
  162. urb->status = -EPIPE;
  163. else /* unknown */
  164. urb->status = -EPROTO;
  165. ehci_vdbg (ehci,
  166. "dev%d ep%d%s qtd token %08x --> status %d\n",
  167. usb_pipedevice (urb->pipe),
  168. usb_pipeendpoint (urb->pipe),
  169. usb_pipein (urb->pipe) ? "in" : "out",
  170. token, urb->status);
  171. /* if async CSPLIT failed, try cleaning out the TT buffer */
  172. if (urb->status != -EPIPE
  173. && urb->dev->tt && !usb_pipeint (urb->pipe)
  174. && ((token & QTD_STS_MMF) != 0
  175. || QTD_CERR(token) == 0)
  176. && (!ehci_is_TDI(ehci)
  177. || urb->dev->tt->hub !=
  178. ehci_to_hcd(ehci)->self.root_hub)) {
  179. #ifdef DEBUG
  180. struct usb_device *tt = urb->dev->tt->hub;
  181. dev_dbg (&tt->dev,
  182. "clear tt buffer port %d, a%d ep%d t%08x\n",
  183. urb->dev->ttport, urb->dev->devnum,
  184. usb_pipeendpoint (urb->pipe), token);
  185. #endif /* DEBUG */
  186. usb_hub_tt_clear_buffer (urb->dev, urb->pipe);
  187. }
  188. }
  189. }
  190. static void
  191. ehci_urb_done (struct ehci_hcd *ehci, struct urb *urb)
  192. __releases(ehci->lock)
  193. __acquires(ehci->lock)
  194. {
  195. if (likely (urb->hcpriv != NULL)) {
  196. struct ehci_qh *qh = (struct ehci_qh *) urb->hcpriv;
  197. /* S-mask in a QH means it's an interrupt urb */
  198. if ((qh->hw_info2 & cpu_to_hc32(ehci, QH_SMASK)) != 0) {
  199. /* ... update hc-wide periodic stats (for usbfs) */
  200. ehci_to_hcd(ehci)->self.bandwidth_int_reqs--;
  201. }
  202. qh_put (qh);
  203. }
  204. spin_lock (&urb->lock);
  205. urb->hcpriv = NULL;
  206. switch (urb->status) {
  207. case -EINPROGRESS: /* success */
  208. urb->status = 0;
  209. default: /* fault */
  210. COUNT (ehci->stats.complete);
  211. break;
  212. case -EREMOTEIO: /* fault or normal */
  213. if (!(urb->transfer_flags & URB_SHORT_NOT_OK))
  214. urb->status = 0;
  215. COUNT (ehci->stats.complete);
  216. break;
  217. case -ECONNRESET: /* canceled */
  218. case -ENOENT:
  219. COUNT (ehci->stats.unlink);
  220. break;
  221. }
  222. spin_unlock (&urb->lock);
  223. #ifdef EHCI_URB_TRACE
  224. ehci_dbg (ehci,
  225. "%s %s urb %p ep%d%s status %d len %d/%d\n",
  226. __FUNCTION__, urb->dev->devpath, urb,
  227. usb_pipeendpoint (urb->pipe),
  228. usb_pipein (urb->pipe) ? "in" : "out",
  229. urb->status,
  230. urb->actual_length, urb->transfer_buffer_length);
  231. #endif
  232. /* complete() can reenter this HCD */
  233. spin_unlock (&ehci->lock);
  234. usb_hcd_giveback_urb (ehci_to_hcd(ehci), urb);
  235. spin_lock (&ehci->lock);
  236. }
  237. static void start_unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh);
  238. static void unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh);
  239. static void intr_deschedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  240. static int qh_schedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  241. /*
  242. * Process and free completed qtds for a qh, returning URBs to drivers.
  243. * Chases up to qh->hw_current. Returns number of completions called,
  244. * indicating how much "real" work we did.
  245. */
  246. static unsigned
  247. qh_completions (struct ehci_hcd *ehci, struct ehci_qh *qh)
  248. {
  249. struct ehci_qtd *last = NULL, *end = qh->dummy;
  250. struct list_head *entry, *tmp;
  251. int stopped;
  252. unsigned count = 0;
  253. int do_status = 0;
  254. u8 state;
  255. u32 halt = HALT_BIT(ehci);
  256. if (unlikely (list_empty (&qh->qtd_list)))
  257. return count;
  258. /* completions (or tasks on other cpus) must never clobber HALT
  259. * till we've gone through and cleaned everything up, even when
  260. * they add urbs to this qh's queue or mark them for unlinking.
  261. *
  262. * NOTE: unlinking expects to be done in queue order.
  263. */
  264. state = qh->qh_state;
  265. qh->qh_state = QH_STATE_COMPLETING;
  266. stopped = (state == QH_STATE_IDLE);
  267. /* remove de-activated QTDs from front of queue.
  268. * after faults (including short reads), cleanup this urb
  269. * then let the queue advance.
  270. * if queue is stopped, handles unlinks.
  271. */
  272. list_for_each_safe (entry, tmp, &qh->qtd_list) {
  273. struct ehci_qtd *qtd;
  274. struct urb *urb;
  275. u32 token = 0;
  276. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  277. urb = qtd->urb;
  278. /* clean up any state from previous QTD ...*/
  279. if (last) {
  280. if (likely (last->urb != urb)) {
  281. ehci_urb_done (ehci, last->urb);
  282. count++;
  283. }
  284. ehci_qtd_free (ehci, last);
  285. last = NULL;
  286. }
  287. /* ignore urbs submitted during completions we reported */
  288. if (qtd == end)
  289. break;
  290. /* hardware copies qtd out of qh overlay */
  291. rmb ();
  292. token = hc32_to_cpu(ehci, qtd->hw_token);
  293. /* always clean up qtds the hc de-activated */
  294. if ((token & QTD_STS_ACTIVE) == 0) {
  295. if ((token & QTD_STS_HALT) != 0) {
  296. stopped = 1;
  297. /* magic dummy for some short reads; qh won't advance.
  298. * that silicon quirk can kick in with this dummy too.
  299. */
  300. } else if (IS_SHORT_READ (token)
  301. && !(qtd->hw_alt_next
  302. & EHCI_LIST_END(ehci))) {
  303. stopped = 1;
  304. goto halt;
  305. }
  306. /* stop scanning when we reach qtds the hc is using */
  307. } else if (likely (!stopped
  308. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))) {
  309. break;
  310. } else {
  311. stopped = 1;
  312. if (unlikely (!HC_IS_RUNNING (ehci_to_hcd(ehci)->state)))
  313. urb->status = -ESHUTDOWN;
  314. /* ignore active urbs unless some previous qtd
  315. * for the urb faulted (including short read) or
  316. * its urb was canceled. we may patch qh or qtds.
  317. */
  318. if (likely (urb->status == -EINPROGRESS))
  319. continue;
  320. /* issue status after short control reads */
  321. if (unlikely (do_status != 0)
  322. && QTD_PID (token) == 0 /* OUT */) {
  323. do_status = 0;
  324. continue;
  325. }
  326. /* token in overlay may be most current */
  327. if (state == QH_STATE_IDLE
  328. && cpu_to_hc32(ehci, qtd->qtd_dma)
  329. == qh->hw_current)
  330. token = hc32_to_cpu(ehci, qh->hw_token);
  331. /* force halt for unlinked or blocked qh, so we'll
  332. * patch the qh later and so that completions can't
  333. * activate it while we "know" it's stopped.
  334. */
  335. if ((halt & qh->hw_token) == 0) {
  336. halt:
  337. qh->hw_token |= halt;
  338. wmb ();
  339. }
  340. }
  341. /* remove it from the queue */
  342. spin_lock (&urb->lock);
  343. qtd_copy_status (ehci, urb, qtd->length, token);
  344. do_status = (urb->status == -EREMOTEIO)
  345. && usb_pipecontrol (urb->pipe);
  346. spin_unlock (&urb->lock);
  347. if (stopped && qtd->qtd_list.prev != &qh->qtd_list) {
  348. last = list_entry (qtd->qtd_list.prev,
  349. struct ehci_qtd, qtd_list);
  350. last->hw_next = qtd->hw_next;
  351. }
  352. list_del (&qtd->qtd_list);
  353. last = qtd;
  354. }
  355. /* last urb's completion might still need calling */
  356. if (likely (last != NULL)) {
  357. ehci_urb_done (ehci, last->urb);
  358. count++;
  359. ehci_qtd_free (ehci, last);
  360. }
  361. /* restore original state; caller must unlink or relink */
  362. qh->qh_state = state;
  363. /* be sure the hardware's done with the qh before refreshing
  364. * it after fault cleanup, or recovering from silicon wrongly
  365. * overlaying the dummy qtd (which reduces DMA chatter).
  366. */
  367. if (stopped != 0 || qh->hw_qtd_next == EHCI_LIST_END(ehci)) {
  368. switch (state) {
  369. case QH_STATE_IDLE:
  370. qh_refresh(ehci, qh);
  371. break;
  372. case QH_STATE_LINKED:
  373. /* should be rare for periodic transfers,
  374. * except maybe high bandwidth ...
  375. */
  376. if ((cpu_to_hc32(ehci, QH_SMASK)
  377. & qh->hw_info2) != 0) {
  378. intr_deschedule (ehci, qh);
  379. (void) qh_schedule (ehci, qh);
  380. } else
  381. unlink_async (ehci, qh);
  382. break;
  383. /* otherwise, unlink already started */
  384. }
  385. }
  386. return count;
  387. }
  388. /*-------------------------------------------------------------------------*/
  389. // high bandwidth multiplier, as encoded in highspeed endpoint descriptors
  390. #define hb_mult(wMaxPacketSize) (1 + (((wMaxPacketSize) >> 11) & 0x03))
  391. // ... and packet size, for any kind of endpoint descriptor
  392. #define max_packet(wMaxPacketSize) ((wMaxPacketSize) & 0x07ff)
  393. /*
  394. * reverse of qh_urb_transaction: free a list of TDs.
  395. * used for cleanup after errors, before HC sees an URB's TDs.
  396. */
  397. static void qtd_list_free (
  398. struct ehci_hcd *ehci,
  399. struct urb *urb,
  400. struct list_head *qtd_list
  401. ) {
  402. struct list_head *entry, *temp;
  403. list_for_each_safe (entry, temp, qtd_list) {
  404. struct ehci_qtd *qtd;
  405. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  406. list_del (&qtd->qtd_list);
  407. ehci_qtd_free (ehci, qtd);
  408. }
  409. }
  410. /*
  411. * create a list of filled qtds for this URB; won't link into qh.
  412. */
  413. static struct list_head *
  414. qh_urb_transaction (
  415. struct ehci_hcd *ehci,
  416. struct urb *urb,
  417. struct list_head *head,
  418. gfp_t flags
  419. ) {
  420. struct ehci_qtd *qtd, *qtd_prev;
  421. dma_addr_t buf;
  422. int len, maxpacket;
  423. int is_input;
  424. u32 token;
  425. /*
  426. * URBs map to sequences of QTDs: one logical transaction
  427. */
  428. qtd = ehci_qtd_alloc (ehci, flags);
  429. if (unlikely (!qtd))
  430. return NULL;
  431. list_add_tail (&qtd->qtd_list, head);
  432. qtd->urb = urb;
  433. token = QTD_STS_ACTIVE;
  434. token |= (EHCI_TUNE_CERR << 10);
  435. /* for split transactions, SplitXState initialized to zero */
  436. len = urb->transfer_buffer_length;
  437. is_input = usb_pipein (urb->pipe);
  438. if (usb_pipecontrol (urb->pipe)) {
  439. /* SETUP pid */
  440. qtd_fill(ehci, qtd, urb->setup_dma,
  441. sizeof (struct usb_ctrlrequest),
  442. token | (2 /* "setup" */ << 8), 8);
  443. /* ... and always at least one more pid */
  444. token ^= QTD_TOGGLE;
  445. qtd_prev = qtd;
  446. qtd = ehci_qtd_alloc (ehci, flags);
  447. if (unlikely (!qtd))
  448. goto cleanup;
  449. qtd->urb = urb;
  450. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  451. list_add_tail (&qtd->qtd_list, head);
  452. /* for zero length DATA stages, STATUS is always IN */
  453. if (len == 0)
  454. token |= (1 /* "in" */ << 8);
  455. }
  456. /*
  457. * data transfer stage: buffer setup
  458. */
  459. buf = urb->transfer_dma;
  460. if (is_input)
  461. token |= (1 /* "in" */ << 8);
  462. /* else it's already initted to "out" pid (0 << 8) */
  463. maxpacket = max_packet(usb_maxpacket(urb->dev, urb->pipe, !is_input));
  464. /*
  465. * buffer gets wrapped in one or more qtds;
  466. * last one may be "short" (including zero len)
  467. * and may serve as a control status ack
  468. */
  469. for (;;) {
  470. int this_qtd_len;
  471. this_qtd_len = qtd_fill(ehci, qtd, buf, len, token, maxpacket);
  472. len -= this_qtd_len;
  473. buf += this_qtd_len;
  474. if (is_input)
  475. qtd->hw_alt_next = ehci->async->hw_alt_next;
  476. /* qh makes control packets use qtd toggle; maybe switch it */
  477. if ((maxpacket & (this_qtd_len + (maxpacket - 1))) == 0)
  478. token ^= QTD_TOGGLE;
  479. if (likely (len <= 0))
  480. break;
  481. qtd_prev = qtd;
  482. qtd = ehci_qtd_alloc (ehci, flags);
  483. if (unlikely (!qtd))
  484. goto cleanup;
  485. qtd->urb = urb;
  486. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  487. list_add_tail (&qtd->qtd_list, head);
  488. }
  489. /* unless the bulk/interrupt caller wants a chance to clean
  490. * up after short reads, hc should advance qh past this urb
  491. */
  492. if (likely ((urb->transfer_flags & URB_SHORT_NOT_OK) == 0
  493. || usb_pipecontrol (urb->pipe)))
  494. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  495. /*
  496. * control requests may need a terminating data "status" ack;
  497. * bulk ones may need a terminating short packet (zero length).
  498. */
  499. if (likely (urb->transfer_buffer_length != 0)) {
  500. int one_more = 0;
  501. if (usb_pipecontrol (urb->pipe)) {
  502. one_more = 1;
  503. token ^= 0x0100; /* "in" <--> "out" */
  504. token |= QTD_TOGGLE; /* force DATA1 */
  505. } else if (usb_pipebulk (urb->pipe)
  506. && (urb->transfer_flags & URB_ZERO_PACKET)
  507. && !(urb->transfer_buffer_length % maxpacket)) {
  508. one_more = 1;
  509. }
  510. if (one_more) {
  511. qtd_prev = qtd;
  512. qtd = ehci_qtd_alloc (ehci, flags);
  513. if (unlikely (!qtd))
  514. goto cleanup;
  515. qtd->urb = urb;
  516. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  517. list_add_tail (&qtd->qtd_list, head);
  518. /* never any data in such packets */
  519. qtd_fill(ehci, qtd, 0, 0, token, 0);
  520. }
  521. }
  522. /* by default, enable interrupt on urb completion */
  523. if (likely (!(urb->transfer_flags & URB_NO_INTERRUPT)))
  524. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  525. return head;
  526. cleanup:
  527. qtd_list_free (ehci, urb, head);
  528. return NULL;
  529. }
  530. /*-------------------------------------------------------------------------*/
  531. // Would be best to create all qh's from config descriptors,
  532. // when each interface/altsetting is established. Unlink
  533. // any previous qh and cancel its urbs first; endpoints are
  534. // implicitly reset then (data toggle too).
  535. // That'd mean updating how usbcore talks to HCDs. (2.7?)
  536. /*
  537. * Each QH holds a qtd list; a QH is used for everything except iso.
  538. *
  539. * For interrupt urbs, the scheduler must set the microframe scheduling
  540. * mask(s) each time the QH gets scheduled. For highspeed, that's
  541. * just one microframe in the s-mask. For split interrupt transactions
  542. * there are additional complications: c-mask, maybe FSTNs.
  543. */
  544. static struct ehci_qh *
  545. qh_make (
  546. struct ehci_hcd *ehci,
  547. struct urb *urb,
  548. gfp_t flags
  549. ) {
  550. struct ehci_qh *qh = ehci_qh_alloc (ehci, flags);
  551. u32 info1 = 0, info2 = 0;
  552. int is_input, type;
  553. int maxp = 0;
  554. if (!qh)
  555. return qh;
  556. /*
  557. * init endpoint/device data for this QH
  558. */
  559. info1 |= usb_pipeendpoint (urb->pipe) << 8;
  560. info1 |= usb_pipedevice (urb->pipe) << 0;
  561. is_input = usb_pipein (urb->pipe);
  562. type = usb_pipetype (urb->pipe);
  563. maxp = usb_maxpacket (urb->dev, urb->pipe, !is_input);
  564. /* Compute interrupt scheduling parameters just once, and save.
  565. * - allowing for high bandwidth, how many nsec/uframe are used?
  566. * - split transactions need a second CSPLIT uframe; same question
  567. * - splits also need a schedule gap (for full/low speed I/O)
  568. * - qh has a polling interval
  569. *
  570. * For control/bulk requests, the HC or TT handles these.
  571. */
  572. if (type == PIPE_INTERRUPT) {
  573. qh->usecs = NS_TO_US (usb_calc_bus_time (USB_SPEED_HIGH, is_input, 0,
  574. hb_mult (maxp) * max_packet (maxp)));
  575. qh->start = NO_FRAME;
  576. if (urb->dev->speed == USB_SPEED_HIGH) {
  577. qh->c_usecs = 0;
  578. qh->gap_uf = 0;
  579. qh->period = urb->interval >> 3;
  580. if (qh->period == 0 && urb->interval != 1) {
  581. /* NOTE interval 2 or 4 uframes could work.
  582. * But interval 1 scheduling is simpler, and
  583. * includes high bandwidth.
  584. */
  585. dbg ("intr period %d uframes, NYET!",
  586. urb->interval);
  587. goto done;
  588. }
  589. } else {
  590. struct usb_tt *tt = urb->dev->tt;
  591. int think_time;
  592. /* gap is f(FS/LS transfer times) */
  593. qh->gap_uf = 1 + usb_calc_bus_time (urb->dev->speed,
  594. is_input, 0, maxp) / (125 * 1000);
  595. /* FIXME this just approximates SPLIT/CSPLIT times */
  596. if (is_input) { // SPLIT, gap, CSPLIT+DATA
  597. qh->c_usecs = qh->usecs + HS_USECS (0);
  598. qh->usecs = HS_USECS (1);
  599. } else { // SPLIT+DATA, gap, CSPLIT
  600. qh->usecs += HS_USECS (1);
  601. qh->c_usecs = HS_USECS (0);
  602. }
  603. think_time = tt ? tt->think_time : 0;
  604. qh->tt_usecs = NS_TO_US (think_time +
  605. usb_calc_bus_time (urb->dev->speed,
  606. is_input, 0, max_packet (maxp)));
  607. qh->period = urb->interval;
  608. }
  609. }
  610. /* support for tt scheduling, and access to toggles */
  611. qh->dev = urb->dev;
  612. /* using TT? */
  613. switch (urb->dev->speed) {
  614. case USB_SPEED_LOW:
  615. info1 |= (1 << 12); /* EPS "low" */
  616. /* FALL THROUGH */
  617. case USB_SPEED_FULL:
  618. /* EPS 0 means "full" */
  619. if (type != PIPE_INTERRUPT)
  620. info1 |= (EHCI_TUNE_RL_TT << 28);
  621. if (type == PIPE_CONTROL) {
  622. info1 |= (1 << 27); /* for TT */
  623. info1 |= 1 << 14; /* toggle from qtd */
  624. }
  625. info1 |= maxp << 16;
  626. info2 |= (EHCI_TUNE_MULT_TT << 30);
  627. /* Some Freescale processors have an erratum in which the
  628. * port number in the queue head was 0..N-1 instead of 1..N.
  629. */
  630. if (ehci_has_fsl_portno_bug(ehci))
  631. info2 |= (urb->dev->ttport-1) << 23;
  632. else
  633. info2 |= urb->dev->ttport << 23;
  634. /* set the address of the TT; for TDI's integrated
  635. * root hub tt, leave it zeroed.
  636. */
  637. if (!ehci_is_TDI(ehci)
  638. || urb->dev->tt->hub !=
  639. ehci_to_hcd(ehci)->self.root_hub)
  640. info2 |= urb->dev->tt->hub->devnum << 16;
  641. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets c-mask } */
  642. break;
  643. case USB_SPEED_HIGH: /* no TT involved */
  644. info1 |= (2 << 12); /* EPS "high" */
  645. if (type == PIPE_CONTROL) {
  646. info1 |= (EHCI_TUNE_RL_HS << 28);
  647. info1 |= 64 << 16; /* usb2 fixed maxpacket */
  648. info1 |= 1 << 14; /* toggle from qtd */
  649. info2 |= (EHCI_TUNE_MULT_HS << 30);
  650. } else if (type == PIPE_BULK) {
  651. info1 |= (EHCI_TUNE_RL_HS << 28);
  652. info1 |= 512 << 16; /* usb2 fixed maxpacket */
  653. info2 |= (EHCI_TUNE_MULT_HS << 30);
  654. } else { /* PIPE_INTERRUPT */
  655. info1 |= max_packet (maxp) << 16;
  656. info2 |= hb_mult (maxp) << 30;
  657. }
  658. break;
  659. default:
  660. dbg ("bogus dev %p speed %d", urb->dev, urb->dev->speed);
  661. done:
  662. qh_put (qh);
  663. return NULL;
  664. }
  665. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets s-mask } */
  666. /* init as live, toggle clear, advance to dummy */
  667. qh->qh_state = QH_STATE_IDLE;
  668. qh->hw_info1 = cpu_to_hc32(ehci, info1);
  669. qh->hw_info2 = cpu_to_hc32(ehci, info2);
  670. usb_settoggle (urb->dev, usb_pipeendpoint (urb->pipe), !is_input, 1);
  671. qh_refresh (ehci, qh);
  672. return qh;
  673. }
  674. /*-------------------------------------------------------------------------*/
  675. /* move qh (and its qtds) onto async queue; maybe enable queue. */
  676. static void qh_link_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  677. {
  678. __hc32 dma = QH_NEXT(ehci, qh->qh_dma);
  679. struct ehci_qh *head;
  680. /* (re)start the async schedule? */
  681. head = ehci->async;
  682. timer_action_done (ehci, TIMER_ASYNC_OFF);
  683. if (!head->qh_next.qh) {
  684. u32 cmd = ehci_readl(ehci, &ehci->regs->command);
  685. if (!(cmd & CMD_ASE)) {
  686. /* in case a clear of CMD_ASE didn't take yet */
  687. (void)handshake(ehci, &ehci->regs->status,
  688. STS_ASS, 0, 150);
  689. cmd |= CMD_ASE | CMD_RUN;
  690. ehci_writel(ehci, cmd, &ehci->regs->command);
  691. ehci_to_hcd(ehci)->state = HC_STATE_RUNNING;
  692. /* posted write need not be known to HC yet ... */
  693. }
  694. }
  695. /* clear halt and/or toggle; and maybe recover from silicon quirk */
  696. if (qh->qh_state == QH_STATE_IDLE)
  697. qh_refresh (ehci, qh);
  698. /* splice right after start */
  699. qh->qh_next = head->qh_next;
  700. qh->hw_next = head->hw_next;
  701. wmb ();
  702. head->qh_next.qh = qh;
  703. head->hw_next = dma;
  704. qh->qh_state = QH_STATE_LINKED;
  705. /* qtd completions reported later by interrupt */
  706. }
  707. /*-------------------------------------------------------------------------*/
  708. /*
  709. * For control/bulk/interrupt, return QH with these TDs appended.
  710. * Allocates and initializes the QH if necessary.
  711. * Returns null if it can't allocate a QH it needs to.
  712. * If the QH has TDs (urbs) already, that's great.
  713. */
  714. static struct ehci_qh *qh_append_tds (
  715. struct ehci_hcd *ehci,
  716. struct urb *urb,
  717. struct list_head *qtd_list,
  718. int epnum,
  719. void **ptr
  720. )
  721. {
  722. struct ehci_qh *qh = NULL;
  723. u32 qh_addr_mask = cpu_to_hc32(ehci, 0x7f);
  724. qh = (struct ehci_qh *) *ptr;
  725. if (unlikely (qh == NULL)) {
  726. /* can't sleep here, we have ehci->lock... */
  727. qh = qh_make (ehci, urb, GFP_ATOMIC);
  728. *ptr = qh;
  729. }
  730. if (likely (qh != NULL)) {
  731. struct ehci_qtd *qtd;
  732. if (unlikely (list_empty (qtd_list)))
  733. qtd = NULL;
  734. else
  735. qtd = list_entry (qtd_list->next, struct ehci_qtd,
  736. qtd_list);
  737. /* control qh may need patching ... */
  738. if (unlikely (epnum == 0)) {
  739. /* usb_reset_device() briefly reverts to address 0 */
  740. if (usb_pipedevice (urb->pipe) == 0)
  741. qh->hw_info1 &= ~qh_addr_mask;
  742. }
  743. /* just one way to queue requests: swap with the dummy qtd.
  744. * only hc or qh_refresh() ever modify the overlay.
  745. */
  746. if (likely (qtd != NULL)) {
  747. struct ehci_qtd *dummy;
  748. dma_addr_t dma;
  749. __hc32 token;
  750. /* to avoid racing the HC, use the dummy td instead of
  751. * the first td of our list (becomes new dummy). both
  752. * tds stay deactivated until we're done, when the
  753. * HC is allowed to fetch the old dummy (4.10.2).
  754. */
  755. token = qtd->hw_token;
  756. qtd->hw_token = HALT_BIT(ehci);
  757. wmb ();
  758. dummy = qh->dummy;
  759. dma = dummy->qtd_dma;
  760. *dummy = *qtd;
  761. dummy->qtd_dma = dma;
  762. list_del (&qtd->qtd_list);
  763. list_add (&dummy->qtd_list, qtd_list);
  764. __list_splice (qtd_list, qh->qtd_list.prev);
  765. ehci_qtd_init(ehci, qtd, qtd->qtd_dma);
  766. qh->dummy = qtd;
  767. /* hc must see the new dummy at list end */
  768. dma = qtd->qtd_dma;
  769. qtd = list_entry (qh->qtd_list.prev,
  770. struct ehci_qtd, qtd_list);
  771. qtd->hw_next = QTD_NEXT(ehci, dma);
  772. /* let the hc process these next qtds */
  773. wmb ();
  774. dummy->hw_token = token;
  775. urb->hcpriv = qh_get (qh);
  776. }
  777. }
  778. return qh;
  779. }
  780. /*-------------------------------------------------------------------------*/
  781. static int
  782. submit_async (
  783. struct ehci_hcd *ehci,
  784. struct usb_host_endpoint *ep,
  785. struct urb *urb,
  786. struct list_head *qtd_list,
  787. gfp_t mem_flags
  788. ) {
  789. struct ehci_qtd *qtd;
  790. int epnum;
  791. unsigned long flags;
  792. struct ehci_qh *qh = NULL;
  793. int rc = 0;
  794. qtd = list_entry (qtd_list->next, struct ehci_qtd, qtd_list);
  795. epnum = ep->desc.bEndpointAddress;
  796. #ifdef EHCI_URB_TRACE
  797. ehci_dbg (ehci,
  798. "%s %s urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  799. __FUNCTION__, urb->dev->devpath, urb,
  800. epnum & 0x0f, (epnum & USB_DIR_IN) ? "in" : "out",
  801. urb->transfer_buffer_length,
  802. qtd, ep->hcpriv);
  803. #endif
  804. spin_lock_irqsave (&ehci->lock, flags);
  805. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  806. &ehci_to_hcd(ehci)->flags))) {
  807. rc = -ESHUTDOWN;
  808. goto done;
  809. }
  810. qh = qh_append_tds (ehci, urb, qtd_list, epnum, &ep->hcpriv);
  811. if (unlikely(qh == NULL)) {
  812. rc = -ENOMEM;
  813. goto done;
  814. }
  815. /* Control/bulk operations through TTs don't need scheduling,
  816. * the HC and TT handle it when the TT has a buffer ready.
  817. */
  818. if (likely (qh->qh_state == QH_STATE_IDLE))
  819. qh_link_async (ehci, qh_get (qh));
  820. done:
  821. spin_unlock_irqrestore (&ehci->lock, flags);
  822. if (unlikely (qh == NULL))
  823. qtd_list_free (ehci, urb, qtd_list);
  824. return rc;
  825. }
  826. /*-------------------------------------------------------------------------*/
  827. /* the async qh for the qtds being reclaimed are now unlinked from the HC */
  828. static void end_unlink_async (struct ehci_hcd *ehci)
  829. {
  830. struct ehci_qh *qh = ehci->reclaim;
  831. struct ehci_qh *next;
  832. timer_action_done (ehci, TIMER_IAA_WATCHDOG);
  833. // qh->hw_next = cpu_to_hc32(qh->qh_dma);
  834. qh->qh_state = QH_STATE_IDLE;
  835. qh->qh_next.qh = NULL;
  836. qh_put (qh); // refcount from reclaim
  837. /* other unlink(s) may be pending (in QH_STATE_UNLINK_WAIT) */
  838. next = qh->reclaim;
  839. ehci->reclaim = next;
  840. ehci->reclaim_ready = 0;
  841. qh->reclaim = NULL;
  842. qh_completions (ehci, qh);
  843. if (!list_empty (&qh->qtd_list)
  844. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))
  845. qh_link_async (ehci, qh);
  846. else {
  847. qh_put (qh); // refcount from async list
  848. /* it's not free to turn the async schedule on/off; leave it
  849. * active but idle for a while once it empties.
  850. */
  851. if (HC_IS_RUNNING (ehci_to_hcd(ehci)->state)
  852. && ehci->async->qh_next.qh == NULL)
  853. timer_action (ehci, TIMER_ASYNC_OFF);
  854. }
  855. if (next) {
  856. ehci->reclaim = NULL;
  857. start_unlink_async (ehci, next);
  858. }
  859. }
  860. /* makes sure the async qh will become idle */
  861. /* caller must own ehci->lock */
  862. static void start_unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  863. {
  864. int cmd = ehci_readl(ehci, &ehci->regs->command);
  865. struct ehci_qh *prev;
  866. #ifdef DEBUG
  867. assert_spin_locked(&ehci->lock);
  868. if (ehci->reclaim
  869. || (qh->qh_state != QH_STATE_LINKED
  870. && qh->qh_state != QH_STATE_UNLINK_WAIT)
  871. )
  872. BUG ();
  873. #endif
  874. /* stop async schedule right now? */
  875. if (unlikely (qh == ehci->async)) {
  876. /* can't get here without STS_ASS set */
  877. if (ehci_to_hcd(ehci)->state != HC_STATE_HALT
  878. && !ehci->reclaim) {
  879. /* ... and CMD_IAAD clear */
  880. ehci_writel(ehci, cmd & ~CMD_ASE,
  881. &ehci->regs->command);
  882. wmb ();
  883. // handshake later, if we need to
  884. timer_action_done (ehci, TIMER_ASYNC_OFF);
  885. }
  886. return;
  887. }
  888. qh->qh_state = QH_STATE_UNLINK;
  889. ehci->reclaim = qh = qh_get (qh);
  890. prev = ehci->async;
  891. while (prev->qh_next.qh != qh)
  892. prev = prev->qh_next.qh;
  893. prev->hw_next = qh->hw_next;
  894. prev->qh_next = qh->qh_next;
  895. wmb ();
  896. if (unlikely (ehci_to_hcd(ehci)->state == HC_STATE_HALT)) {
  897. /* if (unlikely (qh->reclaim != 0))
  898. * this will recurse, probably not much
  899. */
  900. end_unlink_async (ehci);
  901. return;
  902. }
  903. ehci->reclaim_ready = 0;
  904. cmd |= CMD_IAAD;
  905. ehci_writel(ehci, cmd, &ehci->regs->command);
  906. (void)ehci_readl(ehci, &ehci->regs->command);
  907. timer_action (ehci, TIMER_IAA_WATCHDOG);
  908. }
  909. /*-------------------------------------------------------------------------*/
  910. static void scan_async (struct ehci_hcd *ehci)
  911. {
  912. struct ehci_qh *qh;
  913. enum ehci_timer_action action = TIMER_IO_WATCHDOG;
  914. if (!++(ehci->stamp))
  915. ehci->stamp++;
  916. timer_action_done (ehci, TIMER_ASYNC_SHRINK);
  917. rescan:
  918. qh = ehci->async->qh_next.qh;
  919. if (likely (qh != NULL)) {
  920. do {
  921. /* clean any finished work for this qh */
  922. if (!list_empty (&qh->qtd_list)
  923. && qh->stamp != ehci->stamp) {
  924. int temp;
  925. /* unlinks could happen here; completion
  926. * reporting drops the lock. rescan using
  927. * the latest schedule, but don't rescan
  928. * qhs we already finished (no looping).
  929. */
  930. qh = qh_get (qh);
  931. qh->stamp = ehci->stamp;
  932. temp = qh_completions (ehci, qh);
  933. qh_put (qh);
  934. if (temp != 0) {
  935. goto rescan;
  936. }
  937. }
  938. /* unlink idle entries, reducing HC PCI usage as well
  939. * as HCD schedule-scanning costs. delay for any qh
  940. * we just scanned, there's a not-unusual case that it
  941. * doesn't stay idle for long.
  942. * (plus, avoids some kind of re-activation race.)
  943. */
  944. if (list_empty (&qh->qtd_list)) {
  945. if (qh->stamp == ehci->stamp)
  946. action = TIMER_ASYNC_SHRINK;
  947. else if (!ehci->reclaim
  948. && qh->qh_state == QH_STATE_LINKED)
  949. start_unlink_async (ehci, qh);
  950. }
  951. qh = qh->qh_next.qh;
  952. } while (qh);
  953. }
  954. if (action == TIMER_ASYNC_SHRINK)
  955. timer_action (ehci, TIMER_ASYNC_SHRINK);
  956. }