>
> On Sun, Jun 09, 2002 at 08:56:30PM -0700, Dawson Engler wrote:
> > Here are 37 errors where variables >= 1024 bytes are allocated on a function's
> > stack.
>
> Is it possible to get checker to determine the stack depth of a worst
> case call chain (excluding interrupts)? I've found that deep call chains
> are far more likely to cause stack overflows than short and bounded paths.
Yeah, it's not that hard. The main problem is determining if recursive
loops are feasible. I'd released bugs from it before, but no one fixed any
so hadn't rerun it since.
-
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/
This archive was generated by hypermail 2b29 : Sat Jun 15 2002 - 22:00:27 EST