GCOV - Varnish Cache


/*-
 * Copyright (c) 2006 Verdens Gang AS
 * Copyright (c) 2006-2011 Varnish Software AS
 * All rights reserved.
 *
 * Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * XXX: charge bytes to srcaddr
 */

#include "config.h"

#include "cache/cache_varnishd.h"

#include <poll.h>
#include <stdio.h>

#include "cache_http1.h"
#include "vtcp.h"
#include "vtim.h"

#include "VSC_vbe.h"

static struct lock pipestat_mtx;

static int
rdf(int fd0, int fd1, uint64_t *pcnt)
{
        ssize_t i, j;
        char buf[BUFSIZ], *p;

        i = read(fd0, buf, sizeof buf);
        VTCP_Assert(i);
        if (i <= 0)
                return (1);
        for (p = buf; i > 0; i -= j, p += j) {
                j = write(fd1, p, i);
                VTCP_Assert(j);
                if (j <= 0)
                        return (1);
                *pcnt += j;
                if (i != j)
                        (void)usleep(100000);           /* XXX hack */
        }
        return (0);
}

int
V1P_Enter(void)
{
        int retval = 0;

        Lck_Lock(&pipestat_mtx);
        if (cache_param->pipe_sess_max == 0 ||
            VSC_C_main->n_pipe < cache_param->pipe_sess_max)
                VSC_C_main->n_pipe++;
        else
                retval = -1;
        Lck_Unlock(&pipestat_mtx);
        return (retval);
}

void
V1P_Leave(void)
{

        Lck_Lock(&pipestat_mtx);
        assert(VSC_C_main->n_pipe > 0);
        VSC_C_main->n_pipe--;
        Lck_Unlock(&pipestat_mtx);
}

void
V1P_Charge(struct req *req, const struct v1p_acct *a, struct VSC_vbe *b)
{

        AN(b);
        VSLb(req->vsl, SLT_PipeAcct, "%ju %ju %ju %ju",
            (uintmax_t)a->req,
            (uintmax_t)a->bereq,
            (uintmax_t)a->in,
            (uintmax_t)a->out);

        Lck_Lock(&pipestat_mtx);
        VSC_C_main->s_pipe_hdrbytes += a->req;
        VSC_C_main->s_pipe_in += a->in;
        VSC_C_main->s_pipe_out += a->out;
        b->pipe_hdrbytes += a->bereq;
        b->pipe_out += a->in;
        b->pipe_in += a->out;
        Lck_Unlock(&pipestat_mtx);
}

stream_close_t
V1P_Process(const struct req *req, int fd, struct v1p_acct *v1a,
    vtim_real deadline)
{
        struct pollfd fds[2];
        vtim_dur tmo, tmo_task;
        stream_close_t sc;
        int i, j;

        CHECK_OBJ_NOTNULL(req, REQ_MAGIC);
        CHECK_OBJ_NOTNULL(req->sp, SESS_MAGIC);
        assert(fd > 0);

        if (req->htc->pipeline_b != NULL) {
                j = write(fd,  req->htc->pipeline_b,
                    req->htc->pipeline_e - req->htc->pipeline_b);
                VTCP_Assert(j);
                if (j < 0)
                        return (SC_OVERLOAD);
                req->htc->pipeline_b = NULL;
                req->htc->pipeline_e = NULL;
                v1a->in += j;
        }
        memset(fds, 0, sizeof fds);
        fds[0].fd = fd;
        fds[0].events = POLLIN;
        fds[1].fd = req->sp->fd;
        fds[1].events = POLLIN;

        sc = SC_TX_PIPE;
        while (fds[0].fd > -1 || fds[1].fd > -1) {
                fds[0].revents = 0;
                fds[1].revents = 0;
                tmo = cache_param->pipe_timeout;
                if (tmo == 0.)
                        tmo = INFINITY;
                if (deadline > 0.) {
                        tmo_task = deadline - VTIM_real();
                        tmo = vmin(tmo, tmo_task);
                }
                i = poll(fds, 2, VTIM_poll_tmo(tmo));
                if (i == 0)
                        sc = SC_RX_TIMEOUT;
                if (i < 1)
                        break;
                if (fds[0].revents &&
                    rdf(fd, req->sp->fd, &v1a->out)) {
                        if (fds[1].fd == -1)
                                break;
                        (void)shutdown(fd, SHUT_RD);
                        (void)shutdown(req->sp->fd, SHUT_WR);
                        fds[0].events = 0;
                        fds[0].fd = -1;
                }
                if (fds[1].revents &&
                    rdf(req->sp->fd, fd, &v1a->in)) {
                        if (fds[0].fd == -1)
                                break;
                        (void)shutdown(req->sp->fd, SHUT_RD);
                        (void)shutdown(fd, SHUT_WR);
                        fds[1].events = 0;
                        fds[1].fd = -1;
                }
        }

        return (sc);
}

