| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | tree-ssa-ifcombine.cc | 227 && integer_onep (gimple_assign_rhs2 (stmt)) in recognize_single_bit_test() 290 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test() 300 && integer_onep (gimple_assign_rhs1 (tmp))) in recognize_single_bit_test()
|
| D | tree-ssa-address.cc | 200 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref() 372 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw() 856 if (parts.step && !integer_onep (parts.step)) in create_mem_ref() 972 gcc_assert (!parts.step || integer_onep (parts.step)); in create_mem_ref()
|
| D | auto-profile.cc | 1316 || !(integer_zerop (cmp_rhs) || integer_onep (cmp_rhs))) in afdo_propagate_circuit() 1336 bool check_value_one = (((integer_onep (cmp_rhs)) in afdo_propagate_circuit() 1347 || !(integer_zerop (val) || integer_onep (val))) in afdo_propagate_circuit() 1349 if (check_value_one ^ integer_onep (val)) in afdo_propagate_circuit()
|
| D | tree-ssa-phiopt.cc | 1213 return integer_onep (arg); in neutral_element_p() 1220 return right && integer_onep (arg); in neutral_element_p() 2321 if (!integer_onep (rhs)) in spaceship_replacement() 2331 if (!integer_onep (rhs)) in spaceship_replacement() 2550 ^ (!integer_onep ((e1->flags & EDGE_TRUE_VALUE) ? arg1 : arg0))) in spaceship_replacement() 2563 else if (integer_onep (rhs)) in spaceship_replacement() 2573 else if (integer_onep (rhs)) in spaceship_replacement() 2579 if (integer_onep (rhs)) in spaceship_replacement() 2605 else if (integer_onep (rhs)) in spaceship_replacement()
|
| D | tree-ssa-dom.cc | 300 if ((code == EQ_EXPR && integer_onep (value)) in derive_equivalences() 507 && (integer_zerop (op1) || integer_onep (op1))) in record_edge_info() 1997 if (cached_lhs && integer_onep (cached_lhs)) in test_for_singularity() 2206 && ! (integer_zerop (rhs) || integer_onep (rhs))) in optimize_stmt() 2322 else if (integer_onep (val)) in optimize_stmt()
|
| D | tree-ssa-loop-niter.cc | 924 if (integer_onep (s) in number_of_iterations_ne_max() 1059 && (integer_onep (s) in number_of_iterations_ne() 1103 if (!t || !integer_onep (t)) in number_of_iterations_ne() 1106 if (t && integer_onep (t)) in number_of_iterations_ne() 1139 if (integer_onep (s)) in number_of_iterations_ne() 1483 if (integer_onep (may_be_zero)) in number_of_iterations_until_wrap() 1508 && integer_onep (step) in number_of_iterations_until_wrap() 1510 && integer_onep (TREE_OPERAND (iv1->base, 1))) in number_of_iterations_until_wrap() 1515 if (integer_onep (cond)) in number_of_iterations_until_wrap() 1640 if ((integer_onep (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_lt() [all …]
|
| D | fold-const.cc | 501 && ! integer_onep (TREE_OPERAND (t, 1)))) in negate_expr_p() 684 && ! integer_onep (TREE_OPERAND (t, 1)))) in fold_negate_expr_1() 1946 if (integer_onep (arg0) in size_binop_loc() 4395 if (!integer_onep (TREE_OPERAND (arg, 1))) in fold_truth_not_expr() 5361 in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node, in make_range() 5363 && integer_onep (range_binop (LE_EXPR, integer_type_node, in make_range() 5501 if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST) in build_range_check() 5586 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges() 5589 || integer_onep (range_binop (EQ_EXPR, integer_type_node, in merge_ranges() 5594 if (integer_onep (range_binop (GT_EXPR, integer_type_node, in merge_ranges() [all …]
|
| D | gimple-fold.cc | 5245 if (!integer_zerop (weak) && !integer_onep (weak)) in optimize_atomic_compare_exchange_p() 5293 int flag = (integer_onep (gimple_call_arg (stmt, 3)) ? 256 : 0) in fold_builtin_atomic_compare_exchange() 5673 else if (subcode == MULT_EXPR && integer_onep (arg1)) in gimple_fold_call() 5675 else if (subcode == MULT_EXPR && integer_onep (arg0)) in gimple_fold_call() 6253 && (integer_zerop (op2) || integer_onep (op2)) in fold_stmt_1() 6262 || (cmp_code == NE_EXPR && integer_onep (op2))) in fold_stmt_1() 6695 if (integer_onep (t)) in and_var_with_comparison_1() 6704 else if (integer_onep (t)) in and_var_with_comparison_1() 6726 if (integer_onep (t)) in and_var_with_comparison_1() 6742 if (integer_onep (t)) in and_var_with_comparison_1() [all …]
|
| D | tree-ssa-reassoc.cc | 1089 else if (integer_onep (oelast->op) in eliminate_using_constants() 2606 || (low && integer_onep (low)))) in init_range_entry() 2699 if (tem && integer_onep (tem)) in range_entry_cmp() 2703 if (tem && integer_onep (tem)) in range_entry_cmp() 2719 if (tem && integer_onep (tem)) in range_entry_cmp() 2723 if (tem && integer_onep (tem)) in range_entry_cmp() 2855 && integer_onep (TREE_OPERAND (tem, 1)))) in update_range_test() 3187 if (tem == NULL_TREE || !integer_onep (tem)) in optimize_range_tests_1() 3775 && integer_onep (ranges[i].low) in optimize_range_tests_var_bound() 3776 && integer_onep (ranges[i].high)) in optimize_range_tests_var_bound() [all …]
|
| D | tree.cc | 1923 else if (integer_onep (t)) in cache_integer_cst() 2840 integer_onep (const_tree expr) in integer_onep() function 2849 return (integer_onep (TREE_REALPART (expr)) in integer_onep() 2854 && integer_onep (VECTOR_CST_ENCODED_ELT (expr, 0))); in integer_onep() 2870 return (integer_onep (TREE_REALPART (expr)) in integer_each_onep() 2871 && integer_onep (TREE_IMAGPART (expr))); in integer_each_onep() 2873 return integer_onep (expr); in integer_each_onep() 2964 return integer_onep (expr); in integer_truep() 10326 return integer_zerop (expr) || integer_onep (expr); in initializer_each_zero_or_onep() 15080 ASSERT_FALSE (integer_onep (i_0)); in test_predicates() [all …]
|
| D | tree-chrec.cc | 426 if (integer_onep (op1)) in chrec_fold_multiply() 443 if (integer_onep (op0)) in chrec_fold_multiply() 466 if (integer_onep (op1)) in chrec_fold_multiply()
|
| D | tree-ssa-uncprop.cc | 99 && (integer_zerop (op1) || integer_onep (op1))) in associate_equivalences_with_edges()
|
| D | predict.cc | 1882 || !(integer_zerop (cmp_rhs) || integer_onep (cmp_rhs))) in predict_extra_loop_exits() 1890 check_value_one = (((integer_onep (cmp_rhs)) in predict_extra_loop_exits() 1909 if (!TREE_CONSTANT (val) || !(integer_zerop (val) || integer_onep (val))) in predict_extra_loop_exits() 1911 if ((check_value_one ^ integer_onep (val)) == 1) in predict_extra_loop_exits() 2779 || integer_onep (op1) in tree_predict_by_opcode() 2790 || integer_onep (op1) in tree_predict_by_opcode() 2850 && (!integer_zerop (val) && !integer_onep (val))) in return_prediction()
|
| D | tree-vrp.cc | 489 if (t && integer_onep (t)) in compare_values_warnv() 497 if (t && integer_onep (t)) in compare_values_warnv() 506 if (t && integer_onep (t)) in compare_values_warnv() 2166 if ((comp_code == EQ_EXPR && integer_onep (val)) in register_edge_assert_for() 2190 && integer_onep (val) in register_edge_assert_for() 2429 if (!integer_onep (int_const_binop (MINUS_EXPR, low, high))) in find_case_label_range() 4093 else if (integer_onep (val)) in fold_predicate_in()
|
| D | dojump.cc | 508 if (integer_onep (TREE_OPERAND (exp, 1))) in do_jump() 523 && integer_onep (TREE_OPERAND (exp0, 1))) in do_jump()
|
| D | match.pd | 28 integer_onep integer_zerop integer_all_onesp integer_minus_onep 353 (op @0 integer_onep) 369 (trunc_div (convert?@0 @3) (convert2? (lshift integer_onep@1 @2))) 456 (trunc_div integer_onep@0 @1) 624 (mod @0 integer_onep) 692 (minus (mult:cs @0 (plus:s (trunc_div:s @1 @0) integer_onep)) @1) 902 (mult:c @0 (convert? (lshift integer_onep@1 @2))) 924 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3)) 994 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep)) 1293 (plus:c @0 (bit_and:s @0 integer_onep@1)) [all …]
|
| D | gimple-ssa-strength-reduction.cc | 840 if (!integer_onep (arg_cand->stride)) in slsr_process_phi() 929 && integer_onep (base_cand->stride)) in backtrace_base_for_ref() 1092 if (base_cand->kind == CAND_MULT && integer_onep (base_cand->stride)) in create_mul_ssa_cand() 1180 else if (base_cand->kind == CAND_ADD && integer_onep (base_cand->stride)) in create_mul_imm_cand()
|
| D | omp-expand.cc | 1560 gcc_assert (integer_onep (fd->loop.step)); in expand_oacc_collapse_init() 1883 == NULL_TREE || !integer_onep (t))) in expand_omp_for_init_counts() 2267 gcc_assert (integer_onep (fd->loops[i].m1)); in expand_omp_for_init_counts() 2291 gcc_assert (integer_onep (fd->loops[i].m2)); in expand_omp_for_init_counts() 2795 gcc_assert (integer_onep (fd->loops[j].m1)); in expand_omp_for_init_vars() 2819 gcc_assert (integer_onep (fd->loops[j].m2)); in expand_omp_for_init_vars() 3036 gcc_assert (integer_onep (fd->loops[i].m2)); in expand_omp_for_init_vars() 3377 && integer_onep (fd->loops[i].step) in expand_omp_ordered_sink() 3462 ? !integer_onep (fd->loops[i].step) in expand_omp_ordered_sink() 3560 && integer_onep (fd->loops[i].step)) in expand_omp_ordered_source_sink() [all …]
|
| D | convert.cc | 1103 else if (integer_onep (expr) && ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type))) in convert_to_fixed()
|
| D | tree-tailcall.cc | 864 if (integer_onep (a)) in adjust_accumulator_values()
|
| D | value-range.cc | 805 && integer_onep (int_const_binop (MINUS_EXPR, in intersect_ranges() 811 && integer_onep (int_const_binop (MINUS_EXPR, in intersect_ranges()
|
| D | tree-ssa-threadedge.cc | 1031 || (!integer_onep (rhs) && !integer_zerop (rhs))) in edge_forwards_cmp_to_conditional_jump_through_empty_bb_p()
|
| D | omp-offload.cc | 582 striding = integer_onep (chunk_size); in oacc_xform_loop() 734 r = build2 (integer_onep (dir) ? MIN_EXPR : MAX_EXPR, in oacc_xform_loop()
|
| D | tree-vect-patterns.cc | 2137 if (!integer_onep (gimple_assign_rhs2 (last_stmt))) in vect_recog_mulhs_pattern() 2141 if (!integer_onep (gimple_assign_rhs2 (rshift_input_stmt))) in vect_recog_mulhs_pattern() 2298 || !integer_onep (gimple_assign_rhs2 (last_stmt))) in vect_recog_average_pattern() 2343 if (integer_onep (unprom[i].op)) in vect_recog_average_pattern()
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/cp/ |
| D | except.cc | 300 else if (integer_onep (cond)) in build_must_not_throw_expr()
|