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

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
pointer-signext.c 16 } LIST_ENTRY;
20 LIST_ENTRY Link;
25 LIST_ENTRY *Link;
28 Link = (LIST_ENTRY *) param;
  /external/chromium_org/chrome_frame/crash_reporting/
nt_loader.cc 17 LIST_ENTRY* head = &peb->Ldr->InLoadOrderModuleList;
18 for (LIST_ENTRY* entry = head->Flink; entry != head; entry = entry->Flink) {
nt_loader.h 97 LIST_ENTRY InLoadOrderModuleList; // 0x00c
98 LIST_ENTRY InMemoryOrderModuleList; // 0x014
99 LIST_ENTRY InInitializationOrderModuleList; // 0x01c
117 LIST_ENTRY InLoadOrderLinks; // 0x000
118 LIST_ENTRY InMemoryOrderLinks; // 0x008
119 LIST_ENTRY InInitializationOrderLinks; // 0x010
129 LIST_ENTRY HashLinks; // 0x03c
  /external/chromium/third_party/libjingle/source/talk/third_party/libudev/
libudev.h 50 struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry);
51 struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name);
52 const char *udev_list_entry_get_name(struct udev_list_entry *list_entry);
53 const char *udev_list_entry_get_value(struct udev_list_entry *list_entry);
56 * @list_entry: entry to store the current position
61 #define udev_list_entry_foreach(list_entry, first_entry) \
62 for (list_entry = first_entry; \
63 list_entry != NULL; \
64 list_entry = udev_list_entry_get_next(list_entry))
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/third_party/libudev/
libudev.h 50 struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry);
51 struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name);
52 const char *udev_list_entry_get_name(struct udev_list_entry *list_entry);
53 const char *udev_list_entry_get_value(struct udev_list_entry *list_entry);
56 * @list_entry: entry to store the current position
61 #define udev_list_entry_foreach(list_entry, first_entry) \
62 for (list_entry = first_entry; \
63 list_entry != NULL; \
64 list_entry = udev_list_entry_get_next(list_entry))
    [all...]
  /external/e2fsprogs/lib/blkid/
cache.c 72 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
127 blkid_dev dev = list_entry(cache->bic_devs.next,
134 blkid_tag tag = list_entry(cache->bic_tags.next,
139 blkid_tag bad = list_entry(tag->bit_names.next,
163 blkid_dev dev = list_entry(p, struct blkid_struct_dev, bid_devs);
  /external/qemu/android/
adb-server.c 40 ACList list_entry; member in struct:AdbGuest
58 ACList list_entry; member in struct:AdbHost
117 alist_init(&adb_host->list_entry);
130 assert(alist_is_empty(&adb_host->list_entry));
211 alist_remove(&adb_host->list_entry);
216 alist_remove(&adb_guest->list_entry);
338 alist_init(&adb_guest->list_entry);
350 assert(alist_is_empty(&adb_guest->list_entry));
393 alist_insert_tail(&adb_srv->adb_guests, &adb_guest->list_entry);
394 alist_insert_tail(&adb_srv->adb_hosts, &adb_host->list_entry);
    [all...]
  /external/chromium_org/sandbox/win/src/
handle_closer.cc 129 HandleListEntry* list_entry = reinterpret_cast<HandleListEntry*>(output);
130 output = &list_entry->handle_type[0];
136 list_entry->offset_to_names = reinterpret_cast<char*>(output) -
137 reinterpret_cast<char*>(list_entry);
138 list_entry->name_count = i->second.size();
148 list_entry->record_bytes = reinterpret_cast<char*>(output) -
149 reinterpret_cast<char*>(list_entry);
  /external/linux-tools-perf/util/include/linux/added/
list.h 326 * list_entry - get the struct for this entry
331 #define list_entry(ptr, type, member) \ macro
343 list_entry((ptr)->next, type, member)
404 for (pos = list_entry((head)->next, typeof(*pos), member); \
406 pos = list_entry(pos->member.next, typeof(*pos), member))
415 for (pos = list_entry((head)->prev, typeof(*pos), member); \
417 pos = list_entry(pos->member.prev, typeof(*pos), member))
428 ((pos) ? : list_entry(head, typeof(*pos), member))
440 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
442 pos = list_entry(pos->member.next, typeof(*pos), member)
    [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);
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);
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);
  /external/oprofile/daemon/
opd_cookie.c 143 entry = list_entry(pos, struct cookie_entry, list);
166 entry = list_entry(pos, struct cookie_entry, list);
191 entry = list_entry(pos, struct cookie_entry, list);
  /external/kernel-headers/original/linux/
list.h 348 * list_entry - get the struct for this entry
353 #define list_entry(ptr, type, member) \ macro
404 for (pos = list_entry((head)->next, typeof(*pos), member); \
406 pos = list_entry(pos->member.next, typeof(*pos), member))
415 for (pos = list_entry((head)->prev, typeof(*pos), member); \
417 pos = list_entry(pos->member.prev, typeof(*pos), member))
428 ((pos) ? : list_entry(head, typeof(*pos), member))
440 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
442 pos = list_entry(pos->member.next, typeof(*pos), member))
454 pos = list_entry(pos->member.next, typeof(*pos), member)
    [all...]
  /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...]
  /bionic/libc/include/net/
