Home
last modified time | relevance | path

Searched refs:operand_equal_p (Results 1 – 25 of 41) sorted by relevance

12

/NextBSD/contrib/gcc/
HDfold-const.c2627 operand_equal_p (tree arg0, tree arg1, unsigned int flags) in operand_equal_p() function
2657 return operand_equal_p (TREE_OPERAND (arg0, 0), in operand_equal_p()
2659 && operand_equal_p (TREE_OPERAND (arg0, 1), in operand_equal_p()
2711 if (!operand_equal_p (TREE_VALUE (v1), TREE_VALUE (v2), in operand_equal_p()
2722 return (operand_equal_p (TREE_REALPART (arg0), TREE_REALPART (arg1), in operand_equal_p()
2724 && operand_equal_p (TREE_IMAGPART (arg0), TREE_IMAGPART (arg1), in operand_equal_p()
2734 return operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0), in operand_equal_p()
2747 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \ in operand_equal_p()
2784 && operand_equal_p (TREE_OPERAND (arg0, 0), in operand_equal_p()
2786 && operand_equal_p (TREE_OPERAND (arg0, 1), in operand_equal_p()
[all …]
HDtree-vrp.c172 && operand_equal_p (val, TYPE_MIN_VALUE (TREE_TYPE (val)), 0)); in is_negative_overflow_infinity()
183 && operand_equal_p (val, TYPE_MAX_VALUE (TREE_TYPE (val)), 0)); in is_positive_overflow_infinity()
194 && (operand_equal_p (val, TYPE_MAX_VALUE (TREE_TYPE (val)), 0) in is_overflow_infinity()
195 || operand_equal_p (val, TYPE_MIN_VALUE (TREE_TYPE (val)), 0))); in is_overflow_infinity()
208 if (operand_equal_p (val, TYPE_MAX_VALUE (TREE_TYPE (val)), 0)) in avoid_overflow_infinity()
213 gcc_assert (operand_equal_p (val, TYPE_MIN_VALUE (TREE_TYPE (val)), 0)); in avoid_overflow_infinity()
233 && operand_equal_p (val, type_max, 0))); in vrp_val_is_max()
246 && operand_equal_p (val, type_min, 0))); in vrp_val_is_min()
492 if (!val1 || !val2 || !operand_equal_p (val1, val2, 0)) in vrp_operand_equal_p()
847 if (val1 == val2 || operand_equal_p (val1, val2, 0)) in compare_values_warnv()
[all …]
HDtree-ssa-loop-unswitch.c161 && operand_equal_p (COND_EXPR_COND (stmt), cond, 0)) in simplify_using_entry_checks()
HDtree-ssa-dse.c331 && operand_equal_p (TREE_OPERAND (stmt, 0), in dse_optimize_stmt()
HDtree-ssa-ccp.c691 && operand_equal_p (val1->mem_ref, val2->mem_ref, 0)))) in ccp_lattice_meet()
861 if (operand_equal_p (val->mem_ref, rhs, 0)) in ccp_fold()
868 && operand_equal_p (val->mem_ref, TREE_OPERAND (rhs, 0), 0)) in ccp_fold()
1204 && operand_equal_p (nval->mem_ref, rhs, 0)) in visit_assignment()
HDtree-vn.c127 && operand_equal_p (e1, e2, OEP_PURE_SAME)) in expressions_equal_p()
HDtree-ssa-uncprop.c329 return operand_equal_p (value1, value2, 0); in equiv_eq()
HDtree-ssa-loop-ivopts.c2017 if (!operand_equal_p (base, cand->iv->base, 0)) in add_candidate_1()
2027 if (step && operand_equal_p (step, cand->iv->step, 0)) in add_candidate_1()
2576 if (operand_equal_p (top, bot, 0)) in constant_multiple_of()
2712 if (operand_equal_p (comb->elts[i], elt, 0)) in aff_combination_add_elt()
3815 if (operand_equal_p (e1, e2, 0)) in difference_cost()
3883 && !operand_equal_p (use->iv->base_object, cand->iv->base_object, 0)) in get_computation_cost_at()
5411 || operand_equal_p (op, step, 0))) in rewrite_use_nonlinear_expr()
HDtree-ssa-copy.c714 && operand_equal_p (val->mem_ref, TREE_OPERAND (stmt, 1), 0)) in copy_prop_visit_stmt()
HDtree-ssa-loop-prefetch.c241 && operand_equal_p ((*groups)->base, base, 0)) in find_or_create_group()
HDtree-ssa-dom.c2038 && operand_equal_p (rhs1, rhs2, OEP_PURE_SAME)) in avail_expr_eq()
2073 else if (!operand_equal_p (arg, val, 0)) in degenerate_phi_result()
HDtree-chrec.c1366 return operand_equal_p (chrec0, chrec1, 0); in eq_evolutions_p()
HDipa-cp.c245 if (operand_equal_p (const_val1->value, const_val2->value, 0)) in ipcp_cval_equal_cvalues()
HDbuiltins.c8151 if (operand_equal_p (src, dest, 0)) in fold_builtin_memory_op()
8283 if (operand_equal_p (src, dest, 0)) in fold_builtin_strcpy()
8380 if (operand_equal_p (arg1, arg2, 0)) in fold_builtin_memcmp()
8440 if (operand_equal_p (arg1, arg2, 0)) in fold_builtin_strcmp()
8510 if (operand_equal_p (arg1, arg2, 0)) in fold_builtin_strncmp()
8634 if (operand_equal_p (arg1, arg2, 0)) in fold_builtin_copysign()
10221 if (operand_equal_p (src, dest, 0)) in expand_builtin_memory_chk()
10480 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0)) in fold_builtin_memory_chk()
10575 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0)) in fold_builtin_stxcpy_chk()
HDtree-ssa-loop-im.c1197 return operand_equal_p (mem1->mem, (tree) obj2, 0); in memref_eq()
HDipa-type-escape.c1156 if (operand_equal_p (size_in_bytes (op0type), op1, 0)) in okay_pointer_operation()
HDtree-ssa-pre.c2755 else if (!operand_equal_p (first_s, edoubleprime, in insert_aux()
3127 if (!operand_equal_p (TREE_OPERAND (def_stmt, 0), mem_ref, 0)) in try_look_through_load()
HDpredict.c940 else if (!operand_equal_p (val, new_val, false)) in expr_expected_value()
HDtree-ssa-loop-niter.c684 || operand_equal_p (expr, old, 0)) in simplify_replace_tree()
HDtree.c7119 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1), in fields_compatible_p()
7123 if (!operand_equal_p (DECL_FIELD_OFFSET (f1), in fields_compatible_p()
7356 return operand_equal_p (arg0, arg1, 0); in operand_equal_for_phi_arg_p()
HDChangeLog.gcc43220 * fold-const.c (operand_equal_p): Compare INTEGER_CST array
HDvarasm.c3882 && operand_equal_p (valid0, valid1, 1)) in initializer_constant_valid_p()
3941 && operand_equal_p (op0, op1, 1)) in initializer_constant_valid_p()
HDtree-pretty-print.c921 && !operand_equal_p (op1, TYPE_SIZE_UNIT (TREE_TYPE (node)), 0))) in dump_generic_node()
HDexpr.c3902 if (!operand_equal_p (to, op0, 0)) in optimize_bitfield_assignment_op()
4039 if (operand_equal_p (to, from, 0)) in expand_assignment()
6459 if (operand_equal_p (exp0, exp1, 0)) in expand_operands()
HDemit-rtl.c274 && operand_equal_p (p->expr, q->expr, 0)))); in mem_attrs_htab_eq()

12