Searched refs:fold_binary (Results 1 - 9 of 9) sorted by relevance

/freebsd-10.1-release/contrib/gcc/
H A Dtree-ssa-loop-niter.c869 e = fold_binary (TRUTH_OR_EXPR, boolean_type_node, notcond, te);
874 e = fold_binary (TRUTH_AND_EXPR, boolean_type_node, cond, te);
1436 acnd = fold_binary (cmp, boolean_type_node, aval[0], aval[1]);
1970 cond = fold_binary (cmp, boolean_type_node, niter, bound);
H A Dtree-ssa-copy.c651 tree folded_cond = fold_binary (TREE_CODE (cond), boolean_type_node,
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);
1749 min = fold_binary (code, TREE_TYPE (expr), vr0.min, vr1.min);
1750 max = fold_binary (code, TREE_TYPE (expr), vr0.max, vr1.max);
H A Dtree-ssa-ccp.c925 return fold_binary (code, TREE_TYPE (rhs), op0, op1);
2061 tem = fold_binary (TREE_CODE (op0), TREE_TYPE (op0),
H A Dtree-ssa-reassoc.c760 tree folded = fold_binary (opcode, TREE_TYPE (oelm1->op),
H A Dfold-const.c8010 /* Subroutine of fold_binary. This routine performs all of the
8014 fold_binary should call fold_binary. Fold a comparison with
8470 /* Subroutine of fold_binary. Optimize complex multiplications of the
8512 fold_binary (enum tree_code code, tree type, tree op0, tree op1)
11446 /* An ASSERT_EXPR should never be passed to fold_binary. */
11844 tem = fold_binary (code, type, op0, op1);
12141 tem = fold_binary (code, type, op0, op1);
12947 tree tem = fold_binary (code, type, op0, op1);
8477 fold_binary (enum tree_code code, tree type, tree op0, tree op1) function
H A Dtree-data-ref.c931 tree sign = fold_binary (GT_EXPR, boolean_type_node, i_plus_s, init);
H A Dtree.h4323 extern tree fold_binary (enum tree_code, tree, tree, tree);
/freebsd-10.1-release/contrib/binutils/ld/
H A Dldexp.c279 fold_binary (etree_type *tree) function
716 fold_binary (tree);

Completed in 411 milliseconds