ehci-sched.c 56 KB

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