HomeSort by: relevance | last modified time | path
    Searched defs:lhs2 (Results 1 - 14 of 14) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
gimple-ssa-split-paths.cc 190 tree lhs2 = gimple_assign_lhs (stmt2); local
196 && gimple_phi_arg_def (phi, 1) == lhs2)
198 && gimple_phi_arg_def (phi, 0) == lhs2))
read-rtl-function.cc 1834 rtx lhs2 = XEXP (src2, 0); local
1835 ASSERT_EQ (lhs1, lhs2);
tree-ssa-dom.cc 1125 tree lhs2 = gimple_get_lhs (use_stmt); local
1126 if (!lhs2 || TREE_CODE (lhs2) != SSA_NAME)
1151 record_equality (lhs2, res, const_and_copies);
tree-ssa-tail-merge.cc 1137 tree lhs1, lhs2; local
1169 lhs2 = gimple_get_lhs (s2);
1170 if (lhs1 == NULL_TREE && lhs2 == NULL_TREE)
1172 if (lhs1 == NULL_TREE || lhs2 == NULL_TREE)
1174 if (TREE_CODE (lhs1) == SSA_NAME && TREE_CODE (lhs2) == SSA_NAME)
1175 return tail_merge_valueize (lhs1) == tail_merge_valueize (lhs2);
1176 return operand_equal_p (lhs1, lhs2, 0);
1183 lhs2 = gimple_get_lhs (s2);
1185 && TREE_CODE (lhs2) != SSA_NAME)
1186 return (operand_equal_p (lhs1, lhs2, 0
    [all...]
tree-ssa-forwprop.cc 1506 tree lhs2 = gimple_call_lhs (stmt2), lhsc = lhs2; local
1512 if (ndecl == NULL_TREE || !single_imm_use (lhs2, &use_p, &use_stmt))
1522 != TYPE_PRECISION (TREE_TYPE (lhs2)))
1527 lhsc = lhs2;
1550 tree a = fold_convert (TREE_TYPE (lhs2), arg);
1551 tree o = fold_convert (TREE_TYPE (lhs2),
1599 tree a = fold_convert (TREE_TYPE (lhs2), arg);
1600 o = fold_convert (TREE_TYPE (lhs2), o);
1644 == TYPE_PRECISION (TREE_TYPE (lhs2))))
    [all...]
tree-ssa-phiopt.cc 2537 tree lhs2 = gimple_cond_lhs (cond2); local
2539 if (lhs2 == lhs1)
2579 else if (lhs2 == rhs1)
2592 tree lhs3 = lhs2;
2626 if ((lhs2 == lhs1)
gimple-fold.cc 7106 /* Allocate SSA names(lhs2) on the stack. */
7108 tree lhs2 = (tree) &lhs2buf[0]; local
7109 memset (lhs2, 0, sizeof (tree_ssa_name));
7110 TREE_SET_CODE (lhs2, SSA_NAME);
7111 TREE_TYPE (lhs2) = type;
7112 init_ssa_name_imm_use (lhs2);
7115 gimple_assign_set_lhs (stmt2, lhs2);
7134 else if (res == lhs2)
7144 if (op0 == lhs1 || op0 == lhs2 || op1 == lhs1 || op1 == lhs2)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-ssa-split-paths.cc 190 tree lhs2 = gimple_assign_lhs (stmt2); local
196 && gimple_phi_arg_def (phi, 1) == lhs2)
198 && gimple_phi_arg_def (phi, 0) == lhs2))
read-rtl-function.cc 1833 rtx lhs2 = XEXP (src2, 0); local
1834 ASSERT_EQ (lhs1, lhs2);
tree-ssa-dom.cc 1053 tree lhs2 = gimple_get_lhs (use_stmt); local
1054 if (!lhs2 || TREE_CODE (lhs2) != SSA_NAME)
1096 record_equality (lhs2, res, const_and_copies);
tree-ssa-phiopt.cc 2419 tree lhs2 = gimple_cond_lhs (cond2); local
2421 if (lhs2 == lhs1)
2461 else if (lhs2 == rhs1)
2474 tree lhs3 = lhs2;
2508 if ((lhs2 == lhs1)
tree-ssa-tail-merge.cc 1126 tree lhs1, lhs2; local
1158 lhs2 = gimple_get_lhs (s2);
1159 if (lhs1 == NULL_TREE && lhs2 == NULL_TREE)
1161 if (lhs1 == NULL_TREE || lhs2 == NULL_TREE)
1163 if (TREE_CODE (lhs1) == SSA_NAME && TREE_CODE (lhs2) == SSA_NAME)
1164 return tail_merge_valueize (lhs1) == tail_merge_valueize (lhs2);
1165 return operand_equal_p (lhs1, lhs2, 0);
1172 lhs2 = gimple_get_lhs (s2);
1174 && TREE_CODE (lhs2) != SSA_NAME)
1175 return (operand_equal_p (lhs1, lhs2, 0
    [all...]
tree-ssa-forwprop.cc 1498 tree lhs2 = gimple_call_lhs (stmt2), lhsc = lhs2; local
1504 if (ndecl == NULL_TREE || !single_imm_use (lhs2, &use_p, &use_stmt))
1514 != TYPE_PRECISION (TREE_TYPE (lhs2)))
1519 lhsc = lhs2;
1542 tree a = fold_convert (TREE_TYPE (lhs2), arg);
1543 tree o = fold_convert (TREE_TYPE (lhs2),
1591 tree a = fold_convert (TREE_TYPE (lhs2), arg);
1592 o = fold_convert (TREE_TYPE (lhs2), o);
1636 == TYPE_PRECISION (TREE_TYPE (lhs2))))
    [all...]
gimple-fold.cc 6957 /* Allocate SSA names(lhs2) on the stack. */
6958 tree lhs2 = (tree)XALLOCA (tree_ssa_name); local
6959 memset (lhs2, 0, sizeof (tree_ssa_name));
6960 TREE_SET_CODE (lhs2, SSA_NAME);
6961 TREE_TYPE (lhs2) = type;
6962 init_ssa_name_imm_use (lhs2);
6965 gimple_assign_set_lhs (stmt2, lhs2);
6979 else if (res == lhs2)
6989 if (op0 == lhs1 || op0 == lhs2 || op1 == lhs1 || op1 == lhs2)
    [all...]

Completed in 58 milliseconds