Return to lxref.1 CVS log

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

Annotation of 43BSDReno/pgrm/lisp/man/lxref.1, revision 1.1

1.1     ! root        1: .\" Copyright (c) 1980, 1990 Regents of the University of California.
        !             2: .\" All rights reserved.  The Berkeley software License Agreement
        !             3: .\" specifies the terms and conditions for redistribution.
        !             4: .\"
        !             5: .\"            @(#)lxref.1     6.2 (Berkeley) 6/24/90
        !             6: .\"
        !             7: .TH LXREF 1 "%Q"
        !             8: .UC 4
        !             9: .SH NAME
        !            10: lxref \- lisp cross reference program
        !            11: .SH SYNOPSIS
        !            12: .B lxref
        !            13: [
        !            14: .B \-N
        !            15: ] xref-file ...
        !            16: [ 
        !            17: .B \-a 
        !            18: source-file ... ]
        !            19: .SH DESCRIPTION
        !            20: .I Lxref
        !            21: reads cross reference file(s) written by the lisp compiler 
        !            22: .I liszt
        !            23: and prints a cross reference listing on the standard output.
        !            24: .I Liszt
        !            25: will create a cross reference file during compilation when it is 
        !            26: given the
        !            27: .B \-x
        !            28: switch.
        !            29: Cross reference files usually end in `.x' and consequently
        !            30: .I lxref
        !            31: will append a `.x' to the file names given if necessary.
        !            32: The first option to 
        !            33: .I lxref
        !            34: is a decimal integer, N, which sets the 
        !            35: .I ignorelevel.
        !            36: If a function is called more than 
        !            37: .I ignorelevel 
        !            38: times, the cross reference listing will just print the number of calls 
        !            39: instead of listing each one of them.
        !            40: The default for
        !            41: .I ignorelevel 
        !            42: is 50.
        !            43: .PP
        !            44: The 
        !            45: .B \-a
        !            46: option causes 
        !            47: .I lxref
        !            48: to put limited cross reference information in the sources named.
        !            49: .I lxref
        !            50: will scan the source and when it comes across a definition of a function
        !            51: (that is a line beginning with 
        !            52: .I "`(def'"
        !            53: it will preceed that line with a list of the functions which call this 
        !            54: function, written as a comment preceeded by 
        !            55: .I "`;.. '".
        !            56: All existing lines beginning with
        !            57: .I "`;.. '"
        !            58: will be removed from the file.
        !            59: If the source file contains a line beginning
        !            60: .I "`;.-'"
        !            61: then this will disable this annotation process from this point on until a 
        !            62: .I "`;.+'"
        !            63: is seen (however, lines beginning with 
        !            64: .I "`;.. '"
        !            65: will continue to be deleted).
        !            66: After the annoation is done, the original file
        !            67: .I "`foo.l'"
        !            68: is renamed to
        !            69: .I `#.foo.l'"
        !            70: and the new file with annotation is named 
        !            71: .I "`foo.l'"
        !            72: .SH AUTHOR
        !            73: John Foderaro
        !            74: .SH SEE ALSO
        !            75: lisp(1),
        !            76: liszt(1)
        !            77: .SH BUGS

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