|
|
1.1 root 1: .\" @(#)ranlib.1 6.2 (Berkeley) 5/3/85
2: .\"
3: .TH RANLIB 1 "May 3, 1985"
4: .AT 3
5: .SH NAME
6: ranlib \- convert archives to random libraries
7: .SH SYNOPSIS
8: .B ranlib
9: [
10: .B \-t
11: ] archive ...
12: .SH DESCRIPTION
13: .I Ranlib
14: converts each
15: .I archive
16: to a form which the loader can load more rapidly.
17: .I Ranlib
18: does this by adding a table of contents called
19: .B __.SYMDEF
20: to the beginning of the archive.
21: .I Ranlib
22: uses
23: .IR ar (1)
24: to reconstruct the archive, so that sufficient temporary file space must
25: be available in the file system which contains the current directory.
26: .PP
27: If given the
28: .B \-t
29: option,
30: ranlib only "touches" the archives and does not modify them.
31: This is useful after copying an archive
32: or using the
33: .B \-t
34: option of
35: .IR make (1)
36: in order to avoid having
37: .IR ld (1)
38: complain about
39: an \*(lqout of date\*(rq symbol table.
40: .SH "SEE ALSO"
41: ld(1), ar(1), lorder(1), make(1)
42: .SH BUGS
43: Because generation of a library by
44: .I ar
45: and randomization of the library by
46: .I ranlib
47: are separate processes, phase errors are possible. The loader,
48: .IR ld ,
49: warns when the modification date of a library is more recent than the
50: creation date of its dictionary; but this means that you get the
51: warning even if you only copy the library.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.