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