« back to all changes in this revision
Viewing changes to util.c
- browse files at revision 1
- compare with another revision
- download diff
- download tarball
- view history from revision 1
- Committer: Bazaar Package Importer
- Author(s): Jens Peter Secher
- Date: 2004-11-19 23:30:24 UTC
- Revision ID: james.westby@ubuntu.com-20041119233024-3s7sqpy963jx22eu
Tags: upstream-1.3.4
Import upstream version 1.3.4
- files added:
- argp
- include
added
removed
util.c
1
/* ifile - intelligent mail filter for EXMH/MH
2
ifile is Copyright (C) 1997 Jason Rennie <jrennie@ai.mit.edu>
3
4
This program is free software; you can redistribute it and/or
5
modify it under the terms of the GNU General Public License
6
as published by the Free Software Foundation; either version 2
7
of the License, or (at your option) any later version.
8
9
This program is distributed in the hope that it will be useful,
10
but WITHOUT ANY WARRANTY; without even the implied warranty of
11
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
GNU General Public License for more details.
13
14
You should have received a copy of the GNU General Public License
15
along with this program (see file 'COPYING'); if not, write to the Free
16
Software Foundation, Inc., 59 Temple Place - Suite 330,
17
Boston, MA 02111-1307, USA.
18
*/
19
20
#include <stdarg.h>
21
#include <time.h>
22
#include <ifile.h> /* main ifile function library */
23
24
/* variables for keeping track of time/speed of ifile */
25
extern clock_t DMZ_start, DMZ_end, DMZ2_start;
26
27
/* returns a hash value for the string S */
28
/* written by Jason Rennie <jrennie@ai.mit.edu> */
29
unsigned long
30
hash (const char * s, long int size)
31
{
32
long int hashval;
33
34
if (s == NULL) return 0;
35
36
for(hashval=0; *s!='\0'; s++)
37
hashval = (*s + (hashval << 5) - hashval) % size;
38
39
return hashval;
40
}
41
42
43
/* Given a printf style format string and an arbitrarily long list of
44
* arguments which are in accordance with the format string, ifile_sprintf
45
* will allocate memory for and create a string according to the given
46
* information. */
47
/* Written by Jason Rennie <jrennie@ai.mit.edu> for ifile. */
48
char *
49
ifile_sprintf (char * format, ...)
50
{
51
char buf[MAX_STR_LEN] = ""; /* holds string to be returned by function */
52
va_list ap;
53
char * rtn;
54
55
va_start(ap, format);
56
assert(vsprintf(buf, format, ap) < MAX_STR_LEN - 1);
57
va_end(ap);
58
59
rtn = malloc(strlen(buf)+1);
60
if (!rtn) abort();
61
strcpy(rtn, buf);
62
return rtn;
63
}
64
65
66
/* Returns a string which is the concatenation of an arbitrary number
67
* of strings passed as arguments to the function.
68
* First argumet passed to function is the number of strings passed to
69
* the function which are to be concatenated. */
70
/* written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
71
char *
72
ifile_cats (long int num_strings, ...)
73
{
74
va_list ap;
75
long int string_size = 0;
76
char * new_string = NULL;
77
long int i = 0;
78
79
va_start(ap, num_strings);
80
for (i=0; i < num_strings; i++)
81
string_size += strlen(va_arg(ap, char *));
82
va_end(ap);
83
84
new_string = malloc(string_size+1);
85
if (!new_string) abort();
86
new_string[0] = '\0';
87
88
va_start(ap, num_strings);
89
for (i=0; i < num_strings; i++)
90
strcat(new_string, va_arg(ap, char *));
91
va_end(ap);
92
93
return new_string;
94
}
95
96
97
/* Given an integer value, allocates space for and returns a string
98
* representing the integer in character form */
99
/* Written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
100
char *
101
itoa (long int number)
102
{
103
linked_list * list = NULL;
104
linked_list * new_digit = NULL;
105
linked_list * list_ptr = NULL, * old_list_ptr = NULL;
106
char buf[MAX_STR_LEN];
107
long int negative = FALSE;
108
long int i = 0;
109
char * tmp = NULL;
110
111
if (number == 0)
112
{
113
tmp = malloc(strlen("0") + 1);
114
if (!tmp) abort();
115
strcpy(tmp, "0");
116
return tmp;
117
}
118
119
if (number < 0)
120
{
121
number = abs(number);
122
negative = TRUE;
123
}
124
125
/* Loads digits into stack-like linked list */
126
127
while (number > 0)
128
{
129
new_digit = (linked_list *) malloc(sizeof(linked_list));
130
if (!new_digit) abort();
131
new_digit->next = list;
132
new_digit->digit = number - ((number/10)*10);
133
number /= 10;
134
list = new_digit;
135
}
136
137
/* Removes digits from list, copying them into the string to be returned */
138
139
i = 0;
140
if (negative == TRUE)
141
{
142
buf[0] = '-';
143
i++;
144
}
145
list_ptr = list;
146
for (; i < MAX_STR_LEN - 1; i++)
147
{
148
buf[i] = 48 + list_ptr->digit;
149
old_list_ptr = list_ptr;
150
list_ptr = list_ptr -> next;
151
free(old_list_ptr);
152
if (list_ptr == NULL) break;
153
}
154
buf[i+1] = '\0';
155
tmp = malloc(strlen(buf) + 1);
156
if (!tmp) abort();
157
strcpy(tmp, buf);
158
return tmp;
159
}
160
161
162
/*
163
* Reads up to and including the next feedline (\n). Returns a pointer to
164
* STRING on success, and NULL on EOF or error. Updates bufp also.
165
*/
166
/* Written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
167
char *
168
readline (char **bufp)
169
{
170
char *first = *bufp, *last;
171
172
last = strchr(first, '\n');
173
if (last == NULL)
174
{
175
return NULL;
176
}
177
*last = '\0';
178
*bufp = last + 1;
179
180
return first;
181
}
182
183
184
/* Wrapper for standard free() function. Frees memory and then sets
185
* pointer equal to NULL. */
186
/* Written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
187
188
/* This seems like a big noop that's costing us efficiency -- jhbrown */
189
void
190
ifile_free (void * var)
191
{
192
free(var);
193
var = NULL;
194
}
195
196
197
/* Accepts a pointer to a message and prints out all the words of that
198
* message */
199
void
200
ifile_print_message (htable * message)
201
{
202
hash_elem * elem;
203
204
for (elem = htable_init_traversal(message);
205
elem != NULL; elem = htable_next_traversal(message, elem))
206
printf("(%ld,%s) ", (long int) elem->entry, (char *) elem->index);
207
printf("\n");
208
}
209
210
211
/* Accepts a file pointer and reads/lexes text from the associated file.
212
* Returns a hash table which maps words appearing in the message to
213
* their frequency in the message. */
214
/* The GOOD code! This uses Andrew's cool lexing code :) */
215
/* Written by Jason Rennie <jrennie@ai.mit.edu> and others for ifile */
216
htable *
217
ifile_read_message (FILE * FP)
218
{
219
ifile_lex * document;
220
char token[MAX_STR_LEN];
221
long int token_len; /* length of token */
222
long int old_freq; /* previous frequency of word */
223
htable * message = malloc(sizeof(htable));
224
if (!message) abort();
225
226
ifile_verbosify(ifile_verbose, "Reading message...\n");
227
htable_init(message, 100, (unsigned long (*)(const void *, long int)) hash);
228
229
DMZ2_start = clock();
230
231
document = ifile_default_lexer->open_text_fp (ifile_default_lexer, FP);
232
233
if (document)
234
{
235
token_len = ifile_default_lexer->get_word (ifile_default_lexer, document,
236
token, MAX_STR_LEN);
237
while (token_len != 0)
238
{
239
ifile_verbosify(ifile_debug, "Read \'%s\'. length=%d\n", token,
240
token_len);
241
/* update arrays which strictly concern message */
242
old_freq = (long int) htable_lookup(message, (void *) token);
243
htable_put(message, ((char *) token),
244
(void *) (old_freq+1));
245
246
token_len = ifile_default_lexer->get_word (ifile_default_lexer,
247
document, token, MAX_STR_LEN);
248
}
249
250
ifile_default_lexer->close (ifile_default_lexer, document);
251
}
252
else
253
{
254
ifile_verbosify(ifile_quiet, "Unable to read message.\n");
255
ifile_free(message);
256
return NULL;
257
}
258
259
ifile_verbosify(ifile_debug, "\n");
260
DMZ_end = clock();
261
ifile_verbosify(ifile_verbose,
262
"Finishing reading message. Time used: %.3f sec\n",
263
((float)(DMZ_end-DMZ2_start))/CLOCKS_PER_SECOND);
264
265
return message;
266
}
267
268
269
/* Given a hash table representing a message, changes all non-zero
270
* frequency values to zero */
271
void
272
ifile_bitify_document(htable * message)
273
{
274
hash_elem *elem;
275
276
for (elem = htable_init_traversal(message);
277
elem != NULL; elem = htable_next_traversal(message, elem))
278
if ((long int) elem->entry > 0)
279
elem->entry = (void *) 1U;
280
}
281
282
283
/* Given an array of categories and their respective ratings, prints
284
* the information to the given file */
285
/* Written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
286
void
287
ifile_print_ratings (FILE * FP, category_rating * ratings, ifile_db * idata,
288
int thresh)
289
{
290
long int i;
291
292
for (i = 0; i < idata->num_folders; i++)
293
fprintf(FP, "%s %.8f\n", ratings[i].category, ratings[i].rating);
294
295
if (thresh != 0 &&
296
idata->num_folders > 0 &&
297
(ratings[0].rating + ratings[1].rating) != 0)
298
{
299
fprintf(FP, "diff[%s,%s](%%) %.2f\n",
300
ratings[0].category, ratings[1].category,
301
-(ratings[0].rating - ratings[1].rating) /
302
(ratings[0].rating + ratings[1].rating) * 100);
303
}
304
fprintf(FP, "---------\n");
305
}
306
307
/* Written by Karl Vogel <vogelke@dnaco.net> for ifile */
308
void
309
ifile_concise_ratings (char * path, FILE * FP, category_rating * ratings,
310
ifile_db * idata, int thresh)
311
{
312
//if (path) fprintf (FP, "%s ", path);
313
float diff=0;
314
315
diff=thresh+1;
316
317
if (thresh != 0 &&
318
idata->num_folders > 0 &&
319
(ratings[0].rating + ratings[1].rating) != 0)
320
{
321
diff = -(ratings[0].rating - ratings[1].rating) /
322
(ratings[0].rating + ratings[1].rating) * 1000;
323
}
324
if (path) fprintf (FP, "%s ", path);
325
if (idata->num_folders > 0 && diff < thresh)
326
fprintf (FP, "%s,%s\n", ratings[0].category, ratings[1].category);
327
else
328
fprintf (FP, "%s\n", ratings[0].category);
329
}
330
331
/* Returns a pointer to a new string that is an exact duplicate of the
332
* string pointed to by the s1 parameter. The malloc() function is
333
* used to allocate space for the new string. */
334
/* written by Jason Rennie <jrennie@ai.mit.edu> for ifile */
335
char *
336
ifile_strdup (const char *s1)
337
{
338
char *s = (char *) malloc(strlen(s1)+1);
339
340
if (!s) abort();
341
strcpy(s, s1);
342
343
return s;
344
}
Loggerhead is a web-based interface for Breezy
Version: 2.0.1