Home
last modified time | relevance | path

Searched refs:e_list (Results 1 – 4 of 4) sorted by relevance

/openbmc/linux/fs/
H A Dmbcache.c92 INIT_LIST_HEAD(&entry->e_list); in mb_cache_entry_create()
118 list_add_tail(&entry->e_list, &cache->c_list); in mb_cache_entry_create()
271 if (!list_empty(&entry->e_list)) in mb_cache_entry_delete_or_get()
272 list_del_init(&entry->e_list); in mb_cache_entry_delete_or_get()
312 struct mb_cache_entry, e_list); in mb_cache_shrink()
317 list_move_tail(&entry->e_list, &cache->c_list); in mb_cache_shrink()
320 list_del_init(&entry->e_list); in mb_cache_shrink()
415 list_for_each_entry_safe(entry, next, &cache->c_list, e_list) { in mb_cache_destroy()
416 list_del(&entry->e_list); in mb_cache_destroy()
/openbmc/linux/drivers/usb/mon/
H A Dmon_text.c83 struct list_head e_list; member
255 list_add_tail(&ep->e_link, &rp->e_list); in mon_text_event()
297 list_add_tail(&ep->e_link, &rp->e_list); in mon_text_error()
311 if (list_empty(&rp->e_list)) { in mon_text_fetch()
315 p = rp->e_list.next; in mon_text_fetch()
338 INIT_LIST_HEAD(&rp->e_list); in mon_text_open()
668 while (!list_empty(&rp->e_list)) { in mon_text_release()
669 p = rp->e_list.next; in mon_text_release()
/openbmc/linux/include/linux/
H A Dmbcache.h21 struct list_head e_list; member
/openbmc/linux/tools/testing/selftests/net/
H A Dipsec.c2066 char *e_list[] = { variable
2080 + (ARRAY_SIZE(ah_list) * ARRAY_SIZE(e_list)) \
2104 for (j = 0; j < ARRAY_SIZE(e_list); j++) { in write_proto_plan()
2106 e_list[j], 0, 0)) in write_proto_plan()