summaryrefstree
path: root/kernel/drivers/vision/dsp/dsp-util.c
blob: 82641cd5c803201cf9dca8beb0f114af0a2b5020 (plain)
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
// SPDX-License-Identifier: GPL-2.0
/*
 * Samsung Exynos SoC series dsp driver
 *
 * Copyright (c) 2019 Samsung Electronics Co., Ltd.
 *              http://www.samsung.com/
 */

#include <linux/io.h>

#include "dsp-log.h"
#include "dsp-util.h"

void dsp_util_queue_dump(struct dsp_util_queue *queue)
{
	unsigned long long kva_low, kva_high, kva;

	dsp_enter();
	dsp_notice("queue front(%u)/rear(%u)\n",
			readl(&queue->front), readl(&queue->rear));
	dsp_notice("queue data_size(%u)/data_count(%u)\n",
			readl(&queue->data_size), readl(&queue->data_count));

	kva_low = readl(&queue->kva_low);
	kva_high = readl(&queue->kva_high);
	kva = (kva_high << 32) | kva_low;

	dsp_notice("queue iova(%#x)/kva(%#llx)/size(%u)\n",
			readl(&queue->iova), kva, readl(&queue->size));
	dsp_leave();
}

int dsp_util_queue_read_count(struct dsp_util_queue *queue)
{
	dsp_check();
	return readl(&queue->data_count);
}

int dsp_util_queue_check_full(struct dsp_util_queue *queue)
{
	unsigned int count;
	unsigned int mirror_front, mirror_rear;
	unsigned int front, rear;

	dsp_check();
	count = readl(&queue->data_count);
	mirror_front = readl(&queue->front);
	mirror_rear = readl(&queue->rear);
	front = mirror_front % (count << 1);
	rear = mirror_rear % (count << 1);

	return (front == rear && mirror_front != mirror_rear);
}

int dsp_util_queue_enqueue(struct dsp_util_queue *queue, void *data,
		size_t data_size)
{
	int ret;
	unsigned int rear, mirror_rear;
	unsigned int q_data_size, q_data_count;
	unsigned long long kva_low, kva_high;
	void *kva;

	dsp_enter();
	q_data_size = readl(&queue->data_size);
	if (data_size > q_data_size) {
		ret = -EINVAL;
		dsp_err("size(%zu) can't be greater than data_size(%u) of q\n",
				data_size, q_data_size);
		goto p_err;
	}

	q_data_count = readl(&queue->data_count);
	mirror_rear = readl(&queue->rear);
	rear = mirror_rear % q_data_count;

	kva_low = readl(&queue->kva_low);
	kva_high = readl(&queue->kva_high);
	kva = (void *)((kva_high << 32) | kva_low);
	memcpy(kva + (rear * q_data_size), data, data_size);
	writel((mirror_rear + 1) % (q_data_count << 1), &queue->rear);

	dsp_leave();
	return 0;
p_err:
	return ret;
}

int dsp_util_queue_check_empty(struct dsp_util_queue *queue)
{
	dsp_check();
	return readl(&queue->front) == readl(&queue->rear);
}

int dsp_util_queue_dequeue(struct dsp_util_queue *queue, void *data,
		size_t data_size)
{
	int ret;
	unsigned int front, mirror_front;
	unsigned int q_data_size, q_data_count;
	unsigned long long kva_low, kva_high;
	void *kva;

	dsp_enter();
	q_data_size = readl(&queue->data_size);
	if (data_size > q_data_size) {
		ret = -EINVAL;
		dsp_err("size(%zu) can't be greater than data_size(%u) of q\n",
				data_size, q_data_size);
		goto p_err;
	}

	q_data_count = readl(&queue->data_count);
	mirror_front = readl(&queue->front);
	front = mirror_front % q_data_count;

	kva_low = readl(&queue->kva_low);
	kva_high = readl(&queue->kva_high);
	kva = (void *)((kva_high << 32) | kva_low);
	memcpy(data, kva + (front * q_data_size), data_size);
	writel((mirror_front + 1) % (q_data_count << 1), &queue->front);

	dsp_leave();
	return 0;
p_err:
	return ret;
}

