HomeSort by relevance Sort by last modified time
    Searched refs:list_entry (Results 1 - 25 of 231) sorted by null

1 2 3 4 5 6 7 8 910

  /external/syslinux/com32/include/linux/
list.h 246 * list_entry - get the struct for this entry
251 #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)
    [all...]
  /external/ltp/utils/ffsb-6.0-rc2/
list.h 35 #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/ltp/testcases/realtime/include/
list.h 258 * list_entry - get the struct for this entry
263 #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),
    [all...]
  /external/f2fs-tools/include/
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/syslinux/gpxe/src/include/gpxe/
list.h 141 #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/kmod/libkmod/
libkmod.h 91 #define kmod_list_foreach(list_entry, first_entry) \
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) \
97 for (list_entry = kmod_list_last(first_entry); \
98 list_entry != NULL; \
99 list_entry = kmod_list_prev(first_entry, list_entry))
    [all...]
libkmod-internal.h 74 #define kmod_list_foreach(list_entry, first_entry) \
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) \
82 for (list_entry = (((first_entry) == NULL) ? NULL : container_of(first_entry->node.prev, struct kmod_list, node)); \
83 list_entry != NULL; \
84 list_entry = ((list_entry == first_entry) ? NULL :
    [all...]
  /external/blktrace/btt/
devmap.c 55 struct devmap *dmp = list_entry(p, struct devmap, head);
87 struct devmap *dmp = list_entry(p, struct devmap, head);
misc.c 54 struct file_info *fip = list_entry(p, struct file_info, head);
71 struct buf_info *bip = list_entry(p, struct buf_info, head);
devs.c 68 dip = list_entry(p, struct d_info, hash_head);
101 struct d_info *dip = list_entry(p, struct d_info, all_head);
194 this = list_entry(p, struct io, f_head);
217 func(list_entry(p, struct d_info, all_head), arg);
276 struct d_info *dip = list_entry(p, struct d_info, all_head);
trace_issue.c 41 struct io *q_iop = list_entry(p, struct io, f_head);
  /external/e2fsprogs/lib/blkid/
cache.c 75 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
130 blkid_dev dev = list_entry(cache->bic_devs.next,
137 blkid_tag tag = list_entry(cache->bic_tags.next,
142 blkid_tag bad = list_entry(tag->bit_names.next,
166 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
dev.c 44 blkid_tag tag = list_entry(dev->bid_tags.next,
78 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags);
165 dev = list_entry(iter->p, struct blkid_struct_dev, bid_devs);
save.c 51 blkid_tag tag = list_entry(p, struct blkid_struct_tag, bit_tags);
132 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
tag.c 76 blkid_tag tmp = list_entry(p, struct blkid_struct_tag,
114 tmp = list_entry(p, struct blkid_struct_tag, bit_tags);
308 tag = list_entry(iter->p, struct blkid_struct_tag, bit_tags);
353 blkid_tag tmp = list_entry(p, struct blkid_struct_tag,
  /external/iptables/libiptc/
linux_list.h 325 * list_entry - get the struct for this entry
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),
    [all...]
  /external/libnetfilter_conntrack/include/internal/
linux_list.h 330 * list_entry - get the struct for this entry
335 #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),
    [all...]
  /external/libnfnetlink/include/
linux_list.h 329 * list_entry - get the struct for this entry
334 #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),
    [all...]
  /external/squashfs-tools/kernel/fs/squashfs/
squashfs.h 32 return list_entry(inode, struct squashfs_inode_info, vfs_inode);
  /external/libusb/libusb/
libusbi.h 86 #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))
    [all...]
  /external/syslinux/com32/elflink/ldlinux/
cli.c 70 last_found = list_entry(cli_history_head.next, typeof(*last_found), list);
84 last_found = list_entry(last_found->list.next, typeof(*last_found), list);
100 last_found = list_entry(last_found->list.next, typeof(*last_found), list);
354 list_entry(next, typeof(*comm_counter), list);
376 list_entry(prev, typeof(*comm_counter), list);
  /external/e2fsprogs/lib/ext2fs/
kernel-list.h 103 #define list_entry(ptr, type, member) \ macro
  /development/ndk/platforms/android-9/include/linux/sunrpc/
sched.h 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
  /prebuilts/ndk/r10/platforms/android-12/arch-arm/usr/include/linux/sunrpc/
sched.h 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
  /prebuilts/ndk/r10/platforms/android-12/arch-mips/usr/include/linux/sunrpc/
sched.h 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)

Completed in 734 milliseconds

1 2 3 4 5 6 7 8 910