[lkml]   [2001]   [Jun]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [PATCH] fs/devfs/base.c
    Followup to:  <>
    By author: Bill Pringlemeir <>
    In newsgroup:
    > 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!

    <> at work, <> in private!
    "Unix gives you enough rope to shoot yourself in the foot."
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to
    More majordomo info at
    Please read the FAQ at

     \ /
      Last update: 2005-03-22 12:54    [W:0.020 / U:3.116 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site