From 9c486774913f66c6496cd43cfd9dbd992c28d8cb Mon Sep 17 00:00:00 2001 From: Brian Paul Date: Tue, 1 Dec 2009 16:24:16 -0700 Subject: llvmpipe: simplify mask computation Make this a little easier to understand. --- src/gallium/drivers/llvmpipe/lp_rast_tri.c | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/src/gallium/drivers/llvmpipe/lp_rast_tri.c b/src/gallium/drivers/llvmpipe/lp_rast_tri.c index 9543b86ecd9..f6cb628ed4b 100644 --- a/src/gallium/drivers/llvmpipe/lp_rast_tri.c +++ b/src/gallium/drivers/llvmpipe/lp_rast_tri.c @@ -89,10 +89,12 @@ do_block_4( struct lp_rasterizer *rast, assert(x % 4 == 0); assert(y % 4 == 0); - for (i = 0; i < 16; i++) - mask |= (~(((c1 + tri->step[0][i]) | - (c2 + tri->step[1][i]) | - (c3 + tri->step[2][i])) >> 31)) & (1 << i); + for (i = 0; i < 16; i++) { + int any_negative = ((c1 + tri->step[0][i]) | + (c2 + tri->step[1][i]) | + (c3 + tri->step[2][i])) >> 31; + mask |= (~any_negative) & (1 << i); + } /* As we do trivial reject already, masks should rarely be all zero: */ -- cgit v1.2.3