| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
get_vertex_info)
|
|
The windbg connection seems synchronous, so this speeds up when printing
little text at a time (e.g., tgsi output).
|
|
|
|
|
|
|
|
|
|
|
|
We often want to use a pool of equally sized buffers, so this makes the
slab suballocator a drop-in replacement.
|
|
|
|
|
|
Allow concurrent reads from buffers by the CPU/GPU, but serialize
all writes.
|
|
|
|
|
|
of the vertices and not always have to use the maximum vertex
allocation size for them
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Not tested yet -- just compiles.
This includes only the slab algorithm. Fencing is already
implemented in pb_bufmgr_fence and time-based caching will be commited in a
separate module shortly.
|
|
|
|
|
|
|
|
The two functions were mostly the same. We can look at the shader header
info to determine if it's a vertex or fragment shader.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Encode edgeflags (and reset_stipple info) into the top two bits of the
fetch elements. This info could be moved elsewhere, but for now we
can live with a 1<<30 maximum element size...
Also use the primitive decomposition code from draw_prim.c verbatim, as
it includes all this stuff and is known to work.
|
|
|
|
This allows to keep the list small without the overhead of full walks.
|
