Search
lxdream.org :: lxdream/src/pvr2/tacore.c
lxdream 0.9.1
released Jun 29
Download Now
filename src/pvr2/tacore.c
changeset 645:a7392098299c
prev561:533f6b478071
next669:ab344e42bca9
author nkeynes
date Fri Mar 28 12:32:25 2008 +0000 (13 years ago)
permissions -rw-r--r--
last change Merge lxdream-render branch (643:670) to trunk
view annotate diff log raw
     1 /**
     2  * $Id$
     3  *
     4  * PVR2 Tile Accelerator implementation
     5  *
     6  * Copyright (c) 2005 Nathan Keynes.
     7  *
     8  * This program is free software; you can redistribute it and/or modify
     9  * it under the terms of the GNU General Public License as published by
    10  * the Free Software Foundation; either version 2 of the License, or
    11  * (at your option) any later version.
    12  *
    13  * This program is distributed in the hope that it will be useful,
    14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    16  * GNU General Public License for more details.
    17  */
    18 #include <string.h>
    19 #include "pvr2.h"
    20 #include "asic.h"
    22 #define STATE_IDLE                 0
    23 #define STATE_IN_LIST              1
    24 #define STATE_IN_POLYGON           2
    25 #define STATE_EXPECT_POLY_BLOCK2   3
    26 #define STATE_EXPECT_VERTEX_BLOCK2 4
    27 #define STATE_ERROR                5
    28 #define STATE_EXPECT_END_VERTEX_BLOCK2 7
    30 #define TA_CMD(i) ( (i) >> 29 )
    31 #define TA_CMD_END_LIST 0
    32 #define TA_CMD_CLIP 1
    33 #define TA_CMD_POLYGON_CONTEXT 4
    34 #define TA_CMD_SPRITE_CONTEXT 5
    35 #define TA_CMD_VERTEX 7
    37 #define TA_LIST_NONE -1
    38 #define TA_LIST_OPAQUE 0
    39 #define TA_LIST_OPAQUE_MOD 1
    40 #define TA_LIST_TRANS 2
    41 #define TA_LIST_TRANS_MOD 3
    42 #define TA_LIST_PUNCH_OUT 4
    43 #define TA_IS_MODIFIER_LIST(list) (list == TA_LIST_OPAQUE_MOD || list == TA_LIST_TRANS_MOD)
    45 #define TA_GROW_UP 0
    46 #define TA_GROW_DOWN 1
    48 #define TA_VERTEX_NONE                        -1
    49 #define TA_VERTEX_PACKED                      0x00
    50 #define TA_VERTEX_TEX_PACKED                  0x08
    51 #define TA_VERTEX_TEX_SPEC_PACKED             0x0C
    52 #define TA_VERTEX_TEX_UV16_PACKED             0x09
    53 #define TA_VERTEX_TEX_UV16_SPEC_PACKED        0x0D
    54 #define TA_VERTEX_FLOAT                       0x10
    55 #define TA_VERTEX_TEX_FLOAT                   0x18
    56 #define TA_VERTEX_TEX_SPEC_FLOAT              0x1C
    57 #define TA_VERTEX_TEX_UV16_FLOAT              0x19
    58 #define TA_VERTEX_TEX_UV16_SPEC_FLOAT         0x1D
    59 #define TA_VERTEX_INTENSITY                   0x20
    60 #define TA_VERTEX_TEX_INTENSITY               0x28
    61 #define TA_VERTEX_TEX_SPEC_INTENSITY          0x2C
    62 #define TA_VERTEX_TEX_UV16_INTENSITY          0x29
    63 #define TA_VERTEX_TEX_UV16_SPEC_INTENSITY     0x2D
    64 #define TA_VERTEX_PACKED_MOD                  0x40
    65 #define TA_VERTEX_TEX_PACKED_MOD              0x48
    66 #define TA_VERTEX_TEX_SPEC_PACKED_MOD         0x4C
    67 #define TA_VERTEX_TEX_UV16_PACKED_MOD         0x49
    68 #define TA_VERTEX_TEX_UV16_SPEC_PACKED_MOD    0x4D
    69 #define TA_VERTEX_INTENSITY_MOD               0x60
    70 #define TA_VERTEX_TEX_INTENSITY_MOD           0x68
    71 #define TA_VERTEX_TEX_SPEC_INTENSITY_MOD      0x6C
    72 #define TA_VERTEX_TEX_UV16_INTENSITY_MOD      0x69
    73 #define TA_VERTEX_TEX_UV16_SPEC_INTENSITY_MOD 0x6D
    74 #define TA_VERTEX_SPRITE                      0x80
    75 #define TA_VERTEX_TEX_SPRITE                  0x88
    76 #define TA_VERTEX_MOD_VOLUME                  0x81
    77 #define TA_VERTEX_LISTLESS                    0xFF
    79 #define TA_IS_NORMAL_POLY() (ta_status.current_vertex_type < TA_VERTEX_SPRITE)
    81 static int strip_lengths[4] = {3,4,6,8}; /* in vertexes */
    82 #define TA_POLYCMD_LISTTYPE(i) ( ((i) >> 24) & 0x0F )
    83 #define TA_POLYCMD_USELENGTH(i) ( i & 0x00800000 )
    84 #define TA_POLYCMD_LENGTH(i)  strip_lengths[((i >> 18) & 0x03)]
    85 #define TA_POLYCMD_CLIP(i)  ((i>>16)&0x03)
    86 #define TA_POLYCMD_CLIP_NONE 0
    87 #define TA_POLYCMD_CLIP_INSIDE 2
    88 #define TA_POLYCMD_CLIP_OUTSIDE 3
    89 #define TA_POLYCMD_COLOURFMT(i)  (i & 0x00000030)
    90 #define TA_POLYCMD_COLOURFMT_ARGB32 0x00000000
    91 #define TA_POLYCMD_COLOURFMT_FLOAT 0x00000010
    92 #define TA_POLYCMD_COLOURFMT_INTENSITY 0x00000020
    93 #define TA_POLYCMD_COLOURFMT_LASTINT 0x00000030
    95 #define TA_POLYCMD_MODIFIED 0x00000080
    96 #define TA_POLYCMD_FULLMOD  0x00000040
    97 #define TA_POLYCMD_TEXTURED 0x00000008
    98 #define TA_POLYCMD_SPECULAR 0x00000004
    99 #define TA_POLYCMD_SHADED 0x00000002
   100 #define TA_POLYCMD_UV16 0x00000001
   102 #define TA_POLYCMD_IS_SPECULAR(i) ((i & 0x0000000C)==0x0000000C) /* Only applies to textured polys */
   103 #define TA_POLYCMD_IS_FULLMOD(i) ((i & 0x000000C0)==0x000000C0)
   106 #define TA_IS_END_VERTEX(i) (i & 0x10000000)
   108 /** Note these are not the IEEE 754 definitions - the TA treats NANs
   109  * as if they were INFs of the appropriate sign.
   110  */
   111 #define TA_IS_INF(f) (((*((uint32_t *)&f)) & 0xFF800000) == 0x7F800000)
   112 #define TA_IS_NINF(f) (((*((uint32_t *)&f)) & 0xFF800000) == 0xFF800000)
   114 #define MIN3( x1, x2, x3 ) ( (x1)<(x2)? ((x1)<(x3)?(x1):(x3)) : ((x2)<(x3)?(x2):(x3)) )
   115 #define MAX3( x1, x2, x3 ) ( (x1)>(x2)? ((x1)>(x3)?(x1):(x3)) : ((x2)>(x3)?(x2):(x3)) )
   117 #define TILESLOT( x, y ) (ta_status.current_tile_matrix + (ta_status.current_tile_size * (y * ta_status.width+ x) << 2))
   119 extern char *video_base;
   120 #define PVRRAM(addr) (*(uint32_t *)(video_base + ((addr)&PVR2_RAM_MASK)))
   122 struct pvr2_ta_vertex {
   123     float x,y,z;
   124     uint32_t detail[8]; /* 0-8 detail words */
   125 };
   127 struct tile_bounds {
   128     int x1, y1, x2, y2;
   129 };
   131 struct pvr2_ta_status {
   132     int state;
   133     int width, height; /* Tile resolution, ie 20x15 */
   134     int tilelist_dir; /* Growth direction of the tilelist, 0 = up, 1 = down */
   135     uint32_t tilelist_size; /* Size of the tilelist segments */
   136     uint32_t tilelist_start; /* Initial address of the tilelist */
   137     int polybuf_start; /* Initial bank address of the polygon buffer (ie &0x00F00000) */
   138     int current_vertex_type;
   139     gboolean accept_vertexes;
   140     int vertex_count; /* index of last start-vertex seen, or -1 if no vertexes 
   141 			 * are present
   142 			 */
   143     int max_vertex;     /* Maximum number of vertexes in the current polygon (3/4/6/8) */
   144     int current_list_type;
   145     uint32_t current_tile_matrix; /* Memory location of the first tile for the current list. */
   146     uint32_t current_tile_size; /* Size of the tile matrix space  in 32-bit words (0/8/16/32)*/
   147     uint32_t intensity1, intensity2;
   148     struct tile_bounds clip;
   149     int clip_mode;
   150     /**
   151      * Current working object
   152      */
   153     int poly_context_size;
   154     int poly_vertex_size;
   155     int poly_parity;
   156     uint32_t poly_context[5];
   157     uint32_t poly_pointer;
   158     struct tile_bounds last_triangle_bounds;
   159     struct pvr2_ta_vertex poly_vertex[8];
   160     int debug_output;
   161 };
   163 static struct pvr2_ta_status ta_status;
   165 static int tilematrix_sizes[4] = {0,8,16,32};
   167 /**
   168  * Convenience union - ta data is either 32-bit integer or 32-bit float.
   169  */
   170 union ta_data {
   171     unsigned int i;
   172     float f;
   173 };
   176 void pvr2_ta_reset() {
   177     ta_status.state = STATE_ERROR; /* State not valid until initialized */
   178     ta_status.debug_output = 0;
   179 }
   181 void pvr2_ta_save_state( FILE *f )
   182 {
   183     fwrite( &ta_status, sizeof(ta_status), 1, f );
   184 }
   186 int pvr2_ta_load_state( FILE *f )
   187 {
   188     if( fread( &ta_status, sizeof(ta_status), 1, f ) != 1 )
   189 	return 1;
   190     return 0;
   191 }
   193 void pvr2_ta_init() {
   194     ta_status.state = STATE_IDLE;
   195     ta_status.current_list_type = -1;
   196     ta_status.current_vertex_type = -1;
   197     ta_status.poly_parity = 0;
   198     ta_status.vertex_count = 0;
   199     ta_status.max_vertex = 3;
   200     ta_status.current_vertex_type = TA_VERTEX_LISTLESS;
   201     ta_status.poly_vertex_size = 0;
   202     memset(&ta_status.poly_context[1], 0, 4);
   203     ta_status.last_triangle_bounds.x1 = -1;
   204     ta_status.accept_vertexes = TRUE;
   205     ta_status.clip.x1 = 0;
   206     ta_status.clip.y1 = 0;
   207     ta_status.clip_mode = TA_POLYCMD_CLIP_NONE;
   209     uint32_t size = MMIO_READ( PVR2, TA_TILESIZE );
   210     ta_status.width = (size & 0xFFFF) + 1;
   211     ta_status.height = (size >> 16) + 1;
   212     ta_status.clip.x2 = ta_status.width-1;
   213     ta_status.clip.y2 = ta_status.height-1;
   214     uint32_t control = MMIO_READ( PVR2, TA_TILECFG );
   215     ta_status.tilelist_dir = (control >> 20) & 0x01;
   216     ta_status.tilelist_size = tilematrix_sizes[ (control & 0x03) ];
   217     MMIO_WRITE( PVR2, TA_POLYPOS, MMIO_READ( PVR2, TA_POLYBASE ) );
   218     uint32_t plistpos = MMIO_READ( PVR2, TA_LISTBASE ) >> 2;
   219     if( ta_status.tilelist_dir == TA_GROW_DOWN ) {
   220 	plistpos -= ta_status.tilelist_size;
   221     }
   222     MMIO_WRITE( PVR2, TA_LISTPOS, plistpos );
   223     ta_status.tilelist_start = plistpos;
   224     ta_status.polybuf_start = MMIO_READ( PVR2, TA_POLYBASE ) & 0x00F00000;
   225 }
   227 static uint32_t parse_float_colour( float a, float r, float g, float b ) {
   228     int ai,ri,gi,bi;
   230     if( TA_IS_INF(a) ) {
   231 	ai = 255;
   232     } else {
   233 	ai = 256 * CLAMP(a,0.0,1.0) - 1;
   234 	if( ai < 0 ) ai = 0;
   235     }
   236     if( TA_IS_INF(r) ) {
   237 	ri = 255;
   238     } else {
   239 	ri = 256 * CLAMP(r,0.0,1.0) - 1;
   240 	if( ri < 0 ) ri = 0;
   241     }
   242     if( TA_IS_INF(g) ) {
   243 	gi = 255;
   244     } else {
   245 	gi = 256 * CLAMP(g,0.0,1.0) - 1;
   246 	if( gi < 0 ) gi = 0;
   247     }
   248     if( TA_IS_INF(b) ) {
   249 	bi = 255;
   250     } else {
   251 	bi = 256 * CLAMP(b,0.0,1.0) - 1;
   252 	if( bi < 0 ) bi = 0;
   253     }
   254     return (ai << 24) | (ri << 16) | (gi << 8) | bi;
   255 }
   257 static uint32_t parse_intensity_colour( uint32_t base, float intensity )
   258 {
   259     unsigned int i = (unsigned int)(256 * CLAMP(intensity, 0.0,1.0));
   261     return
   262 	(((((base & 0xFF) * i) & 0xFF00) |
   263 	  (((base & 0xFF00) * i) & 0xFF0000) |
   264 	  (((base & 0xFF0000) * i) & 0xFF000000)) >> 8) |
   265 	(base & 0xFF000000);
   266 }
   268 /**
   269  * Initialize the specified TA list.
   270  */
   271 static void ta_init_list( unsigned int listtype ) {
   272     int config = MMIO_READ( PVR2, TA_TILECFG );
   273     int tile_matrix = MMIO_READ( PVR2, TA_TILEBASE );
   274     int list_end = MMIO_READ( PVR2, TA_LISTEND );
   276     ta_status.current_tile_matrix = tile_matrix;
   278     /* If the list grows down, the end must be < tile matrix start. 
   279      * If it grows up, the end must be > tile matrix start.
   280      * Don't ask me why, it just does...
   281      */
   282     if( ((ta_status.tilelist_dir == TA_GROW_DOWN && list_end <= tile_matrix) ||
   283 	 (ta_status.tilelist_dir == TA_GROW_UP && list_end >= tile_matrix )) &&
   284 	listtype <= TA_LIST_PUNCH_OUT ) {
   285 	int i;
   286 	uint32_t *p;
   287 	for( i=0; i < listtype; i++ ) {
   288 	    int size = tilematrix_sizes[(config & 0x03)] << 2;
   289 	    ta_status.current_tile_matrix += ta_status.width * ta_status.height * size;
   290 	    config >>= 4;
   291 	}
   292 	ta_status.current_tile_size = tilematrix_sizes[(config & 0x03)];
   294 	/* Initialize each tile to 0xF0000000 */
   295 	if( ta_status.current_tile_size != 0 ) {
   296 	    p = (uint32_t *)(video_base + ta_status.current_tile_matrix);
   297 	    for( i=0; i< ta_status.width * ta_status.height; i++ ) {
   298 		*p = 0xF0000000;
   299 		p += ta_status.current_tile_size;
   300 	    }
   301 	}
   302     } else {
   303 	ta_status.current_tile_size = 0;
   304     }
   306     if( tile_matrix == list_end ) {
   307 	ta_status.current_tile_size = 0;
   308     }
   310     ta_status.state = STATE_IN_LIST;
   311     ta_status.current_list_type = listtype;
   312     ta_status.last_triangle_bounds.x1 = -1;
   313 }
   315 static int list_events[5] = {EVENT_PVR_OPAQUE_DONE, EVENT_PVR_OPAQUEMOD_DONE, 
   316 			     EVENT_PVR_TRANS_DONE, EVENT_PVR_TRANSMOD_DONE,
   317 			     EVENT_PVR_PUNCHOUT_DONE };
   319 static void ta_end_list() {
   320     if( ta_status.current_list_type != TA_LIST_NONE ) {
   321 	asic_event( list_events[ta_status.current_list_type] );
   322     }
   323     ta_status.current_list_type = TA_LIST_NONE;
   324     ta_status.current_vertex_type = TA_VERTEX_LISTLESS;
   325     ta_status.poly_vertex_size = 0;
   326     memset(&ta_status.poly_context[1], 0, 4);
   327     ta_status.state = STATE_IDLE;
   328 }
   330 static void ta_bad_input_error() {
   331     asic_event( EVENT_PVR_BAD_INPUT );
   332 }
   334 /**
   335  * Write data out to the polygon buffer.
   336  * If the end-of-buffer is reached, asserts EVENT_PVR_PRIM_ALLOC_FAIL
   337  * @param data to be written
   338  * @param length Number of 32-bit words to write.
   339  * @return number of words actually written
   340  */
   341 static int ta_write_polygon_buffer( uint32_t *data, int length )
   342 {
   343     int rv;
   344     int posn = MMIO_READ( PVR2, TA_POLYPOS );
   345     int end = MMIO_READ( PVR2, TA_POLYEND );
   346     uint32_t *target = (uint32_t *)(video_base + posn);
   347     for( rv=0; rv < length; rv++ ) {
   348 	if( posn == end ) {
   349 	    asic_event( EVENT_PVR_PRIM_ALLOC_FAIL );
   350 	    //	    ta_status.state = STATE_ERROR;
   351 	    break;
   352 	}
   353 	if( posn < PVR2_RAM_SIZE ) {
   354 	    *target++ = *data++;
   355 	}
   356 	posn += 4;
   357     }
   359     MMIO_WRITE( PVR2, TA_POLYPOS, posn );
   360     return rv;
   361 }
   363 #define TA_NO_ALLOC 0xFFFFFFFF
   365 /**
   366  * Allocate a new tile list block from the grow space and update the
   367  * word at reference to be a link to the new block.
   368  */
   369 static uint32_t ta_alloc_tilelist( uint32_t reference ) {
   370     uint32_t posn = MMIO_READ( PVR2, TA_LISTPOS );
   371     uint32_t limit = MMIO_READ( PVR2, TA_LISTEND ) >> 2;
   372     uint32_t newposn;
   373     if( ta_status.tilelist_dir == TA_GROW_DOWN ) {
   374 	newposn = posn - ta_status.tilelist_size;
   375 	if( posn == limit ) {
   376 	    PVRRAM(posn<<2) = 0xF0000000;
   377 	    PVRRAM(reference) = 0xE0000000 | (posn<<2);
   378 	    return TA_NO_ALLOC;
   379 	} else if( posn < limit ) {
   380 	    PVRRAM(reference) = 0xE0000000 | (posn<<2);
   381 	    return TA_NO_ALLOC;
   382 	} else if( newposn <= limit ) {
   383 	} else if( newposn <= (limit + ta_status.tilelist_size) ) {
   384 	    asic_event( EVENT_PVR_MATRIX_ALLOC_FAIL );
   385 	    MMIO_WRITE( PVR2, TA_LISTPOS, newposn );
   386 	} else {
   387 	    MMIO_WRITE( PVR2, TA_LISTPOS, newposn );
   388 	}
   389 	PVRRAM(reference) = 0xE0000000 | (posn<<2);
   390 	return posn << 2;
   391     } else {
   392 	newposn = posn + ta_status.tilelist_size;
   393 	if( posn == limit ) {
   394 	    PVRRAM(posn<<2) = 0xF0000000;
   395 	    PVRRAM(reference) = 0xE0000000 | (posn<<2);
   396 	    return TA_NO_ALLOC;
   397 	} else if ( posn > limit ) {
   398 	    PVRRAM(reference) = 0xE0000000 | (posn<<2);
   399 	    return TA_NO_ALLOC;
   400 	} else if( newposn >= limit ) {
   401 	} else if( newposn >= (limit - ta_status.tilelist_size) ) {
   402 	    asic_event( EVENT_PVR_MATRIX_ALLOC_FAIL );
   403 	    MMIO_WRITE( PVR2, TA_LISTPOS, newposn );
   404 	} else {
   405 	    MMIO_WRITE( PVR2, TA_LISTPOS, newposn );
   406 	}	    
   407 	PVRRAM(reference) = 0xE0000000 | (posn<<2);
   408 	return posn << 2;
   409     }
   410 }
   412 /**
   413  * Write a tile entry out to the matrix.
   414  */
   415 static void ta_write_tile_entry( int x, int y, uint32_t tile_entry ) {
   416     uint32_t tile = TILESLOT(x,y);
   417     uint32_t tilestart = tile;
   418     uint32_t value;
   419     uint32_t lasttri = 0;
   420     int i;
   422     if( ta_status.clip_mode == TA_POLYCMD_CLIP_OUTSIDE &&
   423 	x >= ta_status.clip.x1 && x <= ta_status.clip.x2 &&
   424 	y >= ta_status.clip.y1 && y <= ta_status.clip.y2 ) {
   425 	/* Tile clipped out */
   426 	return;
   427     }
   429     if( (tile_entry & 0x80000000) && 
   430 	ta_status.last_triangle_bounds.x1 != -1 &&
   431 	ta_status.last_triangle_bounds.x1 <= x &&
   432 	ta_status.last_triangle_bounds.x2 >= x &&
   433 	ta_status.last_triangle_bounds.y1 <= y &&
   434 	ta_status.last_triangle_bounds.y2 >= y ) {
   435 	/* potential for triangle stacking */
   436 	lasttri = tile_entry & 0xE1E00000;
   437     }
   440     if( PVRRAM(tile) == 0xF0000000 ) {
   441 	PVRRAM(tile) = tile_entry;
   442 	PVRRAM(tile+4) = 0xF0000000;
   443 	return;
   444     }
   446     while(1) {
   447 	value = PVRRAM(tile);
   448 	for( i=1; i<ta_status.current_tile_size; i++ ) {
   449 	    tile += 4;
   450 	    uint32_t nextval = PVRRAM(tile);
   451 	    if( nextval == 0xF0000000 ) {
   452 		if( lasttri != 0 && lasttri == (value&0xE1E00000) ) {
   453 		    int count = (value & 0x1E000000) + 0x02000000;
   454 		    if( count < 0x20000000 ) {
   455 			PVRRAM(tile-4) = (value & 0xE1FFFFFF) | count;
   456 			return;
   457 		    }
   458 		}
   459 		if( i < ta_status.current_tile_size-1 ) {
   460 		    PVRRAM(tile) = tile_entry;
   461 		    PVRRAM(tile+4) = 0xF0000000;
   462 		    return;
   463 		}
   464 	    }
   465 	    value = nextval;
   466 	}
   468 	if( value == 0xF0000000 ) {
   469 	    tile = ta_alloc_tilelist(tile);
   470 	    if( tile != TA_NO_ALLOC ) {
   471 		PVRRAM(tile) = tile_entry;
   472 		PVRRAM(tile+4) = 0xF0000000;
   473 	    }
   474 	    return;
   475 	} else if( (value & 0xFF000000) == 0xE0000000 ) {
   476 	    value &= 0x00FFFFFF;
   477 	    if( value == tilestart )
   478 		return; /* Loop */
   479 	    tilestart = tile = value;
   480 	} else {
   481 	    /* This should never happen */
   482 	    return;
   483 	}
   484     }
   485 }
   487 /**
   488  * Write a completed polygon out to the memory buffers 
   489  * OPTIMIZEME: This is not terribly efficient at the moment.
   490  */
   491 static void ta_commit_polygon( ) {
   492     int i, x, y;
   493     int tx[ta_status.vertex_count], ty[ta_status.vertex_count];
   494     struct tile_bounds triangle_bound[ta_status.vertex_count - 2];
   495     struct tile_bounds polygon_bound;
   496     uint32_t poly_context[5];
   498     memcpy( poly_context, ta_status.poly_context, ta_status.poly_context_size * 4 );
   500     /* Compute the tile coordinates for each vertex (need to be careful with
   501      * clamping here)
   502      */
   503     for( i=0; i<ta_status.vertex_count; i++ ) {
   504 	if( ta_status.poly_vertex[i].x < 0.0 || TA_IS_NINF(ta_status.poly_vertex[i].x) ) {
   505 	    tx[i] = -1;
   506 	} else if( ta_status.poly_vertex[i].x > (float)INT_MAX || TA_IS_INF(ta_status.poly_vertex[i].x) ) {
   507 	    tx[i] = INT_MAX/32;
   508 	} else {
   509 	    tx[i] = (int)(ta_status.poly_vertex[i].x / 32.0);
   510 	}
   511 	if( ta_status.poly_vertex[i].y < 0.0 || TA_IS_NINF(ta_status.poly_vertex[i].y)) {
   512 	    ty[i] = -1;
   513 	} else if( ta_status.poly_vertex[i].y > (float)INT_MAX || TA_IS_INF(ta_status.poly_vertex[i].y) ) {
   514 	    ty[i] = INT_MAX/32;
   515 	} else {
   516 	    ty[i] = (int)(ta_status.poly_vertex[i].y / 32.0);
   517 	}
   519     }
   521     /* Compute bounding box for each triangle individually, as well
   522      * as the overall polygon.
   523      */
   525     for( i=0; i<ta_status.vertex_count-2; i++ ) {
   526 	triangle_bound[i].x1 = MIN3(tx[i],tx[i+1],tx[i+2]);
   527 	triangle_bound[i].x2 = MAX3(tx[i],tx[i+1],tx[i+2]);
   528 	triangle_bound[i].y1 = MIN3(ty[i],ty[i+1],ty[i+2]);
   529 	triangle_bound[i].y2 = MAX3(ty[i],ty[i+1],ty[i+2]);
   530 	if( i == 0 ) {
   531 	    polygon_bound.x1 = triangle_bound[0].x1;
   532 	    polygon_bound.y1 = triangle_bound[0].y1;
   533 	    polygon_bound.x2 = triangle_bound[0].x2;
   534 	    polygon_bound.y2 = triangle_bound[0].y2;
   535 	} else {
   536 	    polygon_bound.x1 = MIN(polygon_bound.x1, triangle_bound[i].x1);
   537 	    polygon_bound.x2 = MAX(polygon_bound.x2, triangle_bound[i].x2);
   538 	    polygon_bound.y1 = MIN(polygon_bound.y1, triangle_bound[i].y1);
   539 	    polygon_bound.y2 = MAX(polygon_bound.y2, triangle_bound[i].y2);
   540 	}
   541     }
   543     /* Clamp the polygon bounds to the frustum */
   544     if( polygon_bound.x1 < 0 ) polygon_bound.x1 = 0;
   545     if( polygon_bound.x2 >= ta_status.width ) polygon_bound.x2 = ta_status.width-1;
   546     if( polygon_bound.y1 < 0 ) polygon_bound.y1 = 0;
   547     if( polygon_bound.y2 >= ta_status.width ) polygon_bound.y2 = ta_status.height-1;
   549     /* Set the "single tile" flag if it's entirely contained in 1 tile */
   550     if( polygon_bound.x1 == polygon_bound.x2 &&
   551 	polygon_bound.y1 == polygon_bound.y2 ) {
   552 	poly_context[0] |= 0x00200000;
   553     }
   555     /* If the polygon is entirely clipped, don't even write the polygon data */
   556     switch( ta_status.clip_mode ) {
   557     case TA_POLYCMD_CLIP_NONE:
   558 	if( polygon_bound.x2 < 0 || polygon_bound.x1 >= ta_status.width ||
   559 	    polygon_bound.y2 < 0 || polygon_bound.y1 >= ta_status.height ) {
   560 	    return;
   561 	}
   562 	break;
   563     case TA_POLYCMD_CLIP_INSIDE:
   564 	if( polygon_bound.x2 < ta_status.clip.x1 || polygon_bound.x1 > ta_status.clip.x2 ||
   565 	    polygon_bound.y2 < ta_status.clip.y1 || polygon_bound.y1 > ta_status.clip.y2 ) {
   566 	    return;
   567 	} else {
   568 	    /* Clamp to clip bounds */
   569 	    if( polygon_bound.x1 < ta_status.clip.x1 ) polygon_bound.x1 = ta_status.clip.x1;
   570 	    if( polygon_bound.x2 > ta_status.clip.x2 ) polygon_bound.x2 = ta_status.clip.x2;
   571 	    if( polygon_bound.y1 < ta_status.clip.y1 ) polygon_bound.y1 = ta_status.clip.y1;
   572 	    if( polygon_bound.y2 > ta_status.clip.y2 ) polygon_bound.y2 = ta_status.clip.y2;
   573 	}
   574 	break;
   575     case TA_POLYCMD_CLIP_OUTSIDE:
   576 	if( polygon_bound.x1 >= ta_status.clip.x1 && polygon_bound.x2 <= ta_status.clip.x2 &&
   577 	    polygon_bound.y1 >= ta_status.clip.y1 && polygon_bound.y2 <= ta_status.clip.y2 ) {
   578 	    return;
   579 	}
   580 	break;
   581     }
   583     /* Ok, we're good to go - write out the polygon first */
   584     uint32_t tile_entry = (MMIO_READ( PVR2, TA_POLYPOS ) - ta_status.polybuf_start) >> 2 | 
   585 	ta_status.poly_pointer;
   587     int status = ta_write_polygon_buffer( poly_context, ta_status.poly_context_size );
   588     if( status == 0 ) {
   589 	/* No memory available - abort */
   590 	return;
   591     } else {
   592 	for( i=0; i<ta_status.vertex_count && status != 0; i++ ) {
   593 	    status = ta_write_polygon_buffer( (uint32_t *)(&ta_status.poly_vertex[i]), 3 + ta_status.poly_vertex_size );
   594 	}
   595     }
   597     if( ta_status.current_tile_size == 0 ) {
   598 	/* No memory for tile entry, so don't write anything */
   599 	return;
   600     }
   602     /* And now the tile entries. Triangles are different from everything else */
   603     if( ta_status.vertex_count == 3 ) {
   604 	tile_entry |= 0x80000000;
   605 	for( y=polygon_bound.y1; y<=polygon_bound.y2; y++ ) {
   606 	    for( x=polygon_bound.x1; x<=polygon_bound.x2; x++ ) {
   607 		ta_write_tile_entry( x,y,tile_entry );
   608 	    }
   609 	}
   610 	ta_status.last_triangle_bounds.x1 = polygon_bound.x1;
   611 	ta_status.last_triangle_bounds.y1 = polygon_bound.y1;
   612 	ta_status.last_triangle_bounds.x2 = polygon_bound.x2;
   613 	ta_status.last_triangle_bounds.y2 = polygon_bound.y2;
   614     } else if( ta_status.current_vertex_type == TA_VERTEX_SPRITE ||
   615 	       ta_status.current_vertex_type == TA_VERTEX_TEX_SPRITE ) {
   616 	tile_entry |= 0xA0000000;
   617 	for( y=polygon_bound.y1; y<=polygon_bound.y2; y++ ) {
   618 	    for( x=polygon_bound.x1; x<=polygon_bound.x2; x++ ) {
   619 		ta_write_tile_entry( x,y,tile_entry );
   620 	    }
   621 	}
   622 	ta_status.last_triangle_bounds.x1 = polygon_bound.x1;
   623 	ta_status.last_triangle_bounds.y1 = polygon_bound.y1;
   624 	ta_status.last_triangle_bounds.x2 = polygon_bound.x2;
   625 	ta_status.last_triangle_bounds.y2 = polygon_bound.y2;
   626     } else {
   627 	for( y=polygon_bound.y1; y<=polygon_bound.y2; y++ ) {
   628 	    for( x=polygon_bound.x1; x<=polygon_bound.x2; x++ ) {
   629 		uint32_t entry = tile_entry;
   630 		for( i=0; i<ta_status.vertex_count-2; i++ ) {
   631 		    if( triangle_bound[i].x1 <= x && triangle_bound[i].x2 >= x &&
   632 			triangle_bound[i].y1 <= y && triangle_bound[i].y2 >= y ) {
   633 			entry |= (0x40000000>>i);
   634 		    }
   635 		}
   636 		ta_write_tile_entry( x, y, entry );
   637 	    }
   638 	}
   639 	ta_status.last_triangle_bounds.x1 = -1;
   640     }
   641 }
   643 /**
   644  * Variant of ta_split_polygon called when vertex_count == max_vertex, but 
   645  * the client hasn't sent the LAST VERTEX flag. Commit the poly as normal
   646  * first, then start a new poly with the first 2 vertexes taken from the 
   647  * current one.
   648  */
   649 static void ta_split_polygon() {
   650     ta_commit_polygon();
   651     if( TA_IS_NORMAL_POLY() ) { 
   652 	/* This only applies to ordinary polys - Sprites + modifier lists are
   653 	 * handled differently
   654 	 */
   655 	if( ta_status.vertex_count == 3 ) {
   656 	    /* Triangles use an odd/even scheme */
   657 	    if( ta_status.poly_parity == 0 ) {
   658 		memcpy( &ta_status.poly_vertex[0], &ta_status.poly_vertex[2], 
   659 			sizeof(struct pvr2_ta_vertex) );
   660 		ta_status.poly_parity = 1;
   661 	    } else {
   662 		memcpy( &ta_status.poly_vertex[1], &ta_status.poly_vertex[2],
   663 			sizeof(struct pvr2_ta_vertex) );
   664 		ta_status.poly_parity = 0;
   665 	    }
   666 	} else {
   667 	    /* Everything else just uses the last 2 vertexes in order */
   668 	    memcpy( &ta_status.poly_vertex[0], &ta_status.poly_vertex[ta_status.vertex_count-2], 
   669 		    sizeof(struct pvr2_ta_vertex)*2 );
   670 	    ta_status.poly_parity = 0;
   671 	}
   672 	ta_status.vertex_count = 2;
   673     } else {
   674 	ta_status.vertex_count = 0;
   675     }
   676 }
   678 /**
   679  * Parse the polygon context block and setup the internal state to receive
   680  * vertexes.
   681  * @param data 32 bytes of parameter data.
   682  */
   683 static void ta_parse_polygon_context( union ta_data *data ) {
   684     int colourfmt = TA_POLYCMD_COLOURFMT(data[0].i);
   685     if( TA_POLYCMD_USELENGTH(data[0].i) ) {
   686 	ta_status.max_vertex = TA_POLYCMD_LENGTH(data[0].i);
   687     }
   688     ta_status.clip_mode = TA_POLYCMD_CLIP(data[0].i);
   689     if( ta_status.clip_mode == 1 ) { /* Reserved - treat as CLIP_INSIDE */
   690 	ta_status.clip_mode = TA_POLYCMD_CLIP_INSIDE;
   691     }
   692     ta_status.vertex_count = 0;
   693     ta_status.poly_context[0] = 
   694 	(data[1].i & 0xFC1FFFFF) | ((data[0].i & 0x0B) << 22);
   695     ta_status.poly_context[1] = data[2].i;
   696     ta_status.poly_context[3] = data[4].i;
   697     ta_status.poly_parity = 0;
   698     if( data[0].i & TA_POLYCMD_TEXTURED ) {
   699 	ta_status.current_vertex_type = data[0].i & 0x0D;
   700 	ta_status.poly_context[2] = data[3].i;
   701 	ta_status.poly_context[4] = data[5].i;
   702 	if( data[0].i & TA_POLYCMD_SPECULAR ) {
   703 	    ta_status.poly_context[0] |= 0x01000000;
   704 	    ta_status.poly_vertex_size = 4;
   705 	} else {
   706 	    ta_status.poly_vertex_size = 3;
   707 	}
   708 	if( data[0].i & TA_POLYCMD_UV16 ) {
   709 	    ta_status.poly_vertex_size--;
   710 	}
   711     } else {
   712 	ta_status.current_vertex_type = 0;
   713 	ta_status.poly_vertex_size = 1;
   714 	ta_status.poly_context[2] = 0;
   715 	ta_status.poly_context[4] = 0;
   716     }
   718     ta_status.poly_pointer = (ta_status.poly_vertex_size << 21);
   719     ta_status.poly_context_size = 3;
   720     if( data[0].i & TA_POLYCMD_MODIFIED ) {
   721 	ta_status.poly_pointer |= 0x01000000;
   722 	if( data[0].i & TA_POLYCMD_FULLMOD ) {
   723 	    ta_status.poly_context_size = 5;
   724 	    ta_status.poly_vertex_size <<= 1;
   725 	    ta_status.current_vertex_type |= 0x40;
   726 	    /* Modified/float not supported - behaves as per last intensity */
   727 	    if( colourfmt == TA_POLYCMD_COLOURFMT_FLOAT ) {
   728 		colourfmt = TA_POLYCMD_COLOURFMT_LASTINT;
   729 	    }
   730 	}
   731     }
   733     if( colourfmt == TA_POLYCMD_COLOURFMT_INTENSITY ) {
   734 	if( TA_POLYCMD_IS_FULLMOD(data[0].i) ||
   735 	    TA_POLYCMD_IS_SPECULAR(data[0].i) ) {
   736 	    ta_status.state = STATE_EXPECT_POLY_BLOCK2;
   737 	} else {
   738 	    ta_status.intensity1 = 
   739 		parse_float_colour( data[4].f, data[5].f, data[6].f, data[7].f );
   740 	}
   741     } else if( colourfmt == TA_POLYCMD_COLOURFMT_LASTINT ) {
   742 	colourfmt = TA_POLYCMD_COLOURFMT_INTENSITY;
   743     }
   745     ta_status.current_vertex_type |= colourfmt;
   746 }
   748 /**
   749  * Parse the modifier volume context block and setup the internal state to 
   750  * receive modifier vertexes.
   751  * @param data 32 bytes of parameter data.
   752  */
   753 static void ta_parse_modifier_context( union ta_data *data ) {
   754     ta_status.current_vertex_type = TA_VERTEX_MOD_VOLUME;
   755     ta_status.poly_vertex_size = 0;
   756     ta_status.clip_mode = TA_POLYCMD_CLIP(data[0].i);
   757     if( ta_status.clip_mode == 1 ) { /* Reserved - treat as CLIP_INSIDE */
   758 	ta_status.clip_mode = TA_POLYCMD_CLIP_INSIDE;
   759     }
   760     ta_status.poly_context_size = 3;
   761     ta_status.poly_context[0] = (data[1].i & 0xFC1FFFFF) |
   762 	((data[0].i & 0x0B)<<22);
   763     if( TA_POLYCMD_IS_SPECULAR(data[0].i) ) {
   764 	ta_status.poly_context[0] |= 0x01000000;
   765     }
   766     ta_status.poly_context[1] = 0;
   767     ta_status.poly_context[2] = 0;
   768     ta_status.vertex_count = 0;
   769     ta_status.max_vertex = 3;
   770     ta_status.poly_pointer = 0;
   771 }
   773 /**
   774  * Parse the sprite context block and setup the internal state to receive
   775  * vertexes.
   776  * @param data 32 bytes of parameter data.
   777  */
   778 static void ta_parse_sprite_context( union ta_data *data ) {
   779     ta_status.poly_context_size = 3;
   780     ta_status.poly_context[0] = (data[1].i & 0xFC1FFFFF) |
   781 	((data[0].i & 0x0B)<<22) | 0x00400000;
   782     ta_status.clip_mode = TA_POLYCMD_CLIP(data[0].i);
   783     if( ta_status.clip_mode == 1 ) { /* Reserved - treat as CLIP_INSIDE */
   784 	ta_status.clip_mode = TA_POLYCMD_CLIP_INSIDE;
   785     }
   786     if( TA_POLYCMD_IS_SPECULAR(data[0].i) ) {
   787 	ta_status.poly_context[0] |= 0x01000000;
   788     }
   789     ta_status.poly_context[1] = data[2].i;
   790     ta_status.poly_context[2] = data[3].i;
   791     if( data[0].i & TA_POLYCMD_TEXTURED ) {
   792 	ta_status.poly_vertex_size = 2;
   793 	ta_status.poly_vertex[2].detail[1] = data[4].i;
   794 	ta_status.current_vertex_type = TA_VERTEX_TEX_SPRITE;
   795     } else {
   796 	ta_status.poly_vertex_size = 1;
   797 	ta_status.poly_vertex[2].detail[0] = data[4].i;
   798 	ta_status.current_vertex_type = TA_VERTEX_SPRITE;
   799     }
   800     ta_status.vertex_count = 0;
   801     ta_status.max_vertex = 4;
   802     ta_status.poly_pointer = (ta_status.poly_vertex_size << 21);
   803 }
   805 /**
   806  * Copy the last read vertex into all vertexes up to max_vertex. Used for
   807  * Aborted polygons under some circumstances.
   808  */
   809 static void ta_fill_vertexes( ) {
   810     int i;
   811     for( i=ta_status.vertex_count; i<ta_status.max_vertex; i++ ) {
   812 	memcpy( &ta_status.poly_vertex[i], &ta_status.poly_vertex[ta_status.vertex_count-1],
   813 		sizeof( struct pvr2_ta_vertex ) );
   814     }
   815 }
   817 static void ta_parse_vertex( union ta_data *data ) {
   818     struct pvr2_ta_vertex *vertex = &ta_status.poly_vertex[ta_status.vertex_count];
   819     vertex->x = data[1].f;
   820     vertex->y = data[2].f;
   821     vertex->z = data[3].f;
   823     switch( ta_status.current_vertex_type ) {
   824     case TA_VERTEX_PACKED:
   825 	vertex->detail[0] = data[6].i;
   826 	break;
   827     case TA_VERTEX_FLOAT:
   828 	vertex->detail[0] = parse_float_colour( data[4].f, data[5].f, data[6].f, data[7].f );
   829 	break;
   830     case TA_VERTEX_INTENSITY:
   831 	vertex->detail[0] = parse_intensity_colour( ta_status.intensity1, data[6].f );
   832 	break;
   834     case TA_VERTEX_TEX_SPEC_PACKED:
   835 	vertex->detail[3] = data[7].i; /* ARGB */
   836 	/* Fallthrough */
   837     case TA_VERTEX_TEX_PACKED:
   838 	vertex->detail[0] = data[4].i; /* U */
   839 	vertex->detail[1] = data[5].i; /* V */
   840 	vertex->detail[2] = data[6].i; /* ARGB */
   841 	break;
   842     case TA_VERTEX_TEX_UV16_SPEC_PACKED:
   843 	vertex->detail[2] = data[7].i; /* ARGB */
   844 	/* Fallthrough */
   845     case TA_VERTEX_TEX_UV16_PACKED:
   846 	vertex->detail[0] = data[4].i; /* UV */
   847 	vertex->detail[1] = data[6].i; /* ARGB */
   848 	break;
   850     case TA_VERTEX_TEX_FLOAT:
   851     case TA_VERTEX_TEX_SPEC_FLOAT:
   852 	vertex->detail[0] = data[4].i; /* U */
   853 	vertex->detail[1] = data[5].i; /* UV */
   854 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   855 	break;
   856     case TA_VERTEX_TEX_UV16_FLOAT:
   857     case TA_VERTEX_TEX_UV16_SPEC_FLOAT:
   858 	vertex->detail[0] = data[4].i; /* UV */
   859 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   860 	break;
   862     case TA_VERTEX_TEX_SPEC_INTENSITY:
   863 	vertex->detail[3] = parse_intensity_colour( ta_status.intensity2, data[7].f );
   864 	/* Fallthrough */
   865     case TA_VERTEX_TEX_INTENSITY:
   866 	vertex->detail[0] = data[4].i; /* U */
   867 	vertex->detail[1] = data[5].i; /* V */
   868 	vertex->detail[2] = parse_intensity_colour( ta_status.intensity1, data[6].f );
   869 	break;
   870     case TA_VERTEX_TEX_UV16_SPEC_INTENSITY:
   871 	vertex->detail[2] = parse_intensity_colour( ta_status.intensity2, data[7].f );
   872 	/* Fallthrough */
   873     case TA_VERTEX_TEX_UV16_INTENSITY:
   874 	vertex->detail[0] = data[4].i; /* UV */
   875 	vertex->detail[1] = parse_intensity_colour( ta_status.intensity1, data[6].f );
   876 	break;
   878     case TA_VERTEX_PACKED_MOD:
   879 	vertex->detail[0] = data[4].i; /* ARGB */
   880 	vertex->detail[1] = data[5].i; /* ARGB */
   881 	break;
   882     case TA_VERTEX_INTENSITY_MOD:
   883 	vertex->detail[0] = parse_intensity_colour( ta_status.intensity1, data[4].f );
   884 	vertex->detail[1] = parse_intensity_colour( ta_status.intensity2, data[5].f );
   885 	break;
   887     case TA_VERTEX_TEX_SPEC_PACKED_MOD:
   888 	vertex->detail[3] = data[7].i; /* ARGB0 */
   889 	/* Fallthrough */
   890     case TA_VERTEX_TEX_PACKED_MOD:
   891 	vertex->detail[0] = data[4].i; /* U0 */
   892 	vertex->detail[1] = data[5].i; /* V0 */
   893 	vertex->detail[2] = data[6].i; /* ARGB0 */
   894 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   895 	break;
   896     case TA_VERTEX_TEX_UV16_SPEC_PACKED_MOD:
   897 	vertex->detail[2] = data[7].i; /* ARGB0 */
   898 	/* Fallthrough */
   899     case TA_VERTEX_TEX_UV16_PACKED_MOD:
   900 	vertex->detail[0] = data[4].i; /* UV0 */
   901 	vertex->detail[1] = data[6].i; /* ARGB0 */
   902 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   903 	break;
   905     case TA_VERTEX_TEX_SPEC_INTENSITY_MOD:
   906 	vertex->detail[3] = parse_intensity_colour( ta_status.intensity1, data[7].f );
   907 	/* Fallthrough */
   908     case TA_VERTEX_TEX_INTENSITY_MOD:
   909 	vertex->detail[0] = data[4].i; /* U0 */
   910 	vertex->detail[1] = data[5].i; /* V0 */
   911 	vertex->detail[2] = parse_intensity_colour( ta_status.intensity1, data[6].f );
   912 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   913 	break;
   914     case TA_VERTEX_TEX_UV16_SPEC_INTENSITY_MOD:
   915 	vertex->detail[2] = parse_intensity_colour( ta_status.intensity1, data[7].f );
   916 	/* Fallthrough */
   917     case TA_VERTEX_TEX_UV16_INTENSITY_MOD:
   918 	vertex->detail[0] = data[4].i; /* UV0 */
   919 	vertex->detail[1] = parse_intensity_colour( ta_status.intensity1, data[6].f );
   920 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   921 	break;
   923     case TA_VERTEX_SPRITE:
   924     case TA_VERTEX_TEX_SPRITE:
   925     case TA_VERTEX_MOD_VOLUME:
   926     case TA_VERTEX_LISTLESS:
   927 	vertex++;
   928 	vertex->x = data[4].f;
   929 	vertex->y = data[5].f;
   930 	vertex->z = data[6].f;
   931 	vertex++;
   932 	vertex->x = data[7].f;
   933 	ta_status.vertex_count += 2;
   934 	ta_status.state = STATE_EXPECT_VERTEX_BLOCK2;
   935 	break;
   936     }
   937     ta_status.vertex_count++;
   938 }
   940 static void ta_parse_vertex_block2( union ta_data *data ) {
   941     struct pvr2_ta_vertex *vertex = &ta_status.poly_vertex[ta_status.vertex_count-1];
   943     switch( ta_status.current_vertex_type ) {
   944     case TA_VERTEX_TEX_SPEC_FLOAT:
   945 	vertex->detail[3] = parse_float_colour( data[4].f, data[5].f, data[6].f, data[7].f );
   946 	/* Fallthrough */
   947     case TA_VERTEX_TEX_FLOAT:
   948 	vertex->detail[2] = parse_float_colour( data[0].f, data[1].f, data[2].f, data[3].f );
   949 	break;
   950     case TA_VERTEX_TEX_UV16_SPEC_FLOAT:
   951 	vertex->detail[2] = parse_float_colour( data[4].f, data[5].f, data[6].f, data[7].f );
   952 	/* Fallthrough */
   953     case TA_VERTEX_TEX_UV16_FLOAT:
   954 	vertex->detail[1] = parse_float_colour( data[0].f, data[1].f, data[2].f, data[3].f );
   955 	break;
   956     case TA_VERTEX_TEX_PACKED_MOD:
   957 	vertex->detail[3] = data[0].i; /* U1 */
   958 	vertex->detail[4] = data[1].i; /* V1 */
   959 	vertex->detail[5] = data[2].i; /* ARGB1 */
   960 	break;
   961     case TA_VERTEX_TEX_SPEC_PACKED_MOD:
   962 	vertex->detail[4] = data[0].i; /* U1 */
   963 	vertex->detail[5] = data[1].i; /* V1 */
   964 	vertex->detail[6] = data[2].i; /* ARGB1 */
   965 	vertex->detail[7] = data[3].i; /* ARGB1 */
   966 	break;
   967     case TA_VERTEX_TEX_UV16_PACKED_MOD:
   968 	vertex->detail[2] = data[0].i; /* UV1 */
   969 	vertex->detail[3] = data[2].i; /* ARGB1 */
   970 	break;
   971     case TA_VERTEX_TEX_UV16_SPEC_PACKED_MOD:
   972 	vertex->detail[3] = data[0].i; /* UV1 */
   973 	vertex->detail[4] = data[2].i; /* ARGB1 */
   974 	vertex->detail[5] = data[3].i; /* ARGB1 */
   975 	break;
   977     case TA_VERTEX_TEX_INTENSITY_MOD:
   978 	vertex->detail[3] = data[0].i; /* U1 */
   979 	vertex->detail[4] = data[1].i; /* V1 */
   980 	vertex->detail[5] = parse_intensity_colour( ta_status.intensity2, data[2].f ); /* ARGB1 */
   981 	break;
   982     case TA_VERTEX_TEX_SPEC_INTENSITY_MOD:
   983 	vertex->detail[4] = data[0].i; /* U1 */
   984 	vertex->detail[5] = data[1].i; /* V1 */
   985 	vertex->detail[6] = parse_intensity_colour( ta_status.intensity2, data[2].f ); /* ARGB1 */
   986 	vertex->detail[7] = parse_intensity_colour( ta_status.intensity2, data[3].f ); /* ARGB1 */
   987 	break;
   988     case TA_VERTEX_TEX_UV16_INTENSITY_MOD:
   989 	vertex->detail[2] = data[0].i; /* UV1 */
   990 	vertex->detail[3] = parse_intensity_colour( ta_status.intensity2, data[2].f ); /* ARGB1 */
   991 	break;
   992     case TA_VERTEX_TEX_UV16_SPEC_INTENSITY_MOD:
   993 	vertex->detail[3] = data[0].i; /* UV1 */
   994 	vertex->detail[4] = parse_intensity_colour( ta_status.intensity2, data[2].f ); /* ARGB1 */
   995 	vertex->detail[5] = parse_intensity_colour( ta_status.intensity2, data[3].f ); /* ARGB1 */
   996 	break;
   998     case TA_VERTEX_SPRITE:
   999 	vertex->y = data[0].f;
  1000 	vertex->z = data[1].f;
  1001 	vertex++;
  1002 	ta_status.vertex_count++;
  1003 	vertex->x = data[2].f;
  1004 	vertex->y = data[3].f;
  1005 	vertex->z = 0;
  1006 	vertex->detail[0] = 0;
  1007 	ta_status.poly_vertex[0].detail[0] = 0;
  1008 	ta_status.poly_vertex[1].detail[0] = 0;
  1009 	break;
  1010     case TA_VERTEX_TEX_SPRITE:
  1011 	vertex->y = data[0].f;
  1012 	vertex->z = data[1].f;
  1013 	vertex++;
  1014 	ta_status.vertex_count++;
  1015 	vertex->x = data[2].f;
  1016 	vertex->y = data[3].f;
  1017 	vertex->z = 0;
  1018 	vertex->detail[0] = 0;
  1019 	vertex->detail[1] = 0;
  1020 	ta_status.poly_vertex[0].detail[0] = data[5].i;
  1021 	ta_status.poly_vertex[0].detail[1] = 0;
  1022 	ta_status.poly_vertex[1].detail[0] = data[6].i;
  1023 	ta_status.poly_vertex[1].detail[1] = 0;
  1024 	ta_status.poly_vertex[2].detail[0] = data[7].i;
  1025 	break;
  1026     case TA_VERTEX_MOD_VOLUME:
  1027     case TA_VERTEX_LISTLESS:
  1028 	vertex->y = data[0].f;
  1029 	vertex->z = data[1].f;
  1030 	break;
  1032     ta_status.state = STATE_IN_POLYGON;
  1035 /**
  1036  * Process 1 32-byte block of ta data
  1037  */
  1038 void pvr2_ta_process_block( unsigned char *input ) {
  1039     union ta_data *data = (union ta_data *)input;
  1041     switch( ta_status.state ) {
  1042     case STATE_ERROR:
  1043 	/* Fatal error raised - stop processing until reset */
  1044 	return;
  1046     case STATE_EXPECT_POLY_BLOCK2:
  1047 	/* This is always a pair of floating-point colours */
  1048 	ta_status.intensity1 = 
  1049 	    parse_float_colour( data[0].f, data[1].f, data[2].f, data[3].f );
  1050 	ta_status.intensity2 =
  1051 	    parse_float_colour( data[4].f, data[5].f, data[6].f, data[7].f );
  1052 	ta_status.state = STATE_IN_LIST;
  1053 	break;
  1055     case STATE_EXPECT_VERTEX_BLOCK2:
  1056 	ta_parse_vertex_block2( data );
  1057 	if( ta_status.vertex_count == ta_status.max_vertex ) {
  1058 	    ta_split_polygon();
  1060 	break;
  1062     case STATE_EXPECT_END_VERTEX_BLOCK2:
  1063 	ta_parse_vertex_block2( data );
  1064 	if( ta_status.vertex_count < 3 ) {
  1065 	    ta_bad_input_error();
  1066 	} else {
  1067 	    ta_commit_polygon();
  1069 	ta_status.vertex_count = 0;
  1070 	ta_status.poly_parity = 0;
  1071 	ta_status.state = STATE_IN_LIST;
  1072 	break;
  1073     case STATE_IN_LIST:
  1074     case STATE_IN_POLYGON:
  1075     case STATE_IDLE:
  1076 	switch( TA_CMD( data->i ) ) {
  1077 	case TA_CMD_END_LIST:
  1078 	    if( ta_status.state == STATE_IN_POLYGON ) {
  1079 		ta_bad_input_error();
  1080 		ta_end_list();
  1081 		ta_status.state = STATE_ERROR; /* Abort further processing */
  1082 	    } else {
  1083 		ta_end_list();
  1085 	    break;
  1086 	case TA_CMD_CLIP:
  1087 	    if( ta_status.state == STATE_IN_POLYGON ) {
  1088 		ta_bad_input_error();
  1089 		ta_status.accept_vertexes = FALSE;
  1090 		/* Enter stuffed up mode */
  1092 	    ta_status.clip.x1 = data[4].i & 0x3F;
  1093 	    ta_status.clip.y1 = data[5].i & 0x0F;
  1094 	    ta_status.clip.x2 = data[6].i & 0x3F;
  1095 	    ta_status.clip.y2 = data[7].i & 0x0F;
  1096 	    if( ta_status.clip.x2 >= ta_status.width )
  1097 		ta_status.clip.x2 = ta_status.width - 1;
  1098 	    if( ta_status.clip.y2 >= ta_status.height )
  1099 		ta_status.clip.y2 = ta_status.height - 1;
  1100 	    break;
  1101 	case TA_CMD_POLYGON_CONTEXT:
  1102 	    if( ta_status.state == STATE_IDLE ) {
  1103 		ta_init_list( TA_POLYCMD_LISTTYPE( data->i ) );
  1106 	    if( ta_status.vertex_count != 0 ) {
  1107 		/* Error, and not a very well handled one either */
  1108 		ta_bad_input_error();
  1109 		ta_status.accept_vertexes = FALSE;
  1110 	    } else {
  1111 		if( TA_IS_MODIFIER_LIST( ta_status.current_list_type ) ) {
  1112 		    ta_parse_modifier_context(data);
  1113 		} else {
  1114 		    ta_parse_polygon_context(data);
  1117 	    break;
  1118 	case TA_CMD_SPRITE_CONTEXT:
  1119 	    if( ta_status.state == STATE_IDLE ) {
  1120 		ta_init_list( TA_POLYCMD_LISTTYPE( data->i ) );
  1123 	    if( ta_status.vertex_count != 0 ) {
  1124 		ta_fill_vertexes();
  1125 		ta_commit_polygon();
  1128 	    ta_parse_sprite_context(data);
  1129 	    break;
  1130 	case TA_CMD_VERTEX:
  1131 	    ta_status.state = STATE_IN_POLYGON;
  1132 	    ta_parse_vertex(data);
  1134 	    if( ta_status.state == STATE_EXPECT_VERTEX_BLOCK2 ) {
  1135 		if( TA_IS_END_VERTEX(data[0].i) ) {
  1136 		    ta_status.state = STATE_EXPECT_END_VERTEX_BLOCK2;
  1138 	    } else if( TA_IS_END_VERTEX(data->i) ) {
  1139 		if( ta_status.vertex_count < 3 ) {
  1140 		    ta_bad_input_error();
  1141 		} else {
  1142 		    ta_commit_polygon();
  1144 		ta_status.vertex_count = 0;
  1145 		ta_status.poly_parity = 0;
  1146 		ta_status.state = STATE_IN_LIST;
  1147 	    } else if( ta_status.vertex_count == ta_status.max_vertex ) {
  1148 		ta_split_polygon();
  1150 	    break;
  1151 	default:
  1152 	    if( ta_status.state == STATE_IN_POLYGON ) {
  1153 		ta_bad_input_error();
  1156 	break;
  1163 /**
  1164  * Write a block of data to the tile accelerator, adding the data to the 
  1165  * current scene. We don't make any particular attempt to interpret the data
  1166  * at this stage, deferring that until render time.
  1168  * Currently copies the data verbatim to the vertex buffer, processing only
  1169  * far enough to generate the correct end-of-list events. Tile buffer is
  1170  * entirely ignored.
  1171  */
  1172 void pvr2_ta_write( unsigned char *buf, uint32_t length )
  1174     if( ta_status.debug_output ) {
  1175 	fwrite_dump32( (uint32_t *)buf, length, stderr );
  1178     for( ; length >=32; length -= 32 ) {
  1179 	pvr2_ta_process_block( buf );
  1180 	buf += 32;
.