Home
last modified time | relevance | path

Searched refs:integer_pow2p (Results 1 – 25 of 44) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-ifcombine.cc267 && integer_pow2p (gimple_assign_rhs2 (stmt))) in recognize_single_bit_test()
H A Dmatch.pd37 integer_pow2p
587 (if (integer_pow2p (@2)
653 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
712 (if (integer_pow2p (@3) && tree_int_cst_sgn (@3) > 0)
727 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
736 (trunc_div (mult @0 integer_pow2p@1) @1)
745 (mult (trunc_div @0 integer_pow2p@1) @1)
3460 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3467 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3584 (nop_convert? (lshift integer_onep @0)) integer_pow2p@1) integer_zerop)
[all …]
H A Dfold-const.cc6448 if (l_const && integer_zerop (l_const) && integer_pow2p (ll_mask)) in fold_truth_andor_1()
6463 if (r_const && integer_zerop (r_const) && integer_pow2p (rl_mask)) in fold_truth_andor_1()
7374 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_single_bit_test_into_sign_test()
7408 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_single_bit_test()
11846 if (integer_pow2p (sval) && tree_int_cst_sgn (sval) > 0) in fold_binary_loc()
12206 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
12321 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_binary_loc()
12337 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
12351 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
13076 && integer_pow2p (arg1)) in fold_ternary_loc()
[all …]
H A Dinternal-fn.cc1722 && (integer_pow2p (arg0) || integer_pow2p (arg1)) in expand_mul_overflow()
1744 if (integer_pow2p (arg0)) in expand_mul_overflow()
H A Dtree.cc2921 integer_pow2p (const_tree expr) in integer_pow2p() function
2926 && integer_pow2p (TREE_REALPART (expr)) in integer_pow2p()
15335 ASSERT_FALSE (integer_pow2p (i_0)); in test_predicates()
15336 ASSERT_TRUE (integer_pow2p (i_1)); in test_predicates()
15337 ASSERT_TRUE (integer_pow2p (wr_i_1)); in test_predicates()
H A Dtree-scalar-evolution.cc3376 if (!integer_pow2p (TREE_OPERAND (expr, 1))) in expression_expensive_p()
H A Dtree-vect-generic.cc622 && (!integer_pow2p (cst) || tree_int_cst_sgn (cst) != 1)) in expand_vector_divmod()
H A Dtree-ssa-reassoc.cc3055 if (!integer_pow2p (lowxor)) in optimize_range_tests_xor()
3117 if (!integer_pow2p (tem1)) in optimize_range_tests_diff()
H A Dtree-ssa-loop-ivopts.cc4190 && !integer_pow2p (cstep)) in get_debug_computation_at()
4495 if (integer_pow2p (TREE_OPERAND (expr, 1))) in force_expr_to_var_cost()
H A Dvr-values.cc3061 if (!integer_pow2p (op1)) in simplify_div_or_mod_using_ranges()
H A Dtree-ssa-math-opts.cc4396 if (integer_pow2p (op2)) in divmod_candidate_p()
H A Dtree-vect-patterns.cc3464 if (integer_pow2p (oprnd1)) in vect_recog_divmod_pattern()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-ifcombine.c265 && integer_pow2p (gimple_assign_rhs2 (stmt))) in recognize_single_bit_test()
H A Dfold-const.c6365 if (l_const && integer_zerop (l_const) && integer_pow2p (ll_mask)) in fold_truth_andor_1()
6380 if (r_const && integer_zerop (r_const) && integer_pow2p (rl_mask)) in fold_truth_andor_1()
7277 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_single_bit_test_into_sign_test()
7311 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_single_bit_test()
11221 if (integer_pow2p (sval) && tree_int_cst_sgn (sval) > 0) in fold_binary_loc()
11580 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
11684 && integer_pow2p (TREE_OPERAND (arg0, 1))) in fold_binary_loc()
11700 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
11714 && integer_pow2p (TREE_OPERAND (arg0, 1)) in fold_binary_loc()
12477 && integer_pow2p (arg1)) in fold_ternary_loc()
[all …]
H A Dmatch.pd37 integer_pow2p
484 (if (integer_pow2p (@2)
550 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
608 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
617 (trunc_div (mult @0 integer_pow2p@1) @1)
626 (mult (trunc_div @0 integer_pow2p@1) @1)
4347 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
4354 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
4356 (if (integer_pow2p (@2))
4373 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
[all …]
H A Dinternal-fn.c1506 && (integer_pow2p (arg0) || integer_pow2p (arg1)) in expand_mul_overflow()
1528 if (integer_pow2p (arg0)) in expand_mul_overflow()
H A Dtree.c2652 integer_pow2p (const_tree expr) in integer_pow2p() function
2657 && integer_pow2p (TREE_REALPART (expr)) in integer_pow2p()
15838 ASSERT_FALSE (integer_pow2p (i_0)); in test_predicates()
15839 ASSERT_TRUE (integer_pow2p (i_1)); in test_predicates()
15840 ASSERT_TRUE (integer_pow2p (wr_i_1)); in test_predicates()
H A Dtree-vect-generic.c522 && (!integer_pow2p (cst) || tree_int_cst_sgn (cst) != 1)) in expand_vector_divmod()
H A Dtree-scalar-evolution.c3384 if (!integer_pow2p (TREE_OPERAND (expr, 1))) in expression_expensive_p()
H A Dtree-ssa-reassoc.c2890 if (!integer_pow2p (lowxor)) in optimize_range_tests_xor()
2952 if (!integer_pow2p (tem1)) in optimize_range_tests_diff()
H A Dtree-ssa-loop-ivopts.c4159 && !integer_pow2p (cstep)) in get_debug_computation_at()
4464 if (integer_pow2p (TREE_OPERAND (expr, 1))) in force_expr_to_var_cost()
H A Dvr-values.c3163 if (!integer_pow2p (op1)) in simplify_div_or_mod_using_ranges()
H A Dtree-vect-patterns.c3107 if (integer_pow2p (oprnd1)) in vect_recog_divmod_pattern()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/c-family/
H A Dc-attribs.c3020 if (!integer_pow2p (val)) in handle_assume_aligned_attribute()
/netbsd-src/external/gpl3/gcc/dist/gcc/c-family/
H A Dc-attribs.cc3627 if (!integer_pow2p (val)) in handle_assume_aligned_attribute()

12