Swiftdiff 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_llist.h | |
| parent | 950dfa7923f62297429e49a135e4fb363447366d (diff) | |
| download | swift-contrib-e9a33e1cfc91af374f928931f47b19f53cb165d7.zip swift-contrib-e9a33e1cfc91af374f928931f47b19f53cb165d7.tar.bz2 | |
Removing CAres resolver.
This has never been used.
Diffstat (limited to '3rdParty/CAres/src/ares_llist.h')
| -rw-r--r-- | 3rdParty/CAres/src/ares_llist.h | 43 |
1 files changed, 0 insertions, 43 deletions
diff --git a/3rdParty/CAres/src/ares_llist.h b/3rdParty/CAres/src/ares_llist.h deleted file mode 100644 index 4875b3f..0000000 --- a/3rdParty/CAres/src/ares_llist.h +++ /dev/null @@ -1,43 +0,0 @@ -#ifndef __ARES_LLIST_H -#define __ARES_LLIST_H - -/* $Id: ares_llist.h,v 1.1 2007-10-02 02:18:01 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. - */ - - -/* Node definition for circular, doubly-linked list */ -struct list_node { - struct list_node *prev; - struct list_node *next; - void* data; -}; - -void ares__init_list_head(struct list_node* head); - -void ares__init_list_node(struct list_node* node, void* d); - -int ares__is_list_empty(struct list_node* head); - -void ares__insert_in_list(struct list_node* new_node, - struct list_node* old_node); - -void ares__remove_from_list(struct list_node* node); - -void ares__swap_lists(struct list_node* head_a, - struct list_node* head_b); - -#endif /* __ARES_LLIST_H */ |