ehci-sched.c 58 KB

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