[PATCH 2/2] libdrm_radeon: Optimize reloc writing to do less looping.

2010-03-10 Thread Pauli Nieminen
Bit has table will be first checked from BO if we can quarentee this BO is not in this cs already. To quarentee that there is no other cs with same id number of CS that can have id is limited to 32. Adding and remocing reference in bo is done with atomic operations to allow parallel access to a

Re: [PATCH 2/2] libdrm_radeon: Optimize reloc writing to do less looping.

2010-03-10 Thread Michel Dänzer
On Wed, 2010-03-10 at 18:20 +0200, Pauli Nieminen wrote: Bit has table will be first checked from BO if we can quarentee this BO is not in this cs already. To quarentee that there is no other cs with same id number of CS that can have id is limited to 32. Adding and remocing reference in bo

Re: [PATCH 2/2] libdrm_radeon: Optimize reloc writing to do less looping.

2010-03-10 Thread Pauli Nieminen
2010/3/10 Michel Dänzer mic...@daenzer.net: On Wed, 2010-03-10 at 18:20 +0200, Pauli Nieminen wrote: Bit has table will be first checked from BO if we can quarentee this BO is not in this cs already. To quarentee that there is no other cs with same id number of CS that can have id is