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 243572
VLU_New(vlu_f *func, void *priv, unsigned bufsize)
57
{
58
        struct vlu *l;
59
60 243572
        if (bufsize == 0)
61 243068
                bufsize = BUFSIZ;
62 243572
        ALLOC_OBJ(l, LINEUP_MAGIC);
63 243572
        if (l != NULL) {
64 243572
                l->func = func;
65 243572
                l->priv = priv;
66 243572
                l->bufl = bufsize - 1;
67 243572
                l->buf = malloc(l->bufl + 1L);
68 243572
                if (l->buf == NULL)
69 0
                        FREE_OBJ(l);
70 243572
        }
71 243572
        return (l);
72
}
73
74
void
75 96096
VLU_Reset(struct vlu *l)
76
{
77 96096
        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
78 96096
        l->bufp = 0;
79 96096
}
80
81
void
82 242088
VLU_Destroy(struct vlu **lp)
83
{
84
        struct vlu *l;
85
86 242088
        TAKE_OBJ_NOTNULL(l, lp, LINEUP_MAGIC);
87 242088
        free(l->buf);
88 242088
        FREE_OBJ(l);
89 242088
}
90
91
static int
92 320642
LineUpProcess(struct vlu *l)
93
{
94
        char *p, *q;
95
        int i;
96
97 320642
        l->buf[l->bufp] = '\0';
98 2509464
        for (p = l->buf; *p != '\0'; p = q) {
99
                /* Find first CR or NL */
100 100985028
                for (q = p; *q != '\0'; q++) {
101 100940288
                        if (*q == '\n' || *q == '\r')
102 2188822
                                break;
103 98751466
                }
104 2233562
                if (*q == '\0')
105 44740
                        break;
106 2188822
                *q++ = '\0';
107 2188822
                i = l->func(l->priv, p);
108 2188822
                if (i != 0)
109 0
                        return (i);
110 2188822
        }
111 320642
        if (*p != '\0') {
112 44740
                q = strchr(p, '\0');
113 44740
                assert(q != NULL);
114 44740
                l->bufp = (unsigned)(q - p);
115 44740
                memmove(l->buf, p, l->bufp);
116 44740
                l->buf[l->bufp] = '\0';
117 44740
        } else
118 275902
                l->bufp = 0;
119 320642
        return (0);
120 320642
}
121
122
int
123 1724369
VLU_Fd(struct vlu *l, int fd)
124
{
125
        int i;
126
127 1724369
        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
128 1724369
        i = read(fd, l->buf + l->bufp, l->bufl - l->bufp);
129 1724369
        if (i == 0)
130 1405182
                return (-2);
131 319187
        if (i < 0)
132 0
                return (-1);
133 319187
        l->bufp += i;
134 319187
        return (LineUpProcess(l));
135 1724369
}
136
137
int
138 102368
VLU_File(int fd, vlu_f *func, void *priv, unsigned bufsize)
139
{
140
        struct vlu *vlu;
141
        int i;
142
143 102368
        vlu = VLU_New(func, priv, bufsize);
144 102368
        AN(vlu);
145 102368
        do {
146 174670
                i = VLU_Fd(vlu, fd);
147 174670
        } while (i == 0);
148 102368
        VLU_Destroy(&vlu);
149 102368
        return (i);
150
}
151
152
int
153 1455
VLU_Feed(struct vlu *l, const char *ptr, int len)
154
{
155 1455
        int i = 0;
156
        unsigned u;
157
158 1455
        CHECK_OBJ_NOTNULL(l, LINEUP_MAGIC);
159 1455
        AN(ptr);
160 1455
        assert(len > 0);
161 2910
        while (len > 0) {
162 1455
                u = len;
163 1455
                if (u > l->bufl - l->bufp)
164 0
                        u = l->bufl - l->bufp;
165 1455
                memcpy(l->buf + l->bufp, ptr, u);
166 1455
                len -= u;
167 1455
                ptr += u;
168 1455
                l->bufp += u;
169 1455
                i = LineUpProcess(l);
170 1455
                if (i)
171 0
                        return (i);
172
        }
173 1455
        return (i);
174 1455
}