mirror of
https://github.com/curl/curl.git
synced 2024-11-21 01:16:58 +08:00
23f5d145ec
outstanding queries, and processing a DNS response packet was O(n) in the number of outstanding queries. To speed things up in Google, we added a few circular, doubly-linked lists of queries that are hash-bucketed based on the attributes we care about, so most important operations are now O(1). It might be that the number of buckets are higher than most people would need, but on a quick calculation it should only be 100kB or so even on a 64-bit system, so I've let it stay as-is.
94 lines
2.5 KiB
C
94 lines
2.5 KiB
C
/* $Id$ */
|
|
|
|
/* Copyright 1998 by the Massachusetts Institute of Technology.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this
|
|
* software and its documentation for any purpose and without
|
|
* fee is hereby granted, provided that the above copyright
|
|
* notice appear in all copies and that both that copyright
|
|
* notice and this permission notice appear in supporting
|
|
* documentation, and that the name of M.I.T. not be used in
|
|
* advertising or publicity pertaining to distribution of the
|
|
* software without specific, written prior permission.
|
|
* M.I.T. makes no representations about the suitability of
|
|
* this software for any purpose. It is provided "as is"
|
|
* without express or implied warranty.
|
|
*/
|
|
|
|
#include "setup.h"
|
|
#include <assert.h>
|
|
#include <stdlib.h>
|
|
#include "ares.h"
|
|
#include "ares_private.h"
|
|
|
|
void ares_destroy_options(struct ares_options *options)
|
|
{
|
|
int i;
|
|
|
|
free(options->servers);
|
|
for (i = 0; i < options->ndomains; i++)
|
|
free(options->domains[i]);
|
|
free(options->domains);
|
|
if(options->sortlist)
|
|
free(options->sortlist);
|
|
free(options->lookups);
|
|
}
|
|
|
|
void ares_destroy(ares_channel channel)
|
|
{
|
|
int i;
|
|
struct query *query;
|
|
struct list_node* list_head;
|
|
struct list_node* list_node;
|
|
|
|
list_head = &(channel->all_queries);
|
|
for (list_node = list_head->next; list_node != list_head; )
|
|
{
|
|
query = list_node->data;
|
|
list_node = list_node->next; /* since we're deleting the query */
|
|
query->callback(query->arg, ARES_EDESTRUCTION, 0, NULL, 0);
|
|
ares__free_query(query);
|
|
}
|
|
#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__is_list_empty(&(channel->all_queries)));
|
|
for (i = 0; i < ARES_QID_TABLE_SIZE; i++)
|
|
{
|
|
assert(ares__is_list_empty(&(channel->queries_by_qid[i])));
|
|
}
|
|
for (i = 0; i < ARES_TIMEOUT_TABLE_SIZE; i++)
|
|
{
|
|
assert(ares__is_list_empty(&(channel->queries_by_timeout[i])));
|
|
}
|
|
#endif
|
|
|
|
if (!channel)
|
|
return;
|
|
|
|
if (channel->servers) {
|
|
for (i = 0; i < channel->nservers; i++)
|
|
{
|
|
struct server_state *server = &channel->servers[i];
|
|
ares__close_sockets(channel, server);
|
|
assert(ares__is_list_empty(&(server->queries_to_server)));
|
|
}
|
|
free(channel->servers);
|
|
}
|
|
|
|
if (channel->domains) {
|
|
for (i = 0; i < channel->ndomains; i++)
|
|
free(channel->domains[i]);
|
|
free(channel->domains);
|
|
}
|
|
|
|
if(channel->sortlist)
|
|
free(channel->sortlist);
|
|
|
|
if (channel->lookups)
|
|
free(channel->lookups);
|
|
|
|
free(channel);
|
|
}
|