/* * MMU operations common to all auto-translated physmap guests. * * Copyright (C) 2015 Citrix Systems R&D Ltd. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License version 2 * as published by the Free Software Foundation; or, when distributed * separately from the Linux kernel or incorporated into other * software packages, subject to the following license: * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this source file (the "Software"), to deal in the Software without * restriction, including without limitation the rights to use, copy, modify, * merge, publish, distribute, sublicense, and/or sell copies of the Software, * and to permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS * IN THE SOFTWARE.
*/ #include <linux/kernel.h> #include <linux/mm.h> #include <linux/slab.h> #include <linux/vmalloc.h>
/* Break down the pages in 4KB chunk and call fn for each gfn */ staticvoid xen_for_each_gfn(struct page **pages, unsigned nr_gfn,
xen_gfn_fn_t fn, void *data)
{ unsignedlong xen_pfn = 0; struct page *page; int i;
for (i = 0; i < nr_gfn; i++) { if ((i % XEN_PFN_PER_PAGE) == 0) {
page = pages[i / XEN_PFN_PER_PAGE];
xen_pfn = page_to_xen_pfn(page);
}
fn(pfn_to_gfn(xen_pfn++), data);
}
}
struct remap_data {
xen_pfn_t *fgfn; /* foreign domain's gfn */ int nr_fgfn; /* Number of foreign gfn left to map */
pgprot_t prot;
domid_t domid; struct vm_area_struct *vma; int index; struct page **pages; struct xen_remap_gfn_info *info; int *err_ptr; int mapped;
/* Hypercall parameters */ int h_errs[XEN_PFN_PER_PAGE];
xen_ulong_t h_idxs[XEN_PFN_PER_PAGE];
xen_pfn_t h_gpfns[XEN_PFN_PER_PAGE];
/* info->err_ptr expect to have one error status per Xen PFN */ for (i = 0; i < nr_gfn; i++) { int err = (rc < 0) ? rc : info->h_errs[i];
*(info->err_ptr++) = err; if (!err)
info->mapped++;
}
/* * Note: The hypercall will return 0 in most of the case if even if * all the fgmfn are not mapped. We still have to update the pte * as the userspace may decide to continue.
*/ if (!rc)
set_pte_at(info->vma->vm_mm, addr, ptep, pte);
return 0;
}
int xen_xlate_remap_gfn_array(struct vm_area_struct *vma, unsignedlong addr,
xen_pfn_t *gfn, int nr, int *err_ptr, pgprot_t prot, unsigned domid, struct page **pages)
{ int err; struct remap_data data; unsignedlong range = DIV_ROUND_UP(nr, XEN_PFN_PER_PAGE) << PAGE_SHIFT;
/* Kept here for the purpose of making sure code doesn't break
x86 PVOPS */
BUG_ON(!((vma->vm_flags & (VM_PFNMAP | VM_IO)) == (VM_PFNMAP | VM_IO)));
/** * xen_xlate_map_ballooned_pages - map a new set of ballooned pages * @gfns: returns the array of corresponding GFNs * @virt: returns the virtual address of the mapped region * @nr_grant_frames: number of GFNs * @return 0 on success, error otherwise * * This allocates a set of ballooned pages and maps them into the * kernel's address space.
*/ int __init xen_xlate_map_ballooned_pages(xen_pfn_t **gfns, void **virt, unsignedlong nr_grant_frames)
{ struct page **pages;
xen_pfn_t *pfns; void *vaddr; struct map_balloon_pages data; int rc; unsignedlong nr_pages;
/* Used by the privcmd module, but has to be built-in on ARM */ int xen_remap_vma_range(struct vm_area_struct *vma, unsignedlong addr, unsignedlong len)
{ struct remap_pfn r = {
.mm = vma->vm_mm,
.pages = vma->vm_private_data,
.prot = vma->vm_page_prot,
};
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.