Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!lll-winken!uunet!mcvax!ukc!acorn!moncam!paul From: paul@moncam.co.uk (Paul Hudson) Newsgroups: comp.lang.c Subject: Re: 2 lint questions Message-ID: Date: 31 Jul 89 11:46:16 GMT References: <5967@ingr.com> <18796@mimsy.UUCP> Sender: paul@moncam.co.uk Organization: Monotype ADG, Cambridge, UK. Lines: 20 In-reply-to: chris@mimsy.UUCP's message of 28 Jul 89 12:25:13 GMT In article <18796@mimsy.UUCP> chris@mimsy.UUCP (Chris Torek) writes: >2) Is there any way to get lint to detect a closed loop of code which can >never be called? Lint would need to do call graph analysis to find these; I have never seen one that does. -- In-Real-Life: Chris Torek, Univ of MD Comp Sci Dept (+1 301 454 7163) Domain: chris@mimsy.umd.edu Path: uunet!mimsy!chris Don't hold your breath - determining whether code is reachable is equivalent to the halting problem. Lint takes long enough already - infinite time seems a little over-the-top. -- Paul Hudson MAIL: Monotype ADG, Science Park, Cambridge, CB4 4FQ, UK. PHONE: +44 (223) 420018 EMAIL: paul@moncam.co.uk, ;" FAX: +44 (223) 420911 ...!ukc!acorn!moncam!paul `"";";" These opinions void where prohibited by law.