Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
tjh.dev
kernel
os
linux
1/*
2 * Copyright 2014 Advanced Micro Devices, Inc.
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
21 *
22 */
23
24#include <linux/slab.h>
25#include <linux/list.h>
26#include "kfd_device_queue_manager.h"
27#include "kfd_priv.h"
28#include "kfd_kernel_queue.h"
29
30static inline struct process_queue_node *get_queue_by_qid(
31 struct process_queue_manager *pqm, unsigned int qid)
32{
33 struct process_queue_node *pqn;
34
35 BUG_ON(!pqm);
36
37 list_for_each_entry(pqn, &pqm->queues, process_queue_list) {
38 if (pqn->q && pqn->q->properties.queue_id == qid)
39 return pqn;
40 if (pqn->kq && pqn->kq->queue->properties.queue_id == qid)
41 return pqn;
42 }
43
44 return NULL;
45}
46
47static int find_available_queue_slot(struct process_queue_manager *pqm,
48 unsigned int *qid)
49{
50 unsigned long found;
51
52 BUG_ON(!pqm || !qid);
53
54 pr_debug("kfd: in %s\n", __func__);
55
56 found = find_first_zero_bit(pqm->queue_slot_bitmap,
57 KFD_MAX_NUM_OF_QUEUES_PER_PROCESS);
58
59 pr_debug("kfd: the new slot id %lu\n", found);
60
61 if (found >= KFD_MAX_NUM_OF_QUEUES_PER_PROCESS) {
62 pr_info("amdkfd: Can not open more queues for process with pasid %d\n",
63 pqm->process->pasid);
64 return -ENOMEM;
65 }
66
67 set_bit(found, pqm->queue_slot_bitmap);
68 *qid = found;
69
70 return 0;
71}
72
73int pqm_init(struct process_queue_manager *pqm, struct kfd_process *p)
74{
75 BUG_ON(!pqm);
76
77 INIT_LIST_HEAD(&pqm->queues);
78 pqm->queue_slot_bitmap =
79 kzalloc(DIV_ROUND_UP(KFD_MAX_NUM_OF_QUEUES_PER_PROCESS,
80 BITS_PER_BYTE), GFP_KERNEL);
81 if (pqm->queue_slot_bitmap == NULL)
82 return -ENOMEM;
83 pqm->process = p;
84
85 return 0;
86}
87
88void pqm_uninit(struct process_queue_manager *pqm)
89{
90 int retval;
91 struct process_queue_node *pqn, *next;
92
93 BUG_ON(!pqm);
94
95 pr_debug("In func %s\n", __func__);
96
97 list_for_each_entry_safe(pqn, next, &pqm->queues, process_queue_list) {
98 retval = pqm_destroy_queue(
99 pqm,
100 (pqn->q != NULL) ?
101 pqn->q->properties.queue_id :
102 pqn->kq->queue->properties.queue_id);
103
104 if (retval != 0) {
105 pr_err("kfd: failed to destroy queue\n");
106 return;
107 }
108 }
109 kfree(pqm->queue_slot_bitmap);
110 pqm->queue_slot_bitmap = NULL;
111}
112
113static int create_cp_queue(struct process_queue_manager *pqm,
114 struct kfd_dev *dev, struct queue **q,
115 struct queue_properties *q_properties,
116 struct file *f, unsigned int qid)
117{
118 int retval;
119
120 retval = 0;
121
122 /* Doorbell initialized in user space*/
123 q_properties->doorbell_ptr = NULL;
124
125 q_properties->doorbell_off =
126 kfd_queue_id_to_doorbell(dev, pqm->process, qid);
127
128 /* let DQM handle it*/
129 q_properties->vmid = 0;
130 q_properties->queue_id = qid;
131 q_properties->type = KFD_QUEUE_TYPE_COMPUTE;
132
133 retval = init_queue(q, *q_properties);
134 if (retval != 0)
135 goto err_init_queue;
136
137 (*q)->device = dev;
138 (*q)->process = pqm->process;
139
140 pr_debug("kfd: PQM After init queue");
141
142 return retval;
143
144err_init_queue:
145 return retval;
146}
147
148int pqm_create_queue(struct process_queue_manager *pqm,
149 struct kfd_dev *dev,
150 struct file *f,
151 struct queue_properties *properties,
152 unsigned int flags,
153 enum kfd_queue_type type,
154 unsigned int *qid)
155{
156 int retval;
157 struct kfd_process_device *pdd;
158 struct queue_properties q_properties;
159 struct queue *q;
160 struct process_queue_node *pqn;
161 struct kernel_queue *kq;
162
163 BUG_ON(!pqm || !dev || !properties || !qid);
164
165 memset(&q_properties, 0, sizeof(struct queue_properties));
166 memcpy(&q_properties, properties, sizeof(struct queue_properties));
167 q = NULL;
168 kq = NULL;
169
170 pdd = kfd_get_process_device_data(dev, pqm->process, 1);
171 BUG_ON(!pdd);
172
173 retval = find_available_queue_slot(pqm, qid);
174 if (retval != 0)
175 return retval;
176
177 if (list_empty(&pqm->queues)) {
178 pdd->qpd.pqm = pqm;
179 dev->dqm->register_process(dev->dqm, &pdd->qpd);
180 }
181
182 pqn = kzalloc(sizeof(struct process_queue_node), GFP_KERNEL);
183 if (!pqn) {
184 retval = -ENOMEM;
185 goto err_allocate_pqn;
186 }
187
188 switch (type) {
189 case KFD_QUEUE_TYPE_COMPUTE:
190 /* check if there is over subscription */
191 if ((sched_policy == KFD_SCHED_POLICY_HWS_NO_OVERSUBSCRIPTION) &&
192 ((dev->dqm->processes_count >= VMID_PER_DEVICE) ||
193 (dev->dqm->queue_count >= PIPE_PER_ME_CP_SCHEDULING * QUEUES_PER_PIPE))) {
194 pr_err("kfd: over-subscription is not allowed in radeon_kfd.sched_policy == 1\n");
195 retval = -EPERM;
196 goto err_create_queue;
197 }
198
199 retval = create_cp_queue(pqm, dev, &q, &q_properties, f, *qid);
200 if (retval != 0)
201 goto err_create_queue;
202 pqn->q = q;
203 pqn->kq = NULL;
204 retval = dev->dqm->create_queue(dev->dqm, q, &pdd->qpd,
205 &q->properties.vmid);
206 pr_debug("DQM returned %d for create_queue\n", retval);
207 print_queue(q);
208 break;
209 case KFD_QUEUE_TYPE_DIQ:
210 kq = kernel_queue_init(dev, KFD_QUEUE_TYPE_DIQ);
211 if (kq == NULL) {
212 retval = -ENOMEM;
213 goto err_create_queue;
214 }
215 kq->queue->properties.queue_id = *qid;
216 pqn->kq = kq;
217 pqn->q = NULL;
218 retval = dev->dqm->create_kernel_queue(dev->dqm, kq, &pdd->qpd);
219 break;
220 default:
221 BUG();
222 break;
223 }
224
225 if (retval != 0) {
226 pr_debug("Error dqm create queue\n");
227 goto err_create_queue;
228 }
229
230 pr_debug("kfd: PQM After DQM create queue\n");
231
232 list_add(&pqn->process_queue_list, &pqm->queues);
233
234 if (q) {
235 *properties = q->properties;
236 pr_debug("kfd: PQM done creating queue\n");
237 print_queue_properties(properties);
238 }
239
240 return retval;
241
242err_create_queue:
243 kfree(pqn);
244err_allocate_pqn:
245 /* check if queues list is empty unregister process from device */
246 clear_bit(*qid, pqm->queue_slot_bitmap);
247 if (list_empty(&pqm->queues))
248 dev->dqm->unregister_process(dev->dqm, &pdd->qpd);
249 return retval;
250}
251
252int pqm_destroy_queue(struct process_queue_manager *pqm, unsigned int qid)
253{
254 struct process_queue_node *pqn;
255 struct kfd_process_device *pdd;
256 struct device_queue_manager *dqm;
257 struct kfd_dev *dev;
258 int retval;
259
260 dqm = NULL;
261
262 BUG_ON(!pqm);
263 retval = 0;
264
265 pr_debug("kfd: In Func %s\n", __func__);
266
267 pqn = get_queue_by_qid(pqm, qid);
268 if (pqn == NULL) {
269 pr_err("kfd: queue id does not match any known queue\n");
270 return -EINVAL;
271 }
272
273 dev = NULL;
274 if (pqn->kq)
275 dev = pqn->kq->dev;
276 if (pqn->q)
277 dev = pqn->q->device;
278 BUG_ON(!dev);
279
280 pdd = kfd_get_process_device_data(dev, pqm->process, 1);
281 BUG_ON(!pdd);
282
283 if (pqn->kq) {
284 /* destroy kernel queue (DIQ) */
285 dqm = pqn->kq->dev->dqm;
286 dqm->destroy_kernel_queue(dqm, pqn->kq, &pdd->qpd);
287 kernel_queue_uninit(pqn->kq);
288 }
289
290 if (pqn->q) {
291 dqm = pqn->q->device->dqm;
292 retval = dqm->destroy_queue(dqm, &pdd->qpd, pqn->q);
293 if (retval != 0)
294 return retval;
295
296 uninit_queue(pqn->q);
297 }
298
299 list_del(&pqn->process_queue_list);
300 kfree(pqn);
301 clear_bit(qid, pqm->queue_slot_bitmap);
302
303 if (list_empty(&pqm->queues))
304 dqm->unregister_process(dqm, &pdd->qpd);
305
306 return retval;
307}
308
309int pqm_update_queue(struct process_queue_manager *pqm, unsigned int qid,
310 struct queue_properties *p)
311{
312 int retval;
313 struct process_queue_node *pqn;
314
315 BUG_ON(!pqm);
316
317 pqn = get_queue_by_qid(pqm, qid);
318 if (!pqn) {
319 pr_debug("amdkfd: No queue %d exists for update operation\n",
320 qid);
321 return -EFAULT;
322 }
323
324 pqn->q->properties.queue_address = p->queue_address;
325 pqn->q->properties.queue_size = p->queue_size;
326 pqn->q->properties.queue_percent = p->queue_percent;
327 pqn->q->properties.priority = p->priority;
328
329 retval = pqn->q->device->dqm->update_queue(pqn->q->device->dqm, pqn->q);
330 if (retval != 0)
331 return retval;
332
333 return 0;
334}
335
336static __attribute__((unused)) struct kernel_queue *pqm_get_kernel_queue(
337 struct process_queue_manager *pqm,
338 unsigned int qid)
339{
340 struct process_queue_node *pqn;
341
342 BUG_ON(!pqm);
343
344 pqn = get_queue_by_qid(pqm, qid);
345 if (pqn && pqn->kq)
346 return pqn->kq;
347
348 return NULL;
349}
350
351