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.
 *
 */

#include "config.h"

#include <fcntl.h>
#include <poll.h>
#include <stdlib.h>

#include "cache/cache_int.h"

#include "waiter/waiter.h"
#include "waiter/waiter_priv.h"
#include "vtim.h"

struct vwp {
        unsigned                magic;
#define VWP_MAGIC               0x4b2cc735
        struct waiter           *waiter;

        int                     pipes[2];

        pthread_t               thread;
        struct pollfd           *pollfd;
        struct waited           **idx;
        size_t                  npoll;
        size_t                  hpoll;
};

/*--------------------------------------------------------------------
 * It would make much more sense to not use two large vectors, but
 * the poll(2) API forces us to use at least one, so ... KISS.
 */

static void
vwp_extend_pollspace(struct vwp *vwp)
{
        size_t inc;

        if (vwp->npoll < (1<<12))
                inc = (1<<10);
        else if (vwp->npoll < (1<<14))
                inc = (1<<12);
        else if (vwp->npoll < (1<<16))
                inc = (1<<14);
        else
                inc = (1<<16);

        VSL(SLT_Debug, NO_VXID, "Acceptor poll space increased by %zu to %zu",
            inc, vwp->npoll + inc);

        vwp->pollfd = realloc(vwp->pollfd,
            (vwp->npoll + inc) * sizeof(*vwp->pollfd));
        AN(vwp->pollfd);
        memset(vwp->pollfd + vwp->npoll, 0, inc * sizeof(*vwp->pollfd));

        vwp->idx = realloc(vwp->idx, (vwp->npoll + inc) * sizeof(*vwp->idx));
        AN(vwp->idx);
        memset(vwp->idx + vwp->npoll, 0, inc * sizeof(*vwp->idx));

        for (; inc > 0; inc--)
                vwp->pollfd[vwp->npoll++].fd = -1;
}

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

static void
vwp_add(struct vwp *vwp, struct waited *wp)
{

        CHECK_OBJ_NOTNULL(wp, WAITED_MAGIC);
        VSL(SLT_Debug, NO_VXID, "vwp: ADD %d", wp->fd);
        CHECK_OBJ_NOTNULL(vwp, VWP_MAGIC);
        if (vwp->hpoll == vwp->npoll)
                vwp_extend_pollspace(vwp);
        assert(vwp->hpoll < vwp->npoll);
        assert(vwp->pollfd[vwp->hpoll].fd == -1);
        AZ(vwp->idx[vwp->hpoll]);
        vwp->pollfd[vwp->hpoll].fd = wp->fd;
        vwp->pollfd[vwp->hpoll].events = POLLIN;
        vwp->idx[vwp->hpoll] = wp;
        vwp->hpoll++;
        Wait_HeapInsert(vwp->waiter, wp);
}

static void
vwp_del(struct vwp *vwp, int n)
{
        vwp->hpoll--;
        if (n != vwp->hpoll) {
                vwp->pollfd[n] = vwp->pollfd[vwp->hpoll];
                vwp->idx[n] = vwp->idx[vwp->hpoll];
        }
        memset(&vwp->pollfd[vwp->hpoll], 0, sizeof(*vwp->pollfd));
        vwp->pollfd[vwp->hpoll].fd = -1;
        vwp->idx[vwp->hpoll] = NULL;
}

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

static void
vwp_dopipe(struct vwp *vwp)
{
        struct waited *w[128];
        ssize_t ss;
        int i;

        ss = read(vwp->pipes[0], w, sizeof w);
        assert(ss > 0);
        i = 0;
        while (ss) {
                if (w[i] == NULL) {
                        assert(ss == sizeof w[0]);
                        assert(vwp->hpoll == 1);
                        pthread_exit(NULL);
                }
                CHECK_OBJ_NOTNULL(w[i], WAITED_MAGIC);
                assert(w[i]->fd > 0);                   // no stdin
                vwp_add(vwp, w[i++]);
                ss -= sizeof w[0];
        }
}

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

