OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

gimplify.c (gimplify_minimax_expr): Remove.

Browse Source 
2004-08-19  Paolo Bonzini  <bonzini@gnu.org>

	* gimplify.c (gimplify_minimax_expr): Remove.
	(gimplify_expr) <MIN_EXPR, MAX_EXPR>: Remove special handling.

From-SVN: r86245
This commit is contained in:
Paolo Bonzini 2004-08-19 09:58:57 +00:00 committed by Paolo Bonzini
parent 476a918f8c
commit c2504783d9
2 changed files with 5 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2004-08-19 Paolo Bonzini <bonzini@gnu.org>
* gimplify.c (gimplify_minimax_expr): Remove.
(gimplify_expr) <MIN_EXPR, MAX_EXPR>: Remove special handling.
2004-08-19 Dorit Naishlos <dorit@il.ibm.com> 2004-08-19 Dorit Naishlos <dorit@il.ibm.com>
* tree-vectorizer.c (vect_can_force_dr_alignment_p): Replace * tree-vectorizer.c (vect_can_force_dr_alignment_p): Replace

33
gcc/gimplify.c
View File

@ -1426,34 +1426,6 @@ gimplify_conversion (tree *expr_p)
return GS_OK; return GS_OK;
} }
/* Reduce MIN/MAX_EXPR to a COND_EXPR for further gimplification. */
static enum gimplify_status
gimplify_minimax_expr (tree *expr_p, tree *pre_p, tree *post_p)
{
tree op1 = TREE_OPERAND (*expr_p, 0);
tree op2 = TREE_OPERAND (*expr_p, 1);
enum tree_code code;
enum gimplify_status r0, r1;
if (TREE_CODE (*expr_p) == MIN_EXPR)
code = LE_EXPR;
else
code = GE_EXPR;
r0 = gimplify_expr (&op1, pre_p, post_p, is_gimple_val, fb_rvalue);
r1 = gimplify_expr (&op2, pre_p, post_p, is_gimple_val, fb_rvalue);
*expr_p = build (COND_EXPR, TREE_TYPE (*expr_p),
build (code, boolean_type_node, op1, op2),
op1, op2);
if (r0 == GS_ERROR || r1 == GS_ERROR)
return GS_ERROR;
else
return GS_OK;
}
/* Subroutine of gimplify_compound_lval. /* Subroutine of gimplify_compound_lval.
Converts an ARRAY_REF to the equivalent *(&array + offset) form. */ Converts an ARRAY_REF to the equivalent *(&array + offset) form. */
@ -3885,11 +3857,6 @@ gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
} }
break; break;
case MIN_EXPR:
case MAX_EXPR:
ret = gimplify_minimax_expr (expr_p, pre_p, post_p);
break;
case LABEL_DECL: case LABEL_DECL:
/* We get here when taking the address of a label. We mark /* We get here when taking the address of a label. We mark
the label as "forced"; meaning it can never be removed and the label as "forced"; meaning it can never be removed and