/* Convert tree expression to rtl instructions, for GNU compiler.
|
/* Convert tree expression to rtl instructions, for GNU compiler.
|
Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
GCC is free software; you can redistribute it and/or modify it under
|
the terms of the GNU General Public License as published by the Free
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "tree.h"
|
#include "tree.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "function.h"
|
#include "function.h"
|
#include "insn-config.h"
|
#include "insn-config.h"
|
#include "insn-attr.h"
|
#include "insn-attr.h"
|
/* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
|
/* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
|
#include "expr.h"
|
#include "expr.h"
|
#include "optabs.h"
|
#include "optabs.h"
|
#include "langhooks.h"
|
#include "langhooks.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
#include "tm_p.h"
|
#include "tm_p.h"
|
|
|
static bool prefer_and_bit_test (enum machine_mode, int);
|
static bool prefer_and_bit_test (enum machine_mode, int);
|
static void do_jump_by_parts_greater (tree, int, rtx, rtx);
|
static void do_jump_by_parts_greater (tree, int, rtx, rtx);
|
static void do_jump_by_parts_equality (tree, rtx, rtx);
|
static void do_jump_by_parts_equality (tree, rtx, rtx);
|
static void do_compare_and_jump (tree, enum rtx_code, enum rtx_code, rtx,
|
static void do_compare_and_jump (tree, enum rtx_code, enum rtx_code, rtx,
|
rtx);
|
rtx);
|
|
|
/* At the start of a function, record that we have no previously-pushed
|
/* At the start of a function, record that we have no previously-pushed
|
arguments waiting to be popped. */
|
arguments waiting to be popped. */
|
|
|
void
|
void
|
init_pending_stack_adjust (void)
|
init_pending_stack_adjust (void)
|
{
|
{
|
pending_stack_adjust = 0;
|
pending_stack_adjust = 0;
|
}
|
}
|
|
|
/* Discard any pending stack adjustment. This avoid relying on the
|
/* Discard any pending stack adjustment. This avoid relying on the
|
RTL optimizers to remove useless adjustments when we know the
|
RTL optimizers to remove useless adjustments when we know the
|
stack pointer value is dead. */
|
stack pointer value is dead. */
|
void
|
void
|
discard_pending_stack_adjust (void)
|
discard_pending_stack_adjust (void)
|
{
|
{
|
stack_pointer_delta -= pending_stack_adjust;
|
stack_pointer_delta -= pending_stack_adjust;
|
pending_stack_adjust = 0;
|
pending_stack_adjust = 0;
|
}
|
}
|
|
|
/* When exiting from function, if safe, clear out any pending stack adjust
|
/* When exiting from function, if safe, clear out any pending stack adjust
|
so the adjustment won't get done.
|
so the adjustment won't get done.
|
|
|
Note, if the current function calls alloca, then it must have a
|
Note, if the current function calls alloca, then it must have a
|
frame pointer regardless of the value of flag_omit_frame_pointer. */
|
frame pointer regardless of the value of flag_omit_frame_pointer. */
|
|
|
void
|
void
|
clear_pending_stack_adjust (void)
|
clear_pending_stack_adjust (void)
|
{
|
{
|
if (optimize > 0
|
if (optimize > 0
|
&& (! flag_omit_frame_pointer || current_function_calls_alloca)
|
&& (! flag_omit_frame_pointer || current_function_calls_alloca)
|
&& EXIT_IGNORE_STACK
|
&& EXIT_IGNORE_STACK
|
&& ! (DECL_INLINE (current_function_decl) && ! flag_no_inline))
|
&& ! (DECL_INLINE (current_function_decl) && ! flag_no_inline))
|
discard_pending_stack_adjust ();
|
discard_pending_stack_adjust ();
|
}
|
}
|
|
|
/* Pop any previously-pushed arguments that have not been popped yet. */
|
/* Pop any previously-pushed arguments that have not been popped yet. */
|
|
|
void
|
void
|
do_pending_stack_adjust (void)
|
do_pending_stack_adjust (void)
|
{
|
{
|
if (inhibit_defer_pop == 0)
|
if (inhibit_defer_pop == 0)
|
{
|
{
|
if (pending_stack_adjust != 0)
|
if (pending_stack_adjust != 0)
|
adjust_stack (GEN_INT (pending_stack_adjust));
|
adjust_stack (GEN_INT (pending_stack_adjust));
|
pending_stack_adjust = 0;
|
pending_stack_adjust = 0;
|
}
|
}
|
}
|
}
|
|
|
/* Expand conditional expressions. */
|
/* Expand conditional expressions. */
|
|
|
/* Generate code to evaluate EXP and jump to LABEL if the value is zero.
|
/* Generate code to evaluate EXP and jump to LABEL if the value is zero.
|
LABEL is an rtx of code CODE_LABEL, in this function and all the
|
LABEL is an rtx of code CODE_LABEL, in this function and all the
|
functions here. */
|
functions here. */
|
|
|
void
|
void
|
jumpifnot (tree exp, rtx label)
|
jumpifnot (tree exp, rtx label)
|
{
|
{
|
do_jump (exp, label, NULL_RTX);
|
do_jump (exp, label, NULL_RTX);
|
}
|
}
|
|
|
/* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
|
/* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
|
|
|
void
|
void
|
jumpif (tree exp, rtx label)
|
jumpif (tree exp, rtx label)
|
{
|
{
|
do_jump (exp, NULL_RTX, label);
|
do_jump (exp, NULL_RTX, label);
|
}
|
}
|
|
|
/* Used internally by prefer_and_bit_test. */
|
/* Used internally by prefer_and_bit_test. */
|
|
|
static GTY(()) rtx and_reg;
|
static GTY(()) rtx and_reg;
|
static GTY(()) rtx and_test;
|
static GTY(()) rtx and_test;
|
static GTY(()) rtx shift_test;
|
static GTY(()) rtx shift_test;
|
|
|
/* Compare the relative costs of "(X & (1 << BITNUM))" and "(X >> BITNUM) & 1",
|
/* Compare the relative costs of "(X & (1 << BITNUM))" and "(X >> BITNUM) & 1",
|
where X is an arbitrary register of mode MODE. Return true if the former
|
where X is an arbitrary register of mode MODE. Return true if the former
|
is preferred. */
|
is preferred. */
|
|
|
static bool
|
static bool
|
prefer_and_bit_test (enum machine_mode mode, int bitnum)
|
prefer_and_bit_test (enum machine_mode mode, int bitnum)
|
{
|
{
|
if (and_test == 0)
|
if (and_test == 0)
|
{
|
{
|
/* Set up rtxes for the two variations. Use NULL as a placeholder
|
/* Set up rtxes for the two variations. Use NULL as a placeholder
|
for the BITNUM-based constants. */
|
for the BITNUM-based constants. */
|
and_reg = gen_rtx_REG (mode, FIRST_PSEUDO_REGISTER);
|
and_reg = gen_rtx_REG (mode, FIRST_PSEUDO_REGISTER);
|
and_test = gen_rtx_AND (mode, and_reg, NULL);
|
and_test = gen_rtx_AND (mode, and_reg, NULL);
|
shift_test = gen_rtx_AND (mode, gen_rtx_ASHIFTRT (mode, and_reg, NULL),
|
shift_test = gen_rtx_AND (mode, gen_rtx_ASHIFTRT (mode, and_reg, NULL),
|
const1_rtx);
|
const1_rtx);
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Change the mode of the previously-created rtxes. */
|
/* Change the mode of the previously-created rtxes. */
|
PUT_MODE (and_reg, mode);
|
PUT_MODE (and_reg, mode);
|
PUT_MODE (and_test, mode);
|
PUT_MODE (and_test, mode);
|
PUT_MODE (shift_test, mode);
|
PUT_MODE (shift_test, mode);
|
PUT_MODE (XEXP (shift_test, 0), mode);
|
PUT_MODE (XEXP (shift_test, 0), mode);
|
}
|
}
|
|
|
/* Fill in the integers. */
|
/* Fill in the integers. */
|
XEXP (and_test, 1) = GEN_INT ((unsigned HOST_WIDE_INT) 1 << bitnum);
|
XEXP (and_test, 1) = GEN_INT ((unsigned HOST_WIDE_INT) 1 << bitnum);
|
XEXP (XEXP (shift_test, 0), 1) = GEN_INT (bitnum);
|
XEXP (XEXP (shift_test, 0), 1) = GEN_INT (bitnum);
|
|
|
return (rtx_cost (and_test, IF_THEN_ELSE)
|
return (rtx_cost (and_test, IF_THEN_ELSE)
|
<= rtx_cost (shift_test, IF_THEN_ELSE));
|
<= rtx_cost (shift_test, IF_THEN_ELSE));
|
}
|
}
|
|
|
/* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
|
/* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
|
the result is zero, or IF_TRUE_LABEL if the result is one.
|
the result is zero, or IF_TRUE_LABEL if the result is one.
|
Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
|
Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
|
meaning fall through in that case.
|
meaning fall through in that case.
|
|
|
do_jump always does any pending stack adjust except when it does not
|
do_jump always does any pending stack adjust except when it does not
|
actually perform a jump. An example where there is no jump
|
actually perform a jump. An example where there is no jump
|
is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null. */
|
is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null. */
|
|
|
void
|
void
|
do_jump (tree exp, rtx if_false_label, rtx if_true_label)
|
do_jump (tree exp, rtx if_false_label, rtx if_true_label)
|
{
|
{
|
enum tree_code code = TREE_CODE (exp);
|
enum tree_code code = TREE_CODE (exp);
|
rtx temp;
|
rtx temp;
|
int i;
|
int i;
|
tree type;
|
tree type;
|
enum machine_mode mode;
|
enum machine_mode mode;
|
rtx drop_through_label = 0;
|
rtx drop_through_label = 0;
|
|
|
switch (code)
|
switch (code)
|
{
|
{
|
case ERROR_MARK:
|
case ERROR_MARK:
|
break;
|
break;
|
|
|
case INTEGER_CST:
|
case INTEGER_CST:
|
temp = integer_zerop (exp) ? if_false_label : if_true_label;
|
temp = integer_zerop (exp) ? if_false_label : if_true_label;
|
if (temp)
|
if (temp)
|
emit_jump (temp);
|
emit_jump (temp);
|
break;
|
break;
|
|
|
#if 0
|
#if 0
|
/* This is not true with #pragma weak */
|
/* This is not true with #pragma weak */
|
case ADDR_EXPR:
|
case ADDR_EXPR:
|
/* The address of something can never be zero. */
|
/* The address of something can never be zero. */
|
if (if_true_label)
|
if (if_true_label)
|
emit_jump (if_true_label);
|
emit_jump (if_true_label);
|
break;
|
break;
|
#endif
|
#endif
|
|
|
case NOP_EXPR:
|
case NOP_EXPR:
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_RANGE_REF)
|
|| TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_RANGE_REF)
|
goto normal;
|
goto normal;
|
case CONVERT_EXPR:
|
case CONVERT_EXPR:
|
/* If we are narrowing the operand, we have to do the compare in the
|
/* If we are narrowing the operand, we have to do the compare in the
|
narrower mode. */
|
narrower mode. */
|
if ((TYPE_PRECISION (TREE_TYPE (exp))
|
if ((TYPE_PRECISION (TREE_TYPE (exp))
|
< TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
|
< TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
|
goto normal;
|
goto normal;
|
case NON_LVALUE_EXPR:
|
case NON_LVALUE_EXPR:
|
case ABS_EXPR:
|
case ABS_EXPR:
|
case NEGATE_EXPR:
|
case NEGATE_EXPR:
|
case LROTATE_EXPR:
|
case LROTATE_EXPR:
|
case RROTATE_EXPR:
|
case RROTATE_EXPR:
|
/* These cannot change zero->nonzero or vice versa. */
|
/* These cannot change zero->nonzero or vice versa. */
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case BIT_AND_EXPR:
|
case BIT_AND_EXPR:
|
/* fold_single_bit_test() converts (X & (1 << C)) into (X >> C) & 1.
|
/* fold_single_bit_test() converts (X & (1 << C)) into (X >> C) & 1.
|
See if the former is preferred for jump tests and restore it
|
See if the former is preferred for jump tests and restore it
|
if so. */
|
if so. */
|
if (integer_onep (TREE_OPERAND (exp, 1)))
|
if (integer_onep (TREE_OPERAND (exp, 1)))
|
{
|
{
|
tree exp0 = TREE_OPERAND (exp, 0);
|
tree exp0 = TREE_OPERAND (exp, 0);
|
rtx set_label, clr_label;
|
rtx set_label, clr_label;
|
|
|
/* Strip narrowing integral type conversions. */
|
/* Strip narrowing integral type conversions. */
|
while ((TREE_CODE (exp0) == NOP_EXPR
|
while ((TREE_CODE (exp0) == NOP_EXPR
|
|| TREE_CODE (exp0) == CONVERT_EXPR
|
|| TREE_CODE (exp0) == CONVERT_EXPR
|
|| TREE_CODE (exp0) == NON_LVALUE_EXPR)
|
|| TREE_CODE (exp0) == NON_LVALUE_EXPR)
|
&& TREE_OPERAND (exp0, 0) != error_mark_node
|
&& TREE_OPERAND (exp0, 0) != error_mark_node
|
&& TYPE_PRECISION (TREE_TYPE (exp0))
|
&& TYPE_PRECISION (TREE_TYPE (exp0))
|
<= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp0, 0))))
|
<= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp0, 0))))
|
exp0 = TREE_OPERAND (exp0, 0);
|
exp0 = TREE_OPERAND (exp0, 0);
|
|
|
/* "exp0 ^ 1" inverts the sense of the single bit test. */
|
/* "exp0 ^ 1" inverts the sense of the single bit test. */
|
if (TREE_CODE (exp0) == BIT_XOR_EXPR
|
if (TREE_CODE (exp0) == BIT_XOR_EXPR
|
&& integer_onep (TREE_OPERAND (exp0, 1)))
|
&& integer_onep (TREE_OPERAND (exp0, 1)))
|
{
|
{
|
exp0 = TREE_OPERAND (exp0, 0);
|
exp0 = TREE_OPERAND (exp0, 0);
|
clr_label = if_true_label;
|
clr_label = if_true_label;
|
set_label = if_false_label;
|
set_label = if_false_label;
|
}
|
}
|
else
|
else
|
{
|
{
|
clr_label = if_false_label;
|
clr_label = if_false_label;
|
set_label = if_true_label;
|
set_label = if_true_label;
|
}
|
}
|
|
|
if (TREE_CODE (exp0) == RSHIFT_EXPR)
|
if (TREE_CODE (exp0) == RSHIFT_EXPR)
|
{
|
{
|
tree arg = TREE_OPERAND (exp0, 0);
|
tree arg = TREE_OPERAND (exp0, 0);
|
tree shift = TREE_OPERAND (exp0, 1);
|
tree shift = TREE_OPERAND (exp0, 1);
|
tree argtype = TREE_TYPE (arg);
|
tree argtype = TREE_TYPE (arg);
|
if (TREE_CODE (shift) == INTEGER_CST
|
if (TREE_CODE (shift) == INTEGER_CST
|
&& compare_tree_int (shift, 0) >= 0
|
&& compare_tree_int (shift, 0) >= 0
|
&& compare_tree_int (shift, HOST_BITS_PER_WIDE_INT) < 0
|
&& compare_tree_int (shift, HOST_BITS_PER_WIDE_INT) < 0
|
&& prefer_and_bit_test (TYPE_MODE (argtype),
|
&& prefer_and_bit_test (TYPE_MODE (argtype),
|
TREE_INT_CST_LOW (shift)))
|
TREE_INT_CST_LOW (shift)))
|
{
|
{
|
HOST_WIDE_INT mask = (HOST_WIDE_INT) 1
|
HOST_WIDE_INT mask = (HOST_WIDE_INT) 1
|
<< TREE_INT_CST_LOW (shift);
|
<< TREE_INT_CST_LOW (shift);
|
do_jump (build2 (BIT_AND_EXPR, argtype, arg,
|
do_jump (build2 (BIT_AND_EXPR, argtype, arg,
|
build_int_cst_type (argtype, mask)),
|
build_int_cst_type (argtype, mask)),
|
clr_label, set_label);
|
clr_label, set_label);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* If we are AND'ing with a small constant, do this comparison in the
|
/* If we are AND'ing with a small constant, do this comparison in the
|
smallest type that fits. If the machine doesn't have comparisons
|
smallest type that fits. If the machine doesn't have comparisons
|
that small, it will be converted back to the wider comparison.
|
that small, it will be converted back to the wider comparison.
|
This helps if we are testing the sign bit of a narrower object.
|
This helps if we are testing the sign bit of a narrower object.
|
combine can't do this for us because it can't know whether a
|
combine can't do this for us because it can't know whether a
|
ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
|
ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
|
|
|
if (! SLOW_BYTE_ACCESS
|
if (! SLOW_BYTE_ACCESS
|
&& TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
|
&& TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
|
&& TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
|
&& TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
|
&& (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0
|
&& (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0
|
&& (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
|
&& (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
|
&& (type = lang_hooks.types.type_for_mode (mode, 1)) != 0
|
&& (type = lang_hooks.types.type_for_mode (mode, 1)) != 0
|
&& TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
|
&& TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
|
&& (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
|
&& (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
|
!= CODE_FOR_nothing))
|
!= CODE_FOR_nothing))
|
{
|
{
|
do_jump (fold_convert (type, exp), if_false_label, if_true_label);
|
do_jump (fold_convert (type, exp), if_false_label, if_true_label);
|
break;
|
break;
|
}
|
}
|
goto normal;
|
goto normal;
|
|
|
case TRUTH_NOT_EXPR:
|
case TRUTH_NOT_EXPR:
|
do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
|
do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
|
break;
|
break;
|
|
|
case COND_EXPR:
|
case COND_EXPR:
|
{
|
{
|
rtx label1 = gen_label_rtx ();
|
rtx label1 = gen_label_rtx ();
|
if (!if_true_label || !if_false_label)
|
if (!if_true_label || !if_false_label)
|
{
|
{
|
drop_through_label = gen_label_rtx ();
|
drop_through_label = gen_label_rtx ();
|
if (!if_true_label)
|
if (!if_true_label)
|
if_true_label = drop_through_label;
|
if_true_label = drop_through_label;
|
if (!if_false_label)
|
if (!if_false_label)
|
if_false_label = drop_through_label;
|
if_false_label = drop_through_label;
|
}
|
}
|
|
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
emit_label (label1);
|
emit_label (label1);
|
do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label);
|
break;
|
break;
|
}
|
}
|
|
|
case TRUTH_ANDIF_EXPR:
|
case TRUTH_ANDIF_EXPR:
|
case TRUTH_ORIF_EXPR:
|
case TRUTH_ORIF_EXPR:
|
case COMPOUND_EXPR:
|
case COMPOUND_EXPR:
|
/* Lowered by gimplify.c. */
|
/* Lowered by gimplify.c. */
|
gcc_unreachable ();
|
gcc_unreachable ();
|
|
|
case COMPONENT_REF:
|
case COMPONENT_REF:
|
case BIT_FIELD_REF:
|
case BIT_FIELD_REF:
|
case ARRAY_REF:
|
case ARRAY_REF:
|
case ARRAY_RANGE_REF:
|
case ARRAY_RANGE_REF:
|
{
|
{
|
HOST_WIDE_INT bitsize, bitpos;
|
HOST_WIDE_INT bitsize, bitpos;
|
int unsignedp;
|
int unsignedp;
|
enum machine_mode mode;
|
enum machine_mode mode;
|
tree type;
|
tree type;
|
tree offset;
|
tree offset;
|
int volatilep = 0;
|
int volatilep = 0;
|
|
|
/* Get description of this reference. We don't actually care
|
/* Get description of this reference. We don't actually care
|
about the underlying object here. */
|
about the underlying object here. */
|
get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
|
get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
|
&unsignedp, &volatilep, false);
|
&unsignedp, &volatilep, false);
|
|
|
type = lang_hooks.types.type_for_size (bitsize, unsignedp);
|
type = lang_hooks.types.type_for_size (bitsize, unsignedp);
|
if (! SLOW_BYTE_ACCESS
|
if (! SLOW_BYTE_ACCESS
|
&& type != 0 && bitsize >= 0
|
&& type != 0 && bitsize >= 0
|
&& TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
|
&& TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
|
&& (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
|
&& (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
|
!= CODE_FOR_nothing))
|
!= CODE_FOR_nothing))
|
{
|
{
|
do_jump (fold_convert (type, exp), if_false_label, if_true_label);
|
do_jump (fold_convert (type, exp), if_false_label, if_true_label);
|
break;
|
break;
|
}
|
}
|
goto normal;
|
goto normal;
|
}
|
}
|
|
|
case EQ_EXPR:
|
case EQ_EXPR:
|
{
|
{
|
tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
|
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
!= MODE_COMPLEX_FLOAT);
|
!= MODE_COMPLEX_FLOAT);
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
!= MODE_COMPLEX_INT);
|
!= MODE_COMPLEX_INT);
|
|
|
if (integer_zerop (TREE_OPERAND (exp, 1)))
|
if (integer_zerop (TREE_OPERAND (exp, 1)))
|
do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
|
do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
|
else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
|
else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
|
&& !can_compare_p (EQ, TYPE_MODE (inner_type), ccp_jump))
|
&& !can_compare_p (EQ, TYPE_MODE (inner_type), ccp_jump))
|
do_jump_by_parts_equality (exp, if_false_label, if_true_label);
|
do_jump_by_parts_equality (exp, if_false_label, if_true_label);
|
else
|
else
|
do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
|
do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
|
break;
|
break;
|
}
|
}
|
|
|
case MINUS_EXPR:
|
case MINUS_EXPR:
|
/* Nonzero iff operands of minus differ. */
|
/* Nonzero iff operands of minus differ. */
|
exp = build2 (NE_EXPR, TREE_TYPE (exp),
|
exp = build2 (NE_EXPR, TREE_TYPE (exp),
|
TREE_OPERAND (exp, 0),
|
TREE_OPERAND (exp, 0),
|
TREE_OPERAND (exp, 1));
|
TREE_OPERAND (exp, 1));
|
/* FALLTHRU */
|
/* FALLTHRU */
|
case NE_EXPR:
|
case NE_EXPR:
|
{
|
{
|
tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
|
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
!= MODE_COMPLEX_FLOAT);
|
!= MODE_COMPLEX_FLOAT);
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type))
|
!= MODE_COMPLEX_INT);
|
!= MODE_COMPLEX_INT);
|
|
|
if (integer_zerop (TREE_OPERAND (exp, 1)))
|
if (integer_zerop (TREE_OPERAND (exp, 1)))
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
|
else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
|
else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
|
&& !can_compare_p (NE, TYPE_MODE (inner_type), ccp_jump))
|
&& !can_compare_p (NE, TYPE_MODE (inner_type), ccp_jump))
|
do_jump_by_parts_equality (exp, if_true_label, if_false_label);
|
do_jump_by_parts_equality (exp, if_true_label, if_false_label);
|
else
|
else
|
do_compare_and_jump (exp, NE, NE, if_false_label, if_true_label);
|
do_compare_and_jump (exp, NE, NE, if_false_label, if_true_label);
|
break;
|
break;
|
}
|
}
|
|
|
case LT_EXPR:
|
case LT_EXPR:
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
&& ! can_compare_p (LT, mode, ccp_jump))
|
&& ! can_compare_p (LT, mode, ccp_jump))
|
do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
|
do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
|
else
|
else
|
do_compare_and_jump (exp, LT, LTU, if_false_label, if_true_label);
|
do_compare_and_jump (exp, LT, LTU, if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case LE_EXPR:
|
case LE_EXPR:
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
&& ! can_compare_p (LE, mode, ccp_jump))
|
&& ! can_compare_p (LE, mode, ccp_jump))
|
do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
|
do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
|
else
|
else
|
do_compare_and_jump (exp, LE, LEU, if_false_label, if_true_label);
|
do_compare_and_jump (exp, LE, LEU, if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case GT_EXPR:
|
case GT_EXPR:
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
&& ! can_compare_p (GT, mode, ccp_jump))
|
&& ! can_compare_p (GT, mode, ccp_jump))
|
do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
|
do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
|
else
|
else
|
do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
|
do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case GE_EXPR:
|
case GE_EXPR:
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
&& ! can_compare_p (GE, mode, ccp_jump))
|
&& ! can_compare_p (GE, mode, ccp_jump))
|
do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
|
do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
|
else
|
else
|
do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
|
do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case UNORDERED_EXPR:
|
case UNORDERED_EXPR:
|
case ORDERED_EXPR:
|
case ORDERED_EXPR:
|
{
|
{
|
enum rtx_code cmp, rcmp;
|
enum rtx_code cmp, rcmp;
|
int do_rev;
|
int do_rev;
|
|
|
if (code == UNORDERED_EXPR)
|
if (code == UNORDERED_EXPR)
|
cmp = UNORDERED, rcmp = ORDERED;
|
cmp = UNORDERED, rcmp = ORDERED;
|
else
|
else
|
cmp = ORDERED, rcmp = UNORDERED;
|
cmp = ORDERED, rcmp = UNORDERED;
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
|
|
do_rev = 0;
|
do_rev = 0;
|
if (! can_compare_p (cmp, mode, ccp_jump)
|
if (! can_compare_p (cmp, mode, ccp_jump)
|
&& (can_compare_p (rcmp, mode, ccp_jump)
|
&& (can_compare_p (rcmp, mode, ccp_jump)
|
/* If the target doesn't provide either UNORDERED or ORDERED
|
/* If the target doesn't provide either UNORDERED or ORDERED
|
comparisons, canonicalize on UNORDERED for the library. */
|
comparisons, canonicalize on UNORDERED for the library. */
|
|| rcmp == UNORDERED))
|
|| rcmp == UNORDERED))
|
do_rev = 1;
|
do_rev = 1;
|
|
|
if (! do_rev)
|
if (! do_rev)
|
do_compare_and_jump (exp, cmp, cmp, if_false_label, if_true_label);
|
do_compare_and_jump (exp, cmp, cmp, if_false_label, if_true_label);
|
else
|
else
|
do_compare_and_jump (exp, rcmp, rcmp, if_true_label, if_false_label);
|
do_compare_and_jump (exp, rcmp, rcmp, if_true_label, if_false_label);
|
}
|
}
|
break;
|
break;
|
|
|
{
|
{
|
enum rtx_code rcode1;
|
enum rtx_code rcode1;
|
enum tree_code tcode1, tcode2;
|
enum tree_code tcode1, tcode2;
|
|
|
case UNLT_EXPR:
|
case UNLT_EXPR:
|
rcode1 = UNLT;
|
rcode1 = UNLT;
|
tcode1 = UNORDERED_EXPR;
|
tcode1 = UNORDERED_EXPR;
|
tcode2 = LT_EXPR;
|
tcode2 = LT_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
case UNLE_EXPR:
|
case UNLE_EXPR:
|
rcode1 = UNLE;
|
rcode1 = UNLE;
|
tcode1 = UNORDERED_EXPR;
|
tcode1 = UNORDERED_EXPR;
|
tcode2 = LE_EXPR;
|
tcode2 = LE_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
case UNGT_EXPR:
|
case UNGT_EXPR:
|
rcode1 = UNGT;
|
rcode1 = UNGT;
|
tcode1 = UNORDERED_EXPR;
|
tcode1 = UNORDERED_EXPR;
|
tcode2 = GT_EXPR;
|
tcode2 = GT_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
case UNGE_EXPR:
|
case UNGE_EXPR:
|
rcode1 = UNGE;
|
rcode1 = UNGE;
|
tcode1 = UNORDERED_EXPR;
|
tcode1 = UNORDERED_EXPR;
|
tcode2 = GE_EXPR;
|
tcode2 = GE_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
case UNEQ_EXPR:
|
case UNEQ_EXPR:
|
rcode1 = UNEQ;
|
rcode1 = UNEQ;
|
tcode1 = UNORDERED_EXPR;
|
tcode1 = UNORDERED_EXPR;
|
tcode2 = EQ_EXPR;
|
tcode2 = EQ_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
case LTGT_EXPR:
|
case LTGT_EXPR:
|
/* It is ok for LTGT_EXPR to trap when the result is unordered,
|
/* It is ok for LTGT_EXPR to trap when the result is unordered,
|
so expand to (a < b) || (a > b). */
|
so expand to (a < b) || (a > b). */
|
rcode1 = LTGT;
|
rcode1 = LTGT;
|
tcode1 = LT_EXPR;
|
tcode1 = LT_EXPR;
|
tcode2 = GT_EXPR;
|
tcode2 = GT_EXPR;
|
goto unordered_bcc;
|
goto unordered_bcc;
|
|
|
unordered_bcc:
|
unordered_bcc:
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
if (can_compare_p (rcode1, mode, ccp_jump))
|
if (can_compare_p (rcode1, mode, ccp_jump))
|
do_compare_and_jump (exp, rcode1, rcode1, if_false_label,
|
do_compare_and_jump (exp, rcode1, rcode1, if_false_label,
|
if_true_label);
|
if_true_label);
|
else
|
else
|
{
|
{
|
tree op0 = save_expr (TREE_OPERAND (exp, 0));
|
tree op0 = save_expr (TREE_OPERAND (exp, 0));
|
tree op1 = save_expr (TREE_OPERAND (exp, 1));
|
tree op1 = save_expr (TREE_OPERAND (exp, 1));
|
tree cmp0, cmp1;
|
tree cmp0, cmp1;
|
|
|
/* If the target doesn't support combined unordered
|
/* If the target doesn't support combined unordered
|
compares, decompose into two comparisons. */
|
compares, decompose into two comparisons. */
|
if (if_true_label == 0)
|
if (if_true_label == 0)
|
drop_through_label = if_true_label = gen_label_rtx ();
|
drop_through_label = if_true_label = gen_label_rtx ();
|
|
|
cmp0 = fold_build2 (tcode1, TREE_TYPE (exp), op0, op1);
|
cmp0 = fold_build2 (tcode1, TREE_TYPE (exp), op0, op1);
|
cmp1 = fold_build2 (tcode2, TREE_TYPE (exp), op0, op1);
|
cmp1 = fold_build2 (tcode2, TREE_TYPE (exp), op0, op1);
|
do_jump (cmp0, 0, if_true_label);
|
do_jump (cmp0, 0, if_true_label);
|
do_jump (cmp1, if_false_label, if_true_label);
|
do_jump (cmp1, if_false_label, if_true_label);
|
}
|
}
|
}
|
}
|
break;
|
break;
|
|
|
case TRUTH_AND_EXPR:
|
case TRUTH_AND_EXPR:
|
/* High branch cost, expand as the bitwise AND of the conditions.
|
/* High branch cost, expand as the bitwise AND of the conditions.
|
Do the same if the RHS has side effects, because we're effectively
|
Do the same if the RHS has side effects, because we're effectively
|
turning a TRUTH_AND_EXPR into a TRUTH_ANDIF_EXPR. */
|
turning a TRUTH_AND_EXPR into a TRUTH_ANDIF_EXPR. */
|
if (BRANCH_COST >= 4 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
|
if (BRANCH_COST >= 4 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
|
goto normal;
|
goto normal;
|
|
|
if (if_false_label == NULL_RTX)
|
if (if_false_label == NULL_RTX)
|
{
|
{
|
drop_through_label = gen_label_rtx ();
|
drop_through_label = gen_label_rtx ();
|
do_jump (TREE_OPERAND (exp, 0), drop_through_label, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 0), drop_through_label, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 1), NULL_RTX, if_true_label);
|
do_jump (TREE_OPERAND (exp, 1), NULL_RTX, if_true_label);
|
}
|
}
|
else
|
else
|
{
|
{
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
}
|
}
|
break;
|
break;
|
|
|
case TRUTH_OR_EXPR:
|
case TRUTH_OR_EXPR:
|
/* High branch cost, expand as the bitwise OR of the conditions.
|
/* High branch cost, expand as the bitwise OR of the conditions.
|
Do the same if the RHS has side effects, because we're effectively
|
Do the same if the RHS has side effects, because we're effectively
|
turning a TRUTH_OR_EXPR into a TRUTH_ORIF_EXPR. */
|
turning a TRUTH_OR_EXPR into a TRUTH_ORIF_EXPR. */
|
if (BRANCH_COST >= 4 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
|
if (BRANCH_COST >= 4 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
|
goto normal;
|
goto normal;
|
|
|
if (if_true_label == NULL_RTX)
|
if (if_true_label == NULL_RTX)
|
{
|
{
|
drop_through_label = gen_label_rtx ();
|
drop_through_label = gen_label_rtx ();
|
do_jump (TREE_OPERAND (exp, 0), NULL_RTX, drop_through_label);
|
do_jump (TREE_OPERAND (exp, 0), NULL_RTX, drop_through_label);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, NULL_RTX);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, NULL_RTX);
|
}
|
}
|
else
|
else
|
{
|
{
|
do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
|
do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
|
}
|
}
|
break;
|
break;
|
|
|
/* Special case:
|
/* Special case:
|
__builtin_expect (<test>, 0) and
|
__builtin_expect (<test>, 0) and
|
__builtin_expect (<test>, 1)
|
__builtin_expect (<test>, 1)
|
|
|
We need to do this here, so that <test> is not converted to a SCC
|
We need to do this here, so that <test> is not converted to a SCC
|
operation on machines that use condition code registers and COMPARE
|
operation on machines that use condition code registers and COMPARE
|
like the PowerPC, and then the jump is done based on whether the SCC
|
like the PowerPC, and then the jump is done based on whether the SCC
|
operation produced a 1 or 0. */
|
operation produced a 1 or 0. */
|
case CALL_EXPR:
|
case CALL_EXPR:
|
/* Check for a built-in function. */
|
/* Check for a built-in function. */
|
{
|
{
|
tree fndecl = get_callee_fndecl (exp);
|
tree fndecl = get_callee_fndecl (exp);
|
tree arglist = TREE_OPERAND (exp, 1);
|
tree arglist = TREE_OPERAND (exp, 1);
|
|
|
if (fndecl
|
if (fndecl
|
&& DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
|
&& DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
|
&& DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT
|
&& DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT
|
&& arglist != NULL_TREE
|
&& arglist != NULL_TREE
|
&& TREE_CHAIN (arglist) != NULL_TREE)
|
&& TREE_CHAIN (arglist) != NULL_TREE)
|
{
|
{
|
rtx seq = expand_builtin_expect_jump (exp, if_false_label,
|
rtx seq = expand_builtin_expect_jump (exp, if_false_label,
|
if_true_label);
|
if_true_label);
|
|
|
if (seq != NULL_RTX)
|
if (seq != NULL_RTX)
|
{
|
{
|
emit_insn (seq);
|
emit_insn (seq);
|
return;
|
return;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Fall through and generate the normal code. */
|
/* Fall through and generate the normal code. */
|
default:
|
default:
|
normal:
|
normal:
|
temp = expand_normal (exp);
|
temp = expand_normal (exp);
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
/* The RTL optimizers prefer comparisons against pseudos. */
|
/* The RTL optimizers prefer comparisons against pseudos. */
|
if (GET_CODE (temp) == SUBREG)
|
if (GET_CODE (temp) == SUBREG)
|
{
|
{
|
/* Compare promoted variables in their promoted mode. */
|
/* Compare promoted variables in their promoted mode. */
|
if (SUBREG_PROMOTED_VAR_P (temp)
|
if (SUBREG_PROMOTED_VAR_P (temp)
|
&& REG_P (XEXP (temp, 0)))
|
&& REG_P (XEXP (temp, 0)))
|
temp = XEXP (temp, 0);
|
temp = XEXP (temp, 0);
|
else
|
else
|
temp = copy_to_reg (temp);
|
temp = copy_to_reg (temp);
|
}
|
}
|
do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
|
do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
|
NE, TYPE_UNSIGNED (TREE_TYPE (exp)),
|
NE, TYPE_UNSIGNED (TREE_TYPE (exp)),
|
GET_MODE (temp), NULL_RTX,
|
GET_MODE (temp), NULL_RTX,
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
}
|
}
|
|
|
if (drop_through_label)
|
if (drop_through_label)
|
{
|
{
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
emit_label (drop_through_label);
|
emit_label (drop_through_label);
|
}
|
}
|
}
|
}
|
|
|
/* Compare OP0 with OP1, word at a time, in mode MODE.
|
/* Compare OP0 with OP1, word at a time, in mode MODE.
|
UNSIGNEDP says to do unsigned comparison.
|
UNSIGNEDP says to do unsigned comparison.
|
Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
|
Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
|
|
|
static void
|
static void
|
do_jump_by_parts_greater_rtx (enum machine_mode mode, int unsignedp, rtx op0,
|
do_jump_by_parts_greater_rtx (enum machine_mode mode, int unsignedp, rtx op0,
|
rtx op1, rtx if_false_label, rtx if_true_label)
|
rtx op1, rtx if_false_label, rtx if_true_label)
|
{
|
{
|
int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
|
int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
|
rtx drop_through_label = 0;
|
rtx drop_through_label = 0;
|
int i;
|
int i;
|
|
|
if (! if_true_label || ! if_false_label)
|
if (! if_true_label || ! if_false_label)
|
drop_through_label = gen_label_rtx ();
|
drop_through_label = gen_label_rtx ();
|
if (! if_true_label)
|
if (! if_true_label)
|
if_true_label = drop_through_label;
|
if_true_label = drop_through_label;
|
if (! if_false_label)
|
if (! if_false_label)
|
if_false_label = drop_through_label;
|
if_false_label = drop_through_label;
|
|
|
/* Compare a word at a time, high order first. */
|
/* Compare a word at a time, high order first. */
|
for (i = 0; i < nwords; i++)
|
for (i = 0; i < nwords; i++)
|
{
|
{
|
rtx op0_word, op1_word;
|
rtx op0_word, op1_word;
|
|
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
{
|
{
|
op0_word = operand_subword_force (op0, i, mode);
|
op0_word = operand_subword_force (op0, i, mode);
|
op1_word = operand_subword_force (op1, i, mode);
|
op1_word = operand_subword_force (op1, i, mode);
|
}
|
}
|
else
|
else
|
{
|
{
|
op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
|
op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
|
op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
|
op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
|
}
|
}
|
|
|
/* All but high-order word must be compared as unsigned. */
|
/* All but high-order word must be compared as unsigned. */
|
do_compare_rtx_and_jump (op0_word, op1_word, GT,
|
do_compare_rtx_and_jump (op0_word, op1_word, GT,
|
(unsignedp || i > 0), word_mode, NULL_RTX,
|
(unsignedp || i > 0), word_mode, NULL_RTX,
|
NULL_RTX, if_true_label);
|
NULL_RTX, if_true_label);
|
|
|
/* Consider lower words only if these are equal. */
|
/* Consider lower words only if these are equal. */
|
do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
|
do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
|
NULL_RTX, NULL_RTX, if_false_label);
|
NULL_RTX, NULL_RTX, if_false_label);
|
}
|
}
|
|
|
if (if_false_label)
|
if (if_false_label)
|
emit_jump (if_false_label);
|
emit_jump (if_false_label);
|
if (drop_through_label)
|
if (drop_through_label)
|
emit_label (drop_through_label);
|
emit_label (drop_through_label);
|
}
|
}
|
|
|
/* Given a comparison expression EXP for values too wide to be compared
|
/* Given a comparison expression EXP for values too wide to be compared
|
with one insn, test the comparison and jump to the appropriate label.
|
with one insn, test the comparison and jump to the appropriate label.
|
The code of EXP is ignored; we always test GT if SWAP is 0,
|
The code of EXP is ignored; we always test GT if SWAP is 0,
|
and LT if SWAP is 1. */
|
and LT if SWAP is 1. */
|
|
|
static void
|
static void
|
do_jump_by_parts_greater (tree exp, int swap, rtx if_false_label,
|
do_jump_by_parts_greater (tree exp, int swap, rtx if_false_label,
|
rtx if_true_label)
|
rtx if_true_label)
|
{
|
{
|
rtx op0 = expand_normal (TREE_OPERAND (exp, swap));
|
rtx op0 = expand_normal (TREE_OPERAND (exp, swap));
|
rtx op1 = expand_normal (TREE_OPERAND (exp, !swap));
|
rtx op1 = expand_normal (TREE_OPERAND (exp, !swap));
|
enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
int unsignedp = TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
int unsignedp = TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
|
|
do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label,
|
do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label,
|
if_true_label);
|
if_true_label);
|
}
|
}
|
|
|
/* Jump according to whether OP0 is 0. We assume that OP0 has an integer
|
/* Jump according to whether OP0 is 0. We assume that OP0 has an integer
|
mode, MODE, that is too wide for the available compare insns. Either
|
mode, MODE, that is too wide for the available compare insns. Either
|
Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL_RTX
|
Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL_RTX
|
to indicate drop through. */
|
to indicate drop through. */
|
|
|
static void
|
static void
|
do_jump_by_parts_zero_rtx (enum machine_mode mode, rtx op0,
|
do_jump_by_parts_zero_rtx (enum machine_mode mode, rtx op0,
|
rtx if_false_label, rtx if_true_label)
|
rtx if_false_label, rtx if_true_label)
|
{
|
{
|
int nwords = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
|
int nwords = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
|
rtx part;
|
rtx part;
|
int i;
|
int i;
|
rtx drop_through_label = 0;
|
rtx drop_through_label = 0;
|
|
|
/* The fastest way of doing this comparison on almost any machine is to
|
/* The fastest way of doing this comparison on almost any machine is to
|
"or" all the words and compare the result. If all have to be loaded
|
"or" all the words and compare the result. If all have to be loaded
|
from memory and this is a very wide item, it's possible this may
|
from memory and this is a very wide item, it's possible this may
|
be slower, but that's highly unlikely. */
|
be slower, but that's highly unlikely. */
|
|
|
part = gen_reg_rtx (word_mode);
|
part = gen_reg_rtx (word_mode);
|
emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
|
emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
|
for (i = 1; i < nwords && part != 0; i++)
|
for (i = 1; i < nwords && part != 0; i++)
|
part = expand_binop (word_mode, ior_optab, part,
|
part = expand_binop (word_mode, ior_optab, part,
|
operand_subword_force (op0, i, GET_MODE (op0)),
|
operand_subword_force (op0, i, GET_MODE (op0)),
|
part, 1, OPTAB_WIDEN);
|
part, 1, OPTAB_WIDEN);
|
|
|
if (part != 0)
|
if (part != 0)
|
{
|
{
|
do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
|
do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
|
NULL_RTX, if_false_label, if_true_label);
|
NULL_RTX, if_false_label, if_true_label);
|
|
|
return;
|
return;
|
}
|
}
|
|
|
/* If we couldn't do the "or" simply, do this with a series of compares. */
|
/* If we couldn't do the "or" simply, do this with a series of compares. */
|
if (! if_false_label)
|
if (! if_false_label)
|
drop_through_label = if_false_label = gen_label_rtx ();
|
drop_through_label = if_false_label = gen_label_rtx ();
|
|
|
for (i = 0; i < nwords; i++)
|
for (i = 0; i < nwords; i++)
|
do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
|
do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
|
const0_rtx, EQ, 1, word_mode, NULL_RTX,
|
const0_rtx, EQ, 1, word_mode, NULL_RTX,
|
if_false_label, NULL_RTX);
|
if_false_label, NULL_RTX);
|
|
|
if (if_true_label)
|
if (if_true_label)
|
emit_jump (if_true_label);
|
emit_jump (if_true_label);
|
|
|
if (drop_through_label)
|
if (drop_through_label)
|
emit_label (drop_through_label);
|
emit_label (drop_through_label);
|
}
|
}
|
|
|
/* Test for the equality of two RTX expressions OP0 and OP1 in mode MODE,
|
/* Test for the equality of two RTX expressions OP0 and OP1 in mode MODE,
|
where MODE is an integer mode too wide to be compared with one insn.
|
where MODE is an integer mode too wide to be compared with one insn.
|
Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL_RTX
|
Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL_RTX
|
to indicate drop through. */
|
to indicate drop through. */
|
|
|
static void
|
static void
|
do_jump_by_parts_equality_rtx (enum machine_mode mode, rtx op0, rtx op1,
|
do_jump_by_parts_equality_rtx (enum machine_mode mode, rtx op0, rtx op1,
|
rtx if_false_label, rtx if_true_label)
|
rtx if_false_label, rtx if_true_label)
|
{
|
{
|
int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
|
int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
|
rtx drop_through_label = 0;
|
rtx drop_through_label = 0;
|
int i;
|
int i;
|
|
|
if (op1 == const0_rtx)
|
if (op1 == const0_rtx)
|
{
|
{
|
do_jump_by_parts_zero_rtx (mode, op0, if_false_label, if_true_label);
|
do_jump_by_parts_zero_rtx (mode, op0, if_false_label, if_true_label);
|
return;
|
return;
|
}
|
}
|
else if (op0 == const0_rtx)
|
else if (op0 == const0_rtx)
|
{
|
{
|
do_jump_by_parts_zero_rtx (mode, op1, if_false_label, if_true_label);
|
do_jump_by_parts_zero_rtx (mode, op1, if_false_label, if_true_label);
|
return;
|
return;
|
}
|
}
|
|
|
if (! if_false_label)
|
if (! if_false_label)
|
drop_through_label = if_false_label = gen_label_rtx ();
|
drop_through_label = if_false_label = gen_label_rtx ();
|
|
|
for (i = 0; i < nwords; i++)
|
for (i = 0; i < nwords; i++)
|
do_compare_rtx_and_jump (operand_subword_force (op0, i, mode),
|
do_compare_rtx_and_jump (operand_subword_force (op0, i, mode),
|
operand_subword_force (op1, i, mode),
|
operand_subword_force (op1, i, mode),
|
EQ, 0, word_mode, NULL_RTX,
|
EQ, 0, word_mode, NULL_RTX,
|
if_false_label, NULL_RTX);
|
if_false_label, NULL_RTX);
|
|
|
if (if_true_label)
|
if (if_true_label)
|
emit_jump (if_true_label);
|
emit_jump (if_true_label);
|
if (drop_through_label)
|
if (drop_through_label)
|
emit_label (drop_through_label);
|
emit_label (drop_through_label);
|
}
|
}
|
|
|
/* Given an EQ_EXPR expression EXP for values too wide to be compared
|
/* Given an EQ_EXPR expression EXP for values too wide to be compared
|
with one insn, test the comparison and jump to the appropriate label. */
|
with one insn, test the comparison and jump to the appropriate label. */
|
|
|
static void
|
static void
|
do_jump_by_parts_equality (tree exp, rtx if_false_label, rtx if_true_label)
|
do_jump_by_parts_equality (tree exp, rtx if_false_label, rtx if_true_label)
|
{
|
{
|
rtx op0 = expand_normal (TREE_OPERAND (exp, 0));
|
rtx op0 = expand_normal (TREE_OPERAND (exp, 0));
|
rtx op1 = expand_normal (TREE_OPERAND (exp, 1));
|
rtx op1 = expand_normal (TREE_OPERAND (exp, 1));
|
enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label,
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label,
|
if_true_label);
|
if_true_label);
|
}
|
}
|
|
|
/* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
|
/* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
|
MODE is the machine mode of the comparison, not of the result.
|
MODE is the machine mode of the comparison, not of the result.
|
(including code to compute the values to be compared) and set CC0
|
(including code to compute the values to be compared) and set CC0
|
according to the result. The decision as to signed or unsigned
|
according to the result. The decision as to signed or unsigned
|
comparison must be made by the caller.
|
comparison must be made by the caller.
|
|
|
We force a stack adjustment unless there are currently
|
We force a stack adjustment unless there are currently
|
things pushed on the stack that aren't yet used.
|
things pushed on the stack that aren't yet used.
|
|
|
If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
|
If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
|
compared. */
|
compared. */
|
|
|
rtx
|
rtx
|
compare_from_rtx (rtx op0, rtx op1, enum rtx_code code, int unsignedp,
|
compare_from_rtx (rtx op0, rtx op1, enum rtx_code code, int unsignedp,
|
enum machine_mode mode, rtx size)
|
enum machine_mode mode, rtx size)
|
{
|
{
|
rtx tem;
|
rtx tem;
|
|
|
/* If one operand is constant, make it the second one. Only do this
|
/* If one operand is constant, make it the second one. Only do this
|
if the other operand is not constant as well. */
|
if the other operand is not constant as well. */
|
|
|
if (swap_commutative_operands_p (op0, op1))
|
if (swap_commutative_operands_p (op0, op1))
|
{
|
{
|
tem = op0;
|
tem = op0;
|
op0 = op1;
|
op0 = op1;
|
op1 = tem;
|
op1 = tem;
|
code = swap_condition (code);
|
code = swap_condition (code);
|
}
|
}
|
|
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
|
|
code = unsignedp ? unsigned_condition (code) : code;
|
code = unsignedp ? unsigned_condition (code) : code;
|
tem = simplify_relational_operation (code, VOIDmode, mode, op0, op1);
|
tem = simplify_relational_operation (code, VOIDmode, mode, op0, op1);
|
if (tem)
|
if (tem)
|
{
|
{
|
if (CONSTANT_P (tem))
|
if (CONSTANT_P (tem))
|
return tem;
|
return tem;
|
|
|
if (COMPARISON_P (tem))
|
if (COMPARISON_P (tem))
|
{
|
{
|
code = GET_CODE (tem);
|
code = GET_CODE (tem);
|
op0 = XEXP (tem, 0);
|
op0 = XEXP (tem, 0);
|
op1 = XEXP (tem, 1);
|
op1 = XEXP (tem, 1);
|
mode = GET_MODE (op0);
|
mode = GET_MODE (op0);
|
unsignedp = (code == GTU || code == LTU
|
unsignedp = (code == GTU || code == LTU
|
|| code == GEU || code == LEU);
|
|| code == GEU || code == LEU);
|
}
|
}
|
}
|
}
|
|
|
emit_cmp_insn (op0, op1, code, size, mode, unsignedp);
|
emit_cmp_insn (op0, op1, code, size, mode, unsignedp);
|
|
|
#if HAVE_cc0
|
#if HAVE_cc0
|
return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
|
return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
|
#else
|
#else
|
return gen_rtx_fmt_ee (code, VOIDmode, op0, op1);
|
return gen_rtx_fmt_ee (code, VOIDmode, op0, op1);
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Like do_compare_and_jump but expects the values to compare as two rtx's.
|
/* Like do_compare_and_jump but expects the values to compare as two rtx's.
|
The decision as to signed or unsigned comparison must be made by the caller.
|
The decision as to signed or unsigned comparison must be made by the caller.
|
|
|
If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
|
If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
|
compared. */
|
compared. */
|
|
|
void
|
void
|
do_compare_rtx_and_jump (rtx op0, rtx op1, enum rtx_code code, int unsignedp,
|
do_compare_rtx_and_jump (rtx op0, rtx op1, enum rtx_code code, int unsignedp,
|
enum machine_mode mode, rtx size, rtx if_false_label,
|
enum machine_mode mode, rtx size, rtx if_false_label,
|
rtx if_true_label)
|
rtx if_true_label)
|
{
|
{
|
rtx tem;
|
rtx tem;
|
int dummy_true_label = 0;
|
int dummy_true_label = 0;
|
|
|
/* Reverse the comparison if that is safe and we want to jump if it is
|
/* Reverse the comparison if that is safe and we want to jump if it is
|
false. */
|
false. */
|
if (! if_true_label && ! FLOAT_MODE_P (mode))
|
if (! if_true_label && ! FLOAT_MODE_P (mode))
|
{
|
{
|
if_true_label = if_false_label;
|
if_true_label = if_false_label;
|
if_false_label = 0;
|
if_false_label = 0;
|
code = reverse_condition (code);
|
code = reverse_condition (code);
|
}
|
}
|
|
|
/* If one operand is constant, make it the second one. Only do this
|
/* If one operand is constant, make it the second one. Only do this
|
if the other operand is not constant as well. */
|
if the other operand is not constant as well. */
|
|
|
if (swap_commutative_operands_p (op0, op1))
|
if (swap_commutative_operands_p (op0, op1))
|
{
|
{
|
tem = op0;
|
tem = op0;
|
op0 = op1;
|
op0 = op1;
|
op1 = tem;
|
op1 = tem;
|
code = swap_condition (code);
|
code = swap_condition (code);
|
}
|
}
|
|
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
|
|
code = unsignedp ? unsigned_condition (code) : code;
|
code = unsignedp ? unsigned_condition (code) : code;
|
if (0 != (tem = simplify_relational_operation (code, mode, VOIDmode,
|
if (0 != (tem = simplify_relational_operation (code, mode, VOIDmode,
|
op0, op1)))
|
op0, op1)))
|
{
|
{
|
if (CONSTANT_P (tem))
|
if (CONSTANT_P (tem))
|
{
|
{
|
rtx label = (tem == const0_rtx || tem == CONST0_RTX (mode))
|
rtx label = (tem == const0_rtx || tem == CONST0_RTX (mode))
|
? if_false_label : if_true_label;
|
? if_false_label : if_true_label;
|
if (label)
|
if (label)
|
emit_jump (label);
|
emit_jump (label);
|
return;
|
return;
|
}
|
}
|
|
|
code = GET_CODE (tem);
|
code = GET_CODE (tem);
|
mode = GET_MODE (tem);
|
mode = GET_MODE (tem);
|
op0 = XEXP (tem, 0);
|
op0 = XEXP (tem, 0);
|
op1 = XEXP (tem, 1);
|
op1 = XEXP (tem, 1);
|
unsignedp = (code == GTU || code == LTU || code == GEU || code == LEU);
|
unsignedp = (code == GTU || code == LTU || code == GEU || code == LEU);
|
}
|
}
|
|
|
|
|
if (! if_true_label)
|
if (! if_true_label)
|
{
|
{
|
dummy_true_label = 1;
|
dummy_true_label = 1;
|
if_true_label = gen_label_rtx ();
|
if_true_label = gen_label_rtx ();
|
}
|
}
|
|
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
if (GET_MODE_CLASS (mode) == MODE_INT
|
&& ! can_compare_p (code, mode, ccp_jump))
|
&& ! can_compare_p (code, mode, ccp_jump))
|
{
|
{
|
switch (code)
|
switch (code)
|
{
|
{
|
case LTU:
|
case LTU:
|
do_jump_by_parts_greater_rtx (mode, 1, op1, op0,
|
do_jump_by_parts_greater_rtx (mode, 1, op1, op0,
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case LEU:
|
case LEU:
|
do_jump_by_parts_greater_rtx (mode, 1, op0, op1,
|
do_jump_by_parts_greater_rtx (mode, 1, op0, op1,
|
if_true_label, if_false_label);
|
if_true_label, if_false_label);
|
break;
|
break;
|
|
|
case GTU:
|
case GTU:
|
do_jump_by_parts_greater_rtx (mode, 1, op0, op1,
|
do_jump_by_parts_greater_rtx (mode, 1, op0, op1,
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case GEU:
|
case GEU:
|
do_jump_by_parts_greater_rtx (mode, 1, op1, op0,
|
do_jump_by_parts_greater_rtx (mode, 1, op1, op0,
|
if_true_label, if_false_label);
|
if_true_label, if_false_label);
|
break;
|
break;
|
|
|
case LT:
|
case LT:
|
do_jump_by_parts_greater_rtx (mode, 0, op1, op0,
|
do_jump_by_parts_greater_rtx (mode, 0, op1, op0,
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case LE:
|
case LE:
|
do_jump_by_parts_greater_rtx (mode, 0, op0, op1,
|
do_jump_by_parts_greater_rtx (mode, 0, op0, op1,
|
if_true_label, if_false_label);
|
if_true_label, if_false_label);
|
break;
|
break;
|
|
|
case GT:
|
case GT:
|
do_jump_by_parts_greater_rtx (mode, 0, op0, op1,
|
do_jump_by_parts_greater_rtx (mode, 0, op0, op1,
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
break;
|
break;
|
|
|
case GE:
|
case GE:
|
do_jump_by_parts_greater_rtx (mode, 0, op1, op0,
|
do_jump_by_parts_greater_rtx (mode, 0, op1, op0,
|
if_true_label, if_false_label);
|
if_true_label, if_false_label);
|
break;
|
break;
|
|
|
case EQ:
|
case EQ:
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label,
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label,
|
if_true_label);
|
if_true_label);
|
break;
|
break;
|
|
|
case NE:
|
case NE:
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_true_label,
|
do_jump_by_parts_equality_rtx (mode, op0, op1, if_true_label,
|
if_false_label);
|
if_false_label);
|
break;
|
break;
|
|
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
}
|
}
|
}
|
}
|
else
|
else
|
emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp,
|
emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp,
|
if_true_label);
|
if_true_label);
|
|
|
if (if_false_label)
|
if (if_false_label)
|
emit_jump (if_false_label);
|
emit_jump (if_false_label);
|
if (dummy_true_label)
|
if (dummy_true_label)
|
emit_label (if_true_label);
|
emit_label (if_true_label);
|
}
|
}
|
|
|
/* Generate code for a comparison expression EXP (including code to compute
|
/* Generate code for a comparison expression EXP (including code to compute
|
the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
|
the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
|
IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
|
IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
|
generated code will drop through.
|
generated code will drop through.
|
SIGNED_CODE should be the rtx operation for this comparison for
|
SIGNED_CODE should be the rtx operation for this comparison for
|
signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
|
signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
|
|
|
We force a stack adjustment unless there are currently
|
We force a stack adjustment unless there are currently
|
things pushed on the stack that aren't yet used. */
|
things pushed on the stack that aren't yet used. */
|
|
|
static void
|
static void
|
do_compare_and_jump (tree exp, enum rtx_code signed_code,
|
do_compare_and_jump (tree exp, enum rtx_code signed_code,
|
enum rtx_code unsigned_code, rtx if_false_label,
|
enum rtx_code unsigned_code, rtx if_false_label,
|
rtx if_true_label)
|
rtx if_true_label)
|
{
|
{
|
rtx op0, op1;
|
rtx op0, op1;
|
tree type;
|
tree type;
|
enum machine_mode mode;
|
enum machine_mode mode;
|
int unsignedp;
|
int unsignedp;
|
enum rtx_code code;
|
enum rtx_code code;
|
|
|
/* Don't crash if the comparison was erroneous. */
|
/* Don't crash if the comparison was erroneous. */
|
op0 = expand_normal (TREE_OPERAND (exp, 0));
|
op0 = expand_normal (TREE_OPERAND (exp, 0));
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
|
return;
|
return;
|
|
|
op1 = expand_normal (TREE_OPERAND (exp, 1));
|
op1 = expand_normal (TREE_OPERAND (exp, 1));
|
if (TREE_CODE (TREE_OPERAND (exp, 1)) == ERROR_MARK)
|
if (TREE_CODE (TREE_OPERAND (exp, 1)) == ERROR_MARK)
|
return;
|
return;
|
|
|
type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
type = TREE_TYPE (TREE_OPERAND (exp, 0));
|
mode = TYPE_MODE (type);
|
mode = TYPE_MODE (type);
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
|
if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
|
&& (TREE_CODE (TREE_OPERAND (exp, 1)) != INTEGER_CST
|
&& (TREE_CODE (TREE_OPERAND (exp, 1)) != INTEGER_CST
|
|| (GET_MODE_BITSIZE (mode)
|
|| (GET_MODE_BITSIZE (mode)
|
> GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp,
|
> GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp,
|
1)))))))
|
1)))))))
|
{
|
{
|
/* op0 might have been replaced by promoted constant, in which
|
/* op0 might have been replaced by promoted constant, in which
|
case the type of second argument should be used. */
|
case the type of second argument should be used. */
|
type = TREE_TYPE (TREE_OPERAND (exp, 1));
|
type = TREE_TYPE (TREE_OPERAND (exp, 1));
|
mode = TYPE_MODE (type);
|
mode = TYPE_MODE (type);
|
}
|
}
|
unsignedp = TYPE_UNSIGNED (type);
|
unsignedp = TYPE_UNSIGNED (type);
|
code = unsignedp ? unsigned_code : signed_code;
|
code = unsignedp ? unsigned_code : signed_code;
|
|
|
#ifdef HAVE_canonicalize_funcptr_for_compare
|
#ifdef HAVE_canonicalize_funcptr_for_compare
|
/* If function pointers need to be "canonicalized" before they can
|
/* If function pointers need to be "canonicalized" before they can
|
be reliably compared, then canonicalize them.
|
be reliably compared, then canonicalize them.
|
Only do this if *both* sides of the comparison are function pointers.
|
Only do this if *both* sides of the comparison are function pointers.
|
If one side isn't, we want a noncanonicalized comparison. See PR
|
If one side isn't, we want a noncanonicalized comparison. See PR
|
middle-end/17564. */
|
middle-end/17564. */
|
if (HAVE_canonicalize_funcptr_for_compare
|
if (HAVE_canonicalize_funcptr_for_compare
|
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
|
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
|
&& TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
|
&& TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
|
== FUNCTION_TYPE
|
== FUNCTION_TYPE
|
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
|
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
|
&& TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
|
&& TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
|
== FUNCTION_TYPE)
|
== FUNCTION_TYPE)
|
{
|
{
|
rtx new_op0 = gen_reg_rtx (mode);
|
rtx new_op0 = gen_reg_rtx (mode);
|
rtx new_op1 = gen_reg_rtx (mode);
|
rtx new_op1 = gen_reg_rtx (mode);
|
|
|
emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
|
emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
|
op0 = new_op0;
|
op0 = new_op0;
|
|
|
emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
|
emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
|
op1 = new_op1;
|
op1 = new_op1;
|
}
|
}
|
#endif
|
#endif
|
|
|
do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
|
do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
|
((mode == BLKmode)
|
((mode == BLKmode)
|
? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
|
? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
|
if_false_label, if_true_label);
|
if_false_label, if_true_label);
|
}
|
}
|
|
|
#include "gt-dojump.h"
|
#include "gt-dojump.h"
|
|
|
