aboutsummaryrefslogtreecommitdiff
path: root/ares_llist.h
diff options
context:
space:
mode:
authorGilad Arnold <garnold@google.com>2015-07-17 00:23:30 -0700
committerGilad Arnold <garnold@google.com>2015-07-17 16:18:06 -0700
commit968bf19396ad404e89420f5d67900fce13f4186c (patch)
treedf6210e63ac2b96d6e638cb288a07776d1373cf5 /ares_llist.h
parent9ade30bfaf6d122f95d862c10092b1f817b8f119 (diff)
downloadc-ares-968bf19396ad404e89420f5d67900fce13f4186c.tar.gz
Initial c-ares-1.7.5 distribution.
Includes NOTICE and MODULE_LICENSE_MIT files. Omitted: - m4/ - vc/ - *.pdf - *.[13] - Makefile.{Watcom,dj,m32,msvc,netware} Bug: 22545809
Diffstat (limited to 'ares_llist.h')
-rw-r--r--ares_llist.h42
1 files changed, 42 insertions, 0 deletions
diff --git a/ares_llist.h b/ares_llist.h
new file mode 100644
index 0000000..b09f0de
--- /dev/null
+++ b/ares_llist.h
@@ -0,0 +1,42 @@
+#ifndef __ARES_LLIST_H
+#define __ARES_LLIST_H
+
+
+/* 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 */