/external/f2fs-tools/include/ |
D | list.h | 71 #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/ |
D | linux_list.h | 330 #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 …]
|
D | libiptc.c | 628 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/e2fsprogs/lib/blkid/ |
D | cache.c | 77 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs); 132 blkid_dev dev = list_entry(cache->bic_devs.next, in blkid_put_cache() 139 blkid_tag tag = list_entry(cache->bic_tags.next, in blkid_put_cache() 144 blkid_tag bad = list_entry(tag->bit_names.next, in blkid_put_cache() 168 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_gc_cache()
|
D | dev.c | 43 blkid_tag tag = list_entry(dev->bid_tags.next, in blkid_free_dev() 77 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags); in blkid_debug_dump_dev() 164 dev = list_entry(iter->p, struct blkid_struct_dev, bid_devs); in blkid_dev_next()
|
D | tag.c | 75 blkid_tag tmp = list_entry(p, struct blkid_struct_tag, in blkid_find_tag_dev() 113 tmp = list_entry(p, struct blkid_struct_tag, bit_tags); in blkid_find_head_cache() 307 tag = list_entry(iter->p, struct blkid_struct_tag, bit_tags); in blkid_tag_next() 352 blkid_tag tmp = list_entry(p, struct blkid_struct_tag, in blkid_find_dev_with_tag()
|
D | save.c | 46 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags); in save_dev() 121 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_flush_cache()
|
D | devname.c | 57 tmp = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_get_dev() 95 dev2 = list_entry(p, struct blkid_struct_dev, bid_devs); in blkid_get_dev() 192 blkid_dev tmp = list_entry(p, struct blkid_struct_dev, in probe_one() 475 tmp = list_entry(p, struct blkid_struct_dev, in probe_all()
|
D | list.h | 148 #define list_entry(ptr, type, member) \ macro
|
D | read.c | 464 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags); in debug_dump_dev()
|
/external/libusb/libusb/ |
D | libusbi.h | 48 #define list_entry(ptr, type, member) \ macro 57 for (pos = list_entry((head)->next, typeof(*pos), member); \ 59 pos = list_entry(pos->member.next, typeof(*pos), member)) 62 for (pos = list_entry((head)->next, typeof(*pos), member), \ 63 n = list_entry(pos->member.next, typeof(*pos), member); \ 65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
|
/external/blktrace/btt/ |
D | devs.c | 68 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()
|
D | devmap.c | 55 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()
|
D | misc.c | 54 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()
|
D | inlines.h | 40 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()
|
D | trace_issue.c | 41 struct io *q_iop = list_entry(p, struct io, f_head); in handle_issue()
|
D | list.h | 146 #define list_entry(ptr, type, member) \ macro
|
D | trace_complete.c | 68 struct io *q_iop = list_entry(p, struct io, f_head); in handle_complete()
|
D | iostat.c | 205 dip = list_entry(p, struct d_info, all_head); in iostat_dump_stats()
|
/external/blktrace/ |
D | blktrace.c | 912 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/chromium-trace/catapult/tracing/tracing_build/ |
D | update_gypi.py | 91 list_entry = existing_list_as_string.splitlines()[0] 92 prefix, _, suffix = list_entry.split("'")
|
/external/blktrace/btreplay/ |
D | btreplay.c | 568 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()
|
D | btrecord.c | 335 struct ifile_info *iip = list_entry(p, struct ifile_info, head); in add_input_file() 786 process(list_entry(p, struct ifile_info, head)); in main()
|
/external/squashfs-tools/kernel/fs/squashfs/ |
D | squashfs.h | 32 return list_entry(inode, struct squashfs_inode_info, vfs_inode); in squashfs_i()
|
/external/e2fsprogs/lib/ext2fs/ |
D | kernel-list.h | 103 #define list_entry(ptr, type, member) \ macro
|