Return to lxref.1 CVS log

Up to [CSRG BSD Unix] / 43BSDReno / pgrm / lisp / man

BSD 4.3reno

.\" Copyright (c) 1980, 1990 Regents of the University of California.
.\" All rights reserved.  The Berkeley software License Agreement
.\" specifies the terms and conditions for redistribution.
.\"
.\"		@(#)lxref.1	6.2 (Berkeley) 6/24/90
.\"
.TH LXREF 1 "%Q"
.UC 4
.SH NAME
lxref \- lisp cross reference program
.SH SYNOPSIS
.B lxref
[
.B \-N
] xref-file ...
[ 
.B \-a 
source-file ... ]
.SH DESCRIPTION
.I Lxref
reads cross reference file(s) written by the lisp compiler 
.I liszt
and prints a cross reference listing on the standard output.
.I Liszt
will create a cross reference file during compilation when it is 
given the
.B \-x
switch.
Cross reference files usually end in `.x' and consequently
.I lxref
will append a `.x' to the file names given if necessary.
The first option to 
.I lxref
is a decimal integer, N, which sets the 
.I ignorelevel.
If a function is called more than 
.I ignorelevel 
times, the cross reference listing will just print the number of calls 
instead of listing each one of them.
The default for
.I ignorelevel 
is 50.
.PP
The 
.B \-a
option causes 
.I lxref
to put limited cross reference information in the sources named.
.I lxref
will scan the source and when it comes across a definition of a function
(that is a line beginning with 
.I "`(def'"
it will preceed that line with a list of the functions which call this 
function, written as a comment preceeded by 
.I "`;.. '".
All existing lines beginning with
.I "`;.. '"
will be removed from the file.
If the source file contains a line beginning
.I "`;.-'"
then this will disable this annotation process from this point on until a 
.I "`;.+'"
is seen (however, lines beginning with 
.I "`;.. '"
will continue to be deleted).
After the annoation is done, the original file
.I "`foo.l'"
is renamed to
.I `#.foo.l'"
and the new file with annotation is named 
.I "`foo.l'"
.SH AUTHOR
John Foderaro
.SH SEE ALSO
lisp(1),
liszt(1)
.SH BUGS

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.