Searched refs:boolean_type_node (Results 1 - 25 of 42) sorted by relevance

12

/freebsd-11.0-release/contrib/gcc/
H A Dtree-ssa-loop-niter.c189 assumption = fold_build2 (EQ_EXPR, boolean_type_node,
192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
235 assumption = fold_build2 (LE_EXPR, boolean_type_node,
240 noloop = fold_build2 (GT_EXPR, boolean_type_node,
254 assumption = fold_build2 (GE_EXPR, boolean_type_node,
259 noloop = fold_build2 (GT_EXPR, boolean_type_node,
266 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
270 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
311 assumption = fold_build2 (LE_EXPR, boolean_type_node,
332 assumption = fold_build2 (GE_EXPR, boolean_type_node,
[all...]
H A Dtree-ssa-loop-manip.c740 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
748 assum = fold_build2 (GE_EXPR, boolean_type_node,
752 assum = fold_build2 (LE_EXPR, boolean_type_node,
755 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond);
758 assum = fold_build2 (cmp, boolean_type_node, base, bound);
759 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond);
948 exit_if = build_if_stmt (build2 (exit_cmp, boolean_type_node, ctr_after,
H A Dtree-ssa-forwprop.c251 new_cond = build2 (cond_code, boolean_type_node, op0, t);
293 boolean_type_node, op0, op1);
341 new_cond = build2 (new_code, boolean_type_node, def_rhs,
394 new_cond = build2 (new_code, boolean_type_node, new_arg,
H A Dtree-ssa-phiopt.c756 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node,
781 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node,
815 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node,
840 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node,
H A Dtree-if-conv.c600 cond = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
645 tmp = build2 (TRUTH_AND_EXPR, boolean_type_node,
647 tmp_stmt = ifc_temp_var (boolean_type_node, tmp);
740 *cond = build2 (TRUTH_AND_EXPR, boolean_type_node,
759 *cond = build2 (TRUTH_AND_EXPR, boolean_type_node,
H A Dtree-mudflap.c603 t = build2 (GT_EXPR, boolean_type_node, t, mf_base);
619 u = build2 (LT_EXPR, boolean_type_node, u, v);
624 t = build2 (TRUTH_OR_EXPR, boolean_type_node, t, u);
625 cond = create_tmp_var (boolean_type_node, "__mf_unlikely_cond");
626 t = build2 (MODIFY_EXPR, boolean_type_node, cond, t);
H A Dvalue-prof.c199 build2 (NE_EXPR, boolean_type_node, tmp1, tmpv),
365 build2 (NE_EXPR, boolean_type_node,
526 build2 (LT_EXPR, boolean_type_node, result, tmp1),
541 build2 (LT_EXPR, boolean_type_node, result, tmp1),
H A Dtree-ssa-loop-ivcanon.c108 COND_EXPR_COND (cond) = build2 (cmp, boolean_type_node,
H A Dtree-vectorizer.c793 cond = build2 (GE_EXPR, boolean_type_node, indx_after_incr, niters);
799 cond = build2 (LT_EXPR, boolean_type_node, indx_after_incr, niters);
1165 fold_build2 (LE_EXPR, boolean_type_node, first_niters,
1205 fold_build2 (EQ_EXPR, boolean_type_node, first_niters, niters);
H A Domp-low.c1824 x = build2 (NE_EXPR, boolean_type_node, x,
2697 t = build2 (fd->cond_code, boolean_type_node, fd->v, iend);
2857 t = build2 (GE_EXPR, boolean_type_node, s0, e0);
2891 t = build2 (fd->cond_code, boolean_type_node, fd->v, e);
3043 t = build2 (LT_EXPR, boolean_type_node, s0, n);
3076 t = build2 (fd->cond_code, boolean_type_node, fd->v, e);
3752 t = build2 (EQ_EXPR, boolean_type_node, ctx->receiver_decl,
3845 x = build2 (EQ_EXPR, boolean_type_node, x, integer_zero_node);
4023 cond = build2 (cond_code, boolean_type_node, fd->v, fd->n2);
H A Dtree-complex.c1051 cond = fold_build2 (LT_EXPR, boolean_type_node, t1, t2);
1297 cr = gimplify_build2 (bsi, code, boolean_type_node, ar, br);
1298 ci = gimplify_build2 (bsi, code, boolean_type_node, ai, bi);
1301 boolean_type_node, cr, ci);
H A Dtree-vrp.c851 t = fold_binary (LT_EXPR, boolean_type_node, val1, val2);
856 t = fold_binary (GT_EXPR, boolean_type_node, val1, val2);
861 t = fold_binary (NE_EXPR, boolean_type_node, val1, val2);
914 cmp1 = fold_binary_to_constant (GE_EXPR, boolean_type_node, val, vr->min);
921 cmp2 = fold_binary_to_constant (LE_EXPR, boolean_type_node, val, vr->max);
3730 cond = build2 (loc->comp_code, boolean_type_node, name, loc->val);
5137 = build2 (EQ_EXPR, boolean_type_node, op0, new);
5165 = build2 (NE_EXPR, boolean_type_node, op0, new);
5280 dummy = build2 (EQ_EXPR, boolean_type_node, NULL, NULL);
H A Dtree-ssa-copy.c651 tree folded_cond = fold_binary (TREE_CODE (cond), boolean_type_node,
H A Dtree.c6560 boolean_type_node before calling build_common_tree_nodes_2. */
6561 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6562 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6563 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6564 TYPE_PRECISION (boolean_type_node) = 1;
6602 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6603 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
H A Dlambda-code.c1918 boolean_type_node,
2506 build2 (NE_EXPR, boolean_type_node,
2556 boolean_type_node,
H A Dtree-ssa-dom.c566 tree dummy_cond = build2 (NE_EXPR, boolean_type_node,
927 *p = build2 (new_code, boolean_type_node, op0, op1);
H A Dgimplify.c2398 TREE_TYPE (expr) = boolean_type_node;
2404 return fold_convert (boolean_type_node, expr);
2791 build2 (EQ_EXPR, boolean_type_node,
4214 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5277 build2 (NE_EXPR, boolean_type_node, oldival, oldival2),
H A Dc-pretty-print.c998 if (type == boolean_type_node)
/freebsd-11.0-release/contrib/gcc/cp/
H A Drtti.c308 cond = cp_convert (boolean_type_node, TREE_OPERAND (exp, 0));
451 build2 (EQ_EXPR, boolean_type_node, test,
1386 &boolean_type_node,
H A Dtypeck.c3325 result_type = boolean_type_node;
3408 build_type = boolean_type_node;
3487 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3524 build_type = boolean_type_node;
3736 return cp_convert (boolean_type_node, val);
4083 t = perform_implicit_conversion (boolean_type_node, expr);
4084 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4204 arg = perform_implicit_conversion (boolean_type_node, arg);
4370 if (same_type_p (declared_type, boolean_type_node))
5778 boolean_type_node,
[all...]
H A Dinit.c800 build2 (EQ_EXPR, boolean_type_node,
2255 build2 (EQ_EXPR, boolean_type_node, tbase,
2317 fold_build2 (NE_EXPR, boolean_type_node, base,
2573 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
H A Dcall.c1587 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2092 (candidates, fnname, boolean_type_node,
2099 (candidates, fnname, boolean_type_node,
2100 boolean_type_node, args, argtypes, flags);
3230 arg1 = perform_implicit_conversion (boolean_type_node, arg1);
5295 build2 (EQ_EXPR, boolean_type_node,
H A Dcp-gimplify.c885 t = build2 (NE_EXPR, boolean_type_node, p1, end1);
H A Dcvt.c1232 if (type == boolean_type_node)
H A Dmethod.c501 cond = cp_convert (boolean_type_node, t);

Completed in 315 milliseconds

12