Followup to: <[EMAIL PROTECTED]>
By author: Bill Pringlemeir <[EMAIL PROTECTED]>
In newsgroup: linux.dev.kernel
>
> There was a discussion on comp.arch.embedded about bounded stack use.
> It is fairly easy to calculate the stack usage for call trees, but
> much more difficult for `DAGs'. Ie, a recursive functions etc.
>
It's trivial to calculate for DAGs -- directed acyclic graphs. It's
when the "acyclic" constraint is violated that you have problems!
-hpa
--
<[EMAIL PROTECTED]> at work, <[EMAIL PROTECTED]> in private!
"Unix gives you enough rope to shoot yourself in the foot."
http://www.zytor.com/~hpa/puzzle.txt
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
