sge.c 81 KB

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