File: utils.c

package info (click to toggle)
newspost 2.1.1-4
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k, sarge
  • size: 404 kB
  • ctags: 469
  • sloc: ansic: 4,893; makefile: 120; sh: 72
file content (307 lines) | stat: -rw-r--r-- 6,799 bytes parent folder | download
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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
 * Author: Jim Faulkner <newspost@sdf.lonestar.org>
 *
 * 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; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 * 
 */

#include <stdarg.h>

#include "newspost.h"
#include "../ui/errors.h"

static long buff_data_length(char *fmt, va_list ap);

file_entry * file_entry_alloc(){
	file_entry * fe = malloc(sizeof(file_entry));
	fe->parts = NULL;
	fe->filename = NULL;
	return fe;
}

file_entry * file_entry_free(file_entry *fe){
	if(fe != NULL){
		if(fe->parts != NULL)
			free(fe->parts);
		if(fe->filename != NULL)
			buff_free(fe->filename);
		free(fe);
	}
	return NULL;
}

Buff * getline(Buff *buff, FILE *file){
	int c = fgetc(file);
	buff = buff_free(buff);
	while(TRUE){
		if((c == '\n')
		   || (c == EOF)) break;
		buff = buff_add(buff, "%c", c);
		c = fgetc(file);
	}
	
	return buff;
}

/* Accepts subset of printf() syntax. 
   Supports %c, %s, %i, %%, and %0*i
   More can be added in buff_data_length() */
Buff *buff_create(Buff *buff, char *data, ... ){
	va_list ap;
	long datalength;
	
	/* find out the total length of the data */
	va_start(ap, data);
	datalength = buff_data_length(data, ap);
	va_end(ap);

	/* this function frees whatever *buff points to! */
	if(buff != NULL)
		buff = buff_free(buff);

	if(datalength == 0) return NULL;

	/* initialize the Buff */
	buff = malloc(sizeof(Buff));
	buff->length = datalength;
	
	/* determine the real length to make this buffer */
	/* real length is more than length... this reduces the number of realloc()s */
	for(buff->real_length = 2 ; 
	    buff->real_length <= datalength; 
	    buff->real_length = buff->real_length * 2){}
	buff->data = malloc(buff->real_length);
	
	/* write the data to the memory we just malloced */
	va_start(ap, data);
	vsprintf(buff->data,data,ap);
	va_end(ap);
	buff->data[buff->length] = '\0';

	return buff;
}

/* Accepts subset of printf() syntax. 
   Supports %c, %s, %i, %%, and %0*i
   More can be added in buff_data_length() */
Buff *buff_add(Buff *buff, char *data, ... ){
	va_list ap;
	long datalength;

	/* find out the total length of the data */
	va_start(ap, data);
	datalength = buff_data_length(data, ap);
	va_end(ap);

	va_start(ap, data);
	if(buff == NULL){
		if(datalength == 0) return NULL;
		
		/* initialize the Buff */
		buff = malloc(sizeof(Buff));
		buff->length = datalength;
		
		/* determine the real length to make this buffer */
		for(buff->real_length = 2 ; 
		    buff->real_length <= datalength; 
		    buff->real_length = buff->real_length * 2){}
		buff->data = malloc(buff->real_length);
		
		/* write the data to the memory we just malloced */
		vsprintf(buff->data,data,ap);
	}
	else{
		/* save the old length (where to start writing data)
		   and update the Buff */
		int oldlength = buff->length;
		buff->length += datalength;
		
		/* realloc more memory if necessary */
		if(buff->length >= buff->real_length){
			for(;
			    buff->real_length <= buff->length;
			    buff->real_length = buff->real_length * 2){}
			buff->data = realloc(buff->data, buff->real_length);
		}
		
		/* append the data to the buff */
		vsprintf((buff->data + oldlength), data, ap);
	}
	va_end(ap);
	buff->data[buff->length] = '\0';
	
	return buff;
}

Buff * buff_free(Buff *buff){
	if(buff != NULL){
		free(buff->data);
		free(buff);
	}
	return NULL;
}

/* Find last occurrence of '/' or '\\'; return rest of string */
const char *n_basename(const char *path) {
	const char *current;

	for (current = path; *current; current++)
		if (('/' == *current) || ('\\' == *current))
			path = current + 1;

	return path;
}

SList *slist_next(SList *slist) {
	return slist->next;
}

SList *slist_remove(SList *slist, void *data) {
	SList *si = slist;
	SList *prev = NULL;

	while (si != NULL) {
		if (si->data == data) {
			if (prev == NULL) {
				si = si->next;
				free(slist);
				return si;
			}
			prev->next = si->next;
			free(si);
			return slist;
		}
		prev = si;
		si = si->next;
	}
	return slist;
}

SList *slist_append(SList *slist, void *data) {
	SList *si;
	if (slist == NULL) {
		slist = (SList *) malloc(sizeof(SList));
		slist->data = data;
		slist->next = NULL;
		return slist;
	}
	else {
		si = slist;
		while (si->next != NULL)
			si = si->next;

		si->next = (SList *) malloc(sizeof(SList));
		si = si->next;
		si->data = data;
		si->next = NULL;
		return slist;
	}
}

SList *slist_prepend(SList *slist, void *data) {
	SList *si;
	if (slist == NULL) {
		slist = (SList *) malloc(sizeof(SList));
		slist->data = data;
		slist->next = NULL;
		return slist;		
	}
	else {
		si = (SList *) malloc(sizeof(SList));
		si->data = data;
		si->next = slist;
		return si;
	}
}

void slist_free(SList *slist) {
	SList *si;
	while (slist != NULL) {
		si = slist;
		slist = slist->next;
		free(si);
	}
}

int slist_length(SList *slist) {
	int i = 0;
	while (slist != NULL) {
		i++;
		slist = slist->next;
	}
	return i;
}

/**
*** Private Routines
**/

static long buff_data_length(char *fmt, va_list ap){
	char *pi;
	char lengthstr[64]; /* all numbers will fit in here */
	long retval = 0;
	
	/* go through the string, looking for '%' */
	for(pi = fmt; *pi; pi++){
		if(*pi == '%'){
			switch(*++pi){
			case 's':
				/* add the length of the string argument */
				retval += strlen(va_arg(ap, char *));
				break;

			case '%':
				/* add one.  its just a '%'! */
				retval++;
				break;

			case 'c':
				/* add one. we have to call va_arg()
				   to go to the next argument */
				va_arg(ap, int);
				retval++;
				break;

			case 'i':
				/* add the length of the number */
				sprintf(lengthstr,"%i",va_arg(ap, int));
				retval += strlen(lengthstr);
				break;

			case '0':
				/* add the number of zeroes used in zero-padding */
				if(*++pi == '*'){
					if(*++pi == 'i'){
						retval += va_arg(ap, int);
						va_arg(ap, int);
						break;
					}
				}

			/* This only works with a subset of printf syntax.
			   If you want to add more you must handle it above. */
			default:
				fprintf(stderr, "\nInternal Error: see utils.c\n");
				exit(EXIT_UNKNOWN);
			}
		}
		else{
			/* a plain character */
			retval++;
		}
	}
	return retval;
}