Lines Matching defs:mfn

100  * distinct lists, ordered by increasing mfn.
1895 	mfn_t mfn;
1919 		if ((mfn = pfn_to_mfn(pp->p_pagenum)) < start_mfn)
1920 			start_mfn = mfn;
1993 	mfn_t	mfn = mfn_list[pp->p_pagenum];
2009 	while (mfn < mfn_list[look->p_pagenum]) {
2020 	if (mfn < mfn_list[(*poolp)->p_pagenum]) {
2075 pfn_t *contig_pfn_list = NULL;	/* list of contig pfns in ascending mfn order */
2101 	mfn_t mfn;
2108 		mfn = mfn_list[pfn];
2110 		 * See if next pfn is for a contig mfn
2112 		if (mfn_list[lapfn] != mfn + 1)
2137  * contiguous mfns.  The list is kept in ascending mfn order.
2206  * update to pfn<->mfn mappings.  So we have them destroy the list and lock
2237  * Update the contiguous pfn list in response to a pfn <-> mfn reassignment
2293 	 * Check if new mfn has adjacent mfns in the list
2336 	mfn_t mfn, max_mfn;
2367 	 * Get highest mfn on this platform, but limit to the 32 bit DMA max.
2371 	for (mfn = start_mfn; mfn < max_mfn; start_mfn = ++mfn) {
2372 		pfn = mfn_to_pfn(mfn);
2397 	mfn_t mfn = mfn_list[pp->p_pagenum];
2414 	if (!DOMAIN_IS_INITDOMAIN(xen_info) || mfn >= PFN_4GIG) {
2451 	mfn_t mfn, prev_mfn, start_mfn;
2478 		mfn = pfn_to_mfn(pfn);
2480 		 * Check if mfn is first one or contig to previous one and
2481 		 * if page corresponding to mfn is free and that mfn
2484 		if ((prev_mfn == 0 || mfn == prev_mfn + 1) &&
2486 		    !((mfn & pfnseg) < (start_mfn & pfnseg))) {
2492 				    mfn != P2ROUNDUP(mfn, pfnalign)) {
2502 				start_mfn = mfn;
2504 			prev_mfn = mfn;
2540 	mfn_t mfn, tmfn, hi_mfn, lo_mfn;
2576 		mfn = mfn_list[pp->p_pagenum];
2577 		if (hi_mfn < mfn)
2583 		if (lo_mfn > mfn)
2590 			tmfn = mfn - (minctg - 1);
2596 			if ((mfn & pfnseg) < (tmfn & pfnseg))
2608 			    mfn_list[pp_first->p_pagenum] != mfn + 1) {
3019  * Lock and return the page with the highest mfn that we can find.  last_mfn
3025  * is used when new mfn's have been added to the system - we will reset our
3026  * search if the new mfn's are higher than our current search position.