Lines Matching defs:dest
121 tree prev_value, dest;
123 dest = VEC_pop (tree, *stack);
127 if (dest == NULL)
131 SSA_NAME_VALUE (dest) = prev_value;
170 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
176 and it is set by a PHI in E->dest, then we can not thread
177 through E->dest. */
181 && bb_for_stmt (SSA_NAME_DEF_STMT (src)) == e->dest)
194 /* Try to simplify each statement in E->dest, ultimately leading to
195 a simplification of the COND_EXPR at the end of E->dest.
209 later statements in E->dest. */
227 for (bsi = bsi_start (e->dest); ! bsi_end_p (bsi); bsi_next (&bsi))
342 /* Simplify the control statement at the end of the block E->dest.
478 /* We are exiting E->src, see if E->dest ends with a conditional
482 may have already recorded equivalences for E->dest into our
484 the end of E->dest. Threading opportunities are severely
503 SWITCH_EXPR or GOTO_EXPR at the end of e->dest is not affected
504 by any statements in e->dest. If it is affected, then it is not
510 tree last = bsi_stmt (bsi_last (e->dest));
518 && bb_for_stmt (SSA_NAME_DEF_STMT (use)) == e->dest)
548 edge taken_edge = find_taken_edge (e->dest, cond);
549 basic_block dest = (taken_edge ? taken_edge->dest : NULL);
551 if (dest == e->dest)