Home
last modified time | relevance | path

Searched refs:list_entry (Results 1 – 25 of 42) sorted by relevance

12

/external/syslinux/com32/include/linux/
Dlist.h251 #define list_entry(ptr, type, member) \ macro
263 list_entry((ptr)->next, type, member)
324 for (pos = list_entry((head)->next, typeof(*pos), member); \
326 pos = list_entry(pos->member.next, typeof(*pos), member))
336 for (pos = list_entry((head)->next, typeof(*pos), member), \
337 n = list_entry(pos->member.next, typeof(*pos), member); \
339 pos = n, n = list_entry(n->member.next, typeof(*n), member))
348 for (pos = list_entry((head)->prev, typeof(*pos), member); \
350 pos = list_entry(pos->member.prev, typeof(*pos), member))
361 ((pos) ? : list_entry(head, typeof(*pos), member))
[all …]
/external/ltp/testcases/realtime/include/
Dlist.h263 #define list_entry(ptr, type, member) \ macro
301 for (pos = list_entry((head)->next, typeof(*pos), member); \
303 pos = list_entry(pos->member.next, typeof(*pos), member))
312 for (pos = list_entry((head)->prev, typeof(*pos), member); \
314 pos = list_entry(pos->member.prev, typeof(*pos), member))
324 ((pos) ? : list_entry(head, typeof(*pos), member))
334 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
336 pos = list_entry(pos->member.next, typeof(*pos), member))
346 for (pos = list_entry((head)->next, typeof(*pos), member), \
347 n = list_entry(pos->member.next, typeof(*pos), member); \
[all …]
/external/kmod/libkmod/
Dlibkmod.h91 #define kmod_list_foreach(list_entry, first_entry) \ argument
92 for (list_entry = first_entry; \
93 list_entry != NULL; \
94 list_entry = kmod_list_next(first_entry, list_entry))
96 #define kmod_list_foreach_reverse(list_entry, first_entry) \ argument
97 for (list_entry = kmod_list_last(first_entry); \
98 list_entry != NULL; \
99 list_entry = kmod_list_prev(first_entry, list_entry))
Dlibkmod-internal.h74 #define kmod_list_foreach(list_entry, first_entry) \ argument
75 for (list_entry = ((first_entry) == NULL) ? NULL : (first_entry); \
76 list_entry != NULL; \
77 list_entry = (list_entry->node.next == &((first_entry)->node)) ? NULL : \
78 container_of(list_entry->node.next, struct kmod_list, node))
81 #define kmod_list_foreach_reverse(list_entry, first_entry) \ argument
82 …for (list_entry = (((first_entry) == NULL) ? NULL : container_of(first_entry->node.prev, struct km…
83 list_entry != NULL; \
84 list_entry = ((list_entry == first_entry) ? NULL : \
85 container_of(list_entry->node.prev, struct kmod_list, node)))
/external/ltp/utils/ffsb-6.0-rc2/
Dlist.h35 #define list_entry(ptr, type, member) \ macro
39 for (pos = list_entry((head)->next, typeof(*pos), member); \
41 pos = list_entry(pos->member.next, typeof(*pos), member))
44 for (pos = list_entry((head)->next, typeof(*pos), member), \
45 n = list_entry(pos->member.next, typeof(*pos), member); \
47 pos = n, n = list_entry(n->member.next, typeof(*n), member))
/external/syslinux/gpxe/src/include/gpxe/
Dlist.h141 #define list_entry( ptr, type, member ) \ macro
161 for ( pos = list_entry ( (head)->next, typeof ( *pos ), member ); \
163 pos = list_entry ( pos->member.next, typeof ( *pos ), member ) )
174 for ( pos = list_entry ( (head)->next, typeof ( *pos ), member ), \
175 tmp = list_entry ( pos->member.next, typeof ( *tmp ), member ); \
178 tmp = list_entry ( tmp->member.next, typeof ( *tmp ), member ) )
/external/f2fs-tools/include/
Dlist.h71 #define list_entry(ptr, type, member) \ macro
81 for (pos = list_entry((head)->next, typeof(*pos), member); \
83 pos = list_entry(pos->member.next, typeof(*pos), member))
85 for (pos = list_entry((head)->next, typeof(*pos), member), \
86 n = list_entry(pos->member.next, typeof(*pos), member); \
88 pos = n, n = list_entry(n->member.next, typeof(*n), member))
/external/iptables/libiptc/
Dlinux_list.h330 #define list_entry(ptr, type, member) \ macro
381 for (pos = list_entry((head)->next, typeof(*pos), member), \
384 pos = list_entry(pos->member.next, typeof(*pos), member), \
394 for (pos = list_entry((head)->prev, typeof(*pos), member), \
397 pos = list_entry(pos->member.prev, typeof(*pos), member), \
408 ((pos) ? : list_entry(head, typeof(*pos), member))
418 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
421 pos = list_entry(pos->member.next, typeof(*pos), member), \
432 for (pos = list_entry((head)->next, typeof(*pos), member), \
433 n = list_entry(pos->member.next, typeof(*pos), member); \
[all …]
Dlibiptc.c628 c2 = list_entry(next, struct chain_head, list); in iptcc_chain_index_delete_chain()
706 struct chain_head *c = list_entry(pos, struct chain_head, list); in iptcc_find_chain_by_offset()
731 struct chain_head *c = list_entry(pos, struct chain_head, list); in iptcc_find_label()
754 test_c=list_entry(test_pos, struct chain_head,list); in iptcc_find_label()
755 tmp_c =list_entry(list_start_pos,struct chain_head,list); in iptcc_find_label()
771 struct chain_head *c = list_entry(pos, struct chain_head, list); in iptcc_find_label()
912 ctail = list_entry(tail, struct chain_head, list); in __iptcc_p_add_chain()
1462 list_entry(c->list.next, struct chain_head, list); in iptcc_chain_iterator_advance()
1469 struct chain_head *c = list_entry(handle->chains.next, in TC_FIRST_CHAIN()
1529 r = list_entry(c->rules.next, struct rule_head, list); in TC_FIRST_RULE()
[all …]
/external/libnetfilter_conntrack/include/internal/
Dlinux_list.h335 #define list_entry(ptr, type, member) \ macro
386 for (pos = list_entry((head)->next, typeof(*pos), member), \
389 pos = list_entry(pos->member.next, typeof(*pos), member), \
399 for (pos = list_entry((head)->prev, typeof(*pos), member), \
402 pos = list_entry(pos->member.prev, typeof(*pos), member), \
413 ((pos) ? : list_entry(head, typeof(*pos), member))
423 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
426 pos = list_entry(pos->member.next, typeof(*pos), member), \
437 for (pos = list_entry((head)->next, typeof(*pos), member), \
438 n = list_entry(pos->member.next, typeof(*pos), member); \
[all …]
/external/libnfnetlink/include/
Dlinux_list.h334 #define list_entry(ptr, type, member) \ macro
385 for (pos = list_entry((head)->next, typeof(*pos), member), \
388 pos = list_entry(pos->member.next, typeof(*pos), member), \
398 for (pos = list_entry((head)->prev, typeof(*pos), member), \
401 pos = list_entry(pos->member.prev, typeof(*pos), member), \
412 ((pos) ? : list_entry(head, typeof(*pos), member))
422 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
425 pos = list_entry(pos->member.next, typeof(*pos), member), \
436 for (pos = list_entry((head)->next, typeof(*pos), member), \
437 n = list_entry(pos->member.next, typeof(*pos), member); \
[all …]
/external/e2fsprogs/lib/blkid/
Dcache.c75 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
130 blkid_dev dev = list_entry(cache->bic_devs.next, in blkid_put_cache()
137 blkid_tag tag = list_entry(cache->bic_tags.next, in blkid_put_cache()
142 blkid_tag bad = list_entry(tag->bit_names.next, in blkid_put_cache()
166 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_gc_cache()
Ddev.c44 blkid_tag tag = list_entry(dev->bid_tags.next, in blkid_free_dev()
78 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags); in blkid_debug_dump_dev()
165 dev = list_entry(iter->p, struct blkid_struct_dev, bid_devs); in blkid_dev_next()
Dtag.c76 blkid_tag tmp = list_entry(p, struct blkid_struct_tag, in blkid_find_tag_dev()
114 tmp = list_entry(p, struct blkid_struct_tag, bit_tags); in blkid_find_head_cache()
308 tag = list_entry(iter->p, struct blkid_struct_tag, bit_tags); in blkid_tag_next()
353 blkid_tag tmp = list_entry(p, struct blkid_struct_tag, in blkid_find_dev_with_tag()
Dsave.c51 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags); in save_dev()
132 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_flush_cache()
Ddevname.c61 tmp = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_get_dev()
97 dev2 = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_get_dev()
194 blkid_dev tmp = list_entry(p, struct blkid_struct_dev, in probe_one()
477 tmp = list_entry(p, struct blkid_struct_dev, in probe_all()
/external/blktrace/btt/
Ddevs.c68 dip = list_entry(p, struct d_info, hash_head); in __dip_find()
101 struct d_info *dip = list_entry(p, struct d_info, all_head); in dip_exit()
194 this = list_entry(p, struct io, f_head); in dip_foreach()
217 func(list_entry(p, struct d_info, all_head), arg); in dip_foreach_out()
276 struct d_info *dip = list_entry(p, struct d_info, all_head); in dip_cleanup()
Ddevmap.c55 struct devmap *dmp = list_entry(p, struct devmap, head); in dev_map_find()
87 struct devmap *dmp = list_entry(p, struct devmap, head); in dev_map_exit()
Dmisc.c54 struct file_info *fip = list_entry(p, struct file_info, head); in clean_files()
71 struct buf_info *bip = list_entry(p, struct buf_info, head); in clean_bufs()
Dinlines.h40 rip = list_entry(p, struct range_info, head); in __region_exit()
56 rip = list_entry(head_p->prev, struct range_info, head); in update_range()
155 iop = list_entry(p, struct io, a_head); in io_free_all()
361 return list_entry(head->next, struct io, f_head); in io_first_list()
/external/syslinux/com32/elflink/ldlinux/
Dcli.c70 last_found = list_entry(cli_history_head.next, typeof(*last_found), list); in cmd_reverse_search()
84 last_found = list_entry(last_found->list.next, typeof(*last_found), list); in cmd_reverse_search()
100 last_found = list_entry(last_found->list.next, typeof(*last_found), list); in cmd_reverse_search()
354 list_entry(next, typeof(*comm_counter), list); in edit_cmdline()
376 list_entry(prev, typeof(*comm_counter), list); in edit_cmdline()
/external/libusb/include/libusb/
Dlibusbi.h86 #define list_entry(ptr, type, member) \ macro
90 list_entry((ptr)->next, type, member)
99 for (pos = list_entry((head)->next, type, member); \
101 pos = list_entry(pos->member.next, type, member))
104 for (pos = list_entry((head)->next, type, member), \
105 n = list_entry(pos->member.next, type, member); \
107 pos = n, n = list_entry(n->member.next, type, member))
/external/libusb/libusb/
Dlibusbi.h86 #define list_entry(ptr, type, member) \ macro
90 list_entry((ptr)->next, type, member)
99 for (pos = list_entry((head)->next, type, member); \
101 pos = list_entry(pos->member.next, type, member))
104 for (pos = list_entry((head)->next, type, member), \
105 n = list_entry(pos->member.next, type, member); \
107 pos = n, n = list_entry(n->member.next, type, member))
/external/blktrace/
Dblktrace.c912 struct devpath *dpp = list_entry(p, struct devpath, head); in net_send_drops()
1045 struct devpath *dpp = list_entry(p, struct devpath, head); in setup_buts()
1069 struct devpath *dpp = list_entry(p, struct devpath, head); in start_buts()
1111 struct devpath *dpp = list_entry(p, struct devpath, head); in get_all_drops()
1156 struct devpath *dpp = list_entry(p, struct devpath, head); in setup_tracer_devpaths()
1240 struct devpath *dpp = list_entry(p, struct devpath, head); in rel_devpaths()
1276 tbp = list_entry(p, struct trace_buf, head); in handle_list_net()
1333 tbp = list_entry(p, struct trace_buf, head); in handle_list_file()
1395 struct devpath *dpp = list_entry(p, struct devpath, head); in __process_trace_bufs()
1612 struct devpath *dpp = list_entry(p, struct devpath, head); in open_ios()
[all …]
/external/blktrace/btreplay/
Dbtreplay.c568 dip = list_entry(p, struct dev_info, head); in add_input_dev()
657 struct map_dev *mdp = list_entry(p, struct map_dev, head); in release_map_devs()
678 struct map_dev *mdp = list_entry(p, struct map_dev, head); in map_dev()
838 struct iocb_pkt *iocbp = list_entry(p, struct iocb_pkt, head); in tip_release()
952 rem_input_file(list_entry(p, struct thr_info, head)); in rem_input_files()
991 __find_input_files(list_entry(p, struct dev_info, head)); in find_input_files()
1235 iocbp = list_entry(tip->free_iocbs.next, struct iocb_pkt, head); in iocbs_map()
1605 tip_init(list_entry(p, struct thr_info, head)); in main()

12