diff options
author | Remko Tronçon <git@el-tramo.be> | 2012-04-01 09:27:45 (GMT) |
---|---|---|
committer | Remko Tronçon <git@el-tramo.be> | 2012-04-01 09:27:45 (GMT) |
commit | e9a33e1cfc91af374f928931f47b19f53cb165d7 (patch) | |
tree | f0a72876d8b0f53f6e5a335321aca785e81129dd /3rdParty/CAres/src/ares_timeout.c | |
parent | 950dfa7923f62297429e49a135e4fb363447366d (diff) | |
download | swift-e9a33e1cfc91af374f928931f47b19f53cb165d7.zip swift-e9a33e1cfc91af374f928931f47b19f53cb165d7.tar.bz2 |
Removing CAres resolver.
This has never been used.
Diffstat (limited to '3rdParty/CAres/src/ares_timeout.c')
-rw-r--r-- | 3rdParty/CAres/src/ares_timeout.c | 81 |
1 files changed, 0 insertions, 81 deletions
diff --git a/3rdParty/CAres/src/ares_timeout.c b/3rdParty/CAres/src/ares_timeout.c deleted file mode 100644 index a522de7..0000000 --- a/3rdParty/CAres/src/ares_timeout.c +++ /dev/null @@ -1,81 +0,0 @@ -/* $Id: ares_timeout.c,v 1.13 2009-11-02 11:55:53 yangtse Exp $ */ - -/* 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 "ares_setup.h" - -#ifdef HAVE_SYS_TIME_H -#include <sys/time.h> -#endif - -#include <time.h> - -#include "ares.h" -#include "ares_private.h" - -/* WARNING: Beware that this is linear in the number of outstanding - * requests! You are probably far better off just calling ares_process() - * once per second, rather than calling ares_timeout() to figure out - * when to next call ares_process(). - */ -struct timeval *ares_timeout(ares_channel channel, struct timeval *maxtv, - struct timeval *tvbuf) -{ - struct query *query; - struct list_node* list_head; - struct list_node* list_node; - struct timeval now; - struct timeval nextstop; - long offset, min_offset; - - /* No queries, no timeout (and no fetch of the current time). */ - if (ares__is_list_empty(&(channel->all_queries))) - return maxtv; - - /* Find the minimum timeout for the current set of queries. */ - now = ares__tvnow(); - min_offset = -1; - - list_head = &(channel->all_queries); - for (list_node = list_head->next; list_node != list_head; - list_node = list_node->next) - { - query = list_node->data; - if (query->timeout.tv_sec == 0) - continue; - offset = ares__timeoffset(&now, &query->timeout); - if (offset < 0) - offset = 0; - if (min_offset == -1 || offset < min_offset) - min_offset = offset; - } - - if(min_offset != -1) { - nextstop.tv_sec = min_offset/1000; - nextstop.tv_usec = (min_offset%1000)*1000; - } - - /* If we found a minimum timeout and it's sooner than the one specified in - * maxtv (if any), return it. Otherwise go with maxtv. - */ - if (min_offset != -1 && (!maxtv || ares__timedout(maxtv, &nextstop))) - { - *tvbuf = nextstop; - return tvbuf; - } - else - return maxtv; -} |