1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include <config.h>
35b528cefcSMark Murray
36c19800e8SDoug Rabson #include "roken.h"
37b528cefcSMark Murray
38b528cefcSMark Murray /*
39b528cefcSMark Murray * Like read but never return partial data.
40b528cefcSMark Murray */
41b528cefcSMark Murray
42*ae771770SStanislav Sedov #ifndef _WIN32
43*ae771770SStanislav Sedov
44*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
net_read(rk_socket_t fd,void * buf,size_t nbytes)45*ae771770SStanislav Sedov net_read (rk_socket_t fd, void *buf, size_t nbytes)
46b528cefcSMark Murray {
47b528cefcSMark Murray char *cbuf = (char *)buf;
48b528cefcSMark Murray ssize_t count;
49b528cefcSMark Murray size_t rem = nbytes;
50b528cefcSMark Murray
51b528cefcSMark Murray while (rem > 0) {
52b528cefcSMark Murray count = read (fd, cbuf, rem);
53b528cefcSMark Murray if (count < 0) {
54b528cefcSMark Murray if (errno == EINTR)
55b528cefcSMark Murray continue;
56b528cefcSMark Murray else
57b528cefcSMark Murray return count;
58b528cefcSMark Murray } else if (count == 0) {
59b528cefcSMark Murray return count;
60b528cefcSMark Murray }
61b528cefcSMark Murray cbuf += count;
62b528cefcSMark Murray rem -= count;
63b528cefcSMark Murray }
64b528cefcSMark Murray return nbytes;
65b528cefcSMark Murray }
66*ae771770SStanislav Sedov
67*ae771770SStanislav Sedov #else
68*ae771770SStanislav Sedov
69*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
net_read(rk_socket_t sock,void * buf,size_t nbytes)70*ae771770SStanislav Sedov net_read(rk_socket_t sock, void *buf, size_t nbytes)
71*ae771770SStanislav Sedov {
72*ae771770SStanislav Sedov char *cbuf = (char *)buf;
73*ae771770SStanislav Sedov ssize_t count;
74*ae771770SStanislav Sedov size_t rem = nbytes;
75*ae771770SStanislav Sedov
76*ae771770SStanislav Sedov #ifdef SOCKET_IS_NOT_AN_FD
77*ae771770SStanislav Sedov int use_read = 0;
78*ae771770SStanislav Sedov #endif
79*ae771770SStanislav Sedov
80*ae771770SStanislav Sedov while (rem > 0) {
81*ae771770SStanislav Sedov #ifdef SOCKET_IS_NOT_AN_FD
82*ae771770SStanislav Sedov if (use_read)
83*ae771770SStanislav Sedov count = _read (sock, cbuf, rem);
84*ae771770SStanislav Sedov else
85*ae771770SStanislav Sedov count = recv (sock, cbuf, rem, 0);
86*ae771770SStanislav Sedov
87*ae771770SStanislav Sedov if (use_read == 0 &&
88*ae771770SStanislav Sedov rk_IS_SOCKET_ERROR(count) &&
89*ae771770SStanislav Sedov (rk_SOCK_ERRNO == WSANOTINITIALISED ||
90*ae771770SStanislav Sedov rk_SOCK_ERRNO == WSAENOTSOCK)) {
91*ae771770SStanislav Sedov use_read = 1;
92*ae771770SStanislav Sedov
93*ae771770SStanislav Sedov count = _read (sock, cbuf, rem);
94*ae771770SStanislav Sedov }
95*ae771770SStanislav Sedov #else
96*ae771770SStanislav Sedov count = recv (sock, cbuf, rem, 0);
97*ae771770SStanislav Sedov #endif
98*ae771770SStanislav Sedov if (count < 0) {
99*ae771770SStanislav Sedov
100*ae771770SStanislav Sedov /* With WinSock, the error EINTR (WSAEINTR), is used to
101*ae771770SStanislav Sedov indicate that a blocking call was cancelled using
102*ae771770SStanislav Sedov WSACancelBlockingCall(). */
103*ae771770SStanislav Sedov
104*ae771770SStanislav Sedov #ifndef HAVE_WINSOCK
105*ae771770SStanislav Sedov if (rk_SOCK_ERRNO == EINTR)
106*ae771770SStanislav Sedov continue;
107*ae771770SStanislav Sedov #endif
108*ae771770SStanislav Sedov return count;
109*ae771770SStanislav Sedov } else if (count == 0) {
110*ae771770SStanislav Sedov return count;
111*ae771770SStanislav Sedov }
112*ae771770SStanislav Sedov cbuf += count;
113*ae771770SStanislav Sedov rem -= count;
114*ae771770SStanislav Sedov }
115*ae771770SStanislav Sedov return nbytes;
116*ae771770SStanislav Sedov }
117*ae771770SStanislav Sedov
118*ae771770SStanislav Sedov #endif
119