Loading lib/Makefile.am +2 −1 Original line number Diff line number Diff line Loading @@ -56,7 +56,8 @@ escape.c mprintf.c telnet.c \ escape.h getpass.c netrc.c telnet.h \ getinfo.c getinfo.h transfer.c strequal.c strequal.h easy.c \ security.h security.c krb4.c krb4.h memdebug.c memdebug.h inet_ntoa_r.h \ http_chunks.c http_chunks.h strtok.c strtok.h connect.c connect.h http_chunks.c http_chunks.h strtok.c strtok.h connect.c connect.h \ llist.c llist.h hash.c hash.h noinst_HEADERS = setup.h transfer.h Loading lib/connect.c +2 −7 Original line number Diff line number Diff line Loading @@ -210,11 +210,11 @@ static CURLcode bindlocal(struct connectdata *conn, in_addr_t in; if(Curl_if2ip(data->set.device, myhost, sizeof(myhost))) { h = Curl_getaddrinfo(data, myhost, 0, &hostdataptr); h = Curl_resolv(data, myhost, 0, &hostdataptr); } else { if(strlen(data->set.device)>1) { h = Curl_getaddrinfo(data, data->set.device, 0, &hostdataptr); h = Curl_resolv(data, data->set.device, 0, &hostdataptr); } if(h) { /* we know data->set.device is shorter than the myhost array */ Loading @@ -229,8 +229,6 @@ static CURLcode bindlocal(struct connectdata *conn, hostent_buf, sizeof(hostent_buf)); */ if(hostdataptr) free(hostdataptr); /* allocated by Curl_getaddrinfo() */ return CURLE_HTTP_PORT_FAILED; } Loading Loading @@ -304,9 +302,6 @@ static CURLcode bindlocal(struct connectdata *conn, return CURLE_HTTP_PORT_FAILED; } if(hostdataptr) free(hostdataptr); /* allocated by Curl_getaddrinfo() */ return CURLE_OK; } /* end of device selection support */ Loading lib/easy.c +6 −1 Original line number Diff line number Diff line Loading @@ -76,6 +76,7 @@ #include "ssluse.h" #include "url.h" #include "getinfo.h" #include "hostip.h" #define _MPRINTF_REPLACE /* use our functions only */ #include <curl/mprintf.h> Loading Loading @@ -140,6 +141,8 @@ CURLcode curl_global_init(long flags) if (initialized) return CURLE_OK; Curl_host_cache_init(); if (flags & CURL_GLOBAL_SSL) Curl_SSL_init(); Loading @@ -162,6 +165,8 @@ void curl_global_cleanup(void) if (!initialized) return; Curl_host_cache_dtor(); if (init_flags & CURL_GLOBAL_SSL) Curl_SSL_cleanup(); Loading lib/ftp.c +7 −13 Original line number Diff line number Diff line Loading @@ -1174,19 +1174,19 @@ CURLcode ftp_use_port(struct connectdata *conn) if(data->set.ftpport) { if(Curl_if2ip(data->set.ftpport, myhost, sizeof(myhost))) { h = Curl_getaddrinfo(data, myhost, 0, &hostdataptr); h = Curl_resolv(data, myhost, 0, &hostdataptr); } else { if(strlen(data->set.ftpport)>1) h = Curl_getaddrinfo(data, data->set.ftpport, 0, &hostdataptr); int len = strlen(data->set.ftpport); if(len>1) h = Curl_resolv(data, data->set.ftpport, 0, &hostdataptr); if(h) strcpy(myhost, data->set.ftpport); /* buffer overflow risk */ } } if(! *myhost) { h=Curl_getaddrinfo(data, getmyhost(myhost, sizeof(myhost)), 0, &hostdataptr); char *tmp_host = getmyhost(myhost, sizeof(myhost)); h=Curl_resolv(data, tmp_host, 0, &hostdataptr); } infof(data, "We connect from %s\n", myhost); Loading Loading @@ -1237,9 +1237,6 @@ CURLcode ftp_use_port(struct connectdata *conn) free(hostdataptr); return CURLE_FTP_PORT_FAILED; } if(hostdataptr) /* free the memory used for name lookup */ Curl_freeaddrinfo(hostdataptr); } else { failf(data, "could't find my own IP address (%s)", myhost); Loading Loading @@ -1431,7 +1428,7 @@ CURLcode ftp_use_pasv(struct connectdata *conn) } else { /* normal, direct, ftp connection */ addr = Curl_getaddrinfo(data, newhostp, newport, &hostdataptr); addr = Curl_resolv(data, newhostp, newport, &hostdataptr); if(!addr) { failf(data, "Can't resolve new host %s", newhost); return CURLE_FTP_CANT_GET_HOST; Loading @@ -1450,9 +1447,6 @@ CURLcode ftp_use_pasv(struct connectdata *conn) /* this just dumps information about this second connection */ ftp_pasv_verbose(conn, conninfo, newhost, connectport); if(hostdataptr) Curl_freeaddrinfo(hostdataptr); if(CURLE_OK != result) return result; Loading lib/hash.c 0 → 100644 +271 −0 Original line number Diff line number Diff line /***************************************************************************** * _ _ ____ _ * Project ___| | | | _ \| | * / __| | | | |_) | | * | (__| |_| | _ <| |___ * \___|\___/|_| \_\_____| * * Copyright (C) 2001, Daniel Stenberg, <daniel@haxx.se>, et al * * In order to be useful for every potential user, curl and libcurl are * dual-licensed under the MPL and the MIT/X-derivate licenses. * * You may opt to use, copy, modify, merge, publish, distribute and/or sell * copies of the Software, and permit persons to whom the Software is * furnished to do so, under the terms of the MPL or the MIT/X-derivate * licenses. You may pick one of these licenses. * * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY * KIND, either express or implied. * * $Id$ *****************************************************************************/ #include "setup.h" #include <string.h> #include "hash.h" #include "llist.h" #ifdef MALLOCDEBUG /* this must be the last include file */ #include "memdebug.h" #endif static unsigned long curl_hash_str(const char *key, unsigned int key_length) { register unsigned long h = 0; register unsigned long g; register char *p = (char *) key; register char *end = (char *) key + key_length; while (p < end) { h = (h << 4) + *p++; if ((g = (h & 0xF0000000))) { h = h ^ (g >> 24); h = h ^ g; } } return h; } static unsigned long curl_hash_num(unsigned long key) { key += ~(key << 15); key ^= (key >> 10); key += (key << 3); key ^= (key >> 6); key += (key << 11); key ^= (key >> 16); return key; } static void hash_element_dtor(void *u, void *ele) { curl_hash_element *e = (curl_hash_element *) ele; curl_hash *h = (curl_hash *) u; if (e->key.type == CURL_HASH_KEY_IS_STRING) { free(e->key.value.str.val); } h->dtor(e->ptr); free(e); e = NULL; } void curl_hash_init(curl_hash *h, int slots, curl_hash_dtor dtor) { int i; h->dtor = dtor; h->size = 0; h->slots = slots; h->table = (curl_llist **) malloc(slots * sizeof(curl_llist *)); for (i = 0; i < h->slots; ++i) { h->table[i] = curl_llist_alloc((curl_llist_dtor) hash_element_dtor); } } curl_hash * curl_hash_alloc(int slots, curl_hash_dtor dtor) { curl_hash *h; h = malloc(sizeof(curl_hash)); curl_hash_init(h, slots, dtor); return h; } #define FIND_SLOT(__h, __s_key, __s_key_len, __n_key) \ ((__s_key ? curl_hash_str(__s_key, __s_key_len) : curl_hash_num(__n_key)) % (__h)->slots) #define KEY_CREATE(__k, __s_key, __s_key_len, __n_key, __dup) \ if (__s_key) { \ if (__dup) { \ (__k)->value.str.val = (char *) malloc(__s_key_len); \ memcpy((__k)->value.str.val, __s_key, __s_key_len); \ } else { \ (__k)->value.str.val = __s_key; \ } \ (__k)->value.str.len = __s_key_len; \ (__k)->type = CURL_HASH_KEY_IS_STRING; \ } else { \ (__k)->value.num = __n_key; \ (__k)->type = CURL_HASH_KEY_IS_NUM; \ } #define MIN(a, b) (a > b ? b : a) static int curl_hash_key_compare(curl_hash_key *key1, curl_hash_key *key2) { if (key1->type == CURL_HASH_KEY_IS_NUM) { if (key2->type == CURL_HASH_KEY_IS_STRING) return 0; if (key1->value.num == key2->value.num) return 1; } else { if (key2->type == CURL_HASH_KEY_IS_NUM) return 0; if (memcmp(key1->value.str.val, key2->value.str.val, MIN(key1->value.str.len, key2->value.str.len)) == 0) return 1; } return 0; } int curl_hash_add_or_update(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key, const void *p) { curl_hash_element *e; curl_hash_key tmp; curl_llist *l; curl_llist_element *le; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { curl_hash_element *to_update = CURL_LLIST_VALP(le); h->dtor(to_update->ptr); to_update->ptr = (void *) p; return 1; } } e = (curl_hash_element *) malloc(sizeof(curl_hash_element)); KEY_CREATE(&e->key, str_key, str_key_len, num_key, 1); e->ptr = (void *) p; if (curl_llist_insert_next(l, CURL_LLIST_TAIL(l), e)) { ++h->size; return 1; } else { return 0; } } int curl_hash_extended_delete(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key) { curl_llist *l; curl_llist_element *le; curl_hash_key tmp; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { curl_llist_remove(l, le, (void *) h); --h->size; return 1; } } return 0; } int curl_hash_extended_find(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key, void **p) { curl_llist *l; curl_llist_element *le; curl_hash_key tmp; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { *p = ((curl_hash_element *) CURL_LLIST_VALP(le))->ptr; return 1; } } return 0; } void curl_hash_apply(curl_hash *h, void *user, void (*cb)(void *, curl_hash_element *)) { curl_llist_element *le; int i; for (i = 0; i < h->slots; ++i) { for (le = CURL_LLIST_HEAD(h->table[i]); le != NULL; le = CURL_LLIST_NEXT(le)) { cb(user, (curl_hash_element *) CURL_LLIST_VALP(le)); } } } void curl_hash_clean(curl_hash *h) { int i; for (i = 0; i < h->slots; ++i) { curl_llist_destroy(h->table[i], (void *) h); } free(h->table); h->table = NULL; } void curl_hash_destroy(curl_hash *h) { curl_hash_clean(h); free(h); } /* * local variables: * eval: (load-file "../curl-mode.el") * end: * vim600: fdm=marker * vim: et sw=2 ts=2 sts=2 tw=78 */ Loading
lib/Makefile.am +2 −1 Original line number Diff line number Diff line Loading @@ -56,7 +56,8 @@ escape.c mprintf.c telnet.c \ escape.h getpass.c netrc.c telnet.h \ getinfo.c getinfo.h transfer.c strequal.c strequal.h easy.c \ security.h security.c krb4.c krb4.h memdebug.c memdebug.h inet_ntoa_r.h \ http_chunks.c http_chunks.h strtok.c strtok.h connect.c connect.h http_chunks.c http_chunks.h strtok.c strtok.h connect.c connect.h \ llist.c llist.h hash.c hash.h noinst_HEADERS = setup.h transfer.h Loading
lib/connect.c +2 −7 Original line number Diff line number Diff line Loading @@ -210,11 +210,11 @@ static CURLcode bindlocal(struct connectdata *conn, in_addr_t in; if(Curl_if2ip(data->set.device, myhost, sizeof(myhost))) { h = Curl_getaddrinfo(data, myhost, 0, &hostdataptr); h = Curl_resolv(data, myhost, 0, &hostdataptr); } else { if(strlen(data->set.device)>1) { h = Curl_getaddrinfo(data, data->set.device, 0, &hostdataptr); h = Curl_resolv(data, data->set.device, 0, &hostdataptr); } if(h) { /* we know data->set.device is shorter than the myhost array */ Loading @@ -229,8 +229,6 @@ static CURLcode bindlocal(struct connectdata *conn, hostent_buf, sizeof(hostent_buf)); */ if(hostdataptr) free(hostdataptr); /* allocated by Curl_getaddrinfo() */ return CURLE_HTTP_PORT_FAILED; } Loading Loading @@ -304,9 +302,6 @@ static CURLcode bindlocal(struct connectdata *conn, return CURLE_HTTP_PORT_FAILED; } if(hostdataptr) free(hostdataptr); /* allocated by Curl_getaddrinfo() */ return CURLE_OK; } /* end of device selection support */ Loading
lib/easy.c +6 −1 Original line number Diff line number Diff line Loading @@ -76,6 +76,7 @@ #include "ssluse.h" #include "url.h" #include "getinfo.h" #include "hostip.h" #define _MPRINTF_REPLACE /* use our functions only */ #include <curl/mprintf.h> Loading Loading @@ -140,6 +141,8 @@ CURLcode curl_global_init(long flags) if (initialized) return CURLE_OK; Curl_host_cache_init(); if (flags & CURL_GLOBAL_SSL) Curl_SSL_init(); Loading @@ -162,6 +165,8 @@ void curl_global_cleanup(void) if (!initialized) return; Curl_host_cache_dtor(); if (init_flags & CURL_GLOBAL_SSL) Curl_SSL_cleanup(); Loading
lib/ftp.c +7 −13 Original line number Diff line number Diff line Loading @@ -1174,19 +1174,19 @@ CURLcode ftp_use_port(struct connectdata *conn) if(data->set.ftpport) { if(Curl_if2ip(data->set.ftpport, myhost, sizeof(myhost))) { h = Curl_getaddrinfo(data, myhost, 0, &hostdataptr); h = Curl_resolv(data, myhost, 0, &hostdataptr); } else { if(strlen(data->set.ftpport)>1) h = Curl_getaddrinfo(data, data->set.ftpport, 0, &hostdataptr); int len = strlen(data->set.ftpport); if(len>1) h = Curl_resolv(data, data->set.ftpport, 0, &hostdataptr); if(h) strcpy(myhost, data->set.ftpport); /* buffer overflow risk */ } } if(! *myhost) { h=Curl_getaddrinfo(data, getmyhost(myhost, sizeof(myhost)), 0, &hostdataptr); char *tmp_host = getmyhost(myhost, sizeof(myhost)); h=Curl_resolv(data, tmp_host, 0, &hostdataptr); } infof(data, "We connect from %s\n", myhost); Loading Loading @@ -1237,9 +1237,6 @@ CURLcode ftp_use_port(struct connectdata *conn) free(hostdataptr); return CURLE_FTP_PORT_FAILED; } if(hostdataptr) /* free the memory used for name lookup */ Curl_freeaddrinfo(hostdataptr); } else { failf(data, "could't find my own IP address (%s)", myhost); Loading Loading @@ -1431,7 +1428,7 @@ CURLcode ftp_use_pasv(struct connectdata *conn) } else { /* normal, direct, ftp connection */ addr = Curl_getaddrinfo(data, newhostp, newport, &hostdataptr); addr = Curl_resolv(data, newhostp, newport, &hostdataptr); if(!addr) { failf(data, "Can't resolve new host %s", newhost); return CURLE_FTP_CANT_GET_HOST; Loading @@ -1450,9 +1447,6 @@ CURLcode ftp_use_pasv(struct connectdata *conn) /* this just dumps information about this second connection */ ftp_pasv_verbose(conn, conninfo, newhost, connectport); if(hostdataptr) Curl_freeaddrinfo(hostdataptr); if(CURLE_OK != result) return result; Loading
lib/hash.c 0 → 100644 +271 −0 Original line number Diff line number Diff line /***************************************************************************** * _ _ ____ _ * Project ___| | | | _ \| | * / __| | | | |_) | | * | (__| |_| | _ <| |___ * \___|\___/|_| \_\_____| * * Copyright (C) 2001, Daniel Stenberg, <daniel@haxx.se>, et al * * In order to be useful for every potential user, curl and libcurl are * dual-licensed under the MPL and the MIT/X-derivate licenses. * * You may opt to use, copy, modify, merge, publish, distribute and/or sell * copies of the Software, and permit persons to whom the Software is * furnished to do so, under the terms of the MPL or the MIT/X-derivate * licenses. You may pick one of these licenses. * * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY * KIND, either express or implied. * * $Id$ *****************************************************************************/ #include "setup.h" #include <string.h> #include "hash.h" #include "llist.h" #ifdef MALLOCDEBUG /* this must be the last include file */ #include "memdebug.h" #endif static unsigned long curl_hash_str(const char *key, unsigned int key_length) { register unsigned long h = 0; register unsigned long g; register char *p = (char *) key; register char *end = (char *) key + key_length; while (p < end) { h = (h << 4) + *p++; if ((g = (h & 0xF0000000))) { h = h ^ (g >> 24); h = h ^ g; } } return h; } static unsigned long curl_hash_num(unsigned long key) { key += ~(key << 15); key ^= (key >> 10); key += (key << 3); key ^= (key >> 6); key += (key << 11); key ^= (key >> 16); return key; } static void hash_element_dtor(void *u, void *ele) { curl_hash_element *e = (curl_hash_element *) ele; curl_hash *h = (curl_hash *) u; if (e->key.type == CURL_HASH_KEY_IS_STRING) { free(e->key.value.str.val); } h->dtor(e->ptr); free(e); e = NULL; } void curl_hash_init(curl_hash *h, int slots, curl_hash_dtor dtor) { int i; h->dtor = dtor; h->size = 0; h->slots = slots; h->table = (curl_llist **) malloc(slots * sizeof(curl_llist *)); for (i = 0; i < h->slots; ++i) { h->table[i] = curl_llist_alloc((curl_llist_dtor) hash_element_dtor); } } curl_hash * curl_hash_alloc(int slots, curl_hash_dtor dtor) { curl_hash *h; h = malloc(sizeof(curl_hash)); curl_hash_init(h, slots, dtor); return h; } #define FIND_SLOT(__h, __s_key, __s_key_len, __n_key) \ ((__s_key ? curl_hash_str(__s_key, __s_key_len) : curl_hash_num(__n_key)) % (__h)->slots) #define KEY_CREATE(__k, __s_key, __s_key_len, __n_key, __dup) \ if (__s_key) { \ if (__dup) { \ (__k)->value.str.val = (char *) malloc(__s_key_len); \ memcpy((__k)->value.str.val, __s_key, __s_key_len); \ } else { \ (__k)->value.str.val = __s_key; \ } \ (__k)->value.str.len = __s_key_len; \ (__k)->type = CURL_HASH_KEY_IS_STRING; \ } else { \ (__k)->value.num = __n_key; \ (__k)->type = CURL_HASH_KEY_IS_NUM; \ } #define MIN(a, b) (a > b ? b : a) static int curl_hash_key_compare(curl_hash_key *key1, curl_hash_key *key2) { if (key1->type == CURL_HASH_KEY_IS_NUM) { if (key2->type == CURL_HASH_KEY_IS_STRING) return 0; if (key1->value.num == key2->value.num) return 1; } else { if (key2->type == CURL_HASH_KEY_IS_NUM) return 0; if (memcmp(key1->value.str.val, key2->value.str.val, MIN(key1->value.str.len, key2->value.str.len)) == 0) return 1; } return 0; } int curl_hash_add_or_update(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key, const void *p) { curl_hash_element *e; curl_hash_key tmp; curl_llist *l; curl_llist_element *le; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { curl_hash_element *to_update = CURL_LLIST_VALP(le); h->dtor(to_update->ptr); to_update->ptr = (void *) p; return 1; } } e = (curl_hash_element *) malloc(sizeof(curl_hash_element)); KEY_CREATE(&e->key, str_key, str_key_len, num_key, 1); e->ptr = (void *) p; if (curl_llist_insert_next(l, CURL_LLIST_TAIL(l), e)) { ++h->size; return 1; } else { return 0; } } int curl_hash_extended_delete(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key) { curl_llist *l; curl_llist_element *le; curl_hash_key tmp; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { curl_llist_remove(l, le, (void *) h); --h->size; return 1; } } return 0; } int curl_hash_extended_find(curl_hash *h, char *str_key, unsigned int str_key_len, unsigned long num_key, void **p) { curl_llist *l; curl_llist_element *le; curl_hash_key tmp; int slot; slot = FIND_SLOT(h, str_key, str_key_len, num_key); l = h->table[slot]; KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0); for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) { if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) { *p = ((curl_hash_element *) CURL_LLIST_VALP(le))->ptr; return 1; } } return 0; } void curl_hash_apply(curl_hash *h, void *user, void (*cb)(void *, curl_hash_element *)) { curl_llist_element *le; int i; for (i = 0; i < h->slots; ++i) { for (le = CURL_LLIST_HEAD(h->table[i]); le != NULL; le = CURL_LLIST_NEXT(le)) { cb(user, (curl_hash_element *) CURL_LLIST_VALP(le)); } } } void curl_hash_clean(curl_hash *h) { int i; for (i = 0; i < h->slots; ++i) { curl_llist_destroy(h->table[i], (void *) h); } free(h->table); h->table = NULL; } void curl_hash_destroy(curl_hash *h) { curl_hash_clean(h); free(h); } /* * local variables: * eval: (load-file "../curl-mode.el") * end: * vim600: fdm=marker * vim: et sw=2 ts=2 sts=2 tw=78 */