src/gallium/auxiliary/draw/draw_prim.c

   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
  28  /*
  29   * Authors:
  30   *   Keith Whitwell <keith@tungstengraphics.com>
  31   */
  32
  33 #include "pipe/p_debug.h"
  34
  35 #include "draw_private.h"
  36 #include "draw_context.h"
  37
  38
  39
  40 #define RP_NONE  0
  41 #define RP_POINT 1
  42 #define RP_LINE  2
  43 #define RP_TRI   3
  44
  45
  46 static unsigned reduced_prim[PIPE_PRIM_POLYGON + 1] = {
  47    RP_POINT,
  48    RP_LINE,
  49    RP_LINE,
  50    RP_LINE,
  51    RP_TRI,
  52    RP_TRI,
  53    RP_TRI,
  54    RP_TRI,
  55    RP_TRI,
  56    RP_TRI
  57 };
  58
  59
  60 static void draw_prim_queue_flush( struct draw_context *draw )
  61 {
  62    unsigned i;
  63
  64    if (0)
  65       debug_printf("Flushing with %d prims, %d verts\n",
  66                    draw->pq.queue_nr, draw->vs.queue_nr);
  67
  68    assert (draw->pq.queue_nr != 0);
  69
  70    /* NOTE: we cannot save draw->pipeline->first in a local var because
  71     * draw->pipeline->first is often changed by the first call to tri(),
  72     * line(), etc.
  73     */
  74    if (draw->rasterizer->line_stipple_enable) {
  75       switch (draw->reduced_prim) {
  76       case RP_TRI:
  77          for (i = 0; i < draw->pq.queue_nr; i++) {
  78             if (draw->pq.queue[i].reset_line_stipple)
  79                draw->pipeline.first->reset_stipple_counter( draw->pipeline.first );
  80
  81             draw->pipeline.first->tri( draw->pipeline.first, &draw->pq.queue[i] );
  82          }
  83          break;
  84       case RP_LINE:
  85          for (i = 0; i < draw->pq.queue_nr; i++) {
  86             if (draw->pq.queue[i].reset_line_stipple)
  87                draw->pipeline.first->reset_stipple_counter( draw->pipeline.first );
  88
  89             draw->pipeline.first->line( draw->pipeline.first, &draw->pq.queue[i] );
  90          }
  91          break;
  92       case RP_POINT:
  93          draw->pipeline.first->reset_stipple_counter( draw->pipeline.first );
  94          for (i = 0; i < draw->pq.queue_nr; i++)
  95             draw->pipeline.first->point( draw->pipeline.first, &draw->pq.queue[i] );
  96          break;
  97       }
  98    }
  99    else {
 100       switch (draw->reduced_prim) {
 101       case RP_TRI:
 102          for (i = 0; i < draw->pq.queue_nr; i++)
 103             draw->pipeline.first->tri( draw->pipeline.first, &draw->pq.queue[i] );
 104          break;
 105       case RP_LINE:
 106          for (i = 0; i < draw->pq.queue_nr; i++)
 107             draw->pipeline.first->line( draw->pipeline.first, &draw->pq.queue[i] );
 108          break;
 109       case RP_POINT:
 110          for (i = 0; i < draw->pq.queue_nr; i++)
 111             draw->pipeline.first->point( draw->pipeline.first, &draw->pq.queue[i] );
 112          break;
 113       }
 114    }
 115
 116    draw->pq.queue_nr = 0;
 117    draw_vertex_cache_unreference( draw );
 118 }
 119
 120
 121
 122 void draw_do_flush( struct draw_context *draw, unsigned flags )
 123 {
 124    if (0)
 125       debug_printf("Flushing with %d verts, %d prims\n",
 126                    draw->vs.queue_nr,
 127                    draw->pq.queue_nr );
 128
 129
 130    if (flags >= DRAW_FLUSH_SHADER_QUEUE) {
 131       if (draw->vs.queue_nr)
 132          (*draw->shader_queue_flush)(draw);
 133
 134       if (flags >= DRAW_FLUSH_PRIM_QUEUE) {
 135          if (draw->pq.queue_nr)
 136             draw_prim_queue_flush(draw);
 137
 138          if (flags >= DRAW_FLUSH_VERTEX_CACHE) {
 139             draw_vertex_cache_invalidate(draw);
 140
 141             if (flags >= DRAW_FLUSH_STATE_CHANGE) {
 142                draw->pipeline.first->flush( draw->pipeline.first, flags );
 143                draw->pipeline.first = draw->pipeline.validate;
 144                draw->reduced_prim = ~0;
 145             }
 146          }
 147       }
 148    }
 149 }
 150
 151
 152
 153 /* Return a pointer to a freshly queued primitive header.  Ensure that
 154  * there is room in the vertex cache for a maximum of "nr_verts" new
 155  * vertices.  Flush primitive and/or vertex queues if necessary to
 156  * make space.
 157  */
 158 static struct prim_header *get_queued_prim( struct draw_context *draw,
 159                                             unsigned nr_verts )
 160 {
 161    if (!draw_vertex_cache_check_space( draw, nr_verts )) {
 162 //      debug_printf("v");
 163       draw_do_flush( draw, DRAW_FLUSH_VERTEX_CACHE );
 164    }
 165    else if (draw->pq.queue_nr == PRIM_QUEUE_LENGTH) {
 166 //      debug_printf("p");
 167       draw_do_flush( draw, DRAW_FLUSH_PRIM_QUEUE );
 168    }
 169
 170    assert(draw->pq.queue_nr < PRIM_QUEUE_LENGTH);
 171
 172    return &draw->pq.queue[draw->pq.queue_nr++];
 173 }
 174
 175
 176
 177 /**
 178  * Add a point to the primitive queue.
 179  * \param i0  index into user's vertex arrays
 180  */
 181 static void do_point( struct draw_context *draw,
 182                       unsigned i0 )
 183 {
 184    struct prim_header *prim = get_queued_prim( draw, 1 );
 185
 186    prim->reset_line_stipple = 0;
 187    prim->edgeflags = 1;
 188    prim->pad = 0;
 189    prim->v[0] = draw->vcache.get_vertex( draw, i0 );
 190 }
 191
 192
 193 /**
 194  * Add a line to the primitive queue.
 195  * \param i0  index into user's vertex arrays
 196  * \param i1  index into user's vertex arrays
 197  */
 198 static void do_line( struct draw_context *draw,
 199                      boolean reset_stipple,
 200                      unsigned i0,
 201                      unsigned i1 )
 202 {
 203    struct prim_header *prim = get_queued_prim( draw, 2 );
 204
 205    prim->reset_line_stipple = reset_stipple;
 206    prim->edgeflags = 1;
 207    prim->pad = 0;
 208    prim->v[0] = draw->vcache.get_vertex( draw, i0 );
 209    prim->v[1] = draw->vcache.get_vertex( draw, i1 );
 210 }
 211
 212 /**
 213  * Add a triangle to the primitive queue.
 214  */
 215 static void do_triangle( struct draw_context *draw,
 216                          unsigned i0,
 217                          unsigned i1,
 218                          unsigned i2 )
 219 {
 220    struct prim_header *prim = get_queued_prim( draw, 3 );
 221
 222    prim->reset_line_stipple = 1;
 223    prim->edgeflags = ~0;
 224    prim->pad = 0;
 225    prim->v[0] = draw->vcache.get_vertex( draw, i0 );
 226    prim->v[1] = draw->vcache.get_vertex( draw, i1 );
 227    prim->v[2] = draw->vcache.get_vertex( draw, i2 );
 228 }
 229
 230 static void do_ef_triangle( struct draw_context *draw,
 231                             boolean reset_stipple,
 232                             unsigned ef_mask,
 233                             unsigned i0,
 234                             unsigned i1,
 235                             unsigned i2 )
 236 {
 237    struct prim_header *prim = get_queued_prim( draw, 3 );
 238    struct vertex_header *v0 = draw->vcache.get_vertex( draw, i0 );
 239    struct vertex_header *v1 = draw->vcache.get_vertex( draw, i1 );
 240    struct vertex_header *v2 = draw->vcache.get_vertex( draw, i2 );
 241
 242    prim->reset_line_stipple = reset_stipple;
 243
 244    prim->edgeflags = ef_mask & ((v0->edgeflag << 0) |
 245                                 (v1->edgeflag << 1) |
 246                                 (v2->edgeflag << 2));
 247    prim->pad = 0;
 248    prim->v[0] = v0;
 249    prim->v[1] = v1;
 250    prim->v[2] = v2;
 251 }
 252
 253
 254 static void do_ef_quad( struct draw_context *draw,
 255                      unsigned v0,
 256                      unsigned v1,
 257                      unsigned v2,
 258                      unsigned v3 )
 259 {
 260    const unsigned omitEdge2 = ~(1 << 1);
 261    const unsigned omitEdge3 = ~(1 << 2);
 262    do_ef_triangle( draw, 1, omitEdge2, v0, v1, v3 );
 263    do_ef_triangle( draw, 0, omitEdge3, v1, v2, v3 );
 264 }
 265
 266 static void do_quad( struct draw_context *draw,
 267                      unsigned v0,
 268                      unsigned v1,
 269                      unsigned v2,
 270                      unsigned v3 )
 271 {
 272    do_triangle( draw, v0, v1, v3 );
 273    do_triangle( draw, v1, v2, v3 );
 274 }
 275
 276
 277 /**
 278  * Main entrypoint to draw some number of points/lines/triangles
 279  */
 280 static void
 281 draw_prim( struct draw_context *draw,
 282            unsigned prim, unsigned start, unsigned count )
 283 {
 284    unsigned i;
 285    boolean unfilled = (draw->rasterizer->fill_cw != PIPE_POLYGON_MODE_FILL ||
 286                        draw->rasterizer->fill_ccw != PIPE_POLYGON_MODE_FILL);
 287
 288 //   debug_printf("%s (%d) %d/%d\n", __FUNCTION__, draw->prim, start, count );
 289
 290    switch (prim) {
 291    case PIPE_PRIM_POINTS:
 292       for (i = 0; i < count; i ++) {
 293          do_point( draw,
 294                    start + i );
 295       }
 296       break;
 297
 298    case PIPE_PRIM_LINES:
 299       for (i = 0; i+1 < count; i += 2) {
 300          do_line( draw,
 301                   TRUE,
 302                   start + i + 0,
 303                   start + i + 1);
 304       }
 305       break;
 306
 307    case PIPE_PRIM_LINE_LOOP:
 308       if (count >= 2) {
 309          for (i = 1; i < count; i++) {
 310             do_line( draw,
 311                      i == 1,    /* XXX: only if vb not split */
 312                      start + i - 1,
 313                      start + i );
 314          }
 315
 316          do_line( draw,
 317                   0,
 318                   start + count - 1,
 319                   start + 0 );
 320       }
 321       break;
 322
 323    case PIPE_PRIM_LINE_STRIP:
 324       for (i = 1; i < count; i++) {
 325          do_line( draw,
 326                   i == 1,
 327                   start + i - 1,
 328                   start + i );
 329       }
 330       break;
 331
 332    case PIPE_PRIM_TRIANGLES:
 333       if (unfilled) {
 334          for (i = 0; i+2 < count; i += 3) {
 335             do_ef_triangle( draw,
 336                             1,
 337                             ~0,
 338                             start + i + 0,
 339                             start + i + 1,
 340                             start + i + 2 );
 341          }
 342       }
 343       else {
 344          for (i = 0; i+2 < count; i += 3) {
 345             do_triangle( draw,
 346                          start + i + 0,
 347                          start + i + 1,
 348                          start + i + 2 );
 349          }
 350       }
 351       break;
 352
 353    case PIPE_PRIM_TRIANGLE_STRIP:
 354       for (i = 0; i+2 < count; i++) {
 355          if (i & 1) {
 356             do_triangle( draw,
 357                          start + i + 1,
 358                          start + i + 0,
 359                          start + i + 2 );
 360          }
 361          else {
 362             do_triangle( draw,
 363                          start + i + 0,
 364                          start + i + 1,
 365                          start + i + 2 );
 366          }
 367       }
 368       break;
 369
 370    case PIPE_PRIM_TRIANGLE_FAN:
 371       if (count >= 3) {
 372          for (i = 0; i+2 < count; i++) {
 373             do_triangle( draw,
 374                          start + 0,
 375                          start + i + 1,
 376                          start + i + 2 );
 377          }
 378       }
 379       break;
 380
 381
 382    case PIPE_PRIM_QUADS:
 383       if (unfilled) {
 384          for (i = 0; i+3 < count; i += 4) {
 385             do_ef_quad( draw,
 386                         start + i + 0,
 387                         start + i + 1,
 388                         start + i + 2,
 389                         start + i + 3);
 390          }
 391       }
 392       else {
 393          for (i = 0; i+3 < count; i += 4) {
 394             do_quad( draw,
 395                      start + i + 0,
 396                      start + i + 1,
 397                      start + i + 2,
 398                      start + i + 3);
 399          }
 400       }
 401       break;
 402
 403    case PIPE_PRIM_QUAD_STRIP:
 404       if (unfilled) {
 405          for (i = 0; i+3 < count; i += 2) {
 406             do_ef_quad( draw,
 407                         start + i + 2,
 408                         start + i + 0,
 409                         start + i + 1,
 410                         start + i + 3);
 411          }
 412       }
 413       else {
 414          for (i = 0; i+3 < count; i += 2) {
 415             do_quad( draw,
 416                      start + i + 2,
 417                      start + i + 0,
 418                      start + i + 1,
 419                      start + i + 3);
 420          }
 421       }
 422       break;
 423
 424    case PIPE_PRIM_POLYGON:
 425       if (unfilled) {
 426          unsigned ef_mask = (1<<2) | (1<<0);
 427
 428          for (i = 0; i+2 < count; i++) {
 429
 430             if (i + 3 >= count)
 431                ef_mask |= (1<<1);
 432
 433             do_ef_triangle( draw,
 434                             i == 0,
 435                             ef_mask,
 436                             start + i + 1,
 437                             start + i + 2,
 438                             start + 0);
 439
 440             ef_mask &= ~(1<<2);
 441          }
 442       }
 443       else {
 444          for (i = 0; i+2 < count; i++) {
 445             do_triangle( draw,
 446                          start + i + 1,
 447                          start + i + 2,
 448                          start + 0);
 449          }
 450       }
 451       break;
 452
 453    default:
 454       assert(0);
 455       break;
 456    }
 457 }
 458
 459
 460
 461
 462 /**
 463  * Draw vertex arrays
 464  * This is the main entrypoint into the drawing module.
 465  * \param prim  one of PIPE_PRIM_x
 466  * \param start  index of first vertex to draw
 467  * \param count  number of vertices to draw
 468  */
 469 void
 470 draw_arrays(struct draw_context *draw, unsigned prim,
 471             unsigned start, unsigned count)
 472 {
 473    if (reduced_prim[prim] != draw->reduced_prim) {
 474       draw_do_flush( draw, DRAW_FLUSH_STATE_CHANGE );
 475       draw->reduced_prim = reduced_prim[prim];
 476    }
 477
 478    /* drawing done here: */
 479    draw_prim(draw, prim, start, count);
 480 }
 481
 482