| /xsrc/external/mit/MesaLib/dist/src/vulkan/util/ |
| H A D | vk_queue.h | 40 struct list_head link; member in struct:vk_queue
103 list_for_each_entry(struct vk_queue, queue, &(device)->queues, link)
106 list_for_each_entry_safe(struct vk_queue, queue, &(device)->queues, link)
|
| H A D | vk_queue.c | 36 list_addtail(&queue->link, &device->queues);
54 list_del(&queue->link);
|
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| H A D | brw_cfg.cpp | 39 bblock_link *link = (bblock_link *)list->get_tail(); local in function:pop_stack
40 bblock_t *block = link->block;
41 link->link.remove();
47 link(void *mem_ctx, bblock_t *block) function in typeref:typename:exec_node *
50 return &l->link;
64 successor->parents.push_tail(::link(mem_ctx, this));
65 children.push_tail(::link(mem_ctx, successor));
71 foreach_list_typed_safe (bblock_link, parent, link, &block->parents) {
83 foreach_list_typed_safe (bblock_link, child, link,
[all...] |
| H A D | brw_disasm_info.c | 40 foreach_list_typed(struct inst_group, group, link, &disasm->group_list) {
41 struct exec_node *next_node = exec_node_get_next(&group->link);
46 exec_node_data(struct inst_group, next_node, link);
53 foreach_list_typed(struct bblock_link, predecessor_link, link,
84 foreach_list_typed(struct bblock_link, successor_link, link,
113 exec_list_push_tail(&disasm->group_list, &tail->link);
130 exec_list_get_tail_raw(&disasm->group_list), link);
164 foreach_list_typed(struct inst_group, cur, link, &disasm->group_list) {
165 struct exec_node *next_node = exec_node_get_next(&cur->link);
170 exec_node_data(struct inst_group, next_node, link);
[all...] |
| H A D | brw_cfg.h | 45 struct exec_node link; member in struct:bblock_link
81 struct exec_node link; member in struct:bblock_t
123 if (exec_node_is_tail_sentinel(block->link.next))
126 return (struct bblock_t *)block->link.next;
132 if (exec_node_is_tail_sentinel(block->link.next))
135 return (const struct bblock_t *)block->link.next;
141 if (exec_node_is_head_sentinel(block->link.prev))
144 return (struct bblock_t *)block->link.prev;
150 if (exec_node_is_head_sentinel(block->link.prev))
153 return (const struct bblock_t *)block->link
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/intel/compiler/ |
| H A D | brw_cfg.cpp | 42 bblock_link *link = (bblock_link *)list->get_tail(); local in function:pop_stack
43 bblock_t *block = link->block;
44 link->link.remove();
50 link(void *mem_ctx, bblock_t *block, enum bblock_link_kind kind) function in typeref:typename:exec_node *
53 return &l->link;
59 /* The kind of the link is immaterial, but we need to provide one since
62 list->push_tail(link(mem_ctx, block, bblock_link_logical));
77 successor->parents.push_tail(::link(mem_ctx, this, kind));
78 children.push_tail(::link(mem_ct
[all...] |
| H A D | brw_cfg.h | 66 struct exec_node link; member in struct:bblock_link
112 struct exec_node link; member in struct:bblock_t
156 if (exec_node_is_tail_sentinel(block->link.next))
159 return (struct bblock_t *)block->link.next;
165 if (exec_node_is_tail_sentinel(block->link.next))
168 return (const struct bblock_t *)block->link.next;
174 if (exec_node_is_head_sentinel(block->link.prev))
177 return (struct bblock_t *)block->link.prev;
183 if (exec_node_is_head_sentinel(block->link.prev))
186 return (const struct bblock_t *)block->link
[all...] |
| H A D | brw_disasm_info.c | 45 foreach_list_typed(struct inst_group, group, link, &disasm->group_list) {
46 struct exec_node *next_node = exec_node_get_next(&group->link);
51 exec_node_data(struct inst_group, next_node, link);
58 foreach_list_typed(struct bblock_link, predecessor_link, link,
93 foreach_list_typed(struct bblock_link, successor_link, link,
124 exec_list_push_tail(&disasm->group_list, &tail->link);
141 exec_list_get_tail_raw(&disasm->group_list), link);
175 foreach_list_typed(struct inst_group, cur, link, &disasm->group_list) {
176 struct exec_node *next_node = exec_node_get_next(&cur->link);
181 exec_node_data(struct inst_group, next_node, link);
[all...] |
| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| H A D | bin.h | 72 jarc->link = head;
86 if( jarc ) head = jarc->link;
105 if( jarc ) current = jarc->link;
|
| H A D | bin.cc | 69 for( j = &(head); (*j != 0) && (*j != arc); j = &((*j)->link) );
73 current = (*j)->link;
74 *j = (*j)->link;
106 orphan->link = parent->link;
107 parent->link = orphan;
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| H A D | vma.c | 30 struct list_head link; member in struct:util_vma_hole
36 list_for_each_entry(struct util_vma_hole, _hole, &(_heap)->holes, link)
39 list_for_each_entry_safe(struct util_vma_hole, _hole, &(_heap)->holes, link)
65 if (&hole->link == heap->holes.next) {
119 list_del(&hole->link);
157 list_addtail(&high_hole->link, &hole->link);
210 list_del(&high_hole->link);
228 list_add(&hole->link, &high_hole->link);
[all...] |
| H A D | dag.c | 41 list_delinit(&child->link);
67 list_addtail(&child->link, &dag->heads);
82 list_delinit(&node->link);
97 list_addtail(&node->link, &dag->heads);
135 list_for_each_entry(struct dag_node, node, &dag->heads, link) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/etnaviv/ |
| H A D | etnaviv_shader.c | 61 * XXX we could cache the link result for a certain set of VS/PS; usually a pair
68 struct etna_shader_link_info link = { }; local in function:etna_link_shaders
80 if (etna_link_shader(&link, vs, fs)) {
89 debug_printf("link result:\n");
92 for (int idx = 0; idx < link.num_varyings; ++idx)
94 link.varyings[idx].reg, idx + 1,
95 link.varyings[idx].num_components, "xyzw",
96 link.varyings[idx].use[0], link.varyings[idx].use[1],
97 link
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/asahi/compiler/ |
| H A D | agx_compiler.h | 270 struct list_head link; member in struct:__anon010094cb0208
325 struct list_head link; member in struct:agx_block
404 list_del(&ins->link);
452 list_for_each_entry(agx_block, v, &ctx->blocks, link)
455 list_for_each_entry_rev(agx_block, v, &ctx->blocks, link)
458 list_for_each_entry_from(agx_block, v, from, &ctx->blocks, link)
461 list_for_each_entry_from_rev(agx_block, v, from, &ctx->blocks, link)
464 list_for_each_entry(agx_instr, v, &(block)->instructions, link)
467 list_for_each_entry_rev(agx_instr, v, &(block)->instructions, link)
470 list_for_each_entry_safe(agx_instr, v, &(block)->instructions, link)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/ |
| H A D | vc4_qir_emit_uniform_stream_resets.c | 78 list_add(&add->link, &block->instructions);
79 list_add(&load_imm->link, &block->instructions);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/ |
| H A D | vc4_qir_emit_uniform_stream_resets.c | 78 list_add(&add->link, &block->instructions);
79 list_add(&load_imm->link, &block->instructions);
|
| /xsrc/external/mit/MesaLib/dist/src/intel/tools/ |
| H A D | i965_asm.h | 89 struct list_head link; member in struct:instr_label
97 struct list_head link; member in struct:target_label
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| H A D | linker_util.h | 40 struct exec_node link; member in struct:empty_uniform_block
|
| /xsrc/external/mit/fontconfig/dist/conf.d/ |
| H A D | link_confs.py | 29 for link in args.links:
30 src = os.path.join(args.availpath, link)
31 dst = os.path.join(confpath, link)
|
| /xsrc/external/mit/MesaLib/dist/src/intel/common/ |
| H A D | intel_disasm.c | 85 foreach_list_typed(struct inst_group, group, link,
87 struct exec_node *next_node = exec_node_get_next(&group->link);
92 exec_node_data(struct inst_group, next_node, link);
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| H A D | vma.c | 31 struct list_head link; member in struct:util_vma_hole
37 list_for_each_entry(struct util_vma_hole, _hole, &(_heap)->holes, link)
40 list_for_each_entry_safe(struct util_vma_hole, _hole, &(_heap)->holes, link)
43 list_for_each_entry_safe_rev(struct util_vma_hole, _hole, &(_heap)->holes, link)
72 if (&hole->link == heap->holes.next) {
103 list_del(&hole->link);
138 list_addtail(&high_hole->link, &hole->link);
283 list_del(&high_hole->link);
301 list_add(&hole->link,
[all...] |
| H A D | dag.c | 41 list_delinit(&child->link);
67 list_addtail(&child->link, &dag->heads);
82 list_delinit(&node->link);
97 list_addtail(&node->link, &dag->heads);
173 list_for_each_entry(struct dag_node, node, &dag->heads, link) {
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/etnaviv/ |
| H A D | etnaviv_shader.c | 115 * XXX we could cache the link result for a certain set of VS/PS; usually a pair
122 struct etna_shader_link_info link = { }; local in function:etna_link_shaders
136 failed = etna_link_shader_nir(&link, vs, fs);
138 failed = etna_link_shader(&link, vs, fs);
149 debug_printf("link result:\n");
152 for (int idx = 0; idx < link.num_varyings; ++idx)
154 link.varyings[idx].reg, idx + 1,
155 link.varyings[idx].num_components, "xyzw",
156 link.varyings[idx].use[0], link
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| H A D | bir.c | 131 return list_first_entry(&block->clauses, bi_clause, link);
134 if (clause && clause->link.next != &block->clauses)
135 return list_first_entry(&(clause->link), bi_clause, link);
142 return list_first_entry(&block->clauses, bi_clause, link);
|
| /xsrc/external/mit/freetype/dist/src/cache/ |
| H A D | ftccache.c | 154 *pnode = node->link;
155 node->link = new_list;
159 pnode = &node->link;
204 pnode = &(*pnode)->link;
243 pnode = &(*pnode)->link;
246 *pnode = node0->link;
247 node0->link = NULL;
262 node->link = *pnode;
368 next = node->link;
369 node->link
[all...] |