en_rx.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028
  1. /*
  2. * Copyright (c) 2007 Mellanox Technologies. 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. */
  33. #include <linux/mlx4/cq.h>
  34. #include <linux/slab.h>
  35. #include <linux/mlx4/qp.h>
  36. #include <linux/skbuff.h>
  37. #include <linux/rculist.h>
  38. #include <linux/if_ether.h>
  39. #include <linux/if_vlan.h>
  40. #include <linux/vmalloc.h>
  41. #include "mlx4_en.h"
  42. static int mlx4_en_alloc_frags(struct mlx4_en_priv *priv,
  43. struct mlx4_en_rx_desc *rx_desc,
  44. struct mlx4_en_rx_alloc *frags,
  45. struct mlx4_en_rx_alloc *ring_alloc)
  46. {
  47. struct mlx4_en_rx_alloc page_alloc[MLX4_EN_MAX_RX_FRAGS];
  48. struct mlx4_en_frag_info *frag_info;
  49. struct page *page;
  50. dma_addr_t dma;
  51. int i;
  52. for (i = 0; i < priv->num_frags; i++) {
  53. frag_info = &priv->frag_info[i];
  54. if (ring_alloc[i].offset == frag_info->last_offset) {
  55. page = alloc_pages(GFP_ATOMIC | __GFP_COMP,
  56. MLX4_EN_ALLOC_ORDER);
  57. if (!page)
  58. goto out;
  59. dma = dma_map_page(priv->ddev, page, 0,
  60. MLX4_EN_ALLOC_SIZE, PCI_DMA_FROMDEVICE);
  61. if (dma_mapping_error(priv->ddev, dma)) {
  62. put_page(page);
  63. goto out;
  64. }
  65. page_alloc[i].page = page;
  66. page_alloc[i].dma = dma;
  67. page_alloc[i].offset = frag_info->frag_align;
  68. } else {
  69. page_alloc[i].page = ring_alloc[i].page;
  70. get_page(ring_alloc[i].page);
  71. page_alloc[i].dma = ring_alloc[i].dma;
  72. page_alloc[i].offset = ring_alloc[i].offset +
  73. frag_info->frag_stride;
  74. }
  75. }
  76. for (i = 0; i < priv->num_frags; i++) {
  77. frags[i] = ring_alloc[i];
  78. dma = ring_alloc[i].dma + ring_alloc[i].offset;
  79. ring_alloc[i] = page_alloc[i];
  80. rx_desc->data[i].addr = cpu_to_be64(dma);
  81. }
  82. return 0;
  83. out:
  84. while (i--) {
  85. frag_info = &priv->frag_info[i];
  86. if (ring_alloc[i].offset == frag_info->last_offset)
  87. dma_unmap_page(priv->ddev, page_alloc[i].dma,
  88. MLX4_EN_ALLOC_SIZE, PCI_DMA_FROMDEVICE);
  89. put_page(page_alloc[i].page);
  90. }
  91. return -ENOMEM;
  92. }
  93. static void mlx4_en_free_frag(struct mlx4_en_priv *priv,
  94. struct mlx4_en_rx_alloc *frags,
  95. int i)
  96. {
  97. struct mlx4_en_frag_info *frag_info = &priv->frag_info[i];
  98. if (frags[i].offset == frag_info->last_offset) {
  99. dma_unmap_page(priv->ddev, frags[i].dma, MLX4_EN_ALLOC_SIZE,
  100. PCI_DMA_FROMDEVICE);
  101. }
  102. if (frags[i].page)
  103. put_page(frags[i].page);
  104. }
  105. static int mlx4_en_init_allocator(struct mlx4_en_priv *priv,
  106. struct mlx4_en_rx_ring *ring)
  107. {
  108. struct mlx4_en_rx_alloc *page_alloc;
  109. int i;
  110. for (i = 0; i < priv->num_frags; i++) {
  111. page_alloc = &ring->page_alloc[i];
  112. page_alloc->page = alloc_pages(GFP_ATOMIC | __GFP_COMP,
  113. MLX4_EN_ALLOC_ORDER);
  114. if (!page_alloc->page)
  115. goto out;
  116. page_alloc->dma = dma_map_page(priv->ddev, page_alloc->page, 0,
  117. MLX4_EN_ALLOC_SIZE, PCI_DMA_FROMDEVICE);
  118. if (dma_mapping_error(priv->ddev, page_alloc->dma)) {
  119. put_page(page_alloc->page);
  120. page_alloc->page = NULL;
  121. goto out;
  122. }
  123. page_alloc->offset = priv->frag_info[i].frag_align;
  124. en_dbg(DRV, priv, "Initialized allocator:%d with page:%p\n",
  125. i, page_alloc->page);
  126. }
  127. return 0;
  128. out:
  129. while (i--) {
  130. page_alloc = &ring->page_alloc[i];
  131. dma_unmap_page(priv->ddev, page_alloc->dma,
  132. MLX4_EN_ALLOC_SIZE, PCI_DMA_FROMDEVICE);
  133. put_page(page_alloc->page);
  134. page_alloc->page = NULL;
  135. }
  136. return -ENOMEM;
  137. }
  138. static void mlx4_en_destroy_allocator(struct mlx4_en_priv *priv,
  139. struct mlx4_en_rx_ring *ring)
  140. {
  141. struct mlx4_en_rx_alloc *page_alloc;
  142. int i;
  143. for (i = 0; i < priv->num_frags; i++) {
  144. page_alloc = &ring->page_alloc[i];
  145. en_dbg(DRV, priv, "Freeing allocator:%d count:%d\n",
  146. i, page_count(page_alloc->page));
  147. dma_unmap_page(priv->ddev, page_alloc->dma,
  148. MLX4_EN_ALLOC_SIZE, PCI_DMA_FROMDEVICE);
  149. put_page(page_alloc->page);
  150. page_alloc->page = NULL;
  151. }
  152. }
  153. static void mlx4_en_init_rx_desc(struct mlx4_en_priv *priv,
  154. struct mlx4_en_rx_ring *ring, int index)
  155. {
  156. struct mlx4_en_rx_desc *rx_desc = ring->buf + ring->stride * index;
  157. int possible_frags;
  158. int i;
  159. /* Set size and memtype fields */
  160. for (i = 0; i < priv->num_frags; i++) {
  161. rx_desc->data[i].byte_count =
  162. cpu_to_be32(priv->frag_info[i].frag_size);
  163. rx_desc->data[i].lkey = cpu_to_be32(priv->mdev->mr.key);
  164. }
  165. /* If the number of used fragments does not fill up the ring stride,
  166. * remaining (unused) fragments must be padded with null address/size
  167. * and a special memory key */
  168. possible_frags = (ring->stride - sizeof(struct mlx4_en_rx_desc)) / DS_SIZE;
  169. for (i = priv->num_frags; i < possible_frags; i++) {
  170. rx_desc->data[i].byte_count = 0;
  171. rx_desc->data[i].lkey = cpu_to_be32(MLX4_EN_MEMTYPE_PAD);
  172. rx_desc->data[i].addr = 0;
  173. }
  174. }
  175. static int mlx4_en_prepare_rx_desc(struct mlx4_en_priv *priv,
  176. struct mlx4_en_rx_ring *ring, int index)
  177. {
  178. struct mlx4_en_rx_desc *rx_desc = ring->buf + (index * ring->stride);
  179. struct mlx4_en_rx_alloc *frags = ring->rx_info +
  180. (index << priv->log_rx_info);
  181. return mlx4_en_alloc_frags(priv, rx_desc, frags, ring->page_alloc);
  182. }
  183. static inline void mlx4_en_update_rx_prod_db(struct mlx4_en_rx_ring *ring)
  184. {
  185. *ring->wqres.db.db = cpu_to_be32(ring->prod & 0xffff);
  186. }
  187. static void mlx4_en_free_rx_desc(struct mlx4_en_priv *priv,
  188. struct mlx4_en_rx_ring *ring,
  189. int index)
  190. {
  191. struct mlx4_en_rx_alloc *frags;
  192. int nr;
  193. frags = ring->rx_info + (index << priv->log_rx_info);
  194. for (nr = 0; nr < priv->num_frags; nr++) {
  195. en_dbg(DRV, priv, "Freeing fragment:%d\n", nr);
  196. mlx4_en_free_frag(priv, frags, nr);
  197. }
  198. }
  199. static int mlx4_en_fill_rx_buffers(struct mlx4_en_priv *priv)
  200. {
  201. struct mlx4_en_rx_ring *ring;
  202. int ring_ind;
  203. int buf_ind;
  204. int new_size;
  205. for (buf_ind = 0; buf_ind < priv->prof->rx_ring_size; buf_ind++) {
  206. for (ring_ind = 0; ring_ind < priv->rx_ring_num; ring_ind++) {
  207. ring = &priv->rx_ring[ring_ind];
  208. if (mlx4_en_prepare_rx_desc(priv, ring,
  209. ring->actual_size)) {
  210. if (ring->actual_size < MLX4_EN_MIN_RX_SIZE) {
  211. en_err(priv, "Failed to allocate "
  212. "enough rx buffers\n");
  213. return -ENOMEM;
  214. } else {
  215. new_size = rounddown_pow_of_two(ring->actual_size);
  216. en_warn(priv, "Only %d buffers allocated "
  217. "reducing ring size to %d",
  218. ring->actual_size, new_size);
  219. goto reduce_rings;
  220. }
  221. }
  222. ring->actual_size++;
  223. ring->prod++;
  224. }
  225. }
  226. return 0;
  227. reduce_rings:
  228. for (ring_ind = 0; ring_ind < priv->rx_ring_num; ring_ind++) {
  229. ring = &priv->rx_ring[ring_ind];
  230. while (ring->actual_size > new_size) {
  231. ring->actual_size--;
  232. ring->prod--;
  233. mlx4_en_free_rx_desc(priv, ring, ring->actual_size);
  234. }
  235. }
  236. return 0;
  237. }
  238. static void mlx4_en_free_rx_buf(struct mlx4_en_priv *priv,
  239. struct mlx4_en_rx_ring *ring)
  240. {
  241. int index;
  242. en_dbg(DRV, priv, "Freeing Rx buf - cons:%d prod:%d\n",
  243. ring->cons, ring->prod);
  244. /* Unmap and free Rx buffers */
  245. BUG_ON((u32) (ring->prod - ring->cons) > ring->actual_size);
  246. while (ring->cons != ring->prod) {
  247. index = ring->cons & ring->size_mask;
  248. en_dbg(DRV, priv, "Processing descriptor:%d\n", index);
  249. mlx4_en_free_rx_desc(priv, ring, index);
  250. ++ring->cons;
  251. }
  252. }
  253. int mlx4_en_create_rx_ring(struct mlx4_en_priv *priv,
  254. struct mlx4_en_rx_ring *ring, u32 size, u16 stride)
  255. {
  256. struct mlx4_en_dev *mdev = priv->mdev;
  257. int err = -ENOMEM;
  258. int tmp;
  259. ring->prod = 0;
  260. ring->cons = 0;
  261. ring->size = size;
  262. ring->size_mask = size - 1;
  263. ring->stride = stride;
  264. ring->log_stride = ffs(ring->stride) - 1;
  265. ring->buf_size = ring->size * ring->stride + TXBB_SIZE;
  266. tmp = size * roundup_pow_of_two(MLX4_EN_MAX_RX_FRAGS *
  267. sizeof(struct mlx4_en_rx_alloc));
  268. ring->rx_info = vmalloc(tmp);
  269. if (!ring->rx_info)
  270. return -ENOMEM;
  271. en_dbg(DRV, priv, "Allocated rx_info ring at addr:%p size:%d\n",
  272. ring->rx_info, tmp);
  273. err = mlx4_alloc_hwq_res(mdev->dev, &ring->wqres,
  274. ring->buf_size, 2 * PAGE_SIZE);
  275. if (err)
  276. goto err_ring;
  277. err = mlx4_en_map_buffer(&ring->wqres.buf);
  278. if (err) {
  279. en_err(priv, "Failed to map RX buffer\n");
  280. goto err_hwq;
  281. }
  282. ring->buf = ring->wqres.buf.direct.buf;
  283. return 0;
  284. err_hwq:
  285. mlx4_free_hwq_res(mdev->dev, &ring->wqres, ring->buf_size);
  286. err_ring:
  287. vfree(ring->rx_info);
  288. ring->rx_info = NULL;
  289. return err;
  290. }
  291. int mlx4_en_activate_rx_rings(struct mlx4_en_priv *priv)
  292. {
  293. struct mlx4_en_rx_ring *ring;
  294. int i;
  295. int ring_ind;
  296. int err;
  297. int stride = roundup_pow_of_two(sizeof(struct mlx4_en_rx_desc) +
  298. DS_SIZE * priv->num_frags);
  299. for (ring_ind = 0; ring_ind < priv->rx_ring_num; ring_ind++) {
  300. ring = &priv->rx_ring[ring_ind];
  301. ring->prod = 0;
  302. ring->cons = 0;
  303. ring->actual_size = 0;
  304. ring->cqn = priv->rx_cq[ring_ind].mcq.cqn;
  305. ring->stride = stride;
  306. if (ring->stride <= TXBB_SIZE)
  307. ring->buf += TXBB_SIZE;
  308. ring->log_stride = ffs(ring->stride) - 1;
  309. ring->buf_size = ring->size * ring->stride;
  310. memset(ring->buf, 0, ring->buf_size);
  311. mlx4_en_update_rx_prod_db(ring);
  312. /* Initialize all descriptors */
  313. for (i = 0; i < ring->size; i++)
  314. mlx4_en_init_rx_desc(priv, ring, i);
  315. /* Initialize page allocators */
  316. err = mlx4_en_init_allocator(priv, ring);
  317. if (err) {
  318. en_err(priv, "Failed initializing ring allocator\n");
  319. if (ring->stride <= TXBB_SIZE)
  320. ring->buf -= TXBB_SIZE;
  321. ring_ind--;
  322. goto err_allocator;
  323. }
  324. }
  325. err = mlx4_en_fill_rx_buffers(priv);
  326. if (err)
  327. goto err_buffers;
  328. for (ring_ind = 0; ring_ind < priv->rx_ring_num; ring_ind++) {
  329. ring = &priv->rx_ring[ring_ind];
  330. ring->size_mask = ring->actual_size - 1;
  331. mlx4_en_update_rx_prod_db(ring);
  332. }
  333. return 0;
  334. err_buffers:
  335. for (ring_ind = 0; ring_ind < priv->rx_ring_num; ring_ind++)
  336. mlx4_en_free_rx_buf(priv, &priv->rx_ring[ring_ind]);
  337. ring_ind = priv->rx_ring_num - 1;
  338. err_allocator:
  339. while (ring_ind >= 0) {
  340. if (priv->rx_ring[ring_ind].stride <= TXBB_SIZE)
  341. priv->rx_ring[ring_ind].buf -= TXBB_SIZE;
  342. mlx4_en_destroy_allocator(priv, &priv->rx_ring[ring_ind]);
  343. ring_ind--;
  344. }
  345. return err;
  346. }
  347. void mlx4_en_destroy_rx_ring(struct mlx4_en_priv *priv,
  348. struct mlx4_en_rx_ring *ring, u32 size, u16 stride)
  349. {
  350. struct mlx4_en_dev *mdev = priv->mdev;
  351. mlx4_en_unmap_buffer(&ring->wqres.buf);
  352. mlx4_free_hwq_res(mdev->dev, &ring->wqres, size * stride + TXBB_SIZE);
  353. vfree(ring->rx_info);
  354. ring->rx_info = NULL;
  355. #ifdef CONFIG_RFS_ACCEL
  356. mlx4_en_cleanup_filters(priv, ring);
  357. #endif
  358. }
  359. void mlx4_en_deactivate_rx_ring(struct mlx4_en_priv *priv,
  360. struct mlx4_en_rx_ring *ring)
  361. {
  362. mlx4_en_free_rx_buf(priv, ring);
  363. if (ring->stride <= TXBB_SIZE)
  364. ring->buf -= TXBB_SIZE;
  365. mlx4_en_destroy_allocator(priv, ring);
  366. }
  367. static int mlx4_en_complete_rx_desc(struct mlx4_en_priv *priv,
  368. struct mlx4_en_rx_desc *rx_desc,
  369. struct mlx4_en_rx_alloc *frags,
  370. struct sk_buff *skb,
  371. int length)
  372. {
  373. struct skb_frag_struct *skb_frags_rx = skb_shinfo(skb)->frags;
  374. struct mlx4_en_frag_info *frag_info;
  375. int nr;
  376. dma_addr_t dma;
  377. /* Collect used fragments while replacing them in the HW descriptors */
  378. for (nr = 0; nr < priv->num_frags; nr++) {
  379. frag_info = &priv->frag_info[nr];
  380. if (length <= frag_info->frag_prefix_size)
  381. break;
  382. if (!frags[nr].page)
  383. goto fail;
  384. dma = be64_to_cpu(rx_desc->data[nr].addr);
  385. dma_sync_single_for_cpu(priv->ddev, dma, frag_info->frag_size,
  386. DMA_FROM_DEVICE);
  387. /* Save page reference in skb */
  388. get_page(frags[nr].page);
  389. __skb_frag_set_page(&skb_frags_rx[nr], frags[nr].page);
  390. skb_frag_size_set(&skb_frags_rx[nr], frag_info->frag_size);
  391. skb_frags_rx[nr].page_offset = frags[nr].offset;
  392. skb->truesize += frag_info->frag_stride;
  393. }
  394. /* Adjust size of last fragment to match actual length */
  395. if (nr > 0)
  396. skb_frag_size_set(&skb_frags_rx[nr - 1],
  397. length - priv->frag_info[nr - 1].frag_prefix_size);
  398. return nr;
  399. fail:
  400. while (nr > 0) {
  401. nr--;
  402. __skb_frag_unref(&skb_frags_rx[nr]);
  403. }
  404. return 0;
  405. }
  406. static struct sk_buff *mlx4_en_rx_skb(struct mlx4_en_priv *priv,
  407. struct mlx4_en_rx_desc *rx_desc,
  408. struct mlx4_en_rx_alloc *frags,
  409. unsigned int length)
  410. {
  411. struct sk_buff *skb;
  412. void *va;
  413. int used_frags;
  414. dma_addr_t dma;
  415. skb = netdev_alloc_skb(priv->dev, SMALL_PACKET_SIZE + NET_IP_ALIGN);
  416. if (!skb) {
  417. en_dbg(RX_ERR, priv, "Failed allocating skb\n");
  418. return NULL;
  419. }
  420. skb_reserve(skb, NET_IP_ALIGN);
  421. skb->len = length;
  422. /* Get pointer to first fragment so we could copy the headers into the
  423. * (linear part of the) skb */
  424. va = page_address(frags[0].page) + frags[0].offset;
  425. if (length <= SMALL_PACKET_SIZE) {
  426. /* We are copying all relevant data to the skb - temporarily
  427. * sync buffers for the copy */
  428. dma = be64_to_cpu(rx_desc->data[0].addr);
  429. dma_sync_single_for_cpu(priv->ddev, dma, length,
  430. DMA_FROM_DEVICE);
  431. skb_copy_to_linear_data(skb, va, length);
  432. skb->tail += length;
  433. } else {
  434. /* Move relevant fragments to skb */
  435. used_frags = mlx4_en_complete_rx_desc(priv, rx_desc, frags,
  436. skb, length);
  437. if (unlikely(!used_frags)) {
  438. kfree_skb(skb);
  439. return NULL;
  440. }
  441. skb_shinfo(skb)->nr_frags = used_frags;
  442. /* Copy headers into the skb linear buffer */
  443. memcpy(skb->data, va, HEADER_COPY_SIZE);
  444. skb->tail += HEADER_COPY_SIZE;
  445. /* Skip headers in first fragment */
  446. skb_shinfo(skb)->frags[0].page_offset += HEADER_COPY_SIZE;
  447. /* Adjust size of first fragment */
  448. skb_frag_size_sub(&skb_shinfo(skb)->frags[0], HEADER_COPY_SIZE);
  449. skb->data_len = length - HEADER_COPY_SIZE;
  450. }
  451. return skb;
  452. }
  453. static void validate_loopback(struct mlx4_en_priv *priv, struct sk_buff *skb)
  454. {
  455. int i;
  456. int offset = ETH_HLEN;
  457. for (i = 0; i < MLX4_LOOPBACK_TEST_PAYLOAD; i++, offset++) {
  458. if (*(skb->data + offset) != (unsigned char) (i & 0xff))
  459. goto out_loopback;
  460. }
  461. /* Loopback found */
  462. priv->loopback_ok = 1;
  463. out_loopback:
  464. dev_kfree_skb_any(skb);
  465. }
  466. static void mlx4_en_refill_rx_buffers(struct mlx4_en_priv *priv,
  467. struct mlx4_en_rx_ring *ring)
  468. {
  469. int index = ring->prod & ring->size_mask;
  470. while ((u32) (ring->prod - ring->cons) < ring->actual_size) {
  471. if (mlx4_en_prepare_rx_desc(priv, ring, index))
  472. break;
  473. ring->prod++;
  474. index = ring->prod & ring->size_mask;
  475. }
  476. }
  477. int mlx4_en_process_rx_cq(struct net_device *dev, struct mlx4_en_cq *cq, int budget)
  478. {
  479. struct mlx4_en_priv *priv = netdev_priv(dev);
  480. struct mlx4_cqe *cqe;
  481. struct mlx4_en_rx_ring *ring = &priv->rx_ring[cq->ring];
  482. struct mlx4_en_rx_alloc *frags;
  483. struct mlx4_en_rx_desc *rx_desc;
  484. struct sk_buff *skb;
  485. int index;
  486. int nr;
  487. unsigned int length;
  488. int polled = 0;
  489. int ip_summed;
  490. int factor = priv->cqe_factor;
  491. if (!priv->port_up)
  492. return 0;
  493. /* We assume a 1:1 mapping between CQEs and Rx descriptors, so Rx
  494. * descriptor offset can be deduced from the CQE index instead of
  495. * reading 'cqe->index' */
  496. index = cq->mcq.cons_index & ring->size_mask;
  497. cqe = &cq->buf[(index << factor) + factor];
  498. /* Process all completed CQEs */
  499. while (XNOR(cqe->owner_sr_opcode & MLX4_CQE_OWNER_MASK,
  500. cq->mcq.cons_index & cq->size)) {
  501. frags = ring->rx_info + (index << priv->log_rx_info);
  502. rx_desc = ring->buf + (index << ring->log_stride);
  503. /*
  504. * make sure we read the CQE after we read the ownership bit
  505. */
  506. rmb();
  507. /* Drop packet on bad receive or bad checksum */
  508. if (unlikely((cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) ==
  509. MLX4_CQE_OPCODE_ERROR)) {
  510. en_err(priv, "CQE completed in error - vendor "
  511. "syndrom:%d syndrom:%d\n",
  512. ((struct mlx4_err_cqe *) cqe)->vendor_err_syndrome,
  513. ((struct mlx4_err_cqe *) cqe)->syndrome);
  514. goto next;
  515. }
  516. if (unlikely(cqe->badfcs_enc & MLX4_CQE_BAD_FCS)) {
  517. en_dbg(RX_ERR, priv, "Accepted frame with bad FCS\n");
  518. goto next;
  519. }
  520. /* Check if we need to drop the packet if SRIOV is not enabled
  521. * and not performing the selftest or flb disabled
  522. */
  523. if (priv->flags & MLX4_EN_FLAG_RX_FILTER_NEEDED) {
  524. struct ethhdr *ethh;
  525. dma_addr_t dma;
  526. /* Get pointer to first fragment since we haven't
  527. * skb yet and cast it to ethhdr struct
  528. */
  529. dma = be64_to_cpu(rx_desc->data[0].addr);
  530. dma_sync_single_for_cpu(priv->ddev, dma, sizeof(*ethh),
  531. DMA_FROM_DEVICE);
  532. ethh = (struct ethhdr *)(page_address(frags[0].page) +
  533. frags[0].offset);
  534. if (is_multicast_ether_addr(ethh->h_dest)) {
  535. struct mlx4_mac_entry *entry;
  536. struct hlist_head *bucket;
  537. unsigned int mac_hash;
  538. /* Drop the packet, since HW loopback-ed it */
  539. mac_hash = ethh->h_source[MLX4_EN_MAC_HASH_IDX];
  540. bucket = &priv->mac_hash[mac_hash];
  541. rcu_read_lock();
  542. hlist_for_each_entry_rcu(entry, bucket, hlist) {
  543. if (ether_addr_equal_64bits(entry->mac,
  544. ethh->h_source)) {
  545. rcu_read_unlock();
  546. goto next;
  547. }
  548. }
  549. rcu_read_unlock();
  550. }
  551. }
  552. /*
  553. * Packet is OK - process it.
  554. */
  555. length = be32_to_cpu(cqe->byte_cnt);
  556. length -= ring->fcs_del;
  557. ring->bytes += length;
  558. ring->packets++;
  559. if (likely(dev->features & NETIF_F_RXCSUM)) {
  560. if ((cqe->status & cpu_to_be16(MLX4_CQE_STATUS_IPOK)) &&
  561. (cqe->checksum == cpu_to_be16(0xffff))) {
  562. ring->csum_ok++;
  563. /* This packet is eligible for GRO if it is:
  564. * - DIX Ethernet (type interpretation)
  565. * - TCP/IP (v4)
  566. * - without IP options
  567. * - not an IP fragment */
  568. if (dev->features & NETIF_F_GRO) {
  569. struct sk_buff *gro_skb = napi_get_frags(&cq->napi);
  570. if (!gro_skb)
  571. goto next;
  572. nr = mlx4_en_complete_rx_desc(priv,
  573. rx_desc, frags, gro_skb,
  574. length);
  575. if (!nr)
  576. goto next;
  577. skb_shinfo(gro_skb)->nr_frags = nr;
  578. gro_skb->len = length;
  579. gro_skb->data_len = length;
  580. gro_skb->ip_summed = CHECKSUM_UNNECESSARY;
  581. if (cqe->vlan_my_qpn &
  582. cpu_to_be32(MLX4_CQE_VLAN_PRESENT_MASK)) {
  583. u16 vid = be16_to_cpu(cqe->sl_vid);
  584. __vlan_hwaccel_put_tag(gro_skb, vid);
  585. }
  586. if (dev->features & NETIF_F_RXHASH)
  587. gro_skb->rxhash = be32_to_cpu(cqe->immed_rss_invalid);
  588. skb_record_rx_queue(gro_skb, cq->ring);
  589. napi_gro_frags(&cq->napi);
  590. goto next;
  591. }
  592. /* GRO not possible, complete processing here */
  593. ip_summed = CHECKSUM_UNNECESSARY;
  594. } else {
  595. ip_summed = CHECKSUM_NONE;
  596. ring->csum_none++;
  597. }
  598. } else {
  599. ip_summed = CHECKSUM_NONE;
  600. ring->csum_none++;
  601. }
  602. skb = mlx4_en_rx_skb(priv, rx_desc, frags, length);
  603. if (!skb) {
  604. priv->stats.rx_dropped++;
  605. goto next;
  606. }
  607. if (unlikely(priv->validate_loopback)) {
  608. validate_loopback(priv, skb);
  609. goto next;
  610. }
  611. skb->ip_summed = ip_summed;
  612. skb->protocol = eth_type_trans(skb, dev);
  613. skb_record_rx_queue(skb, cq->ring);
  614. if (dev->features & NETIF_F_RXHASH)
  615. skb->rxhash = be32_to_cpu(cqe->immed_rss_invalid);
  616. if (be32_to_cpu(cqe->vlan_my_qpn) &
  617. MLX4_CQE_VLAN_PRESENT_MASK)
  618. __vlan_hwaccel_put_tag(skb, be16_to_cpu(cqe->sl_vid));
  619. /* Push it up the stack */
  620. netif_receive_skb(skb);
  621. next:
  622. for (nr = 0; nr < priv->num_frags; nr++)
  623. mlx4_en_free_frag(priv, frags, nr);
  624. ++cq->mcq.cons_index;
  625. index = (cq->mcq.cons_index) & ring->size_mask;
  626. cqe = &cq->buf[(index << factor) + factor];
  627. if (++polled == budget)
  628. goto out;
  629. }
  630. out:
  631. AVG_PERF_COUNTER(priv->pstats.rx_coal_avg, polled);
  632. mlx4_cq_set_ci(&cq->mcq);
  633. wmb(); /* ensure HW sees CQ consumer before we post new buffers */
  634. ring->cons = cq->mcq.cons_index;
  635. mlx4_en_refill_rx_buffers(priv, ring);
  636. mlx4_en_update_rx_prod_db(ring);
  637. return polled;
  638. }
  639. void mlx4_en_rx_irq(struct mlx4_cq *mcq)
  640. {
  641. struct mlx4_en_cq *cq = container_of(mcq, struct mlx4_en_cq, mcq);
  642. struct mlx4_en_priv *priv = netdev_priv(cq->dev);
  643. if (priv->port_up)
  644. napi_schedule(&cq->napi);
  645. else
  646. mlx4_en_arm_cq(priv, cq);
  647. }
  648. /* Rx CQ polling - called by NAPI */
  649. int mlx4_en_poll_rx_cq(struct napi_struct *napi, int budget)
  650. {
  651. struct mlx4_en_cq *cq = container_of(napi, struct mlx4_en_cq, napi);
  652. struct net_device *dev = cq->dev;
  653. struct mlx4_en_priv *priv = netdev_priv(dev);
  654. int done;
  655. done = mlx4_en_process_rx_cq(dev, cq, budget);
  656. /* If we used up all the quota - we're probably not done yet... */
  657. if (done == budget)
  658. INC_PERF_COUNTER(priv->pstats.napi_quota);
  659. else {
  660. /* Done for now */
  661. napi_complete(napi);
  662. mlx4_en_arm_cq(priv, cq);
  663. }
  664. return done;
  665. }
  666. /* Calculate the last offset position that accommodates a full fragment
  667. * (assuming fagment size = stride-align) */
  668. static int mlx4_en_last_alloc_offset(struct mlx4_en_priv *priv, u16 stride, u16 align)
  669. {
  670. u16 res = MLX4_EN_ALLOC_SIZE % stride;
  671. u16 offset = MLX4_EN_ALLOC_SIZE - stride - res + align;
  672. en_dbg(DRV, priv, "Calculated last offset for stride:%d align:%d "
  673. "res:%d offset:%d\n", stride, align, res, offset);
  674. return offset;
  675. }
  676. static int frag_sizes[] = {
  677. FRAG_SZ0,
  678. FRAG_SZ1,
  679. FRAG_SZ2,
  680. FRAG_SZ3
  681. };
  682. void mlx4_en_calc_rx_buf(struct net_device *dev)
  683. {
  684. struct mlx4_en_priv *priv = netdev_priv(dev);
  685. int eff_mtu = dev->mtu + ETH_HLEN + VLAN_HLEN + ETH_LLC_SNAP_SIZE;
  686. int buf_size = 0;
  687. int i = 0;
  688. while (buf_size < eff_mtu) {
  689. priv->frag_info[i].frag_size =
  690. (eff_mtu > buf_size + frag_sizes[i]) ?
  691. frag_sizes[i] : eff_mtu - buf_size;
  692. priv->frag_info[i].frag_prefix_size = buf_size;
  693. if (!i) {
  694. priv->frag_info[i].frag_align = NET_IP_ALIGN;
  695. priv->frag_info[i].frag_stride =
  696. ALIGN(frag_sizes[i] + NET_IP_ALIGN, SMP_CACHE_BYTES);
  697. } else {
  698. priv->frag_info[i].frag_align = 0;
  699. priv->frag_info[i].frag_stride =
  700. ALIGN(frag_sizes[i], SMP_CACHE_BYTES);
  701. }
  702. priv->frag_info[i].last_offset = mlx4_en_last_alloc_offset(
  703. priv, priv->frag_info[i].frag_stride,
  704. priv->frag_info[i].frag_align);
  705. buf_size += priv->frag_info[i].frag_size;
  706. i++;
  707. }
  708. priv->num_frags = i;
  709. priv->rx_skb_size = eff_mtu;
  710. priv->log_rx_info = ROUNDUP_LOG2(i * sizeof(struct mlx4_en_rx_alloc));
  711. en_dbg(DRV, priv, "Rx buffer scatter-list (effective-mtu:%d "
  712. "num_frags:%d):\n", eff_mtu, priv->num_frags);
  713. for (i = 0; i < priv->num_frags; i++) {
  714. en_dbg(DRV, priv, " frag:%d - size:%d prefix:%d align:%d "
  715. "stride:%d last_offset:%d\n", i,
  716. priv->frag_info[i].frag_size,
  717. priv->frag_info[i].frag_prefix_size,
  718. priv->frag_info[i].frag_align,
  719. priv->frag_info[i].frag_stride,
  720. priv->frag_info[i].last_offset);
  721. }
  722. }
  723. /* RSS related functions */
  724. static int mlx4_en_config_rss_qp(struct mlx4_en_priv *priv, int qpn,
  725. struct mlx4_en_rx_ring *ring,
  726. enum mlx4_qp_state *state,
  727. struct mlx4_qp *qp)
  728. {
  729. struct mlx4_en_dev *mdev = priv->mdev;
  730. struct mlx4_qp_context *context;
  731. int err = 0;
  732. context = kmalloc(sizeof(*context), GFP_KERNEL);
  733. if (!context)
  734. return -ENOMEM;
  735. err = mlx4_qp_alloc(mdev->dev, qpn, qp);
  736. if (err) {
  737. en_err(priv, "Failed to allocate qp #%x\n", qpn);
  738. goto out;
  739. }
  740. qp->event = mlx4_en_sqp_event;
  741. memset(context, 0, sizeof *context);
  742. mlx4_en_fill_qp_context(priv, ring->actual_size, ring->stride, 0, 0,
  743. qpn, ring->cqn, -1, context);
  744. context->db_rec_addr = cpu_to_be64(ring->wqres.db.dma);
  745. /* Cancel FCS removal if FW allows */
  746. if (mdev->dev->caps.flags & MLX4_DEV_CAP_FLAG_FCS_KEEP) {
  747. context->param3 |= cpu_to_be32(1 << 29);
  748. ring->fcs_del = ETH_FCS_LEN;
  749. } else
  750. ring->fcs_del = 0;
  751. err = mlx4_qp_to_ready(mdev->dev, &ring->wqres.mtt, context, qp, state);
  752. if (err) {
  753. mlx4_qp_remove(mdev->dev, qp);
  754. mlx4_qp_free(mdev->dev, qp);
  755. }
  756. mlx4_en_update_rx_prod_db(ring);
  757. out:
  758. kfree(context);
  759. return err;
  760. }
  761. int mlx4_en_create_drop_qp(struct mlx4_en_priv *priv)
  762. {
  763. int err;
  764. u32 qpn;
  765. err = mlx4_qp_reserve_range(priv->mdev->dev, 1, 1, &qpn);
  766. if (err) {
  767. en_err(priv, "Failed reserving drop qpn\n");
  768. return err;
  769. }
  770. err = mlx4_qp_alloc(priv->mdev->dev, qpn, &priv->drop_qp);
  771. if (err) {
  772. en_err(priv, "Failed allocating drop qp\n");
  773. mlx4_qp_release_range(priv->mdev->dev, qpn, 1);
  774. return err;
  775. }
  776. return 0;
  777. }
  778. void mlx4_en_destroy_drop_qp(struct mlx4_en_priv *priv)
  779. {
  780. u32 qpn;
  781. qpn = priv->drop_qp.qpn;
  782. mlx4_qp_remove(priv->mdev->dev, &priv->drop_qp);
  783. mlx4_qp_free(priv->mdev->dev, &priv->drop_qp);
  784. mlx4_qp_release_range(priv->mdev->dev, qpn, 1);
  785. }
  786. /* Allocate rx qp's and configure them according to rss map */
  787. int mlx4_en_config_rss_steer(struct mlx4_en_priv *priv)
  788. {
  789. struct mlx4_en_dev *mdev = priv->mdev;
  790. struct mlx4_en_rss_map *rss_map = &priv->rss_map;
  791. struct mlx4_qp_context context;
  792. struct mlx4_rss_context *rss_context;
  793. int rss_rings;
  794. void *ptr;
  795. u8 rss_mask = (MLX4_RSS_IPV4 | MLX4_RSS_TCP_IPV4 | MLX4_RSS_IPV6 |
  796. MLX4_RSS_TCP_IPV6);
  797. int i, qpn;
  798. int err = 0;
  799. int good_qps = 0;
  800. static const u32 rsskey[10] = { 0xD181C62C, 0xF7F4DB5B, 0x1983A2FC,
  801. 0x943E1ADB, 0xD9389E6B, 0xD1039C2C, 0xA74499AD,
  802. 0x593D56D9, 0xF3253C06, 0x2ADC1FFC};
  803. en_dbg(DRV, priv, "Configuring rss steering\n");
  804. err = mlx4_qp_reserve_range(mdev->dev, priv->rx_ring_num,
  805. priv->rx_ring_num,
  806. &rss_map->base_qpn);
  807. if (err) {
  808. en_err(priv, "Failed reserving %d qps\n", priv->rx_ring_num);
  809. return err;
  810. }
  811. for (i = 0; i < priv->rx_ring_num; i++) {
  812. qpn = rss_map->base_qpn + i;
  813. err = mlx4_en_config_rss_qp(priv, qpn, &priv->rx_ring[i],
  814. &rss_map->state[i],
  815. &rss_map->qps[i]);
  816. if (err)
  817. goto rss_err;
  818. ++good_qps;
  819. }
  820. /* Configure RSS indirection qp */
  821. err = mlx4_qp_alloc(mdev->dev, priv->base_qpn, &rss_map->indir_qp);
  822. if (err) {
  823. en_err(priv, "Failed to allocate RSS indirection QP\n");
  824. goto rss_err;
  825. }
  826. rss_map->indir_qp.event = mlx4_en_sqp_event;
  827. mlx4_en_fill_qp_context(priv, 0, 0, 0, 1, priv->base_qpn,
  828. priv->rx_ring[0].cqn, -1, &context);
  829. if (!priv->prof->rss_rings || priv->prof->rss_rings > priv->rx_ring_num)
  830. rss_rings = priv->rx_ring_num;
  831. else
  832. rss_rings = priv->prof->rss_rings;
  833. ptr = ((void *) &context) + offsetof(struct mlx4_qp_context, pri_path)
  834. + MLX4_RSS_OFFSET_IN_QPC_PRI_PATH;
  835. rss_context = ptr;
  836. rss_context->base_qpn = cpu_to_be32(ilog2(rss_rings) << 24 |
  837. (rss_map->base_qpn));
  838. rss_context->default_qpn = cpu_to_be32(rss_map->base_qpn);
  839. if (priv->mdev->profile.udp_rss) {
  840. rss_mask |= MLX4_RSS_UDP_IPV4 | MLX4_RSS_UDP_IPV6;
  841. rss_context->base_qpn_udp = rss_context->default_qpn;
  842. }
  843. rss_context->flags = rss_mask;
  844. rss_context->hash_fn = MLX4_RSS_HASH_TOP;
  845. for (i = 0; i < 10; i++)
  846. rss_context->rss_key[i] = cpu_to_be32(rsskey[i]);
  847. err = mlx4_qp_to_ready(mdev->dev, &priv->res.mtt, &context,
  848. &rss_map->indir_qp, &rss_map->indir_state);
  849. if (err)
  850. goto indir_err;
  851. return 0;
  852. indir_err:
  853. mlx4_qp_modify(mdev->dev, NULL, rss_map->indir_state,
  854. MLX4_QP_STATE_RST, NULL, 0, 0, &rss_map->indir_qp);
  855. mlx4_qp_remove(mdev->dev, &rss_map->indir_qp);
  856. mlx4_qp_free(mdev->dev, &rss_map->indir_qp);
  857. rss_err:
  858. for (i = 0; i < good_qps; i++) {
  859. mlx4_qp_modify(mdev->dev, NULL, rss_map->state[i],
  860. MLX4_QP_STATE_RST, NULL, 0, 0, &rss_map->qps[i]);
  861. mlx4_qp_remove(mdev->dev, &rss_map->qps[i]);
  862. mlx4_qp_free(mdev->dev, &rss_map->qps[i]);
  863. }
  864. mlx4_qp_release_range(mdev->dev, rss_map->base_qpn, priv->rx_ring_num);
  865. return err;
  866. }
  867. void mlx4_en_release_rss_steer(struct mlx4_en_priv *priv)
  868. {
  869. struct mlx4_en_dev *mdev = priv->mdev;
  870. struct mlx4_en_rss_map *rss_map = &priv->rss_map;
  871. int i;
  872. mlx4_qp_modify(mdev->dev, NULL, rss_map->indir_state,
  873. MLX4_QP_STATE_RST, NULL, 0, 0, &rss_map->indir_qp);
  874. mlx4_qp_remove(mdev->dev, &rss_map->indir_qp);
  875. mlx4_qp_free(mdev->dev, &rss_map->indir_qp);
  876. for (i = 0; i < priv->rx_ring_num; i++) {
  877. mlx4_qp_modify(mdev->dev, NULL, rss_map->state[i],
  878. MLX4_QP_STATE_RST, NULL, 0, 0, &rss_map->qps[i]);
  879. mlx4_qp_remove(mdev->dev, &rss_map->qps[i]);
  880. mlx4_qp_free(mdev->dev, &rss_map->qps[i]);
  881. }
  882. mlx4_qp_release_range(mdev->dev, rss_map->base_qpn, priv->rx_ring_num);
  883. }