123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266 |
- #include "curl_setup.h"
- #include <curl/curl.h>
- #include "llist.h"
- #include "curl_memory.h"
- #include "memdebug.h"
- #define LLISTINIT 0x100cc001
- #define NODEINIT 0x12344321
- #define NODEREM 0x54321012
- #ifdef DEBUGBUILD
- #define VERIFYNODE(x) verifynode(x)
- static struct Curl_llist_node *verifynode(struct Curl_llist_node *n)
- {
- DEBUGASSERT(!n || (n->_init == NODEINIT));
- return n;
- }
- #else
- #define VERIFYNODE(x) x
- #endif
- void
- Curl_llist_init(struct Curl_llist *l, Curl_llist_dtor dtor)
- {
- l->_size = 0;
- l->_dtor = dtor;
- l->_head = NULL;
- l->_tail = NULL;
- #ifdef DEBUGBUILD
- l->_init = LLISTINIT;
- #endif
- }
- void
- Curl_llist_insert_next(struct Curl_llist *list,
- struct Curl_llist_node *e,
- const void *p,
- struct Curl_llist_node *ne)
- {
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- DEBUGASSERT(ne);
- #ifdef DEBUGBUILD
- ne->_init = NODEINIT;
- #endif
- ne->_ptr = (void *) p;
- ne->_list = list;
- if(list->_size == 0) {
- list->_head = ne;
- list->_head->_prev = NULL;
- list->_head->_next = NULL;
- list->_tail = ne;
- }
- else {
-
- ne->_next = e ? e->_next : list->_head;
- ne->_prev = e;
- if(!e) {
- list->_head->_prev = ne;
- list->_head = ne;
- }
- else if(e->_next) {
- e->_next->_prev = ne;
- }
- else {
- list->_tail = ne;
- }
- if(e)
- e->_next = ne;
- }
- ++list->_size;
- }
- void
- Curl_llist_append(struct Curl_llist *list, const void *p,
- struct Curl_llist_node *ne)
- {
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- DEBUGASSERT(ne);
- Curl_llist_insert_next(list, list->_tail, p, ne);
- }
- void
- Curl_node_uremove(struct Curl_llist_node *e, void *user)
- {
- void *ptr;
- struct Curl_llist *list;
- if(!e)
- return;
- list = e->_list;
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- DEBUGASSERT(list->_size);
- DEBUGASSERT(e->_init == NODEINIT);
- if(e == list->_head) {
- list->_head = e->_next;
- if(!list->_head)
- list->_tail = NULL;
- else
- e->_next->_prev = NULL;
- }
- else {
- if(e->_prev)
- e->_prev->_next = e->_next;
- if(!e->_next)
- list->_tail = e->_prev;
- else
- e->_next->_prev = e->_prev;
- }
- ptr = e->_ptr;
- e->_list = NULL;
- e->_ptr = NULL;
- e->_prev = NULL;
- e->_next = NULL;
- #ifdef DEBUGBUILD
- e->_init = NODEREM;
- #endif
- --list->_size;
-
- if(list->_dtor)
- list->_dtor(user, ptr);
- }
- void Curl_node_remove(struct Curl_llist_node *e)
- {
- Curl_node_uremove(e, NULL);
- }
- void
- Curl_llist_destroy(struct Curl_llist *list, void *user)
- {
- if(list) {
- DEBUGASSERT(list->_init == LLISTINIT);
- while(list->_size > 0)
- Curl_node_uremove(list->_tail, user);
- }
- }
- struct Curl_llist_node *Curl_llist_head(struct Curl_llist *list)
- {
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- return VERIFYNODE(list->_head);
- }
- #ifdef UNITTESTS
- struct Curl_llist_node *Curl_llist_tail(struct Curl_llist *list)
- {
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- return VERIFYNODE(list->_tail);
- }
- #endif
- size_t Curl_llist_count(struct Curl_llist *list)
- {
- DEBUGASSERT(list);
- DEBUGASSERT(list->_init == LLISTINIT);
- return list->_size;
- }
- void *Curl_node_elem(struct Curl_llist_node *n)
- {
- DEBUGASSERT(n);
- DEBUGASSERT(n->_init == NODEINIT);
- return n->_ptr;
- }
- struct Curl_llist_node *Curl_node_next(struct Curl_llist_node *n)
- {
- DEBUGASSERT(n);
- DEBUGASSERT(n->_init == NODEINIT);
- return VERIFYNODE(n->_next);
- }
- #ifdef UNITTESTS
- struct Curl_llist_node *Curl_node_prev(struct Curl_llist_node *n)
- {
- DEBUGASSERT(n);
- DEBUGASSERT(n->_init == NODEINIT);
- return VERIFYNODE(n->_prev);
- }
- #endif
- struct Curl_llist *Curl_node_llist(struct Curl_llist_node *n)
- {
- DEBUGASSERT(n);
- DEBUGASSERT(!n->_list || n->_init == NODEINIT);
- return n->_list;
- }
|