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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
|
/*
* Copyright (C) 2019 Alyssa Rosenzweig
* Copyright (C) 2014-2017 Broadcom
*
* 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 AUTHORS OR COPYRIGHT HOLDERS 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 <assert.h>
#include "pan_context.h"
#include "util/hash_table.h"
#include "util/ralloc.h"
#include "util/u_format.h"
#include "util/u_pack_color.h"
struct panfrost_job *
panfrost_create_job(struct panfrost_context *ctx)
{
struct panfrost_job *job = rzalloc(ctx, struct panfrost_job);
job->ctx = ctx;
job->bos = _mesa_set_create(job,
_mesa_hash_pointer,
_mesa_key_pointer_equal);
job->minx = job->miny = ~0;
job->maxx = job->maxy = 0;
job->transient_offset = 0;
util_dynarray_init(&job->headers, job);
util_dynarray_init(&job->gpu_headers, job);
util_dynarray_init(&job->transient_indices, job);
return job;
}
void
panfrost_free_job(struct panfrost_context *ctx, struct panfrost_job *job)
{
if (!job)
return;
set_foreach(job->bos, entry) {
struct panfrost_bo *bo = (struct panfrost_bo *)entry->key;
panfrost_bo_unreference(ctx->base.screen, bo);
}
/* Free up the transient BOs we're sitting on */
struct panfrost_screen *screen = pan_screen(ctx->base.screen);
util_dynarray_foreach(&job->transient_indices, unsigned, index) {
/* Mark it free */
BITSET_SET(screen->free_transient, *index);
}
/* Unreference the polygon list */
panfrost_bo_unreference(ctx->base.screen, job->polygon_list);
_mesa_hash_table_remove_key(ctx->jobs, &job->key);
if (ctx->job == job)
ctx->job = NULL;
ralloc_free(job);
}
struct panfrost_job *
panfrost_get_job(struct panfrost_context *ctx,
struct pipe_surface **cbufs, struct pipe_surface *zsbuf)
{
/* Lookup the job first */
struct panfrost_job_key key = {
.cbufs = {
cbufs[0],
cbufs[1],
cbufs[2],
cbufs[3],
},
.zsbuf = zsbuf
};
struct hash_entry *entry = _mesa_hash_table_search(ctx->jobs, &key);
if (entry)
return entry->data;
/* Otherwise, let's create a job */
struct panfrost_job *job = panfrost_create_job(ctx);
/* Save the created job */
memcpy(&job->key, &key, sizeof(key));
_mesa_hash_table_insert(ctx->jobs, &job->key, job);
return job;
}
/* Get the job corresponding to the FBO we're currently rendering into */
struct panfrost_job *
panfrost_get_job_for_fbo(struct panfrost_context *ctx)
{
/* If we're wallpapering, we special case to workaround
* u_blitter abuse */
if (ctx->wallpaper_batch)
return ctx->wallpaper_batch;
/* If we already began rendering, use that */
if (ctx->job) {
assert(ctx->job->key.zsbuf == ctx->pipe_framebuffer.zsbuf &&
!memcmp(ctx->job->key.cbufs,
ctx->pipe_framebuffer.cbufs,
sizeof(ctx->job->key.cbufs)));
return ctx->job;
}
/* If not, look up the job */
struct pipe_surface **cbufs = ctx->pipe_framebuffer.cbufs;
struct pipe_surface *zsbuf = ctx->pipe_framebuffer.zsbuf;
struct panfrost_job *job = panfrost_get_job(ctx, cbufs, zsbuf);
/* Set this job as the current FBO job. Will be reset when updating the
* FB state and when submitting or releasing a job.
*/
ctx->job = job;
return job;
}
void
panfrost_job_add_bo(struct panfrost_job *job, struct panfrost_bo *bo)
{
if (!bo)
return;
if (_mesa_set_search(job->bos, bo))
return;
panfrost_bo_reference(bo);
_mesa_set_add(job->bos, bo);
}
/* Returns the polygon list's GPU address if available, or otherwise allocates
* the polygon list. It's perfectly fast to use allocate/free BO directly,
* since we'll hit the BO cache and this is one-per-batch anyway. */
mali_ptr
panfrost_job_get_polygon_list(struct panfrost_job *batch, unsigned size)
{
if (batch->polygon_list) {
assert(batch->polygon_list->size >= size);
} else {
struct panfrost_screen *screen = pan_screen(batch->ctx->base.screen);
/* Create the BO as invisible, as there's no reason to map */
batch->polygon_list = panfrost_drm_create_bo(screen,
size, PAN_ALLOCATE_INVISIBLE);
}
return batch->polygon_list->gpu;
}
void
panfrost_flush_jobs_writing_resource(struct panfrost_context *panfrost,
struct pipe_resource *prsc)
{
#if 0
struct hash_entry *entry = _mesa_hash_table_search(panfrost->write_jobs,
prsc);
if (entry) {
struct panfrost_job *job = entry->data;
panfrost_job_submit(panfrost, job);
}
#endif
/* TODO stub */
}
void
panfrost_job_submit(struct panfrost_context *ctx, struct panfrost_job *job)
{
int ret;
assert(job);
panfrost_scoreboard_link_batch(job);
bool has_draws = job->last_job.gpu;
bool is_scanout = panfrost_is_scanout(ctx);
ret = panfrost_drm_submit_vs_fs_job(ctx, has_draws, is_scanout);
if (ret)
fprintf(stderr, "panfrost_job_submit failed: %d\n", ret);
/* The job has been submitted, let's invalidate the current FBO job
* cache.
*/
assert(!ctx->job || job == ctx->job);
ctx->job = NULL;
/* Remove the job from the ctx->jobs set so that future
* panfrost_get_job() calls don't see it.
* We must reset the job key to avoid removing another valid entry when
* the job is freed.
*/
_mesa_hash_table_remove_key(ctx->jobs, &job->key);
memset(&job->key, 0, sizeof(job->key));
}
void
panfrost_job_set_requirements(struct panfrost_context *ctx,
struct panfrost_job *job)
{
if (ctx->rasterizer && ctx->rasterizer->base.multisample)
job->requirements |= PAN_REQ_MSAA;
if (ctx->depth_stencil && ctx->depth_stencil->depth.writemask)
job->requirements |= PAN_REQ_DEPTH_WRITE;
}
/* Helper to smear a 32-bit color across 128-bit components */
static void
pan_pack_color_32(uint32_t *packed, uint32_t v)
{
for (unsigned i = 0; i < 4; ++i)
packed[i] = v;
}
static void
pan_pack_color_64(uint32_t *packed, uint32_t lo, uint32_t hi)
{
for (unsigned i = 0; i < 4; i += 2) {
packed[i + 0] = lo;
packed[i + 1] = hi;
}
}
static void
pan_pack_color(uint32_t *packed, const union pipe_color_union *color, enum pipe_format format)
{
/* Alpha magicked to 1.0 if there is no alpha */
bool has_alpha = util_format_has_alpha(format);
float clear_alpha = has_alpha ? color->f[3] : 1.0f;
/* Packed color depends on the framebuffer format */
const struct util_format_description *desc =
util_format_description(format);
if (util_format_is_rgba8_variant(desc)) {
pan_pack_color_32(packed,
(float_to_ubyte(clear_alpha) << 24) |
(float_to_ubyte(color->f[2]) << 16) |
(float_to_ubyte(color->f[1]) << 8) |
(float_to_ubyte(color->f[0]) << 0));
} else if (format == PIPE_FORMAT_B5G6R5_UNORM) {
/* First, we convert the components to R5, G6, B5 separately */
unsigned r5 = CLAMP(color->f[0], 0.0, 1.0) * 31.0;
unsigned g6 = CLAMP(color->f[1], 0.0, 1.0) * 63.0;
unsigned b5 = CLAMP(color->f[2], 0.0, 1.0) * 31.0;
/* Then we pack into a sparse u32. TODO: Why these shifts? */
pan_pack_color_32(packed, (b5 << 25) | (g6 << 14) | (r5 << 5));
} else if (format == PIPE_FORMAT_B4G4R4A4_UNORM) {
/* We scale the components against 0xF0 (=240.0), rather than 0xFF */
unsigned r4 = CLAMP(color->f[0], 0.0, 1.0) * 240.0;
unsigned g4 = CLAMP(color->f[1], 0.0, 1.0) * 240.0;
unsigned b4 = CLAMP(color->f[2], 0.0, 1.0) * 240.0;
unsigned a4 = CLAMP(clear_alpha, 0.0, 1.0) * 240.0;
/* Pack on *byte* intervals */
pan_pack_color_32(packed, (a4 << 24) | (b4 << 16) | (g4 << 8) | r4);
} else if (format == PIPE_FORMAT_B5G5R5A1_UNORM) {
/* Scale as expected but shift oddly */
unsigned r5 = round(CLAMP(color->f[0], 0.0, 1.0)) * 31.0;
unsigned g5 = round(CLAMP(color->f[1], 0.0, 1.0)) * 31.0;
unsigned b5 = round(CLAMP(color->f[2], 0.0, 1.0)) * 31.0;
unsigned a1 = round(CLAMP(clear_alpha, 0.0, 1.0)) * 1.0;
pan_pack_color_32(packed, (a1 << 31) | (b5 << 25) | (g5 << 15) | (r5 << 5));
} else {
/* Try Gallium's generic default path. Doesn't work for all
* formats but it's a good guess. */
union util_color out;
if (util_format_is_pure_integer(format)) {
memcpy(out.ui, color->ui, 16);
} else {
util_pack_color(color->f, format, &out);
}
unsigned size = util_format_get_blocksize(format);
if (size == 1) {
unsigned b = out.ui[0];
unsigned s = b | (b << 8);
pan_pack_color_32(packed, s | (s << 16));
} else if (size == 2)
pan_pack_color_32(packed, out.ui[0] | (out.ui[0] << 16));
else if (size == 4)
pan_pack_color_32(packed, out.ui[0]);
else if (size == 8)
pan_pack_color_64(packed, out.ui[0], out.ui[1]);
else if (size == 16)
memcpy(packed, out.ui, 16);
else
unreachable("Unknown generic format size packing clear colour");
}
}
void
panfrost_job_clear(struct panfrost_context *ctx,
struct panfrost_job *job,
unsigned buffers,
const union pipe_color_union *color,
double depth, unsigned stencil)
{
if (buffers & PIPE_CLEAR_COLOR) {
for (unsigned i = 0; i < PIPE_MAX_COLOR_BUFS; ++i) {
if (!(buffers & (PIPE_CLEAR_COLOR0 << i)))
continue;
enum pipe_format format = ctx->pipe_framebuffer.cbufs[i]->format;
pan_pack_color(job->clear_color[i], color, format);
}
}
if (buffers & PIPE_CLEAR_DEPTH) {
job->clear_depth = depth;
}
if (buffers & PIPE_CLEAR_STENCIL) {
job->clear_stencil = stencil;
}
job->clear |= buffers;
/* Clearing affects the entire framebuffer (by definition -- this is
* the Gallium clear callback, which clears the whole framebuffer. If
* the scissor test were enabled from the GL side, the state tracker
* would emit a quad instead and we wouldn't go down this code path) */
panfrost_job_union_scissor(job, 0, 0,
ctx->pipe_framebuffer.width,
ctx->pipe_framebuffer.height);
}
void
panfrost_flush_jobs_reading_resource(struct panfrost_context *panfrost,
struct pipe_resource *prsc)
{
struct panfrost_resource *rsc = pan_resource(prsc);
panfrost_flush_jobs_writing_resource(panfrost, prsc);
hash_table_foreach(panfrost->jobs, entry) {
struct panfrost_job *job = entry->data;
if (_mesa_set_search(job->bos, rsc->bo)) {
printf("TODO: submit job for flush\n");
//panfrost_job_submit(panfrost, job);
continue;
}
}
}
static bool
panfrost_job_compare(const void *a, const void *b)
{
return memcmp(a, b, sizeof(struct panfrost_job_key)) == 0;
}
static uint32_t
panfrost_job_hash(const void *key)
{
return _mesa_hash_data(key, sizeof(struct panfrost_job_key));
}
/* Given a new bounding rectangle (scissor), let the job cover the union of the
* new and old bounding rectangles */
void
panfrost_job_union_scissor(struct panfrost_job *job,
unsigned minx, unsigned miny,
unsigned maxx, unsigned maxy)
{
job->minx = MIN2(job->minx, minx);
job->miny = MIN2(job->miny, miny);
job->maxx = MAX2(job->maxx, maxx);
job->maxy = MAX2(job->maxy, maxy);
}
void
panfrost_job_intersection_scissor(struct panfrost_job *job,
unsigned minx, unsigned miny,
unsigned maxx, unsigned maxy)
{
job->minx = MAX2(job->minx, minx);
job->miny = MAX2(job->miny, miny);
job->maxx = MIN2(job->maxx, maxx);
job->maxy = MIN2(job->maxy, maxy);
}
void
panfrost_job_init(struct panfrost_context *ctx)
{
ctx->jobs = _mesa_hash_table_create(ctx,
panfrost_job_hash,
panfrost_job_compare);
ctx->write_jobs = _mesa_hash_table_create(ctx,
_mesa_hash_pointer,
_mesa_key_pointer_equal);
}
|