qman.c 75 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889
  1. /* Copyright 2008 - 2016 Freescale Semiconductor, Inc.
  2. *
  3. * Redistribution and use in source and binary forms, with or without
  4. * modification, are permitted provided that the following conditions are met:
  5. * * Redistributions of source code must retain the above copyright
  6. * notice, this list of conditions and the following disclaimer.
  7. * * Redistributions in binary form must reproduce the above copyright
  8. * notice, this list of conditions and the following disclaimer in the
  9. * documentation and/or other materials provided with the distribution.
  10. * * Neither the name of Freescale Semiconductor nor the
  11. * names of its contributors may be used to endorse or promote products
  12. * derived from this software without specific prior written permission.
  13. *
  14. * ALTERNATIVELY, this software may be distributed under the terms of the
  15. * GNU General Public License ("GPL") as published by the Free Software
  16. * Foundation, either version 2 of that License or (at your option) any
  17. * later version.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY Freescale Semiconductor ``AS IS'' AND ANY
  20. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  21. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  22. * DISCLAIMED. IN NO EVENT SHALL Freescale Semiconductor BE LIABLE FOR ANY
  23. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  24. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  25. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  26. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  28. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. */
  30. #include "qman_priv.h"
  31. #define DQRR_MAXFILL 15
  32. #define EQCR_ITHRESH 4 /* if EQCR congests, interrupt threshold */
  33. #define IRQNAME "QMan portal %d"
  34. #define MAX_IRQNAME 16 /* big enough for "QMan portal %d" */
  35. #define QMAN_POLL_LIMIT 32
  36. #define QMAN_PIRQ_DQRR_ITHRESH 12
  37. #define QMAN_PIRQ_MR_ITHRESH 4
  38. #define QMAN_PIRQ_IPERIOD 100
  39. /* Portal register assists */
  40. #if defined(CONFIG_ARM) || defined(CONFIG_ARM64)
  41. /* Cache-inhibited register offsets */
  42. #define QM_REG_EQCR_PI_CINH 0x3000
  43. #define QM_REG_EQCR_CI_CINH 0x3040
  44. #define QM_REG_EQCR_ITR 0x3080
  45. #define QM_REG_DQRR_PI_CINH 0x3100
  46. #define QM_REG_DQRR_CI_CINH 0x3140
  47. #define QM_REG_DQRR_ITR 0x3180
  48. #define QM_REG_DQRR_DCAP 0x31C0
  49. #define QM_REG_DQRR_SDQCR 0x3200
  50. #define QM_REG_DQRR_VDQCR 0x3240
  51. #define QM_REG_DQRR_PDQCR 0x3280
  52. #define QM_REG_MR_PI_CINH 0x3300
  53. #define QM_REG_MR_CI_CINH 0x3340
  54. #define QM_REG_MR_ITR 0x3380
  55. #define QM_REG_CFG 0x3500
  56. #define QM_REG_ISR 0x3600
  57. #define QM_REG_IER 0x3640
  58. #define QM_REG_ISDR 0x3680
  59. #define QM_REG_IIR 0x36C0
  60. #define QM_REG_ITPR 0x3740
  61. /* Cache-enabled register offsets */
  62. #define QM_CL_EQCR 0x0000
  63. #define QM_CL_DQRR 0x1000
  64. #define QM_CL_MR 0x2000
  65. #define QM_CL_EQCR_PI_CENA 0x3000
  66. #define QM_CL_EQCR_CI_CENA 0x3040
  67. #define QM_CL_DQRR_PI_CENA 0x3100
  68. #define QM_CL_DQRR_CI_CENA 0x3140
  69. #define QM_CL_MR_PI_CENA 0x3300
  70. #define QM_CL_MR_CI_CENA 0x3340
  71. #define QM_CL_CR 0x3800
  72. #define QM_CL_RR0 0x3900
  73. #define QM_CL_RR1 0x3940
  74. #else
  75. /* Cache-inhibited register offsets */
  76. #define QM_REG_EQCR_PI_CINH 0x0000
  77. #define QM_REG_EQCR_CI_CINH 0x0004
  78. #define QM_REG_EQCR_ITR 0x0008
  79. #define QM_REG_DQRR_PI_CINH 0x0040
  80. #define QM_REG_DQRR_CI_CINH 0x0044
  81. #define QM_REG_DQRR_ITR 0x0048
  82. #define QM_REG_DQRR_DCAP 0x0050
  83. #define QM_REG_DQRR_SDQCR 0x0054
  84. #define QM_REG_DQRR_VDQCR 0x0058
  85. #define QM_REG_DQRR_PDQCR 0x005c
  86. #define QM_REG_MR_PI_CINH 0x0080
  87. #define QM_REG_MR_CI_CINH 0x0084
  88. #define QM_REG_MR_ITR 0x0088
  89. #define QM_REG_CFG 0x0100
  90. #define QM_REG_ISR 0x0e00
  91. #define QM_REG_IER 0x0e04
  92. #define QM_REG_ISDR 0x0e08
  93. #define QM_REG_IIR 0x0e0c
  94. #define QM_REG_ITPR 0x0e14
  95. /* Cache-enabled register offsets */
  96. #define QM_CL_EQCR 0x0000
  97. #define QM_CL_DQRR 0x1000
  98. #define QM_CL_MR 0x2000
  99. #define QM_CL_EQCR_PI_CENA 0x3000
  100. #define QM_CL_EQCR_CI_CENA 0x3100
  101. #define QM_CL_DQRR_PI_CENA 0x3200
  102. #define QM_CL_DQRR_CI_CENA 0x3300
  103. #define QM_CL_MR_PI_CENA 0x3400
  104. #define QM_CL_MR_CI_CENA 0x3500
  105. #define QM_CL_CR 0x3800
  106. #define QM_CL_RR0 0x3900
  107. #define QM_CL_RR1 0x3940
  108. #endif
  109. /*
  110. * BTW, the drivers (and h/w programming model) already obtain the required
  111. * synchronisation for portal accesses and data-dependencies. Use of barrier()s
  112. * or other order-preserving primitives simply degrade performance. Hence the
  113. * use of the __raw_*() interfaces, which simply ensure that the compiler treats
  114. * the portal registers as volatile
  115. */
  116. /* Cache-enabled ring access */
  117. #define qm_cl(base, idx) ((void *)base + ((idx) << 6))
  118. /*
  119. * Portal modes.
  120. * Enum types;
  121. * pmode == production mode
  122. * cmode == consumption mode,
  123. * dmode == h/w dequeue mode.
  124. * Enum values use 3 letter codes. First letter matches the portal mode,
  125. * remaining two letters indicate;
  126. * ci == cache-inhibited portal register
  127. * ce == cache-enabled portal register
  128. * vb == in-band valid-bit (cache-enabled)
  129. * dc == DCA (Discrete Consumption Acknowledgment), DQRR-only
  130. * As for "enum qm_dqrr_dmode", it should be self-explanatory.
  131. */
  132. enum qm_eqcr_pmode { /* matches QCSP_CFG::EPM */
  133. qm_eqcr_pci = 0, /* PI index, cache-inhibited */
  134. qm_eqcr_pce = 1, /* PI index, cache-enabled */
  135. qm_eqcr_pvb = 2 /* valid-bit */
  136. };
  137. enum qm_dqrr_dmode { /* matches QCSP_CFG::DP */
  138. qm_dqrr_dpush = 0, /* SDQCR + VDQCR */
  139. qm_dqrr_dpull = 1 /* PDQCR */
  140. };
  141. enum qm_dqrr_pmode { /* s/w-only */
  142. qm_dqrr_pci, /* reads DQRR_PI_CINH */
  143. qm_dqrr_pce, /* reads DQRR_PI_CENA */
  144. qm_dqrr_pvb /* reads valid-bit */
  145. };
  146. enum qm_dqrr_cmode { /* matches QCSP_CFG::DCM */
  147. qm_dqrr_cci = 0, /* CI index, cache-inhibited */
  148. qm_dqrr_cce = 1, /* CI index, cache-enabled */
  149. qm_dqrr_cdc = 2 /* Discrete Consumption Acknowledgment */
  150. };
  151. enum qm_mr_pmode { /* s/w-only */
  152. qm_mr_pci, /* reads MR_PI_CINH */
  153. qm_mr_pce, /* reads MR_PI_CENA */
  154. qm_mr_pvb /* reads valid-bit */
  155. };
  156. enum qm_mr_cmode { /* matches QCSP_CFG::MM */
  157. qm_mr_cci = 0, /* CI index, cache-inhibited */
  158. qm_mr_cce = 1 /* CI index, cache-enabled */
  159. };
  160. /* --- Portal structures --- */
  161. #define QM_EQCR_SIZE 8
  162. #define QM_DQRR_SIZE 16
  163. #define QM_MR_SIZE 8
  164. /* "Enqueue Command" */
  165. struct qm_eqcr_entry {
  166. u8 _ncw_verb; /* writes to this are non-coherent */
  167. u8 dca;
  168. __be16 seqnum;
  169. u8 __reserved[4];
  170. __be32 fqid; /* 24-bit */
  171. __be32 tag;
  172. struct qm_fd fd;
  173. u8 __reserved3[32];
  174. } __packed __aligned(8);
  175. #define QM_EQCR_VERB_VBIT 0x80
  176. #define QM_EQCR_VERB_CMD_MASK 0x61 /* but only one value; */
  177. #define QM_EQCR_VERB_CMD_ENQUEUE 0x01
  178. #define QM_EQCR_SEQNUM_NESN 0x8000 /* Advance NESN */
  179. #define QM_EQCR_SEQNUM_NLIS 0x4000 /* More fragments to come */
  180. #define QM_EQCR_SEQNUM_SEQMASK 0x3fff /* sequence number goes here */
  181. struct qm_eqcr {
  182. struct qm_eqcr_entry *ring, *cursor;
  183. u8 ci, available, ithresh, vbit;
  184. #ifdef CONFIG_FSL_DPAA_CHECKING
  185. u32 busy;
  186. enum qm_eqcr_pmode pmode;
  187. #endif
  188. };
  189. struct qm_dqrr {
  190. const struct qm_dqrr_entry *ring, *cursor;
  191. u8 pi, ci, fill, ithresh, vbit;
  192. #ifdef CONFIG_FSL_DPAA_CHECKING
  193. enum qm_dqrr_dmode dmode;
  194. enum qm_dqrr_pmode pmode;
  195. enum qm_dqrr_cmode cmode;
  196. #endif
  197. };
  198. struct qm_mr {
  199. union qm_mr_entry *ring, *cursor;
  200. u8 pi, ci, fill, ithresh, vbit;
  201. #ifdef CONFIG_FSL_DPAA_CHECKING
  202. enum qm_mr_pmode pmode;
  203. enum qm_mr_cmode cmode;
  204. #endif
  205. };
  206. /* MC (Management Command) command */
  207. /* "FQ" command layout */
  208. struct qm_mcc_fq {
  209. u8 _ncw_verb;
  210. u8 __reserved1[3];
  211. __be32 fqid; /* 24-bit */
  212. u8 __reserved2[56];
  213. } __packed;
  214. /* "CGR" command layout */
  215. struct qm_mcc_cgr {
  216. u8 _ncw_verb;
  217. u8 __reserved1[30];
  218. u8 cgid;
  219. u8 __reserved2[32];
  220. };
  221. #define QM_MCC_VERB_VBIT 0x80
  222. #define QM_MCC_VERB_MASK 0x7f /* where the verb contains; */
  223. #define QM_MCC_VERB_INITFQ_PARKED 0x40
  224. #define QM_MCC_VERB_INITFQ_SCHED 0x41
  225. #define QM_MCC_VERB_QUERYFQ 0x44
  226. #define QM_MCC_VERB_QUERYFQ_NP 0x45 /* "non-programmable" fields */
  227. #define QM_MCC_VERB_QUERYWQ 0x46
  228. #define QM_MCC_VERB_QUERYWQ_DEDICATED 0x47
  229. #define QM_MCC_VERB_ALTER_SCHED 0x48 /* Schedule FQ */
  230. #define QM_MCC_VERB_ALTER_FE 0x49 /* Force Eligible FQ */
  231. #define QM_MCC_VERB_ALTER_RETIRE 0x4a /* Retire FQ */
  232. #define QM_MCC_VERB_ALTER_OOS 0x4b /* Take FQ out of service */
  233. #define QM_MCC_VERB_ALTER_FQXON 0x4d /* FQ XON */
  234. #define QM_MCC_VERB_ALTER_FQXOFF 0x4e /* FQ XOFF */
  235. #define QM_MCC_VERB_INITCGR 0x50
  236. #define QM_MCC_VERB_MODIFYCGR 0x51
  237. #define QM_MCC_VERB_CGRTESTWRITE 0x52
  238. #define QM_MCC_VERB_QUERYCGR 0x58
  239. #define QM_MCC_VERB_QUERYCONGESTION 0x59
  240. union qm_mc_command {
  241. struct {
  242. u8 _ncw_verb; /* writes to this are non-coherent */
  243. u8 __reserved[63];
  244. };
  245. struct qm_mcc_initfq initfq;
  246. struct qm_mcc_initcgr initcgr;
  247. struct qm_mcc_fq fq;
  248. struct qm_mcc_cgr cgr;
  249. };
  250. /* MC (Management Command) result */
  251. /* "Query FQ" */
  252. struct qm_mcr_queryfq {
  253. u8 verb;
  254. u8 result;
  255. u8 __reserved1[8];
  256. struct qm_fqd fqd; /* the FQD fields are here */
  257. u8 __reserved2[30];
  258. } __packed;
  259. /* "Alter FQ State Commands" */
  260. struct qm_mcr_alterfq {
  261. u8 verb;
  262. u8 result;
  263. u8 fqs; /* Frame Queue Status */
  264. u8 __reserved1[61];
  265. };
  266. #define QM_MCR_VERB_RRID 0x80
  267. #define QM_MCR_VERB_MASK QM_MCC_VERB_MASK
  268. #define QM_MCR_VERB_INITFQ_PARKED QM_MCC_VERB_INITFQ_PARKED
  269. #define QM_MCR_VERB_INITFQ_SCHED QM_MCC_VERB_INITFQ_SCHED
  270. #define QM_MCR_VERB_QUERYFQ QM_MCC_VERB_QUERYFQ
  271. #define QM_MCR_VERB_QUERYFQ_NP QM_MCC_VERB_QUERYFQ_NP
  272. #define QM_MCR_VERB_QUERYWQ QM_MCC_VERB_QUERYWQ
  273. #define QM_MCR_VERB_QUERYWQ_DEDICATED QM_MCC_VERB_QUERYWQ_DEDICATED
  274. #define QM_MCR_VERB_ALTER_SCHED QM_MCC_VERB_ALTER_SCHED
  275. #define QM_MCR_VERB_ALTER_FE QM_MCC_VERB_ALTER_FE
  276. #define QM_MCR_VERB_ALTER_RETIRE QM_MCC_VERB_ALTER_RETIRE
  277. #define QM_MCR_VERB_ALTER_OOS QM_MCC_VERB_ALTER_OOS
  278. #define QM_MCR_RESULT_NULL 0x00
  279. #define QM_MCR_RESULT_OK 0xf0
  280. #define QM_MCR_RESULT_ERR_FQID 0xf1
  281. #define QM_MCR_RESULT_ERR_FQSTATE 0xf2
  282. #define QM_MCR_RESULT_ERR_NOTEMPTY 0xf3 /* OOS fails if FQ is !empty */
  283. #define QM_MCR_RESULT_ERR_BADCHANNEL 0xf4
  284. #define QM_MCR_RESULT_PENDING 0xf8
  285. #define QM_MCR_RESULT_ERR_BADCOMMAND 0xff
  286. #define QM_MCR_FQS_ORLPRESENT 0x02 /* ORL fragments to come */
  287. #define QM_MCR_FQS_NOTEMPTY 0x01 /* FQ has enqueued frames */
  288. #define QM_MCR_TIMEOUT 10000 /* us */
  289. union qm_mc_result {
  290. struct {
  291. u8 verb;
  292. u8 result;
  293. u8 __reserved1[62];
  294. };
  295. struct qm_mcr_queryfq queryfq;
  296. struct qm_mcr_alterfq alterfq;
  297. struct qm_mcr_querycgr querycgr;
  298. struct qm_mcr_querycongestion querycongestion;
  299. struct qm_mcr_querywq querywq;
  300. struct qm_mcr_queryfq_np queryfq_np;
  301. };
  302. struct qm_mc {
  303. union qm_mc_command *cr;
  304. union qm_mc_result *rr;
  305. u8 rridx, vbit;
  306. #ifdef CONFIG_FSL_DPAA_CHECKING
  307. enum {
  308. /* Can be _mc_start()ed */
  309. qman_mc_idle,
  310. /* Can be _mc_commit()ed or _mc_abort()ed */
  311. qman_mc_user,
  312. /* Can only be _mc_retry()ed */
  313. qman_mc_hw
  314. } state;
  315. #endif
  316. };
  317. struct qm_addr {
  318. void *ce; /* cache-enabled */
  319. __be32 *ce_be; /* same value as above but for direct access */
  320. void __iomem *ci; /* cache-inhibited */
  321. };
  322. struct qm_portal {
  323. /*
  324. * In the non-CONFIG_FSL_DPAA_CHECKING case, the following stuff up to
  325. * and including 'mc' fits within a cacheline (yay!). The 'config' part
  326. * is setup-only, so isn't a cause for a concern. In other words, don't
  327. * rearrange this structure on a whim, there be dragons ...
  328. */
  329. struct qm_addr addr;
  330. struct qm_eqcr eqcr;
  331. struct qm_dqrr dqrr;
  332. struct qm_mr mr;
  333. struct qm_mc mc;
  334. } ____cacheline_aligned;
  335. /* Cache-inhibited register access. */
  336. static inline u32 qm_in(struct qm_portal *p, u32 offset)
  337. {
  338. return ioread32be(p->addr.ci + offset);
  339. }
  340. static inline void qm_out(struct qm_portal *p, u32 offset, u32 val)
  341. {
  342. iowrite32be(val, p->addr.ci + offset);
  343. }
  344. /* Cache Enabled Portal Access */
  345. static inline void qm_cl_invalidate(struct qm_portal *p, u32 offset)
  346. {
  347. dpaa_invalidate(p->addr.ce + offset);
  348. }
  349. static inline void qm_cl_touch_ro(struct qm_portal *p, u32 offset)
  350. {
  351. dpaa_touch_ro(p->addr.ce + offset);
  352. }
  353. static inline u32 qm_ce_in(struct qm_portal *p, u32 offset)
  354. {
  355. return be32_to_cpu(*(p->addr.ce_be + (offset/4)));
  356. }
  357. /* --- EQCR API --- */
  358. #define EQCR_SHIFT ilog2(sizeof(struct qm_eqcr_entry))
  359. #define EQCR_CARRY (uintptr_t)(QM_EQCR_SIZE << EQCR_SHIFT)
  360. /* Bit-wise logic to wrap a ring pointer by clearing the "carry bit" */
  361. static struct qm_eqcr_entry *eqcr_carryclear(struct qm_eqcr_entry *p)
  362. {
  363. uintptr_t addr = (uintptr_t)p;
  364. addr &= ~EQCR_CARRY;
  365. return (struct qm_eqcr_entry *)addr;
  366. }
  367. /* Bit-wise logic to convert a ring pointer to a ring index */
  368. static int eqcr_ptr2idx(struct qm_eqcr_entry *e)
  369. {
  370. return ((uintptr_t)e >> EQCR_SHIFT) & (QM_EQCR_SIZE - 1);
  371. }
  372. /* Increment the 'cursor' ring pointer, taking 'vbit' into account */
  373. static inline void eqcr_inc(struct qm_eqcr *eqcr)
  374. {
  375. /* increment to the next EQCR pointer and handle overflow and 'vbit' */
  376. struct qm_eqcr_entry *partial = eqcr->cursor + 1;
  377. eqcr->cursor = eqcr_carryclear(partial);
  378. if (partial != eqcr->cursor)
  379. eqcr->vbit ^= QM_EQCR_VERB_VBIT;
  380. }
  381. static inline int qm_eqcr_init(struct qm_portal *portal,
  382. enum qm_eqcr_pmode pmode,
  383. unsigned int eq_stash_thresh,
  384. int eq_stash_prio)
  385. {
  386. struct qm_eqcr *eqcr = &portal->eqcr;
  387. u32 cfg;
  388. u8 pi;
  389. eqcr->ring = portal->addr.ce + QM_CL_EQCR;
  390. eqcr->ci = qm_in(portal, QM_REG_EQCR_CI_CINH) & (QM_EQCR_SIZE - 1);
  391. qm_cl_invalidate(portal, QM_CL_EQCR_CI_CENA);
  392. pi = qm_in(portal, QM_REG_EQCR_PI_CINH) & (QM_EQCR_SIZE - 1);
  393. eqcr->cursor = eqcr->ring + pi;
  394. eqcr->vbit = (qm_in(portal, QM_REG_EQCR_PI_CINH) & QM_EQCR_SIZE) ?
  395. QM_EQCR_VERB_VBIT : 0;
  396. eqcr->available = QM_EQCR_SIZE - 1 -
  397. dpaa_cyc_diff(QM_EQCR_SIZE, eqcr->ci, pi);
  398. eqcr->ithresh = qm_in(portal, QM_REG_EQCR_ITR);
  399. #ifdef CONFIG_FSL_DPAA_CHECKING
  400. eqcr->busy = 0;
  401. eqcr->pmode = pmode;
  402. #endif
  403. cfg = (qm_in(portal, QM_REG_CFG) & 0x00ffffff) |
  404. (eq_stash_thresh << 28) | /* QCSP_CFG: EST */
  405. (eq_stash_prio << 26) | /* QCSP_CFG: EP */
  406. ((pmode & 0x3) << 24); /* QCSP_CFG::EPM */
  407. qm_out(portal, QM_REG_CFG, cfg);
  408. return 0;
  409. }
  410. static inline unsigned int qm_eqcr_get_ci_stashing(struct qm_portal *portal)
  411. {
  412. return (qm_in(portal, QM_REG_CFG) >> 28) & 0x7;
  413. }
  414. static inline void qm_eqcr_finish(struct qm_portal *portal)
  415. {
  416. struct qm_eqcr *eqcr = &portal->eqcr;
  417. u8 pi = qm_in(portal, QM_REG_EQCR_PI_CINH) & (QM_EQCR_SIZE - 1);
  418. u8 ci = qm_in(portal, QM_REG_EQCR_CI_CINH) & (QM_EQCR_SIZE - 1);
  419. DPAA_ASSERT(!eqcr->busy);
  420. if (pi != eqcr_ptr2idx(eqcr->cursor))
  421. pr_crit("losing uncommitted EQCR entries\n");
  422. if (ci != eqcr->ci)
  423. pr_crit("missing existing EQCR completions\n");
  424. if (eqcr->ci != eqcr_ptr2idx(eqcr->cursor))
  425. pr_crit("EQCR destroyed unquiesced\n");
  426. }
  427. static inline struct qm_eqcr_entry *qm_eqcr_start_no_stash(struct qm_portal
  428. *portal)
  429. {
  430. struct qm_eqcr *eqcr = &portal->eqcr;
  431. DPAA_ASSERT(!eqcr->busy);
  432. if (!eqcr->available)
  433. return NULL;
  434. #ifdef CONFIG_FSL_DPAA_CHECKING
  435. eqcr->busy = 1;
  436. #endif
  437. dpaa_zero(eqcr->cursor);
  438. return eqcr->cursor;
  439. }
  440. static inline struct qm_eqcr_entry *qm_eqcr_start_stash(struct qm_portal
  441. *portal)
  442. {
  443. struct qm_eqcr *eqcr = &portal->eqcr;
  444. u8 diff, old_ci;
  445. DPAA_ASSERT(!eqcr->busy);
  446. if (!eqcr->available) {
  447. old_ci = eqcr->ci;
  448. eqcr->ci = qm_ce_in(portal, QM_CL_EQCR_CI_CENA) &
  449. (QM_EQCR_SIZE - 1);
  450. diff = dpaa_cyc_diff(QM_EQCR_SIZE, old_ci, eqcr->ci);
  451. eqcr->available += diff;
  452. if (!diff)
  453. return NULL;
  454. }
  455. #ifdef CONFIG_FSL_DPAA_CHECKING
  456. eqcr->busy = 1;
  457. #endif
  458. dpaa_zero(eqcr->cursor);
  459. return eqcr->cursor;
  460. }
  461. static inline void eqcr_commit_checks(struct qm_eqcr *eqcr)
  462. {
  463. DPAA_ASSERT(eqcr->busy);
  464. DPAA_ASSERT(!(be32_to_cpu(eqcr->cursor->fqid) & ~QM_FQID_MASK));
  465. DPAA_ASSERT(eqcr->available >= 1);
  466. }
  467. static inline void qm_eqcr_pvb_commit(struct qm_portal *portal, u8 myverb)
  468. {
  469. struct qm_eqcr *eqcr = &portal->eqcr;
  470. struct qm_eqcr_entry *eqcursor;
  471. eqcr_commit_checks(eqcr);
  472. DPAA_ASSERT(eqcr->pmode == qm_eqcr_pvb);
  473. dma_wmb();
  474. eqcursor = eqcr->cursor;
  475. eqcursor->_ncw_verb = myverb | eqcr->vbit;
  476. dpaa_flush(eqcursor);
  477. eqcr_inc(eqcr);
  478. eqcr->available--;
  479. #ifdef CONFIG_FSL_DPAA_CHECKING
  480. eqcr->busy = 0;
  481. #endif
  482. }
  483. static inline void qm_eqcr_cce_prefetch(struct qm_portal *portal)
  484. {
  485. qm_cl_touch_ro(portal, QM_CL_EQCR_CI_CENA);
  486. }
  487. static inline u8 qm_eqcr_cce_update(struct qm_portal *portal)
  488. {
  489. struct qm_eqcr *eqcr = &portal->eqcr;
  490. u8 diff, old_ci = eqcr->ci;
  491. eqcr->ci = qm_ce_in(portal, QM_CL_EQCR_CI_CENA) & (QM_EQCR_SIZE - 1);
  492. qm_cl_invalidate(portal, QM_CL_EQCR_CI_CENA);
  493. diff = dpaa_cyc_diff(QM_EQCR_SIZE, old_ci, eqcr->ci);
  494. eqcr->available += diff;
  495. return diff;
  496. }
  497. static inline void qm_eqcr_set_ithresh(struct qm_portal *portal, u8 ithresh)
  498. {
  499. struct qm_eqcr *eqcr = &portal->eqcr;
  500. eqcr->ithresh = ithresh;
  501. qm_out(portal, QM_REG_EQCR_ITR, ithresh);
  502. }
  503. static inline u8 qm_eqcr_get_avail(struct qm_portal *portal)
  504. {
  505. struct qm_eqcr *eqcr = &portal->eqcr;
  506. return eqcr->available;
  507. }
  508. static inline u8 qm_eqcr_get_fill(struct qm_portal *portal)
  509. {
  510. struct qm_eqcr *eqcr = &portal->eqcr;
  511. return QM_EQCR_SIZE - 1 - eqcr->available;
  512. }
  513. /* --- DQRR API --- */
  514. #define DQRR_SHIFT ilog2(sizeof(struct qm_dqrr_entry))
  515. #define DQRR_CARRY (uintptr_t)(QM_DQRR_SIZE << DQRR_SHIFT)
  516. static const struct qm_dqrr_entry *dqrr_carryclear(
  517. const struct qm_dqrr_entry *p)
  518. {
  519. uintptr_t addr = (uintptr_t)p;
  520. addr &= ~DQRR_CARRY;
  521. return (const struct qm_dqrr_entry *)addr;
  522. }
  523. static inline int dqrr_ptr2idx(const struct qm_dqrr_entry *e)
  524. {
  525. return ((uintptr_t)e >> DQRR_SHIFT) & (QM_DQRR_SIZE - 1);
  526. }
  527. static const struct qm_dqrr_entry *dqrr_inc(const struct qm_dqrr_entry *e)
  528. {
  529. return dqrr_carryclear(e + 1);
  530. }
  531. static inline void qm_dqrr_set_maxfill(struct qm_portal *portal, u8 mf)
  532. {
  533. qm_out(portal, QM_REG_CFG, (qm_in(portal, QM_REG_CFG) & 0xff0fffff) |
  534. ((mf & (QM_DQRR_SIZE - 1)) << 20));
  535. }
  536. static inline int qm_dqrr_init(struct qm_portal *portal,
  537. const struct qm_portal_config *config,
  538. enum qm_dqrr_dmode dmode,
  539. enum qm_dqrr_pmode pmode,
  540. enum qm_dqrr_cmode cmode, u8 max_fill)
  541. {
  542. struct qm_dqrr *dqrr = &portal->dqrr;
  543. u32 cfg;
  544. /* Make sure the DQRR will be idle when we enable */
  545. qm_out(portal, QM_REG_DQRR_SDQCR, 0);
  546. qm_out(portal, QM_REG_DQRR_VDQCR, 0);
  547. qm_out(portal, QM_REG_DQRR_PDQCR, 0);
  548. dqrr->ring = portal->addr.ce + QM_CL_DQRR;
  549. dqrr->pi = qm_in(portal, QM_REG_DQRR_PI_CINH) & (QM_DQRR_SIZE - 1);
  550. dqrr->ci = qm_in(portal, QM_REG_DQRR_CI_CINH) & (QM_DQRR_SIZE - 1);
  551. dqrr->cursor = dqrr->ring + dqrr->ci;
  552. dqrr->fill = dpaa_cyc_diff(QM_DQRR_SIZE, dqrr->ci, dqrr->pi);
  553. dqrr->vbit = (qm_in(portal, QM_REG_DQRR_PI_CINH) & QM_DQRR_SIZE) ?
  554. QM_DQRR_VERB_VBIT : 0;
  555. dqrr->ithresh = qm_in(portal, QM_REG_DQRR_ITR);
  556. #ifdef CONFIG_FSL_DPAA_CHECKING
  557. dqrr->dmode = dmode;
  558. dqrr->pmode = pmode;
  559. dqrr->cmode = cmode;
  560. #endif
  561. /* Invalidate every ring entry before beginning */
  562. for (cfg = 0; cfg < QM_DQRR_SIZE; cfg++)
  563. dpaa_invalidate(qm_cl(dqrr->ring, cfg));
  564. cfg = (qm_in(portal, QM_REG_CFG) & 0xff000f00) |
  565. ((max_fill & (QM_DQRR_SIZE - 1)) << 20) | /* DQRR_MF */
  566. ((dmode & 1) << 18) | /* DP */
  567. ((cmode & 3) << 16) | /* DCM */
  568. 0xa0 | /* RE+SE */
  569. (0 ? 0x40 : 0) | /* Ignore RP */
  570. (0 ? 0x10 : 0); /* Ignore SP */
  571. qm_out(portal, QM_REG_CFG, cfg);
  572. qm_dqrr_set_maxfill(portal, max_fill);
  573. return 0;
  574. }
  575. static inline void qm_dqrr_finish(struct qm_portal *portal)
  576. {
  577. #ifdef CONFIG_FSL_DPAA_CHECKING
  578. struct qm_dqrr *dqrr = &portal->dqrr;
  579. if (dqrr->cmode != qm_dqrr_cdc &&
  580. dqrr->ci != dqrr_ptr2idx(dqrr->cursor))
  581. pr_crit("Ignoring completed DQRR entries\n");
  582. #endif
  583. }
  584. static inline const struct qm_dqrr_entry *qm_dqrr_current(
  585. struct qm_portal *portal)
  586. {
  587. struct qm_dqrr *dqrr = &portal->dqrr;
  588. if (!dqrr->fill)
  589. return NULL;
  590. return dqrr->cursor;
  591. }
  592. static inline u8 qm_dqrr_next(struct qm_portal *portal)
  593. {
  594. struct qm_dqrr *dqrr = &portal->dqrr;
  595. DPAA_ASSERT(dqrr->fill);
  596. dqrr->cursor = dqrr_inc(dqrr->cursor);
  597. return --dqrr->fill;
  598. }
  599. static inline void qm_dqrr_pvb_update(struct qm_portal *portal)
  600. {
  601. struct qm_dqrr *dqrr = &portal->dqrr;
  602. struct qm_dqrr_entry *res = qm_cl(dqrr->ring, dqrr->pi);
  603. DPAA_ASSERT(dqrr->pmode == qm_dqrr_pvb);
  604. #ifndef CONFIG_FSL_PAMU
  605. /*
  606. * If PAMU is not available we need to invalidate the cache.
  607. * When PAMU is available the cache is updated by stash
  608. */
  609. dpaa_invalidate_touch_ro(res);
  610. #endif
  611. if ((res->verb & QM_DQRR_VERB_VBIT) == dqrr->vbit) {
  612. dqrr->pi = (dqrr->pi + 1) & (QM_DQRR_SIZE - 1);
  613. if (!dqrr->pi)
  614. dqrr->vbit ^= QM_DQRR_VERB_VBIT;
  615. dqrr->fill++;
  616. }
  617. }
  618. static inline void qm_dqrr_cdc_consume_1ptr(struct qm_portal *portal,
  619. const struct qm_dqrr_entry *dq,
  620. int park)
  621. {
  622. __maybe_unused struct qm_dqrr *dqrr = &portal->dqrr;
  623. int idx = dqrr_ptr2idx(dq);
  624. DPAA_ASSERT(dqrr->cmode == qm_dqrr_cdc);
  625. DPAA_ASSERT((dqrr->ring + idx) == dq);
  626. DPAA_ASSERT(idx < QM_DQRR_SIZE);
  627. qm_out(portal, QM_REG_DQRR_DCAP, (0 << 8) | /* DQRR_DCAP::S */
  628. ((park ? 1 : 0) << 6) | /* DQRR_DCAP::PK */
  629. idx); /* DQRR_DCAP::DCAP_CI */
  630. }
  631. static inline void qm_dqrr_cdc_consume_n(struct qm_portal *portal, u32 bitmask)
  632. {
  633. __maybe_unused struct qm_dqrr *dqrr = &portal->dqrr;
  634. DPAA_ASSERT(dqrr->cmode == qm_dqrr_cdc);
  635. qm_out(portal, QM_REG_DQRR_DCAP, (1 << 8) | /* DQRR_DCAP::S */
  636. (bitmask << 16)); /* DQRR_DCAP::DCAP_CI */
  637. }
  638. static inline void qm_dqrr_sdqcr_set(struct qm_portal *portal, u32 sdqcr)
  639. {
  640. qm_out(portal, QM_REG_DQRR_SDQCR, sdqcr);
  641. }
  642. static inline void qm_dqrr_vdqcr_set(struct qm_portal *portal, u32 vdqcr)
  643. {
  644. qm_out(portal, QM_REG_DQRR_VDQCR, vdqcr);
  645. }
  646. static inline void qm_dqrr_set_ithresh(struct qm_portal *portal, u8 ithresh)
  647. {
  648. qm_out(portal, QM_REG_DQRR_ITR, ithresh);
  649. }
  650. /* --- MR API --- */
  651. #define MR_SHIFT ilog2(sizeof(union qm_mr_entry))
  652. #define MR_CARRY (uintptr_t)(QM_MR_SIZE << MR_SHIFT)
  653. static union qm_mr_entry *mr_carryclear(union qm_mr_entry *p)
  654. {
  655. uintptr_t addr = (uintptr_t)p;
  656. addr &= ~MR_CARRY;
  657. return (union qm_mr_entry *)addr;
  658. }
  659. static inline int mr_ptr2idx(const union qm_mr_entry *e)
  660. {
  661. return ((uintptr_t)e >> MR_SHIFT) & (QM_MR_SIZE - 1);
  662. }
  663. static inline union qm_mr_entry *mr_inc(union qm_mr_entry *e)
  664. {
  665. return mr_carryclear(e + 1);
  666. }
  667. static inline int qm_mr_init(struct qm_portal *portal, enum qm_mr_pmode pmode,
  668. enum qm_mr_cmode cmode)
  669. {
  670. struct qm_mr *mr = &portal->mr;
  671. u32 cfg;
  672. mr->ring = portal->addr.ce + QM_CL_MR;
  673. mr->pi = qm_in(portal, QM_REG_MR_PI_CINH) & (QM_MR_SIZE - 1);
  674. mr->ci = qm_in(portal, QM_REG_MR_CI_CINH) & (QM_MR_SIZE - 1);
  675. mr->cursor = mr->ring + mr->ci;
  676. mr->fill = dpaa_cyc_diff(QM_MR_SIZE, mr->ci, mr->pi);
  677. mr->vbit = (qm_in(portal, QM_REG_MR_PI_CINH) & QM_MR_SIZE)
  678. ? QM_MR_VERB_VBIT : 0;
  679. mr->ithresh = qm_in(portal, QM_REG_MR_ITR);
  680. #ifdef CONFIG_FSL_DPAA_CHECKING
  681. mr->pmode = pmode;
  682. mr->cmode = cmode;
  683. #endif
  684. cfg = (qm_in(portal, QM_REG_CFG) & 0xfffff0ff) |
  685. ((cmode & 1) << 8); /* QCSP_CFG:MM */
  686. qm_out(portal, QM_REG_CFG, cfg);
  687. return 0;
  688. }
  689. static inline void qm_mr_finish(struct qm_portal *portal)
  690. {
  691. struct qm_mr *mr = &portal->mr;
  692. if (mr->ci != mr_ptr2idx(mr->cursor))
  693. pr_crit("Ignoring completed MR entries\n");
  694. }
  695. static inline const union qm_mr_entry *qm_mr_current(struct qm_portal *portal)
  696. {
  697. struct qm_mr *mr = &portal->mr;
  698. if (!mr->fill)
  699. return NULL;
  700. return mr->cursor;
  701. }
  702. static inline int qm_mr_next(struct qm_portal *portal)
  703. {
  704. struct qm_mr *mr = &portal->mr;
  705. DPAA_ASSERT(mr->fill);
  706. mr->cursor = mr_inc(mr->cursor);
  707. return --mr->fill;
  708. }
  709. static inline void qm_mr_pvb_update(struct qm_portal *portal)
  710. {
  711. struct qm_mr *mr = &portal->mr;
  712. union qm_mr_entry *res = qm_cl(mr->ring, mr->pi);
  713. DPAA_ASSERT(mr->pmode == qm_mr_pvb);
  714. if ((res->verb & QM_MR_VERB_VBIT) == mr->vbit) {
  715. mr->pi = (mr->pi + 1) & (QM_MR_SIZE - 1);
  716. if (!mr->pi)
  717. mr->vbit ^= QM_MR_VERB_VBIT;
  718. mr->fill++;
  719. res = mr_inc(res);
  720. }
  721. dpaa_invalidate_touch_ro(res);
  722. }
  723. static inline void qm_mr_cci_consume(struct qm_portal *portal, u8 num)
  724. {
  725. struct qm_mr *mr = &portal->mr;
  726. DPAA_ASSERT(mr->cmode == qm_mr_cci);
  727. mr->ci = (mr->ci + num) & (QM_MR_SIZE - 1);
  728. qm_out(portal, QM_REG_MR_CI_CINH, mr->ci);
  729. }
  730. static inline void qm_mr_cci_consume_to_current(struct qm_portal *portal)
  731. {
  732. struct qm_mr *mr = &portal->mr;
  733. DPAA_ASSERT(mr->cmode == qm_mr_cci);
  734. mr->ci = mr_ptr2idx(mr->cursor);
  735. qm_out(portal, QM_REG_MR_CI_CINH, mr->ci);
  736. }
  737. static inline void qm_mr_set_ithresh(struct qm_portal *portal, u8 ithresh)
  738. {
  739. qm_out(portal, QM_REG_MR_ITR, ithresh);
  740. }
  741. /* --- Management command API --- */
  742. static inline int qm_mc_init(struct qm_portal *portal)
  743. {
  744. struct qm_mc *mc = &portal->mc;
  745. mc->cr = portal->addr.ce + QM_CL_CR;
  746. mc->rr = portal->addr.ce + QM_CL_RR0;
  747. mc->rridx = (mc->cr->_ncw_verb & QM_MCC_VERB_VBIT)
  748. ? 0 : 1;
  749. mc->vbit = mc->rridx ? QM_MCC_VERB_VBIT : 0;
  750. #ifdef CONFIG_FSL_DPAA_CHECKING
  751. mc->state = qman_mc_idle;
  752. #endif
  753. return 0;
  754. }
  755. static inline void qm_mc_finish(struct qm_portal *portal)
  756. {
  757. #ifdef CONFIG_FSL_DPAA_CHECKING
  758. struct qm_mc *mc = &portal->mc;
  759. DPAA_ASSERT(mc->state == qman_mc_idle);
  760. if (mc->state != qman_mc_idle)
  761. pr_crit("Losing incomplete MC command\n");
  762. #endif
  763. }
  764. static inline union qm_mc_command *qm_mc_start(struct qm_portal *portal)
  765. {
  766. struct qm_mc *mc = &portal->mc;
  767. DPAA_ASSERT(mc->state == qman_mc_idle);
  768. #ifdef CONFIG_FSL_DPAA_CHECKING
  769. mc->state = qman_mc_user;
  770. #endif
  771. dpaa_zero(mc->cr);
  772. return mc->cr;
  773. }
  774. static inline void qm_mc_commit(struct qm_portal *portal, u8 myverb)
  775. {
  776. struct qm_mc *mc = &portal->mc;
  777. union qm_mc_result *rr = mc->rr + mc->rridx;
  778. DPAA_ASSERT(mc->state == qman_mc_user);
  779. dma_wmb();
  780. mc->cr->_ncw_verb = myverb | mc->vbit;
  781. dpaa_flush(mc->cr);
  782. dpaa_invalidate_touch_ro(rr);
  783. #ifdef CONFIG_FSL_DPAA_CHECKING
  784. mc->state = qman_mc_hw;
  785. #endif
  786. }
  787. static inline union qm_mc_result *qm_mc_result(struct qm_portal *portal)
  788. {
  789. struct qm_mc *mc = &portal->mc;
  790. union qm_mc_result *rr = mc->rr + mc->rridx;
  791. DPAA_ASSERT(mc->state == qman_mc_hw);
  792. /*
  793. * The inactive response register's verb byte always returns zero until
  794. * its command is submitted and completed. This includes the valid-bit,
  795. * in case you were wondering...
  796. */
  797. if (!rr->verb) {
  798. dpaa_invalidate_touch_ro(rr);
  799. return NULL;
  800. }
  801. mc->rridx ^= 1;
  802. mc->vbit ^= QM_MCC_VERB_VBIT;
  803. #ifdef CONFIG_FSL_DPAA_CHECKING
  804. mc->state = qman_mc_idle;
  805. #endif
  806. return rr;
  807. }
  808. static inline int qm_mc_result_timeout(struct qm_portal *portal,
  809. union qm_mc_result **mcr)
  810. {
  811. int timeout = QM_MCR_TIMEOUT;
  812. do {
  813. *mcr = qm_mc_result(portal);
  814. if (*mcr)
  815. break;
  816. udelay(1);
  817. } while (--timeout);
  818. return timeout;
  819. }
  820. static inline void fq_set(struct qman_fq *fq, u32 mask)
  821. {
  822. fq->flags |= mask;
  823. }
  824. static inline void fq_clear(struct qman_fq *fq, u32 mask)
  825. {
  826. fq->flags &= ~mask;
  827. }
  828. static inline int fq_isset(struct qman_fq *fq, u32 mask)
  829. {
  830. return fq->flags & mask;
  831. }
  832. static inline int fq_isclear(struct qman_fq *fq, u32 mask)
  833. {
  834. return !(fq->flags & mask);
  835. }
  836. struct qman_portal {
  837. struct qm_portal p;
  838. /* PORTAL_BITS_*** - dynamic, strictly internal */
  839. unsigned long bits;
  840. /* interrupt sources processed by portal_isr(), configurable */
  841. unsigned long irq_sources;
  842. u32 use_eqcr_ci_stashing;
  843. /* only 1 volatile dequeue at a time */
  844. struct qman_fq *vdqcr_owned;
  845. u32 sdqcr;
  846. /* probing time config params for cpu-affine portals */
  847. const struct qm_portal_config *config;
  848. /* 2-element array. cgrs[0] is mask, cgrs[1] is snapshot. */
  849. struct qman_cgrs *cgrs;
  850. /* linked-list of CSCN handlers. */
  851. struct list_head cgr_cbs;
  852. /* list lock */
  853. spinlock_t cgr_lock;
  854. struct work_struct congestion_work;
  855. struct work_struct mr_work;
  856. char irqname[MAX_IRQNAME];
  857. };
  858. static cpumask_t affine_mask;
  859. static DEFINE_SPINLOCK(affine_mask_lock);
  860. static u16 affine_channels[NR_CPUS];
  861. static DEFINE_PER_CPU(struct qman_portal, qman_affine_portal);
  862. struct qman_portal *affine_portals[NR_CPUS];
  863. static inline struct qman_portal *get_affine_portal(void)
  864. {
  865. return &get_cpu_var(qman_affine_portal);
  866. }
  867. static inline void put_affine_portal(void)
  868. {
  869. put_cpu_var(qman_affine_portal);
  870. }
  871. static struct workqueue_struct *qm_portal_wq;
  872. int qman_wq_alloc(void)
  873. {
  874. qm_portal_wq = alloc_workqueue("qman_portal_wq", 0, 1);
  875. if (!qm_portal_wq)
  876. return -ENOMEM;
  877. return 0;
  878. }
  879. /*
  880. * This is what everything can wait on, even if it migrates to a different cpu
  881. * to the one whose affine portal it is waiting on.
  882. */
  883. static DECLARE_WAIT_QUEUE_HEAD(affine_queue);
  884. static struct qman_fq **fq_table;
  885. static u32 num_fqids;
  886. int qman_alloc_fq_table(u32 _num_fqids)
  887. {
  888. num_fqids = _num_fqids;
  889. fq_table = vzalloc(array3_size(sizeof(struct qman_fq *),
  890. num_fqids, 2));
  891. if (!fq_table)
  892. return -ENOMEM;
  893. pr_debug("Allocated fq lookup table at %p, entry count %u\n",
  894. fq_table, num_fqids * 2);
  895. return 0;
  896. }
  897. static struct qman_fq *idx_to_fq(u32 idx)
  898. {
  899. struct qman_fq *fq;
  900. #ifdef CONFIG_FSL_DPAA_CHECKING
  901. if (WARN_ON(idx >= num_fqids * 2))
  902. return NULL;
  903. #endif
  904. fq = fq_table[idx];
  905. DPAA_ASSERT(!fq || idx == fq->idx);
  906. return fq;
  907. }
  908. /*
  909. * Only returns full-service fq objects, not enqueue-only
  910. * references (QMAN_FQ_FLAG_NO_MODIFY).
  911. */
  912. static struct qman_fq *fqid_to_fq(u32 fqid)
  913. {
  914. return idx_to_fq(fqid * 2);
  915. }
  916. static struct qman_fq *tag_to_fq(u32 tag)
  917. {
  918. #if BITS_PER_LONG == 64
  919. return idx_to_fq(tag);
  920. #else
  921. return (struct qman_fq *)tag;
  922. #endif
  923. }
  924. static u32 fq_to_tag(struct qman_fq *fq)
  925. {
  926. #if BITS_PER_LONG == 64
  927. return fq->idx;
  928. #else
  929. return (u32)fq;
  930. #endif
  931. }
  932. static u32 __poll_portal_slow(struct qman_portal *p, u32 is);
  933. static inline unsigned int __poll_portal_fast(struct qman_portal *p,
  934. unsigned int poll_limit);
  935. static void qm_congestion_task(struct work_struct *work);
  936. static void qm_mr_process_task(struct work_struct *work);
  937. static irqreturn_t portal_isr(int irq, void *ptr)
  938. {
  939. struct qman_portal *p = ptr;
  940. u32 is = qm_in(&p->p, QM_REG_ISR) & p->irq_sources;
  941. u32 clear = 0;
  942. if (unlikely(!is))
  943. return IRQ_NONE;
  944. /* DQRR-handling if it's interrupt-driven */
  945. if (is & QM_PIRQ_DQRI) {
  946. __poll_portal_fast(p, QMAN_POLL_LIMIT);
  947. clear = QM_DQAVAIL_MASK | QM_PIRQ_DQRI;
  948. }
  949. /* Handling of anything else that's interrupt-driven */
  950. clear |= __poll_portal_slow(p, is) & QM_PIRQ_SLOW;
  951. qm_out(&p->p, QM_REG_ISR, clear);
  952. return IRQ_HANDLED;
  953. }
  954. static int drain_mr_fqrni(struct qm_portal *p)
  955. {
  956. const union qm_mr_entry *msg;
  957. loop:
  958. msg = qm_mr_current(p);
  959. if (!msg) {
  960. /*
  961. * if MR was full and h/w had other FQRNI entries to produce, we
  962. * need to allow it time to produce those entries once the
  963. * existing entries are consumed. A worst-case situation
  964. * (fully-loaded system) means h/w sequencers may have to do 3-4
  965. * other things before servicing the portal's MR pump, each of
  966. * which (if slow) may take ~50 qman cycles (which is ~200
  967. * processor cycles). So rounding up and then multiplying this
  968. * worst-case estimate by a factor of 10, just to be
  969. * ultra-paranoid, goes as high as 10,000 cycles. NB, we consume
  970. * one entry at a time, so h/w has an opportunity to produce new
  971. * entries well before the ring has been fully consumed, so
  972. * we're being *really* paranoid here.
  973. */
  974. msleep(1);
  975. msg = qm_mr_current(p);
  976. if (!msg)
  977. return 0;
  978. }
  979. if ((msg->verb & QM_MR_VERB_TYPE_MASK) != QM_MR_VERB_FQRNI) {
  980. /* We aren't draining anything but FQRNIs */
  981. pr_err("Found verb 0x%x in MR\n", msg->verb);
  982. return -1;
  983. }
  984. qm_mr_next(p);
  985. qm_mr_cci_consume(p, 1);
  986. goto loop;
  987. }
  988. static int qman_create_portal(struct qman_portal *portal,
  989. const struct qm_portal_config *c,
  990. const struct qman_cgrs *cgrs)
  991. {
  992. struct qm_portal *p;
  993. int ret;
  994. u32 isdr;
  995. p = &portal->p;
  996. #ifdef CONFIG_FSL_PAMU
  997. /* PAMU is required for stashing */
  998. portal->use_eqcr_ci_stashing = ((qman_ip_rev >= QMAN_REV30) ? 1 : 0);
  999. #else
  1000. portal->use_eqcr_ci_stashing = 0;
  1001. #endif
  1002. /*
  1003. * prep the low-level portal struct with the mapped addresses from the
  1004. * config, everything that follows depends on it and "config" is more
  1005. * for (de)reference
  1006. */
  1007. p->addr.ce = c->addr_virt_ce;
  1008. p->addr.ce_be = c->addr_virt_ce;
  1009. p->addr.ci = c->addr_virt_ci;
  1010. /*
  1011. * If CI-stashing is used, the current defaults use a threshold of 3,
  1012. * and stash with high-than-DQRR priority.
  1013. */
  1014. if (qm_eqcr_init(p, qm_eqcr_pvb,
  1015. portal->use_eqcr_ci_stashing ? 3 : 0, 1)) {
  1016. dev_err(c->dev, "EQCR initialisation failed\n");
  1017. goto fail_eqcr;
  1018. }
  1019. if (qm_dqrr_init(p, c, qm_dqrr_dpush, qm_dqrr_pvb,
  1020. qm_dqrr_cdc, DQRR_MAXFILL)) {
  1021. dev_err(c->dev, "DQRR initialisation failed\n");
  1022. goto fail_dqrr;
  1023. }
  1024. if (qm_mr_init(p, qm_mr_pvb, qm_mr_cci)) {
  1025. dev_err(c->dev, "MR initialisation failed\n");
  1026. goto fail_mr;
  1027. }
  1028. if (qm_mc_init(p)) {
  1029. dev_err(c->dev, "MC initialisation failed\n");
  1030. goto fail_mc;
  1031. }
  1032. /* static interrupt-gating controls */
  1033. qm_dqrr_set_ithresh(p, QMAN_PIRQ_DQRR_ITHRESH);
  1034. qm_mr_set_ithresh(p, QMAN_PIRQ_MR_ITHRESH);
  1035. qm_out(p, QM_REG_ITPR, QMAN_PIRQ_IPERIOD);
  1036. portal->cgrs = kmalloc_array(2, sizeof(*cgrs), GFP_KERNEL);
  1037. if (!portal->cgrs)
  1038. goto fail_cgrs;
  1039. /* initial snapshot is no-depletion */
  1040. qman_cgrs_init(&portal->cgrs[1]);
  1041. if (cgrs)
  1042. portal->cgrs[0] = *cgrs;
  1043. else
  1044. /* if the given mask is NULL, assume all CGRs can be seen */
  1045. qman_cgrs_fill(&portal->cgrs[0]);
  1046. INIT_LIST_HEAD(&portal->cgr_cbs);
  1047. spin_lock_init(&portal->cgr_lock);
  1048. INIT_WORK(&portal->congestion_work, qm_congestion_task);
  1049. INIT_WORK(&portal->mr_work, qm_mr_process_task);
  1050. portal->bits = 0;
  1051. portal->sdqcr = QM_SDQCR_SOURCE_CHANNELS | QM_SDQCR_COUNT_UPTO3 |
  1052. QM_SDQCR_DEDICATED_PRECEDENCE | QM_SDQCR_TYPE_PRIO_QOS |
  1053. QM_SDQCR_TOKEN_SET(0xab) | QM_SDQCR_CHANNELS_DEDICATED;
  1054. isdr = 0xffffffff;
  1055. qm_out(p, QM_REG_ISDR, isdr);
  1056. portal->irq_sources = 0;
  1057. qm_out(p, QM_REG_IER, 0);
  1058. qm_out(p, QM_REG_ISR, 0xffffffff);
  1059. snprintf(portal->irqname, MAX_IRQNAME, IRQNAME, c->cpu);
  1060. if (request_irq(c->irq, portal_isr, 0, portal->irqname, portal)) {
  1061. dev_err(c->dev, "request_irq() failed\n");
  1062. goto fail_irq;
  1063. }
  1064. if (c->cpu != -1 && irq_can_set_affinity(c->irq) &&
  1065. irq_set_affinity(c->irq, cpumask_of(c->cpu))) {
  1066. dev_err(c->dev, "irq_set_affinity() failed\n");
  1067. goto fail_affinity;
  1068. }
  1069. /* Need EQCR to be empty before continuing */
  1070. isdr &= ~QM_PIRQ_EQCI;
  1071. qm_out(p, QM_REG_ISDR, isdr);
  1072. ret = qm_eqcr_get_fill(p);
  1073. if (ret) {
  1074. dev_err(c->dev, "EQCR unclean\n");
  1075. goto fail_eqcr_empty;
  1076. }
  1077. isdr &= ~(QM_PIRQ_DQRI | QM_PIRQ_MRI);
  1078. qm_out(p, QM_REG_ISDR, isdr);
  1079. if (qm_dqrr_current(p)) {
  1080. dev_err(c->dev, "DQRR unclean\n");
  1081. qm_dqrr_cdc_consume_n(p, 0xffff);
  1082. }
  1083. if (qm_mr_current(p) && drain_mr_fqrni(p)) {
  1084. /* special handling, drain just in case it's a few FQRNIs */
  1085. const union qm_mr_entry *e = qm_mr_current(p);
  1086. dev_err(c->dev, "MR dirty, VB 0x%x, rc 0x%x, addr 0x%llx\n",
  1087. e->verb, e->ern.rc, qm_fd_addr_get64(&e->ern.fd));
  1088. goto fail_dqrr_mr_empty;
  1089. }
  1090. /* Success */
  1091. portal->config = c;
  1092. qm_out(p, QM_REG_ISDR, 0);
  1093. qm_out(p, QM_REG_IIR, 0);
  1094. /* Write a sane SDQCR */
  1095. qm_dqrr_sdqcr_set(p, portal->sdqcr);
  1096. return 0;
  1097. fail_dqrr_mr_empty:
  1098. fail_eqcr_empty:
  1099. fail_affinity:
  1100. free_irq(c->irq, portal);
  1101. fail_irq:
  1102. kfree(portal->cgrs);
  1103. fail_cgrs:
  1104. qm_mc_finish(p);
  1105. fail_mc:
  1106. qm_mr_finish(p);
  1107. fail_mr:
  1108. qm_dqrr_finish(p);
  1109. fail_dqrr:
  1110. qm_eqcr_finish(p);
  1111. fail_eqcr:
  1112. return -EIO;
  1113. }
  1114. struct qman_portal *qman_create_affine_portal(const struct qm_portal_config *c,
  1115. const struct qman_cgrs *cgrs)
  1116. {
  1117. struct qman_portal *portal;
  1118. int err;
  1119. portal = &per_cpu(qman_affine_portal, c->cpu);
  1120. err = qman_create_portal(portal, c, cgrs);
  1121. if (err)
  1122. return NULL;
  1123. spin_lock(&affine_mask_lock);
  1124. cpumask_set_cpu(c->cpu, &affine_mask);
  1125. affine_channels[c->cpu] = c->channel;
  1126. affine_portals[c->cpu] = portal;
  1127. spin_unlock(&affine_mask_lock);
  1128. return portal;
  1129. }
  1130. static void qman_destroy_portal(struct qman_portal *qm)
  1131. {
  1132. const struct qm_portal_config *pcfg;
  1133. /* Stop dequeues on the portal */
  1134. qm_dqrr_sdqcr_set(&qm->p, 0);
  1135. /*
  1136. * NB we do this to "quiesce" EQCR. If we add enqueue-completions or
  1137. * something related to QM_PIRQ_EQCI, this may need fixing.
  1138. * Also, due to the prefetching model used for CI updates in the enqueue
  1139. * path, this update will only invalidate the CI cacheline *after*
  1140. * working on it, so we need to call this twice to ensure a full update
  1141. * irrespective of where the enqueue processing was at when the teardown
  1142. * began.
  1143. */
  1144. qm_eqcr_cce_update(&qm->p);
  1145. qm_eqcr_cce_update(&qm->p);
  1146. pcfg = qm->config;
  1147. free_irq(pcfg->irq, qm);
  1148. kfree(qm->cgrs);
  1149. qm_mc_finish(&qm->p);
  1150. qm_mr_finish(&qm->p);
  1151. qm_dqrr_finish(&qm->p);
  1152. qm_eqcr_finish(&qm->p);
  1153. qm->config = NULL;
  1154. }
  1155. const struct qm_portal_config *qman_destroy_affine_portal(void)
  1156. {
  1157. struct qman_portal *qm = get_affine_portal();
  1158. const struct qm_portal_config *pcfg;
  1159. int cpu;
  1160. pcfg = qm->config;
  1161. cpu = pcfg->cpu;
  1162. qman_destroy_portal(qm);
  1163. spin_lock(&affine_mask_lock);
  1164. cpumask_clear_cpu(cpu, &affine_mask);
  1165. spin_unlock(&affine_mask_lock);
  1166. put_affine_portal();
  1167. return pcfg;
  1168. }
  1169. /* Inline helper to reduce nesting in __poll_portal_slow() */
  1170. static inline void fq_state_change(struct qman_portal *p, struct qman_fq *fq,
  1171. const union qm_mr_entry *msg, u8 verb)
  1172. {
  1173. switch (verb) {
  1174. case QM_MR_VERB_FQRL:
  1175. DPAA_ASSERT(fq_isset(fq, QMAN_FQ_STATE_ORL));
  1176. fq_clear(fq, QMAN_FQ_STATE_ORL);
  1177. break;
  1178. case QM_MR_VERB_FQRN:
  1179. DPAA_ASSERT(fq->state == qman_fq_state_parked ||
  1180. fq->state == qman_fq_state_sched);
  1181. DPAA_ASSERT(fq_isset(fq, QMAN_FQ_STATE_CHANGING));
  1182. fq_clear(fq, QMAN_FQ_STATE_CHANGING);
  1183. if (msg->fq.fqs & QM_MR_FQS_NOTEMPTY)
  1184. fq_set(fq, QMAN_FQ_STATE_NE);
  1185. if (msg->fq.fqs & QM_MR_FQS_ORLPRESENT)
  1186. fq_set(fq, QMAN_FQ_STATE_ORL);
  1187. fq->state = qman_fq_state_retired;
  1188. break;
  1189. case QM_MR_VERB_FQPN:
  1190. DPAA_ASSERT(fq->state == qman_fq_state_sched);
  1191. DPAA_ASSERT(fq_isclear(fq, QMAN_FQ_STATE_CHANGING));
  1192. fq->state = qman_fq_state_parked;
  1193. }
  1194. }
  1195. static void qm_congestion_task(struct work_struct *work)
  1196. {
  1197. struct qman_portal *p = container_of(work, struct qman_portal,
  1198. congestion_work);
  1199. struct qman_cgrs rr, c;
  1200. union qm_mc_result *mcr;
  1201. struct qman_cgr *cgr;
  1202. spin_lock(&p->cgr_lock);
  1203. qm_mc_start(&p->p);
  1204. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYCONGESTION);
  1205. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1206. spin_unlock(&p->cgr_lock);
  1207. dev_crit(p->config->dev, "QUERYCONGESTION timeout\n");
  1208. qman_p_irqsource_add(p, QM_PIRQ_CSCI);
  1209. return;
  1210. }
  1211. /* mask out the ones I'm not interested in */
  1212. qman_cgrs_and(&rr, (struct qman_cgrs *)&mcr->querycongestion.state,
  1213. &p->cgrs[0]);
  1214. /* check previous snapshot for delta, enter/exit congestion */
  1215. qman_cgrs_xor(&c, &rr, &p->cgrs[1]);
  1216. /* update snapshot */
  1217. qman_cgrs_cp(&p->cgrs[1], &rr);
  1218. /* Invoke callback */
  1219. list_for_each_entry(cgr, &p->cgr_cbs, node)
  1220. if (cgr->cb && qman_cgrs_get(&c, cgr->cgrid))
  1221. cgr->cb(p, cgr, qman_cgrs_get(&rr, cgr->cgrid));
  1222. spin_unlock(&p->cgr_lock);
  1223. qman_p_irqsource_add(p, QM_PIRQ_CSCI);
  1224. }
  1225. static void qm_mr_process_task(struct work_struct *work)
  1226. {
  1227. struct qman_portal *p = container_of(work, struct qman_portal,
  1228. mr_work);
  1229. const union qm_mr_entry *msg;
  1230. struct qman_fq *fq;
  1231. u8 verb, num = 0;
  1232. preempt_disable();
  1233. while (1) {
  1234. qm_mr_pvb_update(&p->p);
  1235. msg = qm_mr_current(&p->p);
  1236. if (!msg)
  1237. break;
  1238. verb = msg->verb & QM_MR_VERB_TYPE_MASK;
  1239. /* The message is a software ERN iff the 0x20 bit is clear */
  1240. if (verb & 0x20) {
  1241. switch (verb) {
  1242. case QM_MR_VERB_FQRNI:
  1243. /* nada, we drop FQRNIs on the floor */
  1244. break;
  1245. case QM_MR_VERB_FQRN:
  1246. case QM_MR_VERB_FQRL:
  1247. /* Lookup in the retirement table */
  1248. fq = fqid_to_fq(qm_fqid_get(&msg->fq));
  1249. if (WARN_ON(!fq))
  1250. break;
  1251. fq_state_change(p, fq, msg, verb);
  1252. if (fq->cb.fqs)
  1253. fq->cb.fqs(p, fq, msg);
  1254. break;
  1255. case QM_MR_VERB_FQPN:
  1256. /* Parked */
  1257. fq = tag_to_fq(be32_to_cpu(msg->fq.context_b));
  1258. fq_state_change(p, fq, msg, verb);
  1259. if (fq->cb.fqs)
  1260. fq->cb.fqs(p, fq, msg);
  1261. break;
  1262. case QM_MR_VERB_DC_ERN:
  1263. /* DCP ERN */
  1264. pr_crit_once("Leaking DCP ERNs!\n");
  1265. break;
  1266. default:
  1267. pr_crit("Invalid MR verb 0x%02x\n", verb);
  1268. }
  1269. } else {
  1270. /* Its a software ERN */
  1271. fq = tag_to_fq(be32_to_cpu(msg->ern.tag));
  1272. fq->cb.ern(p, fq, msg);
  1273. }
  1274. num++;
  1275. qm_mr_next(&p->p);
  1276. }
  1277. qm_mr_cci_consume(&p->p, num);
  1278. qman_p_irqsource_add(p, QM_PIRQ_MRI);
  1279. preempt_enable();
  1280. }
  1281. static u32 __poll_portal_slow(struct qman_portal *p, u32 is)
  1282. {
  1283. if (is & QM_PIRQ_CSCI) {
  1284. qman_p_irqsource_remove(p, QM_PIRQ_CSCI);
  1285. queue_work_on(smp_processor_id(), qm_portal_wq,
  1286. &p->congestion_work);
  1287. }
  1288. if (is & QM_PIRQ_EQRI) {
  1289. qm_eqcr_cce_update(&p->p);
  1290. qm_eqcr_set_ithresh(&p->p, 0);
  1291. wake_up(&affine_queue);
  1292. }
  1293. if (is & QM_PIRQ_MRI) {
  1294. qman_p_irqsource_remove(p, QM_PIRQ_MRI);
  1295. queue_work_on(smp_processor_id(), qm_portal_wq,
  1296. &p->mr_work);
  1297. }
  1298. return is;
  1299. }
  1300. /*
  1301. * remove some slowish-path stuff from the "fast path" and make sure it isn't
  1302. * inlined.
  1303. */
  1304. static noinline void clear_vdqcr(struct qman_portal *p, struct qman_fq *fq)
  1305. {
  1306. p->vdqcr_owned = NULL;
  1307. fq_clear(fq, QMAN_FQ_STATE_VDQCR);
  1308. wake_up(&affine_queue);
  1309. }
  1310. /*
  1311. * The only states that would conflict with other things if they ran at the
  1312. * same time on the same cpu are:
  1313. *
  1314. * (i) setting/clearing vdqcr_owned, and
  1315. * (ii) clearing the NE (Not Empty) flag.
  1316. *
  1317. * Both are safe. Because;
  1318. *
  1319. * (i) this clearing can only occur after qman_volatile_dequeue() has set the
  1320. * vdqcr_owned field (which it does before setting VDQCR), and
  1321. * qman_volatile_dequeue() blocks interrupts and preemption while this is
  1322. * done so that we can't interfere.
  1323. * (ii) the NE flag is only cleared after qman_retire_fq() has set it, and as
  1324. * with (i) that API prevents us from interfering until it's safe.
  1325. *
  1326. * The good thing is that qman_volatile_dequeue() and qman_retire_fq() run far
  1327. * less frequently (ie. per-FQ) than __poll_portal_fast() does, so the nett
  1328. * advantage comes from this function not having to "lock" anything at all.
  1329. *
  1330. * Note also that the callbacks are invoked at points which are safe against the
  1331. * above potential conflicts, but that this function itself is not re-entrant
  1332. * (this is because the function tracks one end of each FIFO in the portal and
  1333. * we do *not* want to lock that). So the consequence is that it is safe for
  1334. * user callbacks to call into any QMan API.
  1335. */
  1336. static inline unsigned int __poll_portal_fast(struct qman_portal *p,
  1337. unsigned int poll_limit)
  1338. {
  1339. const struct qm_dqrr_entry *dq;
  1340. struct qman_fq *fq;
  1341. enum qman_cb_dqrr_result res;
  1342. unsigned int limit = 0;
  1343. do {
  1344. qm_dqrr_pvb_update(&p->p);
  1345. dq = qm_dqrr_current(&p->p);
  1346. if (!dq)
  1347. break;
  1348. if (dq->stat & QM_DQRR_STAT_UNSCHEDULED) {
  1349. /*
  1350. * VDQCR: don't trust context_b as the FQ may have
  1351. * been configured for h/w consumption and we're
  1352. * draining it post-retirement.
  1353. */
  1354. fq = p->vdqcr_owned;
  1355. /*
  1356. * We only set QMAN_FQ_STATE_NE when retiring, so we
  1357. * only need to check for clearing it when doing
  1358. * volatile dequeues. It's one less thing to check
  1359. * in the critical path (SDQCR).
  1360. */
  1361. if (dq->stat & QM_DQRR_STAT_FQ_EMPTY)
  1362. fq_clear(fq, QMAN_FQ_STATE_NE);
  1363. /*
  1364. * This is duplicated from the SDQCR code, but we
  1365. * have stuff to do before *and* after this callback,
  1366. * and we don't want multiple if()s in the critical
  1367. * path (SDQCR).
  1368. */
  1369. res = fq->cb.dqrr(p, fq, dq);
  1370. if (res == qman_cb_dqrr_stop)
  1371. break;
  1372. /* Check for VDQCR completion */
  1373. if (dq->stat & QM_DQRR_STAT_DQCR_EXPIRED)
  1374. clear_vdqcr(p, fq);
  1375. } else {
  1376. /* SDQCR: context_b points to the FQ */
  1377. fq = tag_to_fq(be32_to_cpu(dq->context_b));
  1378. /* Now let the callback do its stuff */
  1379. res = fq->cb.dqrr(p, fq, dq);
  1380. /*
  1381. * The callback can request that we exit without
  1382. * consuming this entry nor advancing;
  1383. */
  1384. if (res == qman_cb_dqrr_stop)
  1385. break;
  1386. }
  1387. /* Interpret 'dq' from a driver perspective. */
  1388. /*
  1389. * Parking isn't possible unless HELDACTIVE was set. NB,
  1390. * FORCEELIGIBLE implies HELDACTIVE, so we only need to
  1391. * check for HELDACTIVE to cover both.
  1392. */
  1393. DPAA_ASSERT((dq->stat & QM_DQRR_STAT_FQ_HELDACTIVE) ||
  1394. (res != qman_cb_dqrr_park));
  1395. /* just means "skip it, I'll consume it myself later on" */
  1396. if (res != qman_cb_dqrr_defer)
  1397. qm_dqrr_cdc_consume_1ptr(&p->p, dq,
  1398. res == qman_cb_dqrr_park);
  1399. /* Move forward */
  1400. qm_dqrr_next(&p->p);
  1401. /*
  1402. * Entry processed and consumed, increment our counter. The
  1403. * callback can request that we exit after consuming the
  1404. * entry, and we also exit if we reach our processing limit,
  1405. * so loop back only if neither of these conditions is met.
  1406. */
  1407. } while (++limit < poll_limit && res != qman_cb_dqrr_consume_stop);
  1408. return limit;
  1409. }
  1410. void qman_p_irqsource_add(struct qman_portal *p, u32 bits)
  1411. {
  1412. unsigned long irqflags;
  1413. local_irq_save(irqflags);
  1414. p->irq_sources |= bits & QM_PIRQ_VISIBLE;
  1415. qm_out(&p->p, QM_REG_IER, p->irq_sources);
  1416. local_irq_restore(irqflags);
  1417. }
  1418. EXPORT_SYMBOL(qman_p_irqsource_add);
  1419. void qman_p_irqsource_remove(struct qman_portal *p, u32 bits)
  1420. {
  1421. unsigned long irqflags;
  1422. u32 ier;
  1423. /*
  1424. * Our interrupt handler only processes+clears status register bits that
  1425. * are in p->irq_sources. As we're trimming that mask, if one of them
  1426. * were to assert in the status register just before we remove it from
  1427. * the enable register, there would be an interrupt-storm when we
  1428. * release the IRQ lock. So we wait for the enable register update to
  1429. * take effect in h/w (by reading it back) and then clear all other bits
  1430. * in the status register. Ie. we clear them from ISR once it's certain
  1431. * IER won't allow them to reassert.
  1432. */
  1433. local_irq_save(irqflags);
  1434. bits &= QM_PIRQ_VISIBLE;
  1435. p->irq_sources &= ~bits;
  1436. qm_out(&p->p, QM_REG_IER, p->irq_sources);
  1437. ier = qm_in(&p->p, QM_REG_IER);
  1438. /*
  1439. * Using "~ier" (rather than "bits" or "~p->irq_sources") creates a
  1440. * data-dependency, ie. to protect against re-ordering.
  1441. */
  1442. qm_out(&p->p, QM_REG_ISR, ~ier);
  1443. local_irq_restore(irqflags);
  1444. }
  1445. EXPORT_SYMBOL(qman_p_irqsource_remove);
  1446. const cpumask_t *qman_affine_cpus(void)
  1447. {
  1448. return &affine_mask;
  1449. }
  1450. EXPORT_SYMBOL(qman_affine_cpus);
  1451. u16 qman_affine_channel(int cpu)
  1452. {
  1453. if (cpu < 0) {
  1454. struct qman_portal *portal = get_affine_portal();
  1455. cpu = portal->config->cpu;
  1456. put_affine_portal();
  1457. }
  1458. WARN_ON(!cpumask_test_cpu(cpu, &affine_mask));
  1459. return affine_channels[cpu];
  1460. }
  1461. EXPORT_SYMBOL(qman_affine_channel);
  1462. struct qman_portal *qman_get_affine_portal(int cpu)
  1463. {
  1464. return affine_portals[cpu];
  1465. }
  1466. EXPORT_SYMBOL(qman_get_affine_portal);
  1467. int qman_p_poll_dqrr(struct qman_portal *p, unsigned int limit)
  1468. {
  1469. return __poll_portal_fast(p, limit);
  1470. }
  1471. EXPORT_SYMBOL(qman_p_poll_dqrr);
  1472. void qman_p_static_dequeue_add(struct qman_portal *p, u32 pools)
  1473. {
  1474. unsigned long irqflags;
  1475. local_irq_save(irqflags);
  1476. pools &= p->config->pools;
  1477. p->sdqcr |= pools;
  1478. qm_dqrr_sdqcr_set(&p->p, p->sdqcr);
  1479. local_irq_restore(irqflags);
  1480. }
  1481. EXPORT_SYMBOL(qman_p_static_dequeue_add);
  1482. /* Frame queue API */
  1483. static const char *mcr_result_str(u8 result)
  1484. {
  1485. switch (result) {
  1486. case QM_MCR_RESULT_NULL:
  1487. return "QM_MCR_RESULT_NULL";
  1488. case QM_MCR_RESULT_OK:
  1489. return "QM_MCR_RESULT_OK";
  1490. case QM_MCR_RESULT_ERR_FQID:
  1491. return "QM_MCR_RESULT_ERR_FQID";
  1492. case QM_MCR_RESULT_ERR_FQSTATE:
  1493. return "QM_MCR_RESULT_ERR_FQSTATE";
  1494. case QM_MCR_RESULT_ERR_NOTEMPTY:
  1495. return "QM_MCR_RESULT_ERR_NOTEMPTY";
  1496. case QM_MCR_RESULT_PENDING:
  1497. return "QM_MCR_RESULT_PENDING";
  1498. case QM_MCR_RESULT_ERR_BADCOMMAND:
  1499. return "QM_MCR_RESULT_ERR_BADCOMMAND";
  1500. }
  1501. return "<unknown MCR result>";
  1502. }
  1503. int qman_create_fq(u32 fqid, u32 flags, struct qman_fq *fq)
  1504. {
  1505. if (flags & QMAN_FQ_FLAG_DYNAMIC_FQID) {
  1506. int ret = qman_alloc_fqid(&fqid);
  1507. if (ret)
  1508. return ret;
  1509. }
  1510. fq->fqid = fqid;
  1511. fq->flags = flags;
  1512. fq->state = qman_fq_state_oos;
  1513. fq->cgr_groupid = 0;
  1514. /* A context_b of 0 is allegedly special, so don't use that fqid */
  1515. if (fqid == 0 || fqid >= num_fqids) {
  1516. WARN(1, "bad fqid %d\n", fqid);
  1517. return -EINVAL;
  1518. }
  1519. fq->idx = fqid * 2;
  1520. if (flags & QMAN_FQ_FLAG_NO_MODIFY)
  1521. fq->idx++;
  1522. WARN_ON(fq_table[fq->idx]);
  1523. fq_table[fq->idx] = fq;
  1524. return 0;
  1525. }
  1526. EXPORT_SYMBOL(qman_create_fq);
  1527. void qman_destroy_fq(struct qman_fq *fq)
  1528. {
  1529. /*
  1530. * We don't need to lock the FQ as it is a pre-condition that the FQ be
  1531. * quiesced. Instead, run some checks.
  1532. */
  1533. switch (fq->state) {
  1534. case qman_fq_state_parked:
  1535. case qman_fq_state_oos:
  1536. if (fq_isset(fq, QMAN_FQ_FLAG_DYNAMIC_FQID))
  1537. qman_release_fqid(fq->fqid);
  1538. DPAA_ASSERT(fq_table[fq->idx]);
  1539. fq_table[fq->idx] = NULL;
  1540. return;
  1541. default:
  1542. break;
  1543. }
  1544. DPAA_ASSERT(NULL == "qman_free_fq() on unquiesced FQ!");
  1545. }
  1546. EXPORT_SYMBOL(qman_destroy_fq);
  1547. u32 qman_fq_fqid(struct qman_fq *fq)
  1548. {
  1549. return fq->fqid;
  1550. }
  1551. EXPORT_SYMBOL(qman_fq_fqid);
  1552. int qman_init_fq(struct qman_fq *fq, u32 flags, struct qm_mcc_initfq *opts)
  1553. {
  1554. union qm_mc_command *mcc;
  1555. union qm_mc_result *mcr;
  1556. struct qman_portal *p;
  1557. u8 res, myverb;
  1558. int ret = 0;
  1559. myverb = (flags & QMAN_INITFQ_FLAG_SCHED)
  1560. ? QM_MCC_VERB_INITFQ_SCHED : QM_MCC_VERB_INITFQ_PARKED;
  1561. if (fq->state != qman_fq_state_oos &&
  1562. fq->state != qman_fq_state_parked)
  1563. return -EINVAL;
  1564. #ifdef CONFIG_FSL_DPAA_CHECKING
  1565. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1566. return -EINVAL;
  1567. #endif
  1568. if (opts && (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_OAC)) {
  1569. /* And can't be set at the same time as TDTHRESH */
  1570. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_TDTHRESH)
  1571. return -EINVAL;
  1572. }
  1573. /* Issue an INITFQ_[PARKED|SCHED] management command */
  1574. p = get_affine_portal();
  1575. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1576. (fq->state != qman_fq_state_oos &&
  1577. fq->state != qman_fq_state_parked)) {
  1578. ret = -EBUSY;
  1579. goto out;
  1580. }
  1581. mcc = qm_mc_start(&p->p);
  1582. if (opts)
  1583. mcc->initfq = *opts;
  1584. qm_fqid_set(&mcc->fq, fq->fqid);
  1585. mcc->initfq.count = 0;
  1586. /*
  1587. * If the FQ does *not* have the TO_DCPORTAL flag, context_b is set as a
  1588. * demux pointer. Otherwise, the caller-provided value is allowed to
  1589. * stand, don't overwrite it.
  1590. */
  1591. if (fq_isclear(fq, QMAN_FQ_FLAG_TO_DCPORTAL)) {
  1592. dma_addr_t phys_fq;
  1593. mcc->initfq.we_mask |= cpu_to_be16(QM_INITFQ_WE_CONTEXTB);
  1594. mcc->initfq.fqd.context_b = cpu_to_be32(fq_to_tag(fq));
  1595. /*
  1596. * and the physical address - NB, if the user wasn't trying to
  1597. * set CONTEXTA, clear the stashing settings.
  1598. */
  1599. if (!(be16_to_cpu(mcc->initfq.we_mask) &
  1600. QM_INITFQ_WE_CONTEXTA)) {
  1601. mcc->initfq.we_mask |=
  1602. cpu_to_be16(QM_INITFQ_WE_CONTEXTA);
  1603. memset(&mcc->initfq.fqd.context_a, 0,
  1604. sizeof(mcc->initfq.fqd.context_a));
  1605. } else {
  1606. struct qman_portal *p = qman_dma_portal;
  1607. phys_fq = dma_map_single(p->config->dev, fq,
  1608. sizeof(*fq), DMA_TO_DEVICE);
  1609. if (dma_mapping_error(p->config->dev, phys_fq)) {
  1610. dev_err(p->config->dev, "dma_mapping failed\n");
  1611. ret = -EIO;
  1612. goto out;
  1613. }
  1614. qm_fqd_stashing_set64(&mcc->initfq.fqd, phys_fq);
  1615. }
  1616. }
  1617. if (flags & QMAN_INITFQ_FLAG_LOCAL) {
  1618. int wq = 0;
  1619. if (!(be16_to_cpu(mcc->initfq.we_mask) &
  1620. QM_INITFQ_WE_DESTWQ)) {
  1621. mcc->initfq.we_mask |=
  1622. cpu_to_be16(QM_INITFQ_WE_DESTWQ);
  1623. wq = 4;
  1624. }
  1625. qm_fqd_set_destwq(&mcc->initfq.fqd, p->config->channel, wq);
  1626. }
  1627. qm_mc_commit(&p->p, myverb);
  1628. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1629. dev_err(p->config->dev, "MCR timeout\n");
  1630. ret = -ETIMEDOUT;
  1631. goto out;
  1632. }
  1633. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == myverb);
  1634. res = mcr->result;
  1635. if (res != QM_MCR_RESULT_OK) {
  1636. ret = -EIO;
  1637. goto out;
  1638. }
  1639. if (opts) {
  1640. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_FQCTRL) {
  1641. if (be16_to_cpu(opts->fqd.fq_ctrl) & QM_FQCTRL_CGE)
  1642. fq_set(fq, QMAN_FQ_STATE_CGR_EN);
  1643. else
  1644. fq_clear(fq, QMAN_FQ_STATE_CGR_EN);
  1645. }
  1646. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_CGID)
  1647. fq->cgr_groupid = opts->fqd.cgid;
  1648. }
  1649. fq->state = (flags & QMAN_INITFQ_FLAG_SCHED) ?
  1650. qman_fq_state_sched : qman_fq_state_parked;
  1651. out:
  1652. put_affine_portal();
  1653. return ret;
  1654. }
  1655. EXPORT_SYMBOL(qman_init_fq);
  1656. int qman_schedule_fq(struct qman_fq *fq)
  1657. {
  1658. union qm_mc_command *mcc;
  1659. union qm_mc_result *mcr;
  1660. struct qman_portal *p;
  1661. int ret = 0;
  1662. if (fq->state != qman_fq_state_parked)
  1663. return -EINVAL;
  1664. #ifdef CONFIG_FSL_DPAA_CHECKING
  1665. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1666. return -EINVAL;
  1667. #endif
  1668. /* Issue a ALTERFQ_SCHED management command */
  1669. p = get_affine_portal();
  1670. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1671. fq->state != qman_fq_state_parked) {
  1672. ret = -EBUSY;
  1673. goto out;
  1674. }
  1675. mcc = qm_mc_start(&p->p);
  1676. qm_fqid_set(&mcc->fq, fq->fqid);
  1677. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_SCHED);
  1678. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1679. dev_err(p->config->dev, "ALTER_SCHED timeout\n");
  1680. ret = -ETIMEDOUT;
  1681. goto out;
  1682. }
  1683. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_SCHED);
  1684. if (mcr->result != QM_MCR_RESULT_OK) {
  1685. ret = -EIO;
  1686. goto out;
  1687. }
  1688. fq->state = qman_fq_state_sched;
  1689. out:
  1690. put_affine_portal();
  1691. return ret;
  1692. }
  1693. EXPORT_SYMBOL(qman_schedule_fq);
  1694. int qman_retire_fq(struct qman_fq *fq, u32 *flags)
  1695. {
  1696. union qm_mc_command *mcc;
  1697. union qm_mc_result *mcr;
  1698. struct qman_portal *p;
  1699. int ret;
  1700. u8 res;
  1701. if (fq->state != qman_fq_state_parked &&
  1702. fq->state != qman_fq_state_sched)
  1703. return -EINVAL;
  1704. #ifdef CONFIG_FSL_DPAA_CHECKING
  1705. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1706. return -EINVAL;
  1707. #endif
  1708. p = get_affine_portal();
  1709. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1710. fq->state == qman_fq_state_retired ||
  1711. fq->state == qman_fq_state_oos) {
  1712. ret = -EBUSY;
  1713. goto out;
  1714. }
  1715. mcc = qm_mc_start(&p->p);
  1716. qm_fqid_set(&mcc->fq, fq->fqid);
  1717. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_RETIRE);
  1718. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1719. dev_crit(p->config->dev, "ALTER_RETIRE timeout\n");
  1720. ret = -ETIMEDOUT;
  1721. goto out;
  1722. }
  1723. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_RETIRE);
  1724. res = mcr->result;
  1725. /*
  1726. * "Elegant" would be to treat OK/PENDING the same way; set CHANGING,
  1727. * and defer the flags until FQRNI or FQRN (respectively) show up. But
  1728. * "Friendly" is to process OK immediately, and not set CHANGING. We do
  1729. * friendly, otherwise the caller doesn't necessarily have a fully
  1730. * "retired" FQ on return even if the retirement was immediate. However
  1731. * this does mean some code duplication between here and
  1732. * fq_state_change().
  1733. */
  1734. if (res == QM_MCR_RESULT_OK) {
  1735. ret = 0;
  1736. /* Process 'fq' right away, we'll ignore FQRNI */
  1737. if (mcr->alterfq.fqs & QM_MCR_FQS_NOTEMPTY)
  1738. fq_set(fq, QMAN_FQ_STATE_NE);
  1739. if (mcr->alterfq.fqs & QM_MCR_FQS_ORLPRESENT)
  1740. fq_set(fq, QMAN_FQ_STATE_ORL);
  1741. if (flags)
  1742. *flags = fq->flags;
  1743. fq->state = qman_fq_state_retired;
  1744. if (fq->cb.fqs) {
  1745. /*
  1746. * Another issue with supporting "immediate" retirement
  1747. * is that we're forced to drop FQRNIs, because by the
  1748. * time they're seen it may already be "too late" (the
  1749. * fq may have been OOS'd and free()'d already). But if
  1750. * the upper layer wants a callback whether it's
  1751. * immediate or not, we have to fake a "MR" entry to
  1752. * look like an FQRNI...
  1753. */
  1754. union qm_mr_entry msg;
  1755. msg.verb = QM_MR_VERB_FQRNI;
  1756. msg.fq.fqs = mcr->alterfq.fqs;
  1757. qm_fqid_set(&msg.fq, fq->fqid);
  1758. msg.fq.context_b = cpu_to_be32(fq_to_tag(fq));
  1759. fq->cb.fqs(p, fq, &msg);
  1760. }
  1761. } else if (res == QM_MCR_RESULT_PENDING) {
  1762. ret = 1;
  1763. fq_set(fq, QMAN_FQ_STATE_CHANGING);
  1764. } else {
  1765. ret = -EIO;
  1766. }
  1767. out:
  1768. put_affine_portal();
  1769. return ret;
  1770. }
  1771. EXPORT_SYMBOL(qman_retire_fq);
  1772. int qman_oos_fq(struct qman_fq *fq)
  1773. {
  1774. union qm_mc_command *mcc;
  1775. union qm_mc_result *mcr;
  1776. struct qman_portal *p;
  1777. int ret = 0;
  1778. if (fq->state != qman_fq_state_retired)
  1779. return -EINVAL;
  1780. #ifdef CONFIG_FSL_DPAA_CHECKING
  1781. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1782. return -EINVAL;
  1783. #endif
  1784. p = get_affine_portal();
  1785. if (fq_isset(fq, QMAN_FQ_STATE_BLOCKOOS) ||
  1786. fq->state != qman_fq_state_retired) {
  1787. ret = -EBUSY;
  1788. goto out;
  1789. }
  1790. mcc = qm_mc_start(&p->p);
  1791. qm_fqid_set(&mcc->fq, fq->fqid);
  1792. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  1793. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1794. ret = -ETIMEDOUT;
  1795. goto out;
  1796. }
  1797. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_OOS);
  1798. if (mcr->result != QM_MCR_RESULT_OK) {
  1799. ret = -EIO;
  1800. goto out;
  1801. }
  1802. fq->state = qman_fq_state_oos;
  1803. out:
  1804. put_affine_portal();
  1805. return ret;
  1806. }
  1807. EXPORT_SYMBOL(qman_oos_fq);
  1808. int qman_query_fq(struct qman_fq *fq, struct qm_fqd *fqd)
  1809. {
  1810. union qm_mc_command *mcc;
  1811. union qm_mc_result *mcr;
  1812. struct qman_portal *p = get_affine_portal();
  1813. int ret = 0;
  1814. mcc = qm_mc_start(&p->p);
  1815. qm_fqid_set(&mcc->fq, fq->fqid);
  1816. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ);
  1817. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1818. ret = -ETIMEDOUT;
  1819. goto out;
  1820. }
  1821. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ);
  1822. if (mcr->result == QM_MCR_RESULT_OK)
  1823. *fqd = mcr->queryfq.fqd;
  1824. else
  1825. ret = -EIO;
  1826. out:
  1827. put_affine_portal();
  1828. return ret;
  1829. }
  1830. int qman_query_fq_np(struct qman_fq *fq, struct qm_mcr_queryfq_np *np)
  1831. {
  1832. union qm_mc_command *mcc;
  1833. union qm_mc_result *mcr;
  1834. struct qman_portal *p = get_affine_portal();
  1835. int ret = 0;
  1836. mcc = qm_mc_start(&p->p);
  1837. qm_fqid_set(&mcc->fq, fq->fqid);
  1838. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ_NP);
  1839. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1840. ret = -ETIMEDOUT;
  1841. goto out;
  1842. }
  1843. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ_NP);
  1844. if (mcr->result == QM_MCR_RESULT_OK)
  1845. *np = mcr->queryfq_np;
  1846. else if (mcr->result == QM_MCR_RESULT_ERR_FQID)
  1847. ret = -ERANGE;
  1848. else
  1849. ret = -EIO;
  1850. out:
  1851. put_affine_portal();
  1852. return ret;
  1853. }
  1854. EXPORT_SYMBOL(qman_query_fq_np);
  1855. static int qman_query_cgr(struct qman_cgr *cgr,
  1856. struct qm_mcr_querycgr *cgrd)
  1857. {
  1858. union qm_mc_command *mcc;
  1859. union qm_mc_result *mcr;
  1860. struct qman_portal *p = get_affine_portal();
  1861. int ret = 0;
  1862. mcc = qm_mc_start(&p->p);
  1863. mcc->cgr.cgid = cgr->cgrid;
  1864. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYCGR);
  1865. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1866. ret = -ETIMEDOUT;
  1867. goto out;
  1868. }
  1869. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCC_VERB_QUERYCGR);
  1870. if (mcr->result == QM_MCR_RESULT_OK)
  1871. *cgrd = mcr->querycgr;
  1872. else {
  1873. dev_err(p->config->dev, "QUERY_CGR failed: %s\n",
  1874. mcr_result_str(mcr->result));
  1875. ret = -EIO;
  1876. }
  1877. out:
  1878. put_affine_portal();
  1879. return ret;
  1880. }
  1881. int qman_query_cgr_congested(struct qman_cgr *cgr, bool *result)
  1882. {
  1883. struct qm_mcr_querycgr query_cgr;
  1884. int err;
  1885. err = qman_query_cgr(cgr, &query_cgr);
  1886. if (err)
  1887. return err;
  1888. *result = !!query_cgr.cgr.cs;
  1889. return 0;
  1890. }
  1891. EXPORT_SYMBOL(qman_query_cgr_congested);
  1892. /* internal function used as a wait_event() expression */
  1893. static int set_p_vdqcr(struct qman_portal *p, struct qman_fq *fq, u32 vdqcr)
  1894. {
  1895. unsigned long irqflags;
  1896. int ret = -EBUSY;
  1897. local_irq_save(irqflags);
  1898. if (p->vdqcr_owned)
  1899. goto out;
  1900. if (fq_isset(fq, QMAN_FQ_STATE_VDQCR))
  1901. goto out;
  1902. fq_set(fq, QMAN_FQ_STATE_VDQCR);
  1903. p->vdqcr_owned = fq;
  1904. qm_dqrr_vdqcr_set(&p->p, vdqcr);
  1905. ret = 0;
  1906. out:
  1907. local_irq_restore(irqflags);
  1908. return ret;
  1909. }
  1910. static int set_vdqcr(struct qman_portal **p, struct qman_fq *fq, u32 vdqcr)
  1911. {
  1912. int ret;
  1913. *p = get_affine_portal();
  1914. ret = set_p_vdqcr(*p, fq, vdqcr);
  1915. put_affine_portal();
  1916. return ret;
  1917. }
  1918. static int wait_vdqcr_start(struct qman_portal **p, struct qman_fq *fq,
  1919. u32 vdqcr, u32 flags)
  1920. {
  1921. int ret = 0;
  1922. if (flags & QMAN_VOLATILE_FLAG_WAIT_INT)
  1923. ret = wait_event_interruptible(affine_queue,
  1924. !set_vdqcr(p, fq, vdqcr));
  1925. else
  1926. wait_event(affine_queue, !set_vdqcr(p, fq, vdqcr));
  1927. return ret;
  1928. }
  1929. int qman_volatile_dequeue(struct qman_fq *fq, u32 flags, u32 vdqcr)
  1930. {
  1931. struct qman_portal *p;
  1932. int ret;
  1933. if (fq->state != qman_fq_state_parked &&
  1934. fq->state != qman_fq_state_retired)
  1935. return -EINVAL;
  1936. if (vdqcr & QM_VDQCR_FQID_MASK)
  1937. return -EINVAL;
  1938. if (fq_isset(fq, QMAN_FQ_STATE_VDQCR))
  1939. return -EBUSY;
  1940. vdqcr = (vdqcr & ~QM_VDQCR_FQID_MASK) | fq->fqid;
  1941. if (flags & QMAN_VOLATILE_FLAG_WAIT)
  1942. ret = wait_vdqcr_start(&p, fq, vdqcr, flags);
  1943. else
  1944. ret = set_vdqcr(&p, fq, vdqcr);
  1945. if (ret)
  1946. return ret;
  1947. /* VDQCR is set */
  1948. if (flags & QMAN_VOLATILE_FLAG_FINISH) {
  1949. if (flags & QMAN_VOLATILE_FLAG_WAIT_INT)
  1950. /*
  1951. * NB: don't propagate any error - the caller wouldn't
  1952. * know whether the VDQCR was issued or not. A signal
  1953. * could arrive after returning anyway, so the caller
  1954. * can check signal_pending() if that's an issue.
  1955. */
  1956. wait_event_interruptible(affine_queue,
  1957. !fq_isset(fq, QMAN_FQ_STATE_VDQCR));
  1958. else
  1959. wait_event(affine_queue,
  1960. !fq_isset(fq, QMAN_FQ_STATE_VDQCR));
  1961. }
  1962. return 0;
  1963. }
  1964. EXPORT_SYMBOL(qman_volatile_dequeue);
  1965. static void update_eqcr_ci(struct qman_portal *p, u8 avail)
  1966. {
  1967. if (avail)
  1968. qm_eqcr_cce_prefetch(&p->p);
  1969. else
  1970. qm_eqcr_cce_update(&p->p);
  1971. }
  1972. int qman_enqueue(struct qman_fq *fq, const struct qm_fd *fd)
  1973. {
  1974. struct qman_portal *p;
  1975. struct qm_eqcr_entry *eq;
  1976. unsigned long irqflags;
  1977. u8 avail;
  1978. p = get_affine_portal();
  1979. local_irq_save(irqflags);
  1980. if (p->use_eqcr_ci_stashing) {
  1981. /*
  1982. * The stashing case is easy, only update if we need to in
  1983. * order to try and liberate ring entries.
  1984. */
  1985. eq = qm_eqcr_start_stash(&p->p);
  1986. } else {
  1987. /*
  1988. * The non-stashing case is harder, need to prefetch ahead of
  1989. * time.
  1990. */
  1991. avail = qm_eqcr_get_avail(&p->p);
  1992. if (avail < 2)
  1993. update_eqcr_ci(p, avail);
  1994. eq = qm_eqcr_start_no_stash(&p->p);
  1995. }
  1996. if (unlikely(!eq))
  1997. goto out;
  1998. qm_fqid_set(eq, fq->fqid);
  1999. eq->tag = cpu_to_be32(fq_to_tag(fq));
  2000. eq->fd = *fd;
  2001. qm_eqcr_pvb_commit(&p->p, QM_EQCR_VERB_CMD_ENQUEUE);
  2002. out:
  2003. local_irq_restore(irqflags);
  2004. put_affine_portal();
  2005. return 0;
  2006. }
  2007. EXPORT_SYMBOL(qman_enqueue);
  2008. static int qm_modify_cgr(struct qman_cgr *cgr, u32 flags,
  2009. struct qm_mcc_initcgr *opts)
  2010. {
  2011. union qm_mc_command *mcc;
  2012. union qm_mc_result *mcr;
  2013. struct qman_portal *p = get_affine_portal();
  2014. u8 verb = QM_MCC_VERB_MODIFYCGR;
  2015. int ret = 0;
  2016. mcc = qm_mc_start(&p->p);
  2017. if (opts)
  2018. mcc->initcgr = *opts;
  2019. mcc->initcgr.cgid = cgr->cgrid;
  2020. if (flags & QMAN_CGR_FLAG_USE_INIT)
  2021. verb = QM_MCC_VERB_INITCGR;
  2022. qm_mc_commit(&p->p, verb);
  2023. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2024. ret = -ETIMEDOUT;
  2025. goto out;
  2026. }
  2027. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == verb);
  2028. if (mcr->result != QM_MCR_RESULT_OK)
  2029. ret = -EIO;
  2030. out:
  2031. put_affine_portal();
  2032. return ret;
  2033. }
  2034. #define PORTAL_IDX(n) (n->config->channel - QM_CHANNEL_SWPORTAL0)
  2035. /* congestion state change notification target update control */
  2036. static void qm_cgr_cscn_targ_set(struct __qm_mc_cgr *cgr, int pi, u32 val)
  2037. {
  2038. if (qman_ip_rev >= QMAN_REV30)
  2039. cgr->cscn_targ_upd_ctrl = cpu_to_be16(pi |
  2040. QM_CGR_TARG_UDP_CTRL_WRITE_BIT);
  2041. else
  2042. cgr->cscn_targ = cpu_to_be32(val | QM_CGR_TARG_PORTAL(pi));
  2043. }
  2044. static void qm_cgr_cscn_targ_clear(struct __qm_mc_cgr *cgr, int pi, u32 val)
  2045. {
  2046. if (qman_ip_rev >= QMAN_REV30)
  2047. cgr->cscn_targ_upd_ctrl = cpu_to_be16(pi);
  2048. else
  2049. cgr->cscn_targ = cpu_to_be32(val & ~QM_CGR_TARG_PORTAL(pi));
  2050. }
  2051. static u8 qman_cgr_cpus[CGR_NUM];
  2052. void qman_init_cgr_all(void)
  2053. {
  2054. struct qman_cgr cgr;
  2055. int err_cnt = 0;
  2056. for (cgr.cgrid = 0; cgr.cgrid < CGR_NUM; cgr.cgrid++) {
  2057. if (qm_modify_cgr(&cgr, QMAN_CGR_FLAG_USE_INIT, NULL))
  2058. err_cnt++;
  2059. }
  2060. if (err_cnt)
  2061. pr_err("Warning: %d error%s while initialising CGR h/w\n",
  2062. err_cnt, (err_cnt > 1) ? "s" : "");
  2063. }
  2064. int qman_create_cgr(struct qman_cgr *cgr, u32 flags,
  2065. struct qm_mcc_initcgr *opts)
  2066. {
  2067. struct qm_mcr_querycgr cgr_state;
  2068. int ret;
  2069. struct qman_portal *p;
  2070. /*
  2071. * We have to check that the provided CGRID is within the limits of the
  2072. * data-structures, for obvious reasons. However we'll let h/w take
  2073. * care of determining whether it's within the limits of what exists on
  2074. * the SoC.
  2075. */
  2076. if (cgr->cgrid >= CGR_NUM)
  2077. return -EINVAL;
  2078. preempt_disable();
  2079. p = get_affine_portal();
  2080. qman_cgr_cpus[cgr->cgrid] = smp_processor_id();
  2081. preempt_enable();
  2082. cgr->chan = p->config->channel;
  2083. spin_lock(&p->cgr_lock);
  2084. if (opts) {
  2085. struct qm_mcc_initcgr local_opts = *opts;
  2086. ret = qman_query_cgr(cgr, &cgr_state);
  2087. if (ret)
  2088. goto out;
  2089. qm_cgr_cscn_targ_set(&local_opts.cgr, PORTAL_IDX(p),
  2090. be32_to_cpu(cgr_state.cgr.cscn_targ));
  2091. local_opts.we_mask |= cpu_to_be16(QM_CGR_WE_CSCN_TARG);
  2092. /* send init if flags indicate so */
  2093. if (flags & QMAN_CGR_FLAG_USE_INIT)
  2094. ret = qm_modify_cgr(cgr, QMAN_CGR_FLAG_USE_INIT,
  2095. &local_opts);
  2096. else
  2097. ret = qm_modify_cgr(cgr, 0, &local_opts);
  2098. if (ret)
  2099. goto out;
  2100. }
  2101. list_add(&cgr->node, &p->cgr_cbs);
  2102. /* Determine if newly added object requires its callback to be called */
  2103. ret = qman_query_cgr(cgr, &cgr_state);
  2104. if (ret) {
  2105. /* we can't go back, so proceed and return success */
  2106. dev_err(p->config->dev, "CGR HW state partially modified\n");
  2107. ret = 0;
  2108. goto out;
  2109. }
  2110. if (cgr->cb && cgr_state.cgr.cscn_en &&
  2111. qman_cgrs_get(&p->cgrs[1], cgr->cgrid))
  2112. cgr->cb(p, cgr, 1);
  2113. out:
  2114. spin_unlock(&p->cgr_lock);
  2115. put_affine_portal();
  2116. return ret;
  2117. }
  2118. EXPORT_SYMBOL(qman_create_cgr);
  2119. int qman_delete_cgr(struct qman_cgr *cgr)
  2120. {
  2121. unsigned long irqflags;
  2122. struct qm_mcr_querycgr cgr_state;
  2123. struct qm_mcc_initcgr local_opts;
  2124. int ret = 0;
  2125. struct qman_cgr *i;
  2126. struct qman_portal *p = get_affine_portal();
  2127. if (cgr->chan != p->config->channel) {
  2128. /* attempt to delete from other portal than creator */
  2129. dev_err(p->config->dev, "CGR not owned by current portal");
  2130. dev_dbg(p->config->dev, " create 0x%x, delete 0x%x\n",
  2131. cgr->chan, p->config->channel);
  2132. ret = -EINVAL;
  2133. goto put_portal;
  2134. }
  2135. memset(&local_opts, 0, sizeof(struct qm_mcc_initcgr));
  2136. spin_lock_irqsave(&p->cgr_lock, irqflags);
  2137. list_del(&cgr->node);
  2138. /*
  2139. * If there are no other CGR objects for this CGRID in the list,
  2140. * update CSCN_TARG accordingly
  2141. */
  2142. list_for_each_entry(i, &p->cgr_cbs, node)
  2143. if (i->cgrid == cgr->cgrid && i->cb)
  2144. goto release_lock;
  2145. ret = qman_query_cgr(cgr, &cgr_state);
  2146. if (ret) {
  2147. /* add back to the list */
  2148. list_add(&cgr->node, &p->cgr_cbs);
  2149. goto release_lock;
  2150. }
  2151. local_opts.we_mask = cpu_to_be16(QM_CGR_WE_CSCN_TARG);
  2152. qm_cgr_cscn_targ_clear(&local_opts.cgr, PORTAL_IDX(p),
  2153. be32_to_cpu(cgr_state.cgr.cscn_targ));
  2154. ret = qm_modify_cgr(cgr, 0, &local_opts);
  2155. if (ret)
  2156. /* add back to the list */
  2157. list_add(&cgr->node, &p->cgr_cbs);
  2158. release_lock:
  2159. spin_unlock_irqrestore(&p->cgr_lock, irqflags);
  2160. put_portal:
  2161. put_affine_portal();
  2162. return ret;
  2163. }
  2164. EXPORT_SYMBOL(qman_delete_cgr);
  2165. struct cgr_comp {
  2166. struct qman_cgr *cgr;
  2167. struct completion completion;
  2168. };
  2169. static void qman_delete_cgr_smp_call(void *p)
  2170. {
  2171. qman_delete_cgr((struct qman_cgr *)p);
  2172. }
  2173. void qman_delete_cgr_safe(struct qman_cgr *cgr)
  2174. {
  2175. preempt_disable();
  2176. if (qman_cgr_cpus[cgr->cgrid] != smp_processor_id()) {
  2177. smp_call_function_single(qman_cgr_cpus[cgr->cgrid],
  2178. qman_delete_cgr_smp_call, cgr, true);
  2179. preempt_enable();
  2180. return;
  2181. }
  2182. qman_delete_cgr(cgr);
  2183. preempt_enable();
  2184. }
  2185. EXPORT_SYMBOL(qman_delete_cgr_safe);
  2186. /* Cleanup FQs */
  2187. static int _qm_mr_consume_and_match_verb(struct qm_portal *p, int v)
  2188. {
  2189. const union qm_mr_entry *msg;
  2190. int found = 0;
  2191. qm_mr_pvb_update(p);
  2192. msg = qm_mr_current(p);
  2193. while (msg) {
  2194. if ((msg->verb & QM_MR_VERB_TYPE_MASK) == v)
  2195. found = 1;
  2196. qm_mr_next(p);
  2197. qm_mr_cci_consume_to_current(p);
  2198. qm_mr_pvb_update(p);
  2199. msg = qm_mr_current(p);
  2200. }
  2201. return found;
  2202. }
  2203. static int _qm_dqrr_consume_and_match(struct qm_portal *p, u32 fqid, int s,
  2204. bool wait)
  2205. {
  2206. const struct qm_dqrr_entry *dqrr;
  2207. int found = 0;
  2208. do {
  2209. qm_dqrr_pvb_update(p);
  2210. dqrr = qm_dqrr_current(p);
  2211. if (!dqrr)
  2212. cpu_relax();
  2213. } while (wait && !dqrr);
  2214. while (dqrr) {
  2215. if (qm_fqid_get(dqrr) == fqid && (dqrr->stat & s))
  2216. found = 1;
  2217. qm_dqrr_cdc_consume_1ptr(p, dqrr, 0);
  2218. qm_dqrr_pvb_update(p);
  2219. qm_dqrr_next(p);
  2220. dqrr = qm_dqrr_current(p);
  2221. }
  2222. return found;
  2223. }
  2224. #define qm_mr_drain(p, V) \
  2225. _qm_mr_consume_and_match_verb(p, QM_MR_VERB_##V)
  2226. #define qm_dqrr_drain(p, f, S) \
  2227. _qm_dqrr_consume_and_match(p, f, QM_DQRR_STAT_##S, false)
  2228. #define qm_dqrr_drain_wait(p, f, S) \
  2229. _qm_dqrr_consume_and_match(p, f, QM_DQRR_STAT_##S, true)
  2230. #define qm_dqrr_drain_nomatch(p) \
  2231. _qm_dqrr_consume_and_match(p, 0, 0, false)
  2232. static int qman_shutdown_fq(u32 fqid)
  2233. {
  2234. struct qman_portal *p;
  2235. struct device *dev;
  2236. union qm_mc_command *mcc;
  2237. union qm_mc_result *mcr;
  2238. int orl_empty, drain = 0, ret = 0;
  2239. u32 channel, wq, res;
  2240. u8 state;
  2241. p = get_affine_portal();
  2242. dev = p->config->dev;
  2243. /* Determine the state of the FQID */
  2244. mcc = qm_mc_start(&p->p);
  2245. qm_fqid_set(&mcc->fq, fqid);
  2246. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ_NP);
  2247. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2248. dev_err(dev, "QUERYFQ_NP timeout\n");
  2249. ret = -ETIMEDOUT;
  2250. goto out;
  2251. }
  2252. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ_NP);
  2253. state = mcr->queryfq_np.state & QM_MCR_NP_STATE_MASK;
  2254. if (state == QM_MCR_NP_STATE_OOS)
  2255. goto out; /* Already OOS, no need to do anymore checks */
  2256. /* Query which channel the FQ is using */
  2257. mcc = qm_mc_start(&p->p);
  2258. qm_fqid_set(&mcc->fq, fqid);
  2259. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ);
  2260. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2261. dev_err(dev, "QUERYFQ timeout\n");
  2262. ret = -ETIMEDOUT;
  2263. goto out;
  2264. }
  2265. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ);
  2266. /* Need to store these since the MCR gets reused */
  2267. channel = qm_fqd_get_chan(&mcr->queryfq.fqd);
  2268. wq = qm_fqd_get_wq(&mcr->queryfq.fqd);
  2269. switch (state) {
  2270. case QM_MCR_NP_STATE_TEN_SCHED:
  2271. case QM_MCR_NP_STATE_TRU_SCHED:
  2272. case QM_MCR_NP_STATE_ACTIVE:
  2273. case QM_MCR_NP_STATE_PARKED:
  2274. orl_empty = 0;
  2275. mcc = qm_mc_start(&p->p);
  2276. qm_fqid_set(&mcc->fq, fqid);
  2277. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_RETIRE);
  2278. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2279. dev_err(dev, "QUERYFQ_NP timeout\n");
  2280. ret = -ETIMEDOUT;
  2281. goto out;
  2282. }
  2283. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2284. QM_MCR_VERB_ALTER_RETIRE);
  2285. res = mcr->result; /* Make a copy as we reuse MCR below */
  2286. if (res == QM_MCR_RESULT_PENDING) {
  2287. /*
  2288. * Need to wait for the FQRN in the message ring, which
  2289. * will only occur once the FQ has been drained. In
  2290. * order for the FQ to drain the portal needs to be set
  2291. * to dequeue from the channel the FQ is scheduled on
  2292. */
  2293. int found_fqrn = 0;
  2294. u16 dequeue_wq = 0;
  2295. /* Flag that we need to drain FQ */
  2296. drain = 1;
  2297. if (channel >= qm_channel_pool1 &&
  2298. channel < qm_channel_pool1 + 15) {
  2299. /* Pool channel, enable the bit in the portal */
  2300. dequeue_wq = (channel -
  2301. qm_channel_pool1 + 1)<<4 | wq;
  2302. } else if (channel < qm_channel_pool1) {
  2303. /* Dedicated channel */
  2304. dequeue_wq = wq;
  2305. } else {
  2306. dev_err(dev, "Can't recover FQ 0x%x, ch: 0x%x",
  2307. fqid, channel);
  2308. ret = -EBUSY;
  2309. goto out;
  2310. }
  2311. /* Set the sdqcr to drain this channel */
  2312. if (channel < qm_channel_pool1)
  2313. qm_dqrr_sdqcr_set(&p->p,
  2314. QM_SDQCR_TYPE_ACTIVE |
  2315. QM_SDQCR_CHANNELS_DEDICATED);
  2316. else
  2317. qm_dqrr_sdqcr_set(&p->p,
  2318. QM_SDQCR_TYPE_ACTIVE |
  2319. QM_SDQCR_CHANNELS_POOL_CONV
  2320. (channel));
  2321. do {
  2322. /* Keep draining DQRR while checking the MR*/
  2323. qm_dqrr_drain_nomatch(&p->p);
  2324. /* Process message ring too */
  2325. found_fqrn = qm_mr_drain(&p->p, FQRN);
  2326. cpu_relax();
  2327. } while (!found_fqrn);
  2328. }
  2329. if (res != QM_MCR_RESULT_OK &&
  2330. res != QM_MCR_RESULT_PENDING) {
  2331. dev_err(dev, "retire_fq failed: FQ 0x%x, res=0x%x\n",
  2332. fqid, res);
  2333. ret = -EIO;
  2334. goto out;
  2335. }
  2336. if (!(mcr->alterfq.fqs & QM_MCR_FQS_ORLPRESENT)) {
  2337. /*
  2338. * ORL had no entries, no need to wait until the
  2339. * ERNs come in
  2340. */
  2341. orl_empty = 1;
  2342. }
  2343. /*
  2344. * Retirement succeeded, check to see if FQ needs
  2345. * to be drained
  2346. */
  2347. if (drain || mcr->alterfq.fqs & QM_MCR_FQS_NOTEMPTY) {
  2348. /* FQ is Not Empty, drain using volatile DQ commands */
  2349. do {
  2350. u32 vdqcr = fqid | QM_VDQCR_NUMFRAMES_SET(3);
  2351. qm_dqrr_vdqcr_set(&p->p, vdqcr);
  2352. /*
  2353. * Wait for a dequeue and process the dequeues,
  2354. * making sure to empty the ring completely
  2355. */
  2356. } while (qm_dqrr_drain_wait(&p->p, fqid, FQ_EMPTY));
  2357. }
  2358. qm_dqrr_sdqcr_set(&p->p, 0);
  2359. while (!orl_empty) {
  2360. /* Wait for the ORL to have been completely drained */
  2361. orl_empty = qm_mr_drain(&p->p, FQRL);
  2362. cpu_relax();
  2363. }
  2364. mcc = qm_mc_start(&p->p);
  2365. qm_fqid_set(&mcc->fq, fqid);
  2366. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  2367. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2368. ret = -ETIMEDOUT;
  2369. goto out;
  2370. }
  2371. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2372. QM_MCR_VERB_ALTER_OOS);
  2373. if (mcr->result != QM_MCR_RESULT_OK) {
  2374. dev_err(dev, "OOS after drain fail: FQ 0x%x (0x%x)\n",
  2375. fqid, mcr->result);
  2376. ret = -EIO;
  2377. goto out;
  2378. }
  2379. break;
  2380. case QM_MCR_NP_STATE_RETIRED:
  2381. /* Send OOS Command */
  2382. mcc = qm_mc_start(&p->p);
  2383. qm_fqid_set(&mcc->fq, fqid);
  2384. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  2385. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2386. ret = -ETIMEDOUT;
  2387. goto out;
  2388. }
  2389. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2390. QM_MCR_VERB_ALTER_OOS);
  2391. if (mcr->result) {
  2392. dev_err(dev, "OOS fail: FQ 0x%x (0x%x)\n",
  2393. fqid, mcr->result);
  2394. ret = -EIO;
  2395. goto out;
  2396. }
  2397. break;
  2398. case QM_MCR_NP_STATE_OOS:
  2399. /* Done */
  2400. break;
  2401. default:
  2402. ret = -EIO;
  2403. }
  2404. out:
  2405. put_affine_portal();
  2406. return ret;
  2407. }
  2408. const struct qm_portal_config *qman_get_qm_portal_config(
  2409. struct qman_portal *portal)
  2410. {
  2411. return portal->config;
  2412. }
  2413. EXPORT_SYMBOL(qman_get_qm_portal_config);
  2414. struct gen_pool *qm_fqalloc; /* FQID allocator */
  2415. struct gen_pool *qm_qpalloc; /* pool-channel allocator */
  2416. struct gen_pool *qm_cgralloc; /* CGR ID allocator */
  2417. static int qman_alloc_range(struct gen_pool *p, u32 *result, u32 cnt)
  2418. {
  2419. unsigned long addr;
  2420. if (!p)
  2421. return -ENODEV;
  2422. addr = gen_pool_alloc(p, cnt);
  2423. if (!addr)
  2424. return -ENOMEM;
  2425. *result = addr & ~DPAA_GENALLOC_OFF;
  2426. return 0;
  2427. }
  2428. int qman_alloc_fqid_range(u32 *result, u32 count)
  2429. {
  2430. return qman_alloc_range(qm_fqalloc, result, count);
  2431. }
  2432. EXPORT_SYMBOL(qman_alloc_fqid_range);
  2433. int qman_alloc_pool_range(u32 *result, u32 count)
  2434. {
  2435. return qman_alloc_range(qm_qpalloc, result, count);
  2436. }
  2437. EXPORT_SYMBOL(qman_alloc_pool_range);
  2438. int qman_alloc_cgrid_range(u32 *result, u32 count)
  2439. {
  2440. return qman_alloc_range(qm_cgralloc, result, count);
  2441. }
  2442. EXPORT_SYMBOL(qman_alloc_cgrid_range);
  2443. int qman_release_fqid(u32 fqid)
  2444. {
  2445. int ret = qman_shutdown_fq(fqid);
  2446. if (ret) {
  2447. pr_debug("FQID %d leaked\n", fqid);
  2448. return ret;
  2449. }
  2450. gen_pool_free(qm_fqalloc, fqid | DPAA_GENALLOC_OFF, 1);
  2451. return 0;
  2452. }
  2453. EXPORT_SYMBOL(qman_release_fqid);
  2454. static int qpool_cleanup(u32 qp)
  2455. {
  2456. /*
  2457. * We query all FQDs starting from
  2458. * FQID 1 until we get an "invalid FQID" error, looking for non-OOS FQDs
  2459. * whose destination channel is the pool-channel being released.
  2460. * When a non-OOS FQD is found we attempt to clean it up
  2461. */
  2462. struct qman_fq fq = {
  2463. .fqid = QM_FQID_RANGE_START
  2464. };
  2465. int err;
  2466. do {
  2467. struct qm_mcr_queryfq_np np;
  2468. err = qman_query_fq_np(&fq, &np);
  2469. if (err == -ERANGE)
  2470. /* FQID range exceeded, found no problems */
  2471. return 0;
  2472. else if (WARN_ON(err))
  2473. return err;
  2474. if ((np.state & QM_MCR_NP_STATE_MASK) != QM_MCR_NP_STATE_OOS) {
  2475. struct qm_fqd fqd;
  2476. err = qman_query_fq(&fq, &fqd);
  2477. if (WARN_ON(err))
  2478. return err;
  2479. if (qm_fqd_get_chan(&fqd) == qp) {
  2480. /* The channel is the FQ's target, clean it */
  2481. err = qman_shutdown_fq(fq.fqid);
  2482. if (err)
  2483. /*
  2484. * Couldn't shut down the FQ
  2485. * so the pool must be leaked
  2486. */
  2487. return err;
  2488. }
  2489. }
  2490. /* Move to the next FQID */
  2491. fq.fqid++;
  2492. } while (1);
  2493. }
  2494. int qman_release_pool(u32 qp)
  2495. {
  2496. int ret;
  2497. ret = qpool_cleanup(qp);
  2498. if (ret) {
  2499. pr_debug("CHID %d leaked\n", qp);
  2500. return ret;
  2501. }
  2502. gen_pool_free(qm_qpalloc, qp | DPAA_GENALLOC_OFF, 1);
  2503. return 0;
  2504. }
  2505. EXPORT_SYMBOL(qman_release_pool);
  2506. static int cgr_cleanup(u32 cgrid)
  2507. {
  2508. /*
  2509. * query all FQDs starting from FQID 1 until we get an "invalid FQID"
  2510. * error, looking for non-OOS FQDs whose CGR is the CGR being released
  2511. */
  2512. struct qman_fq fq = {
  2513. .fqid = QM_FQID_RANGE_START
  2514. };
  2515. int err;
  2516. do {
  2517. struct qm_mcr_queryfq_np np;
  2518. err = qman_query_fq_np(&fq, &np);
  2519. if (err == -ERANGE)
  2520. /* FQID range exceeded, found no problems */
  2521. return 0;
  2522. else if (WARN_ON(err))
  2523. return err;
  2524. if ((np.state & QM_MCR_NP_STATE_MASK) != QM_MCR_NP_STATE_OOS) {
  2525. struct qm_fqd fqd;
  2526. err = qman_query_fq(&fq, &fqd);
  2527. if (WARN_ON(err))
  2528. return err;
  2529. if (be16_to_cpu(fqd.fq_ctrl) & QM_FQCTRL_CGE &&
  2530. fqd.cgid == cgrid) {
  2531. pr_err("CRGID 0x%x is being used by FQID 0x%x, CGR will be leaked\n",
  2532. cgrid, fq.fqid);
  2533. return -EIO;
  2534. }
  2535. }
  2536. /* Move to the next FQID */
  2537. fq.fqid++;
  2538. } while (1);
  2539. }
  2540. int qman_release_cgrid(u32 cgrid)
  2541. {
  2542. int ret;
  2543. ret = cgr_cleanup(cgrid);
  2544. if (ret) {
  2545. pr_debug("CGRID %d leaked\n", cgrid);
  2546. return ret;
  2547. }
  2548. gen_pool_free(qm_cgralloc, cgrid | DPAA_GENALLOC_OFF, 1);
  2549. return 0;
  2550. }
  2551. EXPORT_SYMBOL(qman_release_cgrid);