ehci-q.c 43 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538
  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. struct ehci_qh_hw *hw = qh->hw;
  79. /* writes to an active overlay are unsafe */
  80. WARN_ON(qh->qh_state != QH_STATE_IDLE);
  81. hw->hw_qtd_next = QTD_NEXT(ehci, qtd->qtd_dma);
  82. hw->hw_alt_next = EHCI_LIST_END(ehci);
  83. /* Except for control endpoints, we make hardware maintain data
  84. * toggle (like OHCI) ... here (re)initialize the toggle in the QH,
  85. * and set the pseudo-toggle in udev. Only usb_clear_halt() will
  86. * ever clear it.
  87. */
  88. if (!(hw->hw_info1 & cpu_to_hc32(ehci, QH_TOGGLE_CTL))) {
  89. unsigned is_out, epnum;
  90. is_out = qh->is_out;
  91. epnum = (hc32_to_cpup(ehci, &hw->hw_info1) >> 8) & 0x0f;
  92. if (unlikely(!usb_gettoggle(qh->ps.udev, epnum, is_out))) {
  93. hw->hw_token &= ~cpu_to_hc32(ehci, QTD_TOGGLE);
  94. usb_settoggle(qh->ps.udev, epnum, is_out, 1);
  95. }
  96. }
  97. hw->hw_token &= cpu_to_hc32(ehci, QTD_TOGGLE | QTD_STS_PING);
  98. }
  99. /* if it weren't for a common silicon quirk (writing the dummy into the qh
  100. * overlay, so qh->hw_token wrongly becomes inactive/halted), only fault
  101. * recovery (including urb dequeue) would need software changes to a QH...
  102. */
  103. static void
  104. qh_refresh (struct ehci_hcd *ehci, struct ehci_qh *qh)
  105. {
  106. struct ehci_qtd *qtd;
  107. qtd = list_entry(qh->qtd_list.next, struct ehci_qtd, qtd_list);
  108. /*
  109. * first qtd may already be partially processed.
  110. * If we come here during unlink, the QH overlay region
  111. * might have reference to the just unlinked qtd. The
  112. * qtd is updated in qh_completions(). Update the QH
  113. * overlay here.
  114. */
  115. if (qh->hw->hw_token & ACTIVE_BIT(ehci)) {
  116. qh->hw->hw_qtd_next = qtd->hw_next;
  117. if (qh->should_be_inactive)
  118. ehci_warn(ehci, "qh %p should be inactive!\n", qh);
  119. } else {
  120. qh_update(ehci, qh, qtd);
  121. }
  122. qh->should_be_inactive = 0;
  123. }
  124. /*-------------------------------------------------------------------------*/
  125. static void qh_link_async(struct ehci_hcd *ehci, struct ehci_qh *qh);
  126. static void ehci_clear_tt_buffer_complete(struct usb_hcd *hcd,
  127. struct usb_host_endpoint *ep)
  128. {
  129. struct ehci_hcd *ehci = hcd_to_ehci(hcd);
  130. struct ehci_qh *qh = ep->hcpriv;
  131. unsigned long flags;
  132. spin_lock_irqsave(&ehci->lock, flags);
  133. qh->clearing_tt = 0;
  134. if (qh->qh_state == QH_STATE_IDLE && !list_empty(&qh->qtd_list)
  135. && ehci->rh_state == EHCI_RH_RUNNING)
  136. qh_link_async(ehci, qh);
  137. spin_unlock_irqrestore(&ehci->lock, flags);
  138. }
  139. static void ehci_clear_tt_buffer(struct ehci_hcd *ehci, struct ehci_qh *qh,
  140. struct urb *urb, u32 token)
  141. {
  142. /* If an async split transaction gets an error or is unlinked,
  143. * the TT buffer may be left in an indeterminate state. We
  144. * have to clear the TT buffer.
  145. *
  146. * Note: this routine is never called for Isochronous transfers.
  147. */
  148. if (urb->dev->tt && !usb_pipeint(urb->pipe) && !qh->clearing_tt) {
  149. #ifdef CONFIG_DYNAMIC_DEBUG
  150. struct usb_device *tt = urb->dev->tt->hub;
  151. dev_dbg(&tt->dev,
  152. "clear tt buffer port %d, a%d ep%d t%08x\n",
  153. urb->dev->ttport, urb->dev->devnum,
  154. usb_pipeendpoint(urb->pipe), token);
  155. #endif /* CONFIG_DYNAMIC_DEBUG */
  156. if (!ehci_is_TDI(ehci)
  157. || urb->dev->tt->hub !=
  158. ehci_to_hcd(ehci)->self.root_hub) {
  159. if (usb_hub_clear_tt_buffer(urb) == 0)
  160. qh->clearing_tt = 1;
  161. } else {
  162. /* REVISIT ARC-derived cores don't clear the root
  163. * hub TT buffer in this way...
  164. */
  165. }
  166. }
  167. }
  168. static int qtd_copy_status (
  169. struct ehci_hcd *ehci,
  170. struct urb *urb,
  171. size_t length,
  172. u32 token
  173. )
  174. {
  175. int status = -EINPROGRESS;
  176. /* count IN/OUT bytes, not SETUP (even short packets) */
  177. if (likely (QTD_PID (token) != 2))
  178. urb->actual_length += length - QTD_LENGTH (token);
  179. /* don't modify error codes */
  180. if (unlikely(urb->unlinked))
  181. return status;
  182. /* force cleanup after short read; not always an error */
  183. if (unlikely (IS_SHORT_READ (token)))
  184. status = -EREMOTEIO;
  185. /* serious "can't proceed" faults reported by the hardware */
  186. if (token & QTD_STS_HALT) {
  187. if (token & QTD_STS_BABBLE) {
  188. /* FIXME "must" disable babbling device's port too */
  189. status = -EOVERFLOW;
  190. /* CERR nonzero + halt --> stall */
  191. } else if (QTD_CERR(token)) {
  192. status = -EPIPE;
  193. /* In theory, more than one of the following bits can be set
  194. * since they are sticky and the transaction is retried.
  195. * Which to test first is rather arbitrary.
  196. */
  197. } else if (token & QTD_STS_MMF) {
  198. /* fs/ls interrupt xfer missed the complete-split */
  199. status = -EPROTO;
  200. } else if (token & QTD_STS_DBE) {
  201. status = (QTD_PID (token) == 1) /* IN ? */
  202. ? -ENOSR /* hc couldn't read data */
  203. : -ECOMM; /* hc couldn't write data */
  204. } else if (token & QTD_STS_XACT) {
  205. /* timeout, bad CRC, wrong PID, etc */
  206. ehci_dbg(ehci, "devpath %s ep%d%s 3strikes\n",
  207. urb->dev->devpath,
  208. usb_pipeendpoint(urb->pipe),
  209. usb_pipein(urb->pipe) ? "in" : "out");
  210. status = -EPROTO;
  211. } else { /* unknown */
  212. status = -EPROTO;
  213. }
  214. }
  215. return status;
  216. }
  217. static void
  218. ehci_urb_done(struct ehci_hcd *ehci, struct urb *urb, int status)
  219. {
  220. if (usb_pipetype(urb->pipe) == PIPE_INTERRUPT) {
  221. /* ... update hc-wide periodic stats */
  222. ehci_to_hcd(ehci)->self.bandwidth_int_reqs--;
  223. }
  224. if (unlikely(urb->unlinked)) {
  225. COUNT(ehci->stats.unlink);
  226. } else {
  227. /* report non-error and short read status as zero */
  228. if (status == -EINPROGRESS || status == -EREMOTEIO)
  229. status = 0;
  230. COUNT(ehci->stats.complete);
  231. }
  232. #ifdef EHCI_URB_TRACE
  233. ehci_dbg (ehci,
  234. "%s %s urb %p ep%d%s status %d len %d/%d\n",
  235. __func__, urb->dev->devpath, urb,
  236. usb_pipeendpoint (urb->pipe),
  237. usb_pipein (urb->pipe) ? "in" : "out",
  238. status,
  239. urb->actual_length, urb->transfer_buffer_length);
  240. #endif
  241. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  242. usb_hcd_giveback_urb(ehci_to_hcd(ehci), urb, status);
  243. }
  244. static int qh_schedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  245. /*
  246. * Process and free completed qtds for a qh, returning URBs to drivers.
  247. * Chases up to qh->hw_current. Returns nonzero if the caller should
  248. * unlink qh.
  249. */
  250. static unsigned
  251. qh_completions (struct ehci_hcd *ehci, struct ehci_qh *qh)
  252. {
  253. struct ehci_qtd *last, *end = qh->dummy;
  254. struct list_head *entry, *tmp;
  255. int last_status;
  256. int stopped;
  257. u8 state;
  258. struct ehci_qh_hw *hw = qh->hw;
  259. /* completions (or tasks on other cpus) must never clobber HALT
  260. * till we've gone through and cleaned everything up, even when
  261. * they add urbs to this qh's queue or mark them for unlinking.
  262. *
  263. * NOTE: unlinking expects to be done in queue order.
  264. *
  265. * It's a bug for qh->qh_state to be anything other than
  266. * QH_STATE_IDLE, unless our caller is scan_async() or
  267. * scan_intr().
  268. */
  269. state = qh->qh_state;
  270. qh->qh_state = QH_STATE_COMPLETING;
  271. stopped = (state == QH_STATE_IDLE);
  272. rescan:
  273. last = NULL;
  274. last_status = -EINPROGRESS;
  275. qh->dequeue_during_giveback = 0;
  276. /* remove de-activated QTDs from front of queue.
  277. * after faults (including short reads), cleanup this urb
  278. * then let the queue advance.
  279. * if queue is stopped, handles unlinks.
  280. */
  281. list_for_each_safe (entry, tmp, &qh->qtd_list) {
  282. struct ehci_qtd *qtd;
  283. struct urb *urb;
  284. u32 token = 0;
  285. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  286. urb = qtd->urb;
  287. /* clean up any state from previous QTD ...*/
  288. if (last) {
  289. if (likely (last->urb != urb)) {
  290. ehci_urb_done(ehci, last->urb, last_status);
  291. last_status = -EINPROGRESS;
  292. }
  293. ehci_qtd_free (ehci, last);
  294. last = NULL;
  295. }
  296. /* ignore urbs submitted during completions we reported */
  297. if (qtd == end)
  298. break;
  299. /* hardware copies qtd out of qh overlay */
  300. rmb ();
  301. token = hc32_to_cpu(ehci, qtd->hw_token);
  302. /* always clean up qtds the hc de-activated */
  303. retry_xacterr:
  304. if ((token & QTD_STS_ACTIVE) == 0) {
  305. /* Report Data Buffer Error: non-fatal but useful */
  306. if (token & QTD_STS_DBE)
  307. ehci_dbg(ehci,
  308. "detected DataBufferErr for urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  309. urb,
  310. usb_endpoint_num(&urb->ep->desc),
  311. usb_endpoint_dir_in(&urb->ep->desc) ? "in" : "out",
  312. urb->transfer_buffer_length,
  313. qtd,
  314. qh);
  315. /* on STALL, error, and short reads this urb must
  316. * complete and all its qtds must be recycled.
  317. */
  318. if ((token & QTD_STS_HALT) != 0) {
  319. /* retry transaction errors until we
  320. * reach the software xacterr limit
  321. */
  322. if ((token & QTD_STS_XACT) &&
  323. QTD_CERR(token) == 0 &&
  324. ++qh->xacterrs < QH_XACTERR_MAX &&
  325. !urb->unlinked) {
  326. ehci_dbg(ehci,
  327. "detected XactErr len %zu/%zu retry %d\n",
  328. qtd->length - QTD_LENGTH(token), qtd->length, qh->xacterrs);
  329. /* reset the token in the qtd and the
  330. * qh overlay (which still contains
  331. * the qtd) so that we pick up from
  332. * where we left off
  333. */
  334. token &= ~QTD_STS_HALT;
  335. token |= QTD_STS_ACTIVE |
  336. (EHCI_TUNE_CERR << 10);
  337. qtd->hw_token = cpu_to_hc32(ehci,
  338. token);
  339. wmb();
  340. hw->hw_token = cpu_to_hc32(ehci,
  341. token);
  342. goto retry_xacterr;
  343. }
  344. stopped = 1;
  345. qh->unlink_reason |= QH_UNLINK_HALTED;
  346. /* magic dummy for some short reads; qh won't advance.
  347. * that silicon quirk can kick in with this dummy too.
  348. *
  349. * other short reads won't stop the queue, including
  350. * control transfers (status stage handles that) or
  351. * most other single-qtd reads ... the queue stops if
  352. * URB_SHORT_NOT_OK was set so the driver submitting
  353. * the urbs could clean it up.
  354. */
  355. } else if (IS_SHORT_READ (token)
  356. && !(qtd->hw_alt_next
  357. & EHCI_LIST_END(ehci))) {
  358. stopped = 1;
  359. qh->unlink_reason |= QH_UNLINK_SHORT_READ;
  360. }
  361. /* stop scanning when we reach qtds the hc is using */
  362. } else if (likely (!stopped
  363. && ehci->rh_state >= EHCI_RH_RUNNING)) {
  364. break;
  365. /* scan the whole queue for unlinks whenever it stops */
  366. } else {
  367. stopped = 1;
  368. /* cancel everything if we halt, suspend, etc */
  369. if (ehci->rh_state < EHCI_RH_RUNNING) {
  370. last_status = -ESHUTDOWN;
  371. qh->unlink_reason |= QH_UNLINK_SHUTDOWN;
  372. }
  373. /* this qtd is active; skip it unless a previous qtd
  374. * for its urb faulted, or its urb was canceled.
  375. */
  376. else if (last_status == -EINPROGRESS && !urb->unlinked)
  377. continue;
  378. /*
  379. * If this was the active qtd when the qh was unlinked
  380. * and the overlay's token is active, then the overlay
  381. * hasn't been written back to the qtd yet so use its
  382. * token instead of the qtd's. After the qtd is
  383. * processed and removed, the overlay won't be valid
  384. * any more.
  385. */
  386. if (state == QH_STATE_IDLE &&
  387. qh->qtd_list.next == &qtd->qtd_list &&
  388. (hw->hw_token & ACTIVE_BIT(ehci))) {
  389. token = hc32_to_cpu(ehci, hw->hw_token);
  390. hw->hw_token &= ~ACTIVE_BIT(ehci);
  391. qh->should_be_inactive = 1;
  392. /* An unlink may leave an incomplete
  393. * async transaction in the TT buffer.
  394. * We have to clear it.
  395. */
  396. ehci_clear_tt_buffer(ehci, qh, urb, token);
  397. }
  398. }
  399. /* unless we already know the urb's status, collect qtd status
  400. * and update count of bytes transferred. in common short read
  401. * cases with only one data qtd (including control transfers),
  402. * queue processing won't halt. but with two or more qtds (for
  403. * example, with a 32 KB transfer), when the first qtd gets a
  404. * short read the second must be removed by hand.
  405. */
  406. if (last_status == -EINPROGRESS) {
  407. last_status = qtd_copy_status(ehci, urb,
  408. qtd->length, token);
  409. if (last_status == -EREMOTEIO
  410. && (qtd->hw_alt_next
  411. & EHCI_LIST_END(ehci)))
  412. last_status = -EINPROGRESS;
  413. /* As part of low/full-speed endpoint-halt processing
  414. * we must clear the TT buffer (11.17.5).
  415. */
  416. if (unlikely(last_status != -EINPROGRESS &&
  417. last_status != -EREMOTEIO)) {
  418. /* The TT's in some hubs malfunction when they
  419. * receive this request following a STALL (they
  420. * stop sending isochronous packets). Since a
  421. * STALL can't leave the TT buffer in a busy
  422. * state (if you believe Figures 11-48 - 11-51
  423. * in the USB 2.0 spec), we won't clear the TT
  424. * buffer in this case. Strictly speaking this
  425. * is a violation of the spec.
  426. */
  427. if (last_status != -EPIPE)
  428. ehci_clear_tt_buffer(ehci, qh, urb,
  429. token);
  430. }
  431. }
  432. /* if we're removing something not at the queue head,
  433. * patch the hardware queue pointer.
  434. */
  435. if (stopped && qtd->qtd_list.prev != &qh->qtd_list) {
  436. last = list_entry (qtd->qtd_list.prev,
  437. struct ehci_qtd, qtd_list);
  438. last->hw_next = qtd->hw_next;
  439. }
  440. /* remove qtd; it's recycled after possible urb completion */
  441. list_del (&qtd->qtd_list);
  442. last = qtd;
  443. /* reinit the xacterr counter for the next qtd */
  444. qh->xacterrs = 0;
  445. }
  446. /* last urb's completion might still need calling */
  447. if (likely (last != NULL)) {
  448. ehci_urb_done(ehci, last->urb, last_status);
  449. ehci_qtd_free (ehci, last);
  450. }
  451. /* Do we need to rescan for URBs dequeued during a giveback? */
  452. if (unlikely(qh->dequeue_during_giveback)) {
  453. /* If the QH is already unlinked, do the rescan now. */
  454. if (state == QH_STATE_IDLE)
  455. goto rescan;
  456. /* Otherwise the caller must unlink the QH. */
  457. }
  458. /* restore original state; caller must unlink or relink */
  459. qh->qh_state = state;
  460. /* be sure the hardware's done with the qh before refreshing
  461. * it after fault cleanup, or recovering from silicon wrongly
  462. * overlaying the dummy qtd (which reduces DMA chatter).
  463. *
  464. * We won't refresh a QH that's linked (after the HC
  465. * stopped the queue). That avoids a race:
  466. * - HC reads first part of QH;
  467. * - CPU updates that first part and the token;
  468. * - HC reads rest of that QH, including token
  469. * Result: HC gets an inconsistent image, and then
  470. * DMAs to/from the wrong memory (corrupting it).
  471. *
  472. * That should be rare for interrupt transfers,
  473. * except maybe high bandwidth ...
  474. */
  475. if (stopped != 0 || hw->hw_qtd_next == EHCI_LIST_END(ehci))
  476. qh->unlink_reason |= QH_UNLINK_DUMMY_OVERLAY;
  477. /* Let the caller know if the QH needs to be unlinked. */
  478. return qh->unlink_reason;
  479. }
  480. /*-------------------------------------------------------------------------*/
  481. // high bandwidth multiplier, as encoded in highspeed endpoint descriptors
  482. #define hb_mult(wMaxPacketSize) (1 + (((wMaxPacketSize) >> 11) & 0x03))
  483. // ... and packet size, for any kind of endpoint descriptor
  484. #define max_packet(wMaxPacketSize) ((wMaxPacketSize) & 0x07ff)
  485. /*
  486. * reverse of qh_urb_transaction: free a list of TDs.
  487. * used for cleanup after errors, before HC sees an URB's TDs.
  488. */
  489. static void qtd_list_free (
  490. struct ehci_hcd *ehci,
  491. struct urb *urb,
  492. struct list_head *qtd_list
  493. ) {
  494. struct list_head *entry, *temp;
  495. list_for_each_safe (entry, temp, qtd_list) {
  496. struct ehci_qtd *qtd;
  497. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  498. list_del (&qtd->qtd_list);
  499. ehci_qtd_free (ehci, qtd);
  500. }
  501. }
  502. /*
  503. * create a list of filled qtds for this URB; won't link into qh.
  504. */
  505. static struct list_head *
  506. qh_urb_transaction (
  507. struct ehci_hcd *ehci,
  508. struct urb *urb,
  509. struct list_head *head,
  510. gfp_t flags
  511. ) {
  512. struct ehci_qtd *qtd, *qtd_prev;
  513. dma_addr_t buf;
  514. int len, this_sg_len, maxpacket;
  515. int is_input;
  516. u32 token;
  517. int i;
  518. struct scatterlist *sg;
  519. /*
  520. * URBs map to sequences of QTDs: one logical transaction
  521. */
  522. qtd = ehci_qtd_alloc (ehci, flags);
  523. if (unlikely (!qtd))
  524. return NULL;
  525. list_add_tail (&qtd->qtd_list, head);
  526. qtd->urb = urb;
  527. token = QTD_STS_ACTIVE;
  528. token |= (EHCI_TUNE_CERR << 10);
  529. /* for split transactions, SplitXState initialized to zero */
  530. len = urb->transfer_buffer_length;
  531. is_input = usb_pipein (urb->pipe);
  532. if (usb_pipecontrol (urb->pipe)) {
  533. /* SETUP pid */
  534. qtd_fill(ehci, qtd, urb->setup_dma,
  535. sizeof (struct usb_ctrlrequest),
  536. token | (2 /* "setup" */ << 8), 8);
  537. /* ... and always at least one more pid */
  538. token ^= QTD_TOGGLE;
  539. qtd_prev = qtd;
  540. qtd = ehci_qtd_alloc (ehci, flags);
  541. if (unlikely (!qtd))
  542. goto cleanup;
  543. qtd->urb = urb;
  544. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  545. list_add_tail (&qtd->qtd_list, head);
  546. /* for zero length DATA stages, STATUS is always IN */
  547. if (len == 0)
  548. token |= (1 /* "in" */ << 8);
  549. }
  550. /*
  551. * data transfer stage: buffer setup
  552. */
  553. i = urb->num_mapped_sgs;
  554. if (len > 0 && i > 0) {
  555. sg = urb->sg;
  556. buf = sg_dma_address(sg);
  557. /* urb->transfer_buffer_length may be smaller than the
  558. * size of the scatterlist (or vice versa)
  559. */
  560. this_sg_len = min_t(int, sg_dma_len(sg), len);
  561. } else {
  562. sg = NULL;
  563. buf = urb->transfer_dma;
  564. this_sg_len = len;
  565. }
  566. if (is_input)
  567. token |= (1 /* "in" */ << 8);
  568. /* else it's already initted to "out" pid (0 << 8) */
  569. maxpacket = max_packet(usb_maxpacket(urb->dev, urb->pipe, !is_input));
  570. /*
  571. * buffer gets wrapped in one or more qtds;
  572. * last one may be "short" (including zero len)
  573. * and may serve as a control status ack
  574. */
  575. for (;;) {
  576. int this_qtd_len;
  577. this_qtd_len = qtd_fill(ehci, qtd, buf, this_sg_len, token,
  578. maxpacket);
  579. this_sg_len -= this_qtd_len;
  580. len -= this_qtd_len;
  581. buf += this_qtd_len;
  582. /*
  583. * short reads advance to a "magic" dummy instead of the next
  584. * qtd ... that forces the queue to stop, for manual cleanup.
  585. * (this will usually be overridden later.)
  586. */
  587. if (is_input)
  588. qtd->hw_alt_next = ehci->async->hw->hw_alt_next;
  589. /* qh makes control packets use qtd toggle; maybe switch it */
  590. if ((maxpacket & (this_qtd_len + (maxpacket - 1))) == 0)
  591. token ^= QTD_TOGGLE;
  592. if (likely(this_sg_len <= 0)) {
  593. if (--i <= 0 || len <= 0)
  594. break;
  595. sg = sg_next(sg);
  596. buf = sg_dma_address(sg);
  597. this_sg_len = min_t(int, sg_dma_len(sg), len);
  598. }
  599. qtd_prev = qtd;
  600. qtd = ehci_qtd_alloc (ehci, flags);
  601. if (unlikely (!qtd))
  602. goto cleanup;
  603. qtd->urb = urb;
  604. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  605. list_add_tail (&qtd->qtd_list, head);
  606. }
  607. /*
  608. * unless the caller requires manual cleanup after short reads,
  609. * have the alt_next mechanism keep the queue running after the
  610. * last data qtd (the only one, for control and most other cases).
  611. */
  612. if (likely ((urb->transfer_flags & URB_SHORT_NOT_OK) == 0
  613. || usb_pipecontrol (urb->pipe)))
  614. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  615. /*
  616. * control requests may need a terminating data "status" ack;
  617. * other OUT ones may need a terminating short packet
  618. * (zero length).
  619. */
  620. if (likely (urb->transfer_buffer_length != 0)) {
  621. int one_more = 0;
  622. if (usb_pipecontrol (urb->pipe)) {
  623. one_more = 1;
  624. token ^= 0x0100; /* "in" <--> "out" */
  625. token |= QTD_TOGGLE; /* force DATA1 */
  626. } else if (usb_pipeout(urb->pipe)
  627. && (urb->transfer_flags & URB_ZERO_PACKET)
  628. && !(urb->transfer_buffer_length % maxpacket)) {
  629. one_more = 1;
  630. }
  631. if (one_more) {
  632. qtd_prev = qtd;
  633. qtd = ehci_qtd_alloc (ehci, flags);
  634. if (unlikely (!qtd))
  635. goto cleanup;
  636. qtd->urb = urb;
  637. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  638. list_add_tail (&qtd->qtd_list, head);
  639. /* never any data in such packets */
  640. qtd_fill(ehci, qtd, 0, 0, token, 0);
  641. }
  642. }
  643. /* by default, enable interrupt on urb completion */
  644. if (likely (!(urb->transfer_flags & URB_NO_INTERRUPT)))
  645. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  646. return head;
  647. cleanup:
  648. qtd_list_free (ehci, urb, head);
  649. return NULL;
  650. }
  651. /*-------------------------------------------------------------------------*/
  652. // Would be best to create all qh's from config descriptors,
  653. // when each interface/altsetting is established. Unlink
  654. // any previous qh and cancel its urbs first; endpoints are
  655. // implicitly reset then (data toggle too).
  656. // That'd mean updating how usbcore talks to HCDs. (2.7?)
  657. /*
  658. * Each QH holds a qtd list; a QH is used for everything except iso.
  659. *
  660. * For interrupt urbs, the scheduler must set the microframe scheduling
  661. * mask(s) each time the QH gets scheduled. For highspeed, that's
  662. * just one microframe in the s-mask. For split interrupt transactions
  663. * there are additional complications: c-mask, maybe FSTNs.
  664. */
  665. static struct ehci_qh *
  666. qh_make (
  667. struct ehci_hcd *ehci,
  668. struct urb *urb,
  669. gfp_t flags
  670. ) {
  671. struct ehci_qh *qh = ehci_qh_alloc (ehci, flags);
  672. u32 info1 = 0, info2 = 0;
  673. int is_input, type;
  674. int maxp = 0;
  675. struct usb_tt *tt = urb->dev->tt;
  676. struct ehci_qh_hw *hw;
  677. if (!qh)
  678. return qh;
  679. /*
  680. * init endpoint/device data for this QH
  681. */
  682. info1 |= usb_pipeendpoint (urb->pipe) << 8;
  683. info1 |= usb_pipedevice (urb->pipe) << 0;
  684. is_input = usb_pipein (urb->pipe);
  685. type = usb_pipetype (urb->pipe);
  686. maxp = usb_maxpacket (urb->dev, urb->pipe, !is_input);
  687. /* 1024 byte maxpacket is a hardware ceiling. High bandwidth
  688. * acts like up to 3KB, but is built from smaller packets.
  689. */
  690. if (max_packet(maxp) > 1024) {
  691. ehci_dbg(ehci, "bogus qh maxpacket %d\n", max_packet(maxp));
  692. goto done;
  693. }
  694. /* Compute interrupt scheduling parameters just once, and save.
  695. * - allowing for high bandwidth, how many nsec/uframe are used?
  696. * - split transactions need a second CSPLIT uframe; same question
  697. * - splits also need a schedule gap (for full/low speed I/O)
  698. * - qh has a polling interval
  699. *
  700. * For control/bulk requests, the HC or TT handles these.
  701. */
  702. if (type == PIPE_INTERRUPT) {
  703. unsigned tmp;
  704. qh->ps.usecs = NS_TO_US(usb_calc_bus_time(USB_SPEED_HIGH,
  705. is_input, 0,
  706. hb_mult(maxp) * max_packet(maxp)));
  707. qh->ps.phase = NO_FRAME;
  708. if (urb->dev->speed == USB_SPEED_HIGH) {
  709. qh->ps.c_usecs = 0;
  710. qh->gap_uf = 0;
  711. if (urb->interval > 1 && urb->interval < 8) {
  712. /* NOTE interval 2 or 4 uframes could work.
  713. * But interval 1 scheduling is simpler, and
  714. * includes high bandwidth.
  715. */
  716. urb->interval = 1;
  717. } else if (urb->interval > ehci->periodic_size << 3) {
  718. urb->interval = ehci->periodic_size << 3;
  719. }
  720. qh->ps.period = urb->interval >> 3;
  721. /* period for bandwidth allocation */
  722. tmp = min_t(unsigned, EHCI_BANDWIDTH_SIZE,
  723. 1 << (urb->ep->desc.bInterval - 1));
  724. /* Allow urb->interval to override */
  725. qh->ps.bw_uperiod = min_t(unsigned, tmp, urb->interval);
  726. qh->ps.bw_period = qh->ps.bw_uperiod >> 3;
  727. } else {
  728. int think_time;
  729. /* gap is f(FS/LS transfer times) */
  730. qh->gap_uf = 1 + usb_calc_bus_time (urb->dev->speed,
  731. is_input, 0, maxp) / (125 * 1000);
  732. /* FIXME this just approximates SPLIT/CSPLIT times */
  733. if (is_input) { // SPLIT, gap, CSPLIT+DATA
  734. qh->ps.c_usecs = qh->ps.usecs + HS_USECS(0);
  735. qh->ps.usecs = HS_USECS(1);
  736. } else { // SPLIT+DATA, gap, CSPLIT
  737. qh->ps.usecs += HS_USECS(1);
  738. qh->ps.c_usecs = HS_USECS(0);
  739. }
  740. think_time = tt ? tt->think_time : 0;
  741. qh->ps.tt_usecs = NS_TO_US(think_time +
  742. usb_calc_bus_time (urb->dev->speed,
  743. is_input, 0, max_packet (maxp)));
  744. if (urb->interval > ehci->periodic_size)
  745. urb->interval = ehci->periodic_size;
  746. qh->ps.period = urb->interval;
  747. /* period for bandwidth allocation */
  748. tmp = min_t(unsigned, EHCI_BANDWIDTH_FRAMES,
  749. urb->ep->desc.bInterval);
  750. tmp = rounddown_pow_of_two(tmp);
  751. /* Allow urb->interval to override */
  752. qh->ps.bw_period = min_t(unsigned, tmp, urb->interval);
  753. qh->ps.bw_uperiod = qh->ps.bw_period << 3;
  754. }
  755. }
  756. /* support for tt scheduling, and access to toggles */
  757. qh->ps.udev = urb->dev;
  758. qh->ps.ep = urb->ep;
  759. /* using TT? */
  760. switch (urb->dev->speed) {
  761. case USB_SPEED_LOW:
  762. info1 |= QH_LOW_SPEED;
  763. /* FALL THROUGH */
  764. case USB_SPEED_FULL:
  765. /* EPS 0 means "full" */
  766. if (type != PIPE_INTERRUPT)
  767. info1 |= (EHCI_TUNE_RL_TT << 28);
  768. if (type == PIPE_CONTROL) {
  769. info1 |= QH_CONTROL_EP; /* for TT */
  770. info1 |= QH_TOGGLE_CTL; /* toggle from qtd */
  771. }
  772. info1 |= maxp << 16;
  773. info2 |= (EHCI_TUNE_MULT_TT << 30);
  774. /* Some Freescale processors have an erratum in which the
  775. * port number in the queue head was 0..N-1 instead of 1..N.
  776. */
  777. if (ehci_has_fsl_portno_bug(ehci))
  778. info2 |= (urb->dev->ttport-1) << 23;
  779. else
  780. info2 |= urb->dev->ttport << 23;
  781. /* set the address of the TT; for TDI's integrated
  782. * root hub tt, leave it zeroed.
  783. */
  784. if (tt && tt->hub != ehci_to_hcd(ehci)->self.root_hub)
  785. info2 |= tt->hub->devnum << 16;
  786. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets c-mask } */
  787. break;
  788. case USB_SPEED_HIGH: /* no TT involved */
  789. info1 |= QH_HIGH_SPEED;
  790. if (type == PIPE_CONTROL) {
  791. info1 |= (EHCI_TUNE_RL_HS << 28);
  792. info1 |= 64 << 16; /* usb2 fixed maxpacket */
  793. info1 |= QH_TOGGLE_CTL; /* toggle from qtd */
  794. info2 |= (EHCI_TUNE_MULT_HS << 30);
  795. } else if (type == PIPE_BULK) {
  796. info1 |= (EHCI_TUNE_RL_HS << 28);
  797. /* The USB spec says that high speed bulk endpoints
  798. * always use 512 byte maxpacket. But some device
  799. * vendors decided to ignore that, and MSFT is happy
  800. * to help them do so. So now people expect to use
  801. * such nonconformant devices with Linux too; sigh.
  802. */
  803. info1 |= max_packet(maxp) << 16;
  804. info2 |= (EHCI_TUNE_MULT_HS << 30);
  805. } else { /* PIPE_INTERRUPT */
  806. info1 |= max_packet (maxp) << 16;
  807. info2 |= hb_mult (maxp) << 30;
  808. }
  809. break;
  810. default:
  811. ehci_dbg(ehci, "bogus dev %p speed %d\n", urb->dev,
  812. urb->dev->speed);
  813. done:
  814. qh_destroy(ehci, qh);
  815. return NULL;
  816. }
  817. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets s-mask } */
  818. /* init as live, toggle clear */
  819. qh->qh_state = QH_STATE_IDLE;
  820. hw = qh->hw;
  821. hw->hw_info1 = cpu_to_hc32(ehci, info1);
  822. hw->hw_info2 = cpu_to_hc32(ehci, info2);
  823. qh->is_out = !is_input;
  824. usb_settoggle (urb->dev, usb_pipeendpoint (urb->pipe), !is_input, 1);
  825. return qh;
  826. }
  827. /*-------------------------------------------------------------------------*/
  828. static void enable_async(struct ehci_hcd *ehci)
  829. {
  830. if (ehci->async_count++)
  831. return;
  832. /* Stop waiting to turn off the async schedule */
  833. ehci->enabled_hrtimer_events &= ~BIT(EHCI_HRTIMER_DISABLE_ASYNC);
  834. /* Don't start the schedule until ASS is 0 */
  835. ehci_poll_ASS(ehci);
  836. turn_on_io_watchdog(ehci);
  837. }
  838. static void disable_async(struct ehci_hcd *ehci)
  839. {
  840. if (--ehci->async_count)
  841. return;
  842. /* The async schedule and unlink lists are supposed to be empty */
  843. WARN_ON(ehci->async->qh_next.qh || !list_empty(&ehci->async_unlink) ||
  844. !list_empty(&ehci->async_idle));
  845. /* Don't turn off the schedule until ASS is 1 */
  846. ehci_poll_ASS(ehci);
  847. }
  848. /* move qh (and its qtds) onto async queue; maybe enable queue. */
  849. static void qh_link_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  850. {
  851. __hc32 dma = QH_NEXT(ehci, qh->qh_dma);
  852. struct ehci_qh *head;
  853. /* Don't link a QH if there's a Clear-TT-Buffer pending */
  854. if (unlikely(qh->clearing_tt))
  855. return;
  856. WARN_ON(qh->qh_state != QH_STATE_IDLE);
  857. /* clear halt and/or toggle; and maybe recover from silicon quirk */
  858. qh_refresh(ehci, qh);
  859. /* splice right after start */
  860. head = ehci->async;
  861. qh->qh_next = head->qh_next;
  862. qh->hw->hw_next = head->hw->hw_next;
  863. wmb ();
  864. head->qh_next.qh = qh;
  865. head->hw->hw_next = dma;
  866. qh->qh_state = QH_STATE_LINKED;
  867. qh->xacterrs = 0;
  868. qh->unlink_reason = 0;
  869. /* qtd completions reported later by interrupt */
  870. enable_async(ehci);
  871. }
  872. /*-------------------------------------------------------------------------*/
  873. /*
  874. * For control/bulk/interrupt, return QH with these TDs appended.
  875. * Allocates and initializes the QH if necessary.
  876. * Returns null if it can't allocate a QH it needs to.
  877. * If the QH has TDs (urbs) already, that's great.
  878. */
  879. static struct ehci_qh *qh_append_tds (
  880. struct ehci_hcd *ehci,
  881. struct urb *urb,
  882. struct list_head *qtd_list,
  883. int epnum,
  884. void **ptr
  885. )
  886. {
  887. struct ehci_qh *qh = NULL;
  888. __hc32 qh_addr_mask = cpu_to_hc32(ehci, 0x7f);
  889. qh = (struct ehci_qh *) *ptr;
  890. if (unlikely (qh == NULL)) {
  891. /* can't sleep here, we have ehci->lock... */
  892. qh = qh_make (ehci, urb, GFP_ATOMIC);
  893. *ptr = qh;
  894. }
  895. if (likely (qh != NULL)) {
  896. struct ehci_qtd *qtd;
  897. if (unlikely (list_empty (qtd_list)))
  898. qtd = NULL;
  899. else
  900. qtd = list_entry (qtd_list->next, struct ehci_qtd,
  901. qtd_list);
  902. /* control qh may need patching ... */
  903. if (unlikely (epnum == 0)) {
  904. /* usb_reset_device() briefly reverts to address 0 */
  905. if (usb_pipedevice (urb->pipe) == 0)
  906. qh->hw->hw_info1 &= ~qh_addr_mask;
  907. }
  908. /* just one way to queue requests: swap with the dummy qtd.
  909. * only hc or qh_refresh() ever modify the overlay.
  910. */
  911. if (likely (qtd != NULL)) {
  912. struct ehci_qtd *dummy;
  913. dma_addr_t dma;
  914. __hc32 token;
  915. /* to avoid racing the HC, use the dummy td instead of
  916. * the first td of our list (becomes new dummy). both
  917. * tds stay deactivated until we're done, when the
  918. * HC is allowed to fetch the old dummy (4.10.2).
  919. */
  920. token = qtd->hw_token;
  921. qtd->hw_token = HALT_BIT(ehci);
  922. dummy = qh->dummy;
  923. dma = dummy->qtd_dma;
  924. *dummy = *qtd;
  925. dummy->qtd_dma = dma;
  926. list_del (&qtd->qtd_list);
  927. list_add (&dummy->qtd_list, qtd_list);
  928. list_splice_tail(qtd_list, &qh->qtd_list);
  929. ehci_qtd_init(ehci, qtd, qtd->qtd_dma);
  930. qh->dummy = qtd;
  931. /* hc must see the new dummy at list end */
  932. dma = qtd->qtd_dma;
  933. qtd = list_entry (qh->qtd_list.prev,
  934. struct ehci_qtd, qtd_list);
  935. qtd->hw_next = QTD_NEXT(ehci, dma);
  936. /* let the hc process these next qtds */
  937. wmb ();
  938. dummy->hw_token = token;
  939. urb->hcpriv = qh;
  940. }
  941. }
  942. return qh;
  943. }
  944. /*-------------------------------------------------------------------------*/
  945. static int
  946. submit_async (
  947. struct ehci_hcd *ehci,
  948. struct urb *urb,
  949. struct list_head *qtd_list,
  950. gfp_t mem_flags
  951. ) {
  952. int epnum;
  953. unsigned long flags;
  954. struct ehci_qh *qh = NULL;
  955. int rc;
  956. epnum = urb->ep->desc.bEndpointAddress;
  957. #ifdef EHCI_URB_TRACE
  958. {
  959. struct ehci_qtd *qtd;
  960. qtd = list_entry(qtd_list->next, struct ehci_qtd, qtd_list);
  961. ehci_dbg(ehci,
  962. "%s %s urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  963. __func__, urb->dev->devpath, urb,
  964. epnum & 0x0f, (epnum & USB_DIR_IN) ? "in" : "out",
  965. urb->transfer_buffer_length,
  966. qtd, urb->ep->hcpriv);
  967. }
  968. #endif
  969. spin_lock_irqsave (&ehci->lock, flags);
  970. if (unlikely(!HCD_HW_ACCESSIBLE(ehci_to_hcd(ehci)))) {
  971. rc = -ESHUTDOWN;
  972. goto done;
  973. }
  974. rc = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  975. if (unlikely(rc))
  976. goto done;
  977. qh = qh_append_tds(ehci, urb, qtd_list, epnum, &urb->ep->hcpriv);
  978. if (unlikely(qh == NULL)) {
  979. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  980. rc = -ENOMEM;
  981. goto done;
  982. }
  983. /* Control/bulk operations through TTs don't need scheduling,
  984. * the HC and TT handle it when the TT has a buffer ready.
  985. */
  986. if (likely (qh->qh_state == QH_STATE_IDLE))
  987. qh_link_async(ehci, qh);
  988. done:
  989. spin_unlock_irqrestore (&ehci->lock, flags);
  990. if (unlikely (qh == NULL))
  991. qtd_list_free (ehci, urb, qtd_list);
  992. return rc;
  993. }
  994. /*-------------------------------------------------------------------------*/
  995. #ifdef CONFIG_USB_HCD_TEST_MODE
  996. /*
  997. * This function creates the qtds and submits them for the
  998. * SINGLE_STEP_SET_FEATURE Test.
  999. * This is done in two parts: first SETUP req for GetDesc is sent then
  1000. * 15 seconds later, the IN stage for GetDesc starts to req data from dev
  1001. *
  1002. * is_setup : i/p arguement decides which of the two stage needs to be
  1003. * performed; TRUE - SETUP and FALSE - IN+STATUS
  1004. * Returns 0 if success
  1005. */
  1006. static int submit_single_step_set_feature(
  1007. struct usb_hcd *hcd,
  1008. struct urb *urb,
  1009. int is_setup
  1010. ) {
  1011. struct ehci_hcd *ehci = hcd_to_ehci(hcd);
  1012. struct list_head qtd_list;
  1013. struct list_head *head;
  1014. struct ehci_qtd *qtd, *qtd_prev;
  1015. dma_addr_t buf;
  1016. int len, maxpacket;
  1017. u32 token;
  1018. INIT_LIST_HEAD(&qtd_list);
  1019. head = &qtd_list;
  1020. /* URBs map to sequences of QTDs: one logical transaction */
  1021. qtd = ehci_qtd_alloc(ehci, GFP_KERNEL);
  1022. if (unlikely(!qtd))
  1023. return -1;
  1024. list_add_tail(&qtd->qtd_list, head);
  1025. qtd->urb = urb;
  1026. token = QTD_STS_ACTIVE;
  1027. token |= (EHCI_TUNE_CERR << 10);
  1028. len = urb->transfer_buffer_length;
  1029. /*
  1030. * Check if the request is to perform just the SETUP stage (getDesc)
  1031. * as in SINGLE_STEP_SET_FEATURE test, DATA stage (IN) happens
  1032. * 15 secs after the setup
  1033. */
  1034. if (is_setup) {
  1035. /* SETUP pid */
  1036. qtd_fill(ehci, qtd, urb->setup_dma,
  1037. sizeof(struct usb_ctrlrequest),
  1038. token | (2 /* "setup" */ << 8), 8);
  1039. submit_async(ehci, urb, &qtd_list, GFP_ATOMIC);
  1040. return 0; /*Return now; we shall come back after 15 seconds*/
  1041. }
  1042. /*
  1043. * IN: data transfer stage: buffer setup : start the IN txn phase for
  1044. * the get_Desc SETUP which was sent 15seconds back
  1045. */
  1046. token ^= QTD_TOGGLE; /*We need to start IN with DATA-1 Pid-sequence*/
  1047. buf = urb->transfer_dma;
  1048. token |= (1 /* "in" */ << 8); /*This is IN stage*/
  1049. maxpacket = max_packet(usb_maxpacket(urb->dev, urb->pipe, 0));
  1050. qtd_fill(ehci, qtd, buf, len, token, maxpacket);
  1051. /*
  1052. * Our IN phase shall always be a short read; so keep the queue running
  1053. * and let it advance to the next qtd which zero length OUT status
  1054. */
  1055. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  1056. /* STATUS stage for GetDesc control request */
  1057. token ^= 0x0100; /* "in" <--> "out" */
  1058. token |= QTD_TOGGLE; /* force DATA1 */
  1059. qtd_prev = qtd;
  1060. qtd = ehci_qtd_alloc(ehci, GFP_ATOMIC);
  1061. if (unlikely(!qtd))
  1062. goto cleanup;
  1063. qtd->urb = urb;
  1064. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  1065. list_add_tail(&qtd->qtd_list, head);
  1066. /* dont fill any data in such packets */
  1067. qtd_fill(ehci, qtd, 0, 0, token, 0);
  1068. /* by default, enable interrupt on urb completion */
  1069. if (likely(!(urb->transfer_flags & URB_NO_INTERRUPT)))
  1070. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  1071. submit_async(ehci, urb, &qtd_list, GFP_KERNEL);
  1072. return 0;
  1073. cleanup:
  1074. qtd_list_free(ehci, urb, head);
  1075. return -1;
  1076. }
  1077. #endif /* CONFIG_USB_HCD_TEST_MODE */
  1078. /*-------------------------------------------------------------------------*/
  1079. static void single_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh)
  1080. {
  1081. struct ehci_qh *prev;
  1082. /* Add to the end of the list of QHs waiting for the next IAAD */
  1083. qh->qh_state = QH_STATE_UNLINK_WAIT;
  1084. list_add_tail(&qh->unlink_node, &ehci->async_unlink);
  1085. /* Unlink it from the schedule */
  1086. prev = ehci->async;
  1087. while (prev->qh_next.qh != qh)
  1088. prev = prev->qh_next.qh;
  1089. prev->hw->hw_next = qh->hw->hw_next;
  1090. prev->qh_next = qh->qh_next;
  1091. if (ehci->qh_scan_next == qh)
  1092. ehci->qh_scan_next = qh->qh_next.qh;
  1093. }
  1094. static void start_iaa_cycle(struct ehci_hcd *ehci)
  1095. {
  1096. /* If the controller isn't running, we don't have to wait for it */
  1097. if (unlikely(ehci->rh_state < EHCI_RH_RUNNING)) {
  1098. end_unlink_async(ehci);
  1099. /* Otherwise start a new IAA cycle if one isn't already running */
  1100. } else if (ehci->rh_state == EHCI_RH_RUNNING &&
  1101. !ehci->iaa_in_progress) {
  1102. /* Make sure the unlinks are all visible to the hardware */
  1103. wmb();
  1104. ehci_writel(ehci, ehci->command | CMD_IAAD,
  1105. &ehci->regs->command);
  1106. ehci_readl(ehci, &ehci->regs->command);
  1107. ehci->iaa_in_progress = true;
  1108. ehci_enable_event(ehci, EHCI_HRTIMER_IAA_WATCHDOG, true);
  1109. }
  1110. }
  1111. static void end_iaa_cycle(struct ehci_hcd *ehci)
  1112. {
  1113. if (ehci->has_synopsys_hc_bug)
  1114. ehci_writel(ehci, (u32) ehci->async->qh_dma,
  1115. &ehci->regs->async_next);
  1116. /* The current IAA cycle has ended */
  1117. ehci->iaa_in_progress = false;
  1118. end_unlink_async(ehci);
  1119. }
  1120. /* See if the async qh for the qtds being unlinked are now gone from the HC */
  1121. static void end_unlink_async(struct ehci_hcd *ehci)
  1122. {
  1123. struct ehci_qh *qh;
  1124. bool early_exit;
  1125. if (list_empty(&ehci->async_unlink))
  1126. return;
  1127. qh = list_first_entry(&ehci->async_unlink, struct ehci_qh,
  1128. unlink_node); /* QH whose IAA cycle just ended */
  1129. /*
  1130. * If async_unlinking is set then this routine is already running,
  1131. * either on the stack or on another CPU.
  1132. */
  1133. early_exit = ehci->async_unlinking;
  1134. /* If the controller isn't running, process all the waiting QHs */
  1135. if (ehci->rh_state < EHCI_RH_RUNNING)
  1136. list_splice_tail_init(&ehci->async_unlink, &ehci->async_idle);
  1137. /*
  1138. * Intel (?) bug: The HC can write back the overlay region even
  1139. * after the IAA interrupt occurs. In self-defense, always go
  1140. * through two IAA cycles for each QH.
  1141. */
  1142. else if (qh->qh_state == QH_STATE_UNLINK) {
  1143. /*
  1144. * Second IAA cycle has finished. Process only the first
  1145. * waiting QH (NVIDIA (?) bug).
  1146. */
  1147. list_move_tail(&qh->unlink_node, &ehci->async_idle);
  1148. }
  1149. /*
  1150. * AMD/ATI (?) bug: The HC can continue to use an active QH long
  1151. * after the IAA interrupt occurs. To prevent problems, QHs that
  1152. * may still be active will wait until 2 ms have passed with no
  1153. * change to the hw_current and hw_token fields (this delay occurs
  1154. * between the two IAA cycles).
  1155. *
  1156. * The EHCI spec (4.8.2) says that active QHs must not be removed
  1157. * from the async schedule and recommends waiting until the QH
  1158. * goes inactive. This is ridiculous because the QH will _never_
  1159. * become inactive if the endpoint NAKs indefinitely.
  1160. */
  1161. /* Some reasons for unlinking guarantee the QH can't be active */
  1162. else if (qh->unlink_reason & (QH_UNLINK_HALTED |
  1163. QH_UNLINK_SHORT_READ | QH_UNLINK_DUMMY_OVERLAY))
  1164. goto DelayDone;
  1165. /* The QH can't be active if the queue was and still is empty... */
  1166. else if ((qh->unlink_reason & QH_UNLINK_QUEUE_EMPTY) &&
  1167. list_empty(&qh->qtd_list))
  1168. goto DelayDone;
  1169. /* ... or if the QH has halted */
  1170. else if (qh->hw->hw_token & cpu_to_hc32(ehci, QTD_STS_HALT))
  1171. goto DelayDone;
  1172. /* Otherwise we have to wait until the QH stops changing */
  1173. else {
  1174. __hc32 qh_current, qh_token;
  1175. qh_current = qh->hw->hw_current;
  1176. qh_token = qh->hw->hw_token;
  1177. if (qh_current != ehci->old_current ||
  1178. qh_token != ehci->old_token) {
  1179. ehci->old_current = qh_current;
  1180. ehci->old_token = qh_token;
  1181. ehci_enable_event(ehci,
  1182. EHCI_HRTIMER_ACTIVE_UNLINK, true);
  1183. return;
  1184. }
  1185. DelayDone:
  1186. qh->qh_state = QH_STATE_UNLINK;
  1187. early_exit = true;
  1188. }
  1189. ehci->old_current = ~0; /* Prepare for next QH */
  1190. /* Start a new IAA cycle if any QHs are waiting for it */
  1191. if (!list_empty(&ehci->async_unlink))
  1192. start_iaa_cycle(ehci);
  1193. /*
  1194. * Don't allow nesting or concurrent calls,
  1195. * or wait for the second IAA cycle for the next QH.
  1196. */
  1197. if (early_exit)
  1198. return;
  1199. /* Process the idle QHs */
  1200. ehci->async_unlinking = true;
  1201. while (!list_empty(&ehci->async_idle)) {
  1202. qh = list_first_entry(&ehci->async_idle, struct ehci_qh,
  1203. unlink_node);
  1204. list_del(&qh->unlink_node);
  1205. qh->qh_state = QH_STATE_IDLE;
  1206. qh->qh_next.qh = NULL;
  1207. if (!list_empty(&qh->qtd_list))
  1208. qh_completions(ehci, qh);
  1209. if (!list_empty(&qh->qtd_list) &&
  1210. ehci->rh_state == EHCI_RH_RUNNING)
  1211. qh_link_async(ehci, qh);
  1212. disable_async(ehci);
  1213. }
  1214. ehci->async_unlinking = false;
  1215. }
  1216. static void start_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh);
  1217. static void unlink_empty_async(struct ehci_hcd *ehci)
  1218. {
  1219. struct ehci_qh *qh;
  1220. struct ehci_qh *qh_to_unlink = NULL;
  1221. int count = 0;
  1222. /* Find the last async QH which has been empty for a timer cycle */
  1223. for (qh = ehci->async->qh_next.qh; qh; qh = qh->qh_next.qh) {
  1224. if (list_empty(&qh->qtd_list) &&
  1225. qh->qh_state == QH_STATE_LINKED) {
  1226. ++count;
  1227. if (qh->unlink_cycle != ehci->async_unlink_cycle)
  1228. qh_to_unlink = qh;
  1229. }
  1230. }
  1231. /* If nothing else is being unlinked, unlink the last empty QH */
  1232. if (list_empty(&ehci->async_unlink) && qh_to_unlink) {
  1233. qh_to_unlink->unlink_reason |= QH_UNLINK_QUEUE_EMPTY;
  1234. start_unlink_async(ehci, qh_to_unlink);
  1235. --count;
  1236. }
  1237. /* Other QHs will be handled later */
  1238. if (count > 0) {
  1239. ehci_enable_event(ehci, EHCI_HRTIMER_ASYNC_UNLINKS, true);
  1240. ++ehci->async_unlink_cycle;
  1241. }
  1242. }
  1243. #ifdef CONFIG_PM
  1244. /* The root hub is suspended; unlink all the async QHs */
  1245. static void unlink_empty_async_suspended(struct ehci_hcd *ehci)
  1246. {
  1247. struct ehci_qh *qh;
  1248. while (ehci->async->qh_next.qh) {
  1249. qh = ehci->async->qh_next.qh;
  1250. WARN_ON(!list_empty(&qh->qtd_list));
  1251. single_unlink_async(ehci, qh);
  1252. }
  1253. }
  1254. #endif
  1255. /* makes sure the async qh will become idle */
  1256. /* caller must own ehci->lock */
  1257. static void start_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh)
  1258. {
  1259. /* If the QH isn't linked then there's nothing we can do. */
  1260. if (qh->qh_state != QH_STATE_LINKED)
  1261. return;
  1262. single_unlink_async(ehci, qh);
  1263. start_iaa_cycle(ehci);
  1264. }
  1265. /*-------------------------------------------------------------------------*/
  1266. static void scan_async (struct ehci_hcd *ehci)
  1267. {
  1268. struct ehci_qh *qh;
  1269. bool check_unlinks_later = false;
  1270. ehci->qh_scan_next = ehci->async->qh_next.qh;
  1271. while (ehci->qh_scan_next) {
  1272. qh = ehci->qh_scan_next;
  1273. ehci->qh_scan_next = qh->qh_next.qh;
  1274. /* clean any finished work for this qh */
  1275. if (!list_empty(&qh->qtd_list)) {
  1276. int temp;
  1277. /*
  1278. * Unlinks could happen here; completion reporting
  1279. * drops the lock. That's why ehci->qh_scan_next
  1280. * always holds the next qh to scan; if the next qh
  1281. * gets unlinked then ehci->qh_scan_next is adjusted
  1282. * in single_unlink_async().
  1283. */
  1284. temp = qh_completions(ehci, qh);
  1285. if (unlikely(temp)) {
  1286. start_unlink_async(ehci, qh);
  1287. } else if (list_empty(&qh->qtd_list)
  1288. && qh->qh_state == QH_STATE_LINKED) {
  1289. qh->unlink_cycle = ehci->async_unlink_cycle;
  1290. check_unlinks_later = true;
  1291. }
  1292. }
  1293. }
  1294. /*
  1295. * Unlink empty entries, reducing DMA usage as well
  1296. * as HCD schedule-scanning costs. Delay for any qh
  1297. * we just scanned, there's a not-unusual case that it
  1298. * doesn't stay idle for long.
  1299. */
  1300. if (check_unlinks_later && ehci->rh_state == EHCI_RH_RUNNING &&
  1301. !(ehci->enabled_hrtimer_events &
  1302. BIT(EHCI_HRTIMER_ASYNC_UNLINKS))) {
  1303. ehci_enable_event(ehci, EHCI_HRTIMER_ASYNC_UNLINKS, true);
  1304. ++ehci->async_unlink_cycle;
  1305. }
  1306. }