GCOV - Varnish Cache


/*-
 * Copyright (c) 2005-2008 Poul-Henning Kamp <phk@FreeBSD.org>
 * All rights reserved.
 *
 * 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.
 *
 * Functions for assembling a bytestream into text-lines and calling
 * a function on each.
 */

#include "config.h"

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#include "vdef.h"

#include "vas.h"        // XXX Flexelint "not used" - but req'ed for assert()
#include "miniobj.h"

#include "vlu.h"

struct vlu {
        unsigned        magic;
#define LINEUP_MAGIC    0x08286661
        char            *buf;
        unsigned        bufl;
        unsigned        bufp;
        void            *priv;
        vlu_f   *func;
};

struct vlu *
VLU_New(vlu_f *func, void *priv, unsigned bufsize)
{
        struct vlu *l;

        if (bufsize == 0)
                bufsize = BUFSIZ;
        ALLOC_OBJ(l, LINEUP_MAGIC);
        if (l != NULL) {
                l->func = func;
                l->priv = priv;
                l->bufl = bufsize - 1;
                l->buf = malloc(l->bufl + 1L);
                if (l->buf == NULL)
                        FREE_OBJ(l);
        }
        return (l);
}

void
VLU_Reset(struct vlu *l)
{
        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
        l->bufp = 0;
}

void
VLU_Destroy(struct vlu **lp)
{
        struct vlu *l;

        TAKE_OBJ_NOTNULL(l, lp, LINEUP_MAGIC);
        free(l->buf);
        FREE_OBJ(l);
}

static int
LineUpProcess(struct vlu *l)
{
        char *p, *q;
        int i;

        l->buf[l->bufp] = '\0';
        for (p = l->buf; *p != '\0'; p = q) {
                /* Find first CR or NL */
                for (q = p; *q != '\0'; q++) {
                        if (*q == '\n' || *q == '\r')
                                break;
                }
                if (*q == '\0')
                        break;
                *q++ = '\0';
                i = l->func(l->priv, p);
                if (i != 0)
                        return (i);
        }
        if (*p != '\0') {
                q = strchr(p, '\0');
                assert(q != NULL);
                l->bufp = (unsigned)(q - p);
                memmove(l->buf, p, l->bufp);
                l->buf[l->bufp] = '\0';
        } else
                l->bufp = 0;
        return (0);
}

int
VLU_Fd(struct vlu *l, int fd)
{
        ssize_t i;
        size_t sz;

        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
        assert(l->bufl >= l->bufp);
        sz = l->bufl - l->bufp;
        i = read(fd, l->buf + l->bufp, sz);
        if (i == 0)
                return (-2);
        if (i < 0)
                return (-1);
        assert((size_t)i <= sz);
        l->bufp += i;
        return (LineUpProcess(l));
}

int
VLU_File(int fd, vlu_f *func, void *priv, unsigned bufsize)
{
        struct vlu *vlu;
        int i;

        vlu = VLU_New(func, priv, bufsize);
        AN(vlu);
        do {
                i = VLU_Fd(vlu, fd);
        } while (i == 0);
        VLU_Destroy(&vlu);
        return (i);
}

int
VLU_Feed(struct vlu *l, const char *ptr, int len)
{
        int i = 0;
        unsigned u;

        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
        AN(ptr);
        assert(len > 0);
        while (len > 0) {
                u = len;
                if (u > l->bufl - l->bufp)
                        u = l->bufl - l->bufp;
                memcpy(l->buf + l->bufp, ptr, u);
                len -= u;
                ptr += u;
                l->bufp += u;
                i = LineUpProcess(l);
                if (i)
                        return (i);
        }
        return (i);
}

		varnish-cache/lib/libvarnish/vlu.c
