diff options
author | Remko Tronçon <git@el-tramo.be> | 2009-12-03 20:06:33 (GMT) |
---|---|---|
committer | Remko Tronçon <git@el-tramo.be> | 2009-12-03 20:06:33 (GMT) |
commit | 5df50c35e1baeee517a0895a2c8a2cc2052b087f (patch) | |
tree | b9d90fd123ec251ebb930cfcfaa2ffc805433812 /3rdParty/CAres/src/ares_llist.h | |
parent | 9b3edba27b8683f1a87ad66ee05802dd93bbbdfc (diff) | |
download | swift-contrib-5df50c35e1baeee517a0895a2c8a2cc2052b087f.zip swift-contrib-5df50c35e1baeee517a0895a2c8a2cc2052b087f.tar.bz2 |
Added C-Ares.
Diffstat (limited to '3rdParty/CAres/src/ares_llist.h')
-rw-r--r-- | 3rdParty/CAres/src/ares_llist.h | 43 |
1 files changed, 43 insertions, 0 deletions
diff --git a/3rdParty/CAres/src/ares_llist.h b/3rdParty/CAres/src/ares_llist.h new file mode 100644 index 0000000..4875b3f --- /dev/null +++ b/3rdParty/CAres/src/ares_llist.h @@ -0,0 +1,43 @@ +#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 */ |