30     QTAILQ_FOREACH(p, &list->head, next) {  in memory_mapping_list_add_mapping_sorted()
36     QTAILQ_INSERT_TAIL(&list->head, mapping, next);  in memory_mapping_list_add_mapping_sorted()
114     if (QTAILQ_EMPTY(&list->head)) {  in memory_mapping_list_add_merge_sorted()
127     QTAILQ_FOREACH(memory_mapping, &list->head, next) {  in memory_mapping_list_add_merge_sorted()
159     QTAILQ_FOREACH_SAFE(p, &list->head, next, q) {  in memory_mapping_list_free()
160         QTAILQ_REMOVE(&list->head, p, next);  in memory_mapping_list_free()
172     QTAILQ_INIT(&list->head);  in memory_mapping_list_init()
179     QTAILQ_FOREACH_SAFE(p, &list->head, next, q) {  in guest_phys_blocks_free()
180         QTAILQ_REMOVE(&list->head, p, next);  in guest_phys_blocks_free()
190     QTAILQ_INIT(&list->head);  in guest_phys_blocks_init()
208     if (!QTAILQ_EMPTY(&g->list->head)) {  in guest_phys_block_add_section()
211         predecessor = QTAILQ_LAST(&g->list->head);  in guest_phys_block_add_section()
235         QTAILQ_INSERT_TAIL(&g->list->head, block, next);  in guest_phys_block_add_section()
332     QTAILQ_FOREACH(block, &guest_phys_blocks->head, next) {  in qemu_get_guest_memory_mapping()
345     QTAILQ_FOREACH(block, &guest_phys_blocks->head, next) {  in qemu_get_guest_simple_memory_mapping()
356     QTAILQ_FOREACH_SAFE(cur, &list->head, next, next) {  in memory_mapping_filter()
358             QTAILQ_REMOVE(&list->head, cur, next);  in memory_mapping_filter()