[mirror_ubuntu-bionic-kernel.git] / drivers / net / ethernet / mellanox / mlx5 / core / en_txrx.c

/*
 * Copyright (c) 2015, Mellanox Technologies. All rights reserved.
 *
 * This software is available to you under a choice of one of two
 * licenses.  You may choose to be licensed under the terms of the GNU
 * General Public License (GPL) Version 2, available from the file
 * COPYING in the main directory of this source tree, or the
 * OpenIB.org BSD license below:
 *
 *     Redistribution and use in source and binary forms, with or
 *     without modification, are permitted provided that the following
 *     conditions are met:
 *
 *      - Redistributions of source code must retain the above
 *        copyright notice, this list of conditions and the following
 *        disclaimer.
 *
 *      - Redistributions in binary form must reproduce the above
 *        copyright notice, this list of conditions and the following
 *        disclaimer in the documentation and/or other materials
 *        provided with the distribution.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#include <linux/irq.h>
#include "en.h"

static inline bool mlx5e_channel_no_affinity_change(struct mlx5e_channel *c)
{
	int current_cpu = smp_processor_id();
	const struct cpumask *aff;
	struct irq_data *idata;

	idata = irq_desc_get_irq_data(c->irq_desc);
	aff = irq_data_get_affinity_mask(idata);
	return cpumask_test_cpu(current_cpu, aff);
}

int mlx5e_napi_poll(struct napi_struct *napi, int budget)
{
	struct mlx5e_channel *c = container_of(napi, struct mlx5e_channel,
					       napi);
	bool busy = false;
	int work_done = 0;
	int i;

	for (i = 0; i < c->num_tc; i++)
		busy |= mlx5e_poll_tx_cq(&c->sq[i].cq, budget);

	if (c->xdp)
		busy |= mlx5e_poll_xdpsq_cq(&c->rq.xdpsq.cq);

	if (likely(budget)) { /* budget=0 means: don't poll rx rings */
		work_done = mlx5e_poll_rx_cq(&c->rq.cq, budget);
		busy |= work_done == budget;
	}

	busy |= c->rq.post_wqes(&c->rq);

	if (busy) {
		if (likely(mlx5e_channel_no_affinity_change(c)))
			return budget;
		if (budget && work_done == budget)
			work_done--;
	}

	if (unlikely(!napi_complete_done(napi, work_done)))
		return work_done;

	for (i = 0; i < c->num_tc; i++)
		mlx5e_cq_arm(&c->sq[i].cq);

	if (MLX5E_TEST_BIT(c->rq.state, MLX5E_RQ_STATE_AM))
		mlx5e_rx_am(&c->rq);

	mlx5e_cq_arm(&c->rq.cq);
	mlx5e_cq_arm(&c->icosq.cq);

	return work_done;
}

void mlx5e_completion_event(struct mlx5_core_cq *mcq)
{
	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);

	cq->event_ctr++;
	napi_schedule(cq->napi);
}

void mlx5e_cq_error_event(struct mlx5_core_cq *mcq, enum mlx5_event event)
{
	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);
	struct mlx5e_channel *c = cq->channel;
	struct net_device *netdev = c->netdev;

	netdev_err(netdev, "%s: cqn=0x%.6x event=0x%.2x\n",
		   __func__, mcq->cqn, event);
}
Commit	Line	Data
e586b3b0 AV	1	/*
	2	* Copyright (c) 2015, 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
a8c2eb15	33	#include <linux/irq.h>
e586b3b0 AV	34	#include "en.h"
e586b3b0 AV	35
a8c2eb15 TT	36	static inline bool mlx5e_channel_no_affinity_change(struct mlx5e_channel *c)
	37	{
	38	int current_cpu = smp_processor_id();
	39	const struct cpumask *aff;
	40	struct irq_data *idata;
	41
	42	idata = irq_desc_get_irq_data(c->irq_desc);
	43	aff = irq_data_get_affinity_mask(idata);
	44	return cpumask_test_cpu(current_cpu, aff);
	45	}
	46
e586b3b0 AV	47	int mlx5e_napi_poll(struct napi_struct *napi, int budget)
	48	{
	49	struct mlx5e_channel *c = container_of(napi, struct mlx5e_channel,
	50	napi);
	51	bool busy = false;
2a8d6065	52	int work_done = 0;
e586b3b0 AV	53	int i;
e586b3b0 AV	54
e586b3b0	55	for (i = 0; i < c->num_tc; i++)
8ec736e5	56	busy \|= mlx5e_poll_tx_cq(&c->sq[i].cq, budget);
e586b3b0	57
b5503b99	58	if (c->xdp)
31871f87	59	busy \|= mlx5e_poll_xdpsq_cq(&c->rq.xdpsq.cq);
b5503b99	60
2a8d6065 SM	61	if (likely(budget)) { /* budget=0 means: don't poll rx rings */
	62	work_done = mlx5e_poll_rx_cq(&c->rq.cq, budget);
	63	busy \|= work_done == budget;
	64	}
39e12351	65
7cc6d77b	66	busy \|= c->rq.post_wqes(&c->rq);
e586b3b0	67
a8c2eb15 TT	68	if (busy) {
	69	if (likely(mlx5e_channel_no_affinity_change(c)))
	70	return budget;
2a8d6065	71	if (budget && work_done == budget)
a8c2eb15 TT	72	work_done--;
a8c2eb15 TT	73	}
e586b3b0	74
7b33aaea	75	if (unlikely(!napi_complete_done(napi, work_done)))
44fb6fbb	76	return work_done;
e586b3b0 AV	77
	78	for (i = 0; i < c->num_tc; i++)
	79	mlx5e_cq_arm(&c->sq[i].cq);
cb3c7fd4	80
a1eaba4c	81	if (MLX5E_TEST_BIT(c->rq.state, MLX5E_RQ_STATE_AM))
cb3c7fd4 GR	82	mlx5e_rx_am(&c->rq);
cb3c7fd4 GR	83
e586b3b0	84	mlx5e_cq_arm(&c->rq.cq);
d3c9bc27	85	mlx5e_cq_arm(&c->icosq.cq);
e586b3b0	86
44fb6fbb	87	return work_done;
e586b3b0 AV	88	}
	89
	90	void mlx5e_completion_event(struct mlx5_core_cq *mcq)
	91	{
	92	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);
	93
cb3c7fd4	94	cq->event_ctr++;
e586b3b0 AV	95	napi_schedule(cq->napi);
	96	}
	97
	98	void mlx5e_cq_error_event(struct mlx5_core_cq *mcq, enum mlx5_event event)
	99	{
	100	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);
	101	struct mlx5e_channel *c = cq->channel;
a43b25da	102	struct net_device *netdev = c->netdev;
e586b3b0 AV	103
	104	netdev_err(netdev, "%s: cqn=0x%.6x event=0x%.2x\n",
	105	__func__, mcq->cqn, event);
	106	}