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 
33 #include <linux/irq.h>
34 #include "en.h"
35 #include "en/xdp.h"
36 
mlx5e_channel_no_affinity_change(struct mlx5e_channel * c)37 static inline bool mlx5e_channel_no_affinity_change(struct mlx5e_channel *c)
38 {
39 	int current_cpu = smp_processor_id();
40 	const struct cpumask *aff;
41 	struct irq_data *idata;
42 
43 	idata = irq_desc_get_irq_data(c->irq_desc);
44 	aff = irq_data_get_affinity_mask(idata);
45 	return cpumask_test_cpu(current_cpu, aff);
46 }
47 
mlx5e_handle_tx_dim(struct mlx5e_txqsq * sq)48 static void mlx5e_handle_tx_dim(struct mlx5e_txqsq *sq)
49 {
50 	struct mlx5e_sq_stats *stats = sq->stats;
51 	struct net_dim_sample dim_sample;
52 
53 	if (unlikely(!test_bit(MLX5E_SQ_STATE_AM, &sq->state)))
54 		return;
55 
56 	net_dim_sample(sq->cq.event_ctr, stats->packets, stats->bytes,
57 		       &dim_sample);
58 	net_dim(&sq->dim, dim_sample);
59 }
60 
mlx5e_handle_rx_dim(struct mlx5e_rq * rq)61 static void mlx5e_handle_rx_dim(struct mlx5e_rq *rq)
62 {
63 	struct mlx5e_rq_stats *stats = rq->stats;
64 	struct net_dim_sample dim_sample;
65 
66 	if (unlikely(!test_bit(MLX5E_RQ_STATE_AM, &rq->state)))
67 		return;
68 
69 	net_dim_sample(rq->cq.event_ctr, stats->packets, stats->bytes,
70 		       &dim_sample);
71 	net_dim(&rq->dim, dim_sample);
72 }
73 
mlx5e_napi_poll(struct napi_struct * napi,int budget)74 int mlx5e_napi_poll(struct napi_struct *napi, int budget)
75 {
76 	struct mlx5e_channel *c = container_of(napi, struct mlx5e_channel,
77 					       napi);
78 	struct mlx5e_ch_stats *ch_stats = c->stats;
79 	bool busy = false;
80 	int work_done = 0;
81 	int i;
82 
83 	ch_stats->poll++;
84 
85 	for (i = 0; i < c->num_tc; i++)
86 		busy |= mlx5e_poll_tx_cq(&c->sq[i].cq, budget);
87 
88 	busy |= mlx5e_poll_xdpsq_cq(&c->xdpsq.cq);
89 
90 	if (c->xdp)
91 		busy |= mlx5e_poll_xdpsq_cq(&c->rq.xdpsq.cq);
92 
93 	if (likely(budget)) { /* budget=0 means: don't poll rx rings */
94 		work_done = mlx5e_poll_rx_cq(&c->rq.cq, budget);
95 		busy |= work_done == budget;
96 	}
97 
98 	busy |= c->rq.post_wqes(&c->rq);
99 
100 	if (busy) {
101 		if (likely(mlx5e_channel_no_affinity_change(c)))
102 			return budget;
103 		ch_stats->aff_change++;
104 		if (budget && work_done == budget)
105 			work_done--;
106 	}
107 
108 	if (unlikely(!napi_complete_done(napi, work_done)))
109 		return work_done;
110 
111 	ch_stats->arm++;
112 
113 	for (i = 0; i < c->num_tc; i++) {
114 		mlx5e_handle_tx_dim(&c->sq[i]);
115 		mlx5e_cq_arm(&c->sq[i].cq);
116 	}
117 
118 	mlx5e_handle_rx_dim(&c->rq);
119 
120 	mlx5e_cq_arm(&c->rq.cq);
121 	mlx5e_cq_arm(&c->icosq.cq);
122 	mlx5e_cq_arm(&c->xdpsq.cq);
123 
124 	return work_done;
125 }
126 
mlx5e_completion_event(struct mlx5_core_cq * mcq)127 void mlx5e_completion_event(struct mlx5_core_cq *mcq)
128 {
129 	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);
130 
131 	napi_schedule(cq->napi);
132 	cq->event_ctr++;
133 	cq->channel->stats->events++;
134 }
135 
mlx5e_cq_error_event(struct mlx5_core_cq * mcq,enum mlx5_event event)136 void mlx5e_cq_error_event(struct mlx5_core_cq *mcq, enum mlx5_event event)
137 {
138 	struct mlx5e_cq *cq = container_of(mcq, struct mlx5e_cq, mcq);
139 	struct mlx5e_channel *c = cq->channel;
140 	struct net_device *netdev = c->netdev;
141 
142 	netdev_err(netdev, "%s: cqn=0x%.6x event=0x%.2x\n",
143 		   __func__, mcq->cqn, event);
144 }
145