#endif
}
+void
+__attribute__ ((noinline))
+test10 (void)
+{
+ static char buf[255];
+ unsigned int i, len = sizeof (buf);
+ char *p = buf;
+
+ for (i = 0 ; i < sizeof (buf) ; i++)
+ {
+ if (len < 2)
+ {
+#ifdef __builtin_object_size
+ if (__builtin_object_size (p - 3, 0) != sizeof (buf) - i + 3)
+ abort ();
+#else
+ if (__builtin_object_size (p - 3, 0) != sizeof (buf))
+ abort ();
+#endif
+ break;
+ }
+ p++;
+ len--;
+ }
+}
+
int
main (void)
{
test7 ();
test8 ();
test9 (1);
+ test10 ();
exit (0);
}
if (__builtin_object_size (&p[-4], 2) != (cond ? 6 : 10))
abort ();
#else
- if (__builtin_object_size (&p[-4], 2) != 6)
+ if (__builtin_object_size (&p[-4], 2) != 0)
abort ();
#endif
if (__builtin_object_size (p, 2) != ((cond ? 2 : 6) + cond))
abort ();
#else
- if (__builtin_object_size (p, 2) != 2)
+ if (__builtin_object_size (p, 2) != 0)
abort ();
#endif
!= sizeof (y) - __builtin_offsetof (struct A, c) - 8 + cond)
abort ();
#else
- if (__builtin_object_size (p, 2)
- != sizeof (y) - __builtin_offsetof (struct A, c) - 8)
+ if (__builtin_object_size (p, 2) != 0)
abort ();
#endif
}
+void
+__attribute__ ((noinline))
+test10 (void)
+{
+ static char buf[255];
+ unsigned int i, len = sizeof (buf);
+ char *p = buf;
+
+ for (i = 0 ; i < sizeof (buf) ; i++)
+ {
+ if (len < 2)
+ {
+#ifdef __builtin_object_size
+ if (__builtin_object_size (p - 3, 2) != sizeof (buf) - i + 3)
+ abort ();
+#else
+ if (__builtin_object_size (p - 3, 2) != 0)
+ abort ();
+#endif
+ break;
+ }
+ p++;
+ len--;
+ }
+}
+
int
main (void)
{
test7 ();
test8 ();
test9 (1);
+ test10 ();
exit (0);
}
if (__builtin_object_size (&p[-4], 3) != (cond ? 6 : 10))
abort ();
#else
- if (__builtin_object_size (&p[-4], 3) != 6)
+ if (__builtin_object_size (&p[-4], 3) != 0)
abort ();
#endif
if (__builtin_object_size (p, 3) != ((cond ? 2 : 6) + cond))
abort ();
#else
- if (__builtin_object_size (p, 3) != 2)
+ if (__builtin_object_size (p, 3) != 0)
abort ();
#endif
if (__builtin_object_size (p, 3) != sizeof (y.c) - 8 + cond)
abort ();
#else
- if (__builtin_object_size (p, 3) != sizeof (y.c) - 8)
+ if (__builtin_object_size (p, 3) != 0)
abort ();
#endif
}
abort ();
}
+#ifdef __builtin_object_size
void
test7 (void)
{
if (__builtin_object_size (p + 2, 0) != 0)
abort ();
}
+#endif
/* { dg-final { scan-assembler-not "abort" } } */
ptr = gimple_assign_rhs1 (def);
if (((object_size_type & OST_DYNAMIC)
- || tree_fits_shwi_p (offset))
+ || (tree_fits_shwi_p (offset)
+ && compare_tree_int (offset, offset_limit) <= 0))
&& compute_builtin_object_size (ptr, object_size_type,
psize))
{
/* size_for_offset doesn't make sense for -1 size, but it does for size 0
since the wholesize could be non-zero and a negative offset could give
a non-zero size. */
- if (!size_unknown_p (bytes, 0))
+ if (size_unknown_p (bytes, 0))
+ ;
+ else if ((object_size_type & OST_DYNAMIC)
+ || compare_tree_int (op1, offset_limit) <= 0)
bytes = size_for_offset (bytes, op1, wholesize);
+ /* In the static case, with a negative offset, the best estimate for
+ minimum size is size_unknown but for maximum size, the wholesize is a
+ better estimate than size_unknown. */
+ else if (object_size_type & OST_MINIMUM)
+ bytes = size_unknown (object_size_type);
+ else
+ bytes = wholesize;
}
else
bytes = wholesize = size_unknown (object_size_type);