1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*-
* 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);
}
|
