Re: Making adaptive redzones less aggressive

On Sat, Jul 15, 2017 at 4:39 PM, Yuri Gribov wrote: > 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. > >

Re: Making adaptive redzones less aggressive

On Mon, Jul 17, 2017 at 10:25 AM, 'Alexander Potapenko' via address-sanitizer wrote: > On Sat, Jul 15, 2017 at 4:39 PM, Yuri Gribov wrote: >> Hi all, >> >> From reading the original feature request in >>

Re: Making adaptive redzones less aggressive

I can argue that this heuristic is totally relevant for 'int a[1100]' because lots of scientific code uses single-dimensional arrays as n-dimensional: #define N 100 int a[N * N]; ... a[i * N + j]; // off-by-one in 'i' will lead to off-by-N And no, I did not try to investigate if a better