Searched refs:fold_binary (Results 1 - 9 of 9) sorted by relevance
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-ssa-loop-niter.c | 869 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 D | tree-ssa-copy.c | 651 tree folded_cond = fold_binary (TREE_CODE (cond), boolean_type_node,
|
H A D | tree-vrp.c | 851 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 D | tree-ssa-ccp.c | 925 return fold_binary (code, TREE_TYPE (rhs), op0, op1); 2061 tem = fold_binary (TREE_CODE (op0), TREE_TYPE (op0),
|
H A D | tree-ssa-reassoc.c | 760 tree folded = fold_binary (opcode, TREE_TYPE (oelm1->op),
|
H A D | fold-const.c | 8008 /* Subroutine of fold_binary. This routine performs all of the 8012 fold_binary should call fold_binary. Fold a comparison with 8468 /* Subroutine of fold_binary. Optimize complex multiplications of the 8510 fold_binary (enum tree_code code, tree type, tree op0, tree op1) 11444 /* An ASSERT_EXPR should never be passed to fold_binary. */ 11842 tem = fold_binary (code, type, op0, op1); 12139 tem = fold_binary (code, type, op0, op1); 12943 tree tem = fold_binary (code, type, op0, op1); 8475 fold_binary (enum tree_code code, tree type, tree op0, tree op1) function
|
H A D | tree-data-ref.c | 931 tree sign = fold_binary (GT_EXPR, boolean_type_node, i_plus_s, init);
|
H A D | tree.h | 4258 extern tree fold_binary (enum tree_code, tree, tree, tree);
|
/freebsd-9.3-release/contrib/binutils/ld/ |
H A D | ldexp.c | 279 fold_binary (etree_type *tree) function 716 fold_binary (tree);
|
Completed in 382 milliseconds