Re: Code analysis, call graphs for Common Lisp
- From: Eric Marsden <eric.marsden@xxxxxxx>
- Date: Fri, 29 Apr 2005 23:18:50 +0200
>>>>> "dt" == David Trudgett <<wpower@xxxxxxxxxxxxxxxxxxxxxxxx> > writes:
dt> I've been having a bit of a look around for some code to do call
dt> graphs given Common Lisp source code input. One of my purposes is to
dt> find functions that don't get utilised at all (due to code
dt> refactoring, for instance).
dt>
dt> I suspect this sort of analysis might be a difficult task for CL
dt> because of its dynamic nature, macros, and so on and so forth.
I talked about the use of CMUCL's XREF implementation for this kind
of purpose at the 2003 Libre Software Meeting. The slides of the
presentation are at
<URL:http://www.laas.fr/~emarsden/tmp/lsm2003-emarsden.pdf>
The file contrib/stale-symbols.lisp in SBCL's source tree might also
be of marginal interest to you.
<URL:http://cvs.sourceforge.net/viewcvs.py/sbcl/sbcl/contrib/stale-symbols.lisp?rev=1.5&view=auto>
--
Eric Marsden
.
- References:
- Code analysis, call graphs for Common Lisp
- From: David Trudgett
- Code analysis, call graphs for Common Lisp
- Prev by Date: Re: Comparing Lisp conditions to Java Exceptions
- Next by Date: Re: Lisp Thesaurus
- Previous by thread: Re: Code analysis, call graphs for Common Lisp
- Next by thread: Re: Code analysis, call graphs for Common Lisp
- Index(es):
Relevant Pages
|