qman.c 76 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929
  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;
  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. u8 rr0, rr1;
  745. struct qm_mc *mc = &portal->mc;
  746. mc->cr = portal->addr.ce + QM_CL_CR;
  747. mc->rr = portal->addr.ce + QM_CL_RR0;
  748. /*
  749. * The expected valid bit polarity for the next CR command is 0
  750. * if RR1 contains a valid response, and is 1 if RR0 contains a
  751. * valid response. If both RR contain all 0, this indicates either
  752. * that no command has been executed since reset (in which case the
  753. * expected valid bit polarity is 1)
  754. */
  755. rr0 = mc->rr->verb;
  756. rr1 = (mc->rr+1)->verb;
  757. if ((rr0 == 0 && rr1 == 0) || rr0 != 0)
  758. mc->rridx = 1;
  759. else
  760. mc->rridx = 0;
  761. mc->vbit = mc->rridx ? QM_MCC_VERB_VBIT : 0;
  762. #ifdef CONFIG_FSL_DPAA_CHECKING
  763. mc->state = qman_mc_idle;
  764. #endif
  765. return 0;
  766. }
  767. static inline void qm_mc_finish(struct qm_portal *portal)
  768. {
  769. #ifdef CONFIG_FSL_DPAA_CHECKING
  770. struct qm_mc *mc = &portal->mc;
  771. DPAA_ASSERT(mc->state == qman_mc_idle);
  772. if (mc->state != qman_mc_idle)
  773. pr_crit("Losing incomplete MC command\n");
  774. #endif
  775. }
  776. static inline union qm_mc_command *qm_mc_start(struct qm_portal *portal)
  777. {
  778. struct qm_mc *mc = &portal->mc;
  779. DPAA_ASSERT(mc->state == qman_mc_idle);
  780. #ifdef CONFIG_FSL_DPAA_CHECKING
  781. mc->state = qman_mc_user;
  782. #endif
  783. dpaa_zero(mc->cr);
  784. return mc->cr;
  785. }
  786. static inline void qm_mc_commit(struct qm_portal *portal, u8 myverb)
  787. {
  788. struct qm_mc *mc = &portal->mc;
  789. union qm_mc_result *rr = mc->rr + mc->rridx;
  790. DPAA_ASSERT(mc->state == qman_mc_user);
  791. dma_wmb();
  792. mc->cr->_ncw_verb = myverb | mc->vbit;
  793. dpaa_flush(mc->cr);
  794. dpaa_invalidate_touch_ro(rr);
  795. #ifdef CONFIG_FSL_DPAA_CHECKING
  796. mc->state = qman_mc_hw;
  797. #endif
  798. }
  799. static inline union qm_mc_result *qm_mc_result(struct qm_portal *portal)
  800. {
  801. struct qm_mc *mc = &portal->mc;
  802. union qm_mc_result *rr = mc->rr + mc->rridx;
  803. DPAA_ASSERT(mc->state == qman_mc_hw);
  804. /*
  805. * The inactive response register's verb byte always returns zero until
  806. * its command is submitted and completed. This includes the valid-bit,
  807. * in case you were wondering...
  808. */
  809. if (!rr->verb) {
  810. dpaa_invalidate_touch_ro(rr);
  811. return NULL;
  812. }
  813. mc->rridx ^= 1;
  814. mc->vbit ^= QM_MCC_VERB_VBIT;
  815. #ifdef CONFIG_FSL_DPAA_CHECKING
  816. mc->state = qman_mc_idle;
  817. #endif
  818. return rr;
  819. }
  820. static inline int qm_mc_result_timeout(struct qm_portal *portal,
  821. union qm_mc_result **mcr)
  822. {
  823. int timeout = QM_MCR_TIMEOUT;
  824. do {
  825. *mcr = qm_mc_result(portal);
  826. if (*mcr)
  827. break;
  828. udelay(1);
  829. } while (--timeout);
  830. return timeout;
  831. }
  832. static inline void fq_set(struct qman_fq *fq, u32 mask)
  833. {
  834. fq->flags |= mask;
  835. }
  836. static inline void fq_clear(struct qman_fq *fq, u32 mask)
  837. {
  838. fq->flags &= ~mask;
  839. }
  840. static inline int fq_isset(struct qman_fq *fq, u32 mask)
  841. {
  842. return fq->flags & mask;
  843. }
  844. static inline int fq_isclear(struct qman_fq *fq, u32 mask)
  845. {
  846. return !(fq->flags & mask);
  847. }
  848. struct qman_portal {
  849. struct qm_portal p;
  850. /* PORTAL_BITS_*** - dynamic, strictly internal */
  851. unsigned long bits;
  852. /* interrupt sources processed by portal_isr(), configurable */
  853. unsigned long irq_sources;
  854. u32 use_eqcr_ci_stashing;
  855. /* only 1 volatile dequeue at a time */
  856. struct qman_fq *vdqcr_owned;
  857. u32 sdqcr;
  858. /* probing time config params for cpu-affine portals */
  859. const struct qm_portal_config *config;
  860. /* 2-element array. cgrs[0] is mask, cgrs[1] is snapshot. */
  861. struct qman_cgrs *cgrs;
  862. /* linked-list of CSCN handlers. */
  863. struct list_head cgr_cbs;
  864. /* list lock */
  865. spinlock_t cgr_lock;
  866. struct work_struct congestion_work;
  867. struct work_struct mr_work;
  868. char irqname[MAX_IRQNAME];
  869. };
  870. static cpumask_t affine_mask;
  871. static DEFINE_SPINLOCK(affine_mask_lock);
  872. static u16 affine_channels[NR_CPUS];
  873. static DEFINE_PER_CPU(struct qman_portal, qman_affine_portal);
  874. struct qman_portal *affine_portals[NR_CPUS];
  875. static inline struct qman_portal *get_affine_portal(void)
  876. {
  877. return &get_cpu_var(qman_affine_portal);
  878. }
  879. static inline void put_affine_portal(void)
  880. {
  881. put_cpu_var(qman_affine_portal);
  882. }
  883. static struct workqueue_struct *qm_portal_wq;
  884. void qman_dqrr_set_ithresh(struct qman_portal *portal, u8 ithresh)
  885. {
  886. if (!portal)
  887. return;
  888. qm_dqrr_set_ithresh(&portal->p, ithresh);
  889. portal->p.dqrr.ithresh = ithresh;
  890. }
  891. EXPORT_SYMBOL(qman_dqrr_set_ithresh);
  892. void qman_dqrr_get_ithresh(struct qman_portal *portal, u8 *ithresh)
  893. {
  894. if (portal && ithresh)
  895. *ithresh = portal->p.dqrr.ithresh;
  896. }
  897. EXPORT_SYMBOL(qman_dqrr_get_ithresh);
  898. void qman_portal_get_iperiod(struct qman_portal *portal, u32 *iperiod)
  899. {
  900. if (portal && iperiod)
  901. *iperiod = qm_in(&portal->p, QM_REG_ITPR);
  902. }
  903. EXPORT_SYMBOL(qman_portal_get_iperiod);
  904. void qman_portal_set_iperiod(struct qman_portal *portal, u32 iperiod)
  905. {
  906. if (portal)
  907. qm_out(&portal->p, QM_REG_ITPR, iperiod);
  908. }
  909. EXPORT_SYMBOL(qman_portal_set_iperiod);
  910. int qman_wq_alloc(void)
  911. {
  912. qm_portal_wq = alloc_workqueue("qman_portal_wq", 0, 1);
  913. if (!qm_portal_wq)
  914. return -ENOMEM;
  915. return 0;
  916. }
  917. /*
  918. * This is what everything can wait on, even if it migrates to a different cpu
  919. * to the one whose affine portal it is waiting on.
  920. */
  921. static DECLARE_WAIT_QUEUE_HEAD(affine_queue);
  922. static struct qman_fq **fq_table;
  923. static u32 num_fqids;
  924. int qman_alloc_fq_table(u32 _num_fqids)
  925. {
  926. num_fqids = _num_fqids;
  927. fq_table = vzalloc(array3_size(sizeof(struct qman_fq *),
  928. num_fqids, 2));
  929. if (!fq_table)
  930. return -ENOMEM;
  931. pr_debug("Allocated fq lookup table at %p, entry count %u\n",
  932. fq_table, num_fqids * 2);
  933. return 0;
  934. }
  935. static struct qman_fq *idx_to_fq(u32 idx)
  936. {
  937. struct qman_fq *fq;
  938. #ifdef CONFIG_FSL_DPAA_CHECKING
  939. if (WARN_ON(idx >= num_fqids * 2))
  940. return NULL;
  941. #endif
  942. fq = fq_table[idx];
  943. DPAA_ASSERT(!fq || idx == fq->idx);
  944. return fq;
  945. }
  946. /*
  947. * Only returns full-service fq objects, not enqueue-only
  948. * references (QMAN_FQ_FLAG_NO_MODIFY).
  949. */
  950. static struct qman_fq *fqid_to_fq(u32 fqid)
  951. {
  952. return idx_to_fq(fqid * 2);
  953. }
  954. static struct qman_fq *tag_to_fq(u32 tag)
  955. {
  956. #if BITS_PER_LONG == 64
  957. return idx_to_fq(tag);
  958. #else
  959. return (struct qman_fq *)tag;
  960. #endif
  961. }
  962. static u32 fq_to_tag(struct qman_fq *fq)
  963. {
  964. #if BITS_PER_LONG == 64
  965. return fq->idx;
  966. #else
  967. return (u32)fq;
  968. #endif
  969. }
  970. static u32 __poll_portal_slow(struct qman_portal *p, u32 is);
  971. static inline unsigned int __poll_portal_fast(struct qman_portal *p,
  972. unsigned int poll_limit);
  973. static void qm_congestion_task(struct work_struct *work);
  974. static void qm_mr_process_task(struct work_struct *work);
  975. static irqreturn_t portal_isr(int irq, void *ptr)
  976. {
  977. struct qman_portal *p = ptr;
  978. u32 clear = QM_DQAVAIL_MASK | p->irq_sources;
  979. u32 is = qm_in(&p->p, QM_REG_ISR) & p->irq_sources;
  980. if (unlikely(!is))
  981. return IRQ_NONE;
  982. /* DQRR-handling if it's interrupt-driven */
  983. if (is & QM_PIRQ_DQRI)
  984. __poll_portal_fast(p, QMAN_POLL_LIMIT);
  985. /* Handling of anything else that's interrupt-driven */
  986. clear |= __poll_portal_slow(p, is);
  987. qm_out(&p->p, QM_REG_ISR, clear);
  988. return IRQ_HANDLED;
  989. }
  990. static int drain_mr_fqrni(struct qm_portal *p)
  991. {
  992. const union qm_mr_entry *msg;
  993. loop:
  994. msg = qm_mr_current(p);
  995. if (!msg) {
  996. /*
  997. * if MR was full and h/w had other FQRNI entries to produce, we
  998. * need to allow it time to produce those entries once the
  999. * existing entries are consumed. A worst-case situation
  1000. * (fully-loaded system) means h/w sequencers may have to do 3-4
  1001. * other things before servicing the portal's MR pump, each of
  1002. * which (if slow) may take ~50 qman cycles (which is ~200
  1003. * processor cycles). So rounding up and then multiplying this
  1004. * worst-case estimate by a factor of 10, just to be
  1005. * ultra-paranoid, goes as high as 10,000 cycles. NB, we consume
  1006. * one entry at a time, so h/w has an opportunity to produce new
  1007. * entries well before the ring has been fully consumed, so
  1008. * we're being *really* paranoid here.
  1009. */
  1010. msleep(1);
  1011. msg = qm_mr_current(p);
  1012. if (!msg)
  1013. return 0;
  1014. }
  1015. if ((msg->verb & QM_MR_VERB_TYPE_MASK) != QM_MR_VERB_FQRNI) {
  1016. /* We aren't draining anything but FQRNIs */
  1017. pr_err("Found verb 0x%x in MR\n", msg->verb);
  1018. return -1;
  1019. }
  1020. qm_mr_next(p);
  1021. qm_mr_cci_consume(p, 1);
  1022. goto loop;
  1023. }
  1024. static int qman_create_portal(struct qman_portal *portal,
  1025. const struct qm_portal_config *c,
  1026. const struct qman_cgrs *cgrs)
  1027. {
  1028. struct qm_portal *p;
  1029. int ret;
  1030. u32 isdr;
  1031. p = &portal->p;
  1032. #ifdef CONFIG_FSL_PAMU
  1033. /* PAMU is required for stashing */
  1034. portal->use_eqcr_ci_stashing = ((qman_ip_rev >= QMAN_REV30) ? 1 : 0);
  1035. #else
  1036. portal->use_eqcr_ci_stashing = 0;
  1037. #endif
  1038. /*
  1039. * prep the low-level portal struct with the mapped addresses from the
  1040. * config, everything that follows depends on it and "config" is more
  1041. * for (de)reference
  1042. */
  1043. p->addr.ce = c->addr_virt_ce;
  1044. p->addr.ce_be = c->addr_virt_ce;
  1045. p->addr.ci = c->addr_virt_ci;
  1046. /*
  1047. * If CI-stashing is used, the current defaults use a threshold of 3,
  1048. * and stash with high-than-DQRR priority.
  1049. */
  1050. if (qm_eqcr_init(p, qm_eqcr_pvb,
  1051. portal->use_eqcr_ci_stashing ? 3 : 0, 1)) {
  1052. dev_err(c->dev, "EQCR initialisation failed\n");
  1053. goto fail_eqcr;
  1054. }
  1055. if (qm_dqrr_init(p, c, qm_dqrr_dpush, qm_dqrr_pvb,
  1056. qm_dqrr_cdc, DQRR_MAXFILL)) {
  1057. dev_err(c->dev, "DQRR initialisation failed\n");
  1058. goto fail_dqrr;
  1059. }
  1060. if (qm_mr_init(p, qm_mr_pvb, qm_mr_cci)) {
  1061. dev_err(c->dev, "MR initialisation failed\n");
  1062. goto fail_mr;
  1063. }
  1064. if (qm_mc_init(p)) {
  1065. dev_err(c->dev, "MC initialisation failed\n");
  1066. goto fail_mc;
  1067. }
  1068. /* static interrupt-gating controls */
  1069. qm_dqrr_set_ithresh(p, QMAN_PIRQ_DQRR_ITHRESH);
  1070. qm_mr_set_ithresh(p, QMAN_PIRQ_MR_ITHRESH);
  1071. qm_out(p, QM_REG_ITPR, QMAN_PIRQ_IPERIOD);
  1072. portal->cgrs = kmalloc_array(2, sizeof(*cgrs), GFP_KERNEL);
  1073. if (!portal->cgrs)
  1074. goto fail_cgrs;
  1075. /* initial snapshot is no-depletion */
  1076. qman_cgrs_init(&portal->cgrs[1]);
  1077. if (cgrs)
  1078. portal->cgrs[0] = *cgrs;
  1079. else
  1080. /* if the given mask is NULL, assume all CGRs can be seen */
  1081. qman_cgrs_fill(&portal->cgrs[0]);
  1082. INIT_LIST_HEAD(&portal->cgr_cbs);
  1083. spin_lock_init(&portal->cgr_lock);
  1084. INIT_WORK(&portal->congestion_work, qm_congestion_task);
  1085. INIT_WORK(&portal->mr_work, qm_mr_process_task);
  1086. portal->bits = 0;
  1087. portal->sdqcr = QM_SDQCR_SOURCE_CHANNELS | QM_SDQCR_COUNT_UPTO3 |
  1088. QM_SDQCR_DEDICATED_PRECEDENCE | QM_SDQCR_TYPE_PRIO_QOS |
  1089. QM_SDQCR_TOKEN_SET(0xab) | QM_SDQCR_CHANNELS_DEDICATED;
  1090. isdr = 0xffffffff;
  1091. qm_out(p, QM_REG_ISDR, isdr);
  1092. portal->irq_sources = 0;
  1093. qm_out(p, QM_REG_IER, 0);
  1094. qm_out(p, QM_REG_ISR, 0xffffffff);
  1095. snprintf(portal->irqname, MAX_IRQNAME, IRQNAME, c->cpu);
  1096. if (request_irq(c->irq, portal_isr, 0, portal->irqname, portal)) {
  1097. dev_err(c->dev, "request_irq() failed\n");
  1098. goto fail_irq;
  1099. }
  1100. if (dpaa_set_portal_irq_affinity(c->dev, c->irq, c->cpu))
  1101. goto fail_affinity;
  1102. /* Need EQCR to be empty before continuing */
  1103. isdr &= ~QM_PIRQ_EQCI;
  1104. qm_out(p, QM_REG_ISDR, isdr);
  1105. ret = qm_eqcr_get_fill(p);
  1106. if (ret) {
  1107. dev_err(c->dev, "EQCR unclean\n");
  1108. goto fail_eqcr_empty;
  1109. }
  1110. isdr &= ~(QM_PIRQ_DQRI | QM_PIRQ_MRI);
  1111. qm_out(p, QM_REG_ISDR, isdr);
  1112. if (qm_dqrr_current(p)) {
  1113. dev_err(c->dev, "DQRR unclean\n");
  1114. qm_dqrr_cdc_consume_n(p, 0xffff);
  1115. }
  1116. if (qm_mr_current(p) && drain_mr_fqrni(p)) {
  1117. /* special handling, drain just in case it's a few FQRNIs */
  1118. const union qm_mr_entry *e = qm_mr_current(p);
  1119. dev_err(c->dev, "MR dirty, VB 0x%x, rc 0x%x, addr 0x%llx\n",
  1120. e->verb, e->ern.rc, qm_fd_addr_get64(&e->ern.fd));
  1121. goto fail_dqrr_mr_empty;
  1122. }
  1123. /* Success */
  1124. portal->config = c;
  1125. qm_out(p, QM_REG_ISDR, 0);
  1126. qm_out(p, QM_REG_IIR, 0);
  1127. /* Write a sane SDQCR */
  1128. qm_dqrr_sdqcr_set(p, portal->sdqcr);
  1129. return 0;
  1130. fail_dqrr_mr_empty:
  1131. fail_eqcr_empty:
  1132. fail_affinity:
  1133. free_irq(c->irq, portal);
  1134. fail_irq:
  1135. kfree(portal->cgrs);
  1136. fail_cgrs:
  1137. qm_mc_finish(p);
  1138. fail_mc:
  1139. qm_mr_finish(p);
  1140. fail_mr:
  1141. qm_dqrr_finish(p);
  1142. fail_dqrr:
  1143. qm_eqcr_finish(p);
  1144. fail_eqcr:
  1145. return -EIO;
  1146. }
  1147. struct qman_portal *qman_create_affine_portal(const struct qm_portal_config *c,
  1148. const struct qman_cgrs *cgrs)
  1149. {
  1150. struct qman_portal *portal;
  1151. int err;
  1152. portal = &per_cpu(qman_affine_portal, c->cpu);
  1153. err = qman_create_portal(portal, c, cgrs);
  1154. if (err)
  1155. return NULL;
  1156. spin_lock(&affine_mask_lock);
  1157. cpumask_set_cpu(c->cpu, &affine_mask);
  1158. affine_channels[c->cpu] = c->channel;
  1159. affine_portals[c->cpu] = portal;
  1160. spin_unlock(&affine_mask_lock);
  1161. return portal;
  1162. }
  1163. static void qman_destroy_portal(struct qman_portal *qm)
  1164. {
  1165. const struct qm_portal_config *pcfg;
  1166. /* Stop dequeues on the portal */
  1167. qm_dqrr_sdqcr_set(&qm->p, 0);
  1168. /*
  1169. * NB we do this to "quiesce" EQCR. If we add enqueue-completions or
  1170. * something related to QM_PIRQ_EQCI, this may need fixing.
  1171. * Also, due to the prefetching model used for CI updates in the enqueue
  1172. * path, this update will only invalidate the CI cacheline *after*
  1173. * working on it, so we need to call this twice to ensure a full update
  1174. * irrespective of where the enqueue processing was at when the teardown
  1175. * began.
  1176. */
  1177. qm_eqcr_cce_update(&qm->p);
  1178. qm_eqcr_cce_update(&qm->p);
  1179. pcfg = qm->config;
  1180. free_irq(pcfg->irq, qm);
  1181. kfree(qm->cgrs);
  1182. qm_mc_finish(&qm->p);
  1183. qm_mr_finish(&qm->p);
  1184. qm_dqrr_finish(&qm->p);
  1185. qm_eqcr_finish(&qm->p);
  1186. qm->config = NULL;
  1187. }
  1188. const struct qm_portal_config *qman_destroy_affine_portal(void)
  1189. {
  1190. struct qman_portal *qm = get_affine_portal();
  1191. const struct qm_portal_config *pcfg;
  1192. int cpu;
  1193. pcfg = qm->config;
  1194. cpu = pcfg->cpu;
  1195. qman_destroy_portal(qm);
  1196. spin_lock(&affine_mask_lock);
  1197. cpumask_clear_cpu(cpu, &affine_mask);
  1198. spin_unlock(&affine_mask_lock);
  1199. put_affine_portal();
  1200. return pcfg;
  1201. }
  1202. /* Inline helper to reduce nesting in __poll_portal_slow() */
  1203. static inline void fq_state_change(struct qman_portal *p, struct qman_fq *fq,
  1204. const union qm_mr_entry *msg, u8 verb)
  1205. {
  1206. switch (verb) {
  1207. case QM_MR_VERB_FQRL:
  1208. DPAA_ASSERT(fq_isset(fq, QMAN_FQ_STATE_ORL));
  1209. fq_clear(fq, QMAN_FQ_STATE_ORL);
  1210. break;
  1211. case QM_MR_VERB_FQRN:
  1212. DPAA_ASSERT(fq->state == qman_fq_state_parked ||
  1213. fq->state == qman_fq_state_sched);
  1214. DPAA_ASSERT(fq_isset(fq, QMAN_FQ_STATE_CHANGING));
  1215. fq_clear(fq, QMAN_FQ_STATE_CHANGING);
  1216. if (msg->fq.fqs & QM_MR_FQS_NOTEMPTY)
  1217. fq_set(fq, QMAN_FQ_STATE_NE);
  1218. if (msg->fq.fqs & QM_MR_FQS_ORLPRESENT)
  1219. fq_set(fq, QMAN_FQ_STATE_ORL);
  1220. fq->state = qman_fq_state_retired;
  1221. break;
  1222. case QM_MR_VERB_FQPN:
  1223. DPAA_ASSERT(fq->state == qman_fq_state_sched);
  1224. DPAA_ASSERT(fq_isclear(fq, QMAN_FQ_STATE_CHANGING));
  1225. fq->state = qman_fq_state_parked;
  1226. }
  1227. }
  1228. static void qm_congestion_task(struct work_struct *work)
  1229. {
  1230. struct qman_portal *p = container_of(work, struct qman_portal,
  1231. congestion_work);
  1232. struct qman_cgrs rr, c;
  1233. union qm_mc_result *mcr;
  1234. struct qman_cgr *cgr;
  1235. spin_lock(&p->cgr_lock);
  1236. qm_mc_start(&p->p);
  1237. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYCONGESTION);
  1238. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1239. spin_unlock(&p->cgr_lock);
  1240. dev_crit(p->config->dev, "QUERYCONGESTION timeout\n");
  1241. qman_p_irqsource_add(p, QM_PIRQ_CSCI);
  1242. return;
  1243. }
  1244. /* mask out the ones I'm not interested in */
  1245. qman_cgrs_and(&rr, (struct qman_cgrs *)&mcr->querycongestion.state,
  1246. &p->cgrs[0]);
  1247. /* check previous snapshot for delta, enter/exit congestion */
  1248. qman_cgrs_xor(&c, &rr, &p->cgrs[1]);
  1249. /* update snapshot */
  1250. qman_cgrs_cp(&p->cgrs[1], &rr);
  1251. /* Invoke callback */
  1252. list_for_each_entry(cgr, &p->cgr_cbs, node)
  1253. if (cgr->cb && qman_cgrs_get(&c, cgr->cgrid))
  1254. cgr->cb(p, cgr, qman_cgrs_get(&rr, cgr->cgrid));
  1255. spin_unlock(&p->cgr_lock);
  1256. qman_p_irqsource_add(p, QM_PIRQ_CSCI);
  1257. }
  1258. static void qm_mr_process_task(struct work_struct *work)
  1259. {
  1260. struct qman_portal *p = container_of(work, struct qman_portal,
  1261. mr_work);
  1262. const union qm_mr_entry *msg;
  1263. struct qman_fq *fq;
  1264. u8 verb, num = 0;
  1265. preempt_disable();
  1266. while (1) {
  1267. qm_mr_pvb_update(&p->p);
  1268. msg = qm_mr_current(&p->p);
  1269. if (!msg)
  1270. break;
  1271. verb = msg->verb & QM_MR_VERB_TYPE_MASK;
  1272. /* The message is a software ERN iff the 0x20 bit is clear */
  1273. if (verb & 0x20) {
  1274. switch (verb) {
  1275. case QM_MR_VERB_FQRNI:
  1276. /* nada, we drop FQRNIs on the floor */
  1277. break;
  1278. case QM_MR_VERB_FQRN:
  1279. case QM_MR_VERB_FQRL:
  1280. /* Lookup in the retirement table */
  1281. fq = fqid_to_fq(qm_fqid_get(&msg->fq));
  1282. if (WARN_ON(!fq))
  1283. break;
  1284. fq_state_change(p, fq, msg, verb);
  1285. if (fq->cb.fqs)
  1286. fq->cb.fqs(p, fq, msg);
  1287. break;
  1288. case QM_MR_VERB_FQPN:
  1289. /* Parked */
  1290. fq = tag_to_fq(be32_to_cpu(msg->fq.context_b));
  1291. fq_state_change(p, fq, msg, verb);
  1292. if (fq->cb.fqs)
  1293. fq->cb.fqs(p, fq, msg);
  1294. break;
  1295. case QM_MR_VERB_DC_ERN:
  1296. /* DCP ERN */
  1297. pr_crit_once("Leaking DCP ERNs!\n");
  1298. break;
  1299. default:
  1300. pr_crit("Invalid MR verb 0x%02x\n", verb);
  1301. }
  1302. } else {
  1303. /* Its a software ERN */
  1304. fq = tag_to_fq(be32_to_cpu(msg->ern.tag));
  1305. fq->cb.ern(p, fq, msg);
  1306. }
  1307. num++;
  1308. qm_mr_next(&p->p);
  1309. }
  1310. qm_mr_cci_consume(&p->p, num);
  1311. qman_p_irqsource_add(p, QM_PIRQ_MRI);
  1312. preempt_enable();
  1313. }
  1314. static u32 __poll_portal_slow(struct qman_portal *p, u32 is)
  1315. {
  1316. if (is & QM_PIRQ_CSCI) {
  1317. qman_p_irqsource_remove(p, QM_PIRQ_CSCI);
  1318. queue_work_on(smp_processor_id(), qm_portal_wq,
  1319. &p->congestion_work);
  1320. }
  1321. if (is & QM_PIRQ_EQRI) {
  1322. qm_eqcr_cce_update(&p->p);
  1323. qm_eqcr_set_ithresh(&p->p, 0);
  1324. wake_up(&affine_queue);
  1325. }
  1326. if (is & QM_PIRQ_MRI) {
  1327. qman_p_irqsource_remove(p, QM_PIRQ_MRI);
  1328. queue_work_on(smp_processor_id(), qm_portal_wq,
  1329. &p->mr_work);
  1330. }
  1331. return is;
  1332. }
  1333. /*
  1334. * remove some slowish-path stuff from the "fast path" and make sure it isn't
  1335. * inlined.
  1336. */
  1337. static noinline void clear_vdqcr(struct qman_portal *p, struct qman_fq *fq)
  1338. {
  1339. p->vdqcr_owned = NULL;
  1340. fq_clear(fq, QMAN_FQ_STATE_VDQCR);
  1341. wake_up(&affine_queue);
  1342. }
  1343. /*
  1344. * The only states that would conflict with other things if they ran at the
  1345. * same time on the same cpu are:
  1346. *
  1347. * (i) setting/clearing vdqcr_owned, and
  1348. * (ii) clearing the NE (Not Empty) flag.
  1349. *
  1350. * Both are safe. Because;
  1351. *
  1352. * (i) this clearing can only occur after qman_volatile_dequeue() has set the
  1353. * vdqcr_owned field (which it does before setting VDQCR), and
  1354. * qman_volatile_dequeue() blocks interrupts and preemption while this is
  1355. * done so that we can't interfere.
  1356. * (ii) the NE flag is only cleared after qman_retire_fq() has set it, and as
  1357. * with (i) that API prevents us from interfering until it's safe.
  1358. *
  1359. * The good thing is that qman_volatile_dequeue() and qman_retire_fq() run far
  1360. * less frequently (ie. per-FQ) than __poll_portal_fast() does, so the nett
  1361. * advantage comes from this function not having to "lock" anything at all.
  1362. *
  1363. * Note also that the callbacks are invoked at points which are safe against the
  1364. * above potential conflicts, but that this function itself is not re-entrant
  1365. * (this is because the function tracks one end of each FIFO in the portal and
  1366. * we do *not* want to lock that). So the consequence is that it is safe for
  1367. * user callbacks to call into any QMan API.
  1368. */
  1369. static inline unsigned int __poll_portal_fast(struct qman_portal *p,
  1370. unsigned int poll_limit)
  1371. {
  1372. const struct qm_dqrr_entry *dq;
  1373. struct qman_fq *fq;
  1374. enum qman_cb_dqrr_result res;
  1375. unsigned int limit = 0;
  1376. do {
  1377. qm_dqrr_pvb_update(&p->p);
  1378. dq = qm_dqrr_current(&p->p);
  1379. if (!dq)
  1380. break;
  1381. if (dq->stat & QM_DQRR_STAT_UNSCHEDULED) {
  1382. /*
  1383. * VDQCR: don't trust context_b as the FQ may have
  1384. * been configured for h/w consumption and we're
  1385. * draining it post-retirement.
  1386. */
  1387. fq = p->vdqcr_owned;
  1388. /*
  1389. * We only set QMAN_FQ_STATE_NE when retiring, so we
  1390. * only need to check for clearing it when doing
  1391. * volatile dequeues. It's one less thing to check
  1392. * in the critical path (SDQCR).
  1393. */
  1394. if (dq->stat & QM_DQRR_STAT_FQ_EMPTY)
  1395. fq_clear(fq, QMAN_FQ_STATE_NE);
  1396. /*
  1397. * This is duplicated from the SDQCR code, but we
  1398. * have stuff to do before *and* after this callback,
  1399. * and we don't want multiple if()s in the critical
  1400. * path (SDQCR).
  1401. */
  1402. res = fq->cb.dqrr(p, fq, dq);
  1403. if (res == qman_cb_dqrr_stop)
  1404. break;
  1405. /* Check for VDQCR completion */
  1406. if (dq->stat & QM_DQRR_STAT_DQCR_EXPIRED)
  1407. clear_vdqcr(p, fq);
  1408. } else {
  1409. /* SDQCR: context_b points to the FQ */
  1410. fq = tag_to_fq(be32_to_cpu(dq->context_b));
  1411. /* Now let the callback do its stuff */
  1412. res = fq->cb.dqrr(p, fq, dq);
  1413. /*
  1414. * The callback can request that we exit without
  1415. * consuming this entry nor advancing;
  1416. */
  1417. if (res == qman_cb_dqrr_stop)
  1418. break;
  1419. }
  1420. /* Interpret 'dq' from a driver perspective. */
  1421. /*
  1422. * Parking isn't possible unless HELDACTIVE was set. NB,
  1423. * FORCEELIGIBLE implies HELDACTIVE, so we only need to
  1424. * check for HELDACTIVE to cover both.
  1425. */
  1426. DPAA_ASSERT((dq->stat & QM_DQRR_STAT_FQ_HELDACTIVE) ||
  1427. (res != qman_cb_dqrr_park));
  1428. /* just means "skip it, I'll consume it myself later on" */
  1429. if (res != qman_cb_dqrr_defer)
  1430. qm_dqrr_cdc_consume_1ptr(&p->p, dq,
  1431. res == qman_cb_dqrr_park);
  1432. /* Move forward */
  1433. qm_dqrr_next(&p->p);
  1434. /*
  1435. * Entry processed and consumed, increment our counter. The
  1436. * callback can request that we exit after consuming the
  1437. * entry, and we also exit if we reach our processing limit,
  1438. * so loop back only if neither of these conditions is met.
  1439. */
  1440. } while (++limit < poll_limit && res != qman_cb_dqrr_consume_stop);
  1441. return limit;
  1442. }
  1443. void qman_p_irqsource_add(struct qman_portal *p, u32 bits)
  1444. {
  1445. unsigned long irqflags;
  1446. local_irq_save(irqflags);
  1447. p->irq_sources |= bits & QM_PIRQ_VISIBLE;
  1448. qm_out(&p->p, QM_REG_IER, p->irq_sources);
  1449. local_irq_restore(irqflags);
  1450. }
  1451. EXPORT_SYMBOL(qman_p_irqsource_add);
  1452. void qman_p_irqsource_remove(struct qman_portal *p, u32 bits)
  1453. {
  1454. unsigned long irqflags;
  1455. u32 ier;
  1456. /*
  1457. * Our interrupt handler only processes+clears status register bits that
  1458. * are in p->irq_sources. As we're trimming that mask, if one of them
  1459. * were to assert in the status register just before we remove it from
  1460. * the enable register, there would be an interrupt-storm when we
  1461. * release the IRQ lock. So we wait for the enable register update to
  1462. * take effect in h/w (by reading it back) and then clear all other bits
  1463. * in the status register. Ie. we clear them from ISR once it's certain
  1464. * IER won't allow them to reassert.
  1465. */
  1466. local_irq_save(irqflags);
  1467. bits &= QM_PIRQ_VISIBLE;
  1468. p->irq_sources &= ~bits;
  1469. qm_out(&p->p, QM_REG_IER, p->irq_sources);
  1470. ier = qm_in(&p->p, QM_REG_IER);
  1471. /*
  1472. * Using "~ier" (rather than "bits" or "~p->irq_sources") creates a
  1473. * data-dependency, ie. to protect against re-ordering.
  1474. */
  1475. qm_out(&p->p, QM_REG_ISR, ~ier);
  1476. local_irq_restore(irqflags);
  1477. }
  1478. EXPORT_SYMBOL(qman_p_irqsource_remove);
  1479. const cpumask_t *qman_affine_cpus(void)
  1480. {
  1481. return &affine_mask;
  1482. }
  1483. EXPORT_SYMBOL(qman_affine_cpus);
  1484. u16 qman_affine_channel(int cpu)
  1485. {
  1486. if (cpu < 0) {
  1487. struct qman_portal *portal = get_affine_portal();
  1488. cpu = portal->config->cpu;
  1489. put_affine_portal();
  1490. }
  1491. WARN_ON(!cpumask_test_cpu(cpu, &affine_mask));
  1492. return affine_channels[cpu];
  1493. }
  1494. EXPORT_SYMBOL(qman_affine_channel);
  1495. struct qman_portal *qman_get_affine_portal(int cpu)
  1496. {
  1497. return affine_portals[cpu];
  1498. }
  1499. EXPORT_SYMBOL(qman_get_affine_portal);
  1500. int qman_p_poll_dqrr(struct qman_portal *p, unsigned int limit)
  1501. {
  1502. return __poll_portal_fast(p, limit);
  1503. }
  1504. EXPORT_SYMBOL(qman_p_poll_dqrr);
  1505. void qman_p_static_dequeue_add(struct qman_portal *p, u32 pools)
  1506. {
  1507. unsigned long irqflags;
  1508. local_irq_save(irqflags);
  1509. pools &= p->config->pools;
  1510. p->sdqcr |= pools;
  1511. qm_dqrr_sdqcr_set(&p->p, p->sdqcr);
  1512. local_irq_restore(irqflags);
  1513. }
  1514. EXPORT_SYMBOL(qman_p_static_dequeue_add);
  1515. /* Frame queue API */
  1516. static const char *mcr_result_str(u8 result)
  1517. {
  1518. switch (result) {
  1519. case QM_MCR_RESULT_NULL:
  1520. return "QM_MCR_RESULT_NULL";
  1521. case QM_MCR_RESULT_OK:
  1522. return "QM_MCR_RESULT_OK";
  1523. case QM_MCR_RESULT_ERR_FQID:
  1524. return "QM_MCR_RESULT_ERR_FQID";
  1525. case QM_MCR_RESULT_ERR_FQSTATE:
  1526. return "QM_MCR_RESULT_ERR_FQSTATE";
  1527. case QM_MCR_RESULT_ERR_NOTEMPTY:
  1528. return "QM_MCR_RESULT_ERR_NOTEMPTY";
  1529. case QM_MCR_RESULT_PENDING:
  1530. return "QM_MCR_RESULT_PENDING";
  1531. case QM_MCR_RESULT_ERR_BADCOMMAND:
  1532. return "QM_MCR_RESULT_ERR_BADCOMMAND";
  1533. }
  1534. return "<unknown MCR result>";
  1535. }
  1536. int qman_create_fq(u32 fqid, u32 flags, struct qman_fq *fq)
  1537. {
  1538. if (flags & QMAN_FQ_FLAG_DYNAMIC_FQID) {
  1539. int ret = qman_alloc_fqid(&fqid);
  1540. if (ret)
  1541. return ret;
  1542. }
  1543. fq->fqid = fqid;
  1544. fq->flags = flags;
  1545. fq->state = qman_fq_state_oos;
  1546. fq->cgr_groupid = 0;
  1547. /* A context_b of 0 is allegedly special, so don't use that fqid */
  1548. if (fqid == 0 || fqid >= num_fqids) {
  1549. WARN(1, "bad fqid %d\n", fqid);
  1550. return -EINVAL;
  1551. }
  1552. fq->idx = fqid * 2;
  1553. if (flags & QMAN_FQ_FLAG_NO_MODIFY)
  1554. fq->idx++;
  1555. WARN_ON(fq_table[fq->idx]);
  1556. fq_table[fq->idx] = fq;
  1557. return 0;
  1558. }
  1559. EXPORT_SYMBOL(qman_create_fq);
  1560. void qman_destroy_fq(struct qman_fq *fq)
  1561. {
  1562. /*
  1563. * We don't need to lock the FQ as it is a pre-condition that the FQ be
  1564. * quiesced. Instead, run some checks.
  1565. */
  1566. switch (fq->state) {
  1567. case qman_fq_state_parked:
  1568. case qman_fq_state_oos:
  1569. if (fq_isset(fq, QMAN_FQ_FLAG_DYNAMIC_FQID))
  1570. qman_release_fqid(fq->fqid);
  1571. DPAA_ASSERT(fq_table[fq->idx]);
  1572. fq_table[fq->idx] = NULL;
  1573. return;
  1574. default:
  1575. break;
  1576. }
  1577. DPAA_ASSERT(NULL == "qman_free_fq() on unquiesced FQ!");
  1578. }
  1579. EXPORT_SYMBOL(qman_destroy_fq);
  1580. u32 qman_fq_fqid(struct qman_fq *fq)
  1581. {
  1582. return fq->fqid;
  1583. }
  1584. EXPORT_SYMBOL(qman_fq_fqid);
  1585. int qman_init_fq(struct qman_fq *fq, u32 flags, struct qm_mcc_initfq *opts)
  1586. {
  1587. union qm_mc_command *mcc;
  1588. union qm_mc_result *mcr;
  1589. struct qman_portal *p;
  1590. u8 res, myverb;
  1591. int ret = 0;
  1592. myverb = (flags & QMAN_INITFQ_FLAG_SCHED)
  1593. ? QM_MCC_VERB_INITFQ_SCHED : QM_MCC_VERB_INITFQ_PARKED;
  1594. if (fq->state != qman_fq_state_oos &&
  1595. fq->state != qman_fq_state_parked)
  1596. return -EINVAL;
  1597. #ifdef CONFIG_FSL_DPAA_CHECKING
  1598. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1599. return -EINVAL;
  1600. #endif
  1601. if (opts && (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_OAC)) {
  1602. /* And can't be set at the same time as TDTHRESH */
  1603. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_TDTHRESH)
  1604. return -EINVAL;
  1605. }
  1606. /* Issue an INITFQ_[PARKED|SCHED] management command */
  1607. p = get_affine_portal();
  1608. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1609. (fq->state != qman_fq_state_oos &&
  1610. fq->state != qman_fq_state_parked)) {
  1611. ret = -EBUSY;
  1612. goto out;
  1613. }
  1614. mcc = qm_mc_start(&p->p);
  1615. if (opts)
  1616. mcc->initfq = *opts;
  1617. qm_fqid_set(&mcc->fq, fq->fqid);
  1618. mcc->initfq.count = 0;
  1619. /*
  1620. * If the FQ does *not* have the TO_DCPORTAL flag, context_b is set as a
  1621. * demux pointer. Otherwise, the caller-provided value is allowed to
  1622. * stand, don't overwrite it.
  1623. */
  1624. if (fq_isclear(fq, QMAN_FQ_FLAG_TO_DCPORTAL)) {
  1625. dma_addr_t phys_fq;
  1626. mcc->initfq.we_mask |= cpu_to_be16(QM_INITFQ_WE_CONTEXTB);
  1627. mcc->initfq.fqd.context_b = cpu_to_be32(fq_to_tag(fq));
  1628. /*
  1629. * and the physical address - NB, if the user wasn't trying to
  1630. * set CONTEXTA, clear the stashing settings.
  1631. */
  1632. if (!(be16_to_cpu(mcc->initfq.we_mask) &
  1633. QM_INITFQ_WE_CONTEXTA)) {
  1634. mcc->initfq.we_mask |=
  1635. cpu_to_be16(QM_INITFQ_WE_CONTEXTA);
  1636. memset(&mcc->initfq.fqd.context_a, 0,
  1637. sizeof(mcc->initfq.fqd.context_a));
  1638. } else {
  1639. struct qman_portal *p = qman_dma_portal;
  1640. phys_fq = dma_map_single(p->config->dev, fq,
  1641. sizeof(*fq), DMA_TO_DEVICE);
  1642. if (dma_mapping_error(p->config->dev, phys_fq)) {
  1643. dev_err(p->config->dev, "dma_mapping failed\n");
  1644. ret = -EIO;
  1645. goto out;
  1646. }
  1647. qm_fqd_stashing_set64(&mcc->initfq.fqd, phys_fq);
  1648. }
  1649. }
  1650. if (flags & QMAN_INITFQ_FLAG_LOCAL) {
  1651. int wq = 0;
  1652. if (!(be16_to_cpu(mcc->initfq.we_mask) &
  1653. QM_INITFQ_WE_DESTWQ)) {
  1654. mcc->initfq.we_mask |=
  1655. cpu_to_be16(QM_INITFQ_WE_DESTWQ);
  1656. wq = 4;
  1657. }
  1658. qm_fqd_set_destwq(&mcc->initfq.fqd, p->config->channel, wq);
  1659. }
  1660. qm_mc_commit(&p->p, myverb);
  1661. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1662. dev_err(p->config->dev, "MCR timeout\n");
  1663. ret = -ETIMEDOUT;
  1664. goto out;
  1665. }
  1666. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == myverb);
  1667. res = mcr->result;
  1668. if (res != QM_MCR_RESULT_OK) {
  1669. ret = -EIO;
  1670. goto out;
  1671. }
  1672. if (opts) {
  1673. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_FQCTRL) {
  1674. if (be16_to_cpu(opts->fqd.fq_ctrl) & QM_FQCTRL_CGE)
  1675. fq_set(fq, QMAN_FQ_STATE_CGR_EN);
  1676. else
  1677. fq_clear(fq, QMAN_FQ_STATE_CGR_EN);
  1678. }
  1679. if (be16_to_cpu(opts->we_mask) & QM_INITFQ_WE_CGID)
  1680. fq->cgr_groupid = opts->fqd.cgid;
  1681. }
  1682. fq->state = (flags & QMAN_INITFQ_FLAG_SCHED) ?
  1683. qman_fq_state_sched : qman_fq_state_parked;
  1684. out:
  1685. put_affine_portal();
  1686. return ret;
  1687. }
  1688. EXPORT_SYMBOL(qman_init_fq);
  1689. int qman_schedule_fq(struct qman_fq *fq)
  1690. {
  1691. union qm_mc_command *mcc;
  1692. union qm_mc_result *mcr;
  1693. struct qman_portal *p;
  1694. int ret = 0;
  1695. if (fq->state != qman_fq_state_parked)
  1696. return -EINVAL;
  1697. #ifdef CONFIG_FSL_DPAA_CHECKING
  1698. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1699. return -EINVAL;
  1700. #endif
  1701. /* Issue a ALTERFQ_SCHED management command */
  1702. p = get_affine_portal();
  1703. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1704. fq->state != qman_fq_state_parked) {
  1705. ret = -EBUSY;
  1706. goto out;
  1707. }
  1708. mcc = qm_mc_start(&p->p);
  1709. qm_fqid_set(&mcc->fq, fq->fqid);
  1710. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_SCHED);
  1711. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1712. dev_err(p->config->dev, "ALTER_SCHED timeout\n");
  1713. ret = -ETIMEDOUT;
  1714. goto out;
  1715. }
  1716. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_SCHED);
  1717. if (mcr->result != QM_MCR_RESULT_OK) {
  1718. ret = -EIO;
  1719. goto out;
  1720. }
  1721. fq->state = qman_fq_state_sched;
  1722. out:
  1723. put_affine_portal();
  1724. return ret;
  1725. }
  1726. EXPORT_SYMBOL(qman_schedule_fq);
  1727. int qman_retire_fq(struct qman_fq *fq, u32 *flags)
  1728. {
  1729. union qm_mc_command *mcc;
  1730. union qm_mc_result *mcr;
  1731. struct qman_portal *p;
  1732. int ret;
  1733. u8 res;
  1734. if (fq->state != qman_fq_state_parked &&
  1735. fq->state != qman_fq_state_sched)
  1736. return -EINVAL;
  1737. #ifdef CONFIG_FSL_DPAA_CHECKING
  1738. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1739. return -EINVAL;
  1740. #endif
  1741. p = get_affine_portal();
  1742. if (fq_isset(fq, QMAN_FQ_STATE_CHANGING) ||
  1743. fq->state == qman_fq_state_retired ||
  1744. fq->state == qman_fq_state_oos) {
  1745. ret = -EBUSY;
  1746. goto out;
  1747. }
  1748. mcc = qm_mc_start(&p->p);
  1749. qm_fqid_set(&mcc->fq, fq->fqid);
  1750. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_RETIRE);
  1751. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1752. dev_crit(p->config->dev, "ALTER_RETIRE timeout\n");
  1753. ret = -ETIMEDOUT;
  1754. goto out;
  1755. }
  1756. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_RETIRE);
  1757. res = mcr->result;
  1758. /*
  1759. * "Elegant" would be to treat OK/PENDING the same way; set CHANGING,
  1760. * and defer the flags until FQRNI or FQRN (respectively) show up. But
  1761. * "Friendly" is to process OK immediately, and not set CHANGING. We do
  1762. * friendly, otherwise the caller doesn't necessarily have a fully
  1763. * "retired" FQ on return even if the retirement was immediate. However
  1764. * this does mean some code duplication between here and
  1765. * fq_state_change().
  1766. */
  1767. if (res == QM_MCR_RESULT_OK) {
  1768. ret = 0;
  1769. /* Process 'fq' right away, we'll ignore FQRNI */
  1770. if (mcr->alterfq.fqs & QM_MCR_FQS_NOTEMPTY)
  1771. fq_set(fq, QMAN_FQ_STATE_NE);
  1772. if (mcr->alterfq.fqs & QM_MCR_FQS_ORLPRESENT)
  1773. fq_set(fq, QMAN_FQ_STATE_ORL);
  1774. if (flags)
  1775. *flags = fq->flags;
  1776. fq->state = qman_fq_state_retired;
  1777. if (fq->cb.fqs) {
  1778. /*
  1779. * Another issue with supporting "immediate" retirement
  1780. * is that we're forced to drop FQRNIs, because by the
  1781. * time they're seen it may already be "too late" (the
  1782. * fq may have been OOS'd and free()'d already). But if
  1783. * the upper layer wants a callback whether it's
  1784. * immediate or not, we have to fake a "MR" entry to
  1785. * look like an FQRNI...
  1786. */
  1787. union qm_mr_entry msg;
  1788. msg.verb = QM_MR_VERB_FQRNI;
  1789. msg.fq.fqs = mcr->alterfq.fqs;
  1790. qm_fqid_set(&msg.fq, fq->fqid);
  1791. msg.fq.context_b = cpu_to_be32(fq_to_tag(fq));
  1792. fq->cb.fqs(p, fq, &msg);
  1793. }
  1794. } else if (res == QM_MCR_RESULT_PENDING) {
  1795. ret = 1;
  1796. fq_set(fq, QMAN_FQ_STATE_CHANGING);
  1797. } else {
  1798. ret = -EIO;
  1799. }
  1800. out:
  1801. put_affine_portal();
  1802. return ret;
  1803. }
  1804. EXPORT_SYMBOL(qman_retire_fq);
  1805. int qman_oos_fq(struct qman_fq *fq)
  1806. {
  1807. union qm_mc_command *mcc;
  1808. union qm_mc_result *mcr;
  1809. struct qman_portal *p;
  1810. int ret = 0;
  1811. if (fq->state != qman_fq_state_retired)
  1812. return -EINVAL;
  1813. #ifdef CONFIG_FSL_DPAA_CHECKING
  1814. if (fq_isset(fq, QMAN_FQ_FLAG_NO_MODIFY))
  1815. return -EINVAL;
  1816. #endif
  1817. p = get_affine_portal();
  1818. if (fq_isset(fq, QMAN_FQ_STATE_BLOCKOOS) ||
  1819. fq->state != qman_fq_state_retired) {
  1820. ret = -EBUSY;
  1821. goto out;
  1822. }
  1823. mcc = qm_mc_start(&p->p);
  1824. qm_fqid_set(&mcc->fq, fq->fqid);
  1825. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  1826. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1827. ret = -ETIMEDOUT;
  1828. goto out;
  1829. }
  1830. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_ALTER_OOS);
  1831. if (mcr->result != QM_MCR_RESULT_OK) {
  1832. ret = -EIO;
  1833. goto out;
  1834. }
  1835. fq->state = qman_fq_state_oos;
  1836. out:
  1837. put_affine_portal();
  1838. return ret;
  1839. }
  1840. EXPORT_SYMBOL(qman_oos_fq);
  1841. int qman_query_fq(struct qman_fq *fq, struct qm_fqd *fqd)
  1842. {
  1843. union qm_mc_command *mcc;
  1844. union qm_mc_result *mcr;
  1845. struct qman_portal *p = get_affine_portal();
  1846. int ret = 0;
  1847. mcc = qm_mc_start(&p->p);
  1848. qm_fqid_set(&mcc->fq, fq->fqid);
  1849. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ);
  1850. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1851. ret = -ETIMEDOUT;
  1852. goto out;
  1853. }
  1854. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ);
  1855. if (mcr->result == QM_MCR_RESULT_OK)
  1856. *fqd = mcr->queryfq.fqd;
  1857. else
  1858. ret = -EIO;
  1859. out:
  1860. put_affine_portal();
  1861. return ret;
  1862. }
  1863. int qman_query_fq_np(struct qman_fq *fq, struct qm_mcr_queryfq_np *np)
  1864. {
  1865. union qm_mc_command *mcc;
  1866. union qm_mc_result *mcr;
  1867. struct qman_portal *p = get_affine_portal();
  1868. int ret = 0;
  1869. mcc = qm_mc_start(&p->p);
  1870. qm_fqid_set(&mcc->fq, fq->fqid);
  1871. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ_NP);
  1872. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1873. ret = -ETIMEDOUT;
  1874. goto out;
  1875. }
  1876. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ_NP);
  1877. if (mcr->result == QM_MCR_RESULT_OK)
  1878. *np = mcr->queryfq_np;
  1879. else if (mcr->result == QM_MCR_RESULT_ERR_FQID)
  1880. ret = -ERANGE;
  1881. else
  1882. ret = -EIO;
  1883. out:
  1884. put_affine_portal();
  1885. return ret;
  1886. }
  1887. EXPORT_SYMBOL(qman_query_fq_np);
  1888. static int qman_query_cgr(struct qman_cgr *cgr,
  1889. struct qm_mcr_querycgr *cgrd)
  1890. {
  1891. union qm_mc_command *mcc;
  1892. union qm_mc_result *mcr;
  1893. struct qman_portal *p = get_affine_portal();
  1894. int ret = 0;
  1895. mcc = qm_mc_start(&p->p);
  1896. mcc->cgr.cgid = cgr->cgrid;
  1897. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYCGR);
  1898. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  1899. ret = -ETIMEDOUT;
  1900. goto out;
  1901. }
  1902. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCC_VERB_QUERYCGR);
  1903. if (mcr->result == QM_MCR_RESULT_OK)
  1904. *cgrd = mcr->querycgr;
  1905. else {
  1906. dev_err(p->config->dev, "QUERY_CGR failed: %s\n",
  1907. mcr_result_str(mcr->result));
  1908. ret = -EIO;
  1909. }
  1910. out:
  1911. put_affine_portal();
  1912. return ret;
  1913. }
  1914. int qman_query_cgr_congested(struct qman_cgr *cgr, bool *result)
  1915. {
  1916. struct qm_mcr_querycgr query_cgr;
  1917. int err;
  1918. err = qman_query_cgr(cgr, &query_cgr);
  1919. if (err)
  1920. return err;
  1921. *result = !!query_cgr.cgr.cs;
  1922. return 0;
  1923. }
  1924. EXPORT_SYMBOL(qman_query_cgr_congested);
  1925. /* internal function used as a wait_event() expression */
  1926. static int set_p_vdqcr(struct qman_portal *p, struct qman_fq *fq, u32 vdqcr)
  1927. {
  1928. unsigned long irqflags;
  1929. int ret = -EBUSY;
  1930. local_irq_save(irqflags);
  1931. if (p->vdqcr_owned)
  1932. goto out;
  1933. if (fq_isset(fq, QMAN_FQ_STATE_VDQCR))
  1934. goto out;
  1935. fq_set(fq, QMAN_FQ_STATE_VDQCR);
  1936. p->vdqcr_owned = fq;
  1937. qm_dqrr_vdqcr_set(&p->p, vdqcr);
  1938. ret = 0;
  1939. out:
  1940. local_irq_restore(irqflags);
  1941. return ret;
  1942. }
  1943. static int set_vdqcr(struct qman_portal **p, struct qman_fq *fq, u32 vdqcr)
  1944. {
  1945. int ret;
  1946. *p = get_affine_portal();
  1947. ret = set_p_vdqcr(*p, fq, vdqcr);
  1948. put_affine_portal();
  1949. return ret;
  1950. }
  1951. static int wait_vdqcr_start(struct qman_portal **p, struct qman_fq *fq,
  1952. u32 vdqcr, u32 flags)
  1953. {
  1954. int ret = 0;
  1955. if (flags & QMAN_VOLATILE_FLAG_WAIT_INT)
  1956. ret = wait_event_interruptible(affine_queue,
  1957. !set_vdqcr(p, fq, vdqcr));
  1958. else
  1959. wait_event(affine_queue, !set_vdqcr(p, fq, vdqcr));
  1960. return ret;
  1961. }
  1962. int qman_volatile_dequeue(struct qman_fq *fq, u32 flags, u32 vdqcr)
  1963. {
  1964. struct qman_portal *p;
  1965. int ret;
  1966. if (fq->state != qman_fq_state_parked &&
  1967. fq->state != qman_fq_state_retired)
  1968. return -EINVAL;
  1969. if (vdqcr & QM_VDQCR_FQID_MASK)
  1970. return -EINVAL;
  1971. if (fq_isset(fq, QMAN_FQ_STATE_VDQCR))
  1972. return -EBUSY;
  1973. vdqcr = (vdqcr & ~QM_VDQCR_FQID_MASK) | fq->fqid;
  1974. if (flags & QMAN_VOLATILE_FLAG_WAIT)
  1975. ret = wait_vdqcr_start(&p, fq, vdqcr, flags);
  1976. else
  1977. ret = set_vdqcr(&p, fq, vdqcr);
  1978. if (ret)
  1979. return ret;
  1980. /* VDQCR is set */
  1981. if (flags & QMAN_VOLATILE_FLAG_FINISH) {
  1982. if (flags & QMAN_VOLATILE_FLAG_WAIT_INT)
  1983. /*
  1984. * NB: don't propagate any error - the caller wouldn't
  1985. * know whether the VDQCR was issued or not. A signal
  1986. * could arrive after returning anyway, so the caller
  1987. * can check signal_pending() if that's an issue.
  1988. */
  1989. wait_event_interruptible(affine_queue,
  1990. !fq_isset(fq, QMAN_FQ_STATE_VDQCR));
  1991. else
  1992. wait_event(affine_queue,
  1993. !fq_isset(fq, QMAN_FQ_STATE_VDQCR));
  1994. }
  1995. return 0;
  1996. }
  1997. EXPORT_SYMBOL(qman_volatile_dequeue);
  1998. static void update_eqcr_ci(struct qman_portal *p, u8 avail)
  1999. {
  2000. if (avail)
  2001. qm_eqcr_cce_prefetch(&p->p);
  2002. else
  2003. qm_eqcr_cce_update(&p->p);
  2004. }
  2005. int qman_enqueue(struct qman_fq *fq, const struct qm_fd *fd)
  2006. {
  2007. struct qman_portal *p;
  2008. struct qm_eqcr_entry *eq;
  2009. unsigned long irqflags;
  2010. u8 avail;
  2011. p = get_affine_portal();
  2012. local_irq_save(irqflags);
  2013. if (p->use_eqcr_ci_stashing) {
  2014. /*
  2015. * The stashing case is easy, only update if we need to in
  2016. * order to try and liberate ring entries.
  2017. */
  2018. eq = qm_eqcr_start_stash(&p->p);
  2019. } else {
  2020. /*
  2021. * The non-stashing case is harder, need to prefetch ahead of
  2022. * time.
  2023. */
  2024. avail = qm_eqcr_get_avail(&p->p);
  2025. if (avail < 2)
  2026. update_eqcr_ci(p, avail);
  2027. eq = qm_eqcr_start_no_stash(&p->p);
  2028. }
  2029. if (unlikely(!eq))
  2030. goto out;
  2031. qm_fqid_set(eq, fq->fqid);
  2032. eq->tag = cpu_to_be32(fq_to_tag(fq));
  2033. eq->fd = *fd;
  2034. qm_eqcr_pvb_commit(&p->p, QM_EQCR_VERB_CMD_ENQUEUE);
  2035. out:
  2036. local_irq_restore(irqflags);
  2037. put_affine_portal();
  2038. return 0;
  2039. }
  2040. EXPORT_SYMBOL(qman_enqueue);
  2041. static int qm_modify_cgr(struct qman_cgr *cgr, u32 flags,
  2042. struct qm_mcc_initcgr *opts)
  2043. {
  2044. union qm_mc_command *mcc;
  2045. union qm_mc_result *mcr;
  2046. struct qman_portal *p = get_affine_portal();
  2047. u8 verb = QM_MCC_VERB_MODIFYCGR;
  2048. int ret = 0;
  2049. mcc = qm_mc_start(&p->p);
  2050. if (opts)
  2051. mcc->initcgr = *opts;
  2052. mcc->initcgr.cgid = cgr->cgrid;
  2053. if (flags & QMAN_CGR_FLAG_USE_INIT)
  2054. verb = QM_MCC_VERB_INITCGR;
  2055. qm_mc_commit(&p->p, verb);
  2056. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2057. ret = -ETIMEDOUT;
  2058. goto out;
  2059. }
  2060. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == verb);
  2061. if (mcr->result != QM_MCR_RESULT_OK)
  2062. ret = -EIO;
  2063. out:
  2064. put_affine_portal();
  2065. return ret;
  2066. }
  2067. #define PORTAL_IDX(n) (n->config->channel - QM_CHANNEL_SWPORTAL0)
  2068. /* congestion state change notification target update control */
  2069. static void qm_cgr_cscn_targ_set(struct __qm_mc_cgr *cgr, int pi, u32 val)
  2070. {
  2071. if (qman_ip_rev >= QMAN_REV30)
  2072. cgr->cscn_targ_upd_ctrl = cpu_to_be16(pi |
  2073. QM_CGR_TARG_UDP_CTRL_WRITE_BIT);
  2074. else
  2075. cgr->cscn_targ = cpu_to_be32(val | QM_CGR_TARG_PORTAL(pi));
  2076. }
  2077. static void qm_cgr_cscn_targ_clear(struct __qm_mc_cgr *cgr, int pi, u32 val)
  2078. {
  2079. if (qman_ip_rev >= QMAN_REV30)
  2080. cgr->cscn_targ_upd_ctrl = cpu_to_be16(pi);
  2081. else
  2082. cgr->cscn_targ = cpu_to_be32(val & ~QM_CGR_TARG_PORTAL(pi));
  2083. }
  2084. static u8 qman_cgr_cpus[CGR_NUM];
  2085. void qman_init_cgr_all(void)
  2086. {
  2087. struct qman_cgr cgr;
  2088. int err_cnt = 0;
  2089. for (cgr.cgrid = 0; cgr.cgrid < CGR_NUM; cgr.cgrid++) {
  2090. if (qm_modify_cgr(&cgr, QMAN_CGR_FLAG_USE_INIT, NULL))
  2091. err_cnt++;
  2092. }
  2093. if (err_cnt)
  2094. pr_err("Warning: %d error%s while initialising CGR h/w\n",
  2095. err_cnt, (err_cnt > 1) ? "s" : "");
  2096. }
  2097. int qman_create_cgr(struct qman_cgr *cgr, u32 flags,
  2098. struct qm_mcc_initcgr *opts)
  2099. {
  2100. struct qm_mcr_querycgr cgr_state;
  2101. int ret;
  2102. struct qman_portal *p;
  2103. /*
  2104. * We have to check that the provided CGRID is within the limits of the
  2105. * data-structures, for obvious reasons. However we'll let h/w take
  2106. * care of determining whether it's within the limits of what exists on
  2107. * the SoC.
  2108. */
  2109. if (cgr->cgrid >= CGR_NUM)
  2110. return -EINVAL;
  2111. preempt_disable();
  2112. p = get_affine_portal();
  2113. qman_cgr_cpus[cgr->cgrid] = smp_processor_id();
  2114. preempt_enable();
  2115. cgr->chan = p->config->channel;
  2116. spin_lock(&p->cgr_lock);
  2117. if (opts) {
  2118. struct qm_mcc_initcgr local_opts = *opts;
  2119. ret = qman_query_cgr(cgr, &cgr_state);
  2120. if (ret)
  2121. goto out;
  2122. qm_cgr_cscn_targ_set(&local_opts.cgr, PORTAL_IDX(p),
  2123. be32_to_cpu(cgr_state.cgr.cscn_targ));
  2124. local_opts.we_mask |= cpu_to_be16(QM_CGR_WE_CSCN_TARG);
  2125. /* send init if flags indicate so */
  2126. if (flags & QMAN_CGR_FLAG_USE_INIT)
  2127. ret = qm_modify_cgr(cgr, QMAN_CGR_FLAG_USE_INIT,
  2128. &local_opts);
  2129. else
  2130. ret = qm_modify_cgr(cgr, 0, &local_opts);
  2131. if (ret)
  2132. goto out;
  2133. }
  2134. list_add(&cgr->node, &p->cgr_cbs);
  2135. /* Determine if newly added object requires its callback to be called */
  2136. ret = qman_query_cgr(cgr, &cgr_state);
  2137. if (ret) {
  2138. /* we can't go back, so proceed and return success */
  2139. dev_err(p->config->dev, "CGR HW state partially modified\n");
  2140. ret = 0;
  2141. goto out;
  2142. }
  2143. if (cgr->cb && cgr_state.cgr.cscn_en &&
  2144. qman_cgrs_get(&p->cgrs[1], cgr->cgrid))
  2145. cgr->cb(p, cgr, 1);
  2146. out:
  2147. spin_unlock(&p->cgr_lock);
  2148. put_affine_portal();
  2149. return ret;
  2150. }
  2151. EXPORT_SYMBOL(qman_create_cgr);
  2152. int qman_delete_cgr(struct qman_cgr *cgr)
  2153. {
  2154. unsigned long irqflags;
  2155. struct qm_mcr_querycgr cgr_state;
  2156. struct qm_mcc_initcgr local_opts;
  2157. int ret = 0;
  2158. struct qman_cgr *i;
  2159. struct qman_portal *p = get_affine_portal();
  2160. if (cgr->chan != p->config->channel) {
  2161. /* attempt to delete from other portal than creator */
  2162. dev_err(p->config->dev, "CGR not owned by current portal");
  2163. dev_dbg(p->config->dev, " create 0x%x, delete 0x%x\n",
  2164. cgr->chan, p->config->channel);
  2165. ret = -EINVAL;
  2166. goto put_portal;
  2167. }
  2168. memset(&local_opts, 0, sizeof(struct qm_mcc_initcgr));
  2169. spin_lock_irqsave(&p->cgr_lock, irqflags);
  2170. list_del(&cgr->node);
  2171. /*
  2172. * If there are no other CGR objects for this CGRID in the list,
  2173. * update CSCN_TARG accordingly
  2174. */
  2175. list_for_each_entry(i, &p->cgr_cbs, node)
  2176. if (i->cgrid == cgr->cgrid && i->cb)
  2177. goto release_lock;
  2178. ret = qman_query_cgr(cgr, &cgr_state);
  2179. if (ret) {
  2180. /* add back to the list */
  2181. list_add(&cgr->node, &p->cgr_cbs);
  2182. goto release_lock;
  2183. }
  2184. local_opts.we_mask = cpu_to_be16(QM_CGR_WE_CSCN_TARG);
  2185. qm_cgr_cscn_targ_clear(&local_opts.cgr, PORTAL_IDX(p),
  2186. be32_to_cpu(cgr_state.cgr.cscn_targ));
  2187. ret = qm_modify_cgr(cgr, 0, &local_opts);
  2188. if (ret)
  2189. /* add back to the list */
  2190. list_add(&cgr->node, &p->cgr_cbs);
  2191. release_lock:
  2192. spin_unlock_irqrestore(&p->cgr_lock, irqflags);
  2193. put_portal:
  2194. put_affine_portal();
  2195. return ret;
  2196. }
  2197. EXPORT_SYMBOL(qman_delete_cgr);
  2198. struct cgr_comp {
  2199. struct qman_cgr *cgr;
  2200. struct completion completion;
  2201. };
  2202. static void qman_delete_cgr_smp_call(void *p)
  2203. {
  2204. qman_delete_cgr((struct qman_cgr *)p);
  2205. }
  2206. void qman_delete_cgr_safe(struct qman_cgr *cgr)
  2207. {
  2208. preempt_disable();
  2209. if (qman_cgr_cpus[cgr->cgrid] != smp_processor_id()) {
  2210. smp_call_function_single(qman_cgr_cpus[cgr->cgrid],
  2211. qman_delete_cgr_smp_call, cgr, true);
  2212. preempt_enable();
  2213. return;
  2214. }
  2215. qman_delete_cgr(cgr);
  2216. preempt_enable();
  2217. }
  2218. EXPORT_SYMBOL(qman_delete_cgr_safe);
  2219. /* Cleanup FQs */
  2220. static int _qm_mr_consume_and_match_verb(struct qm_portal *p, int v)
  2221. {
  2222. const union qm_mr_entry *msg;
  2223. int found = 0;
  2224. qm_mr_pvb_update(p);
  2225. msg = qm_mr_current(p);
  2226. while (msg) {
  2227. if ((msg->verb & QM_MR_VERB_TYPE_MASK) == v)
  2228. found = 1;
  2229. qm_mr_next(p);
  2230. qm_mr_cci_consume_to_current(p);
  2231. qm_mr_pvb_update(p);
  2232. msg = qm_mr_current(p);
  2233. }
  2234. return found;
  2235. }
  2236. static int _qm_dqrr_consume_and_match(struct qm_portal *p, u32 fqid, int s,
  2237. bool wait)
  2238. {
  2239. const struct qm_dqrr_entry *dqrr;
  2240. int found = 0;
  2241. do {
  2242. qm_dqrr_pvb_update(p);
  2243. dqrr = qm_dqrr_current(p);
  2244. if (!dqrr)
  2245. cpu_relax();
  2246. } while (wait && !dqrr);
  2247. while (dqrr) {
  2248. if (qm_fqid_get(dqrr) == fqid && (dqrr->stat & s))
  2249. found = 1;
  2250. qm_dqrr_cdc_consume_1ptr(p, dqrr, 0);
  2251. qm_dqrr_pvb_update(p);
  2252. qm_dqrr_next(p);
  2253. dqrr = qm_dqrr_current(p);
  2254. }
  2255. return found;
  2256. }
  2257. #define qm_mr_drain(p, V) \
  2258. _qm_mr_consume_and_match_verb(p, QM_MR_VERB_##V)
  2259. #define qm_dqrr_drain(p, f, S) \
  2260. _qm_dqrr_consume_and_match(p, f, QM_DQRR_STAT_##S, false)
  2261. #define qm_dqrr_drain_wait(p, f, S) \
  2262. _qm_dqrr_consume_and_match(p, f, QM_DQRR_STAT_##S, true)
  2263. #define qm_dqrr_drain_nomatch(p) \
  2264. _qm_dqrr_consume_and_match(p, 0, 0, false)
  2265. static int qman_shutdown_fq(u32 fqid)
  2266. {
  2267. struct qman_portal *p;
  2268. struct device *dev;
  2269. union qm_mc_command *mcc;
  2270. union qm_mc_result *mcr;
  2271. int orl_empty, drain = 0, ret = 0;
  2272. u32 channel, wq, res;
  2273. u8 state;
  2274. p = get_affine_portal();
  2275. dev = p->config->dev;
  2276. /* Determine the state of the FQID */
  2277. mcc = qm_mc_start(&p->p);
  2278. qm_fqid_set(&mcc->fq, fqid);
  2279. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ_NP);
  2280. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2281. dev_err(dev, "QUERYFQ_NP timeout\n");
  2282. ret = -ETIMEDOUT;
  2283. goto out;
  2284. }
  2285. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ_NP);
  2286. state = mcr->queryfq_np.state & QM_MCR_NP_STATE_MASK;
  2287. if (state == QM_MCR_NP_STATE_OOS)
  2288. goto out; /* Already OOS, no need to do anymore checks */
  2289. /* Query which channel the FQ is using */
  2290. mcc = qm_mc_start(&p->p);
  2291. qm_fqid_set(&mcc->fq, fqid);
  2292. qm_mc_commit(&p->p, QM_MCC_VERB_QUERYFQ);
  2293. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2294. dev_err(dev, "QUERYFQ timeout\n");
  2295. ret = -ETIMEDOUT;
  2296. goto out;
  2297. }
  2298. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) == QM_MCR_VERB_QUERYFQ);
  2299. /* Need to store these since the MCR gets reused */
  2300. channel = qm_fqd_get_chan(&mcr->queryfq.fqd);
  2301. wq = qm_fqd_get_wq(&mcr->queryfq.fqd);
  2302. switch (state) {
  2303. case QM_MCR_NP_STATE_TEN_SCHED:
  2304. case QM_MCR_NP_STATE_TRU_SCHED:
  2305. case QM_MCR_NP_STATE_ACTIVE:
  2306. case QM_MCR_NP_STATE_PARKED:
  2307. orl_empty = 0;
  2308. mcc = qm_mc_start(&p->p);
  2309. qm_fqid_set(&mcc->fq, fqid);
  2310. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_RETIRE);
  2311. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2312. dev_err(dev, "QUERYFQ_NP timeout\n");
  2313. ret = -ETIMEDOUT;
  2314. goto out;
  2315. }
  2316. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2317. QM_MCR_VERB_ALTER_RETIRE);
  2318. res = mcr->result; /* Make a copy as we reuse MCR below */
  2319. if (res == QM_MCR_RESULT_PENDING) {
  2320. /*
  2321. * Need to wait for the FQRN in the message ring, which
  2322. * will only occur once the FQ has been drained. In
  2323. * order for the FQ to drain the portal needs to be set
  2324. * to dequeue from the channel the FQ is scheduled on
  2325. */
  2326. int found_fqrn = 0;
  2327. u16 dequeue_wq = 0;
  2328. /* Flag that we need to drain FQ */
  2329. drain = 1;
  2330. if (channel >= qm_channel_pool1 &&
  2331. channel < qm_channel_pool1 + 15) {
  2332. /* Pool channel, enable the bit in the portal */
  2333. dequeue_wq = (channel -
  2334. qm_channel_pool1 + 1)<<4 | wq;
  2335. } else if (channel < qm_channel_pool1) {
  2336. /* Dedicated channel */
  2337. dequeue_wq = wq;
  2338. } else {
  2339. dev_err(dev, "Can't recover FQ 0x%x, ch: 0x%x",
  2340. fqid, channel);
  2341. ret = -EBUSY;
  2342. goto out;
  2343. }
  2344. /* Set the sdqcr to drain this channel */
  2345. if (channel < qm_channel_pool1)
  2346. qm_dqrr_sdqcr_set(&p->p,
  2347. QM_SDQCR_TYPE_ACTIVE |
  2348. QM_SDQCR_CHANNELS_DEDICATED);
  2349. else
  2350. qm_dqrr_sdqcr_set(&p->p,
  2351. QM_SDQCR_TYPE_ACTIVE |
  2352. QM_SDQCR_CHANNELS_POOL_CONV
  2353. (channel));
  2354. do {
  2355. /* Keep draining DQRR while checking the MR*/
  2356. qm_dqrr_drain_nomatch(&p->p);
  2357. /* Process message ring too */
  2358. found_fqrn = qm_mr_drain(&p->p, FQRN);
  2359. cpu_relax();
  2360. } while (!found_fqrn);
  2361. }
  2362. if (res != QM_MCR_RESULT_OK &&
  2363. res != QM_MCR_RESULT_PENDING) {
  2364. dev_err(dev, "retire_fq failed: FQ 0x%x, res=0x%x\n",
  2365. fqid, res);
  2366. ret = -EIO;
  2367. goto out;
  2368. }
  2369. if (!(mcr->alterfq.fqs & QM_MCR_FQS_ORLPRESENT)) {
  2370. /*
  2371. * ORL had no entries, no need to wait until the
  2372. * ERNs come in
  2373. */
  2374. orl_empty = 1;
  2375. }
  2376. /*
  2377. * Retirement succeeded, check to see if FQ needs
  2378. * to be drained
  2379. */
  2380. if (drain || mcr->alterfq.fqs & QM_MCR_FQS_NOTEMPTY) {
  2381. /* FQ is Not Empty, drain using volatile DQ commands */
  2382. do {
  2383. u32 vdqcr = fqid | QM_VDQCR_NUMFRAMES_SET(3);
  2384. qm_dqrr_vdqcr_set(&p->p, vdqcr);
  2385. /*
  2386. * Wait for a dequeue and process the dequeues,
  2387. * making sure to empty the ring completely
  2388. */
  2389. } while (qm_dqrr_drain_wait(&p->p, fqid, FQ_EMPTY));
  2390. }
  2391. qm_dqrr_sdqcr_set(&p->p, 0);
  2392. while (!orl_empty) {
  2393. /* Wait for the ORL to have been completely drained */
  2394. orl_empty = qm_mr_drain(&p->p, FQRL);
  2395. cpu_relax();
  2396. }
  2397. mcc = qm_mc_start(&p->p);
  2398. qm_fqid_set(&mcc->fq, fqid);
  2399. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  2400. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2401. ret = -ETIMEDOUT;
  2402. goto out;
  2403. }
  2404. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2405. QM_MCR_VERB_ALTER_OOS);
  2406. if (mcr->result != QM_MCR_RESULT_OK) {
  2407. dev_err(dev, "OOS after drain fail: FQ 0x%x (0x%x)\n",
  2408. fqid, mcr->result);
  2409. ret = -EIO;
  2410. goto out;
  2411. }
  2412. break;
  2413. case QM_MCR_NP_STATE_RETIRED:
  2414. /* Send OOS Command */
  2415. mcc = qm_mc_start(&p->p);
  2416. qm_fqid_set(&mcc->fq, fqid);
  2417. qm_mc_commit(&p->p, QM_MCC_VERB_ALTER_OOS);
  2418. if (!qm_mc_result_timeout(&p->p, &mcr)) {
  2419. ret = -ETIMEDOUT;
  2420. goto out;
  2421. }
  2422. DPAA_ASSERT((mcr->verb & QM_MCR_VERB_MASK) ==
  2423. QM_MCR_VERB_ALTER_OOS);
  2424. if (mcr->result) {
  2425. dev_err(dev, "OOS fail: FQ 0x%x (0x%x)\n",
  2426. fqid, mcr->result);
  2427. ret = -EIO;
  2428. goto out;
  2429. }
  2430. break;
  2431. case QM_MCR_NP_STATE_OOS:
  2432. /* Done */
  2433. break;
  2434. default:
  2435. ret = -EIO;
  2436. }
  2437. out:
  2438. put_affine_portal();
  2439. return ret;
  2440. }
  2441. const struct qm_portal_config *qman_get_qm_portal_config(
  2442. struct qman_portal *portal)
  2443. {
  2444. return portal->config;
  2445. }
  2446. EXPORT_SYMBOL(qman_get_qm_portal_config);
  2447. struct gen_pool *qm_fqalloc; /* FQID allocator */
  2448. struct gen_pool *qm_qpalloc; /* pool-channel allocator */
  2449. struct gen_pool *qm_cgralloc; /* CGR ID allocator */
  2450. static int qman_alloc_range(struct gen_pool *p, u32 *result, u32 cnt)
  2451. {
  2452. unsigned long addr;
  2453. if (!p)
  2454. return -ENODEV;
  2455. addr = gen_pool_alloc(p, cnt);
  2456. if (!addr)
  2457. return -ENOMEM;
  2458. *result = addr & ~DPAA_GENALLOC_OFF;
  2459. return 0;
  2460. }
  2461. int qman_alloc_fqid_range(u32 *result, u32 count)
  2462. {
  2463. return qman_alloc_range(qm_fqalloc, result, count);
  2464. }
  2465. EXPORT_SYMBOL(qman_alloc_fqid_range);
  2466. int qman_alloc_pool_range(u32 *result, u32 count)
  2467. {
  2468. return qman_alloc_range(qm_qpalloc, result, count);
  2469. }
  2470. EXPORT_SYMBOL(qman_alloc_pool_range);
  2471. int qman_alloc_cgrid_range(u32 *result, u32 count)
  2472. {
  2473. return qman_alloc_range(qm_cgralloc, result, count);
  2474. }
  2475. EXPORT_SYMBOL(qman_alloc_cgrid_range);
  2476. int qman_release_fqid(u32 fqid)
  2477. {
  2478. int ret = qman_shutdown_fq(fqid);
  2479. if (ret) {
  2480. pr_debug("FQID %d leaked\n", fqid);
  2481. return ret;
  2482. }
  2483. gen_pool_free(qm_fqalloc, fqid | DPAA_GENALLOC_OFF, 1);
  2484. return 0;
  2485. }
  2486. EXPORT_SYMBOL(qman_release_fqid);
  2487. static int qpool_cleanup(u32 qp)
  2488. {
  2489. /*
  2490. * We query all FQDs starting from
  2491. * FQID 1 until we get an "invalid FQID" error, looking for non-OOS FQDs
  2492. * whose destination channel is the pool-channel being released.
  2493. * When a non-OOS FQD is found we attempt to clean it up
  2494. */
  2495. struct qman_fq fq = {
  2496. .fqid = QM_FQID_RANGE_START
  2497. };
  2498. int err;
  2499. do {
  2500. struct qm_mcr_queryfq_np np;
  2501. err = qman_query_fq_np(&fq, &np);
  2502. if (err == -ERANGE)
  2503. /* FQID range exceeded, found no problems */
  2504. return 0;
  2505. else if (WARN_ON(err))
  2506. return err;
  2507. if ((np.state & QM_MCR_NP_STATE_MASK) != QM_MCR_NP_STATE_OOS) {
  2508. struct qm_fqd fqd;
  2509. err = qman_query_fq(&fq, &fqd);
  2510. if (WARN_ON(err))
  2511. return err;
  2512. if (qm_fqd_get_chan(&fqd) == qp) {
  2513. /* The channel is the FQ's target, clean it */
  2514. err = qman_shutdown_fq(fq.fqid);
  2515. if (err)
  2516. /*
  2517. * Couldn't shut down the FQ
  2518. * so the pool must be leaked
  2519. */
  2520. return err;
  2521. }
  2522. }
  2523. /* Move to the next FQID */
  2524. fq.fqid++;
  2525. } while (1);
  2526. }
  2527. int qman_release_pool(u32 qp)
  2528. {
  2529. int ret;
  2530. ret = qpool_cleanup(qp);
  2531. if (ret) {
  2532. pr_debug("CHID %d leaked\n", qp);
  2533. return ret;
  2534. }
  2535. gen_pool_free(qm_qpalloc, qp | DPAA_GENALLOC_OFF, 1);
  2536. return 0;
  2537. }
  2538. EXPORT_SYMBOL(qman_release_pool);
  2539. static int cgr_cleanup(u32 cgrid)
  2540. {
  2541. /*
  2542. * query all FQDs starting from FQID 1 until we get an "invalid FQID"
  2543. * error, looking for non-OOS FQDs whose CGR is the CGR being released
  2544. */
  2545. struct qman_fq fq = {
  2546. .fqid = QM_FQID_RANGE_START
  2547. };
  2548. int err;
  2549. do {
  2550. struct qm_mcr_queryfq_np np;
  2551. err = qman_query_fq_np(&fq, &np);
  2552. if (err == -ERANGE)
  2553. /* FQID range exceeded, found no problems */
  2554. return 0;
  2555. else if (WARN_ON(err))
  2556. return err;
  2557. if ((np.state & QM_MCR_NP_STATE_MASK) != QM_MCR_NP_STATE_OOS) {
  2558. struct qm_fqd fqd;
  2559. err = qman_query_fq(&fq, &fqd);
  2560. if (WARN_ON(err))
  2561. return err;
  2562. if (be16_to_cpu(fqd.fq_ctrl) & QM_FQCTRL_CGE &&
  2563. fqd.cgid == cgrid) {
  2564. pr_err("CRGID 0x%x is being used by FQID 0x%x, CGR will be leaked\n",
  2565. cgrid, fq.fqid);
  2566. return -EIO;
  2567. }
  2568. }
  2569. /* Move to the next FQID */
  2570. fq.fqid++;
  2571. } while (1);
  2572. }
  2573. int qman_release_cgrid(u32 cgrid)
  2574. {
  2575. int ret;
  2576. ret = cgr_cleanup(cgrid);
  2577. if (ret) {
  2578. pr_debug("CGRID %d leaked\n", cgrid);
  2579. return ret;
  2580. }
  2581. gen_pool_free(qm_cgralloc, cgrid | DPAA_GENALLOC_OFF, 1);
  2582. return 0;
  2583. }
  2584. EXPORT_SYMBOL(qman_release_cgrid);