Hi all,
>From reading the original feature request in
https://github.com/google/sanitizers/issues/8 it seems that adaptive
redzones were mainly meant for catching overflows in arrays of large
objects e.g.
struct {
int a[10];
int x;
} a[100];
a[101].x = 0; // Skips redzone
Current adaptation only considers size of array as a whole so would
add similarly big redzone for same-sized
int a[1100];
even though risk of large overflow offset here seems to be much lower.
Has anyone considered selecting redzone based on array element size
rather than array size? Firstly this would allow more intelligent
redzone selection (current approach does not guarantee that generated
redzone will cover one array element) and also reduce memory pressure
(which is important for "embedded" targets).
-Y
--
You received this message because you are subscribed to the Google Groups
"address-sanitizer" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
