X-Git-Url: http://www.privoxy.org/gitweb/?p=privoxy.git;a=blobdiff_plain;f=list.c;h=078723cc8dcab59e162f97f03fa13d29aa878fb3;hp=0625e660f40a918b7dbfa7ed08c15f533bd7ba0c;hb=10b7e71a71fdd84b5bb5cf58e79c2a7a0742f3fd;hpb=20b6fe1c584e105f529d0fc92c02d62c214a29d3 diff --git a/list.c b/list.c index 0625e660..078723cc 100644 --- a/list.c +++ b/list.c @@ -1,4 +1,4 @@ -const char list_rcs[] = "$Id: list.c,v 1.9 2001/09/16 13:20:29 jongfoster Exp $"; +const char list_rcs[] = "$Id: list.c,v 1.11 2001/10/23 21:21:03 jongfoster Exp $"; /********************************************************************* * * File : $Source: /cvsroot/ijbswa/current/list.c,v $ @@ -11,10 +11,10 @@ const char list_rcs[] = "$Id: list.c,v 1.9 2001/09/16 13:20:29 jongfoster Exp $" * IJBSWA team. http://ijbswa.sourceforge.net * * Based on the Internet Junkbuster originally written - * by and Copyright (C) 1997 Anonymous Coders and + * by and Copyright (C) 1997 Anonymous Coders and * Junkbusters Corporation. http://www.junkbusters.com * - * This program is free software; you can redistribute it + * 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 @@ -34,6 +34,14 @@ const char list_rcs[] = "$Id: list.c,v 1.9 2001/09/16 13:20:29 jongfoster Exp $" * * Revisions : * $Log: list.c,v $ + * Revision 1.11 2001/10/23 21:21:03 jongfoster + * New error handling - error codes are now jb_errs, not ints. + * Changed the way map() handles out-of-memory, to dramatically + * reduce the amount of error-checking clutter needed. + * + * Revision 1.10 2001/09/16 17:30:24 jongfoster + * Fixing a compiler warning. + * * Revision 1.9 2001/09/16 13:20:29 jongfoster * Rewrite of list library. Now has seperate header and list_entry * structures. Also added a large sprinking of assert()s to the list @@ -102,7 +110,7 @@ const char list_rcs[] = "$Id: list.c,v 1.9 2001/09/16 13:20:29 jongfoster Exp $" #endif #include -#ifndef _WIN32 +#if !defined(_WIN32) && !defined(__OS2__) #include #endif @@ -127,8 +135,8 @@ static int list_is_valid (const struct list *the_list); * then pass it to this function. * (Implementation note: Rather than calling this * function, you can also just memset the memory to - * zero, e.g. if you have a larger structure you - * want to initialize quickly. However, that isn't + * zero, e.g. if you have a larger structure you + * want to initialize quickly. However, that isn't * really good design.) * * Parameters : @@ -154,9 +162,9 @@ void init_list(struct list *the_list) * calling list_init(). * * (Implementation note: You *can* reuse the_list - * without calling list_init(), but please don't. + * without calling list_init(), but please don't. * If you want to remove all entries from a list - * and still have a usable list, then use + * and still have a usable list, then use * list_remove_all().) * * Parameters : @@ -174,7 +182,7 @@ void destroy_list (struct list *the_list) for (cur_entry = the_list->first; cur_entry ; cur_entry = next_entry) { next_entry = cur_entry->next; - freez((char *)cur_entry->str); + freez(cur_entry->str); free(cur_entry); } @@ -190,7 +198,7 @@ void destroy_list (struct list *the_list) * Description : Check that a string list is valid. The intended * usage is "assert(list_is_valid(the_list))". * Currently this checks that "the_list->last" - * is correct, and that the list dosn't contain + * is correct, and that the list dosn't contain * circular references. It is likely to crash if * it's passed complete garbage. * @@ -220,7 +228,7 @@ static int list_is_valid (const struct list *the_list) if (cur_entry->str) { /* - * Just check that this string can be accessed - i.e. it's a valid + * Just check that this string can be accessed - i.e. it's a valid * pointer. */ strlen(cur_entry->str); @@ -269,11 +277,12 @@ static int list_is_valid (const struct list *the_list) * 1 : the_list = pointer to list * 2 : str = string to add to the list (maybe NULL) * - * Returns : 0 on success, nonzero on out-of-memory error. On - * error, the_list will be unchanged. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. + * On error, the_list will be unchanged. * *********************************************************************/ -int enlist(struct list *the_list, const char *str) +jb_err enlist(struct list *the_list, const char *str) { struct list_entry *cur; @@ -282,7 +291,7 @@ int enlist(struct list *the_list, const char *str) if (NULL == (cur = (struct list_entry *)zalloc(sizeof(*cur)))) { - return 1; + return JB_ERR_MEMORY; } if (str) @@ -290,7 +299,7 @@ int enlist(struct list *the_list, const char *str) if (NULL == (cur->str = strdup(str))) { free(cur); - return 1; + return JB_ERR_MEMORY; } } /* else { cur->str = NULL; } - implied by zalloc */ @@ -309,7 +318,7 @@ int enlist(struct list *the_list, const char *str) } assert(list_is_valid(the_list)); - return 0; + return JB_ERR_OK; } @@ -324,11 +333,12 @@ int enlist(struct list *the_list, const char *str) * 1 : the_list = pointer to list * 2 : str = string to add to the list (maybe NULL) * - * Returns : 0 on success, nonzero on out-of-memory error. On - * error, the_list will be unchanged. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. + * On error, the_list will be unchanged. * *********************************************************************/ -int enlist_first(struct list *the_list, const char *str) +jb_err enlist_first(struct list *the_list, const char *str) { struct list_entry *cur; @@ -337,7 +347,7 @@ int enlist_first(struct list *the_list, const char *str) if (NULL == (cur = (struct list_entry *)zalloc(sizeof(*cur)))) { - return 1; + return JB_ERR_MEMORY; } if (str) @@ -345,11 +355,11 @@ int enlist_first(struct list *the_list, const char *str) if (NULL == (cur->str = strdup(str))) { free(cur); - return 1; + return JB_ERR_MEMORY; } } /* else { cur->str = NULL; } - implied by zalloc */ - + cur->next = the_list->first; the_list->first = cur; @@ -359,7 +369,7 @@ int enlist_first(struct list *the_list, const char *str) } assert(list_is_valid(the_list)); - return 0; + return JB_ERR_OK; } @@ -370,7 +380,7 @@ int enlist_first(struct list *the_list, const char *str) * Description : Append a string into a specified string list, * if & only if it's not there already. * If the num_significant_chars argument is nonzero, - * only compare up to the nth character. + * only compare up to the nth character. * * Parameters : * 1 : the_list = pointer to list @@ -378,14 +388,15 @@ int enlist_first(struct list *the_list, const char *str) * 3 : num_significant_chars = number of chars to use * for uniqueness test, or 0 to require an exact match. * - * Returns : 0 on success, nonzero on out-of-memory error. On - * error, the_list will be unchanged. "Success" - * does not indicate whether or not the item was - * already in the list. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. + * On error, the_list will be unchanged. + * "Success" does not indicate whether or not the + * item was already in the list. * *********************************************************************/ -int enlist_unique(struct list *the_list, const char *str, - int num_significant_chars) +jb_err enlist_unique(struct list *the_list, const char *str, + int num_significant_chars) { struct list_entry *cur_entry; @@ -403,7 +414,7 @@ int enlist_unique(struct list *the_list, const char *str, && (0 == strncmp(str, cur_entry->str, num_significant_chars))) { /* Already there */ - return 0; + return JB_ERR_OK; } } } @@ -415,7 +426,7 @@ int enlist_unique(struct list *the_list, const char *str, if ( (cur_entry->str != NULL) && (0 == strcmp(str, cur_entry->str))) { /* Already there */ - return 0; + return JB_ERR_OK; } } } @@ -437,16 +448,18 @@ int enlist_unique(struct list *the_list, const char *str, * 2 : name = HTTP header name (e.g. "Content-type") * 3 : value = HTTP header value (e.g. "text/html") * - * Returns : 0 on success, nonzero on out-of-memory error. On - * error, the_list will be unchanged. "Success" - * does not indicate whether or not the header was - * already in the list. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. + * On error, the_list will be unchanged. + * "Success" does not indicate whether or not the + * header was already in the list. * *********************************************************************/ -int enlist_unique_header(struct list *the_list, const char *name, const char *value) +jb_err enlist_unique_header(struct list *the_list, const char *name, + const char *value) { int length; - int result; + jb_err result; char *str; assert(the_list); @@ -457,7 +470,7 @@ int enlist_unique_header(struct list *the_list, const char *name, const char *va length = strlen(name) + 2; if (NULL == (str = (char *)malloc(length + strlen(value) + 1))) { - return 1; + return JB_ERR_MEMORY; } strcpy(str, name); str[length - 2] = ':'; @@ -481,7 +494,7 @@ int enlist_unique_header(struct list *the_list, const char *name, const char *va * Description : Remove all entries from a list. On return, the_list * is a valid, empty list. Note that this is similar * to destroy_list(), but the difference is that this - * function guarantees that the list structure is still + * function guarantees that the list structure is still * valid after the call. * * Parameters : @@ -501,7 +514,7 @@ void list_remove_all(struct list *the_list) for (cur_entry = the_list->first; cur_entry ; cur_entry = next_entry) { next_entry = cur_entry->next; - freez((char *)cur_entry->str); + freez(cur_entry->str); free(cur_entry); } @@ -546,7 +559,7 @@ char *list_to_text(const struct list *the_list) if ((ret = (char *)malloc(size + 1)) == NULL) { - return(NULL); + return NULL; } ret[size] = '\0'; @@ -564,7 +577,7 @@ char *list_to_text(const struct list *the_list) } *s++ = '\r'; *s++ = '\n'; - return(ret); + return ret; } @@ -679,11 +692,12 @@ int list_remove_list(struct list *dest, const struct list *src) * All existing entries will be removed. * 1 : src = pointer to source list for copy. * - * Returns : 0 on success, nonzero on error. On error, dest - * will be empty. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. + * On error, dest will be empty. * *********************************************************************/ -int list_duplicate(struct list *dest, const struct list *src) +jb_err list_duplicate(struct list *dest, const struct list *src) { struct list_entry * cur_src; struct list_entry * cur_dest; @@ -707,7 +721,7 @@ int list_duplicate(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 1; + return JB_ERR_MEMORY; } if (cur_src->str) @@ -720,7 +734,7 @@ int list_duplicate(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 1; + return JB_ERR_MEMORY; } } /* else { cur_dest->str = NULL; } - implied by zalloc */ @@ -736,7 +750,7 @@ int list_duplicate(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 1; + return JB_ERR_MEMORY; } if (cur_src->str) { @@ -748,7 +762,7 @@ int list_duplicate(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 1; + return JB_ERR_MEMORY; } } /* else { cur_dest->str = NULL; } - implied by zalloc */ @@ -760,7 +774,7 @@ int list_duplicate(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 0; + return JB_ERR_OK; } @@ -775,12 +789,13 @@ int list_duplicate(struct list *dest, const struct list *src) * 1 : dest = pointer to destination list for merge. * 2 : src = pointer to source for merge. * - * Returns : 0 on success, nonzero on out-of-memory error. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. * On error, some (but not all) of src might have * been copied into dest. * *********************************************************************/ -int list_append_list_unique(struct list *dest, const struct list *src) +jb_err list_append_list_unique(struct list *dest, const struct list *src) { struct list_entry * cur; @@ -798,7 +813,7 @@ int list_append_list_unique(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 1; + return JB_ERR_MEMORY; } } } @@ -806,7 +821,7 @@ int list_append_list_unique(struct list *dest, const struct list *src) assert(list_is_valid(src)); assert(list_is_valid(dest)); - return 0; + return JB_ERR_OK; } @@ -826,7 +841,7 @@ int list_is_empty(const struct list *the_list) { assert(the_list); assert(list_is_valid(the_list)); - + return (the_list->first == NULL); } @@ -871,10 +886,10 @@ void free_map(struct map *the_map) return; } - for (cur_entry = the_map->first; cur_entry != NULL; cur_entry = next_entry) + for (cur_entry = the_map->first; cur_entry != NULL; cur_entry = next_entry) { - freez((char *)cur_entry->name); - freez((char *)cur_entry->value); + freez(cur_entry->name); + freez(cur_entry->value); next_entry = cur_entry->next; free(cur_entry); @@ -897,6 +912,27 @@ void free_map(struct map *the_map) * later, set the copy flags for constants or * strings that will be independantly free()d. * + * Note2: This function allows NULL parameters - it + * returns JB_ERR_MEMORY in that case. + * + * Note3: If this function returns JB_ERR_MEMORY, + * it will free(name) unless you specify + * name_needs_copying, and similarly it will + * free(value) unless you specify + * value_needs_copying. + * + * Due to Note2 and Note3 above, the following code + * is legal, and will never crash or leak memory even + * if the system runs out of memory: + * + * err = map(mymap, "xyz", 1, html_encode(somestring), 0); + * + * err will be set to JB_ERR_MEMORY if either call runs + * out-of-memory. Without these features, you would + * need to check the return value of html_encode in the + * above example for NULL, which (at least) doubles the + * amount of error-checking code needed. + * * Parameters : * 1 : the_map = map to add to * 2 : name = name to add @@ -904,22 +940,31 @@ void free_map(struct map *the_map) * 4 : value = value to add * 5 : value_needs_copying = flag set if a copy of value should be used * - * Returns : 0 on success, nonzero on out-of-memory error. + * Returns : JB_ERR_OK on success + * JB_ERR_MEMORY on out-of-memory error. * *********************************************************************/ -int map(struct map *the_map, - const char *name, int name_needs_copying, - const char *value, int value_needs_copying) +jb_err map(struct map *the_map, + const char *name, int name_needs_copying, + const char *value, int value_needs_copying) { struct map_entry *new_entry; assert(the_map); - assert(name); - assert(value); - if (NULL == (new_entry = zalloc(sizeof(*new_entry)))) + if ( (NULL == value) + || (NULL == name) + || (NULL == (new_entry = zalloc(sizeof(*new_entry)))) ) { - return 1; + if ((name != NULL) && (!name_needs_copying)) + { + free((char *)name); + } + if ((value != NULL) && (!value_needs_copying)) + { + free((char *)value); + } + return JB_ERR_MEMORY; } if (name_needs_copying) @@ -927,7 +972,11 @@ int map(struct map *the_map, if (NULL == (name = strdup(name))) { free(new_entry); - return 1; + if (!value_needs_copying) + { + free((char *)value); + } + return JB_ERR_MEMORY; } } @@ -935,12 +984,9 @@ int map(struct map *the_map, { if (NULL == (value = strdup(value))) { - if (name_needs_copying) - { - free((char *)name); - } + free((char *)name); free(new_entry); - return 1; + return JB_ERR_MEMORY; } } @@ -959,7 +1005,7 @@ int map(struct map *the_map, the_map->last = new_entry; } - return 0; + return JB_ERR_OK; }