en_rx.c 26 KB

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