Annotation of 43BSDReno/share/man/man3f/link.3, revision 1.1.1.1

1.1       root        1: .\" Copyright (c) 1983 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: .\"    @(#)link.3f     6.1 (Berkeley) 5/15/85
                      6: .\"
                      7: .TH LINK 3F "May 15, 1985"
                      8: .UC 5
                      9: .SH NAME
                     10: link \- make a link to an existing file
                     11: .SH SYNOPSIS
                     12: .B function link (name1, name2)
                     13: .br
                     14: .B character*(*) name1, name2
                     15: .sp 1
                     16: .B integer function symlnk (name1, name2)
                     17: .br
                     18: .B character*(*) name1, name2
                     19: .SH DESCRIPTION
                     20: .I Name1
                     21: must be the pathname of an existing file.
                     22: .I Name2
                     23: is a pathname to be linked to file
                     24: .IR name1 .
                     25: .I Name2
                     26: must not already exist.
                     27: The returned value will be 0 if successful; a system error code otherwise.
                     28: .PP
                     29: .I Symlnk
                     30: creates a symbolic link to
                     31: .IR name1 .
                     32: .SH FILES
                     33: .ie \nM /usr/ucb/lib/libU77.a
                     34: .el /usr/lib/libU77.a
                     35: .SH "SEE ALSO"
                     36: link(2), symlink(2), perror(3F), unlink(3F)
                     37: .SH BUGS
                     38: Pathnames can be no longer than MAXPATHLEN as defined in
                     39: .RI < sys/param.h >.

unix.superglobalmegacorp.com

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