1 .\"     $NetBSD: link.2,v 1.7 1995/02/27 12:34:01 cgd Exp $
 
   3 .\" Copyright (c) 1980, 1991, 1993
 
   4 .\"     The Regents of the University of California.  All rights reserved.
 
   6 .\" Redistribution and use in source and binary forms, with or without
 
   7 .\" modification, are permitted provided that the following conditions
 
   9 .\" 1. Redistributions of source code must retain the above copyright
 
  10 .\"    notice, this list of conditions and the following disclaimer.
 
  11 .\" 2. Redistributions in binary form must reproduce the above copyright
 
  12 .\"    notice, this list of conditions and the following disclaimer in the
 
  13 .\"    documentation and/or other materials provided with the distribution.
 
  14 .\" 3. All advertising materials mentioning features or use of this software
 
  15 .\"    must display the following acknowledgement:
 
  16 .\"     This product includes software developed by the University of
 
  17 .\"     California, Berkeley and its contributors.
 
  18 .\" 4. Neither the name of the University nor the names of its contributors
 
  19 .\"    may be used to endorse or promote products derived from this software
 
  20 .\"    without specific prior written permission.
 
  22 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 
  23 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 
  24 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 
  25 .\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 
  26 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 
  27 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 
  28 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 
  29 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 
  30 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 
  31 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 
  34 .\"     @(#)link.2      8.3 (Berkeley) 1/12/94
 
  41 .Nd make a hard file link
 
  43 .Fd #include <unistd.h>
 
  45 .Fn link "const char *name1" "const char *name2"
 
  50 atomically creates the specified directory entry (hard link)
 
  52 with the attributes of the underlying object pointed at by
 
  54 If the link is successful: the link count of the underlying object
 
  59 share equal access and rights
 
  67 is not deleted and the link count of the
 
  72 must exist for the hard link to
 
  78 must be in the same file system.
 
  79 As mandated by POSIX.1
 
  81 may not be a directory.
 
  83 Upon successful completion, a value of 0 is returned.  Otherwise,
 
  84 a value of -1 is returned and
 
  86 is set to indicate the error.
 
  89 will fail and no link will be created if:
 
  92 A component of either path prefix is not a directory.
 
  93 .It Bq Er ENAMETOOLONG
 
  94 A component of a pathname exceeded 
 
  96 characters, or an entire path name exceeded 
 
 100 A component of either path prefix does not exist.
 
 102 A component of either path prefix denies search permission.
 
 104 The requested link requires writing in a directory with a mode
 
 105 that denies write permission.
 
 107 Too many symbolic links were encountered in translating one of the pathnames.
 
 123 and the file named by
 
 125 are on different file systems.
 
 127 The directory in which the entry for the new link is being placed
 
 128 cannot be extended because there is no space left on the file
 
 129 system containing the directory.
 
 132 The directory in which the entry for the new link
 
 133 is being placed cannot be extended because the
 
 134 user's quota of disk blocks on the file system
 
 135 containing the directory has been exhausted.
 
 137 An I/O error occurred while reading from or writing to 
 
 138 the file system to make the directory entry.
 
 140 The requested link requires writing in a directory on a read-only file
 
 143 One of the pathnames specified
 
 144 is outside the process's allocated address space.
 
 152 function is expected to conform to