int dsp_util_queue_init(struct dsp_util_queue *queue, unsigned int data_size,
		unsigned int queue_size, unsigned int iova,
		unsigned long long kva)
{
	int ret;

	dsp_enter();
	if (!data_size || !queue_size || !iova || !kva) {
		ret = -EINVAL;
		dsp_err("queue parameter can't be zero(%u/%u/%u/%llu)\n",
				data_size, queue_size, iova, kva);
		goto p_err;
	}

	if (data_size > queue_size) {
		ret = -EINVAL;
		dsp_err("data can't be greater than the entire queue(%u/%u)\n",
				data_size, queue_size);
		goto p_err;
	}

	writel(0, &queue->front);
	writel(0, &queue->rear);
	writel(data_size, &queue->data_size);
	writel(queue_size / data_size, &queue->data_count);
	writel(iova, &queue->iova);
	writel(queue_size, &queue->size);
	writel(kva & 0xffffffff, &queue->kva_low);
	writel(kva >> 32, &queue->kva_high);
	dsp_leave();
	return 0;
p_err:
	return ret;
}

void dsp_util_bitmap_dump(struct dsp_util_bitmap *map)
{
	dsp_enter();
	dsp_notice("bitmap[%s] dump : size(%u)/used_size(%u)/base_bit(%u)\n",
			map->name, map->bitmap_size, map->used_size,
			map->base_bit);
	print_hex_dump(KERN_NOTICE, "[Exynos][DSP][NOTICE]: bitmap raw: ",
			DUMP_PREFIX_NONE, 32, 8, map->bitmap,
			BITS_TO_LONGS(map->bitmap_size) * sizeof(long), false);
	dsp_leave();
}

int dsp_util_bitmap_set_region(struct dsp_util_bitmap *map, unsigned int size)
{
	int ret;
	unsigned long start, end, check;
	bool turn = false;

	dsp_enter();
	if (!size) {
		ret = -EINVAL;
		dsp_err("Invalid bitmap size[%s](%u)\n", map->name, size);
		goto p_err;
	}

	if (size > map->bitmap_size - map->used_size) {
		ret = -ENOMEM;
		dsp_err("Not enough bitmap[%s](%u)\n", map->name, size);
		goto p_err;
	}

	start = map->base_bit;
again:
	start = find_next_zero_bit(map->bitmap, map->bitmap_size, start);

	end = start + size - 1;
	if (end >= map->bitmap_size) {
		if (turn) {
			ret = -ENOMEM;
			dsp_err("Not enough contiguous bitmap[%s](%u)\n",
					map->name, size);
			goto p_err;
		} else {
			turn = true;
			start = 0;
			goto again;
		}
	}

	check = find_next_bit(map->bitmap, end, start);
	if (check < end) {
		start = check + 1;
		goto again;
	}

	bitmap_set(map->bitmap, start, size);
	map->base_bit = end + 1;
	map->used_size += size;

	dsp_leave();
	return start;
p_err:
	dsp_util_bitmap_dump(map);
	return ret;
}

void dsp_util_bitmap_clear_region(struct dsp_util_bitmap *map,
		unsigned int start, unsigned int size)
{
	dsp_enter();
	if ((map->bitmap_size < start + size - 1) ||
			size > map->used_size) {
		dsp_warn("Invalid clear parameter[%s](%u/%u)\n",
				map->name, start, size);
		dsp_util_bitmap_dump(map);
		return;
	}

	map->used_size -= size;
	bitmap_clear(map->bitmap, start, size);
	dsp_leave();
}

int dsp_util_bitmap_init(struct dsp_util_bitmap *map, const char *name,
		unsigned int size)
{
	int ret;

	dsp_enter();
	if (!size) {
		ret = -EINVAL;
		dsp_err("bitmap size can not be zero\n");
		goto p_err;
	}

	map->bitmap = kzalloc(BITS_TO_LONGS(size) * sizeof(long), GFP_KERNEL);
	if (!map->bitmap) {
		ret = -ENOMEM;
		dsp_err("Failed to init bitmap(%u/%lu)\n",
				size, BITS_TO_LONGS(size) * sizeof(long));
		goto p_err;
	}

	snprintf(map->name, DSP_BITMAP_NAME_LEN, "%s", name);
	map->bitmap_size = size;
	map->used_size = 0;
	map->base_bit = 0;

	dsp_leave();
	return 0;
p_err:
	return ret;
}

void dsp_util_bitmap_deinit(struct dsp_util_bitmap *map)
{
	dsp_enter();
	kfree(map->bitmap);
	dsp_leave();
}