map_list
list_add(&entry->list, &vde->map_list);
list_for_each_entry(entry, &vde->map_list, list) {
list_for_each_entry_safe(entry, tmp, &vde->map_list, list) {
while (!list_empty(&vde->map_list)) {
list_for_each_entry_safe(entry, tmp, &vde->map_list, list) {
list_for_each_entry(entry, &vde->map_list, list) {
INIT_LIST_HEAD(&vde->map_list);
struct list_head map_list;
struct list_head map_list; /* list of dma_mappings */
list_add(&dma_map->card_list, &cfile->map_list);
list_for_each_entry(m, &cfile->map_list, card_list) {
list_for_each_safe(node, next, &cfile->map_list) {
INIT_LIST_HEAD(&cfile->map_list);
INIT_LIST_HEAD(&bpf->map_list);
WARN_ON(!list_empty(&bpf->map_list));
struct list_head map_list;
list_add_tail(&nfp_map->l, &bpf->map_list);
struct map_list map[MAX_SKB_FRAGS+1];
struct list_head map_list;
node = list_first_entry_or_null(&xs->map_list, struct xsk_map_node,
INIT_LIST_HEAD(&xs->map_list);
list_add_tail(&node->node, &xs->map_list);
list_for_each_entry_safe(n, tmp, &xs->map_list, node) {
struct map_list *list = NULL, *entry;
entry = malloc(sizeof(struct map_list));
struct map_list *next;