4 * Copyright(c) 2015, 2016 Intel Corporation.
6 * This file is provided under a dual BSD/GPLv2 license. When using or
7 * redistributing this file, you may do so under either license.
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of version 2 of the GNU General Public License as
13 * published by the Free Software Foundation.
15 * This program is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
26 * - Redistributions of source code must retain the above copyright
27 * notice, this list of conditions and the following disclaimer.
28 * - Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in
30 * the documentation and/or other materials provided with the
32 * - Neither the name of Intel Corporation nor the names of its
33 * contributors may be used to endorse or promote products derived
34 * from this software without specific prior written permission.
36 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
37 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
38 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
39 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
40 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
42 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
43 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
44 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
45 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
46 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
50 #include <linux/list.h>
51 #include <linux/workqueue.h>
52 #include <linux/sched.h>
54 #include "sdma_txreq.h"
57 * typedef (*restart_t)() - restart callback
58 * @work: pointer to work structure
60 typedef void (*restart_t
)(struct work_struct
*work
);
65 * struct iowait - linkage for delayed progress/waiting
66 * @list: used to add/insert into QP/PQ wait lists
67 * @lock: uses to record the list head lock
68 * @tx_head: overflow list of sdma_txreq's
69 * @sleep: no space callback
70 * @wakeup: space callback wakeup
71 * @sdma_drained: sdma count drained
72 * @iowork: workqueue overhead
73 * @wait_dma: wait for sdma_busy == 0
74 * @wait_pio: wait for pio_busy == 0
75 * @sdma_busy: # of packets in flight
76 * @count: total number of descriptors in tx_head'ed list
77 * @tx_limit: limit for overflow queuing
78 * @tx_count: number of tx entry's in tx_head'ed list
80 * This is to be embedded in user's state structure
83 * The sleep and wakeup members are a
84 * bit misnamed. They do not strictly
85 * speaking sleep or wake up, but they
86 * are callbacks for the ULP to implement
87 * what ever queuing/dequeuing of
88 * the embedded iowait and its containing struct
89 * when a resource shortage like SDMA ring space is seen.
91 * Both potentially have locks help
92 * so sleeping is not allowed.
94 * The wait_dma member along with the iow
96 * The lock field is used by waiters to record
97 * the seqlock_t that guards the list head.
98 * Waiters explicity know that, but the destroy
99 * code that unwaits QPs does not.
103 struct list_head list
;
104 struct list_head tx_head
;
106 struct sdma_engine
*sde
,
108 struct sdma_txreq
*tx
,
112 void (*wakeup
)(struct iowait
*wait
, int reason
);
113 void (*sdma_drained
)(struct iowait
*wait
);
115 struct work_struct iowork
;
116 wait_queue_head_t wait_dma
;
117 wait_queue_head_t wait_pio
;
126 #define SDMA_AVAIL_REASON 0
129 * iowait_init() - initialize wait structure
130 * @wait: wait struct to initialize
131 * @tx_limit: limit for overflow queuing
132 * @func: restart function for workqueue
133 * @sleep: sleep function for no space
134 * @resume: wakeup function for no space
136 * This function initializes the iowait
137 * structure embedded in the QP or PQ.
141 static inline void iowait_init(
144 void (*func
)(struct work_struct
*work
),
146 struct sdma_engine
*sde
,
148 struct sdma_txreq
*tx
,
151 void (*wakeup
)(struct iowait
*wait
, int reason
),
152 void (*sdma_drained
)(struct iowait
*wait
))
156 INIT_LIST_HEAD(&wait
->list
);
157 INIT_LIST_HEAD(&wait
->tx_head
);
158 INIT_WORK(&wait
->iowork
, func
);
159 init_waitqueue_head(&wait
->wait_dma
);
160 init_waitqueue_head(&wait
->wait_pio
);
161 atomic_set(&wait
->sdma_busy
, 0);
162 atomic_set(&wait
->pio_busy
, 0);
163 wait
->tx_limit
= tx_limit
;
165 wait
->wakeup
= wakeup
;
166 wait
->sdma_drained
= sdma_drained
;
170 * iowait_schedule() - initialize wait structure
171 * @wait: wait struct to schedule
172 * @wq: workqueue for schedule
175 static inline void iowait_schedule(
177 struct workqueue_struct
*wq
,
180 queue_work_on(cpu
, wq
, &wait
->iowork
);
184 * iowait_sdma_drain() - wait for DMAs to drain
186 * @wait: iowait structure
188 * This will delay until the iowait sdmas have
191 static inline void iowait_sdma_drain(struct iowait
*wait
)
193 wait_event(wait
->wait_dma
, !atomic_read(&wait
->sdma_busy
));
197 * iowait_sdma_pending() - return sdma pending count
199 * @wait: iowait structure
202 static inline int iowait_sdma_pending(struct iowait
*wait
)
204 return atomic_read(&wait
->sdma_busy
);
208 * iowait_sdma_inc - note sdma io pending
209 * @wait: iowait structure
211 static inline void iowait_sdma_inc(struct iowait
*wait
)
213 atomic_inc(&wait
->sdma_busy
);
217 * iowait_sdma_add - add count to pending
218 * @wait: iowait structure
220 static inline void iowait_sdma_add(struct iowait
*wait
, int count
)
222 atomic_add(count
, &wait
->sdma_busy
);
226 * iowait_sdma_dec - note sdma complete
227 * @wait: iowait structure
229 static inline int iowait_sdma_dec(struct iowait
*wait
)
231 return atomic_dec_and_test(&wait
->sdma_busy
);
235 * iowait_pio_drain() - wait for pios to drain
237 * @wait: iowait structure
239 * This will delay until the iowait pios have
242 static inline void iowait_pio_drain(struct iowait
*wait
)
244 wait_event_timeout(wait
->wait_pio
,
245 !atomic_read(&wait
->pio_busy
),
250 * iowait_pio_pending() - return pio pending count
252 * @wait: iowait structure
255 static inline int iowait_pio_pending(struct iowait
*wait
)
257 return atomic_read(&wait
->pio_busy
);
261 * iowait_pio_inc - note pio pending
262 * @wait: iowait structure
264 static inline void iowait_pio_inc(struct iowait
*wait
)
266 atomic_inc(&wait
->pio_busy
);
270 * iowait_sdma_dec - note pio complete
271 * @wait: iowait structure
273 static inline int iowait_pio_dec(struct iowait
*wait
)
275 return atomic_dec_and_test(&wait
->pio_busy
);
279 * iowait_drain_wakeup() - trigger iowait_drain() waiter
281 * @wait: iowait structure
283 * This will trigger any waiters.
285 static inline void iowait_drain_wakeup(struct iowait
*wait
)
287 wake_up(&wait
->wait_dma
);
288 wake_up(&wait
->wait_pio
);
289 if (wait
->sdma_drained
)
290 wait
->sdma_drained(wait
);
294 * iowait_get_txhead() - get packet off of iowait list
296 * @wait wait struture
298 static inline struct sdma_txreq
*iowait_get_txhead(struct iowait
*wait
)
300 struct sdma_txreq
*tx
= NULL
;
302 if (!list_empty(&wait
->tx_head
)) {
303 tx
= list_first_entry(
307 list_del_init(&tx
->list
);
313 * iowait_queue - Put the iowait on a wait queue
314 * @pkts_sent: have some packets been sent before queuing?
315 * @w: the iowait struct
316 * @wait_head: the wait queue
318 * This function is called to insert an iowait struct into a
319 * wait queue after a resource (eg, sdma decriptor or pio
320 * buffer) is run out.
322 static inline void iowait_queue(bool pkts_sent
, struct iowait
*w
,
323 struct list_head
*wait_head
)
326 * To play fair, insert the iowait at the tail of the wait queue if it
327 * has already sent some packets; Otherwise, put it at the head.
330 list_add_tail(&w
->list
, wait_head
);
333 list_add(&w
->list
, wait_head
);
339 * iowait_starve_clear - clear the wait queue's starve count
340 * @pkts_sent: have some packets been sent?
341 * @w: the iowait struct
343 * This function is called to clear the starve count. If no
344 * packets have been sent, the starve count will not be cleared.
346 static inline void iowait_starve_clear(bool pkts_sent
, struct iowait
*w
)
353 * iowait_starve_find_max - Find the maximum of the starve count
354 * @w: the iowait struct
355 * @max: a variable containing the max starve count
356 * @idx: the index of the current iowait in an array
357 * @max_idx: a variable containing the array index for the
358 * iowait entry that has the max starve count
360 * This function is called to compare the starve count of a
361 * given iowait with the given max starve count. The max starve
362 * count and the index will be updated if the iowait's start
365 static inline void iowait_starve_find_max(struct iowait
*w
, u8
*max
,
366 uint idx
, uint
*max_idx
)
368 if (w
->starved_cnt
> *max
) {
369 *max
= w
->starved_cnt
;
375 * iowait_packet_queued() - determine if a packet is already built
376 * @wait: the wait structure
378 static inline bool iowait_packet_queued(struct iowait
*wait
)
380 return !list_empty(&wait
->tx_head
);