Remove list implementation

Remove current list implementation due to potential
license problems.

Change-Id: I4ce8758d408537c1c4983ce50fb6905d70c91284
Signed-off-by: Krzysztof Opasiak <k.opasiak@samsung.com>

diff --git a/src/util/list.h b/src/util/list.h
index 48e8e587e65bdb083777e46c0775a734dfdfcf2c..07e1365d82a3099a00fcd4582af895e97f8f61cb 100644 (file)
--- a/src/util/list.h
+++ b/src/util/list.h
@@ -39,23 +39,6 @@ struct list_head {
 
 static inline void INIT_LIST_HEAD(struct list_head *head)
 {
-       head->next = head;
-       head->prev = head;
-}
-
-/*
- * Add a new entry between two others
- *
- * Should be used only internally
- */
-static inline void __list_add(struct list_head *new,
-                                                         struct list_head *prev,
-                                                         struct list_head *next)
-{
-       next->prev = new;
-       new->next = next;
-       new->prev = prev;
-       prev->next = new;
 }
 
 /*
@@ -63,7 +46,6 @@ static inline void __list_add(struct list_head *new,
  */
 static inline void list_add(struct list_head *new, struct list_head *head)
 {
-       __list_add(new, head, head->next);
 }
 
 /*
@@ -71,7 +53,6 @@ static inline void list_add(struct list_head *new, struct list_head *head)
  */
 static inline void list_add_tail(struct list_head *new, struct list_head *head)
 {
-       __list_add(new, head->prev, head);
 }
 
 /*
@@ -81,8 +62,6 @@ static inline void list_add_tail(struct list_head *new, struct list_head *head)
  */
 static inline void __list_del(struct list_head *prev, struct list_head *next)
 {
-       next->prev = prev;
-       prev->next = next;
 }
 
 /*
@@ -92,7 +71,6 @@ static inline void __list_del(struct list_head *prev, struct list_head *next)
  */
 static inline void __list_del_entry(struct list_head *entry)
 {
-       __list_del(entry->prev, entry->next);
 }
 
 /*
@@ -100,11 +78,6 @@ static inline void __list_del_entry(struct list_head *entry)
  */
 static inline void list_del(struct list_head *entry)
 {
-       __list_del_entry(entry);
-#ifdef FAULTD_DEBUG_LIST
-       entry->next = LIST_POISON1;
-       entry->prev = LIST_POISON2;
-#endif
 }
 
 /*
@@ -112,58 +85,35 @@ static inline void list_del(struct list_head *entry)
  */
 static inline void list_del_init(struct list_head *entry)
 {
-       __list_del_entry(entry);
-       INIT_LIST_HEAD(entry);
 }
 
 static inline int list_empty(const struct list_head *head)
 {
-       return head->next == head;
 }
 
 static inline int list_is_singular(const struct list_head *head)
 {
-       return !list_empty(head) && (head->next == head->prev);
 }
 
-#define list_entry(ptr, type, member)                  \
-       container_of(ptr, type, member)
+#define list_entry(ptr, type, member)
 
-#define list_first_entry(ptr, type, member)            \
-       list_entry((ptr)->next, type, member)
 
-#define list_first_entry_or_null(ptr, type, member) ({           \
-       struct list_head *head__ = (ptr);                                                 \
-       struct list_head *pos__ = head__->next;                                   \
-       pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
-})
+#define list_first_entry(ptr, type, member)
 
-#define list_last_entry(ptr, type, member)             \
-       list_entry((ptr)->prev, type, member)
+#define list_first_entry_or_null(ptr, type, member)
 
-#define list_next_entry(pos, member)                                           \
-       list_entry((pos)->member.next, typeof(*(pos)), member)
+#define list_last_entry(ptr, type, member)
 
-#define list_prev_entry(pos, member)                                           \
-       list_entry((pos)->member.prev, typeof(*(pos)), member)
+#define list_next_entry(pos, member)
 
-#define list_for_each(pos, head)                                                               \
-       for (pos = (head)->next; pos != (head); pos = pos->next)
+#define list_prev_entry(pos, member)
 
-#define list_for_each_safe(pos, n, head)                                       \
-       for (pos = (head)->next, n = pos->next; pos != (head);  \
-                pos = n, n = pos->next)
+#define list_for_each(pos, head)
 
-#define list_for_each_entry(pos, head, member)                                 \
-       for (pos = list_first_entry(head, typeof(*pos), member);        \
-            &pos->member != (head);                                                            \
-            pos = list_next_entry(pos, member))
+#define list_for_each_safe(pos, n, head)
 
-#define list_for_each_entry_safe(pos, n, head, member)                 \
-       for (pos = list_first_entry(head, typeof(*pos), member),        \
-                        n = list_next_entry(pos, member);                                      \
-            &pos->member != (head);                                                            \
-            pos = n, n = list_next_entry(n, member))
+#define list_for_each_entry(pos, head, member)
 
+#define list_for_each_entry_safe(pos, n, head, member)
 
 #endif /* _FAULTD_LIST_H */