Clone of mesa.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

draw_pipe_flatshade.c 6.7KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  1. /**************************************************************************
  2. *
  3. * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
  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 TUNGSTEN GRAPHICS 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. /* Authors: Keith Whitwell <keith@tungstengraphics.com>
  28. */
  29. #include "pipe/p_util.h"
  30. #include "pipe/p_shader_tokens.h"
  31. #include "draw_vs.h"
  32. #include "draw_pipe.h"
  33. /** subclass of draw_stage */
  34. struct flat_stage
  35. {
  36. struct draw_stage stage;
  37. uint num_color_attribs;
  38. uint color_attribs[4]; /* front/back primary/secondary colors */
  39. };
  40. static INLINE struct flat_stage *
  41. flat_stage(struct draw_stage *stage)
  42. {
  43. return (struct flat_stage *) stage;
  44. }
  45. /** Copy all the color attributes from 'src' vertex to 'dst' vertex */
  46. static INLINE void copy_colors( struct draw_stage *stage,
  47. struct vertex_header *dst,
  48. const struct vertex_header *src )
  49. {
  50. const struct flat_stage *flat = flat_stage(stage);
  51. uint i;
  52. for (i = 0; i < flat->num_color_attribs; i++) {
  53. const uint attr = flat->color_attribs[i];
  54. COPY_4FV(dst->data[attr], src->data[attr]);
  55. }
  56. }
  57. /** Copy all the color attributes from src vertex to dst0 & dst1 vertices */
  58. static INLINE void copy_colors2( struct draw_stage *stage,
  59. struct vertex_header *dst0,
  60. struct vertex_header *dst1,
  61. const struct vertex_header *src )
  62. {
  63. const struct flat_stage *flat = flat_stage(stage);
  64. uint i;
  65. for (i = 0; i < flat->num_color_attribs; i++) {
  66. const uint attr = flat->color_attribs[i];
  67. COPY_4FV(dst0->data[attr], src->data[attr]);
  68. COPY_4FV(dst1->data[attr], src->data[attr]);
  69. }
  70. }
  71. /**
  72. * Flatshade tri. Required for clipping and when unfilled tris are
  73. * active, otherwise handled by hardware.
  74. */
  75. static void flatshade_tri_0( struct draw_stage *stage,
  76. struct prim_header *header )
  77. {
  78. struct prim_header tmp;
  79. tmp.det = header->det;
  80. tmp.edgeflags = header->edgeflags;
  81. tmp.v[0] = header->v[0];
  82. tmp.v[1] = dup_vert(stage, header->v[1], 0);
  83. tmp.v[2] = dup_vert(stage, header->v[2], 1);
  84. copy_colors2(stage, tmp.v[1], tmp.v[2], tmp.v[0]);
  85. stage->next->tri( stage->next, &tmp );
  86. }
  87. static void flatshade_tri_2( struct draw_stage *stage,
  88. struct prim_header *header )
  89. {
  90. struct prim_header tmp;
  91. tmp.det = header->det;
  92. tmp.edgeflags = header->edgeflags;
  93. tmp.v[0] = dup_vert(stage, header->v[0], 0);
  94. tmp.v[1] = dup_vert(stage, header->v[1], 1);
  95. tmp.v[2] = header->v[2];
  96. copy_colors2(stage, tmp.v[0], tmp.v[1], tmp.v[2]);
  97. stage->next->tri( stage->next, &tmp );
  98. }
  99. /**
  100. * Flatshade line. Required for clipping.
  101. */
  102. static void flatshade_line_0( struct draw_stage *stage,
  103. struct prim_header *header )
  104. {
  105. struct prim_header tmp;
  106. tmp.v[0] = header->v[0];
  107. tmp.v[1] = dup_vert(stage, header->v[1], 0);
  108. copy_colors(stage, tmp.v[1], tmp.v[0]);
  109. stage->next->line( stage->next, &tmp );
  110. }
  111. static void flatshade_line_1( struct draw_stage *stage,
  112. struct prim_header *header )
  113. {
  114. struct prim_header tmp;
  115. tmp.v[0] = dup_vert(stage, header->v[0], 0);
  116. tmp.v[1] = header->v[1];
  117. copy_colors(stage, tmp.v[0], tmp.v[1]);
  118. stage->next->line( stage->next, &tmp );
  119. }
  120. static void flatshade_init_state( struct draw_stage *stage )
  121. {
  122. struct flat_stage *flat = flat_stage(stage);
  123. const struct draw_vertex_shader *vs = stage->draw->vertex_shader;
  124. uint i;
  125. /* Find which vertex shader outputs are colors, make a list */
  126. flat->num_color_attribs = 0;
  127. for (i = 0; i < vs->info.num_outputs; i++) {
  128. if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_COLOR ||
  129. vs->info.output_semantic_name[i] == TGSI_SEMANTIC_BCOLOR) {
  130. flat->color_attribs[flat->num_color_attribs++] = i;
  131. }
  132. }
  133. /* Choose flatshade routine according to provoking vertex:
  134. */
  135. if (stage->draw->rasterizer->flatshade_first) {
  136. stage->line = flatshade_line_0;
  137. stage->tri = flatshade_tri_0;
  138. }
  139. else {
  140. stage->line = flatshade_line_1;
  141. stage->tri = flatshade_tri_2;
  142. }
  143. }
  144. static void flatshade_first_tri( struct draw_stage *stage,
  145. struct prim_header *header )
  146. {
  147. flatshade_init_state( stage );
  148. stage->tri( stage, header );
  149. }
  150. static void flatshade_first_line( struct draw_stage *stage,
  151. struct prim_header *header )
  152. {
  153. flatshade_init_state( stage );
  154. stage->line( stage, header );
  155. }
  156. static void flatshade_flush( struct draw_stage *stage,
  157. unsigned flags )
  158. {
  159. stage->tri = flatshade_first_tri;
  160. stage->line = flatshade_first_line;
  161. stage->next->flush( stage->next, flags );
  162. }
  163. static void flatshade_reset_stipple_counter( struct draw_stage *stage )
  164. {
  165. stage->next->reset_stipple_counter( stage->next );
  166. }
  167. static void flatshade_destroy( struct draw_stage *stage )
  168. {
  169. draw_free_temp_verts( stage );
  170. FREE( stage );
  171. }
  172. /**
  173. * Create flatshading drawing stage.
  174. */
  175. struct draw_stage *draw_flatshade_stage( struct draw_context *draw )
  176. {
  177. struct flat_stage *flatshade = CALLOC_STRUCT(flat_stage);
  178. draw_alloc_temp_verts( &flatshade->stage, 2 );
  179. flatshade->stage.draw = draw;
  180. flatshade->stage.next = NULL;
  181. flatshade->stage.point = draw_pipe_passthrough_point;
  182. flatshade->stage.line = flatshade_first_line;
  183. flatshade->stage.tri = flatshade_first_tri;
  184. flatshade->stage.flush = flatshade_flush;
  185. flatshade->stage.reset_stipple_counter = flatshade_reset_stipple_counter;
  186. flatshade->stage.destroy = flatshade_destroy;
  187. return &flatshade->stage;
  188. }