131785852c881f3a6c7a394dc079ae9287d7485b
[mesa.git] / src / gallium / drivers / llvmpipe / lp_rast.c
1 /**************************************************************************
2 *
3 * Copyright 2009 VMware, Inc.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28 #include <limits.h>
29 #include "util/u_memory.h"
30 #include "util/u_math.h"
31 #include "util/u_rect.h"
32 #include "util/u_surface.h"
33 #include "util/u_pack_color.h"
34
35 #include "lp_scene_queue.h"
36 #include "lp_debug.h"
37 #include "lp_fence.h"
38 #include "lp_perf.h"
39 #include "lp_query.h"
40 #include "lp_rast.h"
41 #include "lp_rast_priv.h"
42 #include "lp_tile_soa.h"
43 #include "gallivm/lp_bld_debug.h"
44 #include "lp_scene.h"
45
46
47 #ifdef DEBUG
48 int jit_line = 0;
49 const struct lp_rast_state *jit_state = NULL;
50 const struct lp_rasterizer_task *jit_task = NULL;
51 #endif
52
53
54 /**
55 * Begin rasterizing a scene.
56 * Called once per scene by one thread.
57 */
58 static void
59 lp_rast_begin( struct lp_rasterizer *rast,
60 struct lp_scene *scene )
61 {
62
63 rast->curr_scene = scene;
64
65 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
66
67 lp_scene_begin_rasterization( scene );
68 lp_scene_bin_iter_begin( scene );
69 }
70
71
72 static void
73 lp_rast_end( struct lp_rasterizer *rast )
74 {
75 lp_scene_end_rasterization( rast->curr_scene );
76
77 rast->curr_scene = NULL;
78
79 #ifdef DEBUG
80 if (0)
81 debug_printf("Post render scene: tile unswizzle: %u tile swizzle: %u\n",
82 lp_tile_unswizzle_count, lp_tile_swizzle_count);
83 #endif
84 }
85
86
87 /**
88 * Begining rasterization of a tile.
89 * \param x window X position of the tile, in pixels
90 * \param y window Y position of the tile, in pixels
91 */
92 static void
93 lp_rast_tile_begin(struct lp_rasterizer_task *task,
94 const struct cmd_bin *bin)
95 {
96 const struct lp_scene *scene = task->scene;
97 enum lp_texture_usage usage;
98
99 LP_DBG(DEBUG_RAST, "%s %d,%d\n", __FUNCTION__, bin->x, bin->y);
100
101 task->bin = bin;
102 task->x = bin->x * TILE_SIZE;
103 task->y = bin->y * TILE_SIZE;
104
105 /* reset pointers to color tile(s) */
106 memset(task->color_tiles, 0, sizeof(task->color_tiles));
107
108 /* get pointer to depth/stencil tile */
109 {
110 struct pipe_surface *zsbuf = task->scene->fb.zsbuf;
111 if (zsbuf) {
112 struct llvmpipe_resource *lpt = llvmpipe_resource(zsbuf->texture);
113
114 if (scene->has_depthstencil_clear)
115 usage = LP_TEX_USAGE_WRITE_ALL;
116 else
117 usage = LP_TEX_USAGE_READ_WRITE;
118
119 /* "prime" the tile: convert data from linear to tiled if necessary
120 * and update the tile's layout info.
121 */
122 (void) llvmpipe_get_texture_tile(lpt,
123 zsbuf->u.tex.first_layer,
124 zsbuf->u.tex.level,
125 usage,
126 task->x,
127 task->y);
128 /* Get actual pointer to the tile data. Note that depth/stencil
129 * data is tiled differently than color data.
130 */
131 task->depth_tile = lp_rast_get_depth_block_pointer(task,
132 task->x,
133 task->y);
134
135 assert(task->depth_tile);
136 }
137 else {
138 task->depth_tile = NULL;
139 }
140 }
141 }
142
143
144 /**
145 * Clear the rasterizer's current color tile.
146 * This is a bin command called during bin processing.
147 */
148 static void
149 lp_rast_clear_color(struct lp_rasterizer_task *task,
150 const union lp_rast_cmd_arg arg)
151 {
152 const struct lp_scene *scene = task->scene;
153 const uint8_t *clear_color = arg.clear_color;
154
155 unsigned i;
156
157 LP_DBG(DEBUG_RAST, "%s 0x%x,0x%x,0x%x,0x%x\n", __FUNCTION__,
158 clear_color[0],
159 clear_color[1],
160 clear_color[2],
161 clear_color[3]);
162
163 if (clear_color[0] == clear_color[1] &&
164 clear_color[1] == clear_color[2] &&
165 clear_color[2] == clear_color[3]) {
166 /* clear to grayscale value {x, x, x, x} */
167 for (i = 0; i < scene->fb.nr_cbufs; i++) {
168 uint8_t *ptr =
169 lp_rast_get_color_tile_pointer(task, i, LP_TEX_USAGE_WRITE_ALL);
170 memset(ptr, clear_color[0], TILE_SIZE * TILE_SIZE * 4);
171 }
172 }
173 else {
174 /* Non-gray color.
175 * Note: if the swizzled tile layout changes (see TILE_PIXEL) this code
176 * will need to change. It'll be pretty obvious when clearing no longer
177 * works.
178 */
179 const unsigned chunk = TILE_SIZE / 4;
180 for (i = 0; i < scene->fb.nr_cbufs; i++) {
181 uint8_t *c =
182 lp_rast_get_color_tile_pointer(task, i, LP_TEX_USAGE_WRITE_ALL);
183 unsigned j;
184
185 for (j = 0; j < 4 * TILE_SIZE; j++) {
186 memset(c, clear_color[0], chunk);
187 c += chunk;
188 memset(c, clear_color[1], chunk);
189 c += chunk;
190 memset(c, clear_color[2], chunk);
191 c += chunk;
192 memset(c, clear_color[3], chunk);
193 c += chunk;
194 }
195 }
196 }
197
198 LP_COUNT(nr_color_tile_clear);
199 }
200
201
202
203
204
205
206 /**
207 * Clear the rasterizer's current z/stencil tile.
208 * This is a bin command called during bin processing.
209 */
210 static void
211 lp_rast_clear_zstencil(struct lp_rasterizer_task *task,
212 const union lp_rast_cmd_arg arg)
213 {
214 const struct lp_scene *scene = task->scene;
215 uint32_t clear_value = arg.clear_zstencil.value;
216 uint32_t clear_mask = arg.clear_zstencil.mask;
217 const unsigned height = TILE_SIZE / TILE_VECTOR_HEIGHT;
218 const unsigned width = TILE_SIZE * TILE_VECTOR_HEIGHT;
219 const unsigned block_size = scene->zsbuf.blocksize;
220 const unsigned dst_stride = scene->zsbuf.stride * TILE_VECTOR_HEIGHT;
221 uint8_t *dst;
222 unsigned i, j;
223
224 LP_DBG(DEBUG_RAST, "%s: value=0x%08x, mask=0x%08x\n",
225 __FUNCTION__, clear_value, clear_mask);
226
227 /*
228 * Clear the aera of the swizzled depth/depth buffer matching this tile, in
229 * stripes of TILE_VECTOR_HEIGHT x TILE_SIZE at a time.
230 *
231 * The swizzled depth format is such that the depths for
232 * TILE_VECTOR_HEIGHT x TILE_VECTOR_WIDTH pixels have consecutive offsets.
233 */
234
235 dst = task->depth_tile;
236
237 clear_value &= clear_mask;
238
239 switch (block_size) {
240 case 1:
241 assert(clear_mask == 0xff);
242 memset(dst, (uint8_t) clear_value, height * width);
243 break;
244 case 2:
245 if (clear_mask == 0xffff) {
246 for (i = 0; i < height; i++) {
247 uint16_t *row = (uint16_t *)dst;
248 for (j = 0; j < width; j++)
249 *row++ = (uint16_t) clear_value;
250 dst += dst_stride;
251 }
252 }
253 else {
254 for (i = 0; i < height; i++) {
255 uint16_t *row = (uint16_t *)dst;
256 for (j = 0; j < width; j++) {
257 uint16_t tmp = ~clear_mask & *row;
258 *row++ = clear_value | tmp;
259 }
260 dst += dst_stride;
261 }
262 }
263 break;
264 case 4:
265 if (clear_mask == 0xffffffff) {
266 for (i = 0; i < height; i++) {
267 uint32_t *row = (uint32_t *)dst;
268 for (j = 0; j < width; j++)
269 *row++ = clear_value;
270 dst += dst_stride;
271 }
272 }
273 else {
274 for (i = 0; i < height; i++) {
275 uint32_t *row = (uint32_t *)dst;
276 for (j = 0; j < width; j++) {
277 uint32_t tmp = ~clear_mask & *row;
278 *row++ = clear_value | tmp;
279 }
280 dst += dst_stride;
281 }
282 }
283 break;
284 default:
285 assert(0);
286 break;
287 }
288 }
289
290
291
292 /**
293 * Convert the color tile from tiled to linear layout.
294 * This is generally only done when we're flushing the scene just prior to
295 * SwapBuffers. If we didn't do this here, we'd have to convert the entire
296 * tiled color buffer to linear layout in the llvmpipe_texture_unmap()
297 * function. It's better to do it here to take advantage of
298 * threading/parallelism.
299 * This is a bin command which is stored in all bins.
300 */
301 static void
302 lp_rast_store_linear_color( struct lp_rasterizer_task *task )
303 {
304 const struct lp_scene *scene = task->scene;
305 unsigned buf;
306
307 for (buf = 0; buf < scene->fb.nr_cbufs; buf++) {
308 struct pipe_surface *cbuf = scene->fb.cbufs[buf];
309 const unsigned layer = cbuf->u.tex.first_layer;
310 const unsigned level = cbuf->u.tex.level;
311 struct llvmpipe_resource *lpt = llvmpipe_resource(cbuf->texture);
312
313 if (!task->color_tiles[buf])
314 continue;
315
316 llvmpipe_unswizzle_cbuf_tile(lpt,
317 layer,
318 level,
319 task->x, task->y,
320 task->color_tiles[buf]);
321 }
322 }
323
324
325
326 /**
327 * Run the shader on all blocks in a tile. This is used when a tile is
328 * completely contained inside a triangle.
329 * This is a bin command called during bin processing.
330 */
331 static void
332 lp_rast_shade_tile(struct lp_rasterizer_task *task,
333 const union lp_rast_cmd_arg arg)
334 {
335 const struct lp_scene *scene = task->scene;
336 const struct lp_rast_shader_inputs *inputs = arg.shade_tile;
337 const struct lp_rast_state *state;
338 struct lp_fragment_shader_variant *variant;
339 const unsigned tile_x = task->x, tile_y = task->y;
340 unsigned x, y;
341
342 if (inputs->disable) {
343 /* This command was partially binned and has been disabled */
344 return;
345 }
346
347 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
348
349 state = task->state;
350 assert(state);
351 if (!state) {
352 return;
353 }
354 variant = state->variant;
355
356 /* render the whole 64x64 tile in 4x4 chunks */
357 for (y = 0; y < TILE_SIZE; y += 4){
358 for (x = 0; x < TILE_SIZE; x += 4) {
359 uint8_t *color[PIPE_MAX_COLOR_BUFS];
360 uint32_t *depth;
361 unsigned i;
362
363 /* color buffer */
364 for (i = 0; i < scene->fb.nr_cbufs; i++)
365 color[i] = lp_rast_get_color_block_pointer(task, i,
366 tile_x + x, tile_y + y);
367
368 /* depth buffer */
369 depth = lp_rast_get_depth_block_pointer(task, tile_x + x, tile_y + y);
370
371 /* run shader on 4x4 block */
372 BEGIN_JIT_CALL(state, task);
373 variant->jit_function[RAST_WHOLE]( &state->jit_context,
374 tile_x + x, tile_y + y,
375 inputs->frontfacing,
376 GET_A0(inputs),
377 GET_DADX(inputs),
378 GET_DADY(inputs),
379 color,
380 depth,
381 0xffff,
382 &task->vis_counter);
383 END_JIT_CALL();
384 }
385 }
386 }
387
388
389 /**
390 * Run the shader on all blocks in a tile. This is used when a tile is
391 * completely contained inside a triangle, and the shader is opaque.
392 * This is a bin command called during bin processing.
393 */
394 static void
395 lp_rast_shade_tile_opaque(struct lp_rasterizer_task *task,
396 const union lp_rast_cmd_arg arg)
397 {
398 const struct lp_scene *scene = task->scene;
399 unsigned i;
400
401 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
402
403 assert(task->state);
404 if (!task->state) {
405 return;
406 }
407
408 /* this will prevent converting the layout from tiled to linear */
409 for (i = 0; i < scene->fb.nr_cbufs; i++) {
410 (void)lp_rast_get_color_tile_pointer(task, i, LP_TEX_USAGE_WRITE_ALL);
411 }
412
413 lp_rast_shade_tile(task, arg);
414 }
415
416
417 /**
418 * Compute shading for a 4x4 block of pixels inside a triangle.
419 * This is a bin command called during bin processing.
420 * \param x X position of quad in window coords
421 * \param y Y position of quad in window coords
422 */
423 void
424 lp_rast_shade_quads_mask(struct lp_rasterizer_task *task,
425 const struct lp_rast_shader_inputs *inputs,
426 unsigned x, unsigned y,
427 unsigned mask)
428 {
429 const struct lp_rast_state *state = task->state;
430 struct lp_fragment_shader_variant *variant = state->variant;
431 const struct lp_scene *scene = task->scene;
432 uint8_t *color[PIPE_MAX_COLOR_BUFS];
433 void *depth;
434 unsigned i;
435
436 assert(state);
437
438 /* Sanity checks */
439 assert(x % TILE_VECTOR_WIDTH == 0);
440 assert(y % TILE_VECTOR_HEIGHT == 0);
441
442 assert((x % 4) == 0);
443 assert((y % 4) == 0);
444
445 /* color buffer */
446 for (i = 0; i < scene->fb.nr_cbufs; i++) {
447 color[i] = lp_rast_get_color_block_pointer(task, i, x, y);
448 assert(lp_check_alignment(color[i], 16));
449 }
450
451 /* depth buffer */
452 depth = lp_rast_get_depth_block_pointer(task, x, y);
453
454
455 assert(lp_check_alignment(state->jit_context.blend_color, 16));
456
457 /* run shader on 4x4 block */
458 BEGIN_JIT_CALL(state, task);
459 variant->jit_function[RAST_EDGE_TEST](&state->jit_context,
460 x, y,
461 inputs->frontfacing,
462 GET_A0(inputs),
463 GET_DADX(inputs),
464 GET_DADY(inputs),
465 color,
466 depth,
467 mask,
468 &task->vis_counter);
469 END_JIT_CALL();
470 }
471
472
473
474 /**
475 * Begin a new occlusion query.
476 * This is a bin command put in all bins.
477 * Called per thread.
478 */
479 static void
480 lp_rast_begin_query(struct lp_rasterizer_task *task,
481 const union lp_rast_cmd_arg arg)
482 {
483 struct llvmpipe_query *pq = arg.query_obj;
484
485 assert(task->query == NULL);
486 task->vis_counter = 0;
487 task->query = pq;
488 }
489
490
491 /**
492 * End the current occlusion query.
493 * This is a bin command put in all bins.
494 * Called per thread.
495 */
496 static void
497 lp_rast_end_query(struct lp_rasterizer_task *task,
498 const union lp_rast_cmd_arg arg)
499 {
500 assert(task->query);
501 if (task->query) {
502 task->query->count[task->thread_index] += task->vis_counter;
503 task->query = NULL;
504 }
505 }
506
507
508 void
509 lp_rast_set_state(struct lp_rasterizer_task *task,
510 const union lp_rast_cmd_arg arg)
511 {
512 task->state = arg.state;
513 }
514
515
516
517 /**
518 * Set top row and left column of the tile's pixels to white. For debugging.
519 */
520 static void
521 outline_tile(uint8_t *tile)
522 {
523 const uint8_t val = 0xff;
524 unsigned i;
525
526 for (i = 0; i < TILE_SIZE; i++) {
527 TILE_PIXEL(tile, i, 0, 0) = val;
528 TILE_PIXEL(tile, i, 0, 1) = val;
529 TILE_PIXEL(tile, i, 0, 2) = val;
530 TILE_PIXEL(tile, i, 0, 3) = val;
531
532 TILE_PIXEL(tile, 0, i, 0) = val;
533 TILE_PIXEL(tile, 0, i, 1) = val;
534 TILE_PIXEL(tile, 0, i, 2) = val;
535 TILE_PIXEL(tile, 0, i, 3) = val;
536 }
537 }
538
539
540 /**
541 * Draw grid of gray lines at 16-pixel intervals across the tile to
542 * show the sub-tile boundaries. For debugging.
543 */
544 static void
545 outline_subtiles(uint8_t *tile)
546 {
547 const uint8_t val = 0x80;
548 const unsigned step = 16;
549 unsigned i, j;
550
551 for (i = 0; i < TILE_SIZE; i += step) {
552 for (j = 0; j < TILE_SIZE; j++) {
553 TILE_PIXEL(tile, i, j, 0) = val;
554 TILE_PIXEL(tile, i, j, 1) = val;
555 TILE_PIXEL(tile, i, j, 2) = val;
556 TILE_PIXEL(tile, i, j, 3) = val;
557
558 TILE_PIXEL(tile, j, i, 0) = val;
559 TILE_PIXEL(tile, j, i, 1) = val;
560 TILE_PIXEL(tile, j, i, 2) = val;
561 TILE_PIXEL(tile, j, i, 3) = val;
562 }
563 }
564
565 outline_tile(tile);
566 }
567
568
569
570 /**
571 * Called when we're done writing to a color tile.
572 */
573 static void
574 lp_rast_tile_end(struct lp_rasterizer_task *task)
575 {
576 #ifdef DEBUG
577 if (LP_DEBUG & (DEBUG_SHOW_SUBTILES | DEBUG_SHOW_TILES)) {
578 const struct lp_scene *scene = task->scene;
579 unsigned buf;
580
581 for (buf = 0; buf < scene->fb.nr_cbufs; buf++) {
582 uint8_t *color = lp_rast_get_color_block_pointer(task, buf,
583 task->x, task->y);
584
585 if (LP_DEBUG & DEBUG_SHOW_SUBTILES)
586 outline_subtiles(color);
587 else if (LP_DEBUG & DEBUG_SHOW_TILES)
588 outline_tile(color);
589 }
590 }
591 #else
592 (void) outline_subtiles;
593 #endif
594
595 lp_rast_store_linear_color(task);
596
597 if (task->query) {
598 union lp_rast_cmd_arg dummy = {0};
599 lp_rast_end_query(task, dummy);
600 }
601
602 /* debug */
603 memset(task->color_tiles, 0, sizeof(task->color_tiles));
604 task->depth_tile = NULL;
605
606 task->bin = NULL;
607 }
608
609 static lp_rast_cmd_func dispatch[LP_RAST_OP_MAX] =
610 {
611 lp_rast_clear_color,
612 lp_rast_clear_zstencil,
613 lp_rast_triangle_1,
614 lp_rast_triangle_2,
615 lp_rast_triangle_3,
616 lp_rast_triangle_4,
617 lp_rast_triangle_5,
618 lp_rast_triangle_6,
619 lp_rast_triangle_7,
620 lp_rast_triangle_8,
621 lp_rast_triangle_3_4,
622 lp_rast_triangle_3_16,
623 lp_rast_triangle_4_16,
624 lp_rast_shade_tile,
625 lp_rast_shade_tile_opaque,
626 lp_rast_begin_query,
627 lp_rast_end_query,
628 lp_rast_set_state,
629 };
630
631
632 static void
633 do_rasterize_bin(struct lp_rasterizer_task *task,
634 const struct cmd_bin *bin)
635 {
636 const struct cmd_block *block;
637 unsigned k;
638
639 if (0)
640 lp_debug_bin(bin);
641
642 for (block = bin->head; block; block = block->next) {
643 for (k = 0; k < block->count; k++) {
644 dispatch[block->cmd[k]]( task, block->arg[k] );
645 }
646 }
647 }
648
649
650
651 /**
652 * Rasterize commands for a single bin.
653 * \param x, y position of the bin's tile in the framebuffer
654 * Must be called between lp_rast_begin() and lp_rast_end().
655 * Called per thread.
656 */
657 static void
658 rasterize_bin(struct lp_rasterizer_task *task,
659 const struct cmd_bin *bin )
660 {
661 lp_rast_tile_begin( task, bin );
662
663 do_rasterize_bin(task, bin);
664
665 lp_rast_tile_end(task);
666
667
668 /* Debug/Perf flags:
669 */
670 if (bin->head->count == 1) {
671 if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE_OPAQUE)
672 LP_COUNT(nr_pure_shade_opaque_64);
673 else if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE)
674 LP_COUNT(nr_pure_shade_64);
675 }
676 }
677
678
679 /* An empty bin is one that just loads the contents of the tile and
680 * stores them again unchanged. This typically happens when bins have
681 * been flushed for some reason in the middle of a frame, or when
682 * incremental updates are being made to a render target.
683 *
684 * Try to avoid doing pointless work in this case.
685 */
686 static boolean
687 is_empty_bin( const struct cmd_bin *bin )
688 {
689 return bin->head == NULL;
690 }
691
692
693 /**
694 * Rasterize/execute all bins within a scene.
695 * Called per thread.
696 */
697 static void
698 rasterize_scene(struct lp_rasterizer_task *task,
699 struct lp_scene *scene)
700 {
701 task->scene = scene;
702 /* loop over scene bins, rasterize each */
703 #if 0
704 {
705 unsigned i, j;
706 for (i = 0; i < scene->tiles_x; i++) {
707 for (j = 0; j < scene->tiles_y; j++) {
708 struct cmd_bin *bin = lp_scene_get_bin(scene, i, j);
709 rasterize_bin(task, bin, i, j);
710 }
711 }
712 }
713 #else
714 {
715 struct cmd_bin *bin;
716
717 assert(scene);
718 while ((bin = lp_scene_bin_iter_next(scene))) {
719 if (!is_empty_bin( bin ))
720 rasterize_bin(task, bin);
721 }
722 }
723 #endif
724
725 if (scene->fence) {
726 lp_fence_signal(scene->fence);
727 }
728
729 task->scene = NULL;
730 }
731
732
733 /**
734 * Called by setup module when it has something for us to render.
735 */
736 void
737 lp_rast_queue_scene( struct lp_rasterizer *rast,
738 struct lp_scene *scene)
739 {
740 LP_DBG(DEBUG_SETUP, "%s\n", __FUNCTION__);
741
742 if (rast->num_threads == 0) {
743 /* no threading */
744
745 lp_rast_begin( rast, scene );
746
747 rasterize_scene( &rast->tasks[0], scene );
748
749 lp_rast_end( rast );
750
751 rast->curr_scene = NULL;
752 }
753 else {
754 /* threaded rendering! */
755 unsigned i;
756
757 lp_scene_enqueue( rast->full_scenes, scene );
758
759 /* signal the threads that there's work to do */
760 for (i = 0; i < rast->num_threads; i++) {
761 pipe_semaphore_signal(&rast->tasks[i].work_ready);
762 }
763 }
764
765 LP_DBG(DEBUG_SETUP, "%s done \n", __FUNCTION__);
766 }
767
768
769 void
770 lp_rast_finish( struct lp_rasterizer *rast )
771 {
772 if (rast->num_threads == 0) {
773 /* nothing to do */
774 }
775 else {
776 int i;
777
778 /* wait for work to complete */
779 for (i = 0; i < rast->num_threads; i++) {
780 pipe_semaphore_wait(&rast->tasks[i].work_done);
781 }
782 }
783 }
784
785
786 /**
787 * This is the thread's main entrypoint.
788 * It's a simple loop:
789 * 1. wait for work
790 * 2. do work
791 * 3. signal that we're done
792 */
793 static PIPE_THREAD_ROUTINE( thread_func, init_data )
794 {
795 struct lp_rasterizer_task *task = (struct lp_rasterizer_task *) init_data;
796 struct lp_rasterizer *rast = task->rast;
797 boolean debug = false;
798
799 while (1) {
800 /* wait for work */
801 if (debug)
802 debug_printf("thread %d waiting for work\n", task->thread_index);
803 pipe_semaphore_wait(&task->work_ready);
804
805 if (rast->exit_flag)
806 break;
807
808 if (task->thread_index == 0) {
809 /* thread[0]:
810 * - get next scene to rasterize
811 * - map the framebuffer surfaces
812 */
813 lp_rast_begin( rast,
814 lp_scene_dequeue( rast->full_scenes, TRUE ) );
815 }
816
817 /* Wait for all threads to get here so that threads[1+] don't
818 * get a null rast->curr_scene pointer.
819 */
820 pipe_barrier_wait( &rast->barrier );
821
822 /* do work */
823 if (debug)
824 debug_printf("thread %d doing work\n", task->thread_index);
825
826 rasterize_scene(task,
827 rast->curr_scene);
828
829 /* wait for all threads to finish with this scene */
830 pipe_barrier_wait( &rast->barrier );
831
832 /* XXX: shouldn't be necessary:
833 */
834 if (task->thread_index == 0) {
835 lp_rast_end( rast );
836 }
837
838 /* signal done with work */
839 if (debug)
840 debug_printf("thread %d done working\n", task->thread_index);
841
842 pipe_semaphore_signal(&task->work_done);
843 }
844
845 return NULL;
846 }
847
848
849 /**
850 * Initialize semaphores and spawn the threads.
851 */
852 static void
853 create_rast_threads(struct lp_rasterizer *rast)
854 {
855 unsigned i;
856
857 /* NOTE: if num_threads is zero, we won't use any threads */
858 for (i = 0; i < rast->num_threads; i++) {
859 pipe_semaphore_init(&rast->tasks[i].work_ready, 0);
860 pipe_semaphore_init(&rast->tasks[i].work_done, 0);
861 rast->threads[i] = pipe_thread_create(thread_func,
862 (void *) &rast->tasks[i]);
863 }
864 }
865
866
867
868 /**
869 * Create new lp_rasterizer. If num_threads is zero, don't create any
870 * new threads, do rendering synchronously.
871 * \param num_threads number of rasterizer threads to create
872 */
873 struct lp_rasterizer *
874 lp_rast_create( unsigned num_threads )
875 {
876 struct lp_rasterizer *rast;
877 unsigned i;
878
879 rast = CALLOC_STRUCT(lp_rasterizer);
880 if(!rast)
881 return NULL;
882
883 rast->full_scenes = lp_scene_queue_create();
884
885 for (i = 0; i < Elements(rast->tasks); i++) {
886 struct lp_rasterizer_task *task = &rast->tasks[i];
887 task->rast = rast;
888 task->thread_index = i;
889 }
890
891 rast->num_threads = num_threads;
892
893 create_rast_threads(rast);
894
895 /* for synchronizing rasterization threads */
896 pipe_barrier_init( &rast->barrier, rast->num_threads );
897
898 memset(lp_swizzled_cbuf, 0, sizeof lp_swizzled_cbuf);
899
900 memset(lp_dummy_tile, 0, sizeof lp_dummy_tile);
901
902 return rast;
903 }
904
905
906 /* Shutdown:
907 */
908 void lp_rast_destroy( struct lp_rasterizer *rast )
909 {
910 unsigned i;
911
912 /* Set exit_flag and signal each thread's work_ready semaphore.
913 * Each thread will be woken up, notice that the exit_flag is set and
914 * break out of its main loop. The thread will then exit.
915 */
916 rast->exit_flag = TRUE;
917 for (i = 0; i < rast->num_threads; i++) {
918 pipe_semaphore_signal(&rast->tasks[i].work_ready);
919 }
920
921 /* Wait for threads to terminate before cleaning up per-thread data */
922 for (i = 0; i < rast->num_threads; i++) {
923 pipe_thread_wait(rast->threads[i]);
924 }
925
926 /* Clean up per-thread data */
927 for (i = 0; i < rast->num_threads; i++) {
928 pipe_semaphore_destroy(&rast->tasks[i].work_ready);
929 pipe_semaphore_destroy(&rast->tasks[i].work_done);
930 }
931
932 /* for synchronizing rasterization threads */
933 pipe_barrier_destroy( &rast->barrier );
934
935 lp_scene_queue_destroy(rast->full_scenes);
936
937 FREE(rast);
938 }
939
940
941 /** Return number of rasterization threads */
942 unsigned
943 lp_rast_get_num_threads( struct lp_rasterizer *rast )
944 {
945 return rast->num_threads;
946 }
947
948