1 .\" Copyright (c) 1983, 1991 The Regents of the University of California.
2 .\" All rights reserved.
4 .\" %%%LICENSE_START(BSD_4_CLAUSE_UCB)
5 .\" Redistribution and use in source and binary forms, with or without
6 .\" modification, are permitted provided that the following conditions
8 .\" 1. Redistributions of source code must retain the above copyright
9 .\" notice, this list of conditions and the following disclaimer.
10 .\" 2. Redistributions in binary form must reproduce the above copyright
11 .\" notice, this list of conditions and the following disclaimer in the
12 .\" documentation and/or other materials provided with the distribution.
13 .\" 3. All advertising materials mentioning features or use of this software
14 .\" must display the following acknowledgement:
15 .\" This product includes software developed by the University of
16 .\" California, Berkeley and its contributors.
17 .\" 4. Neither the name of the University nor the names of its contributors
18 .\" may be used to endorse or promote products derived from this software
19 .\" without specific prior written permission.
21 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 .\" @(#)getpeername.2 6.5 (Berkeley) 3/10/91
36 .\" Modified Sat Jul 24 16:37:50 1993 by Rik Faith <faith@cs.unc.edu>
37 .\" Modified Thu Jul 30 14:37:50 1993 by Martin Schulze <joey@debian.org>
38 .\" Modified Sun Mar 28 21:26:46 1999 by Andries Brouwer <aeb@cwi.nl>
39 .\" Modified 17 Jul 2002, Michael Kerrisk <mtk.manpages@gmail.com>
40 .\" Added 'socket' to NAME, so that "man -k socket" will show this page.
42 .TH GETPEERNAME 2 2017-09-15 "Linux" "Linux Programmer's Manual"
44 getpeername \- get name of connected peer socket
46 .B #include <sys/socket.h>
48 .BI "int getpeername(int " sockfd ", struct sockaddr *" addr \
49 ", socklen_t *" addrlen );
52 returns the address of the peer connected to the socket
54 in the buffer pointed to by
58 argument should be initialized to indicate the amount of space pointed to
61 On return it contains the actual size of the name returned (in bytes).
62 The name is truncated if the buffer provided is too small.
64 The returned address is truncated if the buffer provided is too small;
67 will return a value greater than was supplied to the call.
69 On success, zero is returned.
70 On error, \-1 is returned, and
78 is not a valid file descriptor.
83 argument points to memory not in a valid part of the
84 process address space.
88 is invalid (e.g., is negative).
91 Insufficient resources were available in the system
92 to perform the operation.
95 The socket is not connected.
100 does not refer to a socket.
102 POSIX.1-2001, POSIX.1-2008, SVr4, 4.4BSD
104 first appeared in 4.2BSD).
106 For background on the
111 For stream sockets, once a
113 has been performed, either socket can call
115 to obtain the address of the peer socket.
116 On the other hand, datagram sockets are connectionless.
119 on a datagram socket merely sets the peer address for outgoing
128 to obtain the peer address that it earlier set for the socket.
129 However, the peer socket is unaware of this information, and calling
131 on the peer socket will return no useful information (unless a
133 call was also executed on the peer).
134 Note also that the receiver of a datagram can obtain
135 the address of the sender when using