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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/* wydawca - automatic release submission daemon
Copyright (C) 2007-2016 Sergey Poznyakoff
Wydawca is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
Wydawca is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with wydawca. If not, see <http://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <string.h>
#include <stdlib.h>
#include "argot.h"
struct argot_txtacc_entry
{
char *buf; /* Text buffer */
size_t size; /* Buffer size */
size_t len; /* Actual number of bytes in buffer */
};
#define TXTACC_BUFSIZE 1024
#define argot_txtacc_entry_freesize(e) ((e)->size - (e)->len)
struct argot_txtacc
{
struct argot_list *cur; /* Current build list */
struct argot_list *mem; /* List of already allocated elements */
};
static struct argot_txtacc_entry *
argot_txtacc_alloc_entry(struct argot_list *list, size_t size)
{
struct argot_txtacc_entry *p = argot_malloc(sizeof (*p));
p->buf = argot_malloc(size);
p->size = size;
p->len = 0;
argot_list_append(list, p);
return p;
}
static struct argot_txtacc_entry *
argot_txtacc_cur_entry(struct argot_txtacc *acc)
{
struct argot_txtacc_entry *ent;
if (argot_list_size(acc->cur) == 0)
return argot_txtacc_alloc_entry(acc->cur,
ARGOT_TXTACC_BUFSIZE);
ent = acc->cur->tail->data;
if (argot_txtacc_entry_freesize(ent) == 0)
ent = argot_txtacc_alloc_entry(acc->cur,
ARGOT_TXTACC_BUFSIZE);
return ent;
}
static void
argot_txtacc_entry_append(struct argot_txtacc_entry *ent,
const char *p, size_t size)
{
memcpy(ent->buf + ent->len, p, size);
ent->len += size;
}
static void
argot_txtacc_entry_tailor(struct argot_txtacc_entry *ent)
{
if (ent->size > ent->len) {
char *p = argot_realloc(ent->buf, ent->len);
if (!p)
return;
ent->buf = p;
ent->size = ent->len;
}
}
static void
argot_txtacc_entry_free(void *p)
{
if (p) {
struct argot_txtacc_entry *ent = p;
free(ent->buf);
free(ent);
}
}
struct argot_txtacc *
argot_txtacc_create()
{
struct argot_txtacc *acc = argot_malloc(sizeof (*acc));
acc->cur = argot_list_create();
acc->cur->free_entry = argot_txtacc_entry_free;
acc->mem = argot_list_create();
acc->mem->free_entry = argot_txtacc_entry_free;
return acc;
}
void
argot_txtacc_free(struct argot_txtacc *acc)
{
if (acc) {
argot_list_free(acc->cur);
argot_list_free(acc->mem);
free(acc);
}
}
void
argot_txtacc_grow(struct argot_txtacc *acc, const char *buf, size_t size)
{
while (size) {
struct argot_txtacc_entry *ent = argot_txtacc_cur_entry(acc);
size_t rest = argot_txtacc_entry_freesize(ent);
if (rest > size)
rest = size;
argot_txtacc_entry_append(ent, buf, rest);
buf += rest;
size -= rest;
}
}
void
argot_txtacc_grow_string(struct argot_txtacc *acc, const char *buf)
{
argot_txtacc_grow(acc, buf, strlen(buf));
}
void
argot_txtacc_grow_string_escape(struct argot_txtacc *acc, const char *buf)
{
for (; *buf; buf++) {
if (strchr(" \t\n\"\'\\", *buf))
argot_txtacc_grow_char(acc, '\\');
argot_txtacc_grow_char(acc, *buf);
}
}
char *
argot_txtacc_finish(struct argot_txtacc *acc, int steal)
{
struct argot_list_entry *ep;
struct argot_txtacc_entry *txtent;
size_t size;
char *p;
switch (argot_list_size(acc->cur)) {
case 0:
return NULL;
case 1:
txtent = acc->cur->head->data;
acc->cur->head->data = NULL;
argot_txtacc_entry_tailor(txtent);
argot_list_append(acc->mem, txtent);
break;
default:
size = 0;
for (ep = acc->cur->head; ep; ep = ep->next) {
txtent = ep->data;
size += txtent->len;
}
txtent = argot_txtacc_alloc_entry(acc->mem, size);
for (ep = acc->cur->head; ep; ep = ep->next) {
struct argot_txtacc_entry *tp = ep->data;
argot_txtacc_entry_append(txtent, tp->buf, tp->len);
}
}
argot_list_clear(acc->cur);
p = txtent->buf;
if (steal) {
argot_list_remove_tail(acc->mem);
free(txtent);
}
return p;
}
void
argot_txtacc_free_string(struct argot_txtacc *acc, char *str)
{
struct argot_list_entry *ep;
for (ep = acc->mem->head; ep; ep = ep->next) {
struct argot_txtacc_entry *tp = ep->data;
if (tp->buf == str) {
argot_list_remove_entry(acc->mem, ep);
argot_txtacc_entry_free(tp);
return;
}
}
}
void
argot_txtacc_clear(struct argot_txtacc *acc)
{
argot_list_clear(acc->cur);
}
|
