ehci-sched.c 61 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329
  1. /*
  2. * Copyright (c) 2001-2004 by David Brownell
  3. * Copyright (c) 2003 Michal Sojka, for high-speed iso transfers
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms of the GNU General Public License as published by the
  7. * Free Software Foundation; either version 2 of the License, or (at your
  8. * option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  12. * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
  13. * for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software Foundation,
  17. * Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  18. */
  19. /* this file is part of ehci-hcd.c */
  20. /*-------------------------------------------------------------------------*/
  21. /*
  22. * EHCI scheduled transaction support: interrupt, iso, split iso
  23. * These are called "periodic" transactions in the EHCI spec.
  24. *
  25. * Note that for interrupt transfers, the QH/QTD manipulation is shared
  26. * with the "asynchronous" transaction support (control/bulk transfers).
  27. * The only real difference is in how interrupt transfers are scheduled.
  28. *
  29. * For ISO, we make an "iso_stream" head to serve the same role as a QH.
  30. * It keeps track of every ITD (or SITD) that's linked, and holds enough
  31. * pre-calculated schedule data to make appending to the queue be quick.
  32. */
  33. static int ehci_get_frame (struct usb_hcd *hcd);
  34. /*-------------------------------------------------------------------------*/
  35. /*
  36. * periodic_next_shadow - return "next" pointer on shadow list
  37. * @periodic: host pointer to qh/itd/sitd
  38. * @tag: hardware tag for type of this record
  39. */
  40. static union ehci_shadow *
  41. periodic_next_shadow(struct ehci_hcd *ehci, union ehci_shadow *periodic,
  42. __hc32 tag)
  43. {
  44. switch (hc32_to_cpu(ehci, tag)) {
  45. case Q_TYPE_QH:
  46. return &periodic->qh->qh_next;
  47. case Q_TYPE_FSTN:
  48. return &periodic->fstn->fstn_next;
  49. case Q_TYPE_ITD:
  50. return &periodic->itd->itd_next;
  51. // case Q_TYPE_SITD:
  52. default:
  53. return &periodic->sitd->sitd_next;
  54. }
  55. }
  56. /* caller must hold ehci->lock */
  57. static void periodic_unlink (struct ehci_hcd *ehci, unsigned frame, void *ptr)
  58. {
  59. union ehci_shadow *prev_p = &ehci->pshadow[frame];
  60. __hc32 *hw_p = &ehci->periodic[frame];
  61. union ehci_shadow here = *prev_p;
  62. /* find predecessor of "ptr"; hw and shadow lists are in sync */
  63. while (here.ptr && here.ptr != ptr) {
  64. prev_p = periodic_next_shadow(ehci, prev_p,
  65. Q_NEXT_TYPE(ehci, *hw_p));
  66. hw_p = here.hw_next;
  67. here = *prev_p;
  68. }
  69. /* an interrupt entry (at list end) could have been shared */
  70. if (!here.ptr)
  71. return;
  72. /* update shadow and hardware lists ... the old "next" pointers
  73. * from ptr may still be in use, the caller updates them.
  74. */
  75. *prev_p = *periodic_next_shadow(ehci, &here,
  76. Q_NEXT_TYPE(ehci, *hw_p));
  77. *hw_p = *here.hw_next;
  78. }
  79. /* how many of the uframe's 125 usecs are allocated? */
  80. static unsigned short
  81. periodic_usecs (struct ehci_hcd *ehci, unsigned frame, unsigned uframe)
  82. {
  83. __hc32 *hw_p = &ehci->periodic [frame];
  84. union ehci_shadow *q = &ehci->pshadow [frame];
  85. unsigned usecs = 0;
  86. while (q->ptr) {
  87. switch (hc32_to_cpu(ehci, Q_NEXT_TYPE(ehci, *hw_p))) {
  88. case Q_TYPE_QH:
  89. /* is it in the S-mask? */
  90. if (q->qh->hw_info2 & cpu_to_hc32(ehci, 1 << uframe))
  91. usecs += q->qh->usecs;
  92. /* ... or C-mask? */
  93. if (q->qh->hw_info2 & cpu_to_hc32(ehci,
  94. 1 << (8 + uframe)))
  95. usecs += q->qh->c_usecs;
  96. hw_p = &q->qh->hw_next;
  97. q = &q->qh->qh_next;
  98. break;
  99. // case Q_TYPE_FSTN:
  100. default:
  101. /* for "save place" FSTNs, count the relevant INTR
  102. * bandwidth from the previous frame
  103. */
  104. if (q->fstn->hw_prev != EHCI_LIST_END(ehci)) {
  105. ehci_dbg (ehci, "ignoring FSTN cost ...\n");
  106. }
  107. hw_p = &q->fstn->hw_next;
  108. q = &q->fstn->fstn_next;
  109. break;
  110. case Q_TYPE_ITD:
  111. if (q->itd->hw_transaction[uframe])
  112. usecs += q->itd->stream->usecs;
  113. hw_p = &q->itd->hw_next;
  114. q = &q->itd->itd_next;
  115. break;
  116. case Q_TYPE_SITD:
  117. /* is it in the S-mask? (count SPLIT, DATA) */
  118. if (q->sitd->hw_uframe & cpu_to_hc32(ehci,
  119. 1 << uframe)) {
  120. if (q->sitd->hw_fullspeed_ep &
  121. cpu_to_hc32(ehci, 1<<31))
  122. usecs += q->sitd->stream->usecs;
  123. else /* worst case for OUT start-split */
  124. usecs += HS_USECS_ISO (188);
  125. }
  126. /* ... C-mask? (count CSPLIT, DATA) */
  127. if (q->sitd->hw_uframe &
  128. cpu_to_hc32(ehci, 1 << (8 + uframe))) {
  129. /* worst case for IN complete-split */
  130. usecs += q->sitd->stream->c_usecs;
  131. }
  132. hw_p = &q->sitd->hw_next;
  133. q = &q->sitd->sitd_next;
  134. break;
  135. }
  136. }
  137. #ifdef DEBUG
  138. if (usecs > 100)
  139. ehci_err (ehci, "uframe %d sched overrun: %d usecs\n",
  140. frame * 8 + uframe, usecs);
  141. #endif
  142. return usecs;
  143. }
  144. /*-------------------------------------------------------------------------*/
  145. static int same_tt (struct usb_device *dev1, struct usb_device *dev2)
  146. {
  147. if (!dev1->tt || !dev2->tt)
  148. return 0;
  149. if (dev1->tt != dev2->tt)
  150. return 0;
  151. if (dev1->tt->multi)
  152. return dev1->ttport == dev2->ttport;
  153. else
  154. return 1;
  155. }
  156. #ifdef CONFIG_USB_EHCI_TT_NEWSCHED
  157. /* Which uframe does the low/fullspeed transfer start in?
  158. *
  159. * The parameter is the mask of ssplits in "H-frame" terms
  160. * and this returns the transfer start uframe in "B-frame" terms,
  161. * which allows both to match, e.g. a ssplit in "H-frame" uframe 0
  162. * will cause a transfer in "B-frame" uframe 0. "B-frames" lag
  163. * "H-frames" by 1 uframe. See the EHCI spec sec 4.5 and figure 4.7.
  164. */
  165. static inline unsigned char tt_start_uframe(struct ehci_hcd *ehci, __hc32 mask)
  166. {
  167. unsigned char smask = QH_SMASK & hc32_to_cpu(ehci, mask);
  168. if (!smask) {
  169. ehci_err(ehci, "invalid empty smask!\n");
  170. /* uframe 7 can't have bw so this will indicate failure */
  171. return 7;
  172. }
  173. return ffs(smask) - 1;
  174. }
  175. static const unsigned char
  176. max_tt_usecs[] = { 125, 125, 125, 125, 125, 125, 30, 0 };
  177. /* carryover low/fullspeed bandwidth that crosses uframe boundries */
  178. static inline void carryover_tt_bandwidth(unsigned short tt_usecs[8])
  179. {
  180. int i;
  181. for (i=0; i<7; i++) {
  182. if (max_tt_usecs[i] < tt_usecs[i]) {
  183. tt_usecs[i+1] += tt_usecs[i] - max_tt_usecs[i];
  184. tt_usecs[i] = max_tt_usecs[i];
  185. }
  186. }
  187. }
  188. /* How many of the tt's periodic downstream 1000 usecs are allocated?
  189. *
  190. * While this measures the bandwidth in terms of usecs/uframe,
  191. * the low/fullspeed bus has no notion of uframes, so any particular
  192. * low/fullspeed transfer can "carry over" from one uframe to the next,
  193. * since the TT just performs downstream transfers in sequence.
  194. *
  195. * For example two separate 100 usec transfers can start in the same uframe,
  196. * and the second one would "carry over" 75 usecs into the next uframe.
  197. */
  198. static void
  199. periodic_tt_usecs (
  200. struct ehci_hcd *ehci,
  201. struct usb_device *dev,
  202. unsigned frame,
  203. unsigned short tt_usecs[8]
  204. )
  205. {
  206. __hc32 *hw_p = &ehci->periodic [frame];
  207. union ehci_shadow *q = &ehci->pshadow [frame];
  208. unsigned char uf;
  209. memset(tt_usecs, 0, 16);
  210. while (q->ptr) {
  211. switch (hc32_to_cpu(ehci, Q_NEXT_TYPE(ehci, *hw_p))) {
  212. case Q_TYPE_ITD:
  213. hw_p = &q->itd->hw_next;
  214. q = &q->itd->itd_next;
  215. continue;
  216. case Q_TYPE_QH:
  217. if (same_tt(dev, q->qh->dev)) {
  218. uf = tt_start_uframe(ehci, q->qh->hw_info2);
  219. tt_usecs[uf] += q->qh->tt_usecs;
  220. }
  221. hw_p = &q->qh->hw_next;
  222. q = &q->qh->qh_next;
  223. continue;
  224. case Q_TYPE_SITD:
  225. if (same_tt(dev, q->sitd->urb->dev)) {
  226. uf = tt_start_uframe(ehci, q->sitd->hw_uframe);
  227. tt_usecs[uf] += q->sitd->stream->tt_usecs;
  228. }
  229. hw_p = &q->sitd->hw_next;
  230. q = &q->sitd->sitd_next;
  231. continue;
  232. // case Q_TYPE_FSTN:
  233. default:
  234. ehci_dbg(ehci, "ignoring periodic frame %d FSTN\n",
  235. frame);
  236. hw_p = &q->fstn->hw_next;
  237. q = &q->fstn->fstn_next;
  238. }
  239. }
  240. carryover_tt_bandwidth(tt_usecs);
  241. if (max_tt_usecs[7] < tt_usecs[7])
  242. ehci_err(ehci, "frame %d tt sched overrun: %d usecs\n",
  243. frame, tt_usecs[7] - max_tt_usecs[7]);
  244. }
  245. /*
  246. * Return true if the device's tt's downstream bus is available for a
  247. * periodic transfer of the specified length (usecs), starting at the
  248. * specified frame/uframe. Note that (as summarized in section 11.19
  249. * of the usb 2.0 spec) TTs can buffer multiple transactions for each
  250. * uframe.
  251. *
  252. * The uframe parameter is when the fullspeed/lowspeed transfer
  253. * should be executed in "B-frame" terms, which is the same as the
  254. * highspeed ssplit's uframe (which is in "H-frame" terms). For example
  255. * a ssplit in "H-frame" 0 causes a transfer in "B-frame" 0.
  256. * See the EHCI spec sec 4.5 and fig 4.7.
  257. *
  258. * This checks if the full/lowspeed bus, at the specified starting uframe,
  259. * has the specified bandwidth available, according to rules listed
  260. * in USB 2.0 spec section 11.18.1 fig 11-60.
  261. *
  262. * This does not check if the transfer would exceed the max ssplit
  263. * limit of 16, specified in USB 2.0 spec section 11.18.4 requirement #4,
  264. * since proper scheduling limits ssplits to less than 16 per uframe.
  265. */
  266. static int tt_available (
  267. struct ehci_hcd *ehci,
  268. unsigned period,
  269. struct usb_device *dev,
  270. unsigned frame,
  271. unsigned uframe,
  272. u16 usecs
  273. )
  274. {
  275. if ((period == 0) || (uframe >= 7)) /* error */
  276. return 0;
  277. for (; frame < ehci->periodic_size; frame += period) {
  278. unsigned short tt_usecs[8];
  279. periodic_tt_usecs (ehci, dev, frame, tt_usecs);
  280. ehci_vdbg(ehci, "tt frame %d check %d usecs start uframe %d in"
  281. " schedule %d/%d/%d/%d/%d/%d/%d/%d\n",
  282. frame, usecs, uframe,
  283. tt_usecs[0], tt_usecs[1], tt_usecs[2], tt_usecs[3],
  284. tt_usecs[4], tt_usecs[5], tt_usecs[6], tt_usecs[7]);
  285. if (max_tt_usecs[uframe] <= tt_usecs[uframe]) {
  286. ehci_vdbg(ehci, "frame %d uframe %d fully scheduled\n",
  287. frame, uframe);
  288. return 0;
  289. }
  290. /* special case for isoc transfers larger than 125us:
  291. * the first and each subsequent fully used uframe
  292. * must be empty, so as to not illegally delay
  293. * already scheduled transactions
  294. */
  295. if (125 < usecs) {
  296. int ufs = (usecs / 125);
  297. int i;
  298. for (i = uframe; i < (uframe + ufs) && i < 8; i++)
  299. if (0 < tt_usecs[i]) {
  300. ehci_vdbg(ehci,
  301. "multi-uframe xfer can't fit "
  302. "in frame %d uframe %d\n",
  303. frame, i);
  304. return 0;
  305. }
  306. }
  307. tt_usecs[uframe] += usecs;
  308. carryover_tt_bandwidth(tt_usecs);
  309. /* fail if the carryover pushed bw past the last uframe's limit */
  310. if (max_tt_usecs[7] < tt_usecs[7]) {
  311. ehci_vdbg(ehci,
  312. "tt unavailable usecs %d frame %d uframe %d\n",
  313. usecs, frame, uframe);
  314. return 0;
  315. }
  316. }
  317. return 1;
  318. }
  319. #else
  320. /* return true iff the device's transaction translator is available
  321. * for a periodic transfer starting at the specified frame, using
  322. * all the uframes in the mask.
  323. */
  324. static int tt_no_collision (
  325. struct ehci_hcd *ehci,
  326. unsigned period,
  327. struct usb_device *dev,
  328. unsigned frame,
  329. u32 uf_mask
  330. )
  331. {
  332. if (period == 0) /* error */
  333. return 0;
  334. /* note bandwidth wastage: split never follows csplit
  335. * (different dev or endpoint) until the next uframe.
  336. * calling convention doesn't make that distinction.
  337. */
  338. for (; frame < ehci->periodic_size; frame += period) {
  339. union ehci_shadow here;
  340. __hc32 type;
  341. here = ehci->pshadow [frame];
  342. type = Q_NEXT_TYPE(ehci, ehci->periodic [frame]);
  343. while (here.ptr) {
  344. switch (hc32_to_cpu(ehci, type)) {
  345. case Q_TYPE_ITD:
  346. type = Q_NEXT_TYPE(ehci, here.itd->hw_next);
  347. here = here.itd->itd_next;
  348. continue;
  349. case Q_TYPE_QH:
  350. if (same_tt (dev, here.qh->dev)) {
  351. u32 mask;
  352. mask = hc32_to_cpu(ehci,
  353. here.qh->hw_info2);
  354. /* "knows" no gap is needed */
  355. mask |= mask >> 8;
  356. if (mask & uf_mask)
  357. break;
  358. }
  359. type = Q_NEXT_TYPE(ehci, here.qh->hw_next);
  360. here = here.qh->qh_next;
  361. continue;
  362. case Q_TYPE_SITD:
  363. if (same_tt (dev, here.sitd->urb->dev)) {
  364. u16 mask;
  365. mask = hc32_to_cpu(ehci, here.sitd
  366. ->hw_uframe);
  367. /* FIXME assumes no gap for IN! */
  368. mask |= mask >> 8;
  369. if (mask & uf_mask)
  370. break;
  371. }
  372. type = Q_NEXT_TYPE(ehci, here.sitd->hw_next);
  373. here = here.sitd->sitd_next;
  374. continue;
  375. // case Q_TYPE_FSTN:
  376. default:
  377. ehci_dbg (ehci,
  378. "periodic frame %d bogus type %d\n",
  379. frame, type);
  380. }
  381. /* collision or error */
  382. return 0;
  383. }
  384. }
  385. /* no collision */
  386. return 1;
  387. }
  388. #endif /* CONFIG_USB_EHCI_TT_NEWSCHED */
  389. /*-------------------------------------------------------------------------*/
  390. static int enable_periodic (struct ehci_hcd *ehci)
  391. {
  392. u32 cmd;
  393. int status;
  394. if (ehci->periodic_sched++)
  395. return 0;
  396. /* did clearing PSE did take effect yet?
  397. * takes effect only at frame boundaries...
  398. */
  399. status = handshake_on_error_set_halt(ehci, &ehci->regs->status,
  400. STS_PSS, 0, 9 * 125);
  401. if (status)
  402. return status;
  403. cmd = ehci_readl(ehci, &ehci->regs->command) | CMD_PSE;
  404. ehci_writel(ehci, cmd, &ehci->regs->command);
  405. /* posted write ... PSS happens later */
  406. ehci_to_hcd(ehci)->state = HC_STATE_RUNNING;
  407. /* make sure ehci_work scans these */
  408. ehci->next_uframe = ehci_readl(ehci, &ehci->regs->frame_index)
  409. % (ehci->periodic_size << 3);
  410. return 0;
  411. }
  412. static int disable_periodic (struct ehci_hcd *ehci)
  413. {
  414. u32 cmd;
  415. int status;
  416. if (--ehci->periodic_sched)
  417. return 0;
  418. /* did setting PSE not take effect yet?
  419. * takes effect only at frame boundaries...
  420. */
  421. status = handshake_on_error_set_halt(ehci, &ehci->regs->status,
  422. STS_PSS, STS_PSS, 9 * 125);
  423. if (status)
  424. return status;
  425. cmd = ehci_readl(ehci, &ehci->regs->command) & ~CMD_PSE;
  426. ehci_writel(ehci, cmd, &ehci->regs->command);
  427. /* posted write ... */
  428. ehci->next_uframe = -1;
  429. return 0;
  430. }
  431. /*-------------------------------------------------------------------------*/
  432. /* periodic schedule slots have iso tds (normal or split) first, then a
  433. * sparse tree for active interrupt transfers.
  434. *
  435. * this just links in a qh; caller guarantees uframe masks are set right.
  436. * no FSTN support (yet; ehci 0.96+)
  437. */
  438. static int qh_link_periodic (struct ehci_hcd *ehci, struct ehci_qh *qh)
  439. {
  440. unsigned i;
  441. unsigned period = qh->period;
  442. dev_dbg (&qh->dev->dev,
  443. "link qh%d-%04x/%p start %d [%d/%d us]\n",
  444. period, hc32_to_cpup(ehci, &qh->hw_info2) & (QH_CMASK | QH_SMASK),
  445. qh, qh->start, qh->usecs, qh->c_usecs);
  446. /* high bandwidth, or otherwise every microframe */
  447. if (period == 0)
  448. period = 1;
  449. for (i = qh->start; i < ehci->periodic_size; i += period) {
  450. union ehci_shadow *prev = &ehci->pshadow[i];
  451. __hc32 *hw_p = &ehci->periodic[i];
  452. union ehci_shadow here = *prev;
  453. __hc32 type = 0;
  454. /* skip the iso nodes at list head */
  455. while (here.ptr) {
  456. type = Q_NEXT_TYPE(ehci, *hw_p);
  457. if (type == cpu_to_hc32(ehci, Q_TYPE_QH))
  458. break;
  459. prev = periodic_next_shadow(ehci, prev, type);
  460. hw_p = &here.qh->hw_next;
  461. here = *prev;
  462. }
  463. /* sorting each branch by period (slow-->fast)
  464. * enables sharing interior tree nodes
  465. */
  466. while (here.ptr && qh != here.qh) {
  467. if (qh->period > here.qh->period)
  468. break;
  469. prev = &here.qh->qh_next;
  470. hw_p = &here.qh->hw_next;
  471. here = *prev;
  472. }
  473. /* link in this qh, unless some earlier pass did that */
  474. if (qh != here.qh) {
  475. qh->qh_next = here;
  476. if (here.qh)
  477. qh->hw_next = *hw_p;
  478. wmb ();
  479. prev->qh = qh;
  480. *hw_p = QH_NEXT (ehci, qh->qh_dma);
  481. }
  482. }
  483. qh->qh_state = QH_STATE_LINKED;
  484. qh_get (qh);
  485. /* update per-qh bandwidth for usbfs */
  486. ehci_to_hcd(ehci)->self.bandwidth_allocated += qh->period
  487. ? ((qh->usecs + qh->c_usecs) / qh->period)
  488. : (qh->usecs * 8);
  489. /* maybe enable periodic schedule processing */
  490. return enable_periodic(ehci);
  491. }
  492. static int qh_unlink_periodic(struct ehci_hcd *ehci, struct ehci_qh *qh)
  493. {
  494. unsigned i;
  495. unsigned period;
  496. // FIXME:
  497. // IF this isn't high speed
  498. // and this qh is active in the current uframe
  499. // (and overlay token SplitXstate is false?)
  500. // THEN
  501. // qh->hw_info1 |= cpu_to_hc32(1 << 7 /* "ignore" */);
  502. /* high bandwidth, or otherwise part of every microframe */
  503. if ((period = qh->period) == 0)
  504. period = 1;
  505. for (i = qh->start; i < ehci->periodic_size; i += period)
  506. periodic_unlink (ehci, i, qh);
  507. /* update per-qh bandwidth for usbfs */
  508. ehci_to_hcd(ehci)->self.bandwidth_allocated -= qh->period
  509. ? ((qh->usecs + qh->c_usecs) / qh->period)
  510. : (qh->usecs * 8);
  511. dev_dbg (&qh->dev->dev,
  512. "unlink qh%d-%04x/%p start %d [%d/%d us]\n",
  513. qh->period,
  514. hc32_to_cpup(ehci, &qh->hw_info2) & (QH_CMASK | QH_SMASK),
  515. qh, qh->start, qh->usecs, qh->c_usecs);
  516. /* qh->qh_next still "live" to HC */
  517. qh->qh_state = QH_STATE_UNLINK;
  518. qh->qh_next.ptr = NULL;
  519. qh_put (qh);
  520. /* maybe turn off periodic schedule */
  521. return disable_periodic(ehci);
  522. }
  523. static void intr_deschedule (struct ehci_hcd *ehci, struct ehci_qh *qh)
  524. {
  525. unsigned wait;
  526. qh_unlink_periodic (ehci, qh);
  527. /* simple/paranoid: always delay, expecting the HC needs to read
  528. * qh->hw_next or finish a writeback after SPLIT/CSPLIT ... and
  529. * expect khubd to clean up after any CSPLITs we won't issue.
  530. * active high speed queues may need bigger delays...
  531. */
  532. if (list_empty (&qh->qtd_list)
  533. || (cpu_to_hc32(ehci, QH_CMASK)
  534. & qh->hw_info2) != 0)
  535. wait = 2;
  536. else
  537. wait = 55; /* worst case: 3 * 1024 */
  538. udelay (wait);
  539. qh->qh_state = QH_STATE_IDLE;
  540. qh->hw_next = EHCI_LIST_END(ehci);
  541. wmb ();
  542. }
  543. /*-------------------------------------------------------------------------*/
  544. static int check_period (
  545. struct ehci_hcd *ehci,
  546. unsigned frame,
  547. unsigned uframe,
  548. unsigned period,
  549. unsigned usecs
  550. ) {
  551. int claimed;
  552. /* complete split running into next frame?
  553. * given FSTN support, we could sometimes check...
  554. */
  555. if (uframe >= 8)
  556. return 0;
  557. /*
  558. * 80% periodic == 100 usec/uframe available
  559. * convert "usecs we need" to "max already claimed"
  560. */
  561. usecs = 100 - usecs;
  562. /* we "know" 2 and 4 uframe intervals were rejected; so
  563. * for period 0, check _every_ microframe in the schedule.
  564. */
  565. if (unlikely (period == 0)) {
  566. do {
  567. for (uframe = 0; uframe < 7; uframe++) {
  568. claimed = periodic_usecs (ehci, frame, uframe);
  569. if (claimed > usecs)
  570. return 0;
  571. }
  572. } while ((frame += 1) < ehci->periodic_size);
  573. /* just check the specified uframe, at that period */
  574. } else {
  575. do {
  576. claimed = periodic_usecs (ehci, frame, uframe);
  577. if (claimed > usecs)
  578. return 0;
  579. } while ((frame += period) < ehci->periodic_size);
  580. }
  581. // success!
  582. return 1;
  583. }
  584. static int check_intr_schedule (
  585. struct ehci_hcd *ehci,
  586. unsigned frame,
  587. unsigned uframe,
  588. const struct ehci_qh *qh,
  589. __hc32 *c_maskp
  590. )
  591. {
  592. int retval = -ENOSPC;
  593. u8 mask = 0;
  594. if (qh->c_usecs && uframe >= 6) /* FSTN territory? */
  595. goto done;
  596. if (!check_period (ehci, frame, uframe, qh->period, qh->usecs))
  597. goto done;
  598. if (!qh->c_usecs) {
  599. retval = 0;
  600. *c_maskp = 0;
  601. goto done;
  602. }
  603. #ifdef CONFIG_USB_EHCI_TT_NEWSCHED
  604. if (tt_available (ehci, qh->period, qh->dev, frame, uframe,
  605. qh->tt_usecs)) {
  606. unsigned i;
  607. /* TODO : this may need FSTN for SSPLIT in uframe 5. */
  608. for (i=uframe+1; i<8 && i<uframe+4; i++)
  609. if (!check_period (ehci, frame, i,
  610. qh->period, qh->c_usecs))
  611. goto done;
  612. else
  613. mask |= 1 << i;
  614. retval = 0;
  615. *c_maskp = cpu_to_hc32(ehci, mask << 8);
  616. }
  617. #else
  618. /* Make sure this tt's buffer is also available for CSPLITs.
  619. * We pessimize a bit; probably the typical full speed case
  620. * doesn't need the second CSPLIT.
  621. *
  622. * NOTE: both SPLIT and CSPLIT could be checked in just
  623. * one smart pass...
  624. */
  625. mask = 0x03 << (uframe + qh->gap_uf);
  626. *c_maskp = cpu_to_hc32(ehci, mask << 8);
  627. mask |= 1 << uframe;
  628. if (tt_no_collision (ehci, qh->period, qh->dev, frame, mask)) {
  629. if (!check_period (ehci, frame, uframe + qh->gap_uf + 1,
  630. qh->period, qh->c_usecs))
  631. goto done;
  632. if (!check_period (ehci, frame, uframe + qh->gap_uf,
  633. qh->period, qh->c_usecs))
  634. goto done;
  635. retval = 0;
  636. }
  637. #endif
  638. done:
  639. return retval;
  640. }
  641. /* "first fit" scheduling policy used the first time through,
  642. * or when the previous schedule slot can't be re-used.
  643. */
  644. static int qh_schedule(struct ehci_hcd *ehci, struct ehci_qh *qh)
  645. {
  646. int status;
  647. unsigned uframe;
  648. __hc32 c_mask;
  649. unsigned frame; /* 0..(qh->period - 1), or NO_FRAME */
  650. qh_refresh(ehci, qh);
  651. qh->hw_next = EHCI_LIST_END(ehci);
  652. frame = qh->start;
  653. /* reuse the previous schedule slots, if we can */
  654. if (frame < qh->period) {
  655. uframe = ffs(hc32_to_cpup(ehci, &qh->hw_info2) & QH_SMASK);
  656. status = check_intr_schedule (ehci, frame, --uframe,
  657. qh, &c_mask);
  658. } else {
  659. uframe = 0;
  660. c_mask = 0;
  661. status = -ENOSPC;
  662. }
  663. /* else scan the schedule to find a group of slots such that all
  664. * uframes have enough periodic bandwidth available.
  665. */
  666. if (status) {
  667. /* "normal" case, uframing flexible except with splits */
  668. if (qh->period) {
  669. int i;
  670. for (i = qh->period; status && i > 0; --i) {
  671. frame = ++ehci->random_frame % qh->period;
  672. for (uframe = 0; uframe < 8; uframe++) {
  673. status = check_intr_schedule (ehci,
  674. frame, uframe, qh,
  675. &c_mask);
  676. if (status == 0)
  677. break;
  678. }
  679. }
  680. /* qh->period == 0 means every uframe */
  681. } else {
  682. frame = 0;
  683. status = check_intr_schedule (ehci, 0, 0, qh, &c_mask);
  684. }
  685. if (status)
  686. goto done;
  687. qh->start = frame;
  688. /* reset S-frame and (maybe) C-frame masks */
  689. qh->hw_info2 &= cpu_to_hc32(ehci, ~(QH_CMASK | QH_SMASK));
  690. qh->hw_info2 |= qh->period
  691. ? cpu_to_hc32(ehci, 1 << uframe)
  692. : cpu_to_hc32(ehci, QH_SMASK);
  693. qh->hw_info2 |= c_mask;
  694. } else
  695. ehci_dbg (ehci, "reused qh %p schedule\n", qh);
  696. /* stuff into the periodic schedule */
  697. status = qh_link_periodic (ehci, qh);
  698. done:
  699. return status;
  700. }
  701. static int intr_submit (
  702. struct ehci_hcd *ehci,
  703. struct urb *urb,
  704. struct list_head *qtd_list,
  705. gfp_t mem_flags
  706. ) {
  707. unsigned epnum;
  708. unsigned long flags;
  709. struct ehci_qh *qh;
  710. int status;
  711. struct list_head empty;
  712. /* get endpoint and transfer/schedule data */
  713. epnum = urb->ep->desc.bEndpointAddress;
  714. spin_lock_irqsave (&ehci->lock, flags);
  715. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  716. &ehci_to_hcd(ehci)->flags))) {
  717. status = -ESHUTDOWN;
  718. goto done_not_linked;
  719. }
  720. status = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  721. if (unlikely(status))
  722. goto done_not_linked;
  723. /* get qh and force any scheduling errors */
  724. INIT_LIST_HEAD (&empty);
  725. qh = qh_append_tds(ehci, urb, &empty, epnum, &urb->ep->hcpriv);
  726. if (qh == NULL) {
  727. status = -ENOMEM;
  728. goto done;
  729. }
  730. if (qh->qh_state == QH_STATE_IDLE) {
  731. if ((status = qh_schedule (ehci, qh)) != 0)
  732. goto done;
  733. }
  734. /* then queue the urb's tds to the qh */
  735. qh = qh_append_tds(ehci, urb, qtd_list, epnum, &urb->ep->hcpriv);
  736. BUG_ON (qh == NULL);
  737. /* ... update usbfs periodic stats */
  738. ehci_to_hcd(ehci)->self.bandwidth_int_reqs++;
  739. done:
  740. if (unlikely(status))
  741. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  742. done_not_linked:
  743. spin_unlock_irqrestore (&ehci->lock, flags);
  744. if (status)
  745. qtd_list_free (ehci, urb, qtd_list);
  746. return status;
  747. }
  748. /*-------------------------------------------------------------------------*/
  749. /* ehci_iso_stream ops work with both ITD and SITD */
  750. static struct ehci_iso_stream *
  751. iso_stream_alloc (gfp_t mem_flags)
  752. {
  753. struct ehci_iso_stream *stream;
  754. stream = kzalloc(sizeof *stream, mem_flags);
  755. if (likely (stream != NULL)) {
  756. INIT_LIST_HEAD(&stream->td_list);
  757. INIT_LIST_HEAD(&stream->free_list);
  758. stream->next_uframe = -1;
  759. stream->refcount = 1;
  760. }
  761. return stream;
  762. }
  763. static void
  764. iso_stream_init (
  765. struct ehci_hcd *ehci,
  766. struct ehci_iso_stream *stream,
  767. struct usb_device *dev,
  768. int pipe,
  769. unsigned interval
  770. )
  771. {
  772. static const u8 smask_out [] = { 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f };
  773. u32 buf1;
  774. unsigned epnum, maxp;
  775. int is_input;
  776. long bandwidth;
  777. /*
  778. * this might be a "high bandwidth" highspeed endpoint,
  779. * as encoded in the ep descriptor's wMaxPacket field
  780. */
  781. epnum = usb_pipeendpoint (pipe);
  782. is_input = usb_pipein (pipe) ? USB_DIR_IN : 0;
  783. maxp = usb_maxpacket(dev, pipe, !is_input);
  784. if (is_input) {
  785. buf1 = (1 << 11);
  786. } else {
  787. buf1 = 0;
  788. }
  789. /* knows about ITD vs SITD */
  790. if (dev->speed == USB_SPEED_HIGH) {
  791. unsigned multi = hb_mult(maxp);
  792. stream->highspeed = 1;
  793. maxp = max_packet(maxp);
  794. buf1 |= maxp;
  795. maxp *= multi;
  796. stream->buf0 = cpu_to_hc32(ehci, (epnum << 8) | dev->devnum);
  797. stream->buf1 = cpu_to_hc32(ehci, buf1);
  798. stream->buf2 = cpu_to_hc32(ehci, multi);
  799. /* usbfs wants to report the average usecs per frame tied up
  800. * when transfers on this endpoint are scheduled ...
  801. */
  802. stream->usecs = HS_USECS_ISO (maxp);
  803. bandwidth = stream->usecs * 8;
  804. bandwidth /= interval;
  805. } else {
  806. u32 addr;
  807. int think_time;
  808. int hs_transfers;
  809. addr = dev->ttport << 24;
  810. if (!ehci_is_TDI(ehci)
  811. || (dev->tt->hub !=
  812. ehci_to_hcd(ehci)->self.root_hub))
  813. addr |= dev->tt->hub->devnum << 16;
  814. addr |= epnum << 8;
  815. addr |= dev->devnum;
  816. stream->usecs = HS_USECS_ISO (maxp);
  817. think_time = dev->tt ? dev->tt->think_time : 0;
  818. stream->tt_usecs = NS_TO_US (think_time + usb_calc_bus_time (
  819. dev->speed, is_input, 1, maxp));
  820. hs_transfers = max (1u, (maxp + 187) / 188);
  821. if (is_input) {
  822. u32 tmp;
  823. addr |= 1 << 31;
  824. stream->c_usecs = stream->usecs;
  825. stream->usecs = HS_USECS_ISO (1);
  826. stream->raw_mask = 1;
  827. /* c-mask as specified in USB 2.0 11.18.4 3.c */
  828. tmp = (1 << (hs_transfers + 2)) - 1;
  829. stream->raw_mask |= tmp << (8 + 2);
  830. } else
  831. stream->raw_mask = smask_out [hs_transfers - 1];
  832. bandwidth = stream->usecs + stream->c_usecs;
  833. bandwidth /= interval << 3;
  834. /* stream->splits gets created from raw_mask later */
  835. stream->address = cpu_to_hc32(ehci, addr);
  836. }
  837. stream->bandwidth = bandwidth;
  838. stream->udev = dev;
  839. stream->bEndpointAddress = is_input | epnum;
  840. stream->interval = interval;
  841. stream->maxp = maxp;
  842. }
  843. static void
  844. iso_stream_put(struct ehci_hcd *ehci, struct ehci_iso_stream *stream)
  845. {
  846. stream->refcount--;
  847. /* free whenever just a dev->ep reference remains.
  848. * not like a QH -- no persistent state (toggle, halt)
  849. */
  850. if (stream->refcount == 1) {
  851. int is_in;
  852. // BUG_ON (!list_empty(&stream->td_list));
  853. while (!list_empty (&stream->free_list)) {
  854. struct list_head *entry;
  855. entry = stream->free_list.next;
  856. list_del (entry);
  857. /* knows about ITD vs SITD */
  858. if (stream->highspeed) {
  859. struct ehci_itd *itd;
  860. itd = list_entry (entry, struct ehci_itd,
  861. itd_list);
  862. dma_pool_free (ehci->itd_pool, itd,
  863. itd->itd_dma);
  864. } else {
  865. struct ehci_sitd *sitd;
  866. sitd = list_entry (entry, struct ehci_sitd,
  867. sitd_list);
  868. dma_pool_free (ehci->sitd_pool, sitd,
  869. sitd->sitd_dma);
  870. }
  871. }
  872. is_in = (stream->bEndpointAddress & USB_DIR_IN) ? 0x10 : 0;
  873. stream->bEndpointAddress &= 0x0f;
  874. if (stream->ep)
  875. stream->ep->hcpriv = NULL;
  876. if (stream->rescheduled) {
  877. ehci_info (ehci, "ep%d%s-iso rescheduled "
  878. "%lu times in %lu seconds\n",
  879. stream->bEndpointAddress, is_in ? "in" : "out",
  880. stream->rescheduled,
  881. ((jiffies - stream->start)/HZ)
  882. );
  883. }
  884. kfree(stream);
  885. }
  886. }
  887. static inline struct ehci_iso_stream *
  888. iso_stream_get (struct ehci_iso_stream *stream)
  889. {
  890. if (likely (stream != NULL))
  891. stream->refcount++;
  892. return stream;
  893. }
  894. static struct ehci_iso_stream *
  895. iso_stream_find (struct ehci_hcd *ehci, struct urb *urb)
  896. {
  897. unsigned epnum;
  898. struct ehci_iso_stream *stream;
  899. struct usb_host_endpoint *ep;
  900. unsigned long flags;
  901. epnum = usb_pipeendpoint (urb->pipe);
  902. if (usb_pipein(urb->pipe))
  903. ep = urb->dev->ep_in[epnum];
  904. else
  905. ep = urb->dev->ep_out[epnum];
  906. spin_lock_irqsave (&ehci->lock, flags);
  907. stream = ep->hcpriv;
  908. if (unlikely (stream == NULL)) {
  909. stream = iso_stream_alloc(GFP_ATOMIC);
  910. if (likely (stream != NULL)) {
  911. /* dev->ep owns the initial refcount */
  912. ep->hcpriv = stream;
  913. stream->ep = ep;
  914. iso_stream_init(ehci, stream, urb->dev, urb->pipe,
  915. urb->interval);
  916. }
  917. /* if dev->ep [epnum] is a QH, info1.maxpacket is nonzero */
  918. } else if (unlikely (stream->hw_info1 != 0)) {
  919. ehci_dbg (ehci, "dev %s ep%d%s, not iso??\n",
  920. urb->dev->devpath, epnum,
  921. usb_pipein(urb->pipe) ? "in" : "out");
  922. stream = NULL;
  923. }
  924. /* caller guarantees an eventual matching iso_stream_put */
  925. stream = iso_stream_get (stream);
  926. spin_unlock_irqrestore (&ehci->lock, flags);
  927. return stream;
  928. }
  929. /*-------------------------------------------------------------------------*/
  930. /* ehci_iso_sched ops can be ITD-only or SITD-only */
  931. static struct ehci_iso_sched *
  932. iso_sched_alloc (unsigned packets, gfp_t mem_flags)
  933. {
  934. struct ehci_iso_sched *iso_sched;
  935. int size = sizeof *iso_sched;
  936. size += packets * sizeof (struct ehci_iso_packet);
  937. iso_sched = kzalloc(size, mem_flags);
  938. if (likely (iso_sched != NULL)) {
  939. INIT_LIST_HEAD (&iso_sched->td_list);
  940. }
  941. return iso_sched;
  942. }
  943. static inline void
  944. itd_sched_init(
  945. struct ehci_hcd *ehci,
  946. struct ehci_iso_sched *iso_sched,
  947. struct ehci_iso_stream *stream,
  948. struct urb *urb
  949. )
  950. {
  951. unsigned i;
  952. dma_addr_t dma = urb->transfer_dma;
  953. /* how many uframes are needed for these transfers */
  954. iso_sched->span = urb->number_of_packets * stream->interval;
  955. /* figure out per-uframe itd fields that we'll need later
  956. * when we fit new itds into the schedule.
  957. */
  958. for (i = 0; i < urb->number_of_packets; i++) {
  959. struct ehci_iso_packet *uframe = &iso_sched->packet [i];
  960. unsigned length;
  961. dma_addr_t buf;
  962. u32 trans;
  963. length = urb->iso_frame_desc [i].length;
  964. buf = dma + urb->iso_frame_desc [i].offset;
  965. trans = EHCI_ISOC_ACTIVE;
  966. trans |= buf & 0x0fff;
  967. if (unlikely (((i + 1) == urb->number_of_packets))
  968. && !(urb->transfer_flags & URB_NO_INTERRUPT))
  969. trans |= EHCI_ITD_IOC;
  970. trans |= length << 16;
  971. uframe->transaction = cpu_to_hc32(ehci, trans);
  972. /* might need to cross a buffer page within a uframe */
  973. uframe->bufp = (buf & ~(u64)0x0fff);
  974. buf += length;
  975. if (unlikely ((uframe->bufp != (buf & ~(u64)0x0fff))))
  976. uframe->cross = 1;
  977. }
  978. }
  979. static void
  980. iso_sched_free (
  981. struct ehci_iso_stream *stream,
  982. struct ehci_iso_sched *iso_sched
  983. )
  984. {
  985. if (!iso_sched)
  986. return;
  987. // caller must hold ehci->lock!
  988. list_splice (&iso_sched->td_list, &stream->free_list);
  989. kfree (iso_sched);
  990. }
  991. static int
  992. itd_urb_transaction (
  993. struct ehci_iso_stream *stream,
  994. struct ehci_hcd *ehci,
  995. struct urb *urb,
  996. gfp_t mem_flags
  997. )
  998. {
  999. struct ehci_itd *itd;
  1000. dma_addr_t itd_dma;
  1001. int i;
  1002. unsigned num_itds;
  1003. struct ehci_iso_sched *sched;
  1004. unsigned long flags;
  1005. sched = iso_sched_alloc (urb->number_of_packets, mem_flags);
  1006. if (unlikely (sched == NULL))
  1007. return -ENOMEM;
  1008. itd_sched_init(ehci, sched, stream, urb);
  1009. if (urb->interval < 8)
  1010. num_itds = 1 + (sched->span + 7) / 8;
  1011. else
  1012. num_itds = urb->number_of_packets;
  1013. /* allocate/init ITDs */
  1014. spin_lock_irqsave (&ehci->lock, flags);
  1015. for (i = 0; i < num_itds; i++) {
  1016. /* free_list.next might be cache-hot ... but maybe
  1017. * the HC caches it too. avoid that issue for now.
  1018. */
  1019. /* prefer previously-allocated itds */
  1020. if (likely (!list_empty(&stream->free_list))) {
  1021. itd = list_entry (stream->free_list.prev,
  1022. struct ehci_itd, itd_list);
  1023. list_del (&itd->itd_list);
  1024. itd_dma = itd->itd_dma;
  1025. } else {
  1026. spin_unlock_irqrestore (&ehci->lock, flags);
  1027. itd = dma_pool_alloc (ehci->itd_pool, mem_flags,
  1028. &itd_dma);
  1029. spin_lock_irqsave (&ehci->lock, flags);
  1030. if (!itd) {
  1031. iso_sched_free(stream, sched);
  1032. spin_unlock_irqrestore(&ehci->lock, flags);
  1033. return -ENOMEM;
  1034. }
  1035. }
  1036. memset (itd, 0, sizeof *itd);
  1037. itd->itd_dma = itd_dma;
  1038. list_add (&itd->itd_list, &sched->td_list);
  1039. }
  1040. spin_unlock_irqrestore (&ehci->lock, flags);
  1041. /* temporarily store schedule info in hcpriv */
  1042. urb->hcpriv = sched;
  1043. urb->error_count = 0;
  1044. return 0;
  1045. }
  1046. /*-------------------------------------------------------------------------*/
  1047. static inline int
  1048. itd_slot_ok (
  1049. struct ehci_hcd *ehci,
  1050. u32 mod,
  1051. u32 uframe,
  1052. u8 usecs,
  1053. u32 period
  1054. )
  1055. {
  1056. uframe %= period;
  1057. do {
  1058. /* can't commit more than 80% periodic == 100 usec */
  1059. if (periodic_usecs (ehci, uframe >> 3, uframe & 0x7)
  1060. > (100 - usecs))
  1061. return 0;
  1062. /* we know urb->interval is 2^N uframes */
  1063. uframe += period;
  1064. } while (uframe < mod);
  1065. return 1;
  1066. }
  1067. static inline int
  1068. sitd_slot_ok (
  1069. struct ehci_hcd *ehci,
  1070. u32 mod,
  1071. struct ehci_iso_stream *stream,
  1072. u32 uframe,
  1073. struct ehci_iso_sched *sched,
  1074. u32 period_uframes
  1075. )
  1076. {
  1077. u32 mask, tmp;
  1078. u32 frame, uf;
  1079. mask = stream->raw_mask << (uframe & 7);
  1080. /* for IN, don't wrap CSPLIT into the next frame */
  1081. if (mask & ~0xffff)
  1082. return 0;
  1083. /* this multi-pass logic is simple, but performance may
  1084. * suffer when the schedule data isn't cached.
  1085. */
  1086. /* check bandwidth */
  1087. uframe %= period_uframes;
  1088. do {
  1089. u32 max_used;
  1090. frame = uframe >> 3;
  1091. uf = uframe & 7;
  1092. #ifdef CONFIG_USB_EHCI_TT_NEWSCHED
  1093. /* The tt's fullspeed bus bandwidth must be available.
  1094. * tt_available scheduling guarantees 10+% for control/bulk.
  1095. */
  1096. if (!tt_available (ehci, period_uframes << 3,
  1097. stream->udev, frame, uf, stream->tt_usecs))
  1098. return 0;
  1099. #else
  1100. /* tt must be idle for start(s), any gap, and csplit.
  1101. * assume scheduling slop leaves 10+% for control/bulk.
  1102. */
  1103. if (!tt_no_collision (ehci, period_uframes << 3,
  1104. stream->udev, frame, mask))
  1105. return 0;
  1106. #endif
  1107. /* check starts (OUT uses more than one) */
  1108. max_used = 100 - stream->usecs;
  1109. for (tmp = stream->raw_mask & 0xff; tmp; tmp >>= 1, uf++) {
  1110. if (periodic_usecs (ehci, frame, uf) > max_used)
  1111. return 0;
  1112. }
  1113. /* for IN, check CSPLIT */
  1114. if (stream->c_usecs) {
  1115. uf = uframe & 7;
  1116. max_used = 100 - stream->c_usecs;
  1117. do {
  1118. tmp = 1 << uf;
  1119. tmp <<= 8;
  1120. if ((stream->raw_mask & tmp) == 0)
  1121. continue;
  1122. if (periodic_usecs (ehci, frame, uf)
  1123. > max_used)
  1124. return 0;
  1125. } while (++uf < 8);
  1126. }
  1127. /* we know urb->interval is 2^N uframes */
  1128. uframe += period_uframes;
  1129. } while (uframe < mod);
  1130. stream->splits = cpu_to_hc32(ehci, stream->raw_mask << (uframe & 7));
  1131. return 1;
  1132. }
  1133. /*
  1134. * This scheduler plans almost as far into the future as it has actual
  1135. * periodic schedule slots. (Affected by TUNE_FLS, which defaults to
  1136. * "as small as possible" to be cache-friendlier.) That limits the size
  1137. * transfers you can stream reliably; avoid more than 64 msec per urb.
  1138. * Also avoid queue depths of less than ehci's worst irq latency (affected
  1139. * by the per-urb URB_NO_INTERRUPT hint, the log2_irq_thresh module parameter,
  1140. * and other factors); or more than about 230 msec total (for portability,
  1141. * given EHCI_TUNE_FLS and the slop). Or, write a smarter scheduler!
  1142. */
  1143. #define SCHEDULE_SLOP 10 /* frames */
  1144. static int
  1145. iso_stream_schedule (
  1146. struct ehci_hcd *ehci,
  1147. struct urb *urb,
  1148. struct ehci_iso_stream *stream
  1149. )
  1150. {
  1151. u32 now, start, max, period;
  1152. int status;
  1153. unsigned mod = ehci->periodic_size << 3;
  1154. struct ehci_iso_sched *sched = urb->hcpriv;
  1155. if (sched->span > (mod - 8 * SCHEDULE_SLOP)) {
  1156. ehci_dbg (ehci, "iso request %p too long\n", urb);
  1157. status = -EFBIG;
  1158. goto fail;
  1159. }
  1160. if ((stream->depth + sched->span) > mod) {
  1161. ehci_dbg (ehci, "request %p would overflow (%d+%d>%d)\n",
  1162. urb, stream->depth, sched->span, mod);
  1163. status = -EFBIG;
  1164. goto fail;
  1165. }
  1166. now = ehci_readl(ehci, &ehci->regs->frame_index) % mod;
  1167. /* when's the last uframe this urb could start? */
  1168. max = now + mod;
  1169. /* Typical case: reuse current schedule, stream is still active.
  1170. * Hopefully there are no gaps from the host falling behind
  1171. * (irq delays etc), but if there are we'll take the next
  1172. * slot in the schedule, implicitly assuming URB_ISO_ASAP.
  1173. */
  1174. if (likely (!list_empty (&stream->td_list))) {
  1175. start = stream->next_uframe;
  1176. if (start < now)
  1177. start += mod;
  1178. /* Fell behind (by up to twice the slop amount)? */
  1179. if (start >= max - 2 * 8 * SCHEDULE_SLOP)
  1180. start += stream->interval * DIV_ROUND_UP(
  1181. max - start, stream->interval) - mod;
  1182. /* Tried to schedule too far into the future? */
  1183. if (unlikely((start + sched->span) >= max)) {
  1184. status = -EFBIG;
  1185. goto fail;
  1186. }
  1187. goto ready;
  1188. }
  1189. /* need to schedule; when's the next (u)frame we could start?
  1190. * this is bigger than ehci->i_thresh allows; scheduling itself
  1191. * isn't free, the slop should handle reasonably slow cpus. it
  1192. * can also help high bandwidth if the dma and irq loads don't
  1193. * jump until after the queue is primed.
  1194. */
  1195. start = SCHEDULE_SLOP * 8 + (now & ~0x07);
  1196. start %= mod;
  1197. stream->next_uframe = start;
  1198. /* NOTE: assumes URB_ISO_ASAP, to limit complexity/bugs */
  1199. period = urb->interval;
  1200. if (!stream->highspeed)
  1201. period <<= 3;
  1202. /* find a uframe slot with enough bandwidth */
  1203. for (; start < (stream->next_uframe + period); start++) {
  1204. int enough_space;
  1205. /* check schedule: enough space? */
  1206. if (stream->highspeed)
  1207. enough_space = itd_slot_ok (ehci, mod, start,
  1208. stream->usecs, period);
  1209. else {
  1210. if ((start % 8) >= 6)
  1211. continue;
  1212. enough_space = sitd_slot_ok (ehci, mod, stream,
  1213. start, sched, period);
  1214. }
  1215. /* schedule it here if there's enough bandwidth */
  1216. if (enough_space) {
  1217. stream->next_uframe = start % mod;
  1218. goto ready;
  1219. }
  1220. }
  1221. /* no room in the schedule */
  1222. ehci_dbg (ehci, "iso %ssched full %p (now %d max %d)\n",
  1223. list_empty (&stream->td_list) ? "" : "re",
  1224. urb, now, max);
  1225. status = -ENOSPC;
  1226. fail:
  1227. iso_sched_free (stream, sched);
  1228. urb->hcpriv = NULL;
  1229. return status;
  1230. ready:
  1231. /* report high speed start in uframes; full speed, in frames */
  1232. urb->start_frame = stream->next_uframe;
  1233. if (!stream->highspeed)
  1234. urb->start_frame >>= 3;
  1235. return 0;
  1236. }
  1237. /*-------------------------------------------------------------------------*/
  1238. static inline void
  1239. itd_init(struct ehci_hcd *ehci, struct ehci_iso_stream *stream,
  1240. struct ehci_itd *itd)
  1241. {
  1242. int i;
  1243. /* it's been recently zeroed */
  1244. itd->hw_next = EHCI_LIST_END(ehci);
  1245. itd->hw_bufp [0] = stream->buf0;
  1246. itd->hw_bufp [1] = stream->buf1;
  1247. itd->hw_bufp [2] = stream->buf2;
  1248. for (i = 0; i < 8; i++)
  1249. itd->index[i] = -1;
  1250. /* All other fields are filled when scheduling */
  1251. }
  1252. static inline void
  1253. itd_patch(
  1254. struct ehci_hcd *ehci,
  1255. struct ehci_itd *itd,
  1256. struct ehci_iso_sched *iso_sched,
  1257. unsigned index,
  1258. u16 uframe
  1259. )
  1260. {
  1261. struct ehci_iso_packet *uf = &iso_sched->packet [index];
  1262. unsigned pg = itd->pg;
  1263. // BUG_ON (pg == 6 && uf->cross);
  1264. uframe &= 0x07;
  1265. itd->index [uframe] = index;
  1266. itd->hw_transaction[uframe] = uf->transaction;
  1267. itd->hw_transaction[uframe] |= cpu_to_hc32(ehci, pg << 12);
  1268. itd->hw_bufp[pg] |= cpu_to_hc32(ehci, uf->bufp & ~(u32)0);
  1269. itd->hw_bufp_hi[pg] |= cpu_to_hc32(ehci, (u32)(uf->bufp >> 32));
  1270. /* iso_frame_desc[].offset must be strictly increasing */
  1271. if (unlikely (uf->cross)) {
  1272. u64 bufp = uf->bufp + 4096;
  1273. itd->pg = ++pg;
  1274. itd->hw_bufp[pg] |= cpu_to_hc32(ehci, bufp & ~(u32)0);
  1275. itd->hw_bufp_hi[pg] |= cpu_to_hc32(ehci, (u32)(bufp >> 32));
  1276. }
  1277. }
  1278. static inline void
  1279. itd_link (struct ehci_hcd *ehci, unsigned frame, struct ehci_itd *itd)
  1280. {
  1281. /* always prepend ITD/SITD ... only QH tree is order-sensitive */
  1282. itd->itd_next = ehci->pshadow [frame];
  1283. itd->hw_next = ehci->periodic [frame];
  1284. ehci->pshadow [frame].itd = itd;
  1285. itd->frame = frame;
  1286. wmb ();
  1287. ehci->periodic[frame] = cpu_to_hc32(ehci, itd->itd_dma | Q_TYPE_ITD);
  1288. }
  1289. /* fit urb's itds into the selected schedule slot; activate as needed */
  1290. static int
  1291. itd_link_urb (
  1292. struct ehci_hcd *ehci,
  1293. struct urb *urb,
  1294. unsigned mod,
  1295. struct ehci_iso_stream *stream
  1296. )
  1297. {
  1298. int packet;
  1299. unsigned next_uframe, uframe, frame;
  1300. struct ehci_iso_sched *iso_sched = urb->hcpriv;
  1301. struct ehci_itd *itd;
  1302. next_uframe = stream->next_uframe % mod;
  1303. if (unlikely (list_empty(&stream->td_list))) {
  1304. ehci_to_hcd(ehci)->self.bandwidth_allocated
  1305. += stream->bandwidth;
  1306. ehci_vdbg (ehci,
  1307. "schedule devp %s ep%d%s-iso period %d start %d.%d\n",
  1308. urb->dev->devpath, stream->bEndpointAddress & 0x0f,
  1309. (stream->bEndpointAddress & USB_DIR_IN) ? "in" : "out",
  1310. urb->interval,
  1311. next_uframe >> 3, next_uframe & 0x7);
  1312. stream->start = jiffies;
  1313. }
  1314. ehci_to_hcd(ehci)->self.bandwidth_isoc_reqs++;
  1315. /* fill iTDs uframe by uframe */
  1316. for (packet = 0, itd = NULL; packet < urb->number_of_packets; ) {
  1317. if (itd == NULL) {
  1318. /* ASSERT: we have all necessary itds */
  1319. // BUG_ON (list_empty (&iso_sched->td_list));
  1320. /* ASSERT: no itds for this endpoint in this uframe */
  1321. itd = list_entry (iso_sched->td_list.next,
  1322. struct ehci_itd, itd_list);
  1323. list_move_tail (&itd->itd_list, &stream->td_list);
  1324. itd->stream = iso_stream_get (stream);
  1325. itd->urb = urb;
  1326. itd_init (ehci, stream, itd);
  1327. }
  1328. uframe = next_uframe & 0x07;
  1329. frame = next_uframe >> 3;
  1330. itd_patch(ehci, itd, iso_sched, packet, uframe);
  1331. next_uframe += stream->interval;
  1332. stream->depth += stream->interval;
  1333. next_uframe %= mod;
  1334. packet++;
  1335. /* link completed itds into the schedule */
  1336. if (((next_uframe >> 3) != frame)
  1337. || packet == urb->number_of_packets) {
  1338. itd_link (ehci, frame % ehci->periodic_size, itd);
  1339. itd = NULL;
  1340. }
  1341. }
  1342. stream->next_uframe = next_uframe;
  1343. /* don't need that schedule data any more */
  1344. iso_sched_free (stream, iso_sched);
  1345. urb->hcpriv = NULL;
  1346. timer_action (ehci, TIMER_IO_WATCHDOG);
  1347. return enable_periodic(ehci);
  1348. }
  1349. #define ISO_ERRS (EHCI_ISOC_BUF_ERR | EHCI_ISOC_BABBLE | EHCI_ISOC_XACTERR)
  1350. /* Process and recycle a completed ITD. Return true iff its urb completed,
  1351. * and hence its completion callback probably added things to the hardware
  1352. * schedule.
  1353. *
  1354. * Note that we carefully avoid recycling this descriptor until after any
  1355. * completion callback runs, so that it won't be reused quickly. That is,
  1356. * assuming (a) no more than two urbs per frame on this endpoint, and also
  1357. * (b) only this endpoint's completions submit URBs. It seems some silicon
  1358. * corrupts things if you reuse completed descriptors very quickly...
  1359. */
  1360. static unsigned
  1361. itd_complete (
  1362. struct ehci_hcd *ehci,
  1363. struct ehci_itd *itd
  1364. ) {
  1365. struct urb *urb = itd->urb;
  1366. struct usb_iso_packet_descriptor *desc;
  1367. u32 t;
  1368. unsigned uframe;
  1369. int urb_index = -1;
  1370. struct ehci_iso_stream *stream = itd->stream;
  1371. struct usb_device *dev;
  1372. unsigned retval = false;
  1373. /* for each uframe with a packet */
  1374. for (uframe = 0; uframe < 8; uframe++) {
  1375. if (likely (itd->index[uframe] == -1))
  1376. continue;
  1377. urb_index = itd->index[uframe];
  1378. desc = &urb->iso_frame_desc [urb_index];
  1379. t = hc32_to_cpup(ehci, &itd->hw_transaction [uframe]);
  1380. itd->hw_transaction [uframe] = 0;
  1381. stream->depth -= stream->interval;
  1382. /* report transfer status */
  1383. if (unlikely (t & ISO_ERRS)) {
  1384. urb->error_count++;
  1385. if (t & EHCI_ISOC_BUF_ERR)
  1386. desc->status = usb_pipein (urb->pipe)
  1387. ? -ENOSR /* hc couldn't read */
  1388. : -ECOMM; /* hc couldn't write */
  1389. else if (t & EHCI_ISOC_BABBLE)
  1390. desc->status = -EOVERFLOW;
  1391. else /* (t & EHCI_ISOC_XACTERR) */
  1392. desc->status = -EPROTO;
  1393. /* HC need not update length with this error */
  1394. if (!(t & EHCI_ISOC_BABBLE)) {
  1395. desc->actual_length = EHCI_ITD_LENGTH(t);
  1396. urb->actual_length += desc->actual_length;
  1397. }
  1398. } else if (likely ((t & EHCI_ISOC_ACTIVE) == 0)) {
  1399. desc->status = 0;
  1400. desc->actual_length = EHCI_ITD_LENGTH(t);
  1401. urb->actual_length += desc->actual_length;
  1402. } else {
  1403. /* URB was too late */
  1404. desc->status = -EXDEV;
  1405. }
  1406. }
  1407. /* handle completion now? */
  1408. if (likely ((urb_index + 1) != urb->number_of_packets))
  1409. goto done;
  1410. /* ASSERT: it's really the last itd for this urb
  1411. list_for_each_entry (itd, &stream->td_list, itd_list)
  1412. BUG_ON (itd->urb == urb);
  1413. */
  1414. /* give urb back to the driver; completion often (re)submits */
  1415. dev = urb->dev;
  1416. ehci_urb_done(ehci, urb, 0);
  1417. retval = true;
  1418. urb = NULL;
  1419. (void) disable_periodic(ehci);
  1420. ehci_to_hcd(ehci)->self.bandwidth_isoc_reqs--;
  1421. if (unlikely(list_is_singular(&stream->td_list))) {
  1422. ehci_to_hcd(ehci)->self.bandwidth_allocated
  1423. -= stream->bandwidth;
  1424. ehci_vdbg (ehci,
  1425. "deschedule devp %s ep%d%s-iso\n",
  1426. dev->devpath, stream->bEndpointAddress & 0x0f,
  1427. (stream->bEndpointAddress & USB_DIR_IN) ? "in" : "out");
  1428. }
  1429. iso_stream_put (ehci, stream);
  1430. done:
  1431. itd->urb = NULL;
  1432. if (ehci->clock_frame != itd->frame || itd->index[7] != -1) {
  1433. /* OK to recycle this ITD now. */
  1434. itd->stream = NULL;
  1435. list_move(&itd->itd_list, &stream->free_list);
  1436. iso_stream_put(ehci, stream);
  1437. } else {
  1438. /* HW might remember this ITD, so we can't recycle it yet.
  1439. * Move it to a safe place until a new frame starts.
  1440. */
  1441. list_move(&itd->itd_list, &ehci->cached_itd_list);
  1442. if (stream->refcount == 2) {
  1443. /* If iso_stream_put() were called here, stream
  1444. * would be freed. Instead, just prevent reuse.
  1445. */
  1446. stream->ep->hcpriv = NULL;
  1447. stream->ep = NULL;
  1448. }
  1449. }
  1450. return retval;
  1451. }
  1452. /*-------------------------------------------------------------------------*/
  1453. static int itd_submit (struct ehci_hcd *ehci, struct urb *urb,
  1454. gfp_t mem_flags)
  1455. {
  1456. int status = -EINVAL;
  1457. unsigned long flags;
  1458. struct ehci_iso_stream *stream;
  1459. /* Get iso_stream head */
  1460. stream = iso_stream_find (ehci, urb);
  1461. if (unlikely (stream == NULL)) {
  1462. ehci_dbg (ehci, "can't get iso stream\n");
  1463. return -ENOMEM;
  1464. }
  1465. if (unlikely (urb->interval != stream->interval)) {
  1466. ehci_dbg (ehci, "can't change iso interval %d --> %d\n",
  1467. stream->interval, urb->interval);
  1468. goto done;
  1469. }
  1470. #ifdef EHCI_URB_TRACE
  1471. ehci_dbg (ehci,
  1472. "%s %s urb %p ep%d%s len %d, %d pkts %d uframes [%p]\n",
  1473. __func__, urb->dev->devpath, urb,
  1474. usb_pipeendpoint (urb->pipe),
  1475. usb_pipein (urb->pipe) ? "in" : "out",
  1476. urb->transfer_buffer_length,
  1477. urb->number_of_packets, urb->interval,
  1478. stream);
  1479. #endif
  1480. /* allocate ITDs w/o locking anything */
  1481. status = itd_urb_transaction (stream, ehci, urb, mem_flags);
  1482. if (unlikely (status < 0)) {
  1483. ehci_dbg (ehci, "can't init itds\n");
  1484. goto done;
  1485. }
  1486. /* schedule ... need to lock */
  1487. spin_lock_irqsave (&ehci->lock, flags);
  1488. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  1489. &ehci_to_hcd(ehci)->flags))) {
  1490. status = -ESHUTDOWN;
  1491. goto done_not_linked;
  1492. }
  1493. status = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  1494. if (unlikely(status))
  1495. goto done_not_linked;
  1496. status = iso_stream_schedule(ehci, urb, stream);
  1497. if (likely (status == 0))
  1498. itd_link_urb (ehci, urb, ehci->periodic_size << 3, stream);
  1499. else
  1500. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  1501. done_not_linked:
  1502. spin_unlock_irqrestore (&ehci->lock, flags);
  1503. done:
  1504. if (unlikely (status < 0))
  1505. iso_stream_put (ehci, stream);
  1506. return status;
  1507. }
  1508. /*-------------------------------------------------------------------------*/
  1509. /*
  1510. * "Split ISO TDs" ... used for USB 1.1 devices going through the
  1511. * TTs in USB 2.0 hubs. These need microframe scheduling.
  1512. */
  1513. static inline void
  1514. sitd_sched_init(
  1515. struct ehci_hcd *ehci,
  1516. struct ehci_iso_sched *iso_sched,
  1517. struct ehci_iso_stream *stream,
  1518. struct urb *urb
  1519. )
  1520. {
  1521. unsigned i;
  1522. dma_addr_t dma = urb->transfer_dma;
  1523. /* how many frames are needed for these transfers */
  1524. iso_sched->span = urb->number_of_packets * stream->interval;
  1525. /* figure out per-frame sitd fields that we'll need later
  1526. * when we fit new sitds into the schedule.
  1527. */
  1528. for (i = 0; i < urb->number_of_packets; i++) {
  1529. struct ehci_iso_packet *packet = &iso_sched->packet [i];
  1530. unsigned length;
  1531. dma_addr_t buf;
  1532. u32 trans;
  1533. length = urb->iso_frame_desc [i].length & 0x03ff;
  1534. buf = dma + urb->iso_frame_desc [i].offset;
  1535. trans = SITD_STS_ACTIVE;
  1536. if (((i + 1) == urb->number_of_packets)
  1537. && !(urb->transfer_flags & URB_NO_INTERRUPT))
  1538. trans |= SITD_IOC;
  1539. trans |= length << 16;
  1540. packet->transaction = cpu_to_hc32(ehci, trans);
  1541. /* might need to cross a buffer page within a td */
  1542. packet->bufp = buf;
  1543. packet->buf1 = (buf + length) & ~0x0fff;
  1544. if (packet->buf1 != (buf & ~(u64)0x0fff))
  1545. packet->cross = 1;
  1546. /* OUT uses multiple start-splits */
  1547. if (stream->bEndpointAddress & USB_DIR_IN)
  1548. continue;
  1549. length = (length + 187) / 188;
  1550. if (length > 1) /* BEGIN vs ALL */
  1551. length |= 1 << 3;
  1552. packet->buf1 |= length;
  1553. }
  1554. }
  1555. static int
  1556. sitd_urb_transaction (
  1557. struct ehci_iso_stream *stream,
  1558. struct ehci_hcd *ehci,
  1559. struct urb *urb,
  1560. gfp_t mem_flags
  1561. )
  1562. {
  1563. struct ehci_sitd *sitd;
  1564. dma_addr_t sitd_dma;
  1565. int i;
  1566. struct ehci_iso_sched *iso_sched;
  1567. unsigned long flags;
  1568. iso_sched = iso_sched_alloc (urb->number_of_packets, mem_flags);
  1569. if (iso_sched == NULL)
  1570. return -ENOMEM;
  1571. sitd_sched_init(ehci, iso_sched, stream, urb);
  1572. /* allocate/init sITDs */
  1573. spin_lock_irqsave (&ehci->lock, flags);
  1574. for (i = 0; i < urb->number_of_packets; i++) {
  1575. /* NOTE: for now, we don't try to handle wraparound cases
  1576. * for IN (using sitd->hw_backpointer, like a FSTN), which
  1577. * means we never need two sitds for full speed packets.
  1578. */
  1579. /* free_list.next might be cache-hot ... but maybe
  1580. * the HC caches it too. avoid that issue for now.
  1581. */
  1582. /* prefer previously-allocated sitds */
  1583. if (!list_empty(&stream->free_list)) {
  1584. sitd = list_entry (stream->free_list.prev,
  1585. struct ehci_sitd, sitd_list);
  1586. list_del (&sitd->sitd_list);
  1587. sitd_dma = sitd->sitd_dma;
  1588. } else {
  1589. spin_unlock_irqrestore (&ehci->lock, flags);
  1590. sitd = dma_pool_alloc (ehci->sitd_pool, mem_flags,
  1591. &sitd_dma);
  1592. spin_lock_irqsave (&ehci->lock, flags);
  1593. if (!sitd) {
  1594. iso_sched_free(stream, iso_sched);
  1595. spin_unlock_irqrestore(&ehci->lock, flags);
  1596. return -ENOMEM;
  1597. }
  1598. }
  1599. memset (sitd, 0, sizeof *sitd);
  1600. sitd->sitd_dma = sitd_dma;
  1601. list_add (&sitd->sitd_list, &iso_sched->td_list);
  1602. }
  1603. /* temporarily store schedule info in hcpriv */
  1604. urb->hcpriv = iso_sched;
  1605. urb->error_count = 0;
  1606. spin_unlock_irqrestore (&ehci->lock, flags);
  1607. return 0;
  1608. }
  1609. /*-------------------------------------------------------------------------*/
  1610. static inline void
  1611. sitd_patch(
  1612. struct ehci_hcd *ehci,
  1613. struct ehci_iso_stream *stream,
  1614. struct ehci_sitd *sitd,
  1615. struct ehci_iso_sched *iso_sched,
  1616. unsigned index
  1617. )
  1618. {
  1619. struct ehci_iso_packet *uf = &iso_sched->packet [index];
  1620. u64 bufp = uf->bufp;
  1621. sitd->hw_next = EHCI_LIST_END(ehci);
  1622. sitd->hw_fullspeed_ep = stream->address;
  1623. sitd->hw_uframe = stream->splits;
  1624. sitd->hw_results = uf->transaction;
  1625. sitd->hw_backpointer = EHCI_LIST_END(ehci);
  1626. bufp = uf->bufp;
  1627. sitd->hw_buf[0] = cpu_to_hc32(ehci, bufp);
  1628. sitd->hw_buf_hi[0] = cpu_to_hc32(ehci, bufp >> 32);
  1629. sitd->hw_buf[1] = cpu_to_hc32(ehci, uf->buf1);
  1630. if (uf->cross)
  1631. bufp += 4096;
  1632. sitd->hw_buf_hi[1] = cpu_to_hc32(ehci, bufp >> 32);
  1633. sitd->index = index;
  1634. }
  1635. static inline void
  1636. sitd_link (struct ehci_hcd *ehci, unsigned frame, struct ehci_sitd *sitd)
  1637. {
  1638. /* note: sitd ordering could matter (CSPLIT then SSPLIT) */
  1639. sitd->sitd_next = ehci->pshadow [frame];
  1640. sitd->hw_next = ehci->periodic [frame];
  1641. ehci->pshadow [frame].sitd = sitd;
  1642. sitd->frame = frame;
  1643. wmb ();
  1644. ehci->periodic[frame] = cpu_to_hc32(ehci, sitd->sitd_dma | Q_TYPE_SITD);
  1645. }
  1646. /* fit urb's sitds into the selected schedule slot; activate as needed */
  1647. static int
  1648. sitd_link_urb (
  1649. struct ehci_hcd *ehci,
  1650. struct urb *urb,
  1651. unsigned mod,
  1652. struct ehci_iso_stream *stream
  1653. )
  1654. {
  1655. int packet;
  1656. unsigned next_uframe;
  1657. struct ehci_iso_sched *sched = urb->hcpriv;
  1658. struct ehci_sitd *sitd;
  1659. next_uframe = stream->next_uframe;
  1660. if (list_empty(&stream->td_list)) {
  1661. /* usbfs ignores TT bandwidth */
  1662. ehci_to_hcd(ehci)->self.bandwidth_allocated
  1663. += stream->bandwidth;
  1664. ehci_vdbg (ehci,
  1665. "sched devp %s ep%d%s-iso [%d] %dms/%04x\n",
  1666. urb->dev->devpath, stream->bEndpointAddress & 0x0f,
  1667. (stream->bEndpointAddress & USB_DIR_IN) ? "in" : "out",
  1668. (next_uframe >> 3) % ehci->periodic_size,
  1669. stream->interval, hc32_to_cpu(ehci, stream->splits));
  1670. stream->start = jiffies;
  1671. }
  1672. ehci_to_hcd(ehci)->self.bandwidth_isoc_reqs++;
  1673. /* fill sITDs frame by frame */
  1674. for (packet = 0, sitd = NULL;
  1675. packet < urb->number_of_packets;
  1676. packet++) {
  1677. /* ASSERT: we have all necessary sitds */
  1678. BUG_ON (list_empty (&sched->td_list));
  1679. /* ASSERT: no itds for this endpoint in this frame */
  1680. sitd = list_entry (sched->td_list.next,
  1681. struct ehci_sitd, sitd_list);
  1682. list_move_tail (&sitd->sitd_list, &stream->td_list);
  1683. sitd->stream = iso_stream_get (stream);
  1684. sitd->urb = urb;
  1685. sitd_patch(ehci, stream, sitd, sched, packet);
  1686. sitd_link (ehci, (next_uframe >> 3) % ehci->periodic_size,
  1687. sitd);
  1688. next_uframe += stream->interval << 3;
  1689. stream->depth += stream->interval << 3;
  1690. }
  1691. stream->next_uframe = next_uframe % mod;
  1692. /* don't need that schedule data any more */
  1693. iso_sched_free (stream, sched);
  1694. urb->hcpriv = NULL;
  1695. timer_action (ehci, TIMER_IO_WATCHDOG);
  1696. return enable_periodic(ehci);
  1697. }
  1698. /*-------------------------------------------------------------------------*/
  1699. #define SITD_ERRS (SITD_STS_ERR | SITD_STS_DBE | SITD_STS_BABBLE \
  1700. | SITD_STS_XACT | SITD_STS_MMF)
  1701. /* Process and recycle a completed SITD. Return true iff its urb completed,
  1702. * and hence its completion callback probably added things to the hardware
  1703. * schedule.
  1704. *
  1705. * Note that we carefully avoid recycling this descriptor until after any
  1706. * completion callback runs, so that it won't be reused quickly. That is,
  1707. * assuming (a) no more than two urbs per frame on this endpoint, and also
  1708. * (b) only this endpoint's completions submit URBs. It seems some silicon
  1709. * corrupts things if you reuse completed descriptors very quickly...
  1710. */
  1711. static unsigned
  1712. sitd_complete (
  1713. struct ehci_hcd *ehci,
  1714. struct ehci_sitd *sitd
  1715. ) {
  1716. struct urb *urb = sitd->urb;
  1717. struct usb_iso_packet_descriptor *desc;
  1718. u32 t;
  1719. int urb_index = -1;
  1720. struct ehci_iso_stream *stream = sitd->stream;
  1721. struct usb_device *dev;
  1722. unsigned retval = false;
  1723. urb_index = sitd->index;
  1724. desc = &urb->iso_frame_desc [urb_index];
  1725. t = hc32_to_cpup(ehci, &sitd->hw_results);
  1726. /* report transfer status */
  1727. if (t & SITD_ERRS) {
  1728. urb->error_count++;
  1729. if (t & SITD_STS_DBE)
  1730. desc->status = usb_pipein (urb->pipe)
  1731. ? -ENOSR /* hc couldn't read */
  1732. : -ECOMM; /* hc couldn't write */
  1733. else if (t & SITD_STS_BABBLE)
  1734. desc->status = -EOVERFLOW;
  1735. else /* XACT, MMF, etc */
  1736. desc->status = -EPROTO;
  1737. } else {
  1738. desc->status = 0;
  1739. desc->actual_length = desc->length - SITD_LENGTH(t);
  1740. urb->actual_length += desc->actual_length;
  1741. }
  1742. stream->depth -= stream->interval << 3;
  1743. /* handle completion now? */
  1744. if ((urb_index + 1) != urb->number_of_packets)
  1745. goto done;
  1746. /* ASSERT: it's really the last sitd for this urb
  1747. list_for_each_entry (sitd, &stream->td_list, sitd_list)
  1748. BUG_ON (sitd->urb == urb);
  1749. */
  1750. /* give urb back to the driver; completion often (re)submits */
  1751. dev = urb->dev;
  1752. ehci_urb_done(ehci, urb, 0);
  1753. retval = true;
  1754. urb = NULL;
  1755. (void) disable_periodic(ehci);
  1756. ehci_to_hcd(ehci)->self.bandwidth_isoc_reqs--;
  1757. if (list_is_singular(&stream->td_list)) {
  1758. ehci_to_hcd(ehci)->self.bandwidth_allocated
  1759. -= stream->bandwidth;
  1760. ehci_vdbg (ehci,
  1761. "deschedule devp %s ep%d%s-iso\n",
  1762. dev->devpath, stream->bEndpointAddress & 0x0f,
  1763. (stream->bEndpointAddress & USB_DIR_IN) ? "in" : "out");
  1764. }
  1765. iso_stream_put (ehci, stream);
  1766. /* OK to recycle this SITD now that its completion callback ran. */
  1767. done:
  1768. sitd->urb = NULL;
  1769. sitd->stream = NULL;
  1770. list_move(&sitd->sitd_list, &stream->free_list);
  1771. iso_stream_put(ehci, stream);
  1772. return retval;
  1773. }
  1774. static int sitd_submit (struct ehci_hcd *ehci, struct urb *urb,
  1775. gfp_t mem_flags)
  1776. {
  1777. int status = -EINVAL;
  1778. unsigned long flags;
  1779. struct ehci_iso_stream *stream;
  1780. /* Get iso_stream head */
  1781. stream = iso_stream_find (ehci, urb);
  1782. if (stream == NULL) {
  1783. ehci_dbg (ehci, "can't get iso stream\n");
  1784. return -ENOMEM;
  1785. }
  1786. if (urb->interval != stream->interval) {
  1787. ehci_dbg (ehci, "can't change iso interval %d --> %d\n",
  1788. stream->interval, urb->interval);
  1789. goto done;
  1790. }
  1791. #ifdef EHCI_URB_TRACE
  1792. ehci_dbg (ehci,
  1793. "submit %p dev%s ep%d%s-iso len %d\n",
  1794. urb, urb->dev->devpath,
  1795. usb_pipeendpoint (urb->pipe),
  1796. usb_pipein (urb->pipe) ? "in" : "out",
  1797. urb->transfer_buffer_length);
  1798. #endif
  1799. /* allocate SITDs */
  1800. status = sitd_urb_transaction (stream, ehci, urb, mem_flags);
  1801. if (status < 0) {
  1802. ehci_dbg (ehci, "can't init sitds\n");
  1803. goto done;
  1804. }
  1805. /* schedule ... need to lock */
  1806. spin_lock_irqsave (&ehci->lock, flags);
  1807. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  1808. &ehci_to_hcd(ehci)->flags))) {
  1809. status = -ESHUTDOWN;
  1810. goto done_not_linked;
  1811. }
  1812. status = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  1813. if (unlikely(status))
  1814. goto done_not_linked;
  1815. status = iso_stream_schedule(ehci, urb, stream);
  1816. if (status == 0)
  1817. sitd_link_urb (ehci, urb, ehci->periodic_size << 3, stream);
  1818. else
  1819. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  1820. done_not_linked:
  1821. spin_unlock_irqrestore (&ehci->lock, flags);
  1822. done:
  1823. if (status < 0)
  1824. iso_stream_put (ehci, stream);
  1825. return status;
  1826. }
  1827. /*-------------------------------------------------------------------------*/
  1828. static void free_cached_itd_list(struct ehci_hcd *ehci)
  1829. {
  1830. struct ehci_itd *itd, *n;
  1831. list_for_each_entry_safe(itd, n, &ehci->cached_itd_list, itd_list) {
  1832. struct ehci_iso_stream *stream = itd->stream;
  1833. itd->stream = NULL;
  1834. list_move(&itd->itd_list, &stream->free_list);
  1835. iso_stream_put(ehci, stream);
  1836. }
  1837. }
  1838. /*-------------------------------------------------------------------------*/
  1839. static void
  1840. scan_periodic (struct ehci_hcd *ehci)
  1841. {
  1842. unsigned now_uframe, frame, clock, clock_frame, mod;
  1843. unsigned modified;
  1844. mod = ehci->periodic_size << 3;
  1845. /*
  1846. * When running, scan from last scan point up to "now"
  1847. * else clean up by scanning everything that's left.
  1848. * Touches as few pages as possible: cache-friendly.
  1849. */
  1850. now_uframe = ehci->next_uframe;
  1851. if (HC_IS_RUNNING(ehci_to_hcd(ehci)->state)) {
  1852. clock = ehci_readl(ehci, &ehci->regs->frame_index);
  1853. clock_frame = (clock >> 3) % ehci->periodic_size;
  1854. } else {
  1855. clock = now_uframe + mod - 1;
  1856. clock_frame = -1;
  1857. }
  1858. if (ehci->clock_frame != clock_frame) {
  1859. free_cached_itd_list(ehci);
  1860. ehci->clock_frame = clock_frame;
  1861. }
  1862. clock %= mod;
  1863. clock_frame = clock >> 3;
  1864. for (;;) {
  1865. union ehci_shadow q, *q_p;
  1866. __hc32 type, *hw_p;
  1867. unsigned incomplete = false;
  1868. frame = now_uframe >> 3;
  1869. restart:
  1870. /* scan each element in frame's queue for completions */
  1871. q_p = &ehci->pshadow [frame];
  1872. hw_p = &ehci->periodic [frame];
  1873. q.ptr = q_p->ptr;
  1874. type = Q_NEXT_TYPE(ehci, *hw_p);
  1875. modified = 0;
  1876. while (q.ptr != NULL) {
  1877. unsigned uf;
  1878. union ehci_shadow temp;
  1879. int live;
  1880. live = HC_IS_RUNNING (ehci_to_hcd(ehci)->state);
  1881. switch (hc32_to_cpu(ehci, type)) {
  1882. case Q_TYPE_QH:
  1883. /* handle any completions */
  1884. temp.qh = qh_get (q.qh);
  1885. type = Q_NEXT_TYPE(ehci, q.qh->hw_next);
  1886. q = q.qh->qh_next;
  1887. modified = qh_completions (ehci, temp.qh);
  1888. if (unlikely (list_empty (&temp.qh->qtd_list)))
  1889. intr_deschedule (ehci, temp.qh);
  1890. qh_put (temp.qh);
  1891. break;
  1892. case Q_TYPE_FSTN:
  1893. /* for "save place" FSTNs, look at QH entries
  1894. * in the previous frame for completions.
  1895. */
  1896. if (q.fstn->hw_prev != EHCI_LIST_END(ehci)) {
  1897. dbg ("ignoring completions from FSTNs");
  1898. }
  1899. type = Q_NEXT_TYPE(ehci, q.fstn->hw_next);
  1900. q = q.fstn->fstn_next;
  1901. break;
  1902. case Q_TYPE_ITD:
  1903. /* If this ITD is still active, leave it for
  1904. * later processing ... check the next entry.
  1905. * No need to check for activity unless the
  1906. * frame is current.
  1907. */
  1908. if (frame == clock_frame && live) {
  1909. rmb();
  1910. for (uf = 0; uf < 8; uf++) {
  1911. if (q.itd->hw_transaction[uf] &
  1912. ITD_ACTIVE(ehci))
  1913. break;
  1914. }
  1915. if (uf < 8) {
  1916. incomplete = true;
  1917. q_p = &q.itd->itd_next;
  1918. hw_p = &q.itd->hw_next;
  1919. type = Q_NEXT_TYPE(ehci,
  1920. q.itd->hw_next);
  1921. q = *q_p;
  1922. break;
  1923. }
  1924. }
  1925. /* Take finished ITDs out of the schedule
  1926. * and process them: recycle, maybe report
  1927. * URB completion. HC won't cache the
  1928. * pointer for much longer, if at all.
  1929. */
  1930. *q_p = q.itd->itd_next;
  1931. *hw_p = q.itd->hw_next;
  1932. type = Q_NEXT_TYPE(ehci, q.itd->hw_next);
  1933. wmb();
  1934. modified = itd_complete (ehci, q.itd);
  1935. q = *q_p;
  1936. break;
  1937. case Q_TYPE_SITD:
  1938. /* If this SITD is still active, leave it for
  1939. * later processing ... check the next entry.
  1940. * No need to check for activity unless the
  1941. * frame is current.
  1942. */
  1943. if (frame == clock_frame && live &&
  1944. (q.sitd->hw_results &
  1945. SITD_ACTIVE(ehci))) {
  1946. incomplete = true;
  1947. q_p = &q.sitd->sitd_next;
  1948. hw_p = &q.sitd->hw_next;
  1949. type = Q_NEXT_TYPE(ehci,
  1950. q.sitd->hw_next);
  1951. q = *q_p;
  1952. break;
  1953. }
  1954. /* Take finished SITDs out of the schedule
  1955. * and process them: recycle, maybe report
  1956. * URB completion.
  1957. */
  1958. *q_p = q.sitd->sitd_next;
  1959. *hw_p = q.sitd->hw_next;
  1960. type = Q_NEXT_TYPE(ehci, q.sitd->hw_next);
  1961. wmb();
  1962. modified = sitd_complete (ehci, q.sitd);
  1963. q = *q_p;
  1964. break;
  1965. default:
  1966. dbg ("corrupt type %d frame %d shadow %p",
  1967. type, frame, q.ptr);
  1968. // BUG ();
  1969. q.ptr = NULL;
  1970. }
  1971. /* assume completion callbacks modify the queue */
  1972. if (unlikely (modified)) {
  1973. if (likely(ehci->periodic_sched > 0))
  1974. goto restart;
  1975. /* short-circuit this scan */
  1976. now_uframe = clock;
  1977. break;
  1978. }
  1979. }
  1980. /* If we can tell we caught up to the hardware, stop now.
  1981. * We can't advance our scan without collecting the ISO
  1982. * transfers that are still pending in this frame.
  1983. */
  1984. if (incomplete && HC_IS_RUNNING(ehci_to_hcd(ehci)->state)) {
  1985. ehci->next_uframe = now_uframe;
  1986. break;
  1987. }
  1988. // FIXME: this assumes we won't get lapped when
  1989. // latencies climb; that should be rare, but...
  1990. // detect it, and just go all the way around.
  1991. // FLR might help detect this case, so long as latencies
  1992. // don't exceed periodic_size msec (default 1.024 sec).
  1993. // FIXME: likewise assumes HC doesn't halt mid-scan
  1994. if (now_uframe == clock) {
  1995. unsigned now;
  1996. if (!HC_IS_RUNNING (ehci_to_hcd(ehci)->state)
  1997. || ehci->periodic_sched == 0)
  1998. break;
  1999. ehci->next_uframe = now_uframe;
  2000. now = ehci_readl(ehci, &ehci->regs->frame_index) % mod;
  2001. if (now_uframe == now)
  2002. break;
  2003. /* rescan the rest of this frame, then ... */
  2004. clock = now;
  2005. clock_frame = clock >> 3;
  2006. if (ehci->clock_frame != clock_frame) {
  2007. free_cached_itd_list(ehci);
  2008. ehci->clock_frame = clock_frame;
  2009. }
  2010. } else {
  2011. now_uframe++;
  2012. now_uframe %= mod;
  2013. }
  2014. }
  2015. }