Restoring authorship annotation for <neksard@yandex-team.ru>. Commit 2 of 2.

1 files changed, 39 insertions, 39 deletions

diff --git a/contrib/libs/c-ares/ares_llist.h b/contrib/libs/c-ares/ares_llist.h
index b3b11e6c88..20f4d1ce42 100644
--- a/contrib/libs/c-ares/ares_llist.h
+++ b/contrib/libs/c-ares/ares_llist.h
@@ -1,39 +1,39 @@
-#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); 
- 
-#endif /* __ARES_LLIST_H */ 
+#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);
+
+#endif /* __ARES_LLIST_H */