blob: 4dc1c7a6def6b83c24e2e892b8279d293fe330d3 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreauf7bc57c2012-10-03 00:19:48 +02002 * RAW transport layer over SOCK_STREAM sockets.
Willy Tarreaubaaee002006-06-26 02:48:02 +02003 *
Willy Tarreaub277d6e2012-05-11 16:59:14 +02004 * Copyright 2000-2012 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau6b4aad42009-01-18 21:59:13 +010013#define _GNU_SOURCE
Willy Tarreaubaaee002006-06-26 02:48:02 +020014#include <errno.h>
15#include <fcntl.h>
16#include <stdio.h>
17#include <stdlib.h>
18
19#include <sys/socket.h>
20#include <sys/stat.h>
21#include <sys/types.h>
22
Dmitry Sivachenkocaf58982009-08-24 15:11:06 +040023#include <netinet/tcp.h>
24
Willy Tarreauc7e42382012-08-24 19:22:53 +020025#include <common/buffer.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020026#include <common/compat.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020027#include <common/config.h>
Willy Tarreaud6f087e2008-01-18 17:20:13 +010028#include <common/debug.h>
Willy Tarreau83749182007-04-15 20:56:27 +020029#include <common/standard.h>
Willy Tarreau0c303ee2008-07-07 00:09:58 +020030#include <common/ticks.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020031#include <common/time.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020032
Willy Tarreau8b117082012-08-06 15:06:49 +020033#include <proto/connection.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020034#include <proto/fd.h>
Willy Tarreaueb472682010-05-28 18:46:57 +020035#include <proto/freq_ctr.h>
36#include <proto/log.h>
Willy Tarreau3eba98a2009-01-25 13:56:13 +010037#include <proto/pipe.h>
Willy Tarreau75bf2c92012-08-20 17:01:35 +020038#include <proto/raw_sock.h>
Willy Tarreau73b013b2012-05-21 16:31:45 +020039#include <proto/stream_interface.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020040#include <proto/task.h>
41
Willy Tarreau5bd8c372009-01-19 00:32:22 +010042#include <types/global.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020043
Willy Tarreaub277d6e2012-05-11 16:59:14 +020044
Willy Tarreau96199b12012-08-24 00:46:52 +020045#if defined(CONFIG_HAP_LINUX_SPLICE)
Willy Tarreau43d8fb22011-08-22 17:12:02 +020046#include <common/splice.h>
Willy Tarreau5bd8c372009-01-19 00:32:22 +010047
48/* A pipe contains 16 segments max, and it's common to see segments of 1448 bytes
49 * because of timestamps. Use this as a hint for not looping on splice().
50 */
51#define SPLICE_FULL_HINT 16*1448
52
Willy Tarreaua9de3332009-11-28 07:47:10 +010053/* how many data we attempt to splice at once when the buffer is configured for
54 * infinite forwarding */
55#define MAX_SPLICE_AT_ONCE (1<<30)
56
Willy Tarreaub6daedd2013-01-07 16:57:09 +010057/* Versions of splice between 2.6.25 and 2.6.27.12 were bogus and would return EAGAIN
58 * on incoming shutdowns. On these versions, we have to call recv() after such a return
59 * in order to find whether splice is OK or not. Since 2.6.27.13 we don't need to do
60 * this anymore, and we can avoid this logic by defining ASSUME_SPLICE_WORKS.
61 */
62
Willy Tarreau5bd8c372009-01-19 00:32:22 +010063/* Returns :
Willy Tarreau96199b12012-08-24 00:46:52 +020064 * -1 if splice() is not supported
65 * >= 0 to report the amount of spliced bytes.
66 * connection flags are updated (error, read0, wait_room, wait_data).
67 * The caller must have previously allocated the pipe.
Willy Tarreau5bd8c372009-01-19 00:32:22 +010068 */
Willy Tarreau96199b12012-08-24 00:46:52 +020069int raw_sock_to_pipe(struct connection *conn, struct pipe *pipe, unsigned int count)
Willy Tarreau5bd8c372009-01-19 00:32:22 +010070{
Willy Tarreaub6daedd2013-01-07 16:57:09 +010071#ifndef ASSUME_SPLICE_WORKS
Willy Tarreau82a04562011-12-11 22:37:06 +010072 static int splice_detects_close;
Willy Tarreaub6daedd2013-01-07 16:57:09 +010073#endif
Willy Tarreau31971e52009-09-20 12:07:52 +020074 int ret;
Willy Tarreauafad0e02012-08-09 14:45:22 +020075 int retval = 0;
Willy Tarreau5bd8c372009-01-19 00:32:22 +010076
Willy Tarreauf79c8172013-10-21 16:30:56 +020077
78 if (!(conn->flags & CO_FL_CTRL_READY))
79 return 0;
80
Willy Tarreauce3eda72013-12-05 00:49:40 +010081 errno = 0;
82
Willy Tarreau96199b12012-08-24 00:46:52 +020083 /* Under Linux, if FD_POLL_HUP is set, we have reached the end.
84 * Since older splice() implementations were buggy and returned
85 * EAGAIN on end of read, let's bypass the call to splice() now.
86 */
Willy Tarreau6f5d1412012-10-04 20:38:49 +020087 if (unlikely(!(fdtab[conn->t.sock.fd].ev & FD_POLL_IN))) {
88 /* stop here if we reached the end of data */
89 if ((fdtab[conn->t.sock.fd].ev & (FD_POLL_ERR|FD_POLL_HUP)) == FD_POLL_HUP)
90 goto out_read0;
91
92 /* report error on POLL_ERR before connection establishment */
93 if ((fdtab[conn->t.sock.fd].ev & FD_POLL_ERR) && (conn->flags & CO_FL_WAIT_L4_CONN)) {
Willy Tarreau26f4a042013-12-04 23:44:10 +010094 conn->flags |= CO_FL_ERROR | CO_FL_SOCK_RD_SH | CO_FL_SOCK_WR_SH;
Willy Tarreauce3eda72013-12-05 00:49:40 +010095 errno = 0; /* let the caller do a getsockopt() if it wants it */
Willy Tarreau6f5d1412012-10-04 20:38:49 +020096 return retval;
97 }
98 }
Willy Tarreaua9de3332009-11-28 07:47:10 +010099
Willy Tarreau96199b12012-08-24 00:46:52 +0200100 while (count) {
101 if (count > MAX_SPLICE_AT_ONCE)
102 count = MAX_SPLICE_AT_ONCE;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100103
Willy Tarreau96199b12012-08-24 00:46:52 +0200104 ret = splice(conn->t.sock.fd, NULL, pipe->prod, NULL, count,
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100105 SPLICE_F_MOVE|SPLICE_F_NONBLOCK);
106
107 if (ret <= 0) {
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100108 if (ret == 0) {
Willy Tarreau98b306b2009-01-25 11:11:32 +0100109 /* connection closed. This is only detected by
Willy Tarreau82a04562011-12-11 22:37:06 +0100110 * recent kernels (>= 2.6.27.13). If we notice
111 * it works, we store the info for later use.
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100112 */
Willy Tarreaub6daedd2013-01-07 16:57:09 +0100113#ifndef ASSUME_SPLICE_WORKS
Willy Tarreau82a04562011-12-11 22:37:06 +0100114 splice_detects_close = 1;
Willy Tarreaub6daedd2013-01-07 16:57:09 +0100115#endif
Willy Tarreau96199b12012-08-24 00:46:52 +0200116 goto out_read0;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100117 }
118
119 if (errno == EAGAIN) {
120 /* there are two reasons for EAGAIN :
121 * - nothing in the socket buffer (standard)
122 * - pipe is full
Willy Tarreau98b306b2009-01-25 11:11:32 +0100123 * - the connection is closed (kernel < 2.6.27.13)
Willy Tarreau96199b12012-08-24 00:46:52 +0200124 * The last case is annoying but know if we can detect it
125 * and if we can't then we rely on the call to recv() to
126 * get a valid verdict. The difference between the first
127 * two situations is problematic. Since we don't know if
128 * the pipe is full, we'll stop if the pipe is not empty.
129 * Anyway, we will almost always fill/empty the pipe.
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100130 */
Willy Tarreau96199b12012-08-24 00:46:52 +0200131 if (pipe->data) {
132 /* alway stop reading until the pipe is flushed */
133 conn->flags |= CO_FL_WAIT_ROOM;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100134 break;
135 }
136
Willy Tarreau82a04562011-12-11 22:37:06 +0100137 /* We don't know if the connection was closed,
138 * but if we know splice detects close, then we
139 * know it for sure.
Willy Tarreau98b306b2009-01-25 11:11:32 +0100140 * But if we're called upon POLLIN with an empty
Willy Tarreau82a04562011-12-11 22:37:06 +0100141 * pipe and get EAGAIN, it is suspect enough to
Willy Tarreau98b306b2009-01-25 11:11:32 +0100142 * try to fall back to the normal recv scheme
143 * which will be able to deal with the situation.
144 */
Willy Tarreaub6daedd2013-01-07 16:57:09 +0100145#ifndef ASSUME_SPLICE_WORKS
Willy Tarreau82a04562011-12-11 22:37:06 +0100146 if (splice_detects_close)
Willy Tarreaub6daedd2013-01-07 16:57:09 +0100147#endif
Willy Tarreau56a77e52012-09-02 18:34:44 +0200148 __conn_data_poll_recv(conn); /* we know for sure that it's EAGAIN */
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100149 break;
150 }
Willy Tarreau45b88932012-11-12 12:00:09 +0100151 else if (errno == ENOSYS || errno == EINVAL || errno == EBADF) {
Willy Tarreau96199b12012-08-24 00:46:52 +0200152 /* splice not supported on this end, disable it.
153 * We can safely return -1 since there is no
154 * chance that any data has been piped yet.
155 */
Willy Tarreaudc340a92009-06-28 23:10:19 +0200156 return -1;
157 }
Willy Tarreau96199b12012-08-24 00:46:52 +0200158 else if (errno == EINTR) {
159 /* try again */
160 continue;
161 }
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100162 /* here we have another error */
Willy Tarreau96199b12012-08-24 00:46:52 +0200163 conn->flags |= CO_FL_ERROR;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100164 break;
165 } /* ret <= 0 */
166
Willy Tarreau96199b12012-08-24 00:46:52 +0200167 retval += ret;
168 pipe->data += ret;
Willy Tarreau4fc90ef2013-04-06 11:29:39 +0200169 count -= ret;
Willy Tarreaubaf2a502013-01-07 16:38:26 +0100170
Willy Tarreau96199b12012-08-24 00:46:52 +0200171 if (pipe->data >= SPLICE_FULL_HINT || ret >= global.tune.recv_enough) {
172 /* We've read enough of it for this time, let's stop before
173 * being asked to poll.
174 */
Willy Tarreau61d39a02013-07-18 21:49:32 +0200175 conn->flags |= CO_FL_WAIT_ROOM;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100176 break;
177 }
178 } /* while */
179
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200180 if (unlikely(conn->flags & CO_FL_WAIT_L4_CONN) && retval)
181 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreau96199b12012-08-24 00:46:52 +0200182 return retval;
Willy Tarreau3eba98a2009-01-25 13:56:13 +0100183
Willy Tarreau96199b12012-08-24 00:46:52 +0200184 out_read0:
185 conn_sock_read0(conn);
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200186 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100187 return retval;
188}
189
Willy Tarreau96199b12012-08-24 00:46:52 +0200190/* Send as many bytes as possible from the pipe to the connection's socket.
191 */
192int raw_sock_from_pipe(struct connection *conn, struct pipe *pipe)
193{
194 int ret, done;
195
Willy Tarreauf79c8172013-10-21 16:30:56 +0200196 if (!(conn->flags & CO_FL_CTRL_READY))
197 return 0;
198
Willy Tarreau96199b12012-08-24 00:46:52 +0200199 done = 0;
200 while (pipe->data) {
201 ret = splice(pipe->cons, NULL, conn->t.sock.fd, NULL, pipe->data,
202 SPLICE_F_MOVE|SPLICE_F_NONBLOCK);
203
204 if (ret <= 0) {
205 if (ret == 0 || errno == EAGAIN) {
Willy Tarreau56a77e52012-09-02 18:34:44 +0200206 __conn_data_poll_send(conn);
Willy Tarreau96199b12012-08-24 00:46:52 +0200207 break;
208 }
209 else if (errno == EINTR)
210 continue;
211
212 /* here we have another error */
213 conn->flags |= CO_FL_ERROR;
214 break;
215 }
216
217 done += ret;
218 pipe->data -= ret;
219 }
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200220 if (unlikely(conn->flags & CO_FL_WAIT_L4_CONN) && done)
221 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreau96199b12012-08-24 00:46:52 +0200222 return done;
223}
224
Willy Tarreau6b4aad42009-01-18 21:59:13 +0100225#endif /* CONFIG_HAP_LINUX_SPLICE */
226
227
Willy Tarreau2ba44652012-08-20 17:30:32 +0200228/* Receive up to <count> bytes from connection <conn>'s socket and store them
229 * into buffer <buf>. The caller must ensure that <count> is always smaller
230 * than the buffer's size. Only one call to recv() is performed, unless the
231 * buffer wraps, in which case a second call may be performed. The connection's
232 * flags are updated with whatever special event is detected (error, read0,
233 * empty). The caller is responsible for taking care of those events and
234 * avoiding the call if inappropriate. The function does not call the
235 * connection's polling update function, so the caller is responsible for this.
Willy Tarreauce3eda72013-12-05 00:49:40 +0100236 * errno is cleared before starting so that the caller knows that if it spots an
237 * error without errno, it's pending and can be retrieved via getsockopt(SO_ERROR).
Willy Tarreau2ba44652012-08-20 17:30:32 +0200238 */
239static int raw_sock_to_buf(struct connection *conn, struct buffer *buf, int count)
240{
241 int ret, done = 0;
242 int try = count;
243
Willy Tarreauf79c8172013-10-21 16:30:56 +0200244 if (!(conn->flags & CO_FL_CTRL_READY))
245 return 0;
246
Willy Tarreauce3eda72013-12-05 00:49:40 +0100247 errno = 0;
248
Willy Tarreau6f5d1412012-10-04 20:38:49 +0200249 if (unlikely(!(fdtab[conn->t.sock.fd].ev & FD_POLL_IN))) {
250 /* stop here if we reached the end of data */
251 if ((fdtab[conn->t.sock.fd].ev & (FD_POLL_ERR|FD_POLL_HUP)) == FD_POLL_HUP)
252 goto read0;
253
254 /* report error on POLL_ERR before connection establishment */
255 if ((fdtab[conn->t.sock.fd].ev & FD_POLL_ERR) && (conn->flags & CO_FL_WAIT_L4_CONN)) {
Willy Tarreau26f4a042013-12-04 23:44:10 +0100256 conn->flags |= CO_FL_ERROR | CO_FL_SOCK_RD_SH | CO_FL_SOCK_WR_SH;
Willy Tarreau6f5d1412012-10-04 20:38:49 +0200257 return done;
258 }
259 }
Willy Tarreau2ba44652012-08-20 17:30:32 +0200260
261 /* compute the maximum block size we can read at once. */
262 if (buffer_empty(buf)) {
263 /* let's realign the buffer to optimize I/O */
264 buf->p = buf->data;
265 }
266 else if (buf->data + buf->o < buf->p &&
267 buf->p + buf->i < buf->data + buf->size) {
268 /* remaining space wraps at the end, with a moving limit */
269 if (try > buf->data + buf->size - (buf->p + buf->i))
270 try = buf->data + buf->size - (buf->p + buf->i);
271 }
272
273 /* read the largest possible block. For this, we perform only one call
274 * to recv() unless the buffer wraps and we exactly fill the first hunk,
275 * in which case we accept to do it once again. A new attempt is made on
276 * EINTR too.
277 */
278 while (try) {
279 ret = recv(conn->t.sock.fd, bi_end(buf), try, 0);
280
281 if (ret > 0) {
282 buf->i += ret;
283 done += ret;
284 if (ret < try) {
285 /* unfortunately, on level-triggered events, POLL_HUP
286 * is generally delivered AFTER the system buffer is
287 * empty, so this one might never match.
288 */
289 if (fdtab[conn->t.sock.fd].ev & FD_POLL_HUP)
290 goto read0;
291 break;
292 }
293 count -= ret;
294 try = count;
295 }
296 else if (ret == 0) {
297 goto read0;
298 }
299 else if (errno == EAGAIN) {
Willy Tarreau56a77e52012-09-02 18:34:44 +0200300 __conn_data_poll_recv(conn);
Willy Tarreau2ba44652012-08-20 17:30:32 +0200301 break;
302 }
303 else if (errno != EINTR) {
Willy Tarreau26f4a042013-12-04 23:44:10 +0100304 conn->flags |= CO_FL_ERROR | CO_FL_SOCK_RD_SH | CO_FL_SOCK_WR_SH;
Willy Tarreau2ba44652012-08-20 17:30:32 +0200305 break;
306 }
307 }
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200308
309 if (unlikely(conn->flags & CO_FL_WAIT_L4_CONN) && done)
310 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreau2ba44652012-08-20 17:30:32 +0200311 return done;
312
313 read0:
314 conn_sock_read0(conn);
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200315 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreaudebdc4b2012-12-07 00:01:33 +0100316
317 /* Now a final check for a possible asynchronous low-level error
318 * report. This can happen when a connection receives a reset
319 * after a shutdown, both POLL_HUP and POLL_ERR are queued, and
320 * we might have come from there by just checking POLL_HUP instead
321 * of recv()'s return value 0, so we have no way to tell there was
322 * an error without checking.
323 */
324 if (unlikely(fdtab[conn->t.sock.fd].ev & FD_POLL_ERR))
Willy Tarreau26f4a042013-12-04 23:44:10 +0100325 conn->flags |= CO_FL_ERROR | CO_FL_SOCK_RD_SH | CO_FL_SOCK_WR_SH;
Willy Tarreau2ba44652012-08-20 17:30:32 +0200326 return done;
327}
328
329
Willy Tarreau5368d802012-08-21 18:22:06 +0200330/* Send all pending bytes from buffer <buf> to connection <conn>'s socket.
331 * <flags> may contain MSG_MORE to make the system hold on without sending
332 * data too fast.
333 * Only one call to send() is performed, unless the buffer wraps, in which case
334 * a second call may be performed. The connection's flags are updated with
335 * whatever special event is detected (error, empty). The caller is responsible
336 * for taking care of those events and avoiding the call if inappropriate. The
337 * function does not call the connection's polling update function, so the caller
338 * is responsible for this.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200339 */
Willy Tarreau5368d802012-08-21 18:22:06 +0200340static int raw_sock_from_buf(struct connection *conn, struct buffer *buf, int flags)
Willy Tarreau0c2fc1f2009-01-18 15:30:37 +0100341{
Willy Tarreau5368d802012-08-21 18:22:06 +0200342 int ret, try, done, send_flag;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200343
Willy Tarreauf79c8172013-10-21 16:30:56 +0200344 if (!(conn->flags & CO_FL_CTRL_READY))
345 return 0;
346
Willy Tarreau5368d802012-08-21 18:22:06 +0200347 done = 0;
348 /* send the largest possible block. For this we perform only one call
349 * to send() unless the buffer wraps and we exactly fill the first hunk,
350 * in which case we accept to do it once again.
Willy Tarreau5bd8c372009-01-19 00:32:22 +0100351 */
Willy Tarreau5368d802012-08-21 18:22:06 +0200352 while (buf->o) {
353 try = buf->o;
Willy Tarreau89fa7062012-03-02 16:13:16 +0100354 /* outgoing data may wrap at the end */
Willy Tarreau5368d802012-08-21 18:22:06 +0200355 if (buf->data + try > buf->p)
356 try = buf->data + try - buf->p;
Willy Tarreauf890dc92008-12-13 21:12:26 +0100357
Willy Tarreau5368d802012-08-21 18:22:06 +0200358 send_flag = MSG_DONTWAIT | MSG_NOSIGNAL;
359 if (try < buf->o)
360 send_flag = MSG_MORE;
Willy Tarreaufb14edc2009-06-14 15:24:37 +0200361
Willy Tarreau5368d802012-08-21 18:22:06 +0200362 ret = send(conn->t.sock.fd, bo_ptr(buf), try, send_flag | flags);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200363
364 if (ret > 0) {
Willy Tarreau5368d802012-08-21 18:22:06 +0200365 buf->o -= ret;
366 done += ret;
Willy Tarreaub38903c2008-11-23 21:33:29 +0100367
Willy Tarreau5fb38032012-12-16 19:39:09 +0100368 if (likely(buffer_empty(buf)))
Willy Tarreau0c2fc1f2009-01-18 15:30:37 +0100369 /* optimize data alignment in the buffer */
Willy Tarreau5368d802012-08-21 18:22:06 +0200370 buf->p = buf->data;
Willy Tarreau83749182007-04-15 20:56:27 +0200371
Willy Tarreauab3e1d32007-06-03 14:10:36 +0200372 /* if the system buffer is full, don't insist */
Willy Tarreau5368d802012-08-21 18:22:06 +0200373 if (ret < try)
Willy Tarreau6996e152007-04-30 14:37:43 +0200374 break;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200375 }
Willy Tarreau0ea0cf62012-11-11 20:38:30 +0100376 else if (ret == 0 || errno == EAGAIN || errno == ENOTCONN) {
Willy Tarreau0c2fc1f2009-01-18 15:30:37 +0100377 /* nothing written, we need to poll for write first */
Willy Tarreau56a77e52012-09-02 18:34:44 +0200378 __conn_data_poll_send(conn);
Willy Tarreau5368d802012-08-21 18:22:06 +0200379 break;
Willy Tarreau83749182007-04-15 20:56:27 +0200380 }
Willy Tarreau5368d802012-08-21 18:22:06 +0200381 else if (errno != EINTR) {
Willy Tarreau26f4a042013-12-04 23:44:10 +0100382 conn->flags |= CO_FL_ERROR | CO_FL_SOCK_RD_SH | CO_FL_SOCK_WR_SH;
Willy Tarreau5368d802012-08-21 18:22:06 +0200383 break;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200384 }
Willy Tarreau5368d802012-08-21 18:22:06 +0200385 }
Willy Tarreau665e6ee2012-10-04 20:20:46 +0200386 if (unlikely(conn->flags & CO_FL_WAIT_L4_CONN) && done)
387 conn->flags &= ~CO_FL_WAIT_L4_CONN;
Willy Tarreau5368d802012-08-21 18:22:06 +0200388 return done;
Willy Tarreau0c2fc1f2009-01-18 15:30:37 +0100389}
Willy Tarreau6996e152007-04-30 14:37:43 +0200390
Willy Tarreau0c2fc1f2009-01-18 15:30:37 +0100391
Willy Tarreauf7bc57c2012-10-03 00:19:48 +0200392/* transport-layer operations for RAW sockets */
393struct xprt_ops raw_sock = {
Willy Tarreauc5788912012-08-24 18:12:41 +0200394 .snd_buf = raw_sock_from_buf,
395 .rcv_buf = raw_sock_to_buf,
Willy Tarreau96199b12012-08-24 00:46:52 +0200396#if defined(CONFIG_HAP_LINUX_SPLICE)
397 .rcv_pipe = raw_sock_to_pipe,
398 .snd_pipe = raw_sock_from_pipe,
399#endif
Willy Tarreauc5788912012-08-24 18:12:41 +0200400 .shutr = NULL,
401 .shutw = NULL,
402 .close = NULL,
Willy Tarreau5c979a92012-05-07 17:15:39 +0200403};
Willy Tarreaubaaee002006-06-26 02:48:02 +0200404
405/*
406 * Local variables:
407 * c-indent-level: 8
408 * c-basic-offset: 8
409 * End:
410 */