summaryrefslogtreecommitdiffstats
path: root/src/gallium/drivers/llvmpipe
diff options
context:
space:
mode:
authorBrian Paul <[email protected]>2010-01-15 11:26:35 -0700
committerBrian Paul <[email protected]>2010-01-15 11:26:35 -0700
commit12ba9e99db51a4a9e2e28a0574ef59f6548d8a84 (patch)
tree878cb71a34838d8b00773230398d6cfc3d9d4c8a /src/gallium/drivers/llvmpipe
parent4bef3575e605d890d9f228391b4724d27b025f49 (diff)
llvmpipe: added comment about lookup-tables vs. computation
Diffstat (limited to 'src/gallium/drivers/llvmpipe')
-rw-r--r--src/gallium/drivers/llvmpipe/lp_rast_tri.c3
1 files changed, 3 insertions, 0 deletions
diff --git a/src/gallium/drivers/llvmpipe/lp_rast_tri.c b/src/gallium/drivers/llvmpipe/lp_rast_tri.c
index 9c3f699ec71..92769beee1f 100644
--- a/src/gallium/drivers/llvmpipe/lp_rast_tri.c
+++ b/src/gallium/drivers/llvmpipe/lp_rast_tri.c
@@ -40,6 +40,9 @@
* Map an index in [0,15] to an x,y position, multiplied by 4.
* This is used to get the position of each subtile in a 4x4
* grid of edge step values.
+ * Note: we can use some bit twiddling to compute these values instead
+ * of using a look-up table, but there's no measurable performance
+ * difference.
*/
static const int pos_table4[16][2] = {
{ 0, 0 },