Searched refs:merge_node (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_from_ssa.c106 * Each SSA definition is associated with a merge_node and the association
108 * in the merge_node structure. The merge_set stores a linked list of
122 } merge_node; typedef in typeref:struct:__anonbfbf37d10108
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
152 static merge_node *
166 merge_node *node = ralloc(state->dead_ctx, merge_node);
177 merge_nodes_interfere(merge_node *a, merge_node *b)
200 merge_node *a_nod
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_from_ssa.c72 * Each SSA definition is associated with a merge_node and the association
74 * in the merge_node structure. The merge_set stores a linked list of
88 } merge_node; typedef in typeref:struct:__anondb91395e0108
103 foreach_list_typed(merge_node, node, node, &set->nodes) {
120 static merge_node *
133 merge_node *node = ralloc(state->dead_ctx, merge_node);
144 merge_nodes_interfere(merge_node *a, merge_node *b)
156 merge_node *a_nod
[all...]
/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_lower_to_cssa.cpp54 struct merge_node { struct in namespace:aco::__anondeebb31e0110
69 std::unordered_map<uint32_t, merge_node> merge_node_table; /* tempid -> merge node */
156 merge_node& node_a = ctx.merge_node_table[a.id()];
157 merge_node& node_b = ctx.merge_node_table[b.id()];
169 merge_node& node_a = ctx.merge_node_table[a.id()];
170 merge_node& node_b = ctx.merge_node_table[b.id()];
184 merge_node& node_var = ctx.merge_node_table[var.id()];
185 merge_node& node_parent = ctx.merge_node_table[parent.id()];
251 merge_node& node_var = ctx.merge_node_table[var.id()];
262 merge_node
[all...]

Completed in 14 milliseconds