sge.c 91 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304
  1. /*
  2. * Copyright (c) 2005-2008 Chelsio, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/skbuff.h>
  33. #include <linux/netdevice.h>
  34. #include <linux/etherdevice.h>
  35. #include <linux/if_vlan.h>
  36. #include <linux/ip.h>
  37. #include <linux/tcp.h>
  38. #include <linux/dma-mapping.h>
  39. #include <linux/slab.h>
  40. #include <linux/prefetch.h>
  41. #include <net/arp.h>
  42. #include "common.h"
  43. #include "regs.h"
  44. #include "sge_defs.h"
  45. #include "t3_cpl.h"
  46. #include "firmware_exports.h"
  47. #include "cxgb3_offload.h"
  48. #define USE_GTS 0
  49. #define SGE_RX_SM_BUF_SIZE 1536
  50. #define SGE_RX_COPY_THRES 256
  51. #define SGE_RX_PULL_LEN 128
  52. #define SGE_PG_RSVD SMP_CACHE_BYTES
  53. /*
  54. * Page chunk size for FL0 buffers if FL0 is to be populated with page chunks.
  55. * It must be a divisor of PAGE_SIZE. If set to 0 FL0 will use sk_buffs
  56. * directly.
  57. */
  58. #define FL0_PG_CHUNK_SIZE 2048
  59. #define FL0_PG_ORDER 0
  60. #define FL0_PG_ALLOC_SIZE (PAGE_SIZE << FL0_PG_ORDER)
  61. #define FL1_PG_CHUNK_SIZE (PAGE_SIZE > 8192 ? 16384 : 8192)
  62. #define FL1_PG_ORDER (PAGE_SIZE > 8192 ? 0 : 1)
  63. #define FL1_PG_ALLOC_SIZE (PAGE_SIZE << FL1_PG_ORDER)
  64. #define SGE_RX_DROP_THRES 16
  65. #define RX_RECLAIM_PERIOD (HZ/4)
  66. /*
  67. * Max number of Rx buffers we replenish at a time.
  68. */
  69. #define MAX_RX_REFILL 16U
  70. /*
  71. * Period of the Tx buffer reclaim timer. This timer does not need to run
  72. * frequently as Tx buffers are usually reclaimed by new Tx packets.
  73. */
  74. #define TX_RECLAIM_PERIOD (HZ / 4)
  75. #define TX_RECLAIM_TIMER_CHUNK 64U
  76. #define TX_RECLAIM_CHUNK 16U
  77. /* WR size in bytes */
  78. #define WR_LEN (WR_FLITS * 8)
  79. /*
  80. * Types of Tx queues in each queue set. Order here matters, do not change.
  81. */
  82. enum { TXQ_ETH, TXQ_OFLD, TXQ_CTRL };
  83. /* Values for sge_txq.flags */
  84. enum {
  85. TXQ_RUNNING = 1 << 0, /* fetch engine is running */
  86. TXQ_LAST_PKT_DB = 1 << 1, /* last packet rang the doorbell */
  87. };
  88. struct tx_desc {
  89. __be64 flit[TX_DESC_FLITS];
  90. };
  91. struct rx_desc {
  92. __be32 addr_lo;
  93. __be32 len_gen;
  94. __be32 gen2;
  95. __be32 addr_hi;
  96. };
  97. struct tx_sw_desc { /* SW state per Tx descriptor */
  98. struct sk_buff *skb;
  99. u8 eop; /* set if last descriptor for packet */
  100. u8 addr_idx; /* buffer index of first SGL entry in descriptor */
  101. u8 fragidx; /* first page fragment associated with descriptor */
  102. s8 sflit; /* start flit of first SGL entry in descriptor */
  103. };
  104. struct rx_sw_desc { /* SW state per Rx descriptor */
  105. union {
  106. struct sk_buff *skb;
  107. struct fl_pg_chunk pg_chunk;
  108. };
  109. DEFINE_DMA_UNMAP_ADDR(dma_addr);
  110. };
  111. struct rsp_desc { /* response queue descriptor */
  112. struct rss_header rss_hdr;
  113. __be32 flags;
  114. __be32 len_cq;
  115. u8 imm_data[47];
  116. u8 intr_gen;
  117. };
  118. /*
  119. * Holds unmapping information for Tx packets that need deferred unmapping.
  120. * This structure lives at skb->head and must be allocated by callers.
  121. */
  122. struct deferred_unmap_info {
  123. struct pci_dev *pdev;
  124. dma_addr_t addr[MAX_SKB_FRAGS + 1];
  125. };
  126. /*
  127. * Maps a number of flits to the number of Tx descriptors that can hold them.
  128. * The formula is
  129. *
  130. * desc = 1 + (flits - 2) / (WR_FLITS - 1).
  131. *
  132. * HW allows up to 4 descriptors to be combined into a WR.
  133. */
  134. static u8 flit_desc_map[] = {
  135. 0,
  136. #if SGE_NUM_GENBITS == 1
  137. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  138. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  139. 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
  140. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
  141. #elif SGE_NUM_GENBITS == 2
  142. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  143. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  144. 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
  145. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  146. #else
  147. # error "SGE_NUM_GENBITS must be 1 or 2"
  148. #endif
  149. };
  150. static inline struct sge_qset *fl_to_qset(const struct sge_fl *q, int qidx)
  151. {
  152. return container_of(q, struct sge_qset, fl[qidx]);
  153. }
  154. static inline struct sge_qset *rspq_to_qset(const struct sge_rspq *q)
  155. {
  156. return container_of(q, struct sge_qset, rspq);
  157. }
  158. static inline struct sge_qset *txq_to_qset(const struct sge_txq *q, int qidx)
  159. {
  160. return container_of(q, struct sge_qset, txq[qidx]);
  161. }
  162. /**
  163. * refill_rspq - replenish an SGE response queue
  164. * @adapter: the adapter
  165. * @q: the response queue to replenish
  166. * @credits: how many new responses to make available
  167. *
  168. * Replenishes a response queue by making the supplied number of responses
  169. * available to HW.
  170. */
  171. static inline void refill_rspq(struct adapter *adapter,
  172. const struct sge_rspq *q, unsigned int credits)
  173. {
  174. rmb();
  175. t3_write_reg(adapter, A_SG_RSPQ_CREDIT_RETURN,
  176. V_RSPQ(q->cntxt_id) | V_CREDITS(credits));
  177. }
  178. /**
  179. * need_skb_unmap - does the platform need unmapping of sk_buffs?
  180. *
  181. * Returns true if the platform needs sk_buff unmapping. The compiler
  182. * optimizes away unnecessary code if this returns true.
  183. */
  184. static inline int need_skb_unmap(void)
  185. {
  186. #ifdef CONFIG_NEED_DMA_MAP_STATE
  187. return 1;
  188. #else
  189. return 0;
  190. #endif
  191. }
  192. /**
  193. * unmap_skb - unmap a packet main body and its page fragments
  194. * @skb: the packet
  195. * @q: the Tx queue containing Tx descriptors for the packet
  196. * @cidx: index of Tx descriptor
  197. * @pdev: the PCI device
  198. *
  199. * Unmap the main body of an sk_buff and its page fragments, if any.
  200. * Because of the fairly complicated structure of our SGLs and the desire
  201. * to conserve space for metadata, the information necessary to unmap an
  202. * sk_buff is spread across the sk_buff itself (buffer lengths), the HW Tx
  203. * descriptors (the physical addresses of the various data buffers), and
  204. * the SW descriptor state (assorted indices). The send functions
  205. * initialize the indices for the first packet descriptor so we can unmap
  206. * the buffers held in the first Tx descriptor here, and we have enough
  207. * information at this point to set the state for the next Tx descriptor.
  208. *
  209. * Note that it is possible to clean up the first descriptor of a packet
  210. * before the send routines have written the next descriptors, but this
  211. * race does not cause any problem. We just end up writing the unmapping
  212. * info for the descriptor first.
  213. */
  214. static inline void unmap_skb(struct sk_buff *skb, struct sge_txq *q,
  215. unsigned int cidx, struct pci_dev *pdev)
  216. {
  217. const struct sg_ent *sgp;
  218. struct tx_sw_desc *d = &q->sdesc[cidx];
  219. int nfrags, frag_idx, curflit, j = d->addr_idx;
  220. sgp = (struct sg_ent *)&q->desc[cidx].flit[d->sflit];
  221. frag_idx = d->fragidx;
  222. if (frag_idx == 0 && skb_headlen(skb)) {
  223. pci_unmap_single(pdev, be64_to_cpu(sgp->addr[0]),
  224. skb_headlen(skb), PCI_DMA_TODEVICE);
  225. j = 1;
  226. }
  227. curflit = d->sflit + 1 + j;
  228. nfrags = skb_shinfo(skb)->nr_frags;
  229. while (frag_idx < nfrags && curflit < WR_FLITS) {
  230. pci_unmap_page(pdev, be64_to_cpu(sgp->addr[j]),
  231. skb_frag_size(&skb_shinfo(skb)->frags[frag_idx]),
  232. PCI_DMA_TODEVICE);
  233. j ^= 1;
  234. if (j == 0) {
  235. sgp++;
  236. curflit++;
  237. }
  238. curflit++;
  239. frag_idx++;
  240. }
  241. if (frag_idx < nfrags) { /* SGL continues into next Tx descriptor */
  242. d = cidx + 1 == q->size ? q->sdesc : d + 1;
  243. d->fragidx = frag_idx;
  244. d->addr_idx = j;
  245. d->sflit = curflit - WR_FLITS - j; /* sflit can be -1 */
  246. }
  247. }
  248. /**
  249. * free_tx_desc - reclaims Tx descriptors and their buffers
  250. * @adapter: the adapter
  251. * @q: the Tx queue to reclaim descriptors from
  252. * @n: the number of descriptors to reclaim
  253. *
  254. * Reclaims Tx descriptors from an SGE Tx queue and frees the associated
  255. * Tx buffers. Called with the Tx queue lock held.
  256. */
  257. static void free_tx_desc(struct adapter *adapter, struct sge_txq *q,
  258. unsigned int n)
  259. {
  260. struct tx_sw_desc *d;
  261. struct pci_dev *pdev = adapter->pdev;
  262. unsigned int cidx = q->cidx;
  263. const int need_unmap = need_skb_unmap() &&
  264. q->cntxt_id >= FW_TUNNEL_SGEEC_START;
  265. d = &q->sdesc[cidx];
  266. while (n--) {
  267. if (d->skb) { /* an SGL is present */
  268. if (need_unmap)
  269. unmap_skb(d->skb, q, cidx, pdev);
  270. if (d->eop) {
  271. kfree_skb(d->skb);
  272. d->skb = NULL;
  273. }
  274. }
  275. ++d;
  276. if (++cidx == q->size) {
  277. cidx = 0;
  278. d = q->sdesc;
  279. }
  280. }
  281. q->cidx = cidx;
  282. }
  283. /**
  284. * reclaim_completed_tx - reclaims completed Tx descriptors
  285. * @adapter: the adapter
  286. * @q: the Tx queue to reclaim completed descriptors from
  287. * @chunk: maximum number of descriptors to reclaim
  288. *
  289. * Reclaims Tx descriptors that the SGE has indicated it has processed,
  290. * and frees the associated buffers if possible. Called with the Tx
  291. * queue's lock held.
  292. */
  293. static inline unsigned int reclaim_completed_tx(struct adapter *adapter,
  294. struct sge_txq *q,
  295. unsigned int chunk)
  296. {
  297. unsigned int reclaim = q->processed - q->cleaned;
  298. reclaim = min(chunk, reclaim);
  299. if (reclaim) {
  300. free_tx_desc(adapter, q, reclaim);
  301. q->cleaned += reclaim;
  302. q->in_use -= reclaim;
  303. }
  304. return q->processed - q->cleaned;
  305. }
  306. /**
  307. * should_restart_tx - are there enough resources to restart a Tx queue?
  308. * @q: the Tx queue
  309. *
  310. * Checks if there are enough descriptors to restart a suspended Tx queue.
  311. */
  312. static inline int should_restart_tx(const struct sge_txq *q)
  313. {
  314. unsigned int r = q->processed - q->cleaned;
  315. return q->in_use - r < (q->size >> 1);
  316. }
  317. static void clear_rx_desc(struct pci_dev *pdev, const struct sge_fl *q,
  318. struct rx_sw_desc *d)
  319. {
  320. if (q->use_pages && d->pg_chunk.page) {
  321. (*d->pg_chunk.p_cnt)--;
  322. if (!*d->pg_chunk.p_cnt)
  323. pci_unmap_page(pdev,
  324. d->pg_chunk.mapping,
  325. q->alloc_size, PCI_DMA_FROMDEVICE);
  326. put_page(d->pg_chunk.page);
  327. d->pg_chunk.page = NULL;
  328. } else {
  329. pci_unmap_single(pdev, dma_unmap_addr(d, dma_addr),
  330. q->buf_size, PCI_DMA_FROMDEVICE);
  331. kfree_skb(d->skb);
  332. d->skb = NULL;
  333. }
  334. }
  335. /**
  336. * free_rx_bufs - free the Rx buffers on an SGE free list
  337. * @pdev: the PCI device associated with the adapter
  338. * @rxq: the SGE free list to clean up
  339. *
  340. * Release the buffers on an SGE free-buffer Rx queue. HW fetching from
  341. * this queue should be stopped before calling this function.
  342. */
  343. static void free_rx_bufs(struct pci_dev *pdev, struct sge_fl *q)
  344. {
  345. unsigned int cidx = q->cidx;
  346. while (q->credits--) {
  347. struct rx_sw_desc *d = &q->sdesc[cidx];
  348. clear_rx_desc(pdev, q, d);
  349. if (++cidx == q->size)
  350. cidx = 0;
  351. }
  352. if (q->pg_chunk.page) {
  353. __free_pages(q->pg_chunk.page, q->order);
  354. q->pg_chunk.page = NULL;
  355. }
  356. }
  357. /**
  358. * add_one_rx_buf - add a packet buffer to a free-buffer list
  359. * @va: buffer start VA
  360. * @len: the buffer length
  361. * @d: the HW Rx descriptor to write
  362. * @sd: the SW Rx descriptor to write
  363. * @gen: the generation bit value
  364. * @pdev: the PCI device associated with the adapter
  365. *
  366. * Add a buffer of the given length to the supplied HW and SW Rx
  367. * descriptors.
  368. */
  369. static inline int add_one_rx_buf(void *va, unsigned int len,
  370. struct rx_desc *d, struct rx_sw_desc *sd,
  371. unsigned int gen, struct pci_dev *pdev)
  372. {
  373. dma_addr_t mapping;
  374. mapping = pci_map_single(pdev, va, len, PCI_DMA_FROMDEVICE);
  375. if (unlikely(pci_dma_mapping_error(pdev, mapping)))
  376. return -ENOMEM;
  377. dma_unmap_addr_set(sd, dma_addr, mapping);
  378. d->addr_lo = cpu_to_be32(mapping);
  379. d->addr_hi = cpu_to_be32((u64) mapping >> 32);
  380. wmb();
  381. d->len_gen = cpu_to_be32(V_FLD_GEN1(gen));
  382. d->gen2 = cpu_to_be32(V_FLD_GEN2(gen));
  383. return 0;
  384. }
  385. static inline int add_one_rx_chunk(dma_addr_t mapping, struct rx_desc *d,
  386. unsigned int gen)
  387. {
  388. d->addr_lo = cpu_to_be32(mapping);
  389. d->addr_hi = cpu_to_be32((u64) mapping >> 32);
  390. wmb();
  391. d->len_gen = cpu_to_be32(V_FLD_GEN1(gen));
  392. d->gen2 = cpu_to_be32(V_FLD_GEN2(gen));
  393. return 0;
  394. }
  395. static int alloc_pg_chunk(struct adapter *adapter, struct sge_fl *q,
  396. struct rx_sw_desc *sd, gfp_t gfp,
  397. unsigned int order)
  398. {
  399. if (!q->pg_chunk.page) {
  400. dma_addr_t mapping;
  401. q->pg_chunk.page = alloc_pages(gfp, order);
  402. if (unlikely(!q->pg_chunk.page))
  403. return -ENOMEM;
  404. q->pg_chunk.va = page_address(q->pg_chunk.page);
  405. q->pg_chunk.p_cnt = q->pg_chunk.va + (PAGE_SIZE << order) -
  406. SGE_PG_RSVD;
  407. q->pg_chunk.offset = 0;
  408. mapping = pci_map_page(adapter->pdev, q->pg_chunk.page,
  409. 0, q->alloc_size, PCI_DMA_FROMDEVICE);
  410. q->pg_chunk.mapping = mapping;
  411. }
  412. sd->pg_chunk = q->pg_chunk;
  413. prefetch(sd->pg_chunk.p_cnt);
  414. q->pg_chunk.offset += q->buf_size;
  415. if (q->pg_chunk.offset == (PAGE_SIZE << order))
  416. q->pg_chunk.page = NULL;
  417. else {
  418. q->pg_chunk.va += q->buf_size;
  419. get_page(q->pg_chunk.page);
  420. }
  421. if (sd->pg_chunk.offset == 0)
  422. *sd->pg_chunk.p_cnt = 1;
  423. else
  424. *sd->pg_chunk.p_cnt += 1;
  425. return 0;
  426. }
  427. static inline void ring_fl_db(struct adapter *adap, struct sge_fl *q)
  428. {
  429. if (q->pend_cred >= q->credits / 4) {
  430. q->pend_cred = 0;
  431. wmb();
  432. t3_write_reg(adap, A_SG_KDOORBELL, V_EGRCNTX(q->cntxt_id));
  433. }
  434. }
  435. /**
  436. * refill_fl - refill an SGE free-buffer list
  437. * @adapter: the adapter
  438. * @q: the free-list to refill
  439. * @n: the number of new buffers to allocate
  440. * @gfp: the gfp flags for allocating new buffers
  441. *
  442. * (Re)populate an SGE free-buffer list with up to @n new packet buffers,
  443. * allocated with the supplied gfp flags. The caller must assure that
  444. * @n does not exceed the queue's capacity.
  445. */
  446. static int refill_fl(struct adapter *adap, struct sge_fl *q, int n, gfp_t gfp)
  447. {
  448. struct rx_sw_desc *sd = &q->sdesc[q->pidx];
  449. struct rx_desc *d = &q->desc[q->pidx];
  450. unsigned int count = 0;
  451. while (n--) {
  452. dma_addr_t mapping;
  453. int err;
  454. if (q->use_pages) {
  455. if (unlikely(alloc_pg_chunk(adap, q, sd, gfp,
  456. q->order))) {
  457. nomem: q->alloc_failed++;
  458. break;
  459. }
  460. mapping = sd->pg_chunk.mapping + sd->pg_chunk.offset;
  461. dma_unmap_addr_set(sd, dma_addr, mapping);
  462. add_one_rx_chunk(mapping, d, q->gen);
  463. pci_dma_sync_single_for_device(adap->pdev, mapping,
  464. q->buf_size - SGE_PG_RSVD,
  465. PCI_DMA_FROMDEVICE);
  466. } else {
  467. void *buf_start;
  468. struct sk_buff *skb = alloc_skb(q->buf_size, gfp);
  469. if (!skb)
  470. goto nomem;
  471. sd->skb = skb;
  472. buf_start = skb->data;
  473. err = add_one_rx_buf(buf_start, q->buf_size, d, sd,
  474. q->gen, adap->pdev);
  475. if (unlikely(err)) {
  476. clear_rx_desc(adap->pdev, q, sd);
  477. break;
  478. }
  479. }
  480. d++;
  481. sd++;
  482. if (++q->pidx == q->size) {
  483. q->pidx = 0;
  484. q->gen ^= 1;
  485. sd = q->sdesc;
  486. d = q->desc;
  487. }
  488. count++;
  489. }
  490. q->credits += count;
  491. q->pend_cred += count;
  492. ring_fl_db(adap, q);
  493. return count;
  494. }
  495. static inline void __refill_fl(struct adapter *adap, struct sge_fl *fl)
  496. {
  497. refill_fl(adap, fl, min(MAX_RX_REFILL, fl->size - fl->credits),
  498. GFP_ATOMIC | __GFP_COMP);
  499. }
  500. /**
  501. * recycle_rx_buf - recycle a receive buffer
  502. * @adapter: the adapter
  503. * @q: the SGE free list
  504. * @idx: index of buffer to recycle
  505. *
  506. * Recycles the specified buffer on the given free list by adding it at
  507. * the next available slot on the list.
  508. */
  509. static void recycle_rx_buf(struct adapter *adap, struct sge_fl *q,
  510. unsigned int idx)
  511. {
  512. struct rx_desc *from = &q->desc[idx];
  513. struct rx_desc *to = &q->desc[q->pidx];
  514. q->sdesc[q->pidx] = q->sdesc[idx];
  515. to->addr_lo = from->addr_lo; /* already big endian */
  516. to->addr_hi = from->addr_hi; /* likewise */
  517. wmb();
  518. to->len_gen = cpu_to_be32(V_FLD_GEN1(q->gen));
  519. to->gen2 = cpu_to_be32(V_FLD_GEN2(q->gen));
  520. if (++q->pidx == q->size) {
  521. q->pidx = 0;
  522. q->gen ^= 1;
  523. }
  524. q->credits++;
  525. q->pend_cred++;
  526. ring_fl_db(adap, q);
  527. }
  528. /**
  529. * alloc_ring - allocate resources for an SGE descriptor ring
  530. * @pdev: the PCI device
  531. * @nelem: the number of descriptors
  532. * @elem_size: the size of each descriptor
  533. * @sw_size: the size of the SW state associated with each ring element
  534. * @phys: the physical address of the allocated ring
  535. * @metadata: address of the array holding the SW state for the ring
  536. *
  537. * Allocates resources for an SGE descriptor ring, such as Tx queues,
  538. * free buffer lists, or response queues. Each SGE ring requires
  539. * space for its HW descriptors plus, optionally, space for the SW state
  540. * associated with each HW entry (the metadata). The function returns
  541. * three values: the virtual address for the HW ring (the return value
  542. * of the function), the physical address of the HW ring, and the address
  543. * of the SW ring.
  544. */
  545. static void *alloc_ring(struct pci_dev *pdev, size_t nelem, size_t elem_size,
  546. size_t sw_size, dma_addr_t * phys, void *metadata)
  547. {
  548. size_t len = nelem * elem_size;
  549. void *s = NULL;
  550. void *p = dma_alloc_coherent(&pdev->dev, len, phys, GFP_KERNEL);
  551. if (!p)
  552. return NULL;
  553. if (sw_size && metadata) {
  554. s = kcalloc(nelem, sw_size, GFP_KERNEL);
  555. if (!s) {
  556. dma_free_coherent(&pdev->dev, len, p, *phys);
  557. return NULL;
  558. }
  559. *(void **)metadata = s;
  560. }
  561. memset(p, 0, len);
  562. return p;
  563. }
  564. /**
  565. * t3_reset_qset - reset a sge qset
  566. * @q: the queue set
  567. *
  568. * Reset the qset structure.
  569. * the NAPI structure is preserved in the event of
  570. * the qset's reincarnation, for example during EEH recovery.
  571. */
  572. static void t3_reset_qset(struct sge_qset *q)
  573. {
  574. if (q->adap &&
  575. !(q->adap->flags & NAPI_INIT)) {
  576. memset(q, 0, sizeof(*q));
  577. return;
  578. }
  579. q->adap = NULL;
  580. memset(&q->rspq, 0, sizeof(q->rspq));
  581. memset(q->fl, 0, sizeof(struct sge_fl) * SGE_RXQ_PER_SET);
  582. memset(q->txq, 0, sizeof(struct sge_txq) * SGE_TXQ_PER_SET);
  583. q->txq_stopped = 0;
  584. q->tx_reclaim_timer.function = NULL; /* for t3_stop_sge_timers() */
  585. q->rx_reclaim_timer.function = NULL;
  586. q->nomem = 0;
  587. napi_free_frags(&q->napi);
  588. }
  589. /**
  590. * free_qset - free the resources of an SGE queue set
  591. * @adapter: the adapter owning the queue set
  592. * @q: the queue set
  593. *
  594. * Release the HW and SW resources associated with an SGE queue set, such
  595. * as HW contexts, packet buffers, and descriptor rings. Traffic to the
  596. * queue set must be quiesced prior to calling this.
  597. */
  598. static void t3_free_qset(struct adapter *adapter, struct sge_qset *q)
  599. {
  600. int i;
  601. struct pci_dev *pdev = adapter->pdev;
  602. for (i = 0; i < SGE_RXQ_PER_SET; ++i)
  603. if (q->fl[i].desc) {
  604. spin_lock_irq(&adapter->sge.reg_lock);
  605. t3_sge_disable_fl(adapter, q->fl[i].cntxt_id);
  606. spin_unlock_irq(&adapter->sge.reg_lock);
  607. free_rx_bufs(pdev, &q->fl[i]);
  608. kfree(q->fl[i].sdesc);
  609. dma_free_coherent(&pdev->dev,
  610. q->fl[i].size *
  611. sizeof(struct rx_desc), q->fl[i].desc,
  612. q->fl[i].phys_addr);
  613. }
  614. for (i = 0; i < SGE_TXQ_PER_SET; ++i)
  615. if (q->txq[i].desc) {
  616. spin_lock_irq(&adapter->sge.reg_lock);
  617. t3_sge_enable_ecntxt(adapter, q->txq[i].cntxt_id, 0);
  618. spin_unlock_irq(&adapter->sge.reg_lock);
  619. if (q->txq[i].sdesc) {
  620. free_tx_desc(adapter, &q->txq[i],
  621. q->txq[i].in_use);
  622. kfree(q->txq[i].sdesc);
  623. }
  624. dma_free_coherent(&pdev->dev,
  625. q->txq[i].size *
  626. sizeof(struct tx_desc),
  627. q->txq[i].desc, q->txq[i].phys_addr);
  628. __skb_queue_purge(&q->txq[i].sendq);
  629. }
  630. if (q->rspq.desc) {
  631. spin_lock_irq(&adapter->sge.reg_lock);
  632. t3_sge_disable_rspcntxt(adapter, q->rspq.cntxt_id);
  633. spin_unlock_irq(&adapter->sge.reg_lock);
  634. dma_free_coherent(&pdev->dev,
  635. q->rspq.size * sizeof(struct rsp_desc),
  636. q->rspq.desc, q->rspq.phys_addr);
  637. }
  638. t3_reset_qset(q);
  639. }
  640. /**
  641. * init_qset_cntxt - initialize an SGE queue set context info
  642. * @qs: the queue set
  643. * @id: the queue set id
  644. *
  645. * Initializes the TIDs and context ids for the queues of a queue set.
  646. */
  647. static void init_qset_cntxt(struct sge_qset *qs, unsigned int id)
  648. {
  649. qs->rspq.cntxt_id = id;
  650. qs->fl[0].cntxt_id = 2 * id;
  651. qs->fl[1].cntxt_id = 2 * id + 1;
  652. qs->txq[TXQ_ETH].cntxt_id = FW_TUNNEL_SGEEC_START + id;
  653. qs->txq[TXQ_ETH].token = FW_TUNNEL_TID_START + id;
  654. qs->txq[TXQ_OFLD].cntxt_id = FW_OFLD_SGEEC_START + id;
  655. qs->txq[TXQ_CTRL].cntxt_id = FW_CTRL_SGEEC_START + id;
  656. qs->txq[TXQ_CTRL].token = FW_CTRL_TID_START + id;
  657. }
  658. /**
  659. * sgl_len - calculates the size of an SGL of the given capacity
  660. * @n: the number of SGL entries
  661. *
  662. * Calculates the number of flits needed for a scatter/gather list that
  663. * can hold the given number of entries.
  664. */
  665. static inline unsigned int sgl_len(unsigned int n)
  666. {
  667. /* alternatively: 3 * (n / 2) + 2 * (n & 1) */
  668. return (3 * n) / 2 + (n & 1);
  669. }
  670. /**
  671. * flits_to_desc - returns the num of Tx descriptors for the given flits
  672. * @n: the number of flits
  673. *
  674. * Calculates the number of Tx descriptors needed for the supplied number
  675. * of flits.
  676. */
  677. static inline unsigned int flits_to_desc(unsigned int n)
  678. {
  679. BUG_ON(n >= ARRAY_SIZE(flit_desc_map));
  680. return flit_desc_map[n];
  681. }
  682. /**
  683. * get_packet - return the next ingress packet buffer from a free list
  684. * @adap: the adapter that received the packet
  685. * @fl: the SGE free list holding the packet
  686. * @len: the packet length including any SGE padding
  687. * @drop_thres: # of remaining buffers before we start dropping packets
  688. *
  689. * Get the next packet from a free list and complete setup of the
  690. * sk_buff. If the packet is small we make a copy and recycle the
  691. * original buffer, otherwise we use the original buffer itself. If a
  692. * positive drop threshold is supplied packets are dropped and their
  693. * buffers recycled if (a) the number of remaining buffers is under the
  694. * threshold and the packet is too big to copy, or (b) the packet should
  695. * be copied but there is no memory for the copy.
  696. */
  697. static struct sk_buff *get_packet(struct adapter *adap, struct sge_fl *fl,
  698. unsigned int len, unsigned int drop_thres)
  699. {
  700. struct sk_buff *skb = NULL;
  701. struct rx_sw_desc *sd = &fl->sdesc[fl->cidx];
  702. prefetch(sd->skb->data);
  703. fl->credits--;
  704. if (len <= SGE_RX_COPY_THRES) {
  705. skb = alloc_skb(len, GFP_ATOMIC);
  706. if (likely(skb != NULL)) {
  707. __skb_put(skb, len);
  708. pci_dma_sync_single_for_cpu(adap->pdev,
  709. dma_unmap_addr(sd, dma_addr), len,
  710. PCI_DMA_FROMDEVICE);
  711. memcpy(skb->data, sd->skb->data, len);
  712. pci_dma_sync_single_for_device(adap->pdev,
  713. dma_unmap_addr(sd, dma_addr), len,
  714. PCI_DMA_FROMDEVICE);
  715. } else if (!drop_thres)
  716. goto use_orig_buf;
  717. recycle:
  718. recycle_rx_buf(adap, fl, fl->cidx);
  719. return skb;
  720. }
  721. if (unlikely(fl->credits < drop_thres) &&
  722. refill_fl(adap, fl, min(MAX_RX_REFILL, fl->size - fl->credits - 1),
  723. GFP_ATOMIC | __GFP_COMP) == 0)
  724. goto recycle;
  725. use_orig_buf:
  726. pci_unmap_single(adap->pdev, dma_unmap_addr(sd, dma_addr),
  727. fl->buf_size, PCI_DMA_FROMDEVICE);
  728. skb = sd->skb;
  729. skb_put(skb, len);
  730. __refill_fl(adap, fl);
  731. return skb;
  732. }
  733. /**
  734. * get_packet_pg - return the next ingress packet buffer from a free list
  735. * @adap: the adapter that received the packet
  736. * @fl: the SGE free list holding the packet
  737. * @len: the packet length including any SGE padding
  738. * @drop_thres: # of remaining buffers before we start dropping packets
  739. *
  740. * Get the next packet from a free list populated with page chunks.
  741. * If the packet is small we make a copy and recycle the original buffer,
  742. * otherwise we attach the original buffer as a page fragment to a fresh
  743. * sk_buff. If a positive drop threshold is supplied packets are dropped
  744. * and their buffers recycled if (a) the number of remaining buffers is
  745. * under the threshold and the packet is too big to copy, or (b) there's
  746. * no system memory.
  747. *
  748. * Note: this function is similar to @get_packet but deals with Rx buffers
  749. * that are page chunks rather than sk_buffs.
  750. */
  751. static struct sk_buff *get_packet_pg(struct adapter *adap, struct sge_fl *fl,
  752. struct sge_rspq *q, unsigned int len,
  753. unsigned int drop_thres)
  754. {
  755. struct sk_buff *newskb, *skb;
  756. struct rx_sw_desc *sd = &fl->sdesc[fl->cidx];
  757. dma_addr_t dma_addr = dma_unmap_addr(sd, dma_addr);
  758. newskb = skb = q->pg_skb;
  759. if (!skb && (len <= SGE_RX_COPY_THRES)) {
  760. newskb = alloc_skb(len, GFP_ATOMIC);
  761. if (likely(newskb != NULL)) {
  762. __skb_put(newskb, len);
  763. pci_dma_sync_single_for_cpu(adap->pdev, dma_addr, len,
  764. PCI_DMA_FROMDEVICE);
  765. memcpy(newskb->data, sd->pg_chunk.va, len);
  766. pci_dma_sync_single_for_device(adap->pdev, dma_addr,
  767. len,
  768. PCI_DMA_FROMDEVICE);
  769. } else if (!drop_thres)
  770. return NULL;
  771. recycle:
  772. fl->credits--;
  773. recycle_rx_buf(adap, fl, fl->cidx);
  774. q->rx_recycle_buf++;
  775. return newskb;
  776. }
  777. if (unlikely(q->rx_recycle_buf || (!skb && fl->credits <= drop_thres)))
  778. goto recycle;
  779. prefetch(sd->pg_chunk.p_cnt);
  780. if (!skb)
  781. newskb = alloc_skb(SGE_RX_PULL_LEN, GFP_ATOMIC);
  782. if (unlikely(!newskb)) {
  783. if (!drop_thres)
  784. return NULL;
  785. goto recycle;
  786. }
  787. pci_dma_sync_single_for_cpu(adap->pdev, dma_addr, len,
  788. PCI_DMA_FROMDEVICE);
  789. (*sd->pg_chunk.p_cnt)--;
  790. if (!*sd->pg_chunk.p_cnt && sd->pg_chunk.page != fl->pg_chunk.page)
  791. pci_unmap_page(adap->pdev,
  792. sd->pg_chunk.mapping,
  793. fl->alloc_size,
  794. PCI_DMA_FROMDEVICE);
  795. if (!skb) {
  796. __skb_put(newskb, SGE_RX_PULL_LEN);
  797. memcpy(newskb->data, sd->pg_chunk.va, SGE_RX_PULL_LEN);
  798. skb_fill_page_desc(newskb, 0, sd->pg_chunk.page,
  799. sd->pg_chunk.offset + SGE_RX_PULL_LEN,
  800. len - SGE_RX_PULL_LEN);
  801. newskb->len = len;
  802. newskb->data_len = len - SGE_RX_PULL_LEN;
  803. newskb->truesize += newskb->data_len;
  804. } else {
  805. skb_fill_page_desc(newskb, skb_shinfo(newskb)->nr_frags,
  806. sd->pg_chunk.page,
  807. sd->pg_chunk.offset, len);
  808. newskb->len += len;
  809. newskb->data_len += len;
  810. newskb->truesize += len;
  811. }
  812. fl->credits--;
  813. /*
  814. * We do not refill FLs here, we let the caller do it to overlap a
  815. * prefetch.
  816. */
  817. return newskb;
  818. }
  819. /**
  820. * get_imm_packet - return the next ingress packet buffer from a response
  821. * @resp: the response descriptor containing the packet data
  822. *
  823. * Return a packet containing the immediate data of the given response.
  824. */
  825. static inline struct sk_buff *get_imm_packet(const struct rsp_desc *resp)
  826. {
  827. struct sk_buff *skb = alloc_skb(IMMED_PKT_SIZE, GFP_ATOMIC);
  828. if (skb) {
  829. __skb_put(skb, IMMED_PKT_SIZE);
  830. skb_copy_to_linear_data(skb, resp->imm_data, IMMED_PKT_SIZE);
  831. }
  832. return skb;
  833. }
  834. /**
  835. * calc_tx_descs - calculate the number of Tx descriptors for a packet
  836. * @skb: the packet
  837. *
  838. * Returns the number of Tx descriptors needed for the given Ethernet
  839. * packet. Ethernet packets require addition of WR and CPL headers.
  840. */
  841. static inline unsigned int calc_tx_descs(const struct sk_buff *skb)
  842. {
  843. unsigned int flits;
  844. if (skb->len <= WR_LEN - sizeof(struct cpl_tx_pkt))
  845. return 1;
  846. flits = sgl_len(skb_shinfo(skb)->nr_frags + 1) + 2;
  847. if (skb_shinfo(skb)->gso_size)
  848. flits++;
  849. return flits_to_desc(flits);
  850. }
  851. /**
  852. * make_sgl - populate a scatter/gather list for a packet
  853. * @skb: the packet
  854. * @sgp: the SGL to populate
  855. * @start: start address of skb main body data to include in the SGL
  856. * @len: length of skb main body data to include in the SGL
  857. * @pdev: the PCI device
  858. *
  859. * Generates a scatter/gather list for the buffers that make up a packet
  860. * and returns the SGL size in 8-byte words. The caller must size the SGL
  861. * appropriately.
  862. */
  863. static inline unsigned int make_sgl(const struct sk_buff *skb,
  864. struct sg_ent *sgp, unsigned char *start,
  865. unsigned int len, struct pci_dev *pdev)
  866. {
  867. dma_addr_t mapping;
  868. unsigned int i, j = 0, nfrags;
  869. if (len) {
  870. mapping = pci_map_single(pdev, start, len, PCI_DMA_TODEVICE);
  871. sgp->len[0] = cpu_to_be32(len);
  872. sgp->addr[0] = cpu_to_be64(mapping);
  873. j = 1;
  874. }
  875. nfrags = skb_shinfo(skb)->nr_frags;
  876. for (i = 0; i < nfrags; i++) {
  877. const skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
  878. mapping = skb_frag_dma_map(&pdev->dev, frag, 0, skb_frag_size(frag),
  879. DMA_TO_DEVICE);
  880. sgp->len[j] = cpu_to_be32(skb_frag_size(frag));
  881. sgp->addr[j] = cpu_to_be64(mapping);
  882. j ^= 1;
  883. if (j == 0)
  884. ++sgp;
  885. }
  886. if (j)
  887. sgp->len[j] = 0;
  888. return ((nfrags + (len != 0)) * 3) / 2 + j;
  889. }
  890. /**
  891. * check_ring_tx_db - check and potentially ring a Tx queue's doorbell
  892. * @adap: the adapter
  893. * @q: the Tx queue
  894. *
  895. * Ring the doorbel if a Tx queue is asleep. There is a natural race,
  896. * where the HW is going to sleep just after we checked, however,
  897. * then the interrupt handler will detect the outstanding TX packet
  898. * and ring the doorbell for us.
  899. *
  900. * When GTS is disabled we unconditionally ring the doorbell.
  901. */
  902. static inline void check_ring_tx_db(struct adapter *adap, struct sge_txq *q)
  903. {
  904. #if USE_GTS
  905. clear_bit(TXQ_LAST_PKT_DB, &q->flags);
  906. if (test_and_set_bit(TXQ_RUNNING, &q->flags) == 0) {
  907. set_bit(TXQ_LAST_PKT_DB, &q->flags);
  908. t3_write_reg(adap, A_SG_KDOORBELL,
  909. F_SELEGRCNTX | V_EGRCNTX(q->cntxt_id));
  910. }
  911. #else
  912. wmb(); /* write descriptors before telling HW */
  913. t3_write_reg(adap, A_SG_KDOORBELL,
  914. F_SELEGRCNTX | V_EGRCNTX(q->cntxt_id));
  915. #endif
  916. }
  917. static inline void wr_gen2(struct tx_desc *d, unsigned int gen)
  918. {
  919. #if SGE_NUM_GENBITS == 2
  920. d->flit[TX_DESC_FLITS - 1] = cpu_to_be64(gen);
  921. #endif
  922. }
  923. /**
  924. * write_wr_hdr_sgl - write a WR header and, optionally, SGL
  925. * @ndesc: number of Tx descriptors spanned by the SGL
  926. * @skb: the packet corresponding to the WR
  927. * @d: first Tx descriptor to be written
  928. * @pidx: index of above descriptors
  929. * @q: the SGE Tx queue
  930. * @sgl: the SGL
  931. * @flits: number of flits to the start of the SGL in the first descriptor
  932. * @sgl_flits: the SGL size in flits
  933. * @gen: the Tx descriptor generation
  934. * @wr_hi: top 32 bits of WR header based on WR type (big endian)
  935. * @wr_lo: low 32 bits of WR header based on WR type (big endian)
  936. *
  937. * Write a work request header and an associated SGL. If the SGL is
  938. * small enough to fit into one Tx descriptor it has already been written
  939. * and we just need to write the WR header. Otherwise we distribute the
  940. * SGL across the number of descriptors it spans.
  941. */
  942. static void write_wr_hdr_sgl(unsigned int ndesc, struct sk_buff *skb,
  943. struct tx_desc *d, unsigned int pidx,
  944. const struct sge_txq *q,
  945. const struct sg_ent *sgl,
  946. unsigned int flits, unsigned int sgl_flits,
  947. unsigned int gen, __be32 wr_hi,
  948. __be32 wr_lo)
  949. {
  950. struct work_request_hdr *wrp = (struct work_request_hdr *)d;
  951. struct tx_sw_desc *sd = &q->sdesc[pidx];
  952. sd->skb = skb;
  953. if (need_skb_unmap()) {
  954. sd->fragidx = 0;
  955. sd->addr_idx = 0;
  956. sd->sflit = flits;
  957. }
  958. if (likely(ndesc == 1)) {
  959. sd->eop = 1;
  960. wrp->wr_hi = htonl(F_WR_SOP | F_WR_EOP | V_WR_DATATYPE(1) |
  961. V_WR_SGLSFLT(flits)) | wr_hi;
  962. wmb();
  963. wrp->wr_lo = htonl(V_WR_LEN(flits + sgl_flits) |
  964. V_WR_GEN(gen)) | wr_lo;
  965. wr_gen2(d, gen);
  966. } else {
  967. unsigned int ogen = gen;
  968. const u64 *fp = (const u64 *)sgl;
  969. struct work_request_hdr *wp = wrp;
  970. wrp->wr_hi = htonl(F_WR_SOP | V_WR_DATATYPE(1) |
  971. V_WR_SGLSFLT(flits)) | wr_hi;
  972. while (sgl_flits) {
  973. unsigned int avail = WR_FLITS - flits;
  974. if (avail > sgl_flits)
  975. avail = sgl_flits;
  976. memcpy(&d->flit[flits], fp, avail * sizeof(*fp));
  977. sgl_flits -= avail;
  978. ndesc--;
  979. if (!sgl_flits)
  980. break;
  981. fp += avail;
  982. d++;
  983. sd->eop = 0;
  984. sd++;
  985. if (++pidx == q->size) {
  986. pidx = 0;
  987. gen ^= 1;
  988. d = q->desc;
  989. sd = q->sdesc;
  990. }
  991. sd->skb = skb;
  992. wrp = (struct work_request_hdr *)d;
  993. wrp->wr_hi = htonl(V_WR_DATATYPE(1) |
  994. V_WR_SGLSFLT(1)) | wr_hi;
  995. wrp->wr_lo = htonl(V_WR_LEN(min(WR_FLITS,
  996. sgl_flits + 1)) |
  997. V_WR_GEN(gen)) | wr_lo;
  998. wr_gen2(d, gen);
  999. flits = 1;
  1000. }
  1001. sd->eop = 1;
  1002. wrp->wr_hi |= htonl(F_WR_EOP);
  1003. wmb();
  1004. wp->wr_lo = htonl(V_WR_LEN(WR_FLITS) | V_WR_GEN(ogen)) | wr_lo;
  1005. wr_gen2((struct tx_desc *)wp, ogen);
  1006. WARN_ON(ndesc != 0);
  1007. }
  1008. }
  1009. /**
  1010. * write_tx_pkt_wr - write a TX_PKT work request
  1011. * @adap: the adapter
  1012. * @skb: the packet to send
  1013. * @pi: the egress interface
  1014. * @pidx: index of the first Tx descriptor to write
  1015. * @gen: the generation value to use
  1016. * @q: the Tx queue
  1017. * @ndesc: number of descriptors the packet will occupy
  1018. * @compl: the value of the COMPL bit to use
  1019. *
  1020. * Generate a TX_PKT work request to send the supplied packet.
  1021. */
  1022. static void write_tx_pkt_wr(struct adapter *adap, struct sk_buff *skb,
  1023. const struct port_info *pi,
  1024. unsigned int pidx, unsigned int gen,
  1025. struct sge_txq *q, unsigned int ndesc,
  1026. unsigned int compl)
  1027. {
  1028. unsigned int flits, sgl_flits, cntrl, tso_info;
  1029. struct sg_ent *sgp, sgl[MAX_SKB_FRAGS / 2 + 1];
  1030. struct tx_desc *d = &q->desc[pidx];
  1031. struct cpl_tx_pkt *cpl = (struct cpl_tx_pkt *)d;
  1032. cpl->len = htonl(skb->len);
  1033. cntrl = V_TXPKT_INTF(pi->port_id);
  1034. if (vlan_tx_tag_present(skb))
  1035. cntrl |= F_TXPKT_VLAN_VLD | V_TXPKT_VLAN(vlan_tx_tag_get(skb));
  1036. tso_info = V_LSO_MSS(skb_shinfo(skb)->gso_size);
  1037. if (tso_info) {
  1038. int eth_type;
  1039. struct cpl_tx_pkt_lso *hdr = (struct cpl_tx_pkt_lso *)cpl;
  1040. d->flit[2] = 0;
  1041. cntrl |= V_TXPKT_OPCODE(CPL_TX_PKT_LSO);
  1042. hdr->cntrl = htonl(cntrl);
  1043. eth_type = skb_network_offset(skb) == ETH_HLEN ?
  1044. CPL_ETH_II : CPL_ETH_II_VLAN;
  1045. tso_info |= V_LSO_ETH_TYPE(eth_type) |
  1046. V_LSO_IPHDR_WORDS(ip_hdr(skb)->ihl) |
  1047. V_LSO_TCPHDR_WORDS(tcp_hdr(skb)->doff);
  1048. hdr->lso_info = htonl(tso_info);
  1049. flits = 3;
  1050. } else {
  1051. cntrl |= V_TXPKT_OPCODE(CPL_TX_PKT);
  1052. cntrl |= F_TXPKT_IPCSUM_DIS; /* SW calculates IP csum */
  1053. cntrl |= V_TXPKT_L4CSUM_DIS(skb->ip_summed != CHECKSUM_PARTIAL);
  1054. cpl->cntrl = htonl(cntrl);
  1055. if (skb->len <= WR_LEN - sizeof(*cpl)) {
  1056. q->sdesc[pidx].skb = NULL;
  1057. if (!skb->data_len)
  1058. skb_copy_from_linear_data(skb, &d->flit[2],
  1059. skb->len);
  1060. else
  1061. skb_copy_bits(skb, 0, &d->flit[2], skb->len);
  1062. flits = (skb->len + 7) / 8 + 2;
  1063. cpl->wr.wr_hi = htonl(V_WR_BCNTLFLT(skb->len & 7) |
  1064. V_WR_OP(FW_WROPCODE_TUNNEL_TX_PKT)
  1065. | F_WR_SOP | F_WR_EOP | compl);
  1066. wmb();
  1067. cpl->wr.wr_lo = htonl(V_WR_LEN(flits) | V_WR_GEN(gen) |
  1068. V_WR_TID(q->token));
  1069. wr_gen2(d, gen);
  1070. kfree_skb(skb);
  1071. return;
  1072. }
  1073. flits = 2;
  1074. }
  1075. sgp = ndesc == 1 ? (struct sg_ent *)&d->flit[flits] : sgl;
  1076. sgl_flits = make_sgl(skb, sgp, skb->data, skb_headlen(skb), adap->pdev);
  1077. write_wr_hdr_sgl(ndesc, skb, d, pidx, q, sgl, flits, sgl_flits, gen,
  1078. htonl(V_WR_OP(FW_WROPCODE_TUNNEL_TX_PKT) | compl),
  1079. htonl(V_WR_TID(q->token)));
  1080. }
  1081. static inline void t3_stop_tx_queue(struct netdev_queue *txq,
  1082. struct sge_qset *qs, struct sge_txq *q)
  1083. {
  1084. netif_tx_stop_queue(txq);
  1085. set_bit(TXQ_ETH, &qs->txq_stopped);
  1086. q->stops++;
  1087. }
  1088. /**
  1089. * eth_xmit - add a packet to the Ethernet Tx queue
  1090. * @skb: the packet
  1091. * @dev: the egress net device
  1092. *
  1093. * Add a packet to an SGE Tx queue. Runs with softirqs disabled.
  1094. */
  1095. netdev_tx_t t3_eth_xmit(struct sk_buff *skb, struct net_device *dev)
  1096. {
  1097. int qidx;
  1098. unsigned int ndesc, pidx, credits, gen, compl;
  1099. const struct port_info *pi = netdev_priv(dev);
  1100. struct adapter *adap = pi->adapter;
  1101. struct netdev_queue *txq;
  1102. struct sge_qset *qs;
  1103. struct sge_txq *q;
  1104. /*
  1105. * The chip min packet length is 9 octets but play safe and reject
  1106. * anything shorter than an Ethernet header.
  1107. */
  1108. if (unlikely(skb->len < ETH_HLEN)) {
  1109. dev_kfree_skb(skb);
  1110. return NETDEV_TX_OK;
  1111. }
  1112. qidx = skb_get_queue_mapping(skb);
  1113. qs = &pi->qs[qidx];
  1114. q = &qs->txq[TXQ_ETH];
  1115. txq = netdev_get_tx_queue(dev, qidx);
  1116. reclaim_completed_tx(adap, q, TX_RECLAIM_CHUNK);
  1117. credits = q->size - q->in_use;
  1118. ndesc = calc_tx_descs(skb);
  1119. if (unlikely(credits < ndesc)) {
  1120. t3_stop_tx_queue(txq, qs, q);
  1121. dev_err(&adap->pdev->dev,
  1122. "%s: Tx ring %u full while queue awake!\n",
  1123. dev->name, q->cntxt_id & 7);
  1124. return NETDEV_TX_BUSY;
  1125. }
  1126. q->in_use += ndesc;
  1127. if (unlikely(credits - ndesc < q->stop_thres)) {
  1128. t3_stop_tx_queue(txq, qs, q);
  1129. if (should_restart_tx(q) &&
  1130. test_and_clear_bit(TXQ_ETH, &qs->txq_stopped)) {
  1131. q->restarts++;
  1132. netif_tx_start_queue(txq);
  1133. }
  1134. }
  1135. gen = q->gen;
  1136. q->unacked += ndesc;
  1137. compl = (q->unacked & 8) << (S_WR_COMPL - 3);
  1138. q->unacked &= 7;
  1139. pidx = q->pidx;
  1140. q->pidx += ndesc;
  1141. if (q->pidx >= q->size) {
  1142. q->pidx -= q->size;
  1143. q->gen ^= 1;
  1144. }
  1145. /* update port statistics */
  1146. if (skb->ip_summed == CHECKSUM_COMPLETE)
  1147. qs->port_stats[SGE_PSTAT_TX_CSUM]++;
  1148. if (skb_shinfo(skb)->gso_size)
  1149. qs->port_stats[SGE_PSTAT_TSO]++;
  1150. if (vlan_tx_tag_present(skb))
  1151. qs->port_stats[SGE_PSTAT_VLANINS]++;
  1152. /*
  1153. * We do not use Tx completion interrupts to free DMAd Tx packets.
  1154. * This is good for performance but means that we rely on new Tx
  1155. * packets arriving to run the destructors of completed packets,
  1156. * which open up space in their sockets' send queues. Sometimes
  1157. * we do not get such new packets causing Tx to stall. A single
  1158. * UDP transmitter is a good example of this situation. We have
  1159. * a clean up timer that periodically reclaims completed packets
  1160. * but it doesn't run often enough (nor do we want it to) to prevent
  1161. * lengthy stalls. A solution to this problem is to run the
  1162. * destructor early, after the packet is queued but before it's DMAd.
  1163. * A cons is that we lie to socket memory accounting, but the amount
  1164. * of extra memory is reasonable (limited by the number of Tx
  1165. * descriptors), the packets do actually get freed quickly by new
  1166. * packets almost always, and for protocols like TCP that wait for
  1167. * acks to really free up the data the extra memory is even less.
  1168. * On the positive side we run the destructors on the sending CPU
  1169. * rather than on a potentially different completing CPU, usually a
  1170. * good thing. We also run them without holding our Tx queue lock,
  1171. * unlike what reclaim_completed_tx() would otherwise do.
  1172. *
  1173. * Run the destructor before telling the DMA engine about the packet
  1174. * to make sure it doesn't complete and get freed prematurely.
  1175. */
  1176. if (likely(!skb_shared(skb)))
  1177. skb_orphan(skb);
  1178. write_tx_pkt_wr(adap, skb, pi, pidx, gen, q, ndesc, compl);
  1179. check_ring_tx_db(adap, q);
  1180. return NETDEV_TX_OK;
  1181. }
  1182. /**
  1183. * write_imm - write a packet into a Tx descriptor as immediate data
  1184. * @d: the Tx descriptor to write
  1185. * @skb: the packet
  1186. * @len: the length of packet data to write as immediate data
  1187. * @gen: the generation bit value to write
  1188. *
  1189. * Writes a packet as immediate data into a Tx descriptor. The packet
  1190. * contains a work request at its beginning. We must write the packet
  1191. * carefully so the SGE doesn't read it accidentally before it's written
  1192. * in its entirety.
  1193. */
  1194. static inline void write_imm(struct tx_desc *d, struct sk_buff *skb,
  1195. unsigned int len, unsigned int gen)
  1196. {
  1197. struct work_request_hdr *from = (struct work_request_hdr *)skb->data;
  1198. struct work_request_hdr *to = (struct work_request_hdr *)d;
  1199. if (likely(!skb->data_len))
  1200. memcpy(&to[1], &from[1], len - sizeof(*from));
  1201. else
  1202. skb_copy_bits(skb, sizeof(*from), &to[1], len - sizeof(*from));
  1203. to->wr_hi = from->wr_hi | htonl(F_WR_SOP | F_WR_EOP |
  1204. V_WR_BCNTLFLT(len & 7));
  1205. wmb();
  1206. to->wr_lo = from->wr_lo | htonl(V_WR_GEN(gen) |
  1207. V_WR_LEN((len + 7) / 8));
  1208. wr_gen2(d, gen);
  1209. kfree_skb(skb);
  1210. }
  1211. /**
  1212. * check_desc_avail - check descriptor availability on a send queue
  1213. * @adap: the adapter
  1214. * @q: the send queue
  1215. * @skb: the packet needing the descriptors
  1216. * @ndesc: the number of Tx descriptors needed
  1217. * @qid: the Tx queue number in its queue set (TXQ_OFLD or TXQ_CTRL)
  1218. *
  1219. * Checks if the requested number of Tx descriptors is available on an
  1220. * SGE send queue. If the queue is already suspended or not enough
  1221. * descriptors are available the packet is queued for later transmission.
  1222. * Must be called with the Tx queue locked.
  1223. *
  1224. * Returns 0 if enough descriptors are available, 1 if there aren't
  1225. * enough descriptors and the packet has been queued, and 2 if the caller
  1226. * needs to retry because there weren't enough descriptors at the
  1227. * beginning of the call but some freed up in the mean time.
  1228. */
  1229. static inline int check_desc_avail(struct adapter *adap, struct sge_txq *q,
  1230. struct sk_buff *skb, unsigned int ndesc,
  1231. unsigned int qid)
  1232. {
  1233. if (unlikely(!skb_queue_empty(&q->sendq))) {
  1234. addq_exit:__skb_queue_tail(&q->sendq, skb);
  1235. return 1;
  1236. }
  1237. if (unlikely(q->size - q->in_use < ndesc)) {
  1238. struct sge_qset *qs = txq_to_qset(q, qid);
  1239. set_bit(qid, &qs->txq_stopped);
  1240. smp_mb__after_clear_bit();
  1241. if (should_restart_tx(q) &&
  1242. test_and_clear_bit(qid, &qs->txq_stopped))
  1243. return 2;
  1244. q->stops++;
  1245. goto addq_exit;
  1246. }
  1247. return 0;
  1248. }
  1249. /**
  1250. * reclaim_completed_tx_imm - reclaim completed control-queue Tx descs
  1251. * @q: the SGE control Tx queue
  1252. *
  1253. * This is a variant of reclaim_completed_tx() that is used for Tx queues
  1254. * that send only immediate data (presently just the control queues) and
  1255. * thus do not have any sk_buffs to release.
  1256. */
  1257. static inline void reclaim_completed_tx_imm(struct sge_txq *q)
  1258. {
  1259. unsigned int reclaim = q->processed - q->cleaned;
  1260. q->in_use -= reclaim;
  1261. q->cleaned += reclaim;
  1262. }
  1263. static inline int immediate(const struct sk_buff *skb)
  1264. {
  1265. return skb->len <= WR_LEN;
  1266. }
  1267. /**
  1268. * ctrl_xmit - send a packet through an SGE control Tx queue
  1269. * @adap: the adapter
  1270. * @q: the control queue
  1271. * @skb: the packet
  1272. *
  1273. * Send a packet through an SGE control Tx queue. Packets sent through
  1274. * a control queue must fit entirely as immediate data in a single Tx
  1275. * descriptor and have no page fragments.
  1276. */
  1277. static int ctrl_xmit(struct adapter *adap, struct sge_txq *q,
  1278. struct sk_buff *skb)
  1279. {
  1280. int ret;
  1281. struct work_request_hdr *wrp = (struct work_request_hdr *)skb->data;
  1282. if (unlikely(!immediate(skb))) {
  1283. WARN_ON(1);
  1284. dev_kfree_skb(skb);
  1285. return NET_XMIT_SUCCESS;
  1286. }
  1287. wrp->wr_hi |= htonl(F_WR_SOP | F_WR_EOP);
  1288. wrp->wr_lo = htonl(V_WR_TID(q->token));
  1289. spin_lock(&q->lock);
  1290. again:reclaim_completed_tx_imm(q);
  1291. ret = check_desc_avail(adap, q, skb, 1, TXQ_CTRL);
  1292. if (unlikely(ret)) {
  1293. if (ret == 1) {
  1294. spin_unlock(&q->lock);
  1295. return NET_XMIT_CN;
  1296. }
  1297. goto again;
  1298. }
  1299. write_imm(&q->desc[q->pidx], skb, skb->len, q->gen);
  1300. q->in_use++;
  1301. if (++q->pidx >= q->size) {
  1302. q->pidx = 0;
  1303. q->gen ^= 1;
  1304. }
  1305. spin_unlock(&q->lock);
  1306. wmb();
  1307. t3_write_reg(adap, A_SG_KDOORBELL,
  1308. F_SELEGRCNTX | V_EGRCNTX(q->cntxt_id));
  1309. return NET_XMIT_SUCCESS;
  1310. }
  1311. /**
  1312. * restart_ctrlq - restart a suspended control queue
  1313. * @qs: the queue set cotaining the control queue
  1314. *
  1315. * Resumes transmission on a suspended Tx control queue.
  1316. */
  1317. static void restart_ctrlq(unsigned long data)
  1318. {
  1319. struct sk_buff *skb;
  1320. struct sge_qset *qs = (struct sge_qset *)data;
  1321. struct sge_txq *q = &qs->txq[TXQ_CTRL];
  1322. spin_lock(&q->lock);
  1323. again:reclaim_completed_tx_imm(q);
  1324. while (q->in_use < q->size &&
  1325. (skb = __skb_dequeue(&q->sendq)) != NULL) {
  1326. write_imm(&q->desc[q->pidx], skb, skb->len, q->gen);
  1327. if (++q->pidx >= q->size) {
  1328. q->pidx = 0;
  1329. q->gen ^= 1;
  1330. }
  1331. q->in_use++;
  1332. }
  1333. if (!skb_queue_empty(&q->sendq)) {
  1334. set_bit(TXQ_CTRL, &qs->txq_stopped);
  1335. smp_mb__after_clear_bit();
  1336. if (should_restart_tx(q) &&
  1337. test_and_clear_bit(TXQ_CTRL, &qs->txq_stopped))
  1338. goto again;
  1339. q->stops++;
  1340. }
  1341. spin_unlock(&q->lock);
  1342. wmb();
  1343. t3_write_reg(qs->adap, A_SG_KDOORBELL,
  1344. F_SELEGRCNTX | V_EGRCNTX(q->cntxt_id));
  1345. }
  1346. /*
  1347. * Send a management message through control queue 0
  1348. */
  1349. int t3_mgmt_tx(struct adapter *adap, struct sk_buff *skb)
  1350. {
  1351. int ret;
  1352. local_bh_disable();
  1353. ret = ctrl_xmit(adap, &adap->sge.qs[0].txq[TXQ_CTRL], skb);
  1354. local_bh_enable();
  1355. return ret;
  1356. }
  1357. /**
  1358. * deferred_unmap_destructor - unmap a packet when it is freed
  1359. * @skb: the packet
  1360. *
  1361. * This is the packet destructor used for Tx packets that need to remain
  1362. * mapped until they are freed rather than until their Tx descriptors are
  1363. * freed.
  1364. */
  1365. static void deferred_unmap_destructor(struct sk_buff *skb)
  1366. {
  1367. int i;
  1368. const dma_addr_t *p;
  1369. const struct skb_shared_info *si;
  1370. const struct deferred_unmap_info *dui;
  1371. dui = (struct deferred_unmap_info *)skb->head;
  1372. p = dui->addr;
  1373. if (skb->tail - skb->transport_header)
  1374. pci_unmap_single(dui->pdev, *p++,
  1375. skb->tail - skb->transport_header,
  1376. PCI_DMA_TODEVICE);
  1377. si = skb_shinfo(skb);
  1378. for (i = 0; i < si->nr_frags; i++)
  1379. pci_unmap_page(dui->pdev, *p++, skb_frag_size(&si->frags[i]),
  1380. PCI_DMA_TODEVICE);
  1381. }
  1382. static void setup_deferred_unmapping(struct sk_buff *skb, struct pci_dev *pdev,
  1383. const struct sg_ent *sgl, int sgl_flits)
  1384. {
  1385. dma_addr_t *p;
  1386. struct deferred_unmap_info *dui;
  1387. dui = (struct deferred_unmap_info *)skb->head;
  1388. dui->pdev = pdev;
  1389. for (p = dui->addr; sgl_flits >= 3; sgl++, sgl_flits -= 3) {
  1390. *p++ = be64_to_cpu(sgl->addr[0]);
  1391. *p++ = be64_to_cpu(sgl->addr[1]);
  1392. }
  1393. if (sgl_flits)
  1394. *p = be64_to_cpu(sgl->addr[0]);
  1395. }
  1396. /**
  1397. * write_ofld_wr - write an offload work request
  1398. * @adap: the adapter
  1399. * @skb: the packet to send
  1400. * @q: the Tx queue
  1401. * @pidx: index of the first Tx descriptor to write
  1402. * @gen: the generation value to use
  1403. * @ndesc: number of descriptors the packet will occupy
  1404. *
  1405. * Write an offload work request to send the supplied packet. The packet
  1406. * data already carry the work request with most fields populated.
  1407. */
  1408. static void write_ofld_wr(struct adapter *adap, struct sk_buff *skb,
  1409. struct sge_txq *q, unsigned int pidx,
  1410. unsigned int gen, unsigned int ndesc)
  1411. {
  1412. unsigned int sgl_flits, flits;
  1413. struct work_request_hdr *from;
  1414. struct sg_ent *sgp, sgl[MAX_SKB_FRAGS / 2 + 1];
  1415. struct tx_desc *d = &q->desc[pidx];
  1416. if (immediate(skb)) {
  1417. q->sdesc[pidx].skb = NULL;
  1418. write_imm(d, skb, skb->len, gen);
  1419. return;
  1420. }
  1421. /* Only TX_DATA builds SGLs */
  1422. from = (struct work_request_hdr *)skb->data;
  1423. memcpy(&d->flit[1], &from[1],
  1424. skb_transport_offset(skb) - sizeof(*from));
  1425. flits = skb_transport_offset(skb) / 8;
  1426. sgp = ndesc == 1 ? (struct sg_ent *)&d->flit[flits] : sgl;
  1427. sgl_flits = make_sgl(skb, sgp, skb_transport_header(skb),
  1428. skb->tail - skb->transport_header,
  1429. adap->pdev);
  1430. if (need_skb_unmap()) {
  1431. setup_deferred_unmapping(skb, adap->pdev, sgp, sgl_flits);
  1432. skb->destructor = deferred_unmap_destructor;
  1433. }
  1434. write_wr_hdr_sgl(ndesc, skb, d, pidx, q, sgl, flits, sgl_flits,
  1435. gen, from->wr_hi, from->wr_lo);
  1436. }
  1437. /**
  1438. * calc_tx_descs_ofld - calculate # of Tx descriptors for an offload packet
  1439. * @skb: the packet
  1440. *
  1441. * Returns the number of Tx descriptors needed for the given offload
  1442. * packet. These packets are already fully constructed.
  1443. */
  1444. static inline unsigned int calc_tx_descs_ofld(const struct sk_buff *skb)
  1445. {
  1446. unsigned int flits, cnt;
  1447. if (skb->len <= WR_LEN)
  1448. return 1; /* packet fits as immediate data */
  1449. flits = skb_transport_offset(skb) / 8; /* headers */
  1450. cnt = skb_shinfo(skb)->nr_frags;
  1451. if (skb->tail != skb->transport_header)
  1452. cnt++;
  1453. return flits_to_desc(flits + sgl_len(cnt));
  1454. }
  1455. /**
  1456. * ofld_xmit - send a packet through an offload queue
  1457. * @adap: the adapter
  1458. * @q: the Tx offload queue
  1459. * @skb: the packet
  1460. *
  1461. * Send an offload packet through an SGE offload queue.
  1462. */
  1463. static int ofld_xmit(struct adapter *adap, struct sge_txq *q,
  1464. struct sk_buff *skb)
  1465. {
  1466. int ret;
  1467. unsigned int ndesc = calc_tx_descs_ofld(skb), pidx, gen;
  1468. spin_lock(&q->lock);
  1469. again: reclaim_completed_tx(adap, q, TX_RECLAIM_CHUNK);
  1470. ret = check_desc_avail(adap, q, skb, ndesc, TXQ_OFLD);
  1471. if (unlikely(ret)) {
  1472. if (ret == 1) {
  1473. skb->priority = ndesc; /* save for restart */
  1474. spin_unlock(&q->lock);
  1475. return NET_XMIT_CN;
  1476. }
  1477. goto again;
  1478. }
  1479. gen = q->gen;
  1480. q->in_use += ndesc;
  1481. pidx = q->pidx;
  1482. q->pidx += ndesc;
  1483. if (q->pidx >= q->size) {
  1484. q->pidx -= q->size;
  1485. q->gen ^= 1;
  1486. }
  1487. spin_unlock(&q->lock);
  1488. write_ofld_wr(adap, skb, q, pidx, gen, ndesc);
  1489. check_ring_tx_db(adap, q);
  1490. return NET_XMIT_SUCCESS;
  1491. }
  1492. /**
  1493. * restart_offloadq - restart a suspended offload queue
  1494. * @qs: the queue set cotaining the offload queue
  1495. *
  1496. * Resumes transmission on a suspended Tx offload queue.
  1497. */
  1498. static void restart_offloadq(unsigned long data)
  1499. {
  1500. struct sk_buff *skb;
  1501. struct sge_qset *qs = (struct sge_qset *)data;
  1502. struct sge_txq *q = &qs->txq[TXQ_OFLD];
  1503. const struct port_info *pi = netdev_priv(qs->netdev);
  1504. struct adapter *adap = pi->adapter;
  1505. spin_lock(&q->lock);
  1506. again: reclaim_completed_tx(adap, q, TX_RECLAIM_CHUNK);
  1507. while ((skb = skb_peek(&q->sendq)) != NULL) {
  1508. unsigned int gen, pidx;
  1509. unsigned int ndesc = skb->priority;
  1510. if (unlikely(q->size - q->in_use < ndesc)) {
  1511. set_bit(TXQ_OFLD, &qs->txq_stopped);
  1512. smp_mb__after_clear_bit();
  1513. if (should_restart_tx(q) &&
  1514. test_and_clear_bit(TXQ_OFLD, &qs->txq_stopped))
  1515. goto again;
  1516. q->stops++;
  1517. break;
  1518. }
  1519. gen = q->gen;
  1520. q->in_use += ndesc;
  1521. pidx = q->pidx;
  1522. q->pidx += ndesc;
  1523. if (q->pidx >= q->size) {
  1524. q->pidx -= q->size;
  1525. q->gen ^= 1;
  1526. }
  1527. __skb_unlink(skb, &q->sendq);
  1528. spin_unlock(&q->lock);
  1529. write_ofld_wr(adap, skb, q, pidx, gen, ndesc);
  1530. spin_lock(&q->lock);
  1531. }
  1532. spin_unlock(&q->lock);
  1533. #if USE_GTS
  1534. set_bit(TXQ_RUNNING, &q->flags);
  1535. set_bit(TXQ_LAST_PKT_DB, &q->flags);
  1536. #endif
  1537. wmb();
  1538. t3_write_reg(adap, A_SG_KDOORBELL,
  1539. F_SELEGRCNTX | V_EGRCNTX(q->cntxt_id));
  1540. }
  1541. /**
  1542. * queue_set - return the queue set a packet should use
  1543. * @skb: the packet
  1544. *
  1545. * Maps a packet to the SGE queue set it should use. The desired queue
  1546. * set is carried in bits 1-3 in the packet's priority.
  1547. */
  1548. static inline int queue_set(const struct sk_buff *skb)
  1549. {
  1550. return skb->priority >> 1;
  1551. }
  1552. /**
  1553. * is_ctrl_pkt - return whether an offload packet is a control packet
  1554. * @skb: the packet
  1555. *
  1556. * Determines whether an offload packet should use an OFLD or a CTRL
  1557. * Tx queue. This is indicated by bit 0 in the packet's priority.
  1558. */
  1559. static inline int is_ctrl_pkt(const struct sk_buff *skb)
  1560. {
  1561. return skb->priority & 1;
  1562. }
  1563. /**
  1564. * t3_offload_tx - send an offload packet
  1565. * @tdev: the offload device to send to
  1566. * @skb: the packet
  1567. *
  1568. * Sends an offload packet. We use the packet priority to select the
  1569. * appropriate Tx queue as follows: bit 0 indicates whether the packet
  1570. * should be sent as regular or control, bits 1-3 select the queue set.
  1571. */
  1572. int t3_offload_tx(struct t3cdev *tdev, struct sk_buff *skb)
  1573. {
  1574. struct adapter *adap = tdev2adap(tdev);
  1575. struct sge_qset *qs = &adap->sge.qs[queue_set(skb)];
  1576. if (unlikely(is_ctrl_pkt(skb)))
  1577. return ctrl_xmit(adap, &qs->txq[TXQ_CTRL], skb);
  1578. return ofld_xmit(adap, &qs->txq[TXQ_OFLD], skb);
  1579. }
  1580. /**
  1581. * offload_enqueue - add an offload packet to an SGE offload receive queue
  1582. * @q: the SGE response queue
  1583. * @skb: the packet
  1584. *
  1585. * Add a new offload packet to an SGE response queue's offload packet
  1586. * queue. If the packet is the first on the queue it schedules the RX
  1587. * softirq to process the queue.
  1588. */
  1589. static inline void offload_enqueue(struct sge_rspq *q, struct sk_buff *skb)
  1590. {
  1591. int was_empty = skb_queue_empty(&q->rx_queue);
  1592. __skb_queue_tail(&q->rx_queue, skb);
  1593. if (was_empty) {
  1594. struct sge_qset *qs = rspq_to_qset(q);
  1595. napi_schedule(&qs->napi);
  1596. }
  1597. }
  1598. /**
  1599. * deliver_partial_bundle - deliver a (partial) bundle of Rx offload pkts
  1600. * @tdev: the offload device that will be receiving the packets
  1601. * @q: the SGE response queue that assembled the bundle
  1602. * @skbs: the partial bundle
  1603. * @n: the number of packets in the bundle
  1604. *
  1605. * Delivers a (partial) bundle of Rx offload packets to an offload device.
  1606. */
  1607. static inline void deliver_partial_bundle(struct t3cdev *tdev,
  1608. struct sge_rspq *q,
  1609. struct sk_buff *skbs[], int n)
  1610. {
  1611. if (n) {
  1612. q->offload_bundles++;
  1613. tdev->recv(tdev, skbs, n);
  1614. }
  1615. }
  1616. /**
  1617. * ofld_poll - NAPI handler for offload packets in interrupt mode
  1618. * @dev: the network device doing the polling
  1619. * @budget: polling budget
  1620. *
  1621. * The NAPI handler for offload packets when a response queue is serviced
  1622. * by the hard interrupt handler, i.e., when it's operating in non-polling
  1623. * mode. Creates small packet batches and sends them through the offload
  1624. * receive handler. Batches need to be of modest size as we do prefetches
  1625. * on the packets in each.
  1626. */
  1627. static int ofld_poll(struct napi_struct *napi, int budget)
  1628. {
  1629. struct sge_qset *qs = container_of(napi, struct sge_qset, napi);
  1630. struct sge_rspq *q = &qs->rspq;
  1631. struct adapter *adapter = qs->adap;
  1632. int work_done = 0;
  1633. while (work_done < budget) {
  1634. struct sk_buff *skb, *tmp, *skbs[RX_BUNDLE_SIZE];
  1635. struct sk_buff_head queue;
  1636. int ngathered;
  1637. spin_lock_irq(&q->lock);
  1638. __skb_queue_head_init(&queue);
  1639. skb_queue_splice_init(&q->rx_queue, &queue);
  1640. if (skb_queue_empty(&queue)) {
  1641. napi_complete(napi);
  1642. spin_unlock_irq(&q->lock);
  1643. return work_done;
  1644. }
  1645. spin_unlock_irq(&q->lock);
  1646. ngathered = 0;
  1647. skb_queue_walk_safe(&queue, skb, tmp) {
  1648. if (work_done >= budget)
  1649. break;
  1650. work_done++;
  1651. __skb_unlink(skb, &queue);
  1652. prefetch(skb->data);
  1653. skbs[ngathered] = skb;
  1654. if (++ngathered == RX_BUNDLE_SIZE) {
  1655. q->offload_bundles++;
  1656. adapter->tdev.recv(&adapter->tdev, skbs,
  1657. ngathered);
  1658. ngathered = 0;
  1659. }
  1660. }
  1661. if (!skb_queue_empty(&queue)) {
  1662. /* splice remaining packets back onto Rx queue */
  1663. spin_lock_irq(&q->lock);
  1664. skb_queue_splice(&queue, &q->rx_queue);
  1665. spin_unlock_irq(&q->lock);
  1666. }
  1667. deliver_partial_bundle(&adapter->tdev, q, skbs, ngathered);
  1668. }
  1669. return work_done;
  1670. }
  1671. /**
  1672. * rx_offload - process a received offload packet
  1673. * @tdev: the offload device receiving the packet
  1674. * @rq: the response queue that received the packet
  1675. * @skb: the packet
  1676. * @rx_gather: a gather list of packets if we are building a bundle
  1677. * @gather_idx: index of the next available slot in the bundle
  1678. *
  1679. * Process an ingress offload pakcet and add it to the offload ingress
  1680. * queue. Returns the index of the next available slot in the bundle.
  1681. */
  1682. static inline int rx_offload(struct t3cdev *tdev, struct sge_rspq *rq,
  1683. struct sk_buff *skb, struct sk_buff *rx_gather[],
  1684. unsigned int gather_idx)
  1685. {
  1686. skb_reset_mac_header(skb);
  1687. skb_reset_network_header(skb);
  1688. skb_reset_transport_header(skb);
  1689. if (rq->polling) {
  1690. rx_gather[gather_idx++] = skb;
  1691. if (gather_idx == RX_BUNDLE_SIZE) {
  1692. tdev->recv(tdev, rx_gather, RX_BUNDLE_SIZE);
  1693. gather_idx = 0;
  1694. rq->offload_bundles++;
  1695. }
  1696. } else
  1697. offload_enqueue(rq, skb);
  1698. return gather_idx;
  1699. }
  1700. /**
  1701. * restart_tx - check whether to restart suspended Tx queues
  1702. * @qs: the queue set to resume
  1703. *
  1704. * Restarts suspended Tx queues of an SGE queue set if they have enough
  1705. * free resources to resume operation.
  1706. */
  1707. static void restart_tx(struct sge_qset *qs)
  1708. {
  1709. if (test_bit(TXQ_ETH, &qs->txq_stopped) &&
  1710. should_restart_tx(&qs->txq[TXQ_ETH]) &&
  1711. test_and_clear_bit(TXQ_ETH, &qs->txq_stopped)) {
  1712. qs->txq[TXQ_ETH].restarts++;
  1713. if (netif_running(qs->netdev))
  1714. netif_tx_wake_queue(qs->tx_q);
  1715. }
  1716. if (test_bit(TXQ_OFLD, &qs->txq_stopped) &&
  1717. should_restart_tx(&qs->txq[TXQ_OFLD]) &&
  1718. test_and_clear_bit(TXQ_OFLD, &qs->txq_stopped)) {
  1719. qs->txq[TXQ_OFLD].restarts++;
  1720. tasklet_schedule(&qs->txq[TXQ_OFLD].qresume_tsk);
  1721. }
  1722. if (test_bit(TXQ_CTRL, &qs->txq_stopped) &&
  1723. should_restart_tx(&qs->txq[TXQ_CTRL]) &&
  1724. test_and_clear_bit(TXQ_CTRL, &qs->txq_stopped)) {
  1725. qs->txq[TXQ_CTRL].restarts++;
  1726. tasklet_schedule(&qs->txq[TXQ_CTRL].qresume_tsk);
  1727. }
  1728. }
  1729. /**
  1730. * cxgb3_arp_process - process an ARP request probing a private IP address
  1731. * @adapter: the adapter
  1732. * @skb: the skbuff containing the ARP request
  1733. *
  1734. * Check if the ARP request is probing the private IP address
  1735. * dedicated to iSCSI, generate an ARP reply if so.
  1736. */
  1737. static void cxgb3_arp_process(struct port_info *pi, struct sk_buff *skb)
  1738. {
  1739. struct net_device *dev = skb->dev;
  1740. struct arphdr *arp;
  1741. unsigned char *arp_ptr;
  1742. unsigned char *sha;
  1743. __be32 sip, tip;
  1744. if (!dev)
  1745. return;
  1746. skb_reset_network_header(skb);
  1747. arp = arp_hdr(skb);
  1748. if (arp->ar_op != htons(ARPOP_REQUEST))
  1749. return;
  1750. arp_ptr = (unsigned char *)(arp + 1);
  1751. sha = arp_ptr;
  1752. arp_ptr += dev->addr_len;
  1753. memcpy(&sip, arp_ptr, sizeof(sip));
  1754. arp_ptr += sizeof(sip);
  1755. arp_ptr += dev->addr_len;
  1756. memcpy(&tip, arp_ptr, sizeof(tip));
  1757. if (tip != pi->iscsi_ipv4addr)
  1758. return;
  1759. arp_send(ARPOP_REPLY, ETH_P_ARP, sip, dev, tip, sha,
  1760. pi->iscsic.mac_addr, sha);
  1761. }
  1762. static inline int is_arp(struct sk_buff *skb)
  1763. {
  1764. return skb->protocol == htons(ETH_P_ARP);
  1765. }
  1766. static void cxgb3_process_iscsi_prov_pack(struct port_info *pi,
  1767. struct sk_buff *skb)
  1768. {
  1769. if (is_arp(skb)) {
  1770. cxgb3_arp_process(pi, skb);
  1771. return;
  1772. }
  1773. if (pi->iscsic.recv)
  1774. pi->iscsic.recv(pi, skb);
  1775. }
  1776. /**
  1777. * rx_eth - process an ingress ethernet packet
  1778. * @adap: the adapter
  1779. * @rq: the response queue that received the packet
  1780. * @skb: the packet
  1781. * @pad: amount of padding at the start of the buffer
  1782. *
  1783. * Process an ingress ethernet pakcet and deliver it to the stack.
  1784. * The padding is 2 if the packet was delivered in an Rx buffer and 0
  1785. * if it was immediate data in a response.
  1786. */
  1787. static void rx_eth(struct adapter *adap, struct sge_rspq *rq,
  1788. struct sk_buff *skb, int pad, int lro)
  1789. {
  1790. struct cpl_rx_pkt *p = (struct cpl_rx_pkt *)(skb->data + pad);
  1791. struct sge_qset *qs = rspq_to_qset(rq);
  1792. struct port_info *pi;
  1793. skb_pull(skb, sizeof(*p) + pad);
  1794. skb->protocol = eth_type_trans(skb, adap->port[p->iff]);
  1795. pi = netdev_priv(skb->dev);
  1796. if ((skb->dev->features & NETIF_F_RXCSUM) && p->csum_valid &&
  1797. p->csum == htons(0xffff) && !p->fragment) {
  1798. qs->port_stats[SGE_PSTAT_RX_CSUM_GOOD]++;
  1799. skb->ip_summed = CHECKSUM_UNNECESSARY;
  1800. } else
  1801. skb_checksum_none_assert(skb);
  1802. skb_record_rx_queue(skb, qs - &adap->sge.qs[pi->first_qset]);
  1803. if (p->vlan_valid) {
  1804. qs->port_stats[SGE_PSTAT_VLANEX]++;
  1805. __vlan_hwaccel_put_tag(skb, ntohs(p->vlan));
  1806. }
  1807. if (rq->polling) {
  1808. if (lro)
  1809. napi_gro_receive(&qs->napi, skb);
  1810. else {
  1811. if (unlikely(pi->iscsic.flags))
  1812. cxgb3_process_iscsi_prov_pack(pi, skb);
  1813. netif_receive_skb(skb);
  1814. }
  1815. } else
  1816. netif_rx(skb);
  1817. }
  1818. static inline int is_eth_tcp(u32 rss)
  1819. {
  1820. return G_HASHTYPE(ntohl(rss)) == RSS_HASH_4_TUPLE;
  1821. }
  1822. /**
  1823. * lro_add_page - add a page chunk to an LRO session
  1824. * @adap: the adapter
  1825. * @qs: the associated queue set
  1826. * @fl: the free list containing the page chunk to add
  1827. * @len: packet length
  1828. * @complete: Indicates the last fragment of a frame
  1829. *
  1830. * Add a received packet contained in a page chunk to an existing LRO
  1831. * session.
  1832. */
  1833. static void lro_add_page(struct adapter *adap, struct sge_qset *qs,
  1834. struct sge_fl *fl, int len, int complete)
  1835. {
  1836. struct rx_sw_desc *sd = &fl->sdesc[fl->cidx];
  1837. struct port_info *pi = netdev_priv(qs->netdev);
  1838. struct sk_buff *skb = NULL;
  1839. struct cpl_rx_pkt *cpl;
  1840. struct skb_frag_struct *rx_frag;
  1841. int nr_frags;
  1842. int offset = 0;
  1843. if (!qs->nomem) {
  1844. skb = napi_get_frags(&qs->napi);
  1845. qs->nomem = !skb;
  1846. }
  1847. fl->credits--;
  1848. pci_dma_sync_single_for_cpu(adap->pdev,
  1849. dma_unmap_addr(sd, dma_addr),
  1850. fl->buf_size - SGE_PG_RSVD,
  1851. PCI_DMA_FROMDEVICE);
  1852. (*sd->pg_chunk.p_cnt)--;
  1853. if (!*sd->pg_chunk.p_cnt && sd->pg_chunk.page != fl->pg_chunk.page)
  1854. pci_unmap_page(adap->pdev,
  1855. sd->pg_chunk.mapping,
  1856. fl->alloc_size,
  1857. PCI_DMA_FROMDEVICE);
  1858. if (!skb) {
  1859. put_page(sd->pg_chunk.page);
  1860. if (complete)
  1861. qs->nomem = 0;
  1862. return;
  1863. }
  1864. rx_frag = skb_shinfo(skb)->frags;
  1865. nr_frags = skb_shinfo(skb)->nr_frags;
  1866. if (!nr_frags) {
  1867. offset = 2 + sizeof(struct cpl_rx_pkt);
  1868. cpl = qs->lro_va = sd->pg_chunk.va + 2;
  1869. if ((qs->netdev->features & NETIF_F_RXCSUM) &&
  1870. cpl->csum_valid && cpl->csum == htons(0xffff)) {
  1871. skb->ip_summed = CHECKSUM_UNNECESSARY;
  1872. qs->port_stats[SGE_PSTAT_RX_CSUM_GOOD]++;
  1873. } else
  1874. skb->ip_summed = CHECKSUM_NONE;
  1875. } else
  1876. cpl = qs->lro_va;
  1877. len -= offset;
  1878. rx_frag += nr_frags;
  1879. __skb_frag_set_page(rx_frag, sd->pg_chunk.page);
  1880. rx_frag->page_offset = sd->pg_chunk.offset + offset;
  1881. skb_frag_size_set(rx_frag, len);
  1882. skb->len += len;
  1883. skb->data_len += len;
  1884. skb->truesize += len;
  1885. skb_shinfo(skb)->nr_frags++;
  1886. if (!complete)
  1887. return;
  1888. skb_record_rx_queue(skb, qs - &adap->sge.qs[pi->first_qset]);
  1889. if (cpl->vlan_valid)
  1890. __vlan_hwaccel_put_tag(skb, ntohs(cpl->vlan));
  1891. napi_gro_frags(&qs->napi);
  1892. }
  1893. /**
  1894. * handle_rsp_cntrl_info - handles control information in a response
  1895. * @qs: the queue set corresponding to the response
  1896. * @flags: the response control flags
  1897. *
  1898. * Handles the control information of an SGE response, such as GTS
  1899. * indications and completion credits for the queue set's Tx queues.
  1900. * HW coalesces credits, we don't do any extra SW coalescing.
  1901. */
  1902. static inline void handle_rsp_cntrl_info(struct sge_qset *qs, u32 flags)
  1903. {
  1904. unsigned int credits;
  1905. #if USE_GTS
  1906. if (flags & F_RSPD_TXQ0_GTS)
  1907. clear_bit(TXQ_RUNNING, &qs->txq[TXQ_ETH].flags);
  1908. #endif
  1909. credits = G_RSPD_TXQ0_CR(flags);
  1910. if (credits)
  1911. qs->txq[TXQ_ETH].processed += credits;
  1912. credits = G_RSPD_TXQ2_CR(flags);
  1913. if (credits)
  1914. qs->txq[TXQ_CTRL].processed += credits;
  1915. # if USE_GTS
  1916. if (flags & F_RSPD_TXQ1_GTS)
  1917. clear_bit(TXQ_RUNNING, &qs->txq[TXQ_OFLD].flags);
  1918. # endif
  1919. credits = G_RSPD_TXQ1_CR(flags);
  1920. if (credits)
  1921. qs->txq[TXQ_OFLD].processed += credits;
  1922. }
  1923. /**
  1924. * check_ring_db - check if we need to ring any doorbells
  1925. * @adapter: the adapter
  1926. * @qs: the queue set whose Tx queues are to be examined
  1927. * @sleeping: indicates which Tx queue sent GTS
  1928. *
  1929. * Checks if some of a queue set's Tx queues need to ring their doorbells
  1930. * to resume transmission after idling while they still have unprocessed
  1931. * descriptors.
  1932. */
  1933. static void check_ring_db(struct adapter *adap, struct sge_qset *qs,
  1934. unsigned int sleeping)
  1935. {
  1936. if (sleeping & F_RSPD_TXQ0_GTS) {
  1937. struct sge_txq *txq = &qs->txq[TXQ_ETH];
  1938. if (txq->cleaned + txq->in_use != txq->processed &&
  1939. !test_and_set_bit(TXQ_LAST_PKT_DB, &txq->flags)) {
  1940. set_bit(TXQ_RUNNING, &txq->flags);
  1941. t3_write_reg(adap, A_SG_KDOORBELL, F_SELEGRCNTX |
  1942. V_EGRCNTX(txq->cntxt_id));
  1943. }
  1944. }
  1945. if (sleeping & F_RSPD_TXQ1_GTS) {
  1946. struct sge_txq *txq = &qs->txq[TXQ_OFLD];
  1947. if (txq->cleaned + txq->in_use != txq->processed &&
  1948. !test_and_set_bit(TXQ_LAST_PKT_DB, &txq->flags)) {
  1949. set_bit(TXQ_RUNNING, &txq->flags);
  1950. t3_write_reg(adap, A_SG_KDOORBELL, F_SELEGRCNTX |
  1951. V_EGRCNTX(txq->cntxt_id));
  1952. }
  1953. }
  1954. }
  1955. /**
  1956. * is_new_response - check if a response is newly written
  1957. * @r: the response descriptor
  1958. * @q: the response queue
  1959. *
  1960. * Returns true if a response descriptor contains a yet unprocessed
  1961. * response.
  1962. */
  1963. static inline int is_new_response(const struct rsp_desc *r,
  1964. const struct sge_rspq *q)
  1965. {
  1966. return (r->intr_gen & F_RSPD_GEN2) == q->gen;
  1967. }
  1968. static inline void clear_rspq_bufstate(struct sge_rspq * const q)
  1969. {
  1970. q->pg_skb = NULL;
  1971. q->rx_recycle_buf = 0;
  1972. }
  1973. #define RSPD_GTS_MASK (F_RSPD_TXQ0_GTS | F_RSPD_TXQ1_GTS)
  1974. #define RSPD_CTRL_MASK (RSPD_GTS_MASK | \
  1975. V_RSPD_TXQ0_CR(M_RSPD_TXQ0_CR) | \
  1976. V_RSPD_TXQ1_CR(M_RSPD_TXQ1_CR) | \
  1977. V_RSPD_TXQ2_CR(M_RSPD_TXQ2_CR))
  1978. /* How long to delay the next interrupt in case of memory shortage, in 0.1us. */
  1979. #define NOMEM_INTR_DELAY 2500
  1980. /**
  1981. * process_responses - process responses from an SGE response queue
  1982. * @adap: the adapter
  1983. * @qs: the queue set to which the response queue belongs
  1984. * @budget: how many responses can be processed in this round
  1985. *
  1986. * Process responses from an SGE response queue up to the supplied budget.
  1987. * Responses include received packets as well as credits and other events
  1988. * for the queues that belong to the response queue's queue set.
  1989. * A negative budget is effectively unlimited.
  1990. *
  1991. * Additionally choose the interrupt holdoff time for the next interrupt
  1992. * on this queue. If the system is under memory shortage use a fairly
  1993. * long delay to help recovery.
  1994. */
  1995. static int process_responses(struct adapter *adap, struct sge_qset *qs,
  1996. int budget)
  1997. {
  1998. struct sge_rspq *q = &qs->rspq;
  1999. struct rsp_desc *r = &q->desc[q->cidx];
  2000. int budget_left = budget;
  2001. unsigned int sleeping = 0;
  2002. struct sk_buff *offload_skbs[RX_BUNDLE_SIZE];
  2003. int ngathered = 0;
  2004. q->next_holdoff = q->holdoff_tmr;
  2005. while (likely(budget_left && is_new_response(r, q))) {
  2006. int packet_complete, eth, ethpad = 2;
  2007. int lro = !!(qs->netdev->features & NETIF_F_GRO);
  2008. struct sk_buff *skb = NULL;
  2009. u32 len, flags;
  2010. __be32 rss_hi, rss_lo;
  2011. rmb();
  2012. eth = r->rss_hdr.opcode == CPL_RX_PKT;
  2013. rss_hi = *(const __be32 *)r;
  2014. rss_lo = r->rss_hdr.rss_hash_val;
  2015. flags = ntohl(r->flags);
  2016. if (unlikely(flags & F_RSPD_ASYNC_NOTIF)) {
  2017. skb = alloc_skb(AN_PKT_SIZE, GFP_ATOMIC);
  2018. if (!skb)
  2019. goto no_mem;
  2020. memcpy(__skb_put(skb, AN_PKT_SIZE), r, AN_PKT_SIZE);
  2021. skb->data[0] = CPL_ASYNC_NOTIF;
  2022. rss_hi = htonl(CPL_ASYNC_NOTIF << 24);
  2023. q->async_notif++;
  2024. } else if (flags & F_RSPD_IMM_DATA_VALID) {
  2025. skb = get_imm_packet(r);
  2026. if (unlikely(!skb)) {
  2027. no_mem:
  2028. q->next_holdoff = NOMEM_INTR_DELAY;
  2029. q->nomem++;
  2030. /* consume one credit since we tried */
  2031. budget_left--;
  2032. break;
  2033. }
  2034. q->imm_data++;
  2035. ethpad = 0;
  2036. } else if ((len = ntohl(r->len_cq)) != 0) {
  2037. struct sge_fl *fl;
  2038. lro &= eth && is_eth_tcp(rss_hi);
  2039. fl = (len & F_RSPD_FLQ) ? &qs->fl[1] : &qs->fl[0];
  2040. if (fl->use_pages) {
  2041. void *addr = fl->sdesc[fl->cidx].pg_chunk.va;
  2042. prefetch(addr);
  2043. #if L1_CACHE_BYTES < 128
  2044. prefetch(addr + L1_CACHE_BYTES);
  2045. #endif
  2046. __refill_fl(adap, fl);
  2047. if (lro > 0) {
  2048. lro_add_page(adap, qs, fl,
  2049. G_RSPD_LEN(len),
  2050. flags & F_RSPD_EOP);
  2051. goto next_fl;
  2052. }
  2053. skb = get_packet_pg(adap, fl, q,
  2054. G_RSPD_LEN(len),
  2055. eth ?
  2056. SGE_RX_DROP_THRES : 0);
  2057. q->pg_skb = skb;
  2058. } else
  2059. skb = get_packet(adap, fl, G_RSPD_LEN(len),
  2060. eth ? SGE_RX_DROP_THRES : 0);
  2061. if (unlikely(!skb)) {
  2062. if (!eth)
  2063. goto no_mem;
  2064. q->rx_drops++;
  2065. } else if (unlikely(r->rss_hdr.opcode == CPL_TRACE_PKT))
  2066. __skb_pull(skb, 2);
  2067. next_fl:
  2068. if (++fl->cidx == fl->size)
  2069. fl->cidx = 0;
  2070. } else
  2071. q->pure_rsps++;
  2072. if (flags & RSPD_CTRL_MASK) {
  2073. sleeping |= flags & RSPD_GTS_MASK;
  2074. handle_rsp_cntrl_info(qs, flags);
  2075. }
  2076. r++;
  2077. if (unlikely(++q->cidx == q->size)) {
  2078. q->cidx = 0;
  2079. q->gen ^= 1;
  2080. r = q->desc;
  2081. }
  2082. prefetch(r);
  2083. if (++q->credits >= (q->size / 4)) {
  2084. refill_rspq(adap, q, q->credits);
  2085. q->credits = 0;
  2086. }
  2087. packet_complete = flags &
  2088. (F_RSPD_EOP | F_RSPD_IMM_DATA_VALID |
  2089. F_RSPD_ASYNC_NOTIF);
  2090. if (skb != NULL && packet_complete) {
  2091. if (eth)
  2092. rx_eth(adap, q, skb, ethpad, lro);
  2093. else {
  2094. q->offload_pkts++;
  2095. /* Preserve the RSS info in csum & priority */
  2096. skb->csum = rss_hi;
  2097. skb->priority = rss_lo;
  2098. ngathered = rx_offload(&adap->tdev, q, skb,
  2099. offload_skbs,
  2100. ngathered);
  2101. }
  2102. if (flags & F_RSPD_EOP)
  2103. clear_rspq_bufstate(q);
  2104. }
  2105. --budget_left;
  2106. }
  2107. deliver_partial_bundle(&adap->tdev, q, offload_skbs, ngathered);
  2108. if (sleeping)
  2109. check_ring_db(adap, qs, sleeping);
  2110. smp_mb(); /* commit Tx queue .processed updates */
  2111. if (unlikely(qs->txq_stopped != 0))
  2112. restart_tx(qs);
  2113. budget -= budget_left;
  2114. return budget;
  2115. }
  2116. static inline int is_pure_response(const struct rsp_desc *r)
  2117. {
  2118. __be32 n = r->flags & htonl(F_RSPD_ASYNC_NOTIF | F_RSPD_IMM_DATA_VALID);
  2119. return (n | r->len_cq) == 0;
  2120. }
  2121. /**
  2122. * napi_rx_handler - the NAPI handler for Rx processing
  2123. * @napi: the napi instance
  2124. * @budget: how many packets we can process in this round
  2125. *
  2126. * Handler for new data events when using NAPI.
  2127. */
  2128. static int napi_rx_handler(struct napi_struct *napi, int budget)
  2129. {
  2130. struct sge_qset *qs = container_of(napi, struct sge_qset, napi);
  2131. struct adapter *adap = qs->adap;
  2132. int work_done = process_responses(adap, qs, budget);
  2133. if (likely(work_done < budget)) {
  2134. napi_complete(napi);
  2135. /*
  2136. * Because we don't atomically flush the following
  2137. * write it is possible that in very rare cases it can
  2138. * reach the device in a way that races with a new
  2139. * response being written plus an error interrupt
  2140. * causing the NAPI interrupt handler below to return
  2141. * unhandled status to the OS. To protect against
  2142. * this would require flushing the write and doing
  2143. * both the write and the flush with interrupts off.
  2144. * Way too expensive and unjustifiable given the
  2145. * rarity of the race.
  2146. *
  2147. * The race cannot happen at all with MSI-X.
  2148. */
  2149. t3_write_reg(adap, A_SG_GTS, V_RSPQ(qs->rspq.cntxt_id) |
  2150. V_NEWTIMER(qs->rspq.next_holdoff) |
  2151. V_NEWINDEX(qs->rspq.cidx));
  2152. }
  2153. return work_done;
  2154. }
  2155. /*
  2156. * Returns true if the device is already scheduled for polling.
  2157. */
  2158. static inline int napi_is_scheduled(struct napi_struct *napi)
  2159. {
  2160. return test_bit(NAPI_STATE_SCHED, &napi->state);
  2161. }
  2162. /**
  2163. * process_pure_responses - process pure responses from a response queue
  2164. * @adap: the adapter
  2165. * @qs: the queue set owning the response queue
  2166. * @r: the first pure response to process
  2167. *
  2168. * A simpler version of process_responses() that handles only pure (i.e.,
  2169. * non data-carrying) responses. Such respones are too light-weight to
  2170. * justify calling a softirq under NAPI, so we handle them specially in
  2171. * the interrupt handler. The function is called with a pointer to a
  2172. * response, which the caller must ensure is a valid pure response.
  2173. *
  2174. * Returns 1 if it encounters a valid data-carrying response, 0 otherwise.
  2175. */
  2176. static int process_pure_responses(struct adapter *adap, struct sge_qset *qs,
  2177. struct rsp_desc *r)
  2178. {
  2179. struct sge_rspq *q = &qs->rspq;
  2180. unsigned int sleeping = 0;
  2181. do {
  2182. u32 flags = ntohl(r->flags);
  2183. r++;
  2184. if (unlikely(++q->cidx == q->size)) {
  2185. q->cidx = 0;
  2186. q->gen ^= 1;
  2187. r = q->desc;
  2188. }
  2189. prefetch(r);
  2190. if (flags & RSPD_CTRL_MASK) {
  2191. sleeping |= flags & RSPD_GTS_MASK;
  2192. handle_rsp_cntrl_info(qs, flags);
  2193. }
  2194. q->pure_rsps++;
  2195. if (++q->credits >= (q->size / 4)) {
  2196. refill_rspq(adap, q, q->credits);
  2197. q->credits = 0;
  2198. }
  2199. if (!is_new_response(r, q))
  2200. break;
  2201. rmb();
  2202. } while (is_pure_response(r));
  2203. if (sleeping)
  2204. check_ring_db(adap, qs, sleeping);
  2205. smp_mb(); /* commit Tx queue .processed updates */
  2206. if (unlikely(qs->txq_stopped != 0))
  2207. restart_tx(qs);
  2208. return is_new_response(r, q);
  2209. }
  2210. /**
  2211. * handle_responses - decide what to do with new responses in NAPI mode
  2212. * @adap: the adapter
  2213. * @q: the response queue
  2214. *
  2215. * This is used by the NAPI interrupt handlers to decide what to do with
  2216. * new SGE responses. If there are no new responses it returns -1. If
  2217. * there are new responses and they are pure (i.e., non-data carrying)
  2218. * it handles them straight in hard interrupt context as they are very
  2219. * cheap and don't deliver any packets. Finally, if there are any data
  2220. * signaling responses it schedules the NAPI handler. Returns 1 if it
  2221. * schedules NAPI, 0 if all new responses were pure.
  2222. *
  2223. * The caller must ascertain NAPI is not already running.
  2224. */
  2225. static inline int handle_responses(struct adapter *adap, struct sge_rspq *q)
  2226. {
  2227. struct sge_qset *qs = rspq_to_qset(q);
  2228. struct rsp_desc *r = &q->desc[q->cidx];
  2229. if (!is_new_response(r, q))
  2230. return -1;
  2231. rmb();
  2232. if (is_pure_response(r) && process_pure_responses(adap, qs, r) == 0) {
  2233. t3_write_reg(adap, A_SG_GTS, V_RSPQ(q->cntxt_id) |
  2234. V_NEWTIMER(q->holdoff_tmr) | V_NEWINDEX(q->cidx));
  2235. return 0;
  2236. }
  2237. napi_schedule(&qs->napi);
  2238. return 1;
  2239. }
  2240. /*
  2241. * The MSI-X interrupt handler for an SGE response queue for the non-NAPI case
  2242. * (i.e., response queue serviced in hard interrupt).
  2243. */
  2244. static irqreturn_t t3_sge_intr_msix(int irq, void *cookie)
  2245. {
  2246. struct sge_qset *qs = cookie;
  2247. struct adapter *adap = qs->adap;
  2248. struct sge_rspq *q = &qs->rspq;
  2249. spin_lock(&q->lock);
  2250. if (process_responses(adap, qs, -1) == 0)
  2251. q->unhandled_irqs++;
  2252. t3_write_reg(adap, A_SG_GTS, V_RSPQ(q->cntxt_id) |
  2253. V_NEWTIMER(q->next_holdoff) | V_NEWINDEX(q->cidx));
  2254. spin_unlock(&q->lock);
  2255. return IRQ_HANDLED;
  2256. }
  2257. /*
  2258. * The MSI-X interrupt handler for an SGE response queue for the NAPI case
  2259. * (i.e., response queue serviced by NAPI polling).
  2260. */
  2261. static irqreturn_t t3_sge_intr_msix_napi(int irq, void *cookie)
  2262. {
  2263. struct sge_qset *qs = cookie;
  2264. struct sge_rspq *q = &qs->rspq;
  2265. spin_lock(&q->lock);
  2266. if (handle_responses(qs->adap, q) < 0)
  2267. q->unhandled_irqs++;
  2268. spin_unlock(&q->lock);
  2269. return IRQ_HANDLED;
  2270. }
  2271. /*
  2272. * The non-NAPI MSI interrupt handler. This needs to handle data events from
  2273. * SGE response queues as well as error and other async events as they all use
  2274. * the same MSI vector. We use one SGE response queue per port in this mode
  2275. * and protect all response queues with queue 0's lock.
  2276. */
  2277. static irqreturn_t t3_intr_msi(int irq, void *cookie)
  2278. {
  2279. int new_packets = 0;
  2280. struct adapter *adap = cookie;
  2281. struct sge_rspq *q = &adap->sge.qs[0].rspq;
  2282. spin_lock(&q->lock);
  2283. if (process_responses(adap, &adap->sge.qs[0], -1)) {
  2284. t3_write_reg(adap, A_SG_GTS, V_RSPQ(q->cntxt_id) |
  2285. V_NEWTIMER(q->next_holdoff) | V_NEWINDEX(q->cidx));
  2286. new_packets = 1;
  2287. }
  2288. if (adap->params.nports == 2 &&
  2289. process_responses(adap, &adap->sge.qs[1], -1)) {
  2290. struct sge_rspq *q1 = &adap->sge.qs[1].rspq;
  2291. t3_write_reg(adap, A_SG_GTS, V_RSPQ(q1->cntxt_id) |
  2292. V_NEWTIMER(q1->next_holdoff) |
  2293. V_NEWINDEX(q1->cidx));
  2294. new_packets = 1;
  2295. }
  2296. if (!new_packets && t3_slow_intr_handler(adap) == 0)
  2297. q->unhandled_irqs++;
  2298. spin_unlock(&q->lock);
  2299. return IRQ_HANDLED;
  2300. }
  2301. static int rspq_check_napi(struct sge_qset *qs)
  2302. {
  2303. struct sge_rspq *q = &qs->rspq;
  2304. if (!napi_is_scheduled(&qs->napi) &&
  2305. is_new_response(&q->desc[q->cidx], q)) {
  2306. napi_schedule(&qs->napi);
  2307. return 1;
  2308. }
  2309. return 0;
  2310. }
  2311. /*
  2312. * The MSI interrupt handler for the NAPI case (i.e., response queues serviced
  2313. * by NAPI polling). Handles data events from SGE response queues as well as
  2314. * error and other async events as they all use the same MSI vector. We use
  2315. * one SGE response queue per port in this mode and protect all response
  2316. * queues with queue 0's lock.
  2317. */
  2318. static irqreturn_t t3_intr_msi_napi(int irq, void *cookie)
  2319. {
  2320. int new_packets;
  2321. struct adapter *adap = cookie;
  2322. struct sge_rspq *q = &adap->sge.qs[0].rspq;
  2323. spin_lock(&q->lock);
  2324. new_packets = rspq_check_napi(&adap->sge.qs[0]);
  2325. if (adap->params.nports == 2)
  2326. new_packets += rspq_check_napi(&adap->sge.qs[1]);
  2327. if (!new_packets && t3_slow_intr_handler(adap) == 0)
  2328. q->unhandled_irqs++;
  2329. spin_unlock(&q->lock);
  2330. return IRQ_HANDLED;
  2331. }
  2332. /*
  2333. * A helper function that processes responses and issues GTS.
  2334. */
  2335. static inline int process_responses_gts(struct adapter *adap,
  2336. struct sge_rspq *rq)
  2337. {
  2338. int work;
  2339. work = process_responses(adap, rspq_to_qset(rq), -1);
  2340. t3_write_reg(adap, A_SG_GTS, V_RSPQ(rq->cntxt_id) |
  2341. V_NEWTIMER(rq->next_holdoff) | V_NEWINDEX(rq->cidx));
  2342. return work;
  2343. }
  2344. /*
  2345. * The legacy INTx interrupt handler. This needs to handle data events from
  2346. * SGE response queues as well as error and other async events as they all use
  2347. * the same interrupt pin. We use one SGE response queue per port in this mode
  2348. * and protect all response queues with queue 0's lock.
  2349. */
  2350. static irqreturn_t t3_intr(int irq, void *cookie)
  2351. {
  2352. int work_done, w0, w1;
  2353. struct adapter *adap = cookie;
  2354. struct sge_rspq *q0 = &adap->sge.qs[0].rspq;
  2355. struct sge_rspq *q1 = &adap->sge.qs[1].rspq;
  2356. spin_lock(&q0->lock);
  2357. w0 = is_new_response(&q0->desc[q0->cidx], q0);
  2358. w1 = adap->params.nports == 2 &&
  2359. is_new_response(&q1->desc[q1->cidx], q1);
  2360. if (likely(w0 | w1)) {
  2361. t3_write_reg(adap, A_PL_CLI, 0);
  2362. t3_read_reg(adap, A_PL_CLI); /* flush */
  2363. if (likely(w0))
  2364. process_responses_gts(adap, q0);
  2365. if (w1)
  2366. process_responses_gts(adap, q1);
  2367. work_done = w0 | w1;
  2368. } else
  2369. work_done = t3_slow_intr_handler(adap);
  2370. spin_unlock(&q0->lock);
  2371. return IRQ_RETVAL(work_done != 0);
  2372. }
  2373. /*
  2374. * Interrupt handler for legacy INTx interrupts for T3B-based cards.
  2375. * Handles data events from SGE response queues as well as error and other
  2376. * async events as they all use the same interrupt pin. We use one SGE
  2377. * response queue per port in this mode and protect all response queues with
  2378. * queue 0's lock.
  2379. */
  2380. static irqreturn_t t3b_intr(int irq, void *cookie)
  2381. {
  2382. u32 map;
  2383. struct adapter *adap = cookie;
  2384. struct sge_rspq *q0 = &adap->sge.qs[0].rspq;
  2385. t3_write_reg(adap, A_PL_CLI, 0);
  2386. map = t3_read_reg(adap, A_SG_DATA_INTR);
  2387. if (unlikely(!map)) /* shared interrupt, most likely */
  2388. return IRQ_NONE;
  2389. spin_lock(&q0->lock);
  2390. if (unlikely(map & F_ERRINTR))
  2391. t3_slow_intr_handler(adap);
  2392. if (likely(map & 1))
  2393. process_responses_gts(adap, q0);
  2394. if (map & 2)
  2395. process_responses_gts(adap, &adap->sge.qs[1].rspq);
  2396. spin_unlock(&q0->lock);
  2397. return IRQ_HANDLED;
  2398. }
  2399. /*
  2400. * NAPI interrupt handler for legacy INTx interrupts for T3B-based cards.
  2401. * Handles data events from SGE response queues as well as error and other
  2402. * async events as they all use the same interrupt pin. We use one SGE
  2403. * response queue per port in this mode and protect all response queues with
  2404. * queue 0's lock.
  2405. */
  2406. static irqreturn_t t3b_intr_napi(int irq, void *cookie)
  2407. {
  2408. u32 map;
  2409. struct adapter *adap = cookie;
  2410. struct sge_qset *qs0 = &adap->sge.qs[0];
  2411. struct sge_rspq *q0 = &qs0->rspq;
  2412. t3_write_reg(adap, A_PL_CLI, 0);
  2413. map = t3_read_reg(adap, A_SG_DATA_INTR);
  2414. if (unlikely(!map)) /* shared interrupt, most likely */
  2415. return IRQ_NONE;
  2416. spin_lock(&q0->lock);
  2417. if (unlikely(map & F_ERRINTR))
  2418. t3_slow_intr_handler(adap);
  2419. if (likely(map & 1))
  2420. napi_schedule(&qs0->napi);
  2421. if (map & 2)
  2422. napi_schedule(&adap->sge.qs[1].napi);
  2423. spin_unlock(&q0->lock);
  2424. return IRQ_HANDLED;
  2425. }
  2426. /**
  2427. * t3_intr_handler - select the top-level interrupt handler
  2428. * @adap: the adapter
  2429. * @polling: whether using NAPI to service response queues
  2430. *
  2431. * Selects the top-level interrupt handler based on the type of interrupts
  2432. * (MSI-X, MSI, or legacy) and whether NAPI will be used to service the
  2433. * response queues.
  2434. */
  2435. irq_handler_t t3_intr_handler(struct adapter *adap, int polling)
  2436. {
  2437. if (adap->flags & USING_MSIX)
  2438. return polling ? t3_sge_intr_msix_napi : t3_sge_intr_msix;
  2439. if (adap->flags & USING_MSI)
  2440. return polling ? t3_intr_msi_napi : t3_intr_msi;
  2441. if (adap->params.rev > 0)
  2442. return polling ? t3b_intr_napi : t3b_intr;
  2443. return t3_intr;
  2444. }
  2445. #define SGE_PARERR (F_CPPARITYERROR | F_OCPARITYERROR | F_RCPARITYERROR | \
  2446. F_IRPARITYERROR | V_ITPARITYERROR(M_ITPARITYERROR) | \
  2447. V_FLPARITYERROR(M_FLPARITYERROR) | F_LODRBPARITYERROR | \
  2448. F_HIDRBPARITYERROR | F_LORCQPARITYERROR | \
  2449. F_HIRCQPARITYERROR)
  2450. #define SGE_FRAMINGERR (F_UC_REQ_FRAMINGERROR | F_R_REQ_FRAMINGERROR)
  2451. #define SGE_FATALERR (SGE_PARERR | SGE_FRAMINGERR | F_RSPQCREDITOVERFOW | \
  2452. F_RSPQDISABLED)
  2453. /**
  2454. * t3_sge_err_intr_handler - SGE async event interrupt handler
  2455. * @adapter: the adapter
  2456. *
  2457. * Interrupt handler for SGE asynchronous (non-data) events.
  2458. */
  2459. void t3_sge_err_intr_handler(struct adapter *adapter)
  2460. {
  2461. unsigned int v, status = t3_read_reg(adapter, A_SG_INT_CAUSE) &
  2462. ~F_FLEMPTY;
  2463. if (status & SGE_PARERR)
  2464. CH_ALERT(adapter, "SGE parity error (0x%x)\n",
  2465. status & SGE_PARERR);
  2466. if (status & SGE_FRAMINGERR)
  2467. CH_ALERT(adapter, "SGE framing error (0x%x)\n",
  2468. status & SGE_FRAMINGERR);
  2469. if (status & F_RSPQCREDITOVERFOW)
  2470. CH_ALERT(adapter, "SGE response queue credit overflow\n");
  2471. if (status & F_RSPQDISABLED) {
  2472. v = t3_read_reg(adapter, A_SG_RSPQ_FL_STATUS);
  2473. CH_ALERT(adapter,
  2474. "packet delivered to disabled response queue "
  2475. "(0x%x)\n", (v >> S_RSPQ0DISABLED) & 0xff);
  2476. }
  2477. if (status & (F_HIPIODRBDROPERR | F_LOPIODRBDROPERR))
  2478. queue_work(cxgb3_wq, &adapter->db_drop_task);
  2479. if (status & (F_HIPRIORITYDBFULL | F_LOPRIORITYDBFULL))
  2480. queue_work(cxgb3_wq, &adapter->db_full_task);
  2481. if (status & (F_HIPRIORITYDBEMPTY | F_LOPRIORITYDBEMPTY))
  2482. queue_work(cxgb3_wq, &adapter->db_empty_task);
  2483. t3_write_reg(adapter, A_SG_INT_CAUSE, status);
  2484. if (status & SGE_FATALERR)
  2485. t3_fatal_err(adapter);
  2486. }
  2487. /**
  2488. * sge_timer_tx - perform periodic maintenance of an SGE qset
  2489. * @data: the SGE queue set to maintain
  2490. *
  2491. * Runs periodically from a timer to perform maintenance of an SGE queue
  2492. * set. It performs two tasks:
  2493. *
  2494. * Cleans up any completed Tx descriptors that may still be pending.
  2495. * Normal descriptor cleanup happens when new packets are added to a Tx
  2496. * queue so this timer is relatively infrequent and does any cleanup only
  2497. * if the Tx queue has not seen any new packets in a while. We make a
  2498. * best effort attempt to reclaim descriptors, in that we don't wait
  2499. * around if we cannot get a queue's lock (which most likely is because
  2500. * someone else is queueing new packets and so will also handle the clean
  2501. * up). Since control queues use immediate data exclusively we don't
  2502. * bother cleaning them up here.
  2503. *
  2504. */
  2505. static void sge_timer_tx(unsigned long data)
  2506. {
  2507. struct sge_qset *qs = (struct sge_qset *)data;
  2508. struct port_info *pi = netdev_priv(qs->netdev);
  2509. struct adapter *adap = pi->adapter;
  2510. unsigned int tbd[SGE_TXQ_PER_SET] = {0, 0};
  2511. unsigned long next_period;
  2512. if (__netif_tx_trylock(qs->tx_q)) {
  2513. tbd[TXQ_ETH] = reclaim_completed_tx(adap, &qs->txq[TXQ_ETH],
  2514. TX_RECLAIM_TIMER_CHUNK);
  2515. __netif_tx_unlock(qs->tx_q);
  2516. }
  2517. if (spin_trylock(&qs->txq[TXQ_OFLD].lock)) {
  2518. tbd[TXQ_OFLD] = reclaim_completed_tx(adap, &qs->txq[TXQ_OFLD],
  2519. TX_RECLAIM_TIMER_CHUNK);
  2520. spin_unlock(&qs->txq[TXQ_OFLD].lock);
  2521. }
  2522. next_period = TX_RECLAIM_PERIOD >>
  2523. (max(tbd[TXQ_ETH], tbd[TXQ_OFLD]) /
  2524. TX_RECLAIM_TIMER_CHUNK);
  2525. mod_timer(&qs->tx_reclaim_timer, jiffies + next_period);
  2526. }
  2527. /*
  2528. * sge_timer_rx - perform periodic maintenance of an SGE qset
  2529. * @data: the SGE queue set to maintain
  2530. *
  2531. * a) Replenishes Rx queues that have run out due to memory shortage.
  2532. * Normally new Rx buffers are added when existing ones are consumed but
  2533. * when out of memory a queue can become empty. We try to add only a few
  2534. * buffers here, the queue will be replenished fully as these new buffers
  2535. * are used up if memory shortage has subsided.
  2536. *
  2537. * b) Return coalesced response queue credits in case a response queue is
  2538. * starved.
  2539. *
  2540. */
  2541. static void sge_timer_rx(unsigned long data)
  2542. {
  2543. spinlock_t *lock;
  2544. struct sge_qset *qs = (struct sge_qset *)data;
  2545. struct port_info *pi = netdev_priv(qs->netdev);
  2546. struct adapter *adap = pi->adapter;
  2547. u32 status;
  2548. lock = adap->params.rev > 0 ?
  2549. &qs->rspq.lock : &adap->sge.qs[0].rspq.lock;
  2550. if (!spin_trylock_irq(lock))
  2551. goto out;
  2552. if (napi_is_scheduled(&qs->napi))
  2553. goto unlock;
  2554. if (adap->params.rev < 4) {
  2555. status = t3_read_reg(adap, A_SG_RSPQ_FL_STATUS);
  2556. if (status & (1 << qs->rspq.cntxt_id)) {
  2557. qs->rspq.starved++;
  2558. if (qs->rspq.credits) {
  2559. qs->rspq.credits--;
  2560. refill_rspq(adap, &qs->rspq, 1);
  2561. qs->rspq.restarted++;
  2562. t3_write_reg(adap, A_SG_RSPQ_FL_STATUS,
  2563. 1 << qs->rspq.cntxt_id);
  2564. }
  2565. }
  2566. }
  2567. if (qs->fl[0].credits < qs->fl[0].size)
  2568. __refill_fl(adap, &qs->fl[0]);
  2569. if (qs->fl[1].credits < qs->fl[1].size)
  2570. __refill_fl(adap, &qs->fl[1]);
  2571. unlock:
  2572. spin_unlock_irq(lock);
  2573. out:
  2574. mod_timer(&qs->rx_reclaim_timer, jiffies + RX_RECLAIM_PERIOD);
  2575. }
  2576. /**
  2577. * t3_update_qset_coalesce - update coalescing settings for a queue set
  2578. * @qs: the SGE queue set
  2579. * @p: new queue set parameters
  2580. *
  2581. * Update the coalescing settings for an SGE queue set. Nothing is done
  2582. * if the queue set is not initialized yet.
  2583. */
  2584. void t3_update_qset_coalesce(struct sge_qset *qs, const struct qset_params *p)
  2585. {
  2586. qs->rspq.holdoff_tmr = max(p->coalesce_usecs * 10, 1U);/* can't be 0 */
  2587. qs->rspq.polling = p->polling;
  2588. qs->napi.poll = p->polling ? napi_rx_handler : ofld_poll;
  2589. }
  2590. /**
  2591. * t3_sge_alloc_qset - initialize an SGE queue set
  2592. * @adapter: the adapter
  2593. * @id: the queue set id
  2594. * @nports: how many Ethernet ports will be using this queue set
  2595. * @irq_vec_idx: the IRQ vector index for response queue interrupts
  2596. * @p: configuration parameters for this queue set
  2597. * @ntxq: number of Tx queues for the queue set
  2598. * @netdev: net device associated with this queue set
  2599. * @netdevq: net device TX queue associated with this queue set
  2600. *
  2601. * Allocate resources and initialize an SGE queue set. A queue set
  2602. * comprises a response queue, two Rx free-buffer queues, and up to 3
  2603. * Tx queues. The Tx queues are assigned roles in the order Ethernet
  2604. * queue, offload queue, and control queue.
  2605. */
  2606. int t3_sge_alloc_qset(struct adapter *adapter, unsigned int id, int nports,
  2607. int irq_vec_idx, const struct qset_params *p,
  2608. int ntxq, struct net_device *dev,
  2609. struct netdev_queue *netdevq)
  2610. {
  2611. int i, avail, ret = -ENOMEM;
  2612. struct sge_qset *q = &adapter->sge.qs[id];
  2613. init_qset_cntxt(q, id);
  2614. setup_timer(&q->tx_reclaim_timer, sge_timer_tx, (unsigned long)q);
  2615. setup_timer(&q->rx_reclaim_timer, sge_timer_rx, (unsigned long)q);
  2616. q->fl[0].desc = alloc_ring(adapter->pdev, p->fl_size,
  2617. sizeof(struct rx_desc),
  2618. sizeof(struct rx_sw_desc),
  2619. &q->fl[0].phys_addr, &q->fl[0].sdesc);
  2620. if (!q->fl[0].desc)
  2621. goto err;
  2622. q->fl[1].desc = alloc_ring(adapter->pdev, p->jumbo_size,
  2623. sizeof(struct rx_desc),
  2624. sizeof(struct rx_sw_desc),
  2625. &q->fl[1].phys_addr, &q->fl[1].sdesc);
  2626. if (!q->fl[1].desc)
  2627. goto err;
  2628. q->rspq.desc = alloc_ring(adapter->pdev, p->rspq_size,
  2629. sizeof(struct rsp_desc), 0,
  2630. &q->rspq.phys_addr, NULL);
  2631. if (!q->rspq.desc)
  2632. goto err;
  2633. for (i = 0; i < ntxq; ++i) {
  2634. /*
  2635. * The control queue always uses immediate data so does not
  2636. * need to keep track of any sk_buffs.
  2637. */
  2638. size_t sz = i == TXQ_CTRL ? 0 : sizeof(struct tx_sw_desc);
  2639. q->txq[i].desc = alloc_ring(adapter->pdev, p->txq_size[i],
  2640. sizeof(struct tx_desc), sz,
  2641. &q->txq[i].phys_addr,
  2642. &q->txq[i].sdesc);
  2643. if (!q->txq[i].desc)
  2644. goto err;
  2645. q->txq[i].gen = 1;
  2646. q->txq[i].size = p->txq_size[i];
  2647. spin_lock_init(&q->txq[i].lock);
  2648. skb_queue_head_init(&q->txq[i].sendq);
  2649. }
  2650. tasklet_init(&q->txq[TXQ_OFLD].qresume_tsk, restart_offloadq,
  2651. (unsigned long)q);
  2652. tasklet_init(&q->txq[TXQ_CTRL].qresume_tsk, restart_ctrlq,
  2653. (unsigned long)q);
  2654. q->fl[0].gen = q->fl[1].gen = 1;
  2655. q->fl[0].size = p->fl_size;
  2656. q->fl[1].size = p->jumbo_size;
  2657. q->rspq.gen = 1;
  2658. q->rspq.size = p->rspq_size;
  2659. spin_lock_init(&q->rspq.lock);
  2660. skb_queue_head_init(&q->rspq.rx_queue);
  2661. q->txq[TXQ_ETH].stop_thres = nports *
  2662. flits_to_desc(sgl_len(MAX_SKB_FRAGS + 1) + 3);
  2663. #if FL0_PG_CHUNK_SIZE > 0
  2664. q->fl[0].buf_size = FL0_PG_CHUNK_SIZE;
  2665. #else
  2666. q->fl[0].buf_size = SGE_RX_SM_BUF_SIZE + sizeof(struct cpl_rx_data);
  2667. #endif
  2668. #if FL1_PG_CHUNK_SIZE > 0
  2669. q->fl[1].buf_size = FL1_PG_CHUNK_SIZE;
  2670. #else
  2671. q->fl[1].buf_size = is_offload(adapter) ?
  2672. (16 * 1024) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)) :
  2673. MAX_FRAME_SIZE + 2 + sizeof(struct cpl_rx_pkt);
  2674. #endif
  2675. q->fl[0].use_pages = FL0_PG_CHUNK_SIZE > 0;
  2676. q->fl[1].use_pages = FL1_PG_CHUNK_SIZE > 0;
  2677. q->fl[0].order = FL0_PG_ORDER;
  2678. q->fl[1].order = FL1_PG_ORDER;
  2679. q->fl[0].alloc_size = FL0_PG_ALLOC_SIZE;
  2680. q->fl[1].alloc_size = FL1_PG_ALLOC_SIZE;
  2681. spin_lock_irq(&adapter->sge.reg_lock);
  2682. /* FL threshold comparison uses < */
  2683. ret = t3_sge_init_rspcntxt(adapter, q->rspq.cntxt_id, irq_vec_idx,
  2684. q->rspq.phys_addr, q->rspq.size,
  2685. q->fl[0].buf_size - SGE_PG_RSVD, 1, 0);
  2686. if (ret)
  2687. goto err_unlock;
  2688. for (i = 0; i < SGE_RXQ_PER_SET; ++i) {
  2689. ret = t3_sge_init_flcntxt(adapter, q->fl[i].cntxt_id, 0,
  2690. q->fl[i].phys_addr, q->fl[i].size,
  2691. q->fl[i].buf_size - SGE_PG_RSVD,
  2692. p->cong_thres, 1, 0);
  2693. if (ret)
  2694. goto err_unlock;
  2695. }
  2696. ret = t3_sge_init_ecntxt(adapter, q->txq[TXQ_ETH].cntxt_id, USE_GTS,
  2697. SGE_CNTXT_ETH, id, q->txq[TXQ_ETH].phys_addr,
  2698. q->txq[TXQ_ETH].size, q->txq[TXQ_ETH].token,
  2699. 1, 0);
  2700. if (ret)
  2701. goto err_unlock;
  2702. if (ntxq > 1) {
  2703. ret = t3_sge_init_ecntxt(adapter, q->txq[TXQ_OFLD].cntxt_id,
  2704. USE_GTS, SGE_CNTXT_OFLD, id,
  2705. q->txq[TXQ_OFLD].phys_addr,
  2706. q->txq[TXQ_OFLD].size, 0, 1, 0);
  2707. if (ret)
  2708. goto err_unlock;
  2709. }
  2710. if (ntxq > 2) {
  2711. ret = t3_sge_init_ecntxt(adapter, q->txq[TXQ_CTRL].cntxt_id, 0,
  2712. SGE_CNTXT_CTRL, id,
  2713. q->txq[TXQ_CTRL].phys_addr,
  2714. q->txq[TXQ_CTRL].size,
  2715. q->txq[TXQ_CTRL].token, 1, 0);
  2716. if (ret)
  2717. goto err_unlock;
  2718. }
  2719. spin_unlock_irq(&adapter->sge.reg_lock);
  2720. q->adap = adapter;
  2721. q->netdev = dev;
  2722. q->tx_q = netdevq;
  2723. t3_update_qset_coalesce(q, p);
  2724. avail = refill_fl(adapter, &q->fl[0], q->fl[0].size,
  2725. GFP_KERNEL | __GFP_COMP);
  2726. if (!avail) {
  2727. CH_ALERT(adapter, "free list queue 0 initialization failed\n");
  2728. goto err;
  2729. }
  2730. if (avail < q->fl[0].size)
  2731. CH_WARN(adapter, "free list queue 0 enabled with %d credits\n",
  2732. avail);
  2733. avail = refill_fl(adapter, &q->fl[1], q->fl[1].size,
  2734. GFP_KERNEL | __GFP_COMP);
  2735. if (avail < q->fl[1].size)
  2736. CH_WARN(adapter, "free list queue 1 enabled with %d credits\n",
  2737. avail);
  2738. refill_rspq(adapter, &q->rspq, q->rspq.size - 1);
  2739. t3_write_reg(adapter, A_SG_GTS, V_RSPQ(q->rspq.cntxt_id) |
  2740. V_NEWTIMER(q->rspq.holdoff_tmr));
  2741. return 0;
  2742. err_unlock:
  2743. spin_unlock_irq(&adapter->sge.reg_lock);
  2744. err:
  2745. t3_free_qset(adapter, q);
  2746. return ret;
  2747. }
  2748. /**
  2749. * t3_start_sge_timers - start SGE timer call backs
  2750. * @adap: the adapter
  2751. *
  2752. * Starts each SGE queue set's timer call back
  2753. */
  2754. void t3_start_sge_timers(struct adapter *adap)
  2755. {
  2756. int i;
  2757. for (i = 0; i < SGE_QSETS; ++i) {
  2758. struct sge_qset *q = &adap->sge.qs[i];
  2759. if (q->tx_reclaim_timer.function)
  2760. mod_timer(&q->tx_reclaim_timer, jiffies + TX_RECLAIM_PERIOD);
  2761. if (q->rx_reclaim_timer.function)
  2762. mod_timer(&q->rx_reclaim_timer, jiffies + RX_RECLAIM_PERIOD);
  2763. }
  2764. }
  2765. /**
  2766. * t3_stop_sge_timers - stop SGE timer call backs
  2767. * @adap: the adapter
  2768. *
  2769. * Stops each SGE queue set's timer call back
  2770. */
  2771. void t3_stop_sge_timers(struct adapter *adap)
  2772. {
  2773. int i;
  2774. for (i = 0; i < SGE_QSETS; ++i) {
  2775. struct sge_qset *q = &adap->sge.qs[i];
  2776. if (q->tx_reclaim_timer.function)
  2777. del_timer_sync(&q->tx_reclaim_timer);
  2778. if (q->rx_reclaim_timer.function)
  2779. del_timer_sync(&q->rx_reclaim_timer);
  2780. }
  2781. }
  2782. /**
  2783. * t3_free_sge_resources - free SGE resources
  2784. * @adap: the adapter
  2785. *
  2786. * Frees resources used by the SGE queue sets.
  2787. */
  2788. void t3_free_sge_resources(struct adapter *adap)
  2789. {
  2790. int i;
  2791. for (i = 0; i < SGE_QSETS; ++i)
  2792. t3_free_qset(adap, &adap->sge.qs[i]);
  2793. }
  2794. /**
  2795. * t3_sge_start - enable SGE
  2796. * @adap: the adapter
  2797. *
  2798. * Enables the SGE for DMAs. This is the last step in starting packet
  2799. * transfers.
  2800. */
  2801. void t3_sge_start(struct adapter *adap)
  2802. {
  2803. t3_set_reg_field(adap, A_SG_CONTROL, F_GLOBALENABLE, F_GLOBALENABLE);
  2804. }
  2805. /**
  2806. * t3_sge_stop - disable SGE operation
  2807. * @adap: the adapter
  2808. *
  2809. * Disables the DMA engine. This can be called in emeregencies (e.g.,
  2810. * from error interrupts) or from normal process context. In the latter
  2811. * case it also disables any pending queue restart tasklets. Note that
  2812. * if it is called in interrupt context it cannot disable the restart
  2813. * tasklets as it cannot wait, however the tasklets will have no effect
  2814. * since the doorbells are disabled and the driver will call this again
  2815. * later from process context, at which time the tasklets will be stopped
  2816. * if they are still running.
  2817. */
  2818. void t3_sge_stop(struct adapter *adap)
  2819. {
  2820. t3_set_reg_field(adap, A_SG_CONTROL, F_GLOBALENABLE, 0);
  2821. if (!in_interrupt()) {
  2822. int i;
  2823. for (i = 0; i < SGE_QSETS; ++i) {
  2824. struct sge_qset *qs = &adap->sge.qs[i];
  2825. tasklet_kill(&qs->txq[TXQ_OFLD].qresume_tsk);
  2826. tasklet_kill(&qs->txq[TXQ_CTRL].qresume_tsk);
  2827. }
  2828. }
  2829. }
  2830. /**
  2831. * t3_sge_init - initialize SGE
  2832. * @adap: the adapter
  2833. * @p: the SGE parameters
  2834. *
  2835. * Performs SGE initialization needed every time after a chip reset.
  2836. * We do not initialize any of the queue sets here, instead the driver
  2837. * top-level must request those individually. We also do not enable DMA
  2838. * here, that should be done after the queues have been set up.
  2839. */
  2840. void t3_sge_init(struct adapter *adap, struct sge_params *p)
  2841. {
  2842. unsigned int ctrl, ups = ffs(pci_resource_len(adap->pdev, 2) >> 12);
  2843. ctrl = F_DROPPKT | V_PKTSHIFT(2) | F_FLMODE | F_AVOIDCQOVFL |
  2844. F_CQCRDTCTRL | F_CONGMODE | F_TNLFLMODE | F_FATLPERREN |
  2845. V_HOSTPAGESIZE(PAGE_SHIFT - 11) | F_BIGENDIANINGRESS |
  2846. V_USERSPACESIZE(ups ? ups - 1 : 0) | F_ISCSICOALESCING;
  2847. #if SGE_NUM_GENBITS == 1
  2848. ctrl |= F_EGRGENCTRL;
  2849. #endif
  2850. if (adap->params.rev > 0) {
  2851. if (!(adap->flags & (USING_MSIX | USING_MSI)))
  2852. ctrl |= F_ONEINTMULTQ | F_OPTONEINTMULTQ;
  2853. }
  2854. t3_write_reg(adap, A_SG_CONTROL, ctrl);
  2855. t3_write_reg(adap, A_SG_EGR_RCQ_DRB_THRSH, V_HIRCQDRBTHRSH(512) |
  2856. V_LORCQDRBTHRSH(512));
  2857. t3_write_reg(adap, A_SG_TIMER_TICK, core_ticks_per_usec(adap) / 10);
  2858. t3_write_reg(adap, A_SG_CMDQ_CREDIT_TH, V_THRESHOLD(32) |
  2859. V_TIMEOUT(200 * core_ticks_per_usec(adap)));
  2860. t3_write_reg(adap, A_SG_HI_DRB_HI_THRSH,
  2861. adap->params.rev < T3_REV_C ? 1000 : 500);
  2862. t3_write_reg(adap, A_SG_HI_DRB_LO_THRSH, 256);
  2863. t3_write_reg(adap, A_SG_LO_DRB_HI_THRSH, 1000);
  2864. t3_write_reg(adap, A_SG_LO_DRB_LO_THRSH, 256);
  2865. t3_write_reg(adap, A_SG_OCO_BASE, V_BASE1(0xfff));
  2866. t3_write_reg(adap, A_SG_DRB_PRI_THRESH, 63 * 1024);
  2867. }
  2868. /**
  2869. * t3_sge_prep - one-time SGE initialization
  2870. * @adap: the associated adapter
  2871. * @p: SGE parameters
  2872. *
  2873. * Performs one-time initialization of SGE SW state. Includes determining
  2874. * defaults for the assorted SGE parameters, which admins can change until
  2875. * they are used to initialize the SGE.
  2876. */
  2877. void t3_sge_prep(struct adapter *adap, struct sge_params *p)
  2878. {
  2879. int i;
  2880. p->max_pkt_size = (16 * 1024) - sizeof(struct cpl_rx_data) -
  2881. SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
  2882. for (i = 0; i < SGE_QSETS; ++i) {
  2883. struct qset_params *q = p->qset + i;
  2884. q->polling = adap->params.rev > 0;
  2885. q->coalesce_usecs = 5;
  2886. q->rspq_size = 1024;
  2887. q->fl_size = 1024;
  2888. q->jumbo_size = 512;
  2889. q->txq_size[TXQ_ETH] = 1024;
  2890. q->txq_size[TXQ_OFLD] = 1024;
  2891. q->txq_size[TXQ_CTRL] = 256;
  2892. q->cong_thres = 0;
  2893. }
  2894. spin_lock_init(&adap->sge.reg_lock);
  2895. }