/*--------------------------------------------------------------------*/

void
V1P_Init(void)
{

        Lck_New(&pipestat_mtx, lck_pipestat);
}

		varnish-cache/bin/varnishd/http1/cache_http1_pipe.c
0		/*-
1		* Copyright (c) 2006 Verdens Gang AS
2		* Copyright (c) 2006-2011 Varnish Software AS
3		* All rights reserved.
4		*
5		* Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
6		*
7		* SPDX-License-Identifier: BSD-2-Clause
8		*
9		* Redistribution and use in source and binary forms, with or without
10		* modification, are permitted provided that the following conditions
11		* are met:
12		* 1. Redistributions of source code must retain the above copyright
13		* notice, this list of conditions and the following disclaimer.
14		* 2. Redistributions in binary form must reproduce the above copyright
15		* notice, this list of conditions and the following disclaimer in the
16		* documentation and/or other materials provided with the distribution.
17		*
18		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
22		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28		* SUCH DAMAGE.
29		*
30		* XXX: charge bytes to srcaddr
31		*/
32
33		#include "config.h"
34
35		#include "cache/cache_varnishd.h"
36
37		#include <poll.h>
38		#include <stdio.h>
39
40		#include "cache_http1.h"
41		#include "vtcp.h"
42		#include "vtim.h"
43
44		#include "VSC_vbe.h"
45
46		static struct lock pipestat_mtx;
47
48		static int
49	3049	rdf(int fd0, int fd1, uint64_t *pcnt)
50		{
51		ssize_t i, j;
52		char buf[BUFSIZ], *p;
53
54	3049	i = read(fd0, buf, sizeof buf);
55	3049	VTCP_Assert(i);
56	3049	if (i <= 0)
57	1600	return (1);
58	2898	for (p = buf; i > 0; i -= j, p += j) {
59	1449	j = write(fd1, p, i);
60	1449	VTCP_Assert(j);
61	1449	if (j <= 0)
62	0	return (1);
63	1449	*pcnt += j;
64	1449	if (i != j)
65	0	(void)usleep(100000); /* XXX hack */
66	1449	}
67	1449	return (0);
68	3049	}
69
70		int
71	1040	V1P_Enter(void)
72		{
73	1040	int retval = 0;
74
75	1040	Lck_Lock(&pipestat_mtx);
76	1040	if (cache_param->pipe_sess_max == 0 \|\|
77	40	VSC_C_main->n_pipe < cache_param->pipe_sess_max)
78	1000	VSC_C_main->n_pipe++;
79		else
80	40	retval = -1;
81	1040	Lck_Unlock(&pipestat_mtx);
82	1040	return (retval);
83		}
84
85		void
86	1000	V1P_Leave(void)
87		{
88
89	1000	Lck_Lock(&pipestat_mtx);
90	1000	assert(VSC_C_main->n_pipe > 0);
91	1000	VSC_C_main->n_pipe--;
92	1000	Lck_Unlock(&pipestat_mtx);
93	1000	}
94
95		void
96	1000	V1P_Charge(struct req req, const struct v1p_acct a, struct VSC_vbe *b)
97		{
98
99	1000	AN(b);
100	2000	VSLb(req->vsl, SLT_PipeAcct, "%ju %ju %ju %ju",
101	1000	(uintmax_t)a->req,
102	1000	(uintmax_t)a->bereq,
103	1000	(uintmax_t)a->in,
104	1000	(uintmax_t)a->out);
105
106	1000	Lck_Lock(&pipestat_mtx);
107	1000	VSC_C_main->s_pipe_hdrbytes += a->req;
108	1000	VSC_C_main->s_pipe_in += a->in;
109	1000	VSC_C_main->s_pipe_out += a->out;
110	1000	b->pipe_hdrbytes += a->bereq;
111	1000	b->pipe_out += a->in;
112	1000	b->pipe_in += a->out;
113	1000	Lck_Unlock(&pipestat_mtx);
114	1000	}
115
116		stream_close_t
117	960	V1P_Process(const struct req req, int fd, struct v1p_acct v1a,
118		vtim_real deadline)
119		{
120		struct pollfd fds[2];
121		vtim_dur tmo, tmo_task;
122		stream_close_t sc;
123		int i, j;
124
125	960	CHECK_OBJ_NOTNULL(req, REQ_MAGIC);
126	960	CHECK_OBJ_NOTNULL(req->sp, SESS_MAGIC);
127	960	assert(fd > 0);
128
129	960	if (req->htc->pipeline_b != NULL) {
130	238	j = write(fd, req->htc->pipeline_b,
131	119	req->htc->pipeline_e - req->htc->pipeline_b);
132	119	VTCP_Assert(j);
133	119	if (j < 0)
134	0	return (SC_OVERLOAD);
135	119	req->htc->pipeline_b = NULL;
136	119	req->htc->pipeline_e = NULL;
137	119	v1a->in += j;
138	119	}
139	960	memset(fds, 0, sizeof fds);
140	960	fds[0].fd = fd;
141	960	fds[0].events = POLLIN;
142	960	fds[1].fd = req->sp->fd;
143	960	fds[1].events = POLLIN;
144
145	960	sc = SC_TX_PIPE;
146	3209	while (fds[0].fd > -1 \|\| fds[1].fd > -1) {
147	3209	fds[0].revents = 0;
148	3209	fds[1].revents = 0;
149	3209	tmo = cache_param->pipe_timeout;
150	3209	if (tmo == 0.)
151	280	tmo = INFINITY;
152	3209	if (deadline > 0.) {
153	648	tmo_task = deadline - VTIM_real();
154	648	tmo = vmin(tmo, tmo_task);
155	648	}
156	3209	i = poll(fds, 2, VTIM_poll_tmo(tmo));
157	3209	if (i == 0)
158	160	sc = SC_RX_TIMEOUT;
159	3209	if (i < 1)
160	160	break;
161	3049	if (fds[0].revents &&
162	2208	rdf(fd, req->sp->fd, &v1a->out)) {
163	800	if (fds[1].fd == -1)
164	40	break;
165	760	(void)shutdown(fd, SHUT_RD);
166	760	(void)shutdown(req->sp->fd, SHUT_WR);
167	760	fds[0].events = 0;
168	760	fds[0].fd = -1;
169	760	}
170	3009	if (fds[1].revents &&
171	841	rdf(req->sp->fd, fd, &v1a->in)) {
172	800	if (fds[0].fd == -1)
173	760	break;
174	40	(void)shutdown(req->sp->fd, SHUT_RD);
175	40	(void)shutdown(fd, SHUT_WR);
176	40	fds[1].events = 0;
177	40	fds[1].fd = -1;
178	40	}
179		}
180
181	960	return (sc);
182	960	}
183
184		/--------------------------------------------------------------------/
185
186		void
187	36671	V1P_Init(void)
188		{
189
190	36671	Lck_New(&pipestat_mtx, lck_pipestat);
191	36671	}