accelerants/radeon/CP.c

81 // mark all indirect buffers that have been processed as being free;
93 	// mark all sent indirect buffers as free
94 	while( cp->buffers.oldest != -1 ) {
96 			&cp->buffers.buffers[cp->buffers.oldest];
112 			cp->buffers.newest = -1;
115 		oldest_buffer->next = cp->buffers.free_list;
116 		cp->buffers.free_list = cp->buffers.oldest;
118 		cp->buffers.oldest = tmp_oldest_buffer;
139 		if( cp->buffers.free_list >= 0 )
160 	SHOW_ERROR0( 0, "All buffers are in use and engine doesn't finish any of them" );
178 	if( cp->buffers.free_list == -1 )
181 	buffer_idx = cp->buffers.free_list;
182 	cp->buffers.free_list = cp->buffers.buffers[buffer_idx].next;
199 // if never_used is false, execution may take very long as all buffers
215 	cp->buffers.buffers[buffer_idx].next = cp->buffers.free_list;
216 	cp->buffers.free_list = buffer_idx;
279 		// size of indirect buffers _must_ be multiple of 64 bits, so
290 		state_buffer_size > 0 && state_buffer_idx != cp->buffers.active_state;
300 		WRITE_RB( cp->buffers.vm_start +
304 		cp->buffers.active_state = state_buffer_idx;
309 	WRITE_RB( cp->buffers.vm_start + buffer_idx * INDIRECT_BUFFER_SIZE * sizeof( uint32 ));
314 	WRITE_RB( cp->buffers.buffers[buffer_idx].send_tag = (int32)++cp->buffers.cur_tag );
316 	SHOW_FLOW( 3, "Assigned tag %d", cp->buffers.buffers[buffer_idx].send_tag );
320 	// append buffer to list of submitted buffers
321 	if( cp->buffers.newest > 0 )
322 		cp->buffers.buffers[cp->buffers.newest].next = buffer_idx;
324 		cp->buffers.oldest = buffer_idx;
326 	cp->buffers.newest = buffer_idx;
327 	cp->buffers.buffers[buffer_idx].next = -1;
329 	// flush writes to CP buffers
371 	if( cp->buffers.active_state == state_buffer_idx )
372 		cp->buffers.active_state = -1;