contrib/gcc/tree-ssa-dom.c

69   tree lhs;
119   /* The value (lhs) of this expression.  */
120   tree lhs;
465 initialize_hash_element (tree expr, tree lhs, struct expr_hash_elt *element)
503   element->lhs = lhs;
629 	      tree lhs = edge_info->lhs;
633 	      if (lhs && TREE_CODE (lhs) == SSA_NAME)
634 		record_const_or_copy (lhs, rhs);
669 	      tree lhs = edge_info->lhs;
673 	      if (lhs && TREE_CODE (lhs) == SSA_NAME)
674 		record_const_or_copy (lhs, rhs);
728       tree lhs = PHI_RESULT (phi);
739 	  if (lhs == t)
756 	rhs = lhs;
765 	  && may_propagate_copy (lhs, rhs))
766 	SSA_NAME_VALUE (lhs) = rhs;
826 	  tree lhs = edge_info->lhs;
830 	  if (lhs)
831 	    record_equality (lhs, rhs);
1181   tree lhs, rhs, preinc, phi;
1187   lhs = TREE_OPERAND (stmt, 0);
1188   if (TREE_CODE (lhs) != SSA_NAME)
1206     if (PHI_ARG_DEF (phi, i) == lhs)
1312 		      edge_info->lhs = cond;
1336 	      edge_info->lhs = cond;
1340 	      edge_info->lhs = cond;
1360 		      edge_info->lhs = op0;
1366 		      edge_info->lhs = op0;
1374 		      edge_info->lhs = op0;
1380 		      edge_info->lhs = op0;
1399 		      edge_info->lhs = op1;
1408 		      edge_info->lhs = op1;
1425 		      edge_info->lhs = op0;
1434 		      edge_info->lhs = op0;
1562   tree lhs = TREE_OPERAND (stmt, 0);
1563   enum tree_code lhs_code = TREE_CODE (lhs);
1581 	SSA_NAME_VALUE (lhs) = rhs;
1591       && !is_gimple_reg (lhs))
1605 	  && DECL_BIT_FIELD (TREE_OPERAND (lhs, 1)))
1608 	    rhs = widen_bitfield (rhs, TREE_OPERAND (lhs, 1), lhs);
1620 	  new = build2 (MODIFY_EXPR, TREE_TYPE (stmt), rhs, lhs);
1926   tree lhs;
1930   lhs = TREE_CODE (stmt) == MODIFY_EXPR ? TREE_OPERAND (stmt, 0) : NULL;
1932   initialize_hash_element (stmt, lhs, element);
1963   lhs = ((struct expr_hash_elt *)*slot)->lhs;
1967   if (TREE_CODE (lhs) == SSA_NAME)
1969       temp = SSA_NAME_VALUE (lhs);
1971 	lhs = temp;
1975   return lhs;
2058   tree lhs = PHI_RESULT (phi);
2069       if (arg == lhs)
2110    return the "lhs" of the node.  */
2134 propagate_rhs_into_lhs (tree stmt, tree lhs, tree rhs, bitmap interesting_names)
2138   if (! SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs)
2141       && may_propagate_copy (lhs, rhs)
2142       && loop_depth_of_name (lhs) >= loop_depth_of_name (rhs))
2153 	  print_generic_expr (dump_file, lhs, dump_flags);
2163       FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs)
2168 	      && ! may_propagate_copy_into_asm (lhs))
2197 	      || (! is_gimple_reg (lhs)
2199 		  && SSA_NAME_VAR (lhs) == SSA_NAME_VAR (rhs)))
2332       gcc_assert (!all || has_zero_uses (lhs));
2354   tree lhs = get_lhs_or_phi_result (t);
2356   int version = SSA_NAME_VERSION (lhs);
2363   if (has_zero_uses (lhs))
2379   propagate_rhs_into_lhs (t, lhs, rhs, interesting_names);