Lines Matching defs:node
119 struct exec_node node;
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
139 while (dom_idx >= 0 && !ssa_def_dominates(dom[dom_idx], node->def))
145 fprintf(fp, "ssa_%d\n", node->def->index);
147 dom[++dom_idx] = node->def;
166 merge_node *node = ralloc(state->dead_ctx, merge_node);
167 node->set = set;
168 node->def = def;
169 exec_list_push_head(&set->nodes, &node->node);
171 _mesa_hash_table_insert(state->merge_node_table, def, node);
173 return node;
200 merge_node *a_node = exec_node_data(merge_node, an, node);
201 merge_node *b_node = exec_node_data(merge_node, bn, node);
208 exec_node_data(merge_node, bn, node)->set = a;
231 /* List of all the nodes which dominate the current node, in dominance
247 current = exec_node_data(merge_node, bn, node);
250 current = exec_node_data(merge_node, an, node);
253 merge_node *a_node = exec_node_data(merge_node, an, node);
254 merge_node *b_node = exec_node_data(merge_node, bn, node);
266 * dominating nodes as a simple stack, pushing every node onto the list
268 * visit the current node.
280 * Because of these invariants, we only need to check the current node
281 * against its minimal dominator. If any other node N in the union
288 * here, the only node that can possibly interfere with current is the
320 /* If one of our successors has at least one phi node, we need to
358 * node that copies the destinations of all of the phi nodes to new SSA
360 * a successor with phi nodes that, for each phi node in each successor,
361 * copies the corresponding sorce of the phi node and adjust the phi to
370 * destinations of any given phi node to the same register without worrying
424 exec_list_push_tail(&pcopy->entries, &entry->node);
439 exec_list_push_tail(&block_pcopy->entries, &entry->node);
562 merge_node *node = (merge_node *)entry->data;
566 * matter which node's definition we use.
568 if (node->set->reg == NULL) {
569 node->set->reg = create_reg_for_ssa_def(def, state->builder.impl);
570 node->set->reg->divergent = node->set->divergent;
573 reg = node->set->reg;
596 exec_list_push_tail(&state->dead_instrs, &parent_instr->node);
625 exec_list_push_tail(&state->dead_instrs, &instr->node);
692 exec_list_push_tail(&state->dead_instrs, &pcopy->instr.node);
835 exec_list_push_tail(&state->dead_instrs, &pcopy->instr.node);
984 * node we do the following: