HomeSort by: relevance | last modified time | path
    Searched refs:vertex (Results 1 - 10 of 10) sorted by relevancy

  /src/usr.bin/nbperf/
graph2.h 39 * For each vertex in the 2/3-graph, the incidence lists need to kept.
66 struct SIZED(vertex) {
75 struct SIZED(vertex) *verts;
graph2.c 138 struct SIZED(vertex) *v;
152 struct SIZED(vertex) *v;
163 SIZED2(_remove_vertex)(struct SIZED(graph) *graph, uint32_t vertex)
165 struct SIZED(vertex) *v = graph->verts + vertex;
184 errx(1, "vertex count must have lowest bit clear");
187 errx(1, "vertex count must have lowest 2 bits clear");
  /src/sys/external/bsd/drm/dist/shared-core/
mach64_state.c 552 drm_mach64_vertex_t * vertex)
557 void *buf = vertex->buf;
558 unsigned long used = vertex->used;
577 /* Mach64's vertex data is actually register writes. To avoid security
707 * two sets of buffers (one set private for vertex data, the other set
827 drm_mach64_vertex_t *vertex = data; local
838 vertex->buf, vertex->used, vertex->discard);
840 if (vertex->prim < 0 || vertex->prim > MACH64_PRIM_POLYGON)
    [all...]
radeon_state.c 1166 /* Vertex format (X, Y, Z, W) */
1529 /* Emit the vertex buffer rendering commands */
1555 /* Emit the vertex buffer age */
2233 drm_radeon_vertex_t *vertex = data; local
2246 DRM_CURRENTPID, vertex->idx, vertex->count, vertex->discard);
2248 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
2250 vertex->idx, dma->buf_count - 1)
2528 drm_radeon_vertex2_t *vertex = data; local
    [all...]
r128_state.c 600 /* Emit the vertex buffer rendering commands */
619 /* Emit the vertex buffer age */
759 /* Emit the vertex buffer age */
1353 drm_r128_vertex_t *vertex = data; local
1363 DRM_CURRENTPID, vertex->idx, vertex->count, vertex->discard);
1365 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
1367 vertex->idx, dma->buf_count - 1)
    [all...]
mga_state.c 913 drm_mga_vertex_t *vertex = data; local
917 if (vertex->idx < 0 || vertex->idx > dma->buf_count)
919 buf = dma->buflist[vertex->idx];
922 buf->used = vertex->used;
923 buf_priv->discard = vertex->discard;
926 if (vertex->discard) {
  /src/sys/external/bsd/drm2/dist/drm/r128/
r128_state.c 606 /* Emit the vertex buffer rendering commands */
625 /* Emit the vertex buffer age */
764 /* Emit the vertex buffer age */
1325 drm_r128_vertex_t *vertex = data; local
1332 task_pid_nr(current), vertex->idx, vertex->count, vertex->discard);
1334 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
1336 vertex->idx, dma->buf_count - 1)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/mga/
mga_state.c 881 drm_mga_vertex_t *vertex = data; local
885 if (vertex->idx < 0 || vertex->idx > dma->buf_count)
887 buf = dma->buflist[vertex->idx];
890 buf->used = vertex->used;
891 buf_priv->discard = vertex->discard;
894 if (vertex->discard) {
  /src/sys/external/bsd/drm2/dist/drm/i810/
i810_dma.c 942 drm_i810_vertex_t *vertex = data; local
947 vertex->idx, vertex->used, vertex->discard);
949 if (vertex->idx < 0 || vertex->idx >= dma->buf_count)
953 dma->buflist[vertex->idx],
954 vertex->discard, vertex->used);
  /src/lib/libc/cdb/
cdbw.c 350 * For each vertex in the 3-graph, the incidence lists needs to be kept.
365 struct vertex { struct
384 struct vertex *vertices;
398 struct vertex *v;
411 struct vertex *v_ = &state->vertices[v];

Completed in 27 milliseconds