en_rx.c 27 KB

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