3 /* Copyright 1998 by the Massachusetts Institute of Technology.
5 * Permission to use, copy, modify, and distribute this
6 * software and its documentation for any purpose and without
7 * fee is hereby granted, provided that the above copyright
8 * notice appear in all copies and that both that copyright
9 * notice and this permission notice appear in supporting
10 * documentation, and that the name of M.I.T. not be used in
11 * advertising or publicity pertaining to distribution of the
12 * software without specific, written prior permission.
13 * M.I.T. makes no representations about the suitability of
14 * this software for any purpose. It is provided "as is"
15 * without express or implied warranty.
20 #ifdef HAVE_SYS_TIME_H
27 #include "ares_private.h"
29 /* WARNING: Beware that this is linear in the number of outstanding
30 * requests! You are probably far better off just calling ares_process()
31 * once per second, rather than calling ares_timeout() to figure out
32 * when to next call ares_process().
34 struct timeval *ares_timeout(ares_channel channel, struct timeval *maxtv,
35 struct timeval *tvbuf)
38 struct list_node* list_head;
39 struct list_node* list_node;
41 struct timeval nextstop;
42 long offset, min_offset;
44 /* No queries, no timeout (and no fetch of the current time). */
45 if (ares__is_list_empty(&(channel->all_queries)))
48 /* Find the minimum timeout for the current set of queries. */
52 list_head = &(channel->all_queries);
53 for (list_node = list_head->next; list_node != list_head;
54 list_node = list_node->next)
56 query = list_node->data;
57 if (query->timeout.tv_sec == 0)
59 offset = ares__timeoffset(&now, &query->timeout);
62 if (min_offset == -1 || offset < min_offset)
66 if(min_offset != -1) {
68 ares__timeadd(&now, min_offset);
71 /* If we found a minimum timeout and it's sooner than the one specified in
72 * maxtv (if any), return it. Otherwise go with maxtv.
74 if (min_offset != -1 && (!maxtv || ares__timedout(maxtv, &nextstop)))