X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=include%2Ftdm_list.h;h=38738179cb6a4ee4c47a3919a88175c60b24e20f;hb=6a3f7d243844340bac9104b2e445663806d0db05;hp=27e0761b20cadbaa0e5ede145a5818362b842080;hpb=28a0b0177f7f59b6577592edf538ecb1f978fd40;p=platform%2Fcore%2Fuifw%2Flibtdm.git

diff --git a/include/tdm_list.h b/include/tdm_list.h
index 27e0761..3873817 100644
--- a/include/tdm_list.h
+++ b/include/tdm_list.h
@@ -38,54 +38,67 @@
 
 #include <stddef.h>
 
-struct list_head
-{
-    struct list_head *prev;
-    struct list_head *next;
+struct list_head {
+	struct list_head *prev;
+	struct list_head *next;
 };
 
 static inline void list_inithead(struct list_head *item)
 {
-    item->prev = item;
-    item->next = item;
+	item->prev = item;
+	item->next = item;
 }
 
 static inline void list_add(struct list_head *item, struct list_head *list)
 {
-    item->prev = list;
-    item->next = list->next;
-    list->next->prev = item;
-    list->next = item;
+	item->prev = list;
+	item->next = list->next;
+	list->next->prev = item;
+	list->next = item;
 }
 
 static inline void list_addtail(struct list_head *item, struct list_head *list)
 {
-    item->next = list;
-    item->prev = list->prev;
-    list->prev->next = item;
-    list->prev = item;
+	item->next = list;
+	item->prev = list->prev;
+	list->prev->next = item;
+	list->prev = item;
 }
 
 static inline void list_replace(struct list_head *from, struct list_head *to)
 {
-    to->prev = from->prev;
-    to->next = from->next;
-    from->next->prev = to;
-    from->prev->next = to;
+	to->prev = from->prev;
+	to->next = from->next;
+	from->next->prev = to;
+	from->prev->next = to;
 }
 
 static inline void list_del(struct list_head *item)
 {
-    item->prev->next = item->next;
-    item->next->prev = item->prev;
+	item->prev->next = item->next;
+	item->next->prev = item->prev;
 }
 
 static inline void list_delinit(struct list_head *item)
 {
-    item->prev->next = item->next;
-    item->next->prev = item->prev;
-    item->next = item;
-    item->prev = item;
+	item->prev->next = item->next;
+	item->next->prev = item->prev;
+	item->next = item;
+	item->prev = item;
+}
+
+static inline int list_length(struct list_head *item)
+{
+	struct list_head *next;
+	int length = 0;
+
+	next = item->next;
+	while (next != item) {
+		length++;
+		next = next->next;
+	}
+
+	return length;
 }
 
 #define LIST_INITHEAD(__item) list_inithead(__item)
@@ -94,44 +107,64 @@ static inline void list_delinit(struct list_head *item)
 #define LIST_REPLACE(__from, __to) list_replace(__from, __to)
 #define LIST_DEL(__item) list_del(__item)
 #define LIST_DELINIT(__item) list_delinit(__item)
+#define LIST_LENGTH(__item) list_length(__item)
 
 #define LIST_ENTRY(__type, __item, __field)   \
-    ((__type *)(((char *)(__item)) - offsetof(__type, __field)))
+	((__type *)(((char *)(__item)) - offsetof(__type, __field)))
+
+#define LIST_FIRST_ENTRY(__ptr, __type, __field)   \
+	LIST_ENTRY(__type, (__ptr)->next, __field)
+
+#define LIST_LAST_ENTRY(__ptr, __type, __field)   \
+	LIST_ENTRY(__type, (__ptr)->prev, __field)
 
 #define LIST_IS_EMPTY(__list)                   \
-    ((__list)->next == (__list))
+	((__list)->next == (__list))
 
 #ifndef container_of
 #define container_of(ptr, sample, member)				\
-    (void *)((char *)(ptr)						\
+	(void *)((char *)(ptr)						\
 	     - ((char *)&(sample)->member - (char *)(sample)))
 #endif
 
 #define LIST_FOR_EACH_ENTRY(pos, head, member)				\
-   for (pos = container_of((head)->next, pos, member);			\
+	for (pos = container_of((head)->next, pos, member);			\
 	&pos->member != (head);						\
 	pos = container_of(pos->member.next, pos, member))
 
+#define LIST_FOR_EACH_ENTRY_REV(pos, head, member)				\
+	for (pos = container_of((head)->prev, pos, member);			\
+	&pos->member != (head);						\
+	pos = container_of(pos->member.prev, pos, member))
+
 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member)	\
-   for (pos = container_of((head)->next, pos, member),			\
+	for (pos = container_of((head)->next, pos, member),			\
 	storage = container_of(pos->member.next, pos, member);	\
 	&pos->member != (head);						\
 	pos = storage, storage = container_of(storage->member.next, storage, member))
 
 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member)	\
-   for (pos = container_of((head)->prev, pos, member),			\
+	for (pos = container_of((head)->prev, pos, member),			\
 	storage = container_of(pos->member.prev, pos, member);		\
 	&pos->member != (head);						\
 	pos = storage, storage = container_of(storage->member.prev, storage, member))
 
 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)		\
-   for (pos = container_of((start), pos, member);			\
+	for (pos = container_of((start), pos, member);			\
 	&pos->member != (head);						\
 	pos = container_of(pos->member.next, pos, member))
 
 #define LIST_FOR_EACH_ENTRY_FROM_REV(pos, start, head, member)		\
-   for (pos = container_of((start), pos, member);			\
+	for (pos = container_of((start), pos, member);			\
 	&pos->member != (head);						\
 	pos = container_of(pos->member.prev, pos, member))
 
+#define LIST_FIND_ITEM(item, head, type, member, found) \
+	do {	\
+		type *pos = NULL;	\
+		found = NULL;	\
+		LIST_FOR_EACH_ENTRY(pos, head, member)	\
+			if (pos == item) { found = item; break; }	\
+	} while (0)
+
 #endif /*_U_DOUBLE_LIST_H_*/