en_rx.c 30 KB

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