Searched refs:n (Results 1 – 2 of 2) sorted by relevance
26 int n = 0; in kvm_irq_map_gsi() local32 entries[n] = *e; in kvm_irq_map_gsi()33 ++n; in kvm_irq_map_gsi()37 return n; in kvm_irq_map_gsi()108 struct hlist_node *n; in free_irq_routing_table() local110 hlist_for_each_entry_safe(e, n, &rt->map[i], link) { in free_irq_routing_table()
2161 unsigned long n; in kvm_get_dirty_log() local2183 n = kvm_dirty_bitmap_bytes(*memslot); in kvm_get_dirty_log()2185 for (i = 0; !any && i < n/sizeof(long); ++i) in kvm_get_dirty_log()2224 unsigned long n; in kvm_get_dirty_log_protect() local2247 n = kvm_dirty_bitmap_bytes(memslot); in kvm_get_dirty_log_protect()2261 memset(dirty_bitmap_buffer, 0, n); in kvm_get_dirty_log_protect()2264 for (i = 0; i < n / sizeof(long); i++) { in kvm_get_dirty_log_protect()2285 if (copy_to_user(log->dirty_bitmap, dirty_bitmap_buffer, n)) in kvm_get_dirty_log_protect()2336 unsigned long i, n; in kvm_clear_dirty_log_protect() local2360 n = ALIGN(log->num_pages, BITS_PER_LONG) / 8; in kvm_clear_dirty_log_protect()[all …]
Completed in 15 milliseconds