Home
last modified time | relevance | path

Searched refs:node (Results 1 – 2 of 2) sorted by relevance

/virt/kvm/
A Dvfio.c25 struct list_head node; member
126 list_for_each_entry(kvf, &kv->file_list, node) { in kvm_vfio_update_coherency()
162 list_for_each_entry(kvf, &kv->file_list, node) { in kvm_vfio_file_add()
176 list_add_tail(&kvf->node, &kv->file_list); in kvm_vfio_file_add()
202 list_for_each_entry(kvf, &kv->file_list, node) { in kvm_vfio_file_del()
206 list_del(&kvf->node); in kvm_vfio_file_del()
243 list_for_each_entry(kvf, &kv->file_list, node) { in kvm_vfio_file_set_spapr_tce()
329 list_for_each_entry_safe(kvf, tmp, &kv->file_list, node) { in kvm_vfio_release()
335 list_del(&kvf->node); in kvm_vfio_release()
A Dkvm_main.c558 node; \
559 node = interval_tree_iter_next(node, start, last)) \
588 struct interval_tree_node *node; in kvm_handle_hva_range() local
591 kvm_for_each_memslot_in_hva_range(node, slots, in kvm_handle_hva_range()
1477 struct rb_node **node, *parent; in kvm_insert_gfn_node() local
1481 for (node = &gfn_tree->rb_node; *node; ) { in kvm_insert_gfn_node()
1484 tmp = container_of(*node, struct kvm_memory_slot, gfn_node[idx]); in kvm_insert_gfn_node()
1485 parent = *node; in kvm_insert_gfn_node()
1487 node = &(*node)->rb_left; in kvm_insert_gfn_node()
1489 node = &(*node)->rb_right; in kvm_insert_gfn_node()
[all …]

Completed in 17 milliseconds