2010-05-27 Kai Tietz <kai.tietz@onevision.com>
PR bootstrap/44287
* rtti.c (emit_support_tinfos): Check for NULL_TREE.
* class.c (layout_class_type): Likewise.
* decl.c (finish_enum): Likewise.
* mangle.c (write_builitin_type): Likewise.
gcc/
2010-05-27 Kai Tietz <kai.tietz@onevision.com>
PR bootstrp/44287
* c-lex.c (narrowest_unsigned_type): Check for NULL_TREE.
(narrow_signed_type): Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@159912
138bc75d-0d04-0410-961f-
82ee72b054a4
+2010-05-27 Kai Tietz <kai.tietz@onevision.com>
+
+ PR bootstrp/44287
+ * c-lex.c (narrowest_unsigned_type): Check for NULL_TREE.
+ (narrow_signed_type): Likewise.
+
2010-05-26 Jan Hubicka <jh@suse.cz>
* cgraphunit.c (verify_cgraph_node): Do checking that DECL match
for (; itk < itk_none; itk += 2 /* skip unsigned types */)
{
- tree upper = TYPE_MAX_VALUE (integer_types[itk]);
+ tree upper;
+
+ if (integer_types[itk] == NULL_TREE)
+ continue;
+ upper = TYPE_MAX_VALUE (integer_types[itk]);
if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) > high
|| ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) == high
for (; itk < itk_none; itk += 2 /* skip signed types */)
{
- tree upper = TYPE_MAX_VALUE (integer_types[itk]);
+ tree upper;
+
+ if (integer_types[itk] == NULL_TREE)
+ continue;
+ upper = TYPE_MAX_VALUE (integer_types[itk]);
if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) > high
|| ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) == high
+2010-05-27 Kai Tietz <kai.tietz@onevision.com>
+
+ PR bootstrap/44287
+ * rtti.c (emit_support_tinfos): Check for NULL_TREE.
+ * class.c (layout_class_type): Likewise.
+ * decl.c (finish_enum): Likewise.
+ * mangle.c (write_builitin_type): Likewise.
+
2010-05-26 Kai Tietz <kai.tietz@onevision.com>
* cp-tree.h (cp_decl_specifier_seq): Add new bifield
of the field. Then, we are supposed to use the left over
bits as additional padding. */
for (itk = itk_char; itk != itk_none; ++itk)
- if (INT_CST_LT (DECL_SIZE (field),
- TYPE_SIZE (integer_types[itk])))
+ if (integer_types[itk] != NULL_TREE
+ && INT_CST_LT (DECL_SIZE (field),
+ TYPE_SIZE (integer_types[itk])))
break;
/* ITK now indicates a type that is too large for the
field. We have to back up by one to find the largest
type that fits. */
- integer_type = integer_types[itk - 1];
+ do
+ {
+ --itk;
+ integer_type = integer_types[itk];
+ } while (itk > 0 && integer_type == NULL_TREE);
/* Figure out how much additional padding is required. GCC
3.2 always created a padding field, even if it had zero
itk++)
{
underlying_type = integer_types[itk];
- if (TYPE_PRECISION (underlying_type) >= precision
+ if (underlying_type != NULL_TREE
+ && TYPE_PRECISION (underlying_type) >= precision
&& TYPE_UNSIGNED (underlying_type) == unsignedp)
break;
}
it in the array of these nodes. */
iagain:
for (itk = 0; itk < itk_none; ++itk)
- if (type == integer_types[itk])
+ if (integer_types[itk] != NULL_TREE
+ && type == integer_types[itk])
{
/* Print the corresponding single-letter code. */
write_char (integer_type_codes[itk]);
tree types[3];
int i;
+ if (bltn == NULL_TREE)
+ continue;
types[0] = bltn;
types[1] = build_pointer_type (bltn);
types[2] = build_pointer_type (cp_build_qualified_type (bltn,