P2M_ENTRIES_PER_PAGE  125 arch/x86/xen/mmu.c #define TOP_ENTRIES		(MAX_DOMAIN_PAGES / P2M_ENTRIES_PER_PAGE)
P2M_ENTRIES_PER_PAGE  128 arch/x86/xen/mmu.c static unsigned long p2m_missing[P2M_ENTRIES_PER_PAGE] __page_aligned_data =
P2M_ENTRIES_PER_PAGE  129 arch/x86/xen/mmu.c 		{ [ 0 ... P2M_ENTRIES_PER_PAGE-1 ] = ~0UL };
P2M_ENTRIES_PER_PAGE  138 arch/x86/xen/mmu.c static unsigned long p2m_top_mfn_list[TOP_ENTRIES / P2M_ENTRIES_PER_PAGE]
P2M_ENTRIES_PER_PAGE  144 arch/x86/xen/mmu.c 	return pfn / P2M_ENTRIES_PER_PAGE;
P2M_ENTRIES_PER_PAGE  149 arch/x86/xen/mmu.c 	return pfn % P2M_ENTRIES_PER_PAGE;
P2M_ENTRIES_PER_PAGE  157 arch/x86/xen/mmu.c 	for(pfn = 0; pfn < MAX_DOMAIN_PAGES; pfn += P2M_ENTRIES_PER_PAGE) {
P2M_ENTRIES_PER_PAGE  164 arch/x86/xen/mmu.c 		unsigned topidx = idx * P2M_ENTRIES_PER_PAGE;
P2M_ENTRIES_PER_PAGE  182 arch/x86/xen/mmu.c 	for(pfn = 0; pfn < max_pfn; pfn += P2M_ENTRIES_PER_PAGE) {
P2M_ENTRIES_PER_PAGE  210 arch/x86/xen/mmu.c 	for(i = 0; i < P2M_ENTRIES_PER_PAGE; i++)