Lines Matching defs:dlist
28 * \file dlist.c
62 struct gl_display_list *dlist);
797 Node *get_list_head(struct gl_context *ctx, struct gl_display_list *dlist)
799 return dlist->small_list ?
800 &ctx->Shared->small_dlist_store.ptr[dlist->start] :
801 dlist->Head;
809 is_bitmap_list(struct gl_context *ctx, struct gl_display_list *dlist)
811 Node *n = get_list_head(ctx, dlist);
825 is_empty_list(struct gl_context *ctx, struct gl_display_list *dlist)
827 Node *n = get_list_head(ctx, dlist);
1077 struct gl_display_list *dlist = CALLOC_STRUCT(gl_display_list);
1078 dlist->Name = name;
1079 dlist->Head = malloc(sizeof(Node) * count);
1080 dlist->Head[0].opcode = OPCODE_END_OF_LIST;
1081 return dlist;
1098 * \param dlist - display list pointer
1101 _mesa_delete_list(struct gl_context *ctx, struct gl_display_list *dlist)
1105 n = block = get_list_head(ctx, dlist);
1108 free(dlist->Label);
1109 FREE(dlist);
1329 assert (!dlist->small_list);
1334 if (dlist->small_list) {
1335 unsigned start = dlist->start;
1336 for (int i = 0; i < dlist->count; i++) {
1343 free(dlist->Label);
1344 free(dlist);
1389 struct gl_display_list *dlist;
1394 dlist = _mesa_lookup_list(ctx, list, true);
1395 if (!dlist)
1398 if (is_bitmap_list(ctx, dlist)) {
1408 _mesa_delete_list(ctx, dlist);
11104 struct gl_display_list **dlist,
11110 if (dlist)
11111 *dlist = dl;
11133 struct gl_display_list *dlist;
11136 if (list == 0 || !_mesa_get_list(ctx, list, &dlist, true))
11139 n = get_list_head(ctx, dlist);
13527 replace_op_vertex_list_recursively(struct gl_context *ctx, struct gl_display_list *dlist)
13529 Node *n = get_list_head(ctx, dlist);
14015 struct gl_display_list *dlist;
14025 if (!_mesa_get_list(ctx, list, &dlist, true)) {
14033 n = get_list_head(ctx, dlist);
14315 struct gl_display_list *dlist;
14318 !_mesa_get_list(ctx, list, &dlist, true) ||
14319 !dlist->execute_glthread)
14322 Node *n = get_list_head(ctx, dlist);
14395 struct gl_display_list *dlist)
14397 Node *n = get_list_head(ctx, dlist);