static void *
vwp_main(void *priv)
{
        int t, v;
        struct vwp *vwp;
        struct waiter *w;
        struct waited *wp;
        double now, then;
        size_t z;

        THR_SetName("cache-poll");
        THR_Init();
        CAST_OBJ_NOTNULL(vwp, priv, VWP_MAGIC);
        w = vwp->waiter;

        while (1) {
                then = Wait_HeapDue(w, &wp);
                if (wp == NULL)
                        t = -1;
                else {
                        t = (int)floor(1e3 * (then - VTIM_real()));
                        if (t < 0)
                                t = 0;
                }
                assert(vwp->hpoll > 0);
                AN(vwp->pollfd);
                v = poll(vwp->pollfd, vwp->hpoll, t);
                assert(v >= 0);
                now = VTIM_real();
                if (vwp->pollfd[0].revents)
                        v--;
                for (z = 1; z < vwp->hpoll;) {
                        assert(vwp->pollfd[z].fd != vwp->pipes[0]);
                        wp = vwp->idx[z];
                        CHECK_OBJ_NOTNULL(wp, WAITED_MAGIC);

                        if (v == 0 && Wait_HeapDue(w, NULL) > now)
                                break;
                        if (vwp->pollfd[z].revents)
                                v--;
                        then = Wait_When(wp);
                        if (then <= now) {
                                AN(Wait_HeapDelete(w, wp));
                                Wait_Call(w, wp, WAITER_TIMEOUT, now);
                                vwp_del(vwp, z);
                        } else if (vwp->pollfd[z].revents & POLLIN) {
                                assert(wp->fd > 0);
                                assert(wp->fd == vwp->pollfd[z].fd);
                                AN(Wait_HeapDelete(w, wp));
                                Wait_Call(w, wp, WAITER_ACTION, now);
                                vwp_del(vwp, z);
                        } else {
                                z++;
                        }
                }
                if (vwp->pollfd[0].revents)
                        vwp_dopipe(vwp);
        }
        NEEDLESS(return (NULL));
}

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

static int v_matchproto_(waiter_enter_f)
vwp_enter(void *priv, struct waited *wp)
{
        struct vwp *vwp;

        CAST_OBJ_NOTNULL(vwp, priv, VWP_MAGIC);

        if (write(vwp->pipes[1], &wp, sizeof wp) != sizeof wp)
                return (-1);
        return (0);
}

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

static void v_matchproto_(waiter_init_f)
vwp_init(struct waiter *w)
{
        struct vwp *vwp;

        CHECK_OBJ_NOTNULL(w, WAITER_MAGIC);
        vwp = w->priv;
        INIT_OBJ(vwp, VWP_MAGIC);
        vwp->waiter = w;
        AZ(pipe(vwp->pipes));
        // XXX: set write pipe non-blocking

        vwp->hpoll = 1;
        vwp_extend_pollspace(vwp);
        vwp->pollfd[0].fd = vwp->pipes[0];
        vwp->pollfd[0].events = POLLIN;
        PTOK(pthread_create(&vwp->thread, NULL, vwp_main, vwp));
}

/*--------------------------------------------------------------------
 * It is the callers responsibility to trigger all fd's waited on to
 * fail somehow.
 */

static void v_matchproto_(waiter_fini_f)
vwp_fini(struct waiter *w)
{
        struct vwp *vwp;
        void *vp;

        CAST_OBJ_NOTNULL(vwp, w->priv, VWP_MAGIC);
        vp = NULL;
        while (vwp->hpoll > 1)
                VTIM_sleep(0.1);
        // XXX: set write pipe blocking
        assert(write(vwp->pipes[1], &vp, sizeof vp) == sizeof vp);
        PTOK(pthread_join(vwp->thread, &vp));
        closefd(&vwp->pipes[0]);
        closefd(&vwp->pipes[1]);
        free(vwp->pollfd);
        free(vwp->idx);
}

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

#include "waiter/mgt_waiter.h"

const struct waiter_impl waiter_poll = {
        .name =         "poll",
        .init =         vwp_init,
        .fini =         vwp_fini,
        .enter =        vwp_enter,
        .size =         sizeof(struct vwp),
};

		vinyl-cache/bin/vinyld/waiter/cache_waiter_poll.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		*/
