src/gallium/drivers/llvmpipe/lp_rast_tri_tmp.h

   1 /**************************************************************************
   2  *
   3  * Copyright 2007-2010 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 /*
  29  * Rasterization for binned triangles within a tile
  30  */
  31
  32
  33
  34 /**
  35  * Prototype for a 7 plane rasterizer function.  Will codegenerate
  36  * several of these.
  37  *
  38  * XXX: Varients for more/fewer planes.
  39  * XXX: Need ways of dropping planes as we descend.
  40  * XXX: SIMD
  41  */
  42 static void
  43 TAG(do_block_4)(struct lp_rasterizer_task *task,
  44                 const struct lp_rast_triangle *tri,
  45                 const struct lp_rast_plane *plane,
  46                 int x, int y,
  47                 const int *c)
  48 {
  49    unsigned mask = 0xffff;
  50    int j;
  51
  52    for (j = 0; j < NR_PLANES; j++) {
  53       mask &= ~build_mask(c[j] - 1,
  54                           plane[j].step[1],
  55                           plane[j].step[2]);
  56    }
  57
  58    /* Now pass to the shader:
  59     */
  60    if (mask)
  61       lp_rast_shade_quads_mask(task, &tri->inputs, x, y, mask);
  62 }
  63
  64 /**
  65  * Evaluate a 16x16 block of pixels to determine which 4x4 subblocks are in/out
  66  * of the triangle's bounds.
  67  */
  68 static void
  69 TAG(do_block_16)(struct lp_rasterizer_task *task,
  70                  const struct lp_rast_triangle *tri,
  71                  const struct lp_rast_plane *plane,
  72                  int x, int y,
  73                  const int *c)
  74 {
  75    unsigned outmask, inmask, partmask, partial_mask;
  76    unsigned j;
  77
  78    outmask = 0;                 /* outside one or more trivial reject planes */
  79    partmask = 0;                /* outside one or more trivial accept planes */
  80
  81    for (j = 0; j < NR_PLANES; j++) {
  82       const int dcdx = plane[j].step[1] * 4;
  83       const int dcdy = plane[j].step[2] * 4;
  84       const int cox = c[j] + plane[j].eo * 4;
  85       const int cio = c[j] + plane[j].ei * 4 - 1;
  86
  87       outmask |= build_mask(cox, dcdx, dcdy);
  88       partmask |= build_mask(cio, dcdx, dcdy);
  89    }
  90
  91    if (outmask == 0xffff)
  92       return;
  93
  94    /* Mask of sub-blocks which are inside all trivial accept planes:
  95     */
  96    inmask = ~partmask & 0xffff;
  97
  98    /* Mask of sub-blocks which are inside all trivial reject planes,
  99     * but outside at least one trivial accept plane:
 100     */
 101    partial_mask = partmask & ~outmask;
 102
 103    assert((partial_mask & inmask) == 0);
 104
 105    /* Iterate over partials:
 106     */
 107    while (partial_mask) {
 108       int i = ffs(partial_mask) - 1;
 109       int px = x + pos_table4[i][0];
 110       int py = y + pos_table4[i][1];
 111       int cx[NR_PLANES];
 112
 113       for (j = 0; j < NR_PLANES; j++)
 114          cx[j] = c[j] + plane[j].step[i] * 4;
 115
 116       partial_mask &= ~(1 << i);
 117
 118       TAG(do_block_4)(task, tri, plane, px, py, cx);
 119    }
 120
 121    /* Iterate over fulls:
 122     */
 123    while (inmask) {
 124       int i = ffs(inmask) - 1;
 125       int px = x + pos_table4[i][0];
 126       int py = y + pos_table4[i][1];
 127
 128       inmask &= ~(1 << i);
 129
 130       block_full_4(task, tri, px, py);
 131    }
 132 }
 133
 134
 135 /**
 136  * Scan the tile in chunks and figure out which pixels to rasterize
 137  * for this triangle.
 138  */
 139 void
 140 TAG(lp_rast_triangle)(struct lp_rasterizer_task *task,
 141                       const union lp_rast_cmd_arg arg)
 142 {
 143    const struct lp_rast_triangle *tri = arg.triangle.tri;
 144    unsigned plane_mask = arg.triangle.plane_mask;
 145    const int x = task->x, y = task->y;
 146    struct lp_rast_plane plane[NR_PLANES];
 147    int c[NR_PLANES];
 148    unsigned outmask, inmask, partmask, partial_mask;
 149    unsigned j, nr_planes = 0;
 150
 151    while (plane_mask) {
 152       int i = ffs(plane_mask) - 1;
 153       plane[nr_planes] = tri->plane[i];
 154       plane_mask &= ~(1 << i);
 155       nr_planes++;
 156    };
 157
 158    assert(nr_planes == NR_PLANES);
 159    outmask = 0;                 /* outside one or more trivial reject planes */
 160    partmask = 0;                /* outside one or more trivial accept planes */
 161
 162    for (j = 0; j < NR_PLANES; j++) {
 163       c[j] = plane[j].c + plane[j].dcdy * y - plane[j].dcdx * x;
 164    }
 165
 166    for (j = 0; j < NR_PLANES; j++) {
 167       const int dcdx = plane[j].step[1] * 16;
 168       const int dcdy = plane[j].step[2] * 16;
 169       const int cox = c[j] + plane[j].eo * 16;
 170       const int cio = c[j] + plane[j].ei * 16 - 1;
 171
 172       outmask |= build_mask(cox, dcdx, dcdy);
 173       partmask |= build_mask(cio, dcdx, dcdy);
 174    }
 175
 176    if (outmask == 0xffff)
 177       return;
 178
 179    /* Mask of sub-blocks which are inside all trivial accept planes:
 180     */
 181    inmask = ~partmask & 0xffff;
 182
 183    /* Mask of sub-blocks which are inside all trivial reject planes,
 184     * but outside at least one trivial accept plane:
 185     */
 186    partial_mask = partmask & ~outmask;
 187
 188    assert((partial_mask & inmask) == 0);
 189
 190    /* Iterate over partials:
 191     */
 192    while (partial_mask) {
 193       int i = ffs(partial_mask) - 1;
 194       int px = x + pos_table16[i][0];
 195       int py = y + pos_table16[i][1];
 196       int cx[NR_PLANES];
 197
 198       for (j = 0; j < NR_PLANES; j++)
 199          cx[j] = c[j] + plane[j].step[i] * 16;
 200
 201       partial_mask &= ~(1 << i);
 202
 203       LP_COUNT(nr_partially_covered_16);
 204       TAG(do_block_16)(task, tri, plane, px, py, cx);
 205    }
 206
 207    /* Iterate over fulls:
 208     */
 209    while (inmask) {
 210       int i = ffs(inmask) - 1;
 211       int px = x + pos_table16[i][0];
 212       int py = y + pos_table16[i][1];
 213
 214       inmask &= ~(1 << i);
 215
 216       LP_COUNT(nr_fully_covered_16);
 217       block_full_16(task, tri, px, py);
 218    }
 219 }
 220
 221 #undef TAG
 222 #undef NR_PLANES
 223