en_rx.c 26 KB

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