Messages in this thread | | | Date | Fri, 13 Nov 2009 13:03:04 -0200 | Subject | Re: [PATCH v4 2/2] bsearch: prevent overflow when computing middle comparison element | From | Thiago Farina <> |
| |
Hi Rusty,
On Thu, Nov 12, 2009 at 11:06 AM, Rusty Russell <rusty@rustcorp.com.au> wrote: > On Wed, 11 Nov 2009 01:30:25 am André Goddard Rosa wrote: >> It's really difficult to occur in practice because the sum of the lower >> and higher limits must overflow an int variable, but it can occur when >> working with large arrays. We'd better safe than sorry by avoiding this >> overflow situation when computing the middle element for comparison. > > I applied all these, after testing. In future would have been nice for you > to have posted a test patch so I didn't have make my own...
Where did you apply this patch? -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |