===================================================================
@@ -13506,10 +13506,12 @@ gimple_canonical_types_compatible_p (con
f1 || f2;
f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
{
- /* Skip non-fields. */
- while (f1 && TREE_CODE (f1) != FIELD_DECL)
+ /* Skip non-fields and zero-sized fields. */
+ while (f1 && (TREE_CODE (f1) != FIELD_DECL
+ || integer_zerop (DECL_SIZE (f1))))
f1 = TREE_CHAIN (f1);
- while (f2 && TREE_CODE (f2) != FIELD_DECL)
+ while (f2 && (TREE_CODE (f2) != FIELD_DECL
+ || integer_zerop (DECL_SIZE (f2))))
f2 = TREE_CHAIN (f2);
if (!f1 || !f2)
break;
===================================================================
@@ -372,7 +372,8 @@ hash_canonical_type (tree type)
tree f;
for (f = TYPE_FIELDS (type), nf = 0; f; f = TREE_CHAIN (f))
- if (TREE_CODE (f) == FIELD_DECL)
+ if (TREE_CODE (f) == FIELD_DECL
+ && ! integer_zerop (DECL_SIZE (f)))
{
iterative_hash_canonical_type (TREE_TYPE (f), hstate);
nf++;
===================================================================
@@ -0,0 +1,12 @@
+// { dg-lto-do link }
+
+extern struct S
+{
+ unsigned i:4;
+ unsigned :0;
+} s;
+static void *f(void)
+{
+ return &s;
+}
+int main() {}
===================================================================
@@ -0,0 +1,9 @@
+struct S
+{
+ unsigned i:4;
+ unsigned :0;
+} s;
+static void *f(void)
+{
+ return &s;
+}