sge.c 82 KB

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