Home
last modified time | relevance | path

Searched refs:BIT_AND_EXPR (Results 1 – 25 of 274) sorted by relevance

1234567891011

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtsan.c346 FETCH_OP (ATOMIC_AND_FETCH_1, TSAN_ATOMIC8_FETCH_AND, BIT_AND_EXPR),
347 FETCH_OP (ATOMIC_AND_FETCH_2, TSAN_ATOMIC16_FETCH_AND, BIT_AND_EXPR),
348 FETCH_OP (ATOMIC_AND_FETCH_4, TSAN_ATOMIC32_FETCH_AND, BIT_AND_EXPR),
349 FETCH_OP (ATOMIC_AND_FETCH_8, TSAN_ATOMIC64_FETCH_AND, BIT_AND_EXPR),
350 FETCH_OP (ATOMIC_AND_FETCH_16, TSAN_ATOMIC128_FETCH_AND, BIT_AND_EXPR),
416 FETCH_OPS (SYNC_AND_AND_FETCH_1, TSAN_ATOMIC8_FETCH_AND, BIT_AND_EXPR),
417 FETCH_OPS (SYNC_AND_AND_FETCH_2, TSAN_ATOMIC16_FETCH_AND, BIT_AND_EXPR),
418 FETCH_OPS (SYNC_AND_AND_FETCH_4, TSAN_ATOMIC32_FETCH_AND, BIT_AND_EXPR),
419 FETCH_OPS (SYNC_AND_AND_FETCH_8, TSAN_ATOMIC64_FETCH_AND, BIT_AND_EXPR),
420 FETCH_OPS (SYNC_AND_AND_FETCH_16, TSAN_ATOMIC128_FETCH_AND, BIT_AND_EXPR),
[all …]
H A Dtree-ssa-ifcombine.c224 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
263 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
277 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
326 || gimple_assign_rhs_code (stmt) != BIT_AND_EXPR) in recognize_bits_test()
425 t2 = fold_build2 (BIT_AND_EXPR, TREE_TYPE (name1), name1, t); in ifcombine_ifandif()
505 t = fold_build2 (BIT_AND_EXPR, TREE_TYPE (name1), name1, t); in ifcombine_ifandif()
H A Dccmp.c106 if (tcode != BIT_AND_EXPR && tcode != BIT_IOR_EXPR) in ccmp_candidate_p()
199 gcc_assert (code == BIT_AND_EXPR || code == BIT_IOR_EXPR); in expand_ccmp_expr_1()
268 gcc_assert (gimple_assign_rhs_code (gs0) == BIT_AND_EXPR in expand_ccmp_expr_1()
H A Dtree-vect-generic.c229 b_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, b, low_bits); in do_plus_minus()
231 a_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, a, low_bits); in do_plus_minus()
238 signs = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, signs, high_bits); in do_plus_minus()
260 b_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, b, low_bits); in do_negate()
262 signs = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, signs, high_bits); in do_negate()
749 op = optab_for_tree_code (BIT_AND_EXPR, type, optab_default); in expand_vector_divmod()
755 return gimplify_build2 (gsi, BIT_AND_EXPR, type, op0, mask); in expand_vector_divmod()
768 cur_op = gimplify_build2 (gsi, BIT_AND_EXPR, type, in expand_vector_divmod()
992 a1 = gimplify_build2 (gsi, BIT_AND_EXPR, type, a, b); in expand_vector_condition()
994 a2 = gimplify_build2 (gsi, BIT_AND_EXPR, type, a2, c); in expand_vector_condition()
[all …]
H A Dfold-const.c991 case BIT_AND_EXPR: in wide_int_binop()
4311 case BIT_AND_EXPR: in fold_truth_not_expr()
4554 t1 = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, t1, mask); in optimize_bit_field_compare()
4557 t2 = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, t2, mask); in optimize_bit_field_compare()
4606 rhs = const_binop (BIT_AND_EXPR, in optimize_bit_field_compare()
4613 build2 (BIT_AND_EXPR, unsigned_type, lhs, mask), rhs); in optimize_bit_field_compare()
4669 if (TREE_CODE (exp) == BIT_AND_EXPR) in decode_field_reference()
4715 mask = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, in decode_field_reference()
5399 if (TREE_CODE (exp) == BIT_AND_EXPR in build_range_check()
5402 fold_build2_loc (loc, BIT_AND_EXPR, etype, in build_range_check()
[all …]
H A Dtree-ssa-reassoc.c732 case BIT_AND_EXPR: in eliminate_duplicate_pair()
884 if ((opcode != BIT_IOR_EXPR && opcode != BIT_AND_EXPR) in eliminate_not_pairs()
907 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
912 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
918 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
952 case BIT_AND_EXPR: in eliminate_using_constants()
1862 && opcode != BIT_AND_EXPR) in undistribute_bitref_for_vector()
2078 gcc_assert (opcode == BIT_AND_EXPR); in undistribute_bitref_for_vector()
2147 if (opcode != BIT_IOR_EXPR && opcode != BIT_AND_EXPR) in eliminate_redundant_comparison()
2912 exp = fold_build2 (BIT_AND_EXPR, type, exp, tem); in optimize_range_tests_xor()
[all …]
H A Dtree-ssa-threadedge.c611 else if (gimple_assign_rhs_code (def_stmt) == BIT_AND_EXPR in simplify_control_stmt_condition_1()
626 else if (rhs_code == BIT_AND_EXPR && integer_zerop (res1)) in simplify_control_stmt_condition_1()
653 else if (rhs_code == BIT_AND_EXPR && integer_zerop (res2)) in simplify_control_stmt_condition_1()
674 if (rhs_code == BIT_AND_EXPR in simplify_control_stmt_condition_1()
H A Dtree-ssa-uninit.c1057 if (cmpc != BIT_AND_EXPR)
1501 code1 == BIT_AND_EXPR); in is_pred_expr_subset_of()
1850 if (gimple_assign_rhs_code (def_stmt) != BIT_AND_EXPR) in simplify_preds_4()
2127 if (and_or_code == BIT_AND_EXPR) in normalize_one_pred_1()
2179 if (and_or_code != BIT_IOR_EXPR && and_or_code != BIT_AND_EXPR) in normalize_one_pred()
2200 if (and_or_code == BIT_AND_EXPR) in normalize_one_pred()
2223 normalize_one_pred_1 (0, &norm_chain, a_pred, BIT_AND_EXPR, &work_list, in normalize_one_pred_chain()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtsan.cc355 FETCH_OP (ATOMIC_AND_FETCH_1, TSAN_ATOMIC8_FETCH_AND, BIT_AND_EXPR),
356 FETCH_OP (ATOMIC_AND_FETCH_2, TSAN_ATOMIC16_FETCH_AND, BIT_AND_EXPR),
357 FETCH_OP (ATOMIC_AND_FETCH_4, TSAN_ATOMIC32_FETCH_AND, BIT_AND_EXPR),
358 FETCH_OP (ATOMIC_AND_FETCH_8, TSAN_ATOMIC64_FETCH_AND, BIT_AND_EXPR),
359 FETCH_OP (ATOMIC_AND_FETCH_16, TSAN_ATOMIC128_FETCH_AND, BIT_AND_EXPR),
425 FETCH_OPS (SYNC_AND_AND_FETCH_1, TSAN_ATOMIC8_FETCH_AND, BIT_AND_EXPR),
426 FETCH_OPS (SYNC_AND_AND_FETCH_2, TSAN_ATOMIC16_FETCH_AND, BIT_AND_EXPR),
427 FETCH_OPS (SYNC_AND_AND_FETCH_4, TSAN_ATOMIC32_FETCH_AND, BIT_AND_EXPR),
428 FETCH_OPS (SYNC_AND_AND_FETCH_8, TSAN_ATOMIC64_FETCH_AND, BIT_AND_EXPR),
429 FETCH_OPS (SYNC_AND_AND_FETCH_16, TSAN_ATOMIC128_FETCH_AND, BIT_AND_EXPR),
[all …]
H A Dtree-ssa-ifcombine.cc226 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
265 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
279 if (gimple_assign_rhs_code (stmt) == BIT_AND_EXPR in recognize_single_bit_test()
328 || gimple_assign_rhs_code (stmt) != BIT_AND_EXPR) in recognize_bits_test()
431 t2 = fold_build2 (BIT_AND_EXPR, TREE_TYPE (name1), name1, t); in ifcombine_ifandif()
517 t = fold_build2 (BIT_AND_EXPR, TREE_TYPE (name1), name1, t); in ifcombine_ifandif()
H A Dccmp.cc106 if (tcode != BIT_AND_EXPR && tcode != BIT_IOR_EXPR) in ccmp_candidate_p()
199 gcc_assert (code == BIT_AND_EXPR || code == BIT_IOR_EXPR); in expand_ccmp_expr_1()
268 gcc_assert (gimple_assign_rhs_code (gs0) == BIT_AND_EXPR in expand_ccmp_expr_1()
H A DChangeLog.ptr51 BIT_AND_EXPR for pointer types.
58 Don't create BIT_AND_EXPR in a pointer type.
92 BIT_AND_EXPR in sizetype.
105 Don't use BIT_AND_EXPR on a pointer type, convert the
196 BIT_AND_EXPR on sizetype arguments.
212 perform BIT_AND_EXPR on sizetype arguments.
342 the creating of POINTER_PLUS_EXPR. For the BIT_AND_EXPR, cast
343 the operands to sizetype first and then cast the BIT_AND_EXPR
H A Dtree-vect-generic.cc274 b_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, b, low_bits); in do_plus_minus()
276 a_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, a, low_bits); in do_plus_minus()
283 signs = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, signs, high_bits); in do_plus_minus()
306 b_low = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, b, low_bits); in do_negate()
308 signs = gimplify_build2 (gsi, BIT_AND_EXPR, word_type, signs, high_bits); in do_negate()
851 op = optab_for_tree_code (BIT_AND_EXPR, type, optab_default); in expand_vector_divmod()
857 return gimplify_build2 (gsi, BIT_AND_EXPR, type, op0, mask); in expand_vector_divmod()
870 cur_op = gimplify_build2 (gsi, BIT_AND_EXPR, type, in expand_vector_divmod()
1115 a1 = gimplify_build2 (gsi, BIT_AND_EXPR, type, a, b); in expand_vector_condition()
1117 a2 = gimplify_build2 (gsi, BIT_AND_EXPR, type, a2, c); in expand_vector_condition()
[all …]
H A Dtree-ssa-reassoc.cc799 case BIT_AND_EXPR: in eliminate_duplicate_pair()
951 if ((opcode != BIT_IOR_EXPR && opcode != BIT_AND_EXPR) in eliminate_not_pairs()
974 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
979 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
985 if (opcode == BIT_AND_EXPR) in eliminate_not_pairs()
1019 case BIT_AND_EXPR: in eliminate_using_constants()
1931 && opcode != BIT_AND_EXPR) in undistribute_bitref_for_vector()
2150 gcc_assert (opcode == BIT_AND_EXPR); in undistribute_bitref_for_vector()
2219 if (opcode != BIT_IOR_EXPR && opcode != BIT_AND_EXPR) in eliminate_redundant_comparison()
3077 exp = fold_build2 (BIT_AND_EXPR, type, exp, tem); in optimize_range_tests_xor()
[all …]
H A Dgimple-predicate-analysis.cc857 if (cmpc != BIT_AND_EXPR) in value_sat_pred_p()
901 code1 == BIT_AND_EXPR); in subset_of()
1502 if (gimple_assign_rhs_code (def_stmt) != BIT_AND_EXPR) in simplify_4()
1973 if (and_or_code == BIT_AND_EXPR) in normalize()
2023 if (and_or_code != BIT_IOR_EXPR && and_or_code != BIT_AND_EXPR) in normalize()
2047 if (and_or_code == BIT_AND_EXPR) in normalize()
2074 pred.normalize (&norm_chain, pi, BIT_AND_EXPR, &work_list, &mark_set); in normalize()
H A Dfold-const.cc1003 case BIT_AND_EXPR: in wide_int_binop()
4394 case BIT_AND_EXPR: in fold_truth_not_expr()
4637 t1 = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, t1, mask); in optimize_bit_field_compare()
4640 t2 = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, t2, mask); in optimize_bit_field_compare()
4689 rhs = const_binop (BIT_AND_EXPR, in optimize_bit_field_compare()
4696 build2 (BIT_AND_EXPR, unsigned_type, lhs, mask), rhs); in optimize_bit_field_compare()
4752 if (TREE_CODE (exp) == BIT_AND_EXPR) in decode_field_reference()
4798 mask = fold_build2_loc (loc, BIT_AND_EXPR, unsigned_type, in decode_field_reference()
5482 if (TREE_CODE (exp) == BIT_AND_EXPR in build_range_check()
5485 fold_build2_loc (loc, BIT_AND_EXPR, etype, in build_range_check()
[all …]
H A Dgimple-isel.cc155 tree tem0 = gimple_build (&stmts, loc, BIT_AND_EXPR, type, op1, op0); in gimple_expand_vec_cond_expr()
157 tree tem2 = gimple_build (&stmts, loc, BIT_AND_EXPR, type, op2, tem1); in gimple_expand_vec_cond_expr()
H A Dtree-ssa-threadedge.cc510 else if (gimple_assign_rhs_code (def_stmt) == BIT_AND_EXPR in simplify_control_stmt_condition_1()
524 else if (rhs_code == BIT_AND_EXPR && integer_zerop (res1)) in simplify_control_stmt_condition_1()
550 else if (rhs_code == BIT_AND_EXPR && integer_zerop (res2)) in simplify_control_stmt_condition_1()
571 if (rhs_code == BIT_AND_EXPR in simplify_control_stmt_condition_1()
H A Dgimple-range-gori.cc121 case BIT_AND_EXPR: in is_gimple_logical_p()
810 case BIT_AND_EXPR: in logical_combine()
891 case BIT_AND_EXPR: in logical_combine()
989 if ((code == BIT_AND_EXPR || code == TRUTH_AND_EXPR) && lhs == m_bool_one) in compute_logical_operands()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/brig/brigfrontend/
H A Dbrig-basic-inst-handler.cc192 tree cleared = build2 (BIT_AND_EXPR, vec_type, perm, and_mask_vec); in build_unpack()
233 tree t = build2 (BIT_AND_EXPR, TREE_TYPE (pos), operands[2], in build_pack()
257 = build2 (BIT_AND_EXPR, wide_type, src_vect, clearing_mask); in build_pack()
264 build2 (BIT_AND_EXPR, wide_type, scalar, mask), bitoffset); in build_pack()
342 operands[1] = build2 (BIT_AND_EXPR, arith_type, operands[1], mask); in build_inst_expr()
H A Dbrig-cmp-inst-handler.cc71 expr = build2 (BIT_AND_EXPR, TREE_TYPE (expr), in operator ()()
/netbsd-src/external/gpl3/gcc/dist/gcc/cp/
H A Doperators.def103 DEF_OPERATOR ("&", BIT_AND_EXPR, "an", OVL_OP_FLAG_BINARY)
156 DEF_ASSN_OPERATOR ("&=", BIT_AND_EXPR, "aN")
/netbsd-src/external/gpl3/gcc.old/dist/gcc/cp/
H A Doperators.def103 DEF_OPERATOR ("&", BIT_AND_EXPR, "an", OVL_OP_FLAG_BINARY)
156 DEF_ASSN_OPERATOR ("&=", BIT_AND_EXPR, "aN")
/netbsd-src/external/gpl3/gcc.old/dist/gcc/c-family/
H A Dc-warn.c359 if ((TREE_CODE (lhs) == BIT_AND_EXPR in warn_tautological_bitwise_comparison()
363 else if ((TREE_CODE (rhs) == BIT_AND_EXPR in warn_tautological_bitwise_comparison()
393 if (TREE_CODE (bitop) == BIT_AND_EXPR) in warn_tautological_bitwise_comparison()
1305 case BIT_AND_EXPR: in conversion_warning()
2054 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR in warn_about_parentheses()
2058 else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR in warn_about_parentheses()
2078 if (code_left == BIT_AND_EXPR in warn_about_parentheses()
2082 else if (code_right == BIT_AND_EXPR in warn_about_parentheses()
2095 case BIT_AND_EXPR: in warn_about_parentheses()
/netbsd-src/external/gpl3/gcc/dist/gcc/c-family/
H A Dc-warn.cc361 if ((TREE_CODE (lhs) == BIT_AND_EXPR in warn_tautological_bitwise_comparison()
365 else if ((TREE_CODE (rhs) == BIT_AND_EXPR in warn_tautological_bitwise_comparison()
395 if (TREE_CODE (bitop) == BIT_AND_EXPR) in warn_tautological_bitwise_comparison()
1307 case BIT_AND_EXPR: in conversion_warning()
2056 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR in warn_about_parentheses()
2060 else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR in warn_about_parentheses()
2080 if (code_left == BIT_AND_EXPR in warn_about_parentheses()
2084 else if (code_right == BIT_AND_EXPR in warn_about_parentheses()
2097 case BIT_AND_EXPR: in warn_about_parentheses()

1234567891011