0		/*-
1		* Copyright (c) 2005-2008 Poul-Henning Kamp <phk@FreeBSD.org>
2		* All rights reserved.
3		*
4		* SPDX-License-Identifier: BSD-2-Clause
5		*
6		* Redistribution and use in source and binary forms, with or without
7		* modification, are permitted provided that the following conditions
8		* are met:
9		* 1. Redistributions of source code must retain the above copyright
10		* notice, this list of conditions and the following disclaimer.
11		* 2. Redistributions in binary form must reproduce the above copyright
12		* notice, this list of conditions and the following disclaimer in the
13		* documentation and/or other materials provided with the distribution.
14		*
15		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
19		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25		* SUCH DAMAGE.
26		*
27		* Functions for assembling a bytestream into text-lines and calling
28		* a function on each.
29		*/
30
31		#include "config.h"
32
33		#include <stdio.h>
34		#include <stdlib.h>
35		#include <string.h>
36		#include <unistd.h>
37
38		#include "vdef.h"
39
40		#include "vas.h" // XXX Flexelint "not used" - but req'ed for assert()
41		#include "miniobj.h"
42
43		#include "vlu.h"
44
45		struct vlu {
46		unsigned magic;
47		#define LINEUP_MAGIC 0x08286661
48		char *buf;
49		unsigned bufl;
50		unsigned bufp;
51		void *priv;
52		vlu_f *func;
53		};
54
55		struct vlu *
56	372720	VLU_New(vlu_f func, void priv, unsigned bufsize)
57		{
58		struct vlu *l;
59
60	372720	if (bufsize == 0)
61	372000	bufsize = BUFSIZ;
62	372720	ALLOC_OBJ(l, LINEUP_MAGIC);
63	372720	if (l != NULL) {
64	372720	l->func = func;
65	372720	l->priv = priv;
66	372720	l->bufl = bufsize - 1;
67	372720	l->buf = malloc(l->bufl + 1L);
68	372720	if (l->buf == NULL)
69	0	FREE_OBJ(l);
70	372720	}
71	372720	return (l);
72		}
73
74		void
75	148033	VLU_Reset(struct vlu *l)
76		{
77	148033	CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
78	148033	l->bufp = 0;
79	148033	}
80
81		void
82	370480	VLU_Destroy(struct vlu **lp)
83		{
84		struct vlu *l;
85
86	370480	TAKE_OBJ_NOTNULL(l, lp, LINEUP_MAGIC);
87	370480	free(l->buf);
88	370480	FREE_OBJ(l);
89	370480	}
90
91		static int
92	506540	LineUpProcess(struct vlu *l)
93		{
94		char p, q;
95		int i;
96
97	506540	l->buf[l->bufp] = '\0';
98	4093268	for (p = l->buf; *p != '\0'; p = q) {
99		/* Find first CR or NL */
100	166499891	for (q = p; *q != '\0'; q++) {
101	166423378	if (q == '\n' \|\| q == '\r')
102	3586728	break;
103	162836650	}
104	3663241	if (*q == '\0')
105	76513	break;
106	3586728	*q++ = '\0';
107	3586728	i = l->func(l->priv, p);
108	3586728	if (i != 0)
109	0	return (i);
110	3586728	}
111	506540	if (*p != '\0') {
112	76513	q = strchr(p, '\0');
113	76513	assert(q != NULL);
114	76513	l->bufp = (unsigned)(q - p);
115	76513	memmove(l->buf, p, l->bufp);
116	76513	l->buf[l->bufp] = '\0';
117	76513	} else
118	430027	l->bufp = 0;
119	506540	return (0);
120	506540	}
121
122		int
123	3050243	VLU_Fd(struct vlu *l, int fd)
124		{
125		ssize_t i;
126		size_t sz;
127
128	3050243	CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
129	3050243	assert(l->bufl >= l->bufp);
130	3050243	sz = l->bufl - l->bufp;
131	3050243	i = read(fd, l->buf + l->bufp, sz);
132	3050243	if (i == 0)
133	2500018	return (-2);
134	550225	if (i < 0)
135	45841	return (-1);
136	504384	assert((size_t)i <= sz);
137	504384	l->bufp += i;
138	504384	return (LineUpProcess(l));
139	3050243	}
140
141		int
142	156640	VLU_File(int fd, vlu_f func, void priv, unsigned bufsize)
143		{
144		struct vlu *vlu;
145		int i;
146
147	156640	vlu = VLU_New(func, priv, bufsize);
148	156640	AN(vlu);
149	156640	do {
150	264958	i = VLU_Fd(vlu, fd);
151	264958	} while (i == 0);
152	156640	VLU_Destroy(&vlu);
153	156640	return (i);
154		}
155
156		int
157	2156	VLU_Feed(struct vlu l, const char ptr, int len)
158		{
159	2156	int i = 0;
160		unsigned u;
161
162	2156	CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
163	2156	AN(ptr);
164	2156	assert(len > 0);
165	4312	while (len > 0) {
166	2156	u = len;
167	2156	if (u > l->bufl - l->bufp)
168	0	u = l->bufl - l->bufp;
169	2156	memcpy(l->buf + l->bufp, ptr, u);
170	2156	len -= u;
171	2156	ptr += u;
172	2156	l->bufp += u;
173	2156	i = LineUpProcess(l);
174	2156	if (i)
175	0	return (i);
176		}
177	2156	return (i);
178	2156	}