Searched defs:list_head (Results 1 - 17 of 17) sorted by relevance

/external/c-ares/
H A Dares_cancel.c29 struct list_node* list_head; local
33 list_head = &(channel->all_queries);
34 for (list_node = list_head->next; list_node != list_head; )
H A Dares_destroy.c42 struct list_node* list_head; local
48 list_head = &(channel->all_queries);
49 for (list_node = list_head->next; list_node != list_head; )
H A Dares_timeout.c37 struct list_node* list_head; local
51 list_head = &(channel->all_queries);
52 for (list_node = list_head->next; list_node != list_head;
H A Dares_query.c75 struct list_node* list_head; local
80 list_head = &(channel->queries_by_qid[qid % ARES_QID_TABLE_SIZE]);
81 for (list_node = list_head->next; list_node != list_head;
H A Dares_process.c507 struct list_node* list_head; local
518 list_head = &(channel->queries_by_timeout[t % ARES_TIMEOUT_TABLE_SIZE]);
519 for (list_node = list_head->next; list_node != list_head; )
542 struct list_node* list_head; local
563 list_head = &(channel->queries_by_qid[id % ARES_QID_TABLE_SIZE]);
564 for (list_node = list_head->next; list_node != list_head;
634 struct list_node list_head; local
649 ares__init_list_head(&list_head);
[all...]
/external/e2fsprogs/lib/blkid/
H A Dlist.h24 struct list_head { struct
25 struct list_head *next, *prev;
40 _INLINE_ void __list_add(struct list_head * add,
41 struct list_head * prev,
42 struct list_head * next)
58 _INLINE_ void list_add(struct list_head *add, struct list_head *head)
71 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head)
83 _INLINE_ void __list_del(struct list_head * pre
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dkernel-list.h14 struct list_head { struct
15 struct list_head *next, *prev;
34 static __inline__ void __list_add(struct list_head * new,
35 struct list_head * prev,
36 struct list_head * next)
47 static __inline__ void list_add(struct list_head *new, struct list_head *head)
55 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
67 static __inline__ void __list_del(struct list_head * pre
[all...]
/external/f2fs-tools/include/
H A Dlist.h13 struct list_head { struct
14 struct list_head *next, *prev;
20 struct list_head name = LIST_HEAD_INIT(name)
22 static inline void INIT_LIST_HEAD(struct list_head *list)
28 static inline void __list_add(struct list_head *new,
29 struct list_head *prev,
30 struct list_head *next)
38 static inline void list_add(struct list_head *new, struct list_head *head)
43 static inline void list_add_tail(struct list_head *ne
[all...]
/external/libdrm/
H A Dutil_double_list.h41 struct list_head struct
43 struct list_head *prev;
44 struct list_head *next;
47 static inline void list_inithead(struct list_head *item)
53 static inline void list_add(struct list_head *item, struct list_head *list)
61 static inline void list_addtail(struct list_head *item, struct list_head *list)
69 static inline void list_replace(struct list_head *from, struct list_head *t
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_double_list.h45 struct list_head struct
47 struct list_head *prev;
48 struct list_head *next;
51 static INLINE void list_inithead(struct list_head *item)
57 static INLINE void list_add(struct list_head *item, struct list_head *list)
65 static INLINE void list_addtail(struct list_head *item, struct list_head *list)
73 static INLINE void list_replace(struct list_head *from, struct list_head *t
[all...]
/external/blktrace/btt/
H A Dlist.h34 struct list_head { struct
35 struct list_head *next, *prev;
41 struct list_head name = LIST_HEAD_INIT(name)
43 static inline void INIT_LIST_HEAD(struct list_head *list)
55 static inline void __list_add(struct list_head *new,
56 struct list_head *prev,
57 struct list_head *next)
73 static inline void list_add(struct list_head *new, struct list_head *head)
86 static inline void list_add_tail(struct list_head *ne
[all...]
/external/srtp/crypto/test/
H A Dsha1_driver.c71 hash_test_case_t *list_head = *list_ptr; local
91 test_case->next_test_case = list_head;
/external/v8/src/heap/
H A Dobjects-visiting.cc323 Object* list_head = VisitWeakList<T>(heap, context->get(index), retainer); local
326 context->set(index, list_head, UPDATE_WRITE_BARRIER);
332 heap->mark_compact_collector()->RecordSlot(context, head_slot, list_head);
H A Dmark-compact.cc2451 DependentCode* list_head) {
2454 DependentCode* current = list_head;
2450 MarkDependentCodeForDeoptimization( DependentCode* list_head) argument
/external/iptables/libiptc/
H A Dlinux_list.h53 struct list_head { struct
54 struct list_head *next, *prev;
60 struct list_head name = LIST_HEAD_INIT(name)
72 static inline void __list_add(struct list_head *new,
73 struct list_head *prev,
74 struct list_head *next)
90 static inline void list_add(struct list_head *new, struct list_head *head)
103 static inline void list_add_tail(struct list_head *new, struct list_head *hea
[all...]
/external/f2fs-tools/fsck/
H A Df2fs.h36 struct list_head { struct
37 struct list_head *next, *prev;
135 struct list_head orphan_inode_list;
/external/libusb/libusb/
H A Dlibusbi.h39 struct list_head { struct
40 struct list_head *prev, *next;
44 * ptr - the address of this list_head element in "type"
46 * member - the list_head element in "type"
54 * member - the list_head element in "pos"
69 static inline void list_init(struct list_head *entry)
74 static inline void list_add(struct list_head *entry, struct list_head *head)
83 static inline void list_add_tail(struct list_head *entry,
84 struct list_head *hea
[all...]

Completed in 884 milliseconds