Lines Matching refs:mfn
103 * distinct lists, ordered by increasing mfn.
1932 mfn_t mfn;
1956 if ((mfn = pfn_to_mfn(pp->p_pagenum)) < start_mfn)
1957 start_mfn = mfn;
2030 mfn_t mfn = mfn_list[pp->p_pagenum];
2046 while (mfn < mfn_list[look->p_pagenum]) {
2057 if (mfn < mfn_list[(*poolp)->p_pagenum]) {
2112 pfn_t *contig_pfn_list = NULL; /* list of contig pfns in ascending mfn order */
2138 mfn_t mfn;
2145 mfn = mfn_list[pfn];
2147 * See if next pfn is for a contig mfn
2149 if (mfn_list[lapfn] != mfn + 1)
2174 * contiguous mfns. The list is kept in ascending mfn order.
2243 * update to pfn<->mfn mappings. So we have them destroy the list and lock
2274 * Update the contiguous pfn list in response to a pfn <-> mfn reassignment
2330 * Check if new mfn has adjacent mfns in the list
2373 mfn_t mfn, max_mfn;
2404 * Get highest mfn on this platform, but limit to the 32 bit DMA max.
2408 for (mfn = start_mfn; mfn < max_mfn; start_mfn = ++mfn) {
2409 pfn = mfn_to_pfn(mfn);
2434 mfn_t mfn = mfn_list[pp->p_pagenum];
2451 if (!DOMAIN_IS_INITDOMAIN(xen_info) || mfn >= PFN_4GIG) {
2488 mfn_t mfn, prev_mfn, start_mfn;
2515 mfn = pfn_to_mfn(pfn);
2517 * Check if mfn is first one or contig to previous one and
2518 * if page corresponding to mfn is free and that mfn
2521 if ((prev_mfn == 0 || mfn == prev_mfn + 1) &&
2523 !((mfn & pfnseg) < (start_mfn & pfnseg))) {
2529 mfn != P2ROUNDUP(mfn, pfnalign)) {
2539 start_mfn = mfn;
2541 prev_mfn = mfn;
2577 mfn_t mfn, tmfn, hi_mfn, lo_mfn;
2613 mfn = mfn_list[pp->p_pagenum];
2614 if (hi_mfn < mfn)
2620 if (lo_mfn > mfn)
2627 tmfn = mfn - (minctg - 1);
2633 if ((mfn & pfnseg) < (tmfn & pfnseg))
2645 mfn_list[pp_first->p_pagenum] != mfn + 1) {
3056 * Lock and return the page with the highest mfn that we can find. last_mfn
3062 * is used when new mfn's have been added to the system - we will reset our
3063 * search if the new mfn's are higher than our current search position.