31
32		#include "config.h"
33
34		#include <fcntl.h>
35		#include <poll.h>
36		#include <stdlib.h>
37
38		#include "cache/cache_int.h"
39
40		#include "waiter/waiter.h"
41		#include "waiter/waiter_priv.h"
42		#include "vtim.h"
43
44		struct vwp {
45		unsigned magic;
46		#define VWP_MAGIC 0x4b2cc735
47		struct waiter *waiter;
48
49		int pipes[2];
50
51		pthread_t thread;
52		struct pollfd *pollfd;
53		struct waited **idx;
54		size_t npoll;
55		size_t hpoll;
56		};
57
58		/*--------------------------------------------------------------------
59		* It would make much more sense to not use two large vectors, but
60		* the poll(2) API forces us to use at least one, so ... KISS.
61		*/
62
63		static void
64	40	vwp_extend_pollspace(struct vwp *vwp)
65		{
66		size_t inc;
67
68	40	if (vwp->npoll < (1<<12))
69	40	inc = (1<<10);
70	0	else if (vwp->npoll < (1<<14))
71	0	inc = (1<<12);
72	0	else if (vwp->npoll < (1<<16))
73	0	inc = (1<<14);
74		else
75	0	inc = (1<<16);
76
77	80	VSL(SLT_Debug, NO_VXID, "Acceptor poll space increased by %zu to %zu",
78	40	inc, vwp->npoll + inc);
79
80	80	vwp->pollfd = realloc(vwp->pollfd,
81	40	(vwp->npoll + inc) * sizeof(*vwp->pollfd));
82	40	AN(vwp->pollfd);
83	40	memset(vwp->pollfd + vwp->npoll, 0, inc * sizeof(*vwp->pollfd));
84
85	40	vwp->idx = realloc(vwp->idx, (vwp->npoll + inc) * sizeof(*vwp->idx));
86	40	AN(vwp->idx);
87	40	memset(vwp->idx + vwp->npoll, 0, inc * sizeof(*vwp->idx));
88
89	41000	for (; inc > 0; inc--)
90	40960	vwp->pollfd[vwp->npoll++].fd = -1;
91	40	}
92
93		/--------------------------------------------------------------------/
94
95		static void
96	464	vwp_add(struct vwp vwp, struct waited wp)
97		{
98
99	464	CHECK_OBJ_NOTNULL(wp, WAITED_MAGIC);
100	464	VSL(SLT_Debug, NO_VXID, "vwp: ADD %d", wp->fd);
101	464	CHECK_OBJ_NOTNULL(vwp, VWP_MAGIC);
102	464	if (vwp->hpoll == vwp->npoll)
103	0	vwp_extend_pollspace(vwp);
104	464	assert(vwp->hpoll < vwp->npoll);
105	464	assert(vwp->pollfd[vwp->hpoll].fd == -1);
106	464	AZ(vwp->idx[vwp->hpoll]);
107	464	vwp->pollfd[vwp->hpoll].fd = wp->fd;
108	464	vwp->pollfd[vwp->hpoll].events = POLLIN;
109	464	vwp->idx[vwp->hpoll] = wp;
110	464	vwp->hpoll++;
111	464	Wait_HeapInsert(vwp->waiter, wp);
112	464	}
113
114		static void
115	441	vwp_del(struct vwp *vwp, int n)
116		{
117	441	vwp->hpoll--;
118	441	if (n != vwp->hpoll) {
119	112	vwp->pollfd[n] = vwp->pollfd[vwp->hpoll];
120	112	vwp->idx[n] = vwp->idx[vwp->hpoll];
121	112	}
122	441	memset(&vwp->pollfd[vwp->hpoll], 0, sizeof(*vwp->pollfd));
123	441	vwp->pollfd[vwp->hpoll].fd = -1;
124	441	vwp->idx[vwp->hpoll] = NULL;
125	441	}
126
127		/--------------------------------------------------------------------/
128
129		static void
130	468	vwp_dopipe(struct vwp *vwp)
131		{
132		struct waited *w[128];
133		ssize_t ss;
134		int i;
135
136	468	ss = read(vwp->pipes[0], w, sizeof w);
137	468	assert(ss > 0);
138	468	i = 0;
139	932	while (ss) {
140	468	if (w[i] == NULL) {
141	4	assert(ss == sizeof w[0]);
142	4	assert(vwp->hpoll == 1);
143	4	pthread_exit(NULL);
144		}
145	464	CHECK_OBJ_NOTNULL(w[i], WAITED_MAGIC);
146	464	assert(w[i]->fd > 0); // no stdin
147	464	vwp_add(vwp, w[i++]);
148	464	ss -= sizeof w[0];
149		}
150	464	}
151
152		/--------------------------------------------------------------------/
153
154		static void *
155	0	vwp_main(void *priv)
156		{
157		int t, v;
158		struct vwp *vwp;
159		struct waiter *w;
160		struct waited *wp;
161		double now, then;
162		size_t z;
163
164	0	THR_SetName("cache-poll");
165	0	THR_Init();
166	0	CAST_OBJ_NOTNULL(vwp, priv, VWP_MAGIC);
167	0	w = vwp->waiter;
168
169	878	while (1) {
170	878	then = Wait_HeapDue(w, &wp);
171	878	if (wp == NULL)
172	247	t = -1;
173		else {
174	631	t = (int)floor(1e3 * (then - VTIM_real()));
175	631	if (t < 0)
176	0	t = 0;
177		}
178	878	assert(vwp->hpoll > 0);
179	878	AN(vwp->pollfd);
180	878	v = poll(vwp->pollfd, vwp->hpoll, t);
181	878	assert(v >= 0);
182	878	now = VTIM_real();
183	878	if (vwp->pollfd[0].revents)
184	468	v--;
185	1450	for (z = 1; z < vwp->hpoll;) {
186	861	assert(vwp->pollfd[z].fd != vwp->pipes[0]);
187	861	wp = vwp->idx[z];
188	861	CHECK_OBJ_NOTNULL(wp, WAITED_MAGIC);
189
190	861	if (v == 0 && Wait_HeapDue(w, NULL) > now)
191	289	break;
192	572	if (vwp->pollfd[z].revents)
193	441	v--;
194	572	then = Wait_When(wp);
195	572	if (then <= now) {
196	0	AN(Wait_HeapDelete(w, wp));
197	0	Wait_Call(w, wp, WAITER_TIMEOUT, now);
198	0	vwp_del(vwp, z);
199	572	} else if (vwp->pollfd[z].revents & POLLIN) {
200	441	assert(wp->fd > 0);
201	441	assert(wp->fd == vwp->pollfd[z].fd);
202	441	AN(Wait_HeapDelete(w, wp));
203	441	Wait_Call(w, wp, WAITER_ACTION, now);
204	441	vwp_del(vwp, z);
205	441	} else {
206	131	z++;
207		}
208		}
209	878	if (vwp->pollfd[0].revents)
210	468	vwp_dopipe(vwp);
211		}
212		NEEDLESS(return (NULL));
213		}
214
215		/--------------------------------------------------------------------/
216
217		static int v_matchproto_(waiter_enter_f)
218	464	vwp_enter(void priv, struct waited wp)
219		{
220		struct vwp *vwp;
221
222	464	CAST_OBJ_NOTNULL(vwp, priv, VWP_MAGIC);
223
224	464	if (write(vwp->pipes[1], &wp, sizeof wp) != sizeof wp)
225	0	return (-1);
226	464	return (0);
227	464	}
228
229		/--------------------------------------------------------------------/
230
231		static void v_matchproto_(waiter_init_f)
232	40	vwp_init(struct waiter *w)
233		{
234		struct vwp *vwp;
235
236	40	CHECK_OBJ_NOTNULL(w, WAITER_MAGIC);
237	40	vwp = w->priv;
238	40	INIT_OBJ(vwp, VWP_MAGIC);
239	40	vwp->waiter = w;
240	40	AZ(pipe(vwp->pipes));
241		// XXX: set write pipe non-blocking
242
243	40	vwp->hpoll = 1;
244	40	vwp_extend_pollspace(vwp);
245	40	vwp->pollfd[0].fd = vwp->pipes[0];
246	40	vwp->pollfd[0].events = POLLIN;
247	40	PTOK(pthread_create(&vwp->thread, NULL, vwp_main, vwp));
248	40	}
249
250		/*--------------------------------------------------------------------
251		* It is the callers responsibility to trigger all fd's waited on to
252		* fail somehow.
253		*/
254
255		static void v_matchproto_(waiter_fini_f)
256	4	vwp_fini(struct waiter *w)
257		{
258		struct vwp *vwp;
259		void *vp;
260
261	4	CAST_OBJ_NOTNULL(vwp, w->priv, VWP_MAGIC);
262	4	vp = NULL;
263	4	while (vwp->hpoll > 1)
264	0	VTIM_sleep(0.1);
265		// XXX: set write pipe blocking
266	4	assert(write(vwp->pipes[1], &vp, sizeof vp) == sizeof vp);
267	4	PTOK(pthread_join(vwp->thread, &vp));
268	4	closefd(&vwp->pipes[0]);
269	4	closefd(&vwp->pipes[1]);
270	4	free(vwp->pollfd);
271	4	free(vwp->idx);
272	4	}
273
274		/--------------------------------------------------------------------/
275
276		#include "waiter/mgt_waiter.h"
277
278		const struct waiter_impl waiter_poll = {
279		.name = "poll",
280		.init = vwp_init,
281		.fini = vwp_fini,
282		.enter = vwp_enter,
283		.size = sizeof(struct vwp),
284		};