Home
last modified time | relevance | path

Searched refs:integer_onep (Results 1 – 25 of 85) sorted by relevance

1234

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dgimple-fold.c404 && (integer_zerop (op2) || integer_onep (op2)) in fold_gimple_assign()
413 || (cmp_code == NE_EXPR && integer_onep (op2))) in fold_gimple_assign()
1616 if (integer_onep (t)) in and_var_with_comparison_1()
1625 else if (integer_onep (t)) in and_var_with_comparison_1()
1646 if (integer_onep (t)) in and_var_with_comparison_1()
1662 if (integer_onep (t)) in and_var_with_comparison_1()
1855 && (integer_zerop (op1b) || integer_onep (op1b))) in and_comparisons_1()
1858 || (code1 == NE_EXPR && integer_onep (op1b))); in and_comparisons_1()
2077 if (integer_onep (t)) in or_var_with_comparison_1()
2110 else if (integer_onep (t)) in or_var_with_comparison_1()
[all …]
H A Dtree-ssa-ifcombine.c190 && integer_onep (gimple_assign_rhs2 (stmt)) in recognize_single_bit_test()
252 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test()
262 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test()
H A Dtree-ssa-address.c196 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref()
344 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw()
705 if (parts.step && !integer_onep (parts.step)) in create_mem_ref()
794 gcc_assert (!parts.step || integer_onep (parts.step)); in create_mem_ref()
H A Dtree-ssa-forwprop.c543 && integer_onep (rhs2)))) in forward_propagate_into_gimple_cond()
593 && integer_onep (gimple_assign_rhs2 (def_stmt)))) in forward_propagate_into_cond()
612 if (integer_onep (tmp)) in forward_propagate_into_cond()
691 if (integer_onep (tunit)) in forward_propagate_addr_into_variable_array_index()
1193 && integer_onep (gimple_assign_rhs2 (use_stmt)))) in forward_propagate_comparison()
1694 if (integer_onep (op2) && truth_valued_ssa_name (op1)) in lookup_logical_inverted_value()
1699 if (integer_onep (op2) && truth_valued_ssa_name (op1)) in lookup_logical_inverted_value()
2078 && integer_onep (rhs1)) in associate_plusminus()
H A Dfold-const.c681 || integer_onep (tem))) in fold_negate_expr()
1461 if (integer_onep (arg0) && !TREE_OVERFLOW (arg0)) in size_binop_loc()
3174 if (!integer_onep (TREE_OPERAND (arg, 1))) in fold_truth_not_expr()
4158 in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node, in make_range()
4160 && integer_onep (range_binop (LE_EXPR, integer_type_node, in make_range()
4225 if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST) in build_range_check()
4356 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges()
4359 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges()
4364 if (integer_onep (range_binop (GT_EXPR, integer_type_node, in merge_ranges()
4367 && integer_onep (range_binop (GT_EXPR, integer_type_node, in merge_ranges()
[all …]
H A Dtree-ssa-phiopt.c514 if ((integer_zerop (arg0) && integer_onep (arg1)) in conditional_replacement()
515 || (integer_zerop (arg1) && integer_onep (arg0))) in conditional_replacement()
555 || (e0 == false_edge && integer_onep (arg0)) in conditional_replacement()
557 || (e1 == false_edge && integer_onep (arg1))) in conditional_replacement()
H A Dtree-ssa-reassoc.c883 else if (integer_onep (oelast->op) in eliminate_using_constants()
1747 if (tem && integer_onep (tem)) in range_entry_cmp()
1751 if (tem && integer_onep (tem)) in range_entry_cmp()
1767 if (tem && integer_onep (tem)) in range_entry_cmp()
1771 if (tem && integer_onep (tem)) in range_entry_cmp()
1977 if (tem == NULL_TREE || !integer_onep (tem)) in optimize_range_tests()
H A Dtree-chrec.c410 if (integer_onep (op1)) in chrec_fold_multiply()
426 if (integer_onep (op0)) in chrec_fold_multiply()
445 if (integer_onep (op1)) in chrec_fold_multiply()
H A Dtree-vrp.c1293 if (t && integer_onep (t)) in compare_values_warnv()
1452 || integer_onep (op)) in op_with_boolean_value_range_p()
1461 && integer_onep (vr->max)); in op_with_boolean_value_range_p()
4588 if (((comp_code == EQ_EXPR && integer_onep (val)) in register_edge_assert_for()
4607 || (comp_code == NE_EXPR && integer_onep (val)))) in register_edge_assert_for()
6282 if (!integer_onep (int_const_binop (MINUS_EXPR, low, high))) in find_case_label_range()
6867 && integer_onep (val) in simplify_div_or_mod_using_ranges()
6882 if (val && integer_onep (val)) in simplify_div_or_mod_using_ranges()
6942 else if (integer_onep (val)) in simplify_abs_using_ranges()
6948 && (integer_onep (val) || integer_zerop (val))) in simplify_abs_using_ranges()
[all …]
H A Dtree-ssa-loop-niter.c658 if (integer_onep (s)) in number_of_iterations_ne()
1047 if ((integer_onep (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_lt()
1883 if (integer_onep (niter->assumptions)) in number_of_iterations_exit()
1904 && (integer_onep (iv1.step) || integer_all_onesp (iv1.step))) in number_of_iterations_exit()
1905 : (integer_onep (iv0.step) || integer_all_onesp (iv0.step))) in number_of_iterations_exit()
H A Ddojump.c507 if (integer_onep (TREE_OPERAND (exp, 1))) in do_jump()
522 && integer_onep (TREE_OPERAND (exp0, 1))) in do_jump()
H A Dpredict.c1495 || integer_onep (op1) in tree_predict_by_opcode()
1506 || integer_onep (op1) in tree_predict_by_opcode()
1551 && (!integer_zerop (val) && !integer_onep (val))) in return_prediction()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-ifcombine.c226 && integer_onep (gimple_assign_rhs2 (stmt)) in recognize_single_bit_test()
289 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test()
299 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test()
H A Dgimple-fold.c3878 if (!integer_zerop (weak) && !integer_onep (weak)) in optimize_atomic_compare_exchange_p()
3926 int flag = (integer_onep (gimple_call_arg (stmt, 3)) ? 256 : 0) in fold_builtin_atomic_compare_exchange()
4271 else if (subcode == MULT_EXPR && integer_onep (arg1)) in gimple_fold_call()
4273 else if (subcode == MULT_EXPR && integer_onep (arg0)) in gimple_fold_call()
4789 && (integer_zerop (op2) || integer_onep (op2)) in fold_stmt_1()
4798 || (cmp_code == NE_EXPR && integer_onep (op2))) in fold_stmt_1()
5284 if (integer_onep (t)) in and_var_with_comparison_1()
5293 else if (integer_onep (t)) in and_var_with_comparison_1()
5314 if (integer_onep (t)) in and_var_with_comparison_1()
5330 if (integer_onep (t)) in and_var_with_comparison_1()
[all …]
H A Dtree-ssa-address.c199 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref()
357 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw()
841 if (parts.step && !integer_onep (parts.step)) in create_mem_ref()
957 gcc_assert (!parts.step || integer_onep (parts.step)); in create_mem_ref()
H A Dfold-const.c488 && ! integer_onep (TREE_OPERAND (t, 1)))) in negate_expr_p()
671 && ! integer_onep (TREE_OPERAND (t, 1)))) in fold_negate_expr_1()
1910 if (integer_onep (arg0) && !TREE_OVERFLOW (arg0)) in size_binop_loc()
3895 if (!integer_onep (TREE_OPERAND (arg, 1))) in fold_truth_not_expr()
4833 in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node, in make_range()
4835 && integer_onep (range_binop (LE_EXPR, integer_type_node, in make_range()
4972 if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST) in build_range_check()
5060 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges()
5063 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges()
5068 if (integer_onep (range_binop (GT_EXPR, integer_type_node, in merge_ranges()
[all …]
H A Dauto-profile.c1313 || !(integer_zerop (cmp_rhs) || integer_onep (cmp_rhs))) in afdo_propagate_circuit()
1333 bool check_value_one = (((integer_onep (cmp_rhs)) in afdo_propagate_circuit()
1344 || !(integer_zerop (val) || integer_onep (val))) in afdo_propagate_circuit()
1346 if (check_value_one ^ integer_onep (val)) in afdo_propagate_circuit()
H A Dtree-ssa-dom.c300 if ((code == EQ_EXPR && integer_onep (value)) in derive_equivalences()
506 && (integer_zerop (op1) || integer_onep (op1))) in record_edge_info()
1885 if (cached_lhs && integer_onep (cached_lhs)) in test_for_singularity()
2029 && ! (integer_zerop (rhs) || integer_onep (rhs))) in optimize_stmt()
2139 else if (integer_onep (val)) in optimize_stmt()
H A Dtree-ssa-reassoc.c1023 else if (integer_onep (oelast->op) in eliminate_using_constants()
2159 || (low && integer_onep (low)))) in init_range_entry()
2252 if (tem && integer_onep (tem)) in range_entry_cmp()
2256 if (tem && integer_onep (tem)) in range_entry_cmp()
2272 if (tem && integer_onep (tem)) in range_entry_cmp()
2276 if (tem && integer_onep (tem)) in range_entry_cmp()
2366 && integer_onep (TREE_OPERAND (tem, 1)))) in update_range_test()
2642 if (tem == NULL_TREE || !integer_onep (tem)) in optimize_range_tests_1()
3085 && integer_onep (ranges[i].low) in optimize_range_tests_var_bound()
3086 && integer_onep (ranges[i].high)) in optimize_range_tests_var_bound()
[all …]
H A Dtree-chrec.c472 if (integer_onep (op1)) in chrec_fold_multiply()
489 if (integer_onep (op0)) in chrec_fold_multiply()
512 if (integer_onep (op1)) in chrec_fold_multiply()
H A Dtree-ssa-uncprop.c99 && (integer_zerop (op1) || integer_onep (op1))) in associate_equivalences_with_edges()
H A Dpredict.c1788 || !(integer_zerop (cmp_rhs) || integer_onep (cmp_rhs))) in predict_extra_loop_exits()
1796 check_value_one = (((integer_onep (cmp_rhs)) in predict_extra_loop_exits()
1815 if (!TREE_CONSTANT (val) || !(integer_zerop (val) || integer_onep (val))) in predict_extra_loop_exits()
1817 if ((check_value_one ^ integer_onep (val)) == 1) in predict_extra_loop_exits()
2581 || integer_onep (op1) in tree_predict_by_opcode()
2592 || integer_onep (op1) in tree_predict_by_opcode()
2652 && (!integer_zerop (val) && !integer_onep (val))) in return_prediction()
H A Dtree-ssa-phiopt.c597 if ((integer_zerop (arg0) && integer_onep (arg1)) in conditional_replacement()
598 || (integer_zerop (arg1) && integer_onep (arg0))) in conditional_replacement()
823 return integer_onep (arg); in neutral_element_p()
830 return right && integer_onep (arg); in neutral_element_p()
H A Dtree-ssa-loop-niter.c903 if (integer_onep (s) in number_of_iterations_ne_max()
1032 && (integer_onep (s) || multiple_of_p (type, c, s))) in number_of_iterations_ne()
1080 if (!t || !integer_onep (t)) in number_of_iterations_ne()
1083 if (t && integer_onep (t)) in number_of_iterations_ne()
1088 if (integer_onep (s)) in number_of_iterations_ne()
1481 if ((integer_onep (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_lt()
3138 if (!integer_onep (niter->assumptions) || !niter->control.no_overflow) in record_control_iv()
/dflybsd-src/contrib/gcc-8.0/gcc/c-family/
H A Dc-warn.c214 && !integer_onep (op_right)) in warn_logical_operator()
1690 && (integer_onep (ARG) || integer_zerop (ARG)))) in warn_about_parentheses()
1909 && !integer_onep (TYPE_SIZE_UNIT (elt_type)) in warn_for_memset()
1914 && integer_onep (fold_build2 (MINUS_EXPR, domain, in warn_for_memset()
2344 if (!integer_zerop (cst) && !integer_onep (cst)) in maybe_warn_bool_compare()
2357 else if (integer_zerop (cst) || integer_onep (cst)) in maybe_warn_bool_compare()

1234