Linux Audio

Check our new training course

Loading...
Note: File does not exist in v3.1.
  1/*
  2 * Copyright 2011 Red Hat, 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 * on the rights to use, copy, modify, merge, publish, distribute, sub
  8 * license, and/or sell copies of the Software, and to permit persons to whom
  9 * the Software is furnished to do so, subject to the following conditions:
 10 *
 11 * The above copyright notice and this permission notice (including the next
 12 * paragraph) shall be included in all copies or substantial portions of the
 13 * Software.
 14 *
 15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 17 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.  IN NO EVENT SHALL
 18 * THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
 19 * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 20 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 21 */
 22#include "qxl_drv.h"
 23#include "qxl_object.h"
 24#include <trace/events/dma_fence.h>
 25
 26/*
 27 * drawable cmd cache - allocate a bunch of VRAM pages, suballocate
 28 * into 256 byte chunks for now - gives 16 cmds per page.
 29 *
 30 * use an ida to index into the chunks?
 31 */
 32/* manage releaseables */
 33/* stack them 16 high for now -drawable object is 191 */
 34#define RELEASE_SIZE 256
 35#define RELEASES_PER_BO (4096 / RELEASE_SIZE)
 36/* put an alloc/dealloc surface cmd into one bo and round up to 128 */
 37#define SURFACE_RELEASE_SIZE 128
 38#define SURFACE_RELEASES_PER_BO (4096 / SURFACE_RELEASE_SIZE)
 39
 40static const int release_size_per_bo[] = { RELEASE_SIZE, SURFACE_RELEASE_SIZE, RELEASE_SIZE };
 41static const int releases_per_bo[] = { RELEASES_PER_BO, SURFACE_RELEASES_PER_BO, RELEASES_PER_BO };
 42
 43static const char *qxl_get_driver_name(struct dma_fence *fence)
 44{
 45	return "qxl";
 46}
 47
 48static const char *qxl_get_timeline_name(struct dma_fence *fence)
 49{
 50	return "release";
 51}
 52
 53static bool qxl_nop_signaling(struct dma_fence *fence)
 54{
 55	/* fences are always automatically signaled, so just pretend we did this.. */
 56	return true;
 57}
 58
 59static long qxl_fence_wait(struct dma_fence *fence, bool intr,
 60			   signed long timeout)
 61{
 62	struct qxl_device *qdev;
 63	struct qxl_release *release;
 64	int count = 0, sc = 0;
 65	bool have_drawable_releases;
 66	unsigned long cur, end = jiffies + timeout;
 67
 68	qdev = container_of(fence->lock, struct qxl_device, release_lock);
 69	release = container_of(fence, struct qxl_release, base);
 70	have_drawable_releases = release->type == QXL_RELEASE_DRAWABLE;
 71
 72retry:
 73	sc++;
 74
 75	if (dma_fence_is_signaled(fence))
 76		goto signaled;
 77
 78	qxl_io_notify_oom(qdev);
 79
 80	for (count = 0; count < 11; count++) {
 81		if (!qxl_queue_garbage_collect(qdev, true))
 82			break;
 83
 84		if (dma_fence_is_signaled(fence))
 85			goto signaled;
 86	}
 87
 88	if (dma_fence_is_signaled(fence))
 89		goto signaled;
 90
 91	if (have_drawable_releases || sc < 4) {
 92		if (sc > 2)
 93			/* back off */
 94			usleep_range(500, 1000);
 95
 96		if (time_after(jiffies, end))
 97			return 0;
 98
 99		if (have_drawable_releases && sc > 300) {
100			DMA_FENCE_WARN(fence, "failed to wait on release %llu "
101				       "after spincount %d\n",
102				       fence->context & ~0xf0000000, sc);
103			goto signaled;
104		}
105		goto retry;
106	}
107	/*
108	 * yeah, original sync_obj_wait gave up after 3 spins when
109	 * have_drawable_releases is not set.
110	 */
111
112signaled:
113	cur = jiffies;
114	if (time_after(cur, end))
115		return 0;
116	return end - cur;
117}
118
119static const struct dma_fence_ops qxl_fence_ops = {
120	.get_driver_name = qxl_get_driver_name,
121	.get_timeline_name = qxl_get_timeline_name,
122	.enable_signaling = qxl_nop_signaling,
123	.wait = qxl_fence_wait,
124};
125
126static int
127qxl_release_alloc(struct qxl_device *qdev, int type,
128		  struct qxl_release **ret)
129{
130	struct qxl_release *release;
131	int handle;
132	size_t size = sizeof(*release);
133
134	release = kmalloc(size, GFP_KERNEL);
135	if (!release) {
136		DRM_ERROR("Out of memory\n");
137		return -ENOMEM;
138	}
139	release->base.ops = NULL;
140	release->type = type;
141	release->release_offset = 0;
142	release->surface_release_id = 0;
143	INIT_LIST_HEAD(&release->bos);
144
145	idr_preload(GFP_KERNEL);
146	spin_lock(&qdev->release_idr_lock);
147	handle = idr_alloc(&qdev->release_idr, release, 1, 0, GFP_NOWAIT);
148	release->base.seqno = ++qdev->release_seqno;
149	spin_unlock(&qdev->release_idr_lock);
150	idr_preload_end();
151	if (handle < 0) {
152		kfree(release);
153		*ret = NULL;
154		return handle;
155	}
156	*ret = release;
157	DRM_DEBUG_DRIVER("allocated release %d\n", handle);
158	release->id = handle;
159	return handle;
160}
161
162static void
163qxl_release_free_list(struct qxl_release *release)
164{
165	while (!list_empty(&release->bos)) {
166		struct qxl_bo_list *entry;
167		struct qxl_bo *bo;
168
169		entry = container_of(release->bos.next,
170				     struct qxl_bo_list, tv.head);
171		bo = to_qxl_bo(entry->tv.bo);
172		qxl_bo_unref(&bo);
173		list_del(&entry->tv.head);
174		kfree(entry);
175	}
176	release->release_bo = NULL;
177}
178
179void
180qxl_release_free(struct qxl_device *qdev,
181		 struct qxl_release *release)
182{
183	DRM_DEBUG_DRIVER("release %d, type %d\n", release->id, release->type);
184
185	if (release->surface_release_id)
186		qxl_surface_id_dealloc(qdev, release->surface_release_id);
187
188	spin_lock(&qdev->release_idr_lock);
189	idr_remove(&qdev->release_idr, release->id);
190	spin_unlock(&qdev->release_idr_lock);
191
192	if (release->base.ops) {
193		WARN_ON(list_empty(&release->bos));
194		qxl_release_free_list(release);
195
196		dma_fence_signal(&release->base);
197		dma_fence_put(&release->base);
198	} else {
199		qxl_release_free_list(release);
200		kfree(release);
201	}
202}
203
204static int qxl_release_bo_alloc(struct qxl_device *qdev,
205				struct qxl_bo **bo)
206{
207	/* pin releases bo's they are too messy to evict */
208	return qxl_bo_create(qdev, PAGE_SIZE, false, true,
209			     QXL_GEM_DOMAIN_VRAM, NULL, bo);
210}
211
212int qxl_release_list_add(struct qxl_release *release, struct qxl_bo *bo)
213{
214	struct qxl_bo_list *entry;
215
216	list_for_each_entry(entry, &release->bos, tv.head) {
217		if (entry->tv.bo == &bo->tbo)
218			return 0;
219	}
220
221	entry = kmalloc(sizeof(struct qxl_bo_list), GFP_KERNEL);
222	if (!entry)
223		return -ENOMEM;
224
225	qxl_bo_ref(bo);
226	entry->tv.bo = &bo->tbo;
227	entry->tv.shared = false;
228	list_add_tail(&entry->tv.head, &release->bos);
229	return 0;
230}
231
232static int qxl_release_validate_bo(struct qxl_bo *bo)
233{
234	struct ttm_operation_ctx ctx = { true, false };
235	int ret;
236
237	if (!bo->pin_count) {
238		qxl_ttm_placement_from_domain(bo, bo->type, false);
239		ret = ttm_bo_validate(&bo->tbo, &bo->placement, &ctx);
240		if (ret)
241			return ret;
242	}
243
244	ret = reservation_object_reserve_shared(bo->tbo.resv);
245	if (ret)
246		return ret;
247
248	/* allocate a surface for reserved + validated buffers */
249	ret = qxl_bo_check_id(bo->gem_base.dev->dev_private, bo);
250	if (ret)
251		return ret;
252	return 0;
253}
254
255int qxl_release_reserve_list(struct qxl_release *release, bool no_intr)
256{
257	int ret;
258	struct qxl_bo_list *entry;
259
260	/* if only one object on the release its the release itself
261	   since these objects are pinned no need to reserve */
262	if (list_is_singular(&release->bos))
263		return 0;
264
265	ret = ttm_eu_reserve_buffers(&release->ticket, &release->bos,
266				     !no_intr, NULL);
267	if (ret)
268		return ret;
269
270	list_for_each_entry(entry, &release->bos, tv.head) {
271		struct qxl_bo *bo = to_qxl_bo(entry->tv.bo);
272
273		ret = qxl_release_validate_bo(bo);
274		if (ret) {
275			ttm_eu_backoff_reservation(&release->ticket, &release->bos);
276			return ret;
277		}
278	}
279	return 0;
280}
281
282void qxl_release_backoff_reserve_list(struct qxl_release *release)
283{
284	/* if only one object on the release its the release itself
285	   since these objects are pinned no need to reserve */
286	if (list_is_singular(&release->bos))
287		return;
288
289	ttm_eu_backoff_reservation(&release->ticket, &release->bos);
290}
291
292
293int qxl_alloc_surface_release_reserved(struct qxl_device *qdev,
294				       enum qxl_surface_cmd_type surface_cmd_type,
295				       struct qxl_release *create_rel,
296				       struct qxl_release **release)
297{
298	if (surface_cmd_type == QXL_SURFACE_CMD_DESTROY && create_rel) {
299		int idr_ret;
300		struct qxl_bo *bo;
301		union qxl_release_info *info;
302
303		/* stash the release after the create command */
304		idr_ret = qxl_release_alloc(qdev, QXL_RELEASE_SURFACE_CMD, release);
305		if (idr_ret < 0)
306			return idr_ret;
307		bo = create_rel->release_bo;
308
309		(*release)->release_bo = bo;
310		(*release)->release_offset = create_rel->release_offset + 64;
311
312		qxl_release_list_add(*release, bo);
313
314		info = qxl_release_map(qdev, *release);
315		info->id = idr_ret;
316		qxl_release_unmap(qdev, *release, info);
317		return 0;
318	}
319
320	return qxl_alloc_release_reserved(qdev, sizeof(struct qxl_surface_cmd),
321					 QXL_RELEASE_SURFACE_CMD, release, NULL);
322}
323
324int qxl_alloc_release_reserved(struct qxl_device *qdev, unsigned long size,
325				       int type, struct qxl_release **release,
326				       struct qxl_bo **rbo)
327{
328	struct qxl_bo *bo;
329	int idr_ret;
330	int ret = 0;
331	union qxl_release_info *info;
332	int cur_idx;
333
334	if (type == QXL_RELEASE_DRAWABLE)
335		cur_idx = 0;
336	else if (type == QXL_RELEASE_SURFACE_CMD)
337		cur_idx = 1;
338	else if (type == QXL_RELEASE_CURSOR_CMD)
339		cur_idx = 2;
340	else {
341		DRM_ERROR("got illegal type: %d\n", type);
342		return -EINVAL;
343	}
344
345	idr_ret = qxl_release_alloc(qdev, type, release);
346	if (idr_ret < 0) {
347		if (rbo)
348			*rbo = NULL;
349		return idr_ret;
350	}
351
352	mutex_lock(&qdev->release_mutex);
353	if (qdev->current_release_bo_offset[cur_idx] + 1 >= releases_per_bo[cur_idx]) {
354		qxl_bo_unref(&qdev->current_release_bo[cur_idx]);
355		qdev->current_release_bo_offset[cur_idx] = 0;
356		qdev->current_release_bo[cur_idx] = NULL;
357	}
358	if (!qdev->current_release_bo[cur_idx]) {
359		ret = qxl_release_bo_alloc(qdev, &qdev->current_release_bo[cur_idx]);
360		if (ret) {
361			mutex_unlock(&qdev->release_mutex);
362			qxl_release_free(qdev, *release);
363			return ret;
364		}
365	}
366
367	bo = qxl_bo_ref(qdev->current_release_bo[cur_idx]);
368
369	(*release)->release_bo = bo;
370	(*release)->release_offset = qdev->current_release_bo_offset[cur_idx] * release_size_per_bo[cur_idx];
371	qdev->current_release_bo_offset[cur_idx]++;
372
373	if (rbo)
374		*rbo = bo;
375
376	mutex_unlock(&qdev->release_mutex);
377
378	ret = qxl_release_list_add(*release, bo);
379	qxl_bo_unref(&bo);
380	if (ret) {
381		qxl_release_free(qdev, *release);
382		return ret;
383	}
384
385	info = qxl_release_map(qdev, *release);
386	info->id = idr_ret;
387	qxl_release_unmap(qdev, *release, info);
388
389	return ret;
390}
391
392struct qxl_release *qxl_release_from_id_locked(struct qxl_device *qdev,
393						   uint64_t id)
394{
395	struct qxl_release *release;
396
397	spin_lock(&qdev->release_idr_lock);
398	release = idr_find(&qdev->release_idr, id);
399	spin_unlock(&qdev->release_idr_lock);
400	if (!release) {
401		DRM_ERROR("failed to find id in release_idr\n");
402		return NULL;
403	}
404
405	return release;
406}
407
408union qxl_release_info *qxl_release_map(struct qxl_device *qdev,
409					struct qxl_release *release)
410{
411	void *ptr;
412	union qxl_release_info *info;
413	struct qxl_bo *bo = release->release_bo;
414
415	ptr = qxl_bo_kmap_atomic_page(qdev, bo, release->release_offset & PAGE_MASK);
416	if (!ptr)
417		return NULL;
418	info = ptr + (release->release_offset & ~PAGE_MASK);
419	return info;
420}
421
422void qxl_release_unmap(struct qxl_device *qdev,
423		       struct qxl_release *release,
424		       union qxl_release_info *info)
425{
426	struct qxl_bo *bo = release->release_bo;
427	void *ptr;
428
429	ptr = ((void *)info) - (release->release_offset & ~PAGE_MASK);
430	qxl_bo_kunmap_atomic_page(qdev, bo, ptr);
431}
432
433void qxl_release_fence_buffer_objects(struct qxl_release *release)
434{
435	struct ttm_buffer_object *bo;
436	struct ttm_bo_global *glob;
437	struct ttm_bo_device *bdev;
438	struct ttm_bo_driver *driver;
439	struct qxl_bo *qbo;
440	struct ttm_validate_buffer *entry;
441	struct qxl_device *qdev;
442
443	/* if only one object on the release its the release itself
444	   since these objects are pinned no need to reserve */
445	if (list_is_singular(&release->bos) || list_empty(&release->bos))
446		return;
447
448	bo = list_first_entry(&release->bos, struct ttm_validate_buffer, head)->bo;
449	bdev = bo->bdev;
450	qdev = container_of(bdev, struct qxl_device, mman.bdev);
451
452	/*
453	 * Since we never really allocated a context and we don't want to conflict,
454	 * set the highest bits. This will break if we really allow exporting of dma-bufs.
455	 */
456	dma_fence_init(&release->base, &qxl_fence_ops, &qdev->release_lock,
457		       release->id | 0xf0000000, release->base.seqno);
458	trace_dma_fence_emit(&release->base);
459
460	driver = bdev->driver;
461	glob = bdev->glob;
462
463	spin_lock(&glob->lru_lock);
464
465	list_for_each_entry(entry, &release->bos, head) {
466		bo = entry->bo;
467		qbo = to_qxl_bo(bo);
468
469		reservation_object_add_shared_fence(bo->resv, &release->base);
470		ttm_bo_add_to_lru(bo);
471		reservation_object_unlock(bo->resv);
472	}
473	spin_unlock(&glob->lru_lock);
474	ww_acquire_fini(&release->ticket);
475}
476