991     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()
6081     temp = const_binop (BIT_AND_EXPR, temp,  in unextend()
6226   if (lcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (lhs, 1)))  in fold_truth_andor_1()
6233   if (rcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (rhs, 1)))  in fold_truth_andor_1()
6420       if (! integer_zerop (const_binop (BIT_AND_EXPR, l_const,  in fold_truth_andor_1()
6434       if (! integer_zerop (const_binop (BIT_AND_EXPR, r_const,  in fold_truth_andor_1()
6498 	    lhs = build2 (BIT_AND_EXPR, lntype, lhs, ll_mask);  in fold_truth_andor_1()
6504 	    rhs = build2 (BIT_AND_EXPR, rntype, rhs, lr_mask);  in fold_truth_andor_1()
6560 	    lhs = build2 (BIT_AND_EXPR, type, lhs, ll_mask);  in fold_truth_andor_1()
6563 	    rhs = build2 (BIT_AND_EXPR, type, rhs, lr_mask);  in fold_truth_andor_1()
6575   result = const_binop (BIT_AND_EXPR, ll_mask, rl_mask);  in fold_truth_andor_1()
6577       && simple_cst_equal (const_binop (BIT_AND_EXPR, result, l_const),  in fold_truth_andor_1()
6578 			   const_binop (BIT_AND_EXPR, result, r_const)) != 1)  in fold_truth_andor_1()
6605     result = build2_loc (loc, BIT_AND_EXPR, lntype, result, ll_mask);  in fold_truth_andor_1()
7276       && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)  in fold_single_bit_test_into_sign_test()
7310       && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)  in fold_single_bit_test()
7365       inner = build2 (BIT_AND_EXPR, intermediate_type, inner, one);  in fold_single_bit_test()
8841 	  && TREE_CODE (op0) == BIT_AND_EXPR  in fold_unary_loc()
8877 	      return fold_build2_loc (loc, BIT_AND_EXPR, type,  in fold_unary_loc()
10292   if ((code == BIT_AND_EXPR || code == BIT_IOR_EXPR  in fold_binary_loc()
10297 	       || (TREE_CODE (arg1) == BIT_AND_EXPR  in fold_binary_loc()
10301 		  || (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
10304       tem = fold_build2_loc (loc, code == BIT_AND_EXPR ? TRUTH_AND_EXPR  in fold_binary_loc()
10597 		&& (code01 == MINUS_EXPR || code01 == BIT_AND_EXPR))  in fold_binary_loc()
10635 		     && code11 == BIT_AND_EXPR  in fold_binary_loc()
11034       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11078 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, type, tem,  in fold_binary_loc()
11090       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11101     case BIT_AND_EXPR:  in fold_binary_loc()
11111 	  tem2 = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (tem),  in fold_binary_loc()
11124 	  tem2 = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (tem),  in fold_binary_loc()
11337 	  && (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11544       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11554 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg0), tem,  in fold_binary_loc()
11565 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg0), tem,  in fold_binary_loc()
11576       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11598 		  tem = fold_build2_loc (loc, BIT_AND_EXPR, itype, arg000, tem);  in fold_binary_loc()
11681       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11686 	  tem = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg0),  in fold_binary_loc()
11698 	  && TREE_CODE (TREE_OPERAND (arg0, 0)) == BIT_AND_EXPR  in fold_binary_loc()
11711       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11719 	  tem = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg000),  in fold_binary_loc()
11733       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_binary_loc()
11734 	  && TREE_CODE (arg1) == BIT_AND_EXPR)  in fold_binary_loc()
11746 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, itype, tem, arg01);  in fold_binary_loc()
11754 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, itype, tem, arg01);  in fold_binary_loc()
11762 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, itype, tem, arg00);  in fold_binary_loc()
11770 	      tem = fold_build2_loc (loc, BIT_AND_EXPR, itype, tem, arg00);  in fold_binary_loc()
12118       case BIT_AND_EXPR:  in fold_bit_and_mask()
12123 	if (codes[which] == BIT_AND_EXPR)  in fold_bit_and_mask()
12465 				fold_build2_loc (loc, BIT_AND_EXPR,  in fold_ternary_loc()
12474       if (TREE_CODE (arg0) == BIT_AND_EXPR  in fold_ternary_loc()
12485 	    return fold_build2_loc (loc, BIT_AND_EXPR, type,  in fold_ternary_loc()
12499 	  && TREE_CODE (TREE_OPERAND (arg0, 0)) == BIT_AND_EXPR  in fold_ternary_loc()
12523 	return fold_build2_loc (loc, code == VEC_COND_EXPR ? BIT_AND_EXPR  in fold_ternary_loc()
12555 					 ? BIT_AND_EXPR : TRUTH_ANDIF_EXPR,  in fold_ternary_loc()
13520     case BIT_AND_EXPR:  in multiple_of_p()
13633 	  if (code == BIT_AND_EXPR  in multiple_of_p()
13840     case BIT_AND_EXPR:  in tree_binary_nonnegative_warnv_p()
15340 	  value = size_binop_loc (loc, BIT_AND_EXPR, value, t);  in round_up_loc()
15383       value = size_binop_loc (loc, BIT_AND_EXPR, value, t);  in round_down_loc()
15614     case BIT_AND_EXPR:  in tree_nonzero_bits()