+2007-11-20 Richard Guenther <rguenther@suse.de>
+
+ PR middle-end/34154
+ * gimplify.c (gimplify_switch_expr): Use tree_int_cst_lt instead
+ of the signed INT_CST_LT.
+ * stmt.c (expand_case): Likewise.
+ (estimate_case_costs): Likewise.
+
2007-11-20 Rask Ingemann Lambertsen <rask@sygehus.dk>
* read-rtl.c (fatal_expected_char): Print EOF as text rather that
{
/* Discard empty ranges. */
tree high = CASE_HIGH (elt);
- if (high && INT_CST_LT (high, low))
+ if (high && tree_int_cst_lt (high, low))
remove_element = TRUE;
}
else
high = CASE_HIGH (elt);
/* Discard empty ranges. */
- if (high && INT_CST_LT (high, low))
+ if (high && tree_int_cst_lt (high, low))
continue;
case_list = add_case_node (case_list, index_type, low, high,
}
else
{
- if (INT_CST_LT (n->low, minval))
+ if (tree_int_cst_lt (n->low, minval))
minval = n->low;
- if (INT_CST_LT (maxval, n->high))
+ if (tree_int_cst_lt (maxval, n->high))
maxval = n->high;
}
/* A range counts double, since it requires two compares. */
for (n = node; n; n = n->right)
{
- if ((INT_CST_LT (n->low, min_ascii)) || INT_CST_LT (max_ascii, n->high))
+ if (tree_int_cst_lt (n->low, min_ascii)
+ || tree_int_cst_lt (max_ascii, n->high))
return 0;
for (i = (HOST_WIDE_INT) TREE_INT_CST_LOW (n->low);
+2007-11-20 Richard Guenther <rguenther@suse.de>
+
+ PR middle-end/34154
+ * testsuite/gcc.c-torture/execute/pr34154.c: New testcase.
+
2007-11-20 Uros Bizjak <ubizjak@gmail.com>
* gcc.dg/tree-ssa/20030714-1.c: Cleanup dom3 dump file.
--- /dev/null
+int foo( unsigned long long aLL )
+{
+ switch( aLL )
+ {
+ case 1000000000000000000ULL ... 9999999999999999999ULL : return 19 ;
+ default : return 20 ;
+ };
+};
+extern void abort (void);
+int main()
+{
+ unsigned long long aLL = 1000000000000000000ULL;
+ if (foo (aLL) != 19)
+ abort ();
+ return 0;
+}