nouveau_fence.c 5.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
/*
 * Copyright (C) 2007 Ben Skeggs.
 * All Rights Reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice (including the
 * next paragraph) shall be included in all copies or substantial
 * portions of the Software.
 *
 * 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 COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS 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 "drmP.h"
#include "drm.h"

30 31 32
#include <linux/ktime.h>
#include <linux/hrtimer.h>

33
#include "nouveau_drv.h"
34
#include "nouveau_ramht.h"
35
#include "nouveau_fence.h"
36
#include "nouveau_software.h"
37 38
#include "nouveau_dma.h"

39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
void
nouveau_fence_context_del(struct nouveau_fence_chan *fctx)
{
	struct nouveau_fence *fence, *fnext;
	spin_lock(&fctx->lock);
	list_for_each_entry_safe(fence, fnext, &fctx->pending, head) {
		if (fence->work)
			fence->work(fence->priv, false);
		fence->channel = NULL;
		list_del(&fence->head);
		nouveau_fence_unref(&fence);
	}
	spin_unlock(&fctx->lock);
}

void
nouveau_fence_context_new(struct nouveau_fence_chan *fctx)
{
	INIT_LIST_HEAD(&fctx->pending);
	spin_lock_init(&fctx->lock);
}
60 61 62 63

void
nouveau_fence_update(struct nouveau_channel *chan)
{
64
	struct drm_device *dev = chan->dev;
65 66 67
	struct nouveau_fence_priv *priv = nv_engine(dev, NVOBJ_ENGINE_FENCE);
	struct nouveau_fence_chan *fctx = chan->engctx[NVOBJ_ENGINE_FENCE];
	struct nouveau_fence *fence, *fnext;
68

69 70 71
	spin_lock(&fctx->lock);
	list_for_each_entry_safe(fence, fnext, &fctx->pending, head) {
		if (priv->read(chan) < fence->sequence)
72 73 74
			break;

		if (fence->work)
75
			fence->work(fence->priv, true);
76 77
		fence->channel = NULL;
		list_del(&fence->head);
78
		nouveau_fence_unref(&fence);
79
	}
80
	spin_unlock(&fctx->lock);
81 82 83
}

int
84
nouveau_fence_emit(struct nouveau_fence *fence, struct nouveau_channel *chan)
85
{
86
	struct drm_device *dev = chan->dev;
87 88
	struct nouveau_fence_priv *priv = nv_engine(dev, NVOBJ_ENGINE_FENCE);
	struct nouveau_fence_chan *fctx = chan->engctx[NVOBJ_ENGINE_FENCE];
89 90
	int ret;

91 92 93
	fence->channel  = chan;
	fence->timeout  = jiffies + (3 * DRM_HZ);
	fence->sequence = ++fctx->sequence;
94

95 96 97 98 99 100
	ret = priv->emit(fence);
	if (!ret) {
		kref_get(&fence->kref);
		spin_lock(&fctx->lock);
		list_add_tail(&fence->head, &fctx->pending);
		spin_unlock(&fctx->lock);
B
Ben Skeggs 已提交
101
	}
102

103
	return ret;
104 105 106
}

bool
107
nouveau_fence_done(struct nouveau_fence *fence)
108
{
109 110 111
	if (fence->channel)
		nouveau_fence_update(fence->channel);
	return !fence->channel;
112 113 114
}

int
115
nouveau_fence_wait(struct nouveau_fence *fence, bool lazy, bool intr)
116
{
117 118
	unsigned long sleep_time = NSEC_PER_MSEC / 1000;
	ktime_t t;
119 120
	int ret = 0;

121 122
	while (!nouveau_fence_done(fence)) {
		if (fence->timeout && time_after_eq(jiffies, fence->timeout)) {
123 124 125 126
			ret = -EBUSY;
			break;
		}

127 128
		__set_current_state(intr ? TASK_INTERRUPTIBLE :
					   TASK_UNINTERRUPTIBLE);
129 130 131 132 133 134 135
		if (lazy) {
			t = ktime_set(0, sleep_time);
			schedule_hrtimeout(&t, HRTIMER_MODE_REL);
			sleep_time *= 2;
			if (sleep_time > NSEC_PER_MSEC)
				sleep_time = NSEC_PER_MSEC;
		}
136 137

		if (intr && signal_pending(current)) {
B
Ben Skeggs 已提交
138
			ret = -ERESTARTSYS;
139 140 141 142 143
			break;
		}
	}

	__set_current_state(TASK_RUNNING);
144 145 146
	return ret;
}

147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
int
nouveau_fence_sync(struct nouveau_fence *fence, struct nouveau_channel *chan)
{
	struct nouveau_channel *prev = fence ? fence->channel : NULL;
	struct drm_device *dev = chan->dev;
	struct nouveau_fence_priv *priv = nv_engine(dev, NVOBJ_ENGINE_FENCE);
	int ret = 0;

	if (unlikely(prev && prev != chan && !nouveau_fence_done(fence))) {
		ret = priv->sync(fence, chan);
		if (unlikely(ret))
			ret = nouveau_fence_wait(fence, true, false);
	}

	return ret;
}

164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
static void
nouveau_fence_del(struct kref *kref)
{
	struct nouveau_fence *fence = container_of(kref, typeof(*fence), kref);
	kfree(fence);
}

void
nouveau_fence_unref(struct nouveau_fence **pfence)
{
	if (*pfence)
		kref_put(&(*pfence)->kref, nouveau_fence_del);
	*pfence = NULL;
}

struct nouveau_fence *
nouveau_fence_ref(struct nouveau_fence *fence)
{
	kref_get(&fence->kref);
	return fence;
}

int
nouveau_fence_new(struct nouveau_channel *chan, struct nouveau_fence **pfence)
{
	struct nouveau_fence *fence;
	int ret = 0;
191

192 193 194
	if (unlikely(!chan->engctx[NVOBJ_ENGINE_FENCE]))
		return -ENODEV;

195 196 197 198 199 200 201 202 203 204 205 206
	fence = kzalloc(sizeof(*fence), GFP_KERNEL);
	if (!fence)
		return -ENOMEM;
	kref_init(&fence->kref);

	if (chan) {
		ret = nouveau_fence_emit(fence, chan);
		if (ret)
			nouveau_fence_unref(&fence);
	}

	*pfence = fence;
207 208
	return ret;
}