if_ieee1394.h 94 LIST_ENTRY(ieee1394_reass_pkt) rp_next;
105 LIST_ENTRY(ieee1394_reassq) rq_node;
  /development/ndk/platforms/android-3/include/net/
if_ieee1394.h 94 LIST_ENTRY(ieee1394_reass_pkt) rp_next;
105 LIST_ENTRY(ieee1394_reassq) rq_node;
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_dirty_surfaces.h 62 struct util_dirty_surface *ds = LIST_ENTRY(struct util_dirty_surface, p, dirty_list);
77 struct util_dirty_surface *ds = LIST_ENTRY(struct util_dirty_surface, p, dirty_list);
  /external/mesa3d/src/gallium/auxiliary/util/
u_dirty_surfaces.h 62 struct util_dirty_surface *ds = LIST_ENTRY(struct util_dirty_surface, p, dirty_list);
77 struct util_dirty_surface *ds = LIST_ENTRY(struct util_dirty_surface, p, dirty_list);
  /external/oprofile/daemon/liblegacy/
opd_sample_files.c 51 sfile = list_entry(pos, struct opd_24_sfile, lru_next);
160 sfile = list_entry(pos, struct opd_24_sfile, lru_next);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
i2c.h 37 #define snd_i2c_device(n) list_entry(n, struct snd_i2c_device, list)
76 #define snd_i2c_slave_bus(n) list_entry(n, struct snd_i2c_bus, buses)
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/
i2c.h 37 #define snd_i2c_device(n) list_entry(n, struct snd_i2c_device, list)
76 #define snd_i2c_slave_bus(n) list_entry(n, struct snd_i2c_bus, buses)
  /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/net/
if_ieee1394.h 94 LIST_ENTRY(ieee1394_reass_pkt) rp_next;
105 LIST_ENTRY(ieee1394_reassq) rq_node;
  /prebuilts/ndk/4/platforms/android-4/arch-arm/usr/include/net/
if_ieee1394.h 94 LIST_ENTRY(ieee1394_reass_pkt) rp_next;
105 LIST_ENTRY(ieee1394_reassq) rq_node;
  /prebuilts/ndk/4/platforms/android-5/arch-arm/usr/include/net/
if_ieee1394.h 94 LIST_ENTRY(ieee1394_reass_pkt) rp_next;
105 LIST_ENTRY(ieee1394_reassq) rq_node;

Completed in 616 milliseconds

1 2 3 4 5 6 7 8 91011>>