Lines Matching refs:an
33 * This file implements an out-of-SSA pass as described in "Revisiting
111 * us, this is an easy thing to keep up.) It is assumed that no pair of the
197 struct exec_node *an = exec_list_get_head(&a->nodes);
200 merge_node *a_node = exec_node_data(merge_node, an, node);
203 if (exec_node_is_tail_sentinel(an) ||
207 exec_node_insert_node_before(an, bn);
211 an = an->next;
224 * This is an implementation of Algorithm 2 in "Revisiting Out-of-SSA
237 struct exec_node *an = exec_list_get_head(&a->nodes);
239 while (!exec_node_is_tail_sentinel(an) ||
246 if (exec_node_is_tail_sentinel(an)) {
250 current = exec_node_data(merge_node, an, node);
251 an = an->next;
253 merge_node *a_node = exec_node_data(merge_node, an, node);
258 an = an->next;
591 /* If it's an ssa_undef instruction, remove it since we know we just got
761 /* Mark the ones that are ready for copying. We know an index is a