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 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
|
/* grep-dctrl - grep Debian control files
Copyright (C) 1999 Antti-Juhani Kaijanaho
This program 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 2 of the License, or
(at your option) any later version.
This program 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 this program; see the file COPYING. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
The author can be reached via mail at (ISO 8859-1 charset for the city)
Antti-Juhani Kaijanaho
Helvintie 2 e as 9
FIN-40500 JYVSKYL
FINLAND
EUROPE
and via electronic mail from
gaia@iki.fi
If you have a choice, use the email address; it is more likely to
stay current.
*/
#define BUFFER_C__
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "buffer.h"
#include "msg.h"
#include <stdio.h>
buffer buffer_nomem = 0;
#define INIT_SIZE 64 /* must be a power of two */
buffer
new_buffer (void)
{
struct buffer_t * rv;
debug_message("new_buffer", 0);
rv = malloc (sizeof (struct buffer_t));
if (rv == 0)
return buffer_nomem;
rv->magic_cookie = BUFFER_MC;
rv->buffer_len = 0;
rv->data_len = 0;
rv->data = 0;
return rv;
}
int
buffer_enlarge (buffer buf)
{
char * new_data;
size_t new_len;
debug_message("buffer_enlarge", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (INIT_SIZE % 2 == 0);
new_len = (buf->buffer_len == 0) ? INIT_SIZE : buf->buffer_len * 2;
new_data = realloc (buf->data, new_len);
if (new_data == 0)
return 0;
buf->data = new_data;
buf->buffer_len = new_len;
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
return 1;
}
void
buffer_free (buffer buf)
{
debug_message("buffer_free", 0);
if (buf == buffer_nomem)
return;
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
buffer_empty (buf);
/* make sure an invalid reference is caught */
buf->magic_cookie = ~BUFFER_MC;
free (buf);
}
void
buffer_empty (buffer buf)
{
debug_message("buffer_empty", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
buffer_clear (buf);
buf->buffer_len = 0;
free (buf->data);
}
void
buffer_clear (buffer buf)
{
debug_message("buffer_clear", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
buf->data_len = 0;
}
void
buffer_trim (buffer buf)
{
debug_message("buffer_trim", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
assert (INIT_SIZE % 2 == 0);
if (buf->data_len > 0 && buf->buffer_len / buf->data_len > 4)
{
char * new_data;
size_t new_len;
/* Find the smallest power of two greater than data length. */
for (new_len = INIT_SIZE; new_len < buf->data_len; new_len *= 2);
new_data = realloc (buf->data, new_len);
if (new_data != 0)
{
buf->data = new_data;
buf->buffer_len = new_len;
}
}
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
}
const char *
buffer_c_str (buffer buf)
{
debug_message("buffer_c_str", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
/* Let's fool around a bit. Insert a null character at the end,
possibly enlarging the buffer, but then decrease the data length to
make other routines think it is not there. */
buffer_append (buf, '\0');
assert (buf->data_len > 0);
--buf->data_len;
return buf->data;
}
size_t
buffer_len (buffer buf)
{
debug_message("buffer_len", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
return buf->data_len;
}
void
buffer_data (buffer buf, char * cvec)
{
debug_message("buffer_data", 0);
assert (buf != 0);
assert (buf->magic_cookie == BUFFER_MC);
assert (buf->buffer_len == 0 || buf->data_len <= buf->buffer_len);
memcpy (cvec, buf->data, buf->data_len);
}
#ifdef TESTMAIN
#include <stdio.h>
int
main (int argc, char * argv [])
{
int c;
buffer buf;
FILE * f;
buf = new_buffer ();
f = fopen ("COPYING", "r");
if (f == NULL)
{
perror (argv[0]);
return 1;
}
while ( (c = getc (f)) != EOF)
if (!buffer_append (buf, c))
{
buffer_free (buf);
fprintf (stderr, "%s: unable to allocate enough memory, bailing out.\n", argv[0]);
fclose (f);
return 1;
}
fclose (f);
puts (buffer_c_str (buf));
printf ("%d\n", buffer_len (buf));
buffer_free (buf);
return 0;
}
#endif /* TESTMAIN */
|