From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id ; Tue, 5 Jun 2001 02:11:12 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id ; Tue, 5 Jun 2001 02:10:53 -0400 Received: from neon-gw.transmeta.com ([209.10.217.66]:46858 "EHLO neon-gw.transmeta.com") by vger.kernel.org with ESMTP id ; Tue, 5 Jun 2001 02:10:48 -0400 To: linux-kernel@vger.kernel.org From: "H. Peter Anvin" Subject: Re: [PATCH] fs/devfs/base.c Date: 4 Jun 2001 23:10:27 -0700 Organization: Transmeta Corporation, Santa Clara CA Message-ID: <9fht4j$cce$1@cesium.transmeta.com> In-Reply-To: <200106040707.f5477ET11421@vindaloo.ras.ucalgary.ca> MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7BIT Disclaimer: Not speaking for Transmeta in any way, shape, or form. Copyright: Copyright 2001 H. Peter Anvin - All Rights Reserved Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org Followup to: By author: Bill Pringlemeir 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 -- at work, in private! "Unix gives you enough rope to shoot yourself in the foot." http://www.zytor.com/~hpa/puzzle.txt