%PDF- %PDF-
Direktori : /home/vacivi36/vittasync.vacivitta.com.br/vittasync/node/deps/cares/src/lib/ |
Current File : /home/vacivi36/vittasync.vacivitta.com.br/vittasync/node/deps/cares/src/lib/ares_destroy.c |
/* MIT License * * Copyright (c) 1998 Massachusetts Institute of Technology * Copyright (c) 2004 Daniel Stenberg * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice (including the next * paragraph) shall be included in all copies or substantial portions of the * Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. * * SPDX-License-Identifier: MIT */ #include "ares_setup.h" #include <assert.h> #include "ares.h" #include "ares_private.h" void ares_destroy(ares_channel_t *channel) { size_t i; ares__llist_node_t *node = NULL; if (channel == NULL) { return; } /* Lock because callbacks will be triggered */ ares__channel_lock(channel); /* Destroy all queries */ node = ares__llist_node_first(channel->all_queries); while (node != NULL) { ares__llist_node_t *next = ares__llist_node_next(node); struct query *query = ares__llist_node_claim(node); query->node_all_queries = NULL; query->callback(query->arg, ARES_EDESTRUCTION, 0, NULL, 0); ares__free_query(query); node = next; } ares_queue_notify_empty(channel); #ifndef NDEBUG /* Freeing the query should remove it from all the lists in which it sits, * so all query lists should be empty now. */ assert(ares__llist_len(channel->all_queries) == 0); assert(ares__htable_szvp_num_keys(channel->queries_by_qid) == 0); assert(ares__slist_len(channel->queries_by_timeout) == 0); #endif ares__destroy_servers_state(channel); #ifndef NDEBUG assert(ares__htable_asvp_num_keys(channel->connnode_by_socket) == 0); #endif /* No more callbacks will be triggered after this point, unlock */ ares__channel_unlock(channel); /* Shut down the event thread */ if (channel->optmask & ARES_OPT_EVENT_THREAD) { ares_event_thread_destroy(channel); } if (channel->domains) { for (i = 0; i < channel->ndomains; i++) { ares_free(channel->domains[i]); } ares_free(channel->domains); } ares__llist_destroy(channel->all_queries); ares__slist_destroy(channel->queries_by_timeout); ares__htable_szvp_destroy(channel->queries_by_qid); ares__htable_asvp_destroy(channel->connnode_by_socket); ares_free(channel->sortlist); ares_free(channel->lookups); ares_free(channel->resolvconf_path); ares_free(channel->hosts_path); ares__destroy_rand_state(channel->rand_state); ares__hosts_file_destroy(channel->hf); ares__qcache_destroy(channel->qcache); ares__channel_threading_destroy(channel); ares_free(channel); } void ares__destroy_server(struct server_state *server) { if (server == NULL) { return; } ares__close_sockets(server); ares__llist_destroy(server->connections); ares__buf_destroy(server->tcp_parser); ares__buf_destroy(server->tcp_send); ares_free(server); } void ares__destroy_servers_state(ares_channel_t *channel) { ares__slist_node_t *node; while ((node = ares__slist_node_first(channel->servers)) != NULL) { struct server_state *server = ares__slist_node_claim(node); ares__destroy_server(server); } ares__slist_destroy(channel->servers); channel->servers